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
|
/* -*- c++ -*- */
/*
* Copyright 2008 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 <gr_scheduler_sts.h>
#include <gr_single_threaded_scheduler.h>
#include <gruel/thread_body_wrapper.h>
class sts_container
{
gr_block_vector_t d_blocks;
public:
sts_container(gr_block_vector_t blocks)
: d_blocks(blocks) {}
void operator()()
{
gr_make_single_threaded_scheduler(d_blocks)->run();
}
};
gr_scheduler_sptr
gr_scheduler_sts::make(gr_flat_flowgraph_sptr ffg, int max_noutput_items)
{
return gr_scheduler_sptr(new gr_scheduler_sts(ffg, max_noutput_items));
}
gr_scheduler_sts::gr_scheduler_sts(gr_flat_flowgraph_sptr ffg, int max_noutput_items)
: gr_scheduler(ffg, max_noutput_items)
{
// Split the flattened flow graph into discrete partitions, each
// of which is topologically sorted.
std::vector<gr_basic_block_vector_t> graphs = ffg->partition();
// For each partition, create a thread to evaluate it using
// an instance of the gr_single_threaded_scheduler
for (std::vector<gr_basic_block_vector_t>::iterator p = graphs.begin();
p != graphs.end(); p++) {
gr_block_vector_t blocks = gr_flat_flowgraph::make_block_vector(*p);
d_threads.create_thread(
gruel::thread_body_wrapper<sts_container>(sts_container(blocks),
"single-threaded-scheduler"));
}
}
gr_scheduler_sts::~gr_scheduler_sts()
{
stop();
}
void
gr_scheduler_sts::stop()
{
d_threads.interrupt_all();
}
void
gr_scheduler_sts::wait()
{
d_threads.join_all();
}
|
