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
|
/* -*- c++ -*- */
/*
* Copyright 2008,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 this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "scheduler_tpb.h"
#include "tpb_thread_body.h"
#include <gnuradio/thread/thread_body_wrapper.h>
#include <sstream>
namespace gr {
class tpb_container
{
block_sptr d_block;
int d_max_noutput_items;
public:
tpb_container(block_sptr block, int max_noutput_items)
: d_block(block), d_max_noutput_items(max_noutput_items) {}
void operator()()
{
tpb_thread_body body(d_block, d_max_noutput_items);
}
};
scheduler_sptr
scheduler_tpb::make(flat_flowgraph_sptr ffg, int max_noutput_items)
{
return scheduler_sptr(new scheduler_tpb(ffg, max_noutput_items));
}
scheduler_tpb::scheduler_tpb(flat_flowgraph_sptr ffg,
int max_noutput_items)
: scheduler(ffg, max_noutput_items)
{
// Get a topologically sorted vector of all the blocks in use.
// Being topologically sorted probably isn't going to matter, but
// there's a non-zero chance it might help...
basic_block_vector_t used_blocks = ffg->calc_used_blocks();
used_blocks = ffg->topological_sort(used_blocks);
block_vector_t blocks = flat_flowgraph::make_block_vector(used_blocks);
// Ensure that the done flag is clear on all blocks
for(size_t i = 0; i < blocks.size(); i++) {
blocks[i]->detail()->set_done(false);
}
// Fire off a thead for each block
for(size_t i = 0; i < blocks.size(); i++) {
std::stringstream name;
name << "thread-per-block[" << i << "]: " << blocks[i];
// If set, use internal value instead of global value
if(blocks[i]->is_set_max_noutput_items())
max_noutput_items = blocks[i]->max_noutput_items();
d_threads.create_thread(
gr::thread::thread_body_wrapper<tpb_container>
(tpb_container(blocks[i], max_noutput_items),
name.str()));
}
}
scheduler_tpb::~scheduler_tpb()
{
stop();
}
void
scheduler_tpb::stop()
{
d_threads.interrupt_all();
}
void
scheduler_tpb::wait()
{
d_threads.join_all();
}
} /* namespace gr */
|
