1 /***************************************************************************
2 * Copyright (C) 2004, 2005 by Dominic Rath *
3 * Dominic.Rath@gmx.de *
5 * Copyright (C) 2007,2008 Øyvind Harboe *
6 * oyvind.harboe@zylin.com *
8 * This program is free software; you can redistribute it and/or modify *
9 * it under the terms of the GNU General Public License as published by *
10 * the Free Software Foundation; either version 2 of the License, or *
11 * (at your option) any later version. *
13 * This program is distributed in the hope that it will be useful, *
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
16 * GNU General Public License for more details. *
18 * You should have received a copy of the GNU General Public License *
19 * along with this program; if not, write to the *
20 * Free Software Foundation, Inc., *
21 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
22 ***************************************************************************/
28 #include "binarybuffer.h"
30 const unsigned char bit_reverse_table256
[] =
32 0x00, 0x80, 0x40, 0xC0, 0x20, 0xA0, 0x60, 0xE0, 0x10, 0x90, 0x50, 0xD0, 0x30, 0xB0, 0x70, 0xF0,
33 0x08, 0x88, 0x48, 0xC8, 0x28, 0xA8, 0x68, 0xE8, 0x18, 0x98, 0x58, 0xD8, 0x38, 0xB8, 0x78, 0xF8,
34 0x04, 0x84, 0x44, 0xC4, 0x24, 0xA4, 0x64, 0xE4, 0x14, 0x94, 0x54, 0xD4, 0x34, 0xB4, 0x74, 0xF4,
35 0x0C, 0x8C, 0x4C, 0xCC, 0x2C, 0xAC, 0x6C, 0xEC, 0x1C, 0x9C, 0x5C, 0xDC, 0x3C, 0xBC, 0x7C, 0xFC,
36 0x02, 0x82, 0x42, 0xC2, 0x22, 0xA2, 0x62, 0xE2, 0x12, 0x92, 0x52, 0xD2, 0x32, 0xB2, 0x72, 0xF2,
37 0x0A, 0x8A, 0x4A, 0xCA, 0x2A, 0xAA, 0x6A, 0xEA, 0x1A, 0x9A, 0x5A, 0xDA, 0x3A, 0xBA, 0x7A, 0xFA,
38 0x06, 0x86, 0x46, 0xC6, 0x26, 0xA6, 0x66, 0xE6, 0x16, 0x96, 0x56, 0xD6, 0x36, 0xB6, 0x76, 0xF6,
39 0x0E, 0x8E, 0x4E, 0xCE, 0x2E, 0xAE, 0x6E, 0xEE, 0x1E, 0x9E, 0x5E, 0xDE, 0x3E, 0xBE, 0x7E, 0xFE,
40 0x01, 0x81, 0x41, 0xC1, 0x21, 0xA1, 0x61, 0xE1, 0x11, 0x91, 0x51, 0xD1, 0x31, 0xB1, 0x71, 0xF1,
41 0x09, 0x89, 0x49, 0xC9, 0x29, 0xA9, 0x69, 0xE9, 0x19, 0x99, 0x59, 0xD9, 0x39, 0xB9, 0x79, 0xF9,
42 0x05, 0x85, 0x45, 0xC5, 0x25, 0xA5, 0x65, 0xE5, 0x15, 0x95, 0x55, 0xD5, 0x35, 0xB5, 0x75, 0xF5,
43 0x0D, 0x8D, 0x4D, 0xCD, 0x2D, 0xAD, 0x6D, 0xED, 0x1D, 0x9D, 0x5D, 0xDD, 0x3D, 0xBD, 0x7D, 0xFD,
44 0x03, 0x83, 0x43, 0xC3, 0x23, 0xA3, 0x63, 0xE3, 0x13, 0x93, 0x53, 0xD3, 0x33, 0xB3, 0x73, 0xF3,
45 0x0B, 0x8B, 0x4B, 0xCB, 0x2B, 0xAB, 0x6B, 0xEB, 0x1B, 0x9B, 0x5B, 0xDB, 0x3B, 0xBB, 0x7B, 0xFB,
46 0x07, 0x87, 0x47, 0xC7, 0x27, 0xA7, 0x67, 0xE7, 0x17, 0x97, 0x57, 0xD7, 0x37, 0xB7, 0x77, 0xF7,
47 0x0F, 0x8F, 0x4F, 0xCF, 0x2F, 0xAF, 0x6F, 0xEF, 0x1F, 0x9F, 0x5F, 0xDF, 0x3F, 0xBF, 0x7F, 0xFF
51 uint8_t* buf_cpy(const uint8_t *from
, uint8_t *to
, int size
)
53 unsigned int num_bytes
= CEIL(size
, 8);
59 for (i
= 0; i
< num_bytes
; i
++)
62 /* mask out bits that don't belong to the buffer */
65 to
[size
/ 8] &= (0xff >> (8 - (size
% 8)));
71 int buf_cmp(const uint8_t *buf1
, const uint8_t *buf2
, int size
)
73 int num_bytes
= CEIL(size
, 8);
79 for (i
= 0; i
< num_bytes
; i
++)
82 /* mask out bits that don't really belong to the buffer if size isn't a multiple of 8 bits */
83 if ((size
% 8) && (i
== num_bytes
-1 ))
85 if ((buf1
[i
] & ((1 << (size
% 8)) - 1)) != (buf2
[i
] & ((1 << (size
% 8)) - 1)))
90 if (buf1
[i
] != buf2
[i
])
98 int buf_cmp_mask(const uint8_t *buf1
, const uint8_t *buf2
, const uint8_t *mask
, int size
)
100 int num_bytes
= CEIL(size
, 8);
103 for (i
= 0; i
< num_bytes
; i
++)
106 /* mask out bits that don't really belong to the buffer if size isn't a multiple of 8 bits */
107 if ((size
% 8) && (i
== num_bytes
-1 ))
109 if ((buf1
[i
] & ((1 << (size
% 8)) - 1) & mask
[i
]) !=
110 (buf2
[i
] & ((1 << (size
% 8)) - 1) & mask
[i
]))
115 if ((buf1
[i
] & mask
[i
]) != (buf2
[i
] & mask
[i
]))
123 uint8_t* buf_set_ones(uint8_t *buf
, int count
)
125 int num_bytes
= CEIL(count
, 8);
128 for (i
= 0; i
< num_bytes
; i
++)
133 buf
[i
] = (1 << count
) - 1;
141 uint8_t* buf_set_buf(const uint8_t *src
, int src_start
, uint8_t *dst
, int dst_start
, int len
)
143 int src_idx
= src_start
, dst_idx
= dst_start
;
146 for (i
= 0; i
< len
; i
++)
148 if (((src
[src_idx
/8] >> (src_idx
% 8)) & 1) == 1)
149 dst
[dst_idx
/8] |= 1 << (dst_idx
%8);
151 dst
[dst_idx
/8] &= ~(1 << (dst_idx
%8));
159 u32
flip_u32(u32 value
, unsigned int num
)
163 c
= (bit_reverse_table256
[value
& 0xff] << 24) |
164 (bit_reverse_table256
[(value
>> 8) & 0xff] << 16) |
165 (bit_reverse_table256
[(value
>> 16) & 0xff] << 8) |
166 (bit_reverse_table256
[(value
>> 24) & 0xff]);
174 int ceil_f_to_u32(float x
)
178 if (x
< 0) /* return zero for negative numbers */
181 y
= x
; /* cut off fraction */
183 if ((x
- y
) > 0.0) /* if there was a fractional part, increase by one */
189 char* buf_to_str(const uint8_t *buf
, int buf_len
, int radix
)
191 const char *DIGITS
= "0123456789ABCDEF";
195 int b256_len
= CEIL(buf_len
, 8);
198 int j
; /* base-256 digits */
199 int i
; /* output digits (radix) */
203 factor
= 2.0; /* log(256) / log(16) = 2.0 */
205 else if (radix
== 10)
207 factor
= 2.40824; /* log(256) / log(10) = 2.40824 */
211 factor
= 2.66667; /* log(256) / log(8) = 2.66667 */
216 str_len
= ceil_f_to_u32(CEIL(buf_len
, 8) * factor
);
217 str
= calloc(str_len
+ 1, 1);
219 for (i
= b256_len
- 1; i
>= 0; i
--)
222 if ((i
== (buf_len
/ 8)) && (buf_len
% 8))
223 tmp
&= (0xff >> (8 - (buf_len
% 8)));
225 for (j
= str_len
; j
> 0; j
--)
227 tmp
+= (u32
)str
[j
-1] * 256;
228 str
[j
-1] = (uint8_t)(tmp
% radix
);
233 for (j
= 0; j
< str_len
; j
++)
234 str
[j
] = DIGITS
[(int)str
[j
]];
239 int str_to_buf(const char *str
, int str_len
, uint8_t *buf
, int buf_len
, int radix
)
247 int j
; /* base-256 digits */
248 int i
; /* input digits (ASCII) */
252 /* identify radix, and skip radix-prefix (0, 0x or 0X) */
253 if ((str
[0] == '0') && (str
[1] && ((str
[1] == 'x') || (str
[1] == 'X'))))
259 else if ((str
[0] == '0') && (str_len
!= 1))
272 factor
= 0.5; /* log(16) / log(256) = 0.5 */
273 else if (radix
== 10)
274 factor
= 0.41524; /* log(10) / log(256) = 0.41524 */
276 factor
= 0.375; /* log(8) / log(256) = 0.375 */
280 /* copy to zero-terminated buffer */
281 charbuf
= malloc(str_len
+ 1);
282 memcpy(charbuf
, str
, str_len
);
283 charbuf
[str_len
] = '\0';
285 /* number of digits in base-256 notation */
286 b256_len
= ceil_f_to_u32(str_len
* factor
);
287 b256_buf
= calloc(b256_len
, 1);
289 /* go through zero terminated buffer */
290 for (i
= 0; charbuf
[i
]; i
++)
293 if ((tmp
>= '0') && (tmp
<= '9'))
295 else if ((tmp
>= 'a') && (tmp
<= 'f'))
296 tmp
= (tmp
- 'a' + 10);
297 else if ((tmp
>= 'A') && (tmp
<= 'F'))
298 tmp
= (tmp
- 'A' + 10);
299 else continue; /* skip characters other than [0-9,a-f,A-F] */
301 if (tmp
>= (u32
)radix
)
302 continue; /* skip digits invalid for the current radix */
304 for (j
= 0; j
< b256_len
; j
++)
306 tmp
+= (u32
)b256_buf
[j
] * radix
;
307 b256_buf
[j
] = (uint8_t)(tmp
& 0xFF);
313 for (j
= 0; j
< CEIL(buf_len
, 8); j
++)
316 buf
[j
] = b256_buf
[j
];
321 /* mask out bits that don't belong to the buffer */
323 buf
[(buf_len
/ 8)] &= 0xff >> (8 - (buf_len
% 8));
331 int buf_to_u32_handler(uint8_t *in_buf
, void *priv
, struct scan_field_s
*field
)
335 *dest
= buf_get_u32(in_buf
, 0, 32);