blob: 0c77b279dcffbcea67b5f4c49c627096ba32e760 [file] [log] [blame]
Harald Welte468b6432014-09-11 13:05:51 +08001/*
2 * (C) 2011 by Harald Welte <laforge@gnumonks.org>
3 * (C) 2011 by Sylvain Munaut <tnt@246tNt.com>
4 *
5 * All Rights Reserved
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; if not, write to the Free Software Foundation, Inc.,
19 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 */
Harald Welte2230c132011-01-19 10:10:16 +010022
23#include <stdint.h>
24
Pablo Neira Ayuso83419342011-03-22 16:36:13 +010025#include <osmocom/core/bits.h>
Harald Welte2230c132011-01-19 10:10:16 +010026
Harald Welteba6988b2011-08-17 12:46:48 +020027/*! \addtogroup bits
28 * @{
29 */
30
31/*! \file bits.c
32 * \brief Osmocom bit level support code
33 */
34
35
36/*! \brief convert unpacked bits to packed bits, return length in bytes
37 * \param[out] out output buffer of packed bits
38 * \param[in] in input buffer of unpacked bits
39 * \param[in] num_bits number of bits
40 */
Harald Welte2230c132011-01-19 10:10:16 +010041int osmo_ubit2pbit(pbit_t *out, const ubit_t *in, unsigned int num_bits)
42{
43 unsigned int i;
44 uint8_t curbyte = 0;
45 pbit_t *outptr = out;
46
47 for (i = 0; i < num_bits; i++) {
48 uint8_t bitnum = 7 - (i % 8);
49
50 curbyte |= (in[i] << bitnum);
51
Christian Vogelc7f84e92011-01-22 22:48:37 +010052 if(i % 8 == 7){
Harald Welte2230c132011-01-19 10:10:16 +010053 *outptr++ = curbyte;
54 curbyte = 0;
55 }
56 }
57 /* we have a non-modulo-8 bitcount */
58 if (i % 8)
59 *outptr++ = curbyte;
60
61 return outptr - out;
62}
63
Maxe0a7d9e2016-06-17 17:58:52 +020064/*! \brief Shift unaligned input to octet-aligned output
65 * \param[out] out output buffer, unaligned
66 * \param[in] in input buffer, octet-aligned
67 * \param[in] num_nibbles number of nibbles
68 */
69void osmo_nibble_shift_right(uint8_t *out, const uint8_t *in,
70 unsigned int num_nibbles)
71{
72 unsigned int i, num_whole_bytes = num_nibbles / 2;
73 if (!num_whole_bytes)
74 return;
75
76 /* first byte: upper nibble empty, lower nibble from src */
77 out[0] = (in[0] >> 4);
78
79 /* bytes 1.. */
80 for (i = 1; i < num_whole_bytes; i++)
81 out[i] = ((in[i - 1] & 0xF) << 4) | (in[i] >> 4);
82
83 /* shift the last nibble, in case there's an odd count */
84 i = num_whole_bytes;
85 if (num_nibbles & 1)
86 out[i] = ((in[i - 1] & 0xF) << 4) | (in[i] >> 4);
87 else
88 out[i] = (in[i - 1] & 0xF) << 4;
89}
90
91/*! \brief Shift unaligned input to octet-aligned output
92 * \param[out] out output buffer, octet-aligned
93 * \param[in] in input buffer, unaligned
94 * \param[in] num_nibbles number of nibbles
95 */
96void osmo_nibble_shift_left_unal(uint8_t *out, const uint8_t *in,
97 unsigned int num_nibbles)
98{
99 unsigned int i, num_whole_bytes = num_nibbles / 2;
100 if (!num_whole_bytes)
101 return;
102
103 for (i = 0; i < num_whole_bytes; i++)
104 out[i] = ((in[i] & 0xF) << 4) | (in[i + 1] >> 4);
105
106 /* shift the last nibble, in case there's an odd count */
107 i = num_whole_bytes;
108 if (num_nibbles & 1)
109 out[i] = (in[i] & 0xF) << 4;
110}
111
Maxd8fb1422016-04-06 16:13:00 +0200112/*! \brief convert unpacked bits to soft bits
113 * \param[out] out output buffer of soft bits
114 * \param[in] in input buffer of unpacked bits
115 * \param[in] num_bits number of bits
116 */
117void osmo_ubit2sbit(sbit_t *out, const ubit_t *in, unsigned int num_bits)
118{
119 unsigned int i;
120 for (i = 0; i < num_bits; i++)
121 out[i] = in[i] ? -127 : 127;
122}
123
124/*! \brief convert soft bits to unpacked bits
125 * \param[out] out output buffer of unpacked bits
126 * \param[in] in input buffer of soft bits
127 * \param[in] num_bits number of bits
128 */
129void osmo_sbit2ubit(ubit_t *out, const sbit_t *in, unsigned int num_bits)
130{
131 unsigned int i;
132 for (i = 0; i < num_bits; i++)
133 out[i] = in[i] < 0;
134}
135
Harald Welteba6988b2011-08-17 12:46:48 +0200136/*! \brief convert packed bits to unpacked bits, return length in bytes
137 * \param[out] out output buffer of unpacked bits
138 * \param[in] in input buffer of packed bits
139 * \param[in] num_bits number of bits
Harald Welte2d2e2cc2016-04-25 12:11:20 +0200140 * \return number of bytes used in \ref out
Harald Welteba6988b2011-08-17 12:46:48 +0200141 */
Harald Welte2230c132011-01-19 10:10:16 +0100142int osmo_pbit2ubit(ubit_t *out, const pbit_t *in, unsigned int num_bits)
143{
144 unsigned int i;
145 ubit_t *cur = out;
146 ubit_t *limit = out + num_bits;
147
148 for (i = 0; i < (num_bits/8)+1; i++) {
149 pbit_t byte = in[i];
150 *cur++ = (byte >> 7) & 1;
151 if (cur >= limit)
152 break;
153 *cur++ = (byte >> 6) & 1;
154 if (cur >= limit)
155 break;
156 *cur++ = (byte >> 5) & 1;
157 if (cur >= limit)
158 break;
159 *cur++ = (byte >> 4) & 1;
160 if (cur >= limit)
161 break;
162 *cur++ = (byte >> 3) & 1;
163 if (cur >= limit)
164 break;
165 *cur++ = (byte >> 2) & 1;
166 if (cur >= limit)
167 break;
168 *cur++ = (byte >> 1) & 1;
169 if (cur >= limit)
170 break;
171 *cur++ = (byte >> 0) & 1;
172 if (cur >= limit)
173 break;
174 }
175 return cur - out;
176}
Sylvain Munautaeb10772011-01-21 12:22:30 +0100177
Harald Welteba6988b2011-08-17 12:46:48 +0200178/*! \brief convert unpacked bits to packed bits (extended options)
179 * \param[out] out output buffer of packed bits
180 * \param[in] out_ofs offset into output buffer
181 * \param[in] in input buffer of unpacked bits
182 * \param[in] in_ofs offset into input buffer
183 * \param[in] num_bits number of bits
184 * \param[in] lsb_mode Encode bits in LSB orde instead of MSB
185 * \returns length in bytes (max written offset of output buffer + 1)
186 */
Sylvain Munautaeb10772011-01-21 12:22:30 +0100187int osmo_ubit2pbit_ext(pbit_t *out, unsigned int out_ofs,
188 const ubit_t *in, unsigned int in_ofs,
189 unsigned int num_bits, int lsb_mode)
190{
191 int i, op, bn;
192 for (i=0; i<num_bits; i++) {
193 op = out_ofs + i;
194 bn = lsb_mode ? (op&7) : (7-(op&7));
195 if (in[in_ofs+i])
196 out[op>>3] |= 1 << bn;
197 else
198 out[op>>3] &= ~(1 << bn);
199 }
200 return ((out_ofs + num_bits - 1) >> 3) + 1;
201}
202
Harald Welteba6988b2011-08-17 12:46:48 +0200203/*! \brief convert packed bits to unpacked bits (extended options)
204 * \param[out] out output buffer of unpacked bits
205 * \param[in] out_ofs offset into output buffer
206 * \param[in] in input buffer of packed bits
207 * \param[in] in_ofs offset into input buffer
208 * \param[in] num_bits number of bits
209 * \param[in] lsb_mode Encode bits in LSB orde instead of MSB
210 * \returns length in bytes (max written offset of output buffer + 1)
211 */
Sylvain Munautaeb10772011-01-21 12:22:30 +0100212int osmo_pbit2ubit_ext(ubit_t *out, unsigned int out_ofs,
213 const pbit_t *in, unsigned int in_ofs,
214 unsigned int num_bits, int lsb_mode)
215{
216 int i, ip, bn;
217 for (i=0; i<num_bits; i++) {
218 ip = in_ofs + i;
219 bn = lsb_mode ? (ip&7) : (7-(ip&7));
220 out[out_ofs+i] = !!(in[ip>>3] & (1<<bn));
221 }
222 return out_ofs + num_bits;
223}
Harald Welteba6988b2011-08-17 12:46:48 +0200224
Harald Weltede6e4982012-12-06 21:25:27 +0100225/*! \brief generalized bit reversal function
226 * \param[in] x the 32bit value to be reversed
227 * \param[in] k the type of reversal requested
228 * \returns the reversed 32bit dword
229 *
230 * This function reverses the bit order within a 32bit word. Depending
231 * on "k", it either reverses all bits in a 32bit dword, or the bytes in
232 * the dword, or the bits in each byte of a dword, or simply swaps the
233 * two 16bit words in a dword. See Chapter 7 "Hackers Delight"
234 */
Harald Welte712691d2011-09-01 14:47:31 +0200235uint32_t osmo_bit_reversal(uint32_t x, enum osmo_br_mode k)
236{
237 if (k & 1) x = (x & 0x55555555) << 1 | (x & 0xAAAAAAAA) >> 1;
238 if (k & 2) x = (x & 0x33333333) << 2 | (x & 0xCCCCCCCC) >> 2;
239 if (k & 4) x = (x & 0x0F0F0F0F) << 4 | (x & 0xF0F0F0F0) >> 4;
240 if (k & 8) x = (x & 0x00FF00FF) << 8 | (x & 0xFF00FF00) >> 8;
241 if (k & 16) x = (x & 0x0000FFFF) << 16 | (x & 0xFFFF0000) >> 16;
242
243 return x;
244}
245
Harald Weltede6e4982012-12-06 21:25:27 +0100246/*! \brief reverse the bit-order in each byte of a dword
247 * \param[in] x 32bit input value
248 * \returns 32bit value where bits of each byte have been reversed
249 *
250 * See Chapter 7 "Hackers Delight"
251 */
Harald Welte712691d2011-09-01 14:47:31 +0200252uint32_t osmo_revbytebits_32(uint32_t x)
253{
254 x = (x & 0x55555555) << 1 | (x & 0xAAAAAAAA) >> 1;
255 x = (x & 0x33333333) << 2 | (x & 0xCCCCCCCC) >> 2;
256 x = (x & 0x0F0F0F0F) << 4 | (x & 0xF0F0F0F0) >> 4;
257
258 return x;
259}
260
Harald Weltede6e4982012-12-06 21:25:27 +0100261/*! \brief reverse the bit order in a byte
262 * \param[in] x 8bit input value
263 * \returns 8bit value where bits order has been reversed
264 *
265 * See Chapter 7 "Hackers Delight"
266 */
Harald Welte712691d2011-09-01 14:47:31 +0200267uint32_t osmo_revbytebits_8(uint8_t x)
268{
269 x = (x & 0x55) << 1 | (x & 0xAA) >> 1;
270 x = (x & 0x33) << 2 | (x & 0xCC) >> 2;
271 x = (x & 0x0F) << 4 | (x & 0xF0) >> 4;
272
273 return x;
274}
275
Harald Weltede6e4982012-12-06 21:25:27 +0100276/*! \brief reverse bit-order of each byte in a buffer
Katerina Barone-Adesic28c6a02013-02-15 13:27:59 +0100277 * \param[in] buf buffer containing bytes to be bit-reversed
278 * \param[in] len length of buffer in bytes
Harald Weltede6e4982012-12-06 21:25:27 +0100279 *
280 * This function reverses the bits in each byte of the buffer
281 */
Harald Welte712691d2011-09-01 14:47:31 +0200282void osmo_revbytebits_buf(uint8_t *buf, int len)
283{
284 unsigned int i;
285 unsigned int unaligned_cnt;
286 int len_remain = len;
287
288 unaligned_cnt = ((unsigned long)buf & 3);
289 for (i = 0; i < unaligned_cnt; i++) {
290 buf[i] = osmo_revbytebits_8(buf[i]);
291 len_remain--;
292 if (len_remain <= 0)
293 return;
294 }
295
Sylvain Munaut01e06042013-01-03 09:36:16 +0100296 for (i = unaligned_cnt; i + 3 < len; i += 4) {
Max08621a82016-01-21 17:16:56 +0100297 osmo_store32be(osmo_revbytebits_32(osmo_load32be(buf + i)), buf + i);
Harald Welte712691d2011-09-01 14:47:31 +0200298 len_remain -= 4;
299 }
300
301 for (i = len - len_remain; i < len; i++) {
302 buf[i] = osmo_revbytebits_8(buf[i]);
303 len_remain--;
304 }
305}
306
Sylvain Munautdca7d2c2012-04-18 21:53:23 +0200307/*! @} */