mirror of https://github.com/pvnis/srsRAN_4G.git
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
108 lines
2.5 KiB
C
108 lines
2.5 KiB
C
/**
|
|
*
|
|
* \section COPYRIGHT
|
|
*
|
|
* Copyright 2013-2014 The libLTE Developers. See the
|
|
* COPYRIGHT file at the top-level directory of this distribution.
|
|
*
|
|
* \section LICENSE
|
|
*
|
|
* This file is part of the libLTE library.
|
|
*
|
|
* libLTE is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License as
|
|
* published by the Free Software Foundation, either version 3 of
|
|
* the License, or (at your option) any later version.
|
|
*
|
|
* libLTE 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 Lesser General Public License for more details.
|
|
*
|
|
* A copy of the GNU Lesser General Public License can be found in
|
|
* the LICENSE file in the top-level directory of this distribution
|
|
* and at http://www.gnu.org/licenses/.
|
|
*
|
|
*/
|
|
|
|
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
|
|
#include "liblte/phy/utils/bit.h"
|
|
|
|
void bit_pack_vector(uint8_t *bits_unpacked, uint8_t *bits_packed, int nof_bits)
|
|
{
|
|
uint32_t i, nbytes;
|
|
nbytes = nof_bits/8;
|
|
for (i=0;i<nbytes;i++) {
|
|
bit_pack(bits_unpacked[i], &bits_packed, 8);
|
|
}
|
|
if (nof_bits%8) {
|
|
bit_pack(bits_unpacked[i], &bits_packed, nof_bits%8);
|
|
}
|
|
}
|
|
|
|
void bit_pack(uint32_t value, uint8_t **bits, int nof_bits)
|
|
{
|
|
int i;
|
|
|
|
for(i=0; i<nof_bits; i++) {
|
|
(*bits)[i] = (value >> (nof_bits-i-1)) & 0x1;
|
|
}
|
|
*bits += nof_bits;
|
|
}
|
|
|
|
void bit_unpack_vector(uint8_t *bits_packed, uint8_t *bits_unpacked, int nof_bits)
|
|
{
|
|
uint32_t i, nbytes;
|
|
nbytes = nof_bits/8;
|
|
for (i=0;i<nbytes;i++) {
|
|
bits_unpacked[i] = bit_unpack(&bits_packed, 8);
|
|
}
|
|
if (nof_bits%8) {
|
|
bits_unpacked[i] = bit_unpack(&bits_packed, nof_bits%8);
|
|
}
|
|
}
|
|
|
|
uint32_t bit_unpack(uint8_t **bits, int nof_bits)
|
|
{
|
|
int i;
|
|
uint32_t value=0;
|
|
|
|
for(i=0; i<nof_bits; i++) {
|
|
value |= (*bits)[i] << (nof_bits-i-1);
|
|
}
|
|
*bits += nof_bits;
|
|
return value;
|
|
}
|
|
|
|
void bit_fprint(FILE *stream, uint8_t *bits, int nof_bits) {
|
|
int i;
|
|
|
|
fprintf(stream,"[");
|
|
for (i=0;i<nof_bits-1;i++) {
|
|
fprintf(stream,"%d,",bits[i]);
|
|
}
|
|
fprintf(stream,"%d]\n",bits[i]);
|
|
}
|
|
|
|
uint32_t bit_diff(uint8_t *x, uint8_t *y, int nbits) {
|
|
uint32_t errors=0;
|
|
for (int i=0;i<nbits;i++) {
|
|
if (x[i] != y[i]) {
|
|
//printf("%d, ",i);
|
|
errors++;
|
|
}
|
|
}
|
|
return errors;
|
|
}
|
|
|
|
// Counts the number of ones in a word. K&R book exercise 2.9
|
|
uint32_t bit_count(uint32_t n) {
|
|
int c;
|
|
for (c = 0; n; c++)
|
|
n &= n - 1;
|
|
return c;
|
|
}
|