blob: 92af8d1cb799406ddb5d52eaeb3381072ae39b36 (
plain)
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
|
/* -*- 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.
*/
#ifndef INCLUDED_GR_SCHEDULER_H
#define INCLUDED_GR_SCHEDULER_H
#include <gr_core_api.h>
#include <boost/utility.hpp>
#include <gr_block.h>
#include <gr_flat_flowgraph.h>
class gr_scheduler;
typedef boost::shared_ptr<gr_scheduler> gr_scheduler_sptr;
/*!
* \brief Abstract scheduler that takes a flattened flow graph and runs it.
*
* Preconditions: details, buffers and buffer readers have been assigned.
*/
class GR_CORE_API gr_scheduler : boost::noncopyable
{
public:
/*!
* \brief Construct a scheduler and begin evaluating the graph.
*
* The scheduler will continue running until all blocks until they
* report that they are done or the stop method is called.
*/
gr_scheduler(gr_flat_flowgraph_sptr ffg, int max_noutput_items);
virtual ~gr_scheduler();
/*!
* \brief Tell the scheduler to stop executing.
*/
virtual void stop() = 0;
/*!
* \brief Block until the graph is done.
*/
virtual void wait() = 0;
};
#endif /* INCLUDED_GR_SCHEDULER_H */
|
