Lines Matching refs:my_graph
404 graph_iterator<C,N>::graph_iterator(C *g, bool begin) : my_graph(g), current_node(nullptr) in graph_iterator()
406 if (begin) current_node = my_graph->my_nodes; in graph_iterator()
523 inline graph_node::graph_node(graph& g) : my_graph(g) { in graph_node()
524 my_graph.register_node(this); in graph_node()
528 my_graph.remove_node(this); in ~graph_node()
558 fgt_node_with_body(CODEPTR(), FLOW_INPUT_NODE, &this->my_graph, in __TBB_requires()
574 : graph_node(src.my_graph), sender<Output>() in __TBB_requires()
579 fgt_node_with_body(CODEPTR(), FLOW_INPUT_NODE, &this->my_graph, in __TBB_requires()
727 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in __TBB_requires()
728 my_graph.reserve_wait(); in __TBB_requires()
734 if(is_graph_active(this->my_graph)) { in __TBB_requires()
735 spawn_in_graph_arena(this->my_graph, *create_put_task()); in __TBB_requires()
788 fgt_node_with_body( CODEPTR(), FLOW_FUNCTION_NODE, &this->my_graph, in __TBB_requires()
814 graph_node(src.my_graph), in __TBB_requires()
816 fOutput_type(src.my_graph) { in __TBB_requires()
817 fgt_node_with_body( CODEPTR(), FLOW_FUNCTION_NODE, &this->my_graph, in __TBB_requires()
883 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
909 graph_node(other.my_graph), input_impl_type(other) { in __TBB_requires()
911 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
938 fgt_multioutput_node<N>(CODEPTR(), FLOW_SPLIT_NODE, &this->my_graph, in split_node()
950 : graph_node(other.my_graph), base_type(other), in split_node()
951 … my_output_ports(init_output_ports<output_ports_type>::call(other.my_graph, my_output_ports)) in split_node()
953 fgt_multioutput_node<N>(CODEPTR(), FLOW_SPLIT_NODE, &this->my_graph, in split_node()
963 return emit_element<N>::emit_this(this->my_graph, t, output_ports()); in try_put_task()
972 return my_graph; in graph_reference()
1000 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1034 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1062 graph_node(src.my_graph), input_impl_type(src), in __TBB_requires()
1063 function_output<Output>(src.my_graph) { in __TBB_requires()
1064 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1096 fgt_node( CODEPTR(), FLOW_BROADCAST_NODE, &this->my_graph, in broadcast_node()
1108 __TBB_NOINLINE_SYM broadcast_node( const broadcast_node& src ) : broadcast_node(src.my_graph) {} in broadcast_node()
1134 return my_graph; in graph_reference()
1218 if(is_graph_active(this->my_graph)) { in handle_operations_impl()
1223 my_graph.reserve_wait(); in handle_operations_impl()
1231 graph &g = this->my_graph; in handle_operations_impl()
1261 graph& g = this->my_graph; in forward_task()
1292 graph& g = this->my_graph; in try_put_and_add_task()
1373 fgt_node( CODEPTR(), FLOW_BUFFER_NODE, &this->my_graph, in buffer_node()
1385 __TBB_NOINLINE_SYM buffer_node( const buffer_node& src ) : buffer_node(src.my_graph) {} in buffer_node()
1483 return my_graph; in graph_reference()
1559 fgt_node( CODEPTR(), FLOW_QUEUE_NODE, &(this->my_graph), in queue_node()
1573 fgt_node( CODEPTR(), FLOW_QUEUE_NODE, &(this->my_graph), in queue_node()
1603 fgt_node( CODEPTR(), FLOW_SEQUENCER_NODE, &(this->my_graph), in __TBB_requires()
1620 fgt_node( CODEPTR(), FLOW_SEQUENCER_NODE, &(this->my_graph), in __TBB_requires()
1670 fgt_node( CODEPTR(), FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph),
1687 fgt_node( CODEPTR(), FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph), in priority_queue_node()
1966 if ( is_graph_active(this->my_graph) ) { in forward_task()
1969 … graph_task* rtask = allocator.new_object<task_type>( my_graph, allocator, *this ); in forward_task()
1970 my_graph.reserve_wait(); in forward_task()
1986 if ( is_graph_active(this->my_graph) ) { in forward_task()
1989 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in forward_task()
1990 my_graph.reserve_wait(); in forward_task()
2001 CODEPTR(), FLOW_LIMITER_NODE, &this->my_graph, in initialize()
2025 limiter_node( const limiter_node& src ) : limiter_node(src.my_graph, src.my_threshold) {} in limiter_node()
2037 if ( is_graph_active(this->my_graph) ) { in register_successor()
2040 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_successor()
2041 my_graph.reserve_wait(); in register_successor()
2061 …my_count + my_tries < my_threshold && !my_successors.empty() && is_graph_active(this->my_graph) ) { in register_predecessor()
2064 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_predecessor()
2065 my_graph.reserve_wait(); in register_predecessor()
2096 if (check_conditions() && is_graph_active(this->my_graph)) { in try_put_task()
2099 rtask = allocator.new_object<task_type>(my_graph, allocator, *this); in try_put_task()
2100 my_graph.reserve_wait(); in try_put_task()
2121 graph& graph_reference() const override { return my_graph; } in graph_reference()
2149 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_RESERVING, &this->my_graph, in join_node()
2161 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_RESERVING, &this->my_graph, in join_node()
2176 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_QUEUEING, &this->my_graph, in join_node()
2188 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_QUEUEING, &this->my_graph, in join_node()
2229 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2235 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2241 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2248 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2257 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2267 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2277 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2287 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2297 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2318 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in join_node()
2342 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2355 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2369 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2382 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2397 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2410 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2425 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2438 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2453 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2466 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2482 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2495 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2513 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2526 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2544 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2557 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2575 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2588 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2606 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2619 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2719 fgt_multiinput_multioutput_node( CODEPTR(), FLOW_COMPOSITE_NODE, this, &this->my_graph ); in composite_node()
2893 … fgt_async_reserve(static_cast<typename async_node::receiver_type *>(my_node), &my_node->my_graph); in __TBB_requires()
2894 my_node->my_graph.reserve_wait(); in __TBB_requires()
2899 graph* g = &n->my_graph; in __TBB_requires()
2928 enqueue_in_graph_arena(this->my_graph, tasks.pop_front()); in __TBB_requires()
2946 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
2977 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
3028 fgt_node( CODEPTR(), FLOW_OVERWRITE_NODE, &this->my_graph, in overwrite_node()
3040 __TBB_NOINLINE_SYM overwrite_node( const overwrite_node& src ) : overwrite_node(src.my_graph) {} in overwrite_node()
3046 if (my_buffer_is_valid && is_graph_active( my_graph )) { in register_successor()
3061 spawn_in_graph_arena( my_graph, *t ); in register_successor()
3125 return my_graph; in graph_reference()
3178 fgt_node( CODEPTR(), FLOW_WRITE_ONCE_NODE, &(this->my_graph), in write_once_node()
3192 fgt_node( CODEPTR(), FLOW_WRITE_ONCE_NODE, &(this->my_graph), in write_once_node()