1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/* -*- c++ -*- */
/*
* Copyright 2004,2006,2013,2018 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* SPDX-License-Identifier: GPL-3.0-or-later
*
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "unpacked_to_packed_impl.h"
#include <gnuradio/io_signature.h>
#include <assert.h>
namespace gr {
namespace blocks {
template <class T>
typename unpacked_to_packed<T>::sptr
unpacked_to_packed<T>::make(unsigned int bits_per_chunk, endianness_t endianness)
{
return gnuradio::make_block_sptr<unpacked_to_packed_impl<T>>(bits_per_chunk,
endianness);
}
template <class T>
unpacked_to_packed_impl<T>::unpacked_to_packed_impl(unsigned int bits_per_chunk,
endianness_t endianness)
: block("unpacked_to_packed",
io_signature::make(1, -1, sizeof(T)),
io_signature::make(1, -1, sizeof(T))),
d_bits_per_chunk(bits_per_chunk),
d_endianness(endianness),
d_index(0)
{
assert(bits_per_chunk <= d_bits_per_type);
assert(bits_per_chunk > 0);
this->set_relative_rate((uint64_t)bits_per_chunk, (uint64_t)this->d_bits_per_type);
}
template <class T>
unpacked_to_packed_impl<T>::~unpacked_to_packed_impl()
{
}
template <class T>
void unpacked_to_packed_impl<T>::forecast(int noutput_items,
gr_vector_int& ninput_items_required)
{
const int input_required =
(int)ceil((d_index + noutput_items * 1.0 * d_bits_per_type) / d_bits_per_chunk);
const unsigned ninputs = ninput_items_required.size();
for (unsigned int i = 0; i < ninputs; i++) {
ninput_items_required[i] = input_required;
}
}
template <class T>
unsigned int unpacked_to_packed_impl<T>::get_bit_be1(const T* in_vector,
unsigned int bit_addr,
unsigned int bits_per_chunk)
{
const unsigned int byte_addr = bit_addr / bits_per_chunk;
const T x = in_vector[byte_addr];
const unsigned int residue = bit_addr - byte_addr * bits_per_chunk;
// printf("Bit addr %d byte addr %d residue %d val
// %d\n",bit_addr,byte_addr,residue,(x>>(bits_per_chunk-1-residue))&1);
return (x >> (bits_per_chunk - 1 - residue)) & 1;
}
template <class T>
int unpacked_to_packed_impl<T>::general_work(int noutput_items,
gr_vector_int& ninput_items,
gr_vector_const_void_star& input_items,
gr_vector_void_star& output_items)
{
unsigned int index_tmp = d_index;
assert(input_items.size() == output_items.size());
const int nstreams = input_items.size();
for (int m = 0; m < nstreams; m++) {
const T* in = (T*)input_items[m];
T* out = (T*)output_items[m];
index_tmp = d_index;
// per stream processing
// assert((ninput_items[m]-d_index)*d_bits_per_chunk >=
// noutput_items*d_bits_per_type);
switch (d_endianness) {
case GR_MSB_FIRST:
for (int i = 0; i < noutput_items; i++) {
T tmp = 0;
for (unsigned int j = 0; j < d_bits_per_type; j++) {
tmp = (tmp << 1) | get_bit_be1(in, index_tmp, d_bits_per_chunk);
index_tmp++;
}
out[i] = tmp;
}
break;
case GR_LSB_FIRST:
for (int i = 0; i < noutput_items; i++) {
unsigned long tmp = 0;
for (unsigned int j = 0; j < d_bits_per_type; j++) {
tmp = (tmp >> 1) | (get_bit_be1(in, index_tmp, d_bits_per_chunk)
<< (d_bits_per_type - 1));
index_tmp++;
}
out[i] = tmp;
}
break;
default:
assert(0);
}
}
d_index = index_tmp;
this->consume_each((int)(d_index / d_bits_per_chunk));
d_index = d_index % d_bits_per_chunk;
return noutput_items;
}
template class unpacked_to_packed<std::uint8_t>;
template class unpacked_to_packed<std::int16_t>;
template class unpacked_to_packed<std::int32_t>;
} /* namespace blocks */
} /* namespace gr */
|
