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
|
/* -*- c++ -*- */
/*
* Copyright 2010,2013 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* GNU Radio is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3, or (at your option)
* any later version.
*
* GNU Radio 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Radio; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street,
* Boston, MA 02110-1301, USA.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "annotator_1to1_impl.h"
#include <gnuradio/io_signature.h>
#include <string.h>
#include <iostream>
#include <iomanip>
namespace gr {
namespace blocks {
annotator_1to1::sptr
annotator_1to1::make(int when, size_t sizeof_stream_item)
{
return gnuradio::get_initial_sptr
(new annotator_1to1_impl(when, sizeof_stream_item));
}
annotator_1to1_impl::annotator_1to1_impl(int when, size_t sizeof_stream_item)
: sync_block("annotator_1to1",
io_signature::make(1, -1, sizeof_stream_item),
io_signature::make(1, -1, sizeof_stream_item)),
d_itemsize(sizeof_stream_item), d_when((uint64_t)when)
{
set_tag_propagation_policy(TPP_ONE_TO_ONE);
d_tag_counter = 0;
set_relative_rate(1.0);
}
annotator_1to1_impl::~annotator_1to1_impl()
{
}
int
annotator_1to1_impl::work(int noutput_items,
gr_vector_const_void_star &input_items,
gr_vector_void_star &output_items)
{
const float *in = (const float*)input_items[0];
float *out = (float*)output_items[0];
std::stringstream str;
str << name() << unique_id();
uint64_t abs_N = 0;
int ninputs = input_items.size();
for(int i = 0; i < ninputs; i++) {
abs_N = nitems_read(i);
std::vector<tag_t> all_tags;
get_tags_in_range(all_tags, i, abs_N, abs_N + noutput_items);
std::vector<tag_t>::iterator itr;
for(itr = all_tags.begin(); itr != all_tags.end(); itr++) {
d_stored_tags.push_back(*itr);
}
}
// Storing the current noutput_items as the value to the "noutput_items" key
pmt::pmt_t srcid = pmt::string_to_symbol(str.str());
pmt::pmt_t key = pmt::string_to_symbol("seq");
// Work does nothing to the data stream; just copy all inputs to outputs
// Adds a new tag when the number of items read is a multiple of d_when
abs_N = nitems_read(0);
int noutputs = output_items.size();
for(int j = 0; j < noutput_items; j++) {
// the min() is a hack to make sure this doesn't segfault if
// there are a different number of ins and outs. This is
// specifically designed to test the 1-to-1 propagation policy.
for(int i = 0; i < std::min(noutputs, ninputs); i++) {
if(abs_N % d_when == 0) {
pmt::pmt_t value = pmt::from_uint64(d_tag_counter++);
add_item_tag(i, abs_N, key, value, srcid);
}
in = (const float*)input_items[i];
out = (float*)output_items[i];
out[j] = in[j];
}
abs_N++;
}
return noutput_items;
}
} /* namespace blocks */
} /* namespace gr */
|
