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 ***************************************************************************/
23 #ifndef BINARYBUFFER_H
24 #define BINARYBUFFER_H
29 * Support functions to access arbitrary bits in a byte array
32 /* inlining this will help show what fn that is taking time during profiling. */
33 static inline void buf_set_u32(uint8_t* buffer,
34 unsigned int first, unsigned int num, uint32_t value)
36 if ((num == 32) && (first == 0)) {
37 buffer[3] = (value >> 24) & 0xff;
38 buffer[2] = (value >> 16) & 0xff;
39 buffer[1] = (value >> 8) & 0xff;
40 buffer[0] = (value >> 0) & 0xff;
43 for (i = first; i < first + num; i++)
45 if (((value >> (i - first)) & 1) == 1)
46 buffer[i / 8] |= 1 << (i % 8);
48 buffer[i / 8] &= ~(1 << (i % 8));
52 static inline uint32_t buf_get_u32(const uint8_t* buffer,
53 unsigned int first, unsigned int num)
55 if ((num == 32) && (first == 0)) {
56 return (((uint32_t)buffer[3]) << 24) |
57 (((uint32_t)buffer[2]) << 16) |
58 (((uint32_t)buffer[1]) << 8) |
59 (((uint32_t)buffer[0]) << 0);
63 for (i = first; i < first + num; i++)
65 if (((buffer[i / 8] >> (i % 8)) & 1) == 1)
66 result |= 1 << (i - first);
72 /// flip_u32 inverts the bit order inside a 32-bit word (31..0 -> 0..31)
73 uint32_t flip_u32(uint32_t value, unsigned int num);
75 int buf_cmp(const uint8_t *buf1, const uint8_t *buf2, int size);
76 int buf_cmp_mask(const uint8_t *buf1, const uint8_t *buf2,
77 const uint8_t *mask, int size);
78 uint8_t* buf_cpy(const uint8_t *from, uint8_t *to, int size);
80 uint8_t* buf_set_ones(uint8_t *buf, int count);
81 uint8_t* buf_set_buf(const uint8_t *src, int src_start,
82 uint8_t *dst, int dst_start, int len);
84 int str_to_buf(const char *str, int len,
85 uint8_t *bin_buf, int buf_size, int radix);
86 char* buf_to_str(const uint8_t *buf, int size, int radix);
88 #define CEIL(m, n) (((m) + (n) - 1) / (n))
90 /* read a uint32_t from a buffer in target memory endianness */
91 static inline uint32_t fast_target_buffer_get_u32(const uint8_t *p, int le)
93 return le ? le_to_h_u32(p) : be_to_h_u32(p);
96 #endif /* BINARYBUFFER_H */