1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/* bitvector.cpp
*
* Copyright (C) 2012 Ivan Klyuchnikov
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*! \addtogroup bitvector
* @{
*/
/*! \file bitvector.cpp
* \brief Additional functions for Osmocom bit vector abstraction.
*/
#include <bitvector.h>
extern "C" {
#include <osmocom/core/talloc.h>
}
void *bv_tall_ctx;
struct bitvec *bitvec_alloc(unsigned size)
{
struct bitvec *bv = talloc_zero(bv_tall_ctx, struct bitvec);
bv->data_len = size;
bv->cur_bit = 0;
bv->data = talloc_zero_array(bv_tall_ctx, uint8_t, size);
return bv;
}
void bitvec_free(struct bitvec *bv)
{
talloc_free(bv->data);
talloc_free(bv);
}
unsigned int bitvec_pack(struct bitvec *bv, uint8_t *buffer)
{
unsigned int i = 0;
for (i = 0; i < bv->data_len; i++)
{
buffer[i] = bv->data[i];
}
return i;
}
unsigned int bitvec_unpack(struct bitvec *bv, uint8_t *buffer)
{
unsigned int i = 0;
for (i = 0; i < bv->data_len; i++)
{
bv->data[i] = buffer[i];
}
return i;
}
int bitvec_unhex(struct bitvec *bv, const char* src)
{
unsigned val;
unsigned write_index = 0;
unsigned digits = bv->data_len*2;
for (unsigned i=0; i<digits; i++) {
if (sscanf(src+i, "%1x", &val) < 1) {
return 1;
}
bitvec_write_field(bv, write_index,val, 4);
}
return 0;
}
uint64_t bitvec_read_field(struct bitvec *bv, unsigned& read_index, unsigned len)
{
unsigned int i;
uint64_t ui = 0;
bv->cur_bit = read_index;
for (i = 0; i < len; i++) {
int bit = bitvec_get_bit_pos((const struct bitvec *)bv, bv->cur_bit);
if (bit < 0)
return bit;
if (bit)
ui |= ((uint64_t)1 << (len - i - 1));
bv->cur_bit++;
}
read_index += len;
return ui;
}
int bitvec_write_field(struct bitvec *bv, unsigned& write_index, uint64_t val, unsigned len)
{
unsigned int i;
int rc;
bv->cur_bit = write_index;
for (i = 0; i < len; i++) {
int bit = 0;
if (val & ((uint64_t)1 << (len - i - 1)))
bit = 1;
rc = bitvec_set_bit(bv, (bit_value)bit);
if (rc)
return rc;
}
write_index += len;
return 0;
}
int bitvec_write_field_lh(struct bitvec *bv, unsigned& write_index,
uint64_t val, unsigned len)
{
unsigned int i;
int rc;
bv->cur_bit = write_index;
for (i = 0; i < len; i++) {
bit_value bit = L;
if (val & ((uint64_t)1 << (len - i - 1)))
bit = H;
rc = bitvec_set_bit(bv, bit);
if (rc)
return rc;
}
write_index += len;
return 0;
}
|
