forked from fastflow/fastflow
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_combine3.cpp
130 lines (111 loc) · 3.77 KB
/
test_combine3.cpp
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
/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ***************************************************************************
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* As a special exception, you may use this file as part of a free software
* library without restriction. Specifically, if other files instantiate
* templates or use macros or inline functions from this file, or you compile
* this file and link it with other files to produce an executable, this
* file does not by itself cause the resulting executable to be covered by
* the GNU General Public License. This exception does not however
* invalidate any other reasons why the executable file might be covered by
* the GNU General Public License.
*
****************************************************************************
*
*
*/
/* pipe(farm, comp, A2A)
*
*
* |<-------- farm --------->| |<--------------- comp --------------->||<------ all-2-all --->|
* | with no collector | |<-- multi-input ->||<- multi-output ->|
*
* |--> Worker1 -->| |-->Worker2->|
* | | | |
* Emitter -> |--> Worker1 -->|------- Filter1 --------> Filter2-------->| | ->Filter3
* | | | |
* |--> Worker1 -->| |-->Worker2->|
*
*/
/* Author: Massimo Torquati
*
*/
#include <iostream>
#include <ff/ff.hpp>
using namespace ff;
struct Emitter: ff_monode_t<long> {
long *svc(long*) {
for(long i=1;i<=100;++i)
ff_send_out_to((long*)i, i % 3);
return EOS;
}
};
struct Worker1: ff_node_t<long> {
long *svc(long *in) {
return in;
}
};
struct Filter1: ff_minode_t<long> {
long *svc(long *in) {
std::cout << "Filter1: received " << (long)in << " from " << get_channel_id() << "\n";
return in;
}
};
struct Filter2: ff_monode_t<long> {
long *svc(long *in) {
ff_send_out_to(in, (long)in % 2);
return GO_ON;
}
};
struct Worker2: ff_node_t<long> {
long *svc(long *in) {
return in;
}
};
struct Filter3: ff_node_t<long> {
long *svc(long *in) {
std::cout << "Filter3: received " << (long)in << "\n";
return GO_ON;
}
};
int main() {
Emitter E;
std::vector<std::unique_ptr<ff_node>> W;
W.push_back(make_unique<Worker1>());
W.push_back(make_unique<Worker1>());
W.push_back(make_unique<Worker1>());
ff_Farm<> farm(std::move(W), E);
farm.remove_collector();
Filter1 f1;
Filter2 f2;
auto comp = combine_nodes(f1,f2);
std::vector<ff_node*> W1;
Worker2 w1, w2;
W1.push_back(&w1);
W1.push_back(&w2);
std::vector<ff_node*> W2;
Filter3 f3;
W2.push_back(&f3);
//ff_a2a a2a(true); // to test reduce_channels flag
ff_a2a a2a;
a2a.add_firstset(W1);
a2a.add_secondset(W2);
ff_Pipe<> pipe(farm, comp, a2a);
if (pipe.run_and_wait_end()<0) {
error("running farm\n");
return -1;
}
return 0;
}