Home
last modified time | relevance | path

Searched refs:my_graph (Results 1 – 16 of 16) sorted by relevance

/oneTBB/examples/graph/logic_sim/
H A Done_bit_adder.hpp58 oneapi::tbb::flow::graph& my_graph; member in one_bit_adder
66 my_graph(g), in one_bit_adder()
79 : base_type(src.my_graph), in one_bit_adder()
80 my_graph(src.my_graph), in one_bit_adder()
81 A_port(src.my_graph), in one_bit_adder()
82 B_port(src.my_graph), in one_bit_adder()
83 CI_port(src.my_graph), in one_bit_adder()
84 FirstXOR(src.my_graph), in one_bit_adder()
85 SecondXOR(src.my_graph), in one_bit_adder()
86 FirstAND(src.my_graph), in one_bit_adder()
[all …]
H A Dbasics.hpp73 my_graph(g), in gate()
110 my_graph(g), in gate()
148 my_graph(g), in gate()
188 my_graph(g), in gate()
221 : my_graph(g), in steady_signal()
225 : my_graph(src.my_graph), in steady_signal()
271 : my_graph(g), in pulse()
278 : my_graph(src.my_graph), in pulse()
312 push_button(const push_button& src) : my_graph(src.my_graph), push_button_node(src.my_graph) { in push_button()
339 : my_graph(src.my_graph), in toggle()
[all …]
H A Dtwo_bit_adder.hpp25 oneapi::tbb::flow::graph& my_graph; member in two_bit_adder
35 my_graph(g), in two_bit_adder()
41 : base_type(src.my_graph), in two_bit_adder()
42 my_graph(src.my_graph), in two_bit_adder()
43 two_adders(2, one_bit_adder(src.my_graph)) { in two_bit_adder()
H A Dfour_bit_adder.hpp36 oneapi::tbb::flow::graph& my_graph; member in four_bit_adder
42 my_graph(g), in four_bit_adder()
48 : fba_base_type(src.my_graph), in four_bit_adder()
49 my_graph(src.my_graph), in four_bit_adder()
50 four_adders(4, one_bit_adder(src.my_graph)) { in four_bit_adder()
H A DD_latch.hpp31 oneapi::tbb::flow::graph& my_graph; member in D_latch
39 my_graph(g), in D_latch()
/oneTBB/test/tbb/
H A Dtest_flow_graph.cpp39 tbb::flow::graph * const my_graph; member
48 my_graph->release_wait(); in operator ()()
74 tbb::flow::graph& my_graph; member in my_int_buffer
76 …my_int_buffer(tbb::flow::graph &g) : my_graph(g) { b = new tbb::flow::buffer_node<int>(my_graph); } in my_int_buffer()
77 my_int_buffer(const my_int_buffer& other) : my_graph(other.my_graph) { in my_int_buffer()
78 b = new tbb::flow::buffer_node<int>(my_graph); in my_int_buffer()
212 tbb::flow::graph& my_graph; member
242 tbb::flow::overwrite_node< int > ow_n(my_graph); in operator ()()
247 tbb::flow::write_once_node< int > w_n(my_graph); in operator ()()
252 tbb::flow::buffer_node< int > buf_n(my_graph); in operator ()()
[all …]
H A Dtest_limiter_node.cpp47 tbb::flow::graph& my_graph; member
49 serial_receiver(tbb::flow::graph& g) : next_value(T(0)), my_graph(g) {} in serial_receiver()
57 return my_graph; in graph_reference()
65 tbb::flow::graph& my_graph; member
67 parallel_receiver(tbb::flow::graph& g) : my_graph(g) { my_count = 0; } in parallel_receiver()
75 return my_graph; in graph_reference()
H A Dtest_broadcast_node.cpp57 tbb::flow::graph& my_graph; member in counting_array_receiver
61 counting_array_receiver(tbb::flow::graph& g) : my_graph(g) { in counting_array_receiver()
77 return my_graph; in graph_reference()
H A Dtest_input_node.cpp42 tbb::flow::graph& my_graph; member in test_push_receiver
46 test_push_receiver(tbb::flow::graph& g) : my_graph(g) { in test_push_receiver()
65 return my_graph; in graph_reference()
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h524 my_graph.register_node(this); in graph_node()
528 my_graph.remove_node(this); in ~graph_node()
728 my_graph.reserve_wait(); in __TBB_requires()
814 graph_node(src.my_graph), in __TBB_requires()
816 fOutput_type(src.my_graph) { in __TBB_requires()
972 return my_graph; in graph_reference()
1134 return my_graph; in graph_reference()
1483 return my_graph; in graph_reference()
2065 my_graph.reserve_wait(); in register_predecessor()
2899 graph* g = &n->my_graph; in __TBB_requires()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_impl.h57 my_graph(other.my_graph), current_node(other.current_node) in graph_iterator()
63 my_graph = other.my_graph;
77 return ((my_graph == other.my_graph) && (current_node == other.current_node));
100 GraphContainerType *my_graph;
131 : my_graph(g) in my_graph() function
135 graph& my_graph; // graph instance the task belongs to variable
373 graph& g = my_graph; in finalize()
398 graph& my_graph;
401 return my_graph; in graph_reference()
H A D_flow_graph_indexer_impl.h66 graph* my_graph;
71 my_graph = &g;
83 return *my_graph;
107 using graph_node::my_graph;
171 … : graph_node(other.my_graph), input_ports_type(), sender<output_type>(), my_successors(this)
173 … indexer_helper<StructTypes,N>::set_indexer_node_pointer(this->my_inputs, this, other.my_graph);
H A D_flow_graph_body_impl.h347 return my_node->my_graph;
371 return my_node->my_graph;
H A D_flow_graph_join_impl.h1030 using graph_node::my_graph;
1075 … if(tuple_build_may_succeed() && !forwarder_busy && is_graph_active(my_graph)) {
1078 … graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);
1079 my_graph.reserve_wait();
1080 spawn_in_graph_arena(my_graph, *t);
1116 last_task = combine_tasks(my_graph, last_task, new_task);
1145 graph_node(other.graph_node::my_graph), input_ports_type(other),
H A D_flow_graph_node_set_impl.h51 return static_cast<const graph_node*>(&object)->my_graph; in get_impl()
/oneTBB/test/common/
H A Dgraph_utils.h264 tbb::flow::graph& my_graph;
266 harness_counting_receiver(tbb::flow::graph& g) : num_copies(1), my_graph(g) {
277 return my_graph;
302 tbb::flow::graph& my_graph;
304 harness_mapped_receiver(tbb::flow::graph& g) : my_multiset(nullptr), my_graph(g) {
336 return my_graph;