blob: fe92f933958b56e4218dc5cd4bf60a24dfceb7ad [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 * @{
Harald Welteba6988b2011-08-17 12:46:48 +020029 * \brief Osmocom bit level support code
30 */
31
Harald Welte96e2a002017-06-12 21:44:18 +020032/*! \file bits.c */
33
Harald Welteba6988b2011-08-17 12:46:48 +020034
35/*! \brief convert unpacked bits to packed bits, return length in bytes
36 * \param[out] out output buffer of packed bits
37 * \param[in] in input buffer of unpacked bits
38 * \param[in] num_bits number of bits
39 */
Harald Welte2230c132011-01-19 10:10:16 +010040int osmo_ubit2pbit(pbit_t *out, const ubit_t *in, unsigned int num_bits)
41{
42 unsigned int i;
43 uint8_t curbyte = 0;
44 pbit_t *outptr = out;
45
46 for (i = 0; i < num_bits; i++) {
47 uint8_t bitnum = 7 - (i % 8);
48
49 curbyte |= (in[i] << bitnum);
50
Christian Vogelc7f84e92011-01-22 22:48:37 +010051 if(i % 8 == 7){
Harald Welte2230c132011-01-19 10:10:16 +010052 *outptr++ = curbyte;
53 curbyte = 0;
54 }
55 }
56 /* we have a non-modulo-8 bitcount */
57 if (i % 8)
58 *outptr++ = curbyte;
59
60 return outptr - out;
61}
62
Maxe0a7d9e2016-06-17 17:58:52 +020063/*! \brief Shift unaligned input to octet-aligned output
64 * \param[out] out output buffer, unaligned
65 * \param[in] in input buffer, octet-aligned
66 * \param[in] num_nibbles number of nibbles
67 */
68void osmo_nibble_shift_right(uint8_t *out, const uint8_t *in,
69 unsigned int num_nibbles)
70{
71 unsigned int i, num_whole_bytes = num_nibbles / 2;
72 if (!num_whole_bytes)
73 return;
74
75 /* first byte: upper nibble empty, lower nibble from src */
76 out[0] = (in[0] >> 4);
77
78 /* bytes 1.. */
79 for (i = 1; i < num_whole_bytes; i++)
80 out[i] = ((in[i - 1] & 0xF) << 4) | (in[i] >> 4);
81
82 /* shift the last nibble, in case there's an odd count */
83 i = num_whole_bytes;
84 if (num_nibbles & 1)
85 out[i] = ((in[i - 1] & 0xF) << 4) | (in[i] >> 4);
86 else
87 out[i] = (in[i - 1] & 0xF) << 4;
88}
89
90/*! \brief Shift unaligned input to octet-aligned output
91 * \param[out] out output buffer, octet-aligned
92 * \param[in] in input buffer, unaligned
93 * \param[in] num_nibbles number of nibbles
94 */
95void osmo_nibble_shift_left_unal(uint8_t *out, const uint8_t *in,
96 unsigned int num_nibbles)
97{
98 unsigned int i, num_whole_bytes = num_nibbles / 2;
99 if (!num_whole_bytes)
100 return;
101
102 for (i = 0; i < num_whole_bytes; i++)
103 out[i] = ((in[i] & 0xF) << 4) | (in[i + 1] >> 4);
104
105 /* shift the last nibble, in case there's an odd count */
106 i = num_whole_bytes;
107 if (num_nibbles & 1)
108 out[i] = (in[i] & 0xF) << 4;
109}
110
Maxd8fb1422016-04-06 16:13:00 +0200111/*! \brief convert unpacked bits to soft bits
112 * \param[out] out output buffer of soft bits
113 * \param[in] in input buffer of unpacked bits
114 * \param[in] num_bits number of bits
115 */
116void osmo_ubit2sbit(sbit_t *out, const ubit_t *in, unsigned int num_bits)
117{
118 unsigned int i;
119 for (i = 0; i < num_bits; i++)
120 out[i] = in[i] ? -127 : 127;
121}
122
123/*! \brief convert soft bits to unpacked bits
124 * \param[out] out output buffer of unpacked bits
125 * \param[in] in input buffer of soft bits
126 * \param[in] num_bits number of bits
127 */
128void osmo_sbit2ubit(ubit_t *out, const sbit_t *in, unsigned int num_bits)
129{
130 unsigned int i;
131 for (i = 0; i < num_bits; i++)
132 out[i] = in[i] < 0;
133}
134
Harald Welteba6988b2011-08-17 12:46:48 +0200135/*! \brief convert packed bits to unpacked bits, return length in bytes
136 * \param[out] out output buffer of unpacked bits
137 * \param[in] in input buffer of packed bits
138 * \param[in] num_bits number of bits
Harald Welte2d2e2cc2016-04-25 12:11:20 +0200139 * \return number of bytes used in \ref out
Harald Welteba6988b2011-08-17 12:46:48 +0200140 */
Harald Welte2230c132011-01-19 10:10:16 +0100141int osmo_pbit2ubit(ubit_t *out, const pbit_t *in, unsigned int num_bits)
142{
143 unsigned int i;
144 ubit_t *cur = out;
145 ubit_t *limit = out + num_bits;
146
147 for (i = 0; i < (num_bits/8)+1; i++) {
148 pbit_t byte = in[i];
149 *cur++ = (byte >> 7) & 1;
150 if (cur >= limit)
151 break;
152 *cur++ = (byte >> 6) & 1;
153 if (cur >= limit)
154 break;
155 *cur++ = (byte >> 5) & 1;
156 if (cur >= limit)
157 break;
158 *cur++ = (byte >> 4) & 1;
159 if (cur >= limit)
160 break;
161 *cur++ = (byte >> 3) & 1;
162 if (cur >= limit)
163 break;
164 *cur++ = (byte >> 2) & 1;
165 if (cur >= limit)
166 break;
167 *cur++ = (byte >> 1) & 1;
168 if (cur >= limit)
169 break;
170 *cur++ = (byte >> 0) & 1;
171 if (cur >= limit)
172 break;
173 }
174 return cur - out;
175}
Sylvain Munautaeb10772011-01-21 12:22:30 +0100176
Harald Welteba6988b2011-08-17 12:46:48 +0200177/*! \brief convert unpacked bits to packed bits (extended options)
178 * \param[out] out output buffer of packed bits
179 * \param[in] out_ofs offset into output buffer
180 * \param[in] in input buffer of unpacked bits
181 * \param[in] in_ofs offset into input buffer
182 * \param[in] num_bits number of bits
183 * \param[in] lsb_mode Encode bits in LSB orde instead of MSB
184 * \returns length in bytes (max written offset of output buffer + 1)
185 */
Sylvain Munautaeb10772011-01-21 12:22:30 +0100186int osmo_ubit2pbit_ext(pbit_t *out, unsigned int out_ofs,
187 const ubit_t *in, unsigned int in_ofs,
188 unsigned int num_bits, int lsb_mode)
189{
190 int i, op, bn;
191 for (i=0; i<num_bits; i++) {
192 op = out_ofs + i;
193 bn = lsb_mode ? (op&7) : (7-(op&7));
194 if (in[in_ofs+i])
195 out[op>>3] |= 1 << bn;
196 else
197 out[op>>3] &= ~(1 << bn);
198 }
199 return ((out_ofs + num_bits - 1) >> 3) + 1;
200}
201
Harald Welteba6988b2011-08-17 12:46:48 +0200202/*! \brief convert packed bits to unpacked bits (extended options)
203 * \param[out] out output buffer of unpacked bits
204 * \param[in] out_ofs offset into output buffer
205 * \param[in] in input buffer of packed bits
206 * \param[in] in_ofs offset into input buffer
207 * \param[in] num_bits number of bits
208 * \param[in] lsb_mode Encode bits in LSB orde instead of MSB
209 * \returns length in bytes (max written offset of output buffer + 1)
210 */
Sylvain Munautaeb10772011-01-21 12:22:30 +0100211int osmo_pbit2ubit_ext(ubit_t *out, unsigned int out_ofs,
212 const pbit_t *in, unsigned int in_ofs,
213 unsigned int num_bits, int lsb_mode)
214{
215 int i, ip, bn;
216 for (i=0; i<num_bits; i++) {
217 ip = in_ofs + i;
218 bn = lsb_mode ? (ip&7) : (7-(ip&7));
219 out[out_ofs+i] = !!(in[ip>>3] & (1<<bn));
220 }
221 return out_ofs + num_bits;
222}
Harald Welteba6988b2011-08-17 12:46:48 +0200223
Harald Weltede6e4982012-12-06 21:25:27 +0100224/*! \brief generalized bit reversal function
225 * \param[in] x the 32bit value to be reversed
226 * \param[in] k the type of reversal requested
227 * \returns the reversed 32bit dword
228 *
229 * This function reverses the bit order within a 32bit word. Depending
230 * on "k", it either reverses all bits in a 32bit dword, or the bytes in
231 * the dword, or the bits in each byte of a dword, or simply swaps the
232 * two 16bit words in a dword. See Chapter 7 "Hackers Delight"
233 */
Harald Welte712691d2011-09-01 14:47:31 +0200234uint32_t osmo_bit_reversal(uint32_t x, enum osmo_br_mode k)
235{
236 if (k & 1) x = (x & 0x55555555) << 1 | (x & 0xAAAAAAAA) >> 1;
237 if (k & 2) x = (x & 0x33333333) << 2 | (x & 0xCCCCCCCC) >> 2;
238 if (k & 4) x = (x & 0x0F0F0F0F) << 4 | (x & 0xF0F0F0F0) >> 4;
239 if (k & 8) x = (x & 0x00FF00FF) << 8 | (x & 0xFF00FF00) >> 8;
240 if (k & 16) x = (x & 0x0000FFFF) << 16 | (x & 0xFFFF0000) >> 16;
241
242 return x;
243}
244
Harald Weltede6e4982012-12-06 21:25:27 +0100245/*! \brief reverse the bit-order in each byte of a dword
246 * \param[in] x 32bit input value
247 * \returns 32bit value where bits of each byte have been reversed
248 *
249 * See Chapter 7 "Hackers Delight"
250 */
Harald Welte712691d2011-09-01 14:47:31 +0200251uint32_t osmo_revbytebits_32(uint32_t x)
252{
253 x = (x & 0x55555555) << 1 | (x & 0xAAAAAAAA) >> 1;
254 x = (x & 0x33333333) << 2 | (x & 0xCCCCCCCC) >> 2;
255 x = (x & 0x0F0F0F0F) << 4 | (x & 0xF0F0F0F0) >> 4;
256
257 return x;
258}
259
Harald Weltede6e4982012-12-06 21:25:27 +0100260/*! \brief reverse the bit order in a byte
261 * \param[in] x 8bit input value
262 * \returns 8bit value where bits order has been reversed
263 *
264 * See Chapter 7 "Hackers Delight"
265 */
Harald Welte712691d2011-09-01 14:47:31 +0200266uint32_t osmo_revbytebits_8(uint8_t x)
267{
268 x = (x & 0x55) << 1 | (x & 0xAA) >> 1;
269 x = (x & 0x33) << 2 | (x & 0xCC) >> 2;
270 x = (x & 0x0F) << 4 | (x & 0xF0) >> 4;
271
272 return x;
273}
274
Harald Weltede6e4982012-12-06 21:25:27 +0100275/*! \brief reverse bit-order of each byte in a buffer
Katerina Barone-Adesic28c6a02013-02-15 13:27:59 +0100276 * \param[in] buf buffer containing bytes to be bit-reversed
277 * \param[in] len length of buffer in bytes
Harald Weltede6e4982012-12-06 21:25:27 +0100278 *
279 * This function reverses the bits in each byte of the buffer
280 */
Harald Welte712691d2011-09-01 14:47:31 +0200281void osmo_revbytebits_buf(uint8_t *buf, int len)
282{
283 unsigned int i;
284 unsigned int unaligned_cnt;
285 int len_remain = len;
286
287 unaligned_cnt = ((unsigned long)buf & 3);
288 for (i = 0; i < unaligned_cnt; i++) {
289 buf[i] = osmo_revbytebits_8(buf[i]);
290 len_remain--;
291 if (len_remain <= 0)
292 return;
293 }
294
Sylvain Munaut01e06042013-01-03 09:36:16 +0100295 for (i = unaligned_cnt; i + 3 < len; i += 4) {
Max08621a82016-01-21 17:16:56 +0100296 osmo_store32be(osmo_revbytebits_32(osmo_load32be(buf + i)), buf + i);
Harald Welte712691d2011-09-01 14:47:31 +0200297 len_remain -= 4;
298 }
299
300 for (i = len - len_remain; i < len; i++) {
301 buf[i] = osmo_revbytebits_8(buf[i]);
302 len_remain--;
303 }
304}
305
Sylvain Munautdca7d2c2012-04-18 21:53:23 +0200306/*! @} */