Home
last modified time | relevance | path

Searched refs:make_edge (Results 1 – 25 of 74) sorted by relevance

123

/oneTBB/examples/graph/logic_sim/
H A Dtest_all.cpp74 make_edge(input.get_out(), input_port<0>(b)); in main()
75 make_edge(output_port<0>(b), output.get_in()); in main()
96 make_edge(input.get_out(), input_port<0>(n)); in main()
97 make_edge(output_port<0>(n), output.get_in()); in main()
119 make_edge(input0.get_out(), input_port<0>(a)); in main()
120 make_edge(input1.get_out(), input_port<1>(a)); in main()
121 make_edge(output_port<0>(a), output.get_in()); in main()
156 make_edge(input0.get_out(), input_port<0>(o)); in main()
157 make_edge(input1.get_out(), input_port<1>(o)); in main()
158 make_edge(input2.get_out(), input_port<2>(o)); in main()
[all …]
H A DD_latch.hpp47 make_edge(D_port, input_port<0>(a_not)); in D_latch()
48 make_edge(D_port, input_port<1>(second_and)); in D_latch()
49 make_edge(E_port, input_port<1>(first_and)); in D_latch()
50 make_edge(E_port, input_port<0>(second_and)); in D_latch()
51 make_edge(a_not, input_port<0>(first_and)); in D_latch()
52 make_edge(first_and, input_port<0>(first_nor)); in D_latch()
53 make_edge(second_and, input_port<1>(second_nor)); in D_latch()
54 make_edge(first_nor, input_port<0>(second_nor)); in D_latch()
55 make_edge(second_nor, input_port<1>(first_nor)); in D_latch()
H A Done_bit_adder.hpp97 make_edge(A_port, input_port<0>(FirstXOR)); in make_connections()
98 make_edge(A_port, input_port<0>(FirstAND)); in make_connections()
99 make_edge(B_port, input_port<1>(FirstXOR)); in make_connections()
100 make_edge(B_port, input_port<1>(FirstAND)); in make_connections()
101 make_edge(CI_port, input_port<1>(SecondXOR)); in make_connections()
102 make_edge(CI_port, input_port<1>(SecondAND)); in make_connections()
103 make_edge(FirstXOR, input_port<0>(SecondXOR)); in make_connections()
104 make_edge(FirstXOR, input_port<0>(SecondAND)); in make_connections()
105 make_edge(SecondAND, input_port<0>(FirstOR)); in make_connections()
106 make_edge(FirstAND, input_port<1>(FirstOR)); in make_connections()
/oneTBB/doc/main/tbb_userguide/
H A Duse_nested_flow_graphs.rst24 make_edge( n1, n2 );
25 make_edge( n1, n3 );
26 make_edge( n2, n4 );
27 make_edge( n3, n4 );
50 make_edge( m1, m2 );
58 make_edge( a, b );
92 make_edge( m1, m2 );
93 make_edge( m1, m3 );
94 make_edge( m2, m4 );
95 make_edge( m3, m4 );
[all …]
H A DData_Flow_Graph.rst55 make_edge( squarer, summer );
56 make_edge( cuber, summer );
98 make_edge( b, squarer );
99 make_edge( b, cuber );
134 make_edge( src, squarer );
135 make_edge( src, cuber );
178 make_edge( squarer, summer );
179 make_edge( cuber, summer );
181 make_edge( src, squarer );
182 make_edge( src, cuber );
H A Duse_input_node.rst24 // use it in calls to make_edge…
40 make_edge( squarer, summer );
41 make_edge( cuber, summer );
43 make_edge( src, squarer );
44 make_edge( src, cuber );
98 make_edge( func1, func2 );
99 make_edge( src, func1 );
H A Duse_make_edge.rst3 Use make_edge and remove_edge
10 - use make_edge and remove_edge
20 flow::make_edge and flow::remove_edge. The runtime library uses node
H A DFlow_Graph_Single_Vs_Broadcast.rst56 make_edge(buf1,f1);
57 make_edge(buf1,f2);
58 make_edge(buf1,f3);
72 make_edge(bn,f1);
73 make_edge(bn,f2);
74 make_edge(bn,f3);
/oneTBB/test/tbb/
H A Dtest_composite_node.cpp99 tbb::flow::make_edge(f1, f2); in tiny_node()
132 tbb::flow::make_edge( f0, t ); in test_tiny()
133 tbb::flow::make_edge( t, t1 ); in test_tiny()
134 tbb::flow::make_edge( t1, t2 ); in test_tiny()
135 tbb::flow::make_edge( t2 , f3 ); in test_tiny()
137 tbb::flow::make_edge(f3, q); in test_tiny()
152 tbb::flow::make_edge( t1 , f3 ); in test_tiny()
153 tbb::flow::make_edge(f3, q); in test_tiny()
237 tbb::flow::make_edge( s2, q ); in test_adder()
261 tbb::flow::make_edge( s2, q ); in test_adder()
[all …]
H A Dtest_limiter_node.cpp135 tbb::flow::make_edge( lim, r ); in test_puts_with_decrements()
162 tbb::flow::make_edge( lim, r ); in test_parallel()
196 tbb::flow::make_edge( lim, r ); in test_serial()
317 tbb::flow::make_edge(ln, qn); in test_continue_msg_reception()
342 make_edge(input_queue, limit); in test_reserve_release_messages()
343 make_edge(limit, output_queue); in test_reserve_release_messages()
380 make_edge(limit, queue); in test_decrementer()
401 make_edge(limit2, queue); in test_decrementer()
419 make_edge(limit3, queue); in test_decrementer()
443 tbb::flow::make_edge(bn, ln); in test_try_put_without_successors()
[all …]
H A Dtest_flow_graph_whitebox.cpp485 tbb::flow::make_edge(inq,ln); in TestLimiterNode()
486 tbb::flow::make_edge(ln,outq); in TestLimiterNode()
521 tbb::flow::make_edge(inq,ln); in TestLimiterNode()
522 tbb::flow::make_edge(ln,outq); in TestLimiterNode()
578 tbb::flow::make_edge(qin,mf); in TestMultifunctionNode()
646 tbb::flow::make_edge(on,qout); in TestScalarNode()
872 make_edge(c, f);
889 make_edge(on, q);
934 make_edge(c, b);
962 make_edge(f1, f2);
[all …]
H A Dtest_flow_graph_priorities.cpp141 make_edge( bn, *nodes.back() ); in test_node()
142 make_edge( *nodes.back(), tn ); in test_node()
535 make_edge( bn, *nodes[i] ); in test()
573 make_edge( start_node, mid_node1 ); in operator ()()
574 make_edge( mid_node1, end_node ); in operator ()()
575 make_edge( start_node, mid_node2 ); in operator ()()
576 make_edge( mid_node2, end_node ); in operator ()()
712 make_edge( starter, spawn_successor ); in test_use_case()
713 make_edge( starter, bypass_successor ); in test_use_case()
785 make_edge(bn, *n); in test()
[all …]
H A Dtest_split_node.cpp155 tbb::flow::make_edge( tbb::flow::output_port<ELEM-1>(my_split) , *new_node); in add_sink_nodes()
195 tbb::flow::make_edge( tbb::flow::output_port<0>(my_split) , *new_node); in add_sink_nodes()
246 tbb::flow::make_edge(*s, *my_split); in test()
277 tbb::flow::make_edge( q3, my_split ); in test_one_serial()
315 make_edge(output_port<0>(following_node), f4); in test_follows_and_precedes_api()
316 make_edge(output_port<1>(following_node), f5); in test_follows_and_precedes_api()
317 make_edge(output_port<2>(following_node), f6); in test_follows_and_precedes_api()
320 make_edge(f1, preceding_node); in test_follows_and_precedes_api()
321 make_edge(f2, preceding_node); in test_follows_and_precedes_api()
322 make_edge(f3, preceding_node); in test_follows_and_precedes_api()
/oneTBB/test/conformance/
H A Dconformance_graph.cpp57 oneapi::tbb::flow::make_edge(node, rejecter); in test_input_node_rf_reset_protocol()
209 oneapi::tbb::flow::make_edge(ct, successor);
210 oneapi::tbb::flow::make_edge(s, successor);
211 oneapi::tbb::flow::make_edge(src, successor);
212 oneapi::tbb::flow::make_edge(fxn, successor);
214 oneapi::tbb::flow::make_edge(bc, successor);
217 oneapi::tbb::flow::make_edge(j, successor2);
218 oneapi::tbb::flow::make_edge(bf, successor);
219 oneapi::tbb::flow::make_edge(pq, successor);
220 oneapi::tbb::flow::make_edge(wo, successor);
[all …]
H A Dconformance_split_node.cpp41 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<0>(testing_node), rejecter1);
42 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<1>(testing_node), rejecter2);
43 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<2>(testing_node), rejecter3);
71 oneapi::tbb::flow::make_edge(output_port<0>(testing_node), node2);
72 oneapi::tbb::flow::make_edge(output_port<1>(testing_node), node3);
73 oneapi::tbb::flow::make_edge(output_port<2>(testing_node), node4);
103 oneapi::tbb::flow::make_edge(node0, node1);
104 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<0>(node1), node2);
108 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<0>(node_copy), node3);
H A Dconformance_indexer_node.cpp40 oneapi::tbb::flow::make_edge(testing_node, *receiver_nodes.back());
78 oneapi::tbb::flow::make_edge(testing_node, rejecter);
118 oneapi::tbb::flow::make_edge(f1, oneapi::tbb::flow::input_port<0>(testing_node));
119 oneapi::tbb::flow::make_edge(f2, oneapi::tbb::flow::input_port<1>(testing_node));
120 oneapi::tbb::flow::make_edge(c1, oneapi::tbb::flow::input_port<2>(testing_node));
121 oneapi::tbb::flow::make_edge(testing_node, f3);
141 oneapi::tbb::flow::make_edge(node0, oneapi::tbb::flow::input_port<0>(node1));
142 oneapi::tbb::flow::make_edge(node1, node2);
146 oneapi::tbb::flow::make_edge(node_copy, node3);
H A Dconformance_limiter_node.cpp37 oneapi::tbb::flow::make_edge(node1, node2);
72 oneapi::tbb::flow::make_edge(node0, node1);
73 oneapi::tbb::flow::make_edge(node1, node2);
77 oneapi::tbb::flow::make_edge(node_copy, node3);
110 make_edge(limit, queue);
131 make_edge(limit2, queue);
149 make_edge(limit3, queue);
168 make_edge(limit4, queue);
H A Dconformance_flowgraph.h561 oneapi::tbb::flow::make_edge(node0, node1); in test_copy_ctor()
562 oneapi::tbb::flow::make_edge(node1, suc_node1); in test_copy_ctor()
646 make_edge(source, low); in test_priority()
647 make_edge(source, high); in test_priority()
684 make_edge(fnode, suc_node); in test_concurrency()
702 make_edge(fnode, suc_node); in test_rejecting()
723 make_edge(node1, suc_node); in test_output_input_class()
742 make_edge(node1, suc_node); in test_output_class()
789 make_edge(testing_node, input_port<0>(join_n)); in test_with_reserving_join_node_class()
790 make_edge(buffer_n, input_port<1>(join_n)); in test_with_reserving_join_node_class()
[all …]
H A Dconformance_join_node.cpp81 oneapi::tbb::flow::make_edge(node0, oneapi::tbb::flow::input_port<0>(node1));
82 oneapi::tbb::flow::make_edge(node1, node2);
85 oneapi::tbb::flow::make_edge(node_copy, node3);
102 oneapi::tbb::flow::make_edge(node_copy2, node3);
145 oneapi::tbb::flow::make_edge(f1, oneapi::tbb::flow::input_port<0>(testing_node));
146 oneapi::tbb::flow::make_edge(f2, oneapi::tbb::flow::input_port<1>(testing_node));
148 make_edge(testing_node, f3);
149 make_edge(f3, q_node);
289 make_edge(f1, input_port<0>(j)); in test_invoke_basic()
290 make_edge(f2, input_port<1>(j)); in test_invoke_basic()
[all …]
H A Dconformance_sequencer_node.cpp155 tbb::flow::make_edge(process, ordering);
156 tbb::flow::make_edge(ordering, writer);
187 make_edge(starter, seq1);
188 make_edge(seq1, check);
201 make_edge(starter, seq2);
202 make_edge(seq2, check);
H A Dconformance_composite_node.cpp41 make_edge(j, f); in adder()
42 make_edge(f, qn); in adder()
167 make_edge(output_port<0>(s), input_port<0>(a0));
168 make_edge(output_port<1>(s), input_port<1>(a0));
170 make_edge(output_port<0>(a0),input_port<0>(a1));
171 make_edge(output_port<2>(s), input_port<1>(a1));
173 make_edge(output_port<0>(a1), input_port<0>(a2));
174 make_edge(output_port<3>(s), input_port<1>(a2));
H A Dconformance_broadcast_node.cpp61 oneapi::tbb::flow::make_edge(node0, node1);
62 oneapi::tbb::flow::make_edge(node1, node2);
66 oneapi::tbb::flow::make_edge(node_copy, node3);
/oneTBB/test/common/
H A Dtest_join_node_multiple_predecessors.h35 make_edge(bn1, input_port<0>(jn)); in twist_join_connections()
36 make_edge(bn2, input_port<0>(jn)); in twist_join_connections()
37 make_edge(bn3, input_port<0>(jn)); in twist_join_connections()
40 make_edge (bn3, input_port<2>(jn)); in twist_join_connections()
43 make_edge (bn2, input_port<1>(jn)); in twist_join_connections()
52 make_edge(*jn, qn); in connect_join_via_make_edge()
63 make_edge(*jn, qn); in connect_join_via_follows()
/oneTBB/doc/main/reference/
H A Dhelpers_for_expressing_graphs.rst71 make_edge(input, doubler);
72 make_edge(input, squarer);
73 make_edge(input, cuber);
74 make_edge(doubler, std::get<0>(join.input_ports()));
75 make_edge(squarer, std::get<1>(join.input_ports()));
76 make_edge(cuber, std::get<2>(join.input_ports()));
77 make_edge(join, summer);
/oneTBB/examples/graph/dining_philosophers/
H A Ddining_philosophers.cpp241 using oneapi::tbb::flow::make_edge; in main()
298 make_edge(*think_nodes[i], done_vector[i]); in main()
299 make_edge(done_vector[i], input_port<0>(join_vector[i])); in main()
300 make_edge(places[i], input_port<1>(join_vector[i])); // left chopstick in main()
301 make_edge(places[(i + 1) % num_philosophers], in main()
303 make_edge(join_vector[i], *eat_nodes[i]); in main()
304 make_edge(*eat_nodes[i], *forward_nodes[i]); in main()
305 make_edge(output_port<0>(*forward_nodes[i]), *think_nodes[i]); in main()
306 make_edge(output_port<1>(*forward_nodes[i]), places[i]); in main()
307 make_edge(output_port<2>(*forward_nodes[i]), places[(i + 1) % num_philosophers]); in main()

123