Lines Matching refs:this
433 fgt_graph(this); in graph()
443 fgt_graph(this); in graph()
458 fgt_reserve_wait(this); in reserve_wait()
462 fgt_release_wait(this); in release_wait()
491 deactivate_graph(*this); in reset()
504 activate_graph(*this); in reset()
511 inline graph::iterator graph::begin() { return iterator(this, true); } in begin()
513 inline graph::iterator graph::end() { return iterator(this, false); } in end()
515 inline graph::const_iterator graph::begin() const { return const_iterator(this, true); } in begin()
517 inline graph::const_iterator graph::end() const { return const_iterator(this, false); } in end()
519 inline graph::const_iterator graph::cbegin() const { return const_iterator(this, true); } in cbegin()
521 inline graph::const_iterator graph::cend() const { return const_iterator(this, false); } in cend()
524 my_graph.register_node(this); in graph_node()
528 my_graph.remove_node(this); in ~graph_node()
556 , my_successors(this), my_reserved(false), my_has_cached_item(false) in __TBB_requires()
558 fgt_node_with_body(CODEPTR(), FLOW_INPUT_NODE, &this->my_graph, in __TBB_requires()
559 static_cast<sender<output_type> *>(this), this->my_body); in __TBB_requires()
568 make_edges(*this, successors); in __TBB_requires()
577 , my_successors(this), my_reserved(false), my_has_cached_item(false) in __TBB_requires()
579 fgt_node_with_body(CODEPTR(), FLOW_INPUT_NODE, &this->my_graph, in __TBB_requires()
580 static_cast<sender<output_type> *>(this), this->my_body); in __TBB_requires()
669 input_body<output_type> &body_ref = *this->my_body; in __TBB_requires()
727 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); 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()
789 …static_cast<receiver<input_type> *>(this), static_cast<sender<output_type> *>(this), this->my_body… in __TBB_requires()
803 make_edges_in_order(nodes, *this); in __TBB_requires()
817 fgt_node_with_body( CODEPTR(), FLOW_FUNCTION_NODE, &this->my_graph, in __TBB_requires()
818 …static_cast<receiver<input_type> *>(this), static_cast<sender<output_type> *>(this), this->my_body… in __TBB_requires()
837 __TBB_ASSERT(this->my_predecessors.empty(), "function_node predecessors not empty"); in __TBB_requires()
883 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
884 this->output_ports(), this->my_body in __TBB_requires()
899 make_edges_in_order(nodes, *this); in __TBB_requires()
911 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
912 this->output_ports(), this->my_body ); in __TBB_requires()
938 fgt_multioutput_node<N>(CODEPTR(), FLOW_SPLIT_NODE, &this->my_graph, in split_node()
939 static_cast<receiver<input_type> *>(this), this->output_ports()); in split_node()
945 make_edges_in_order(nodes, *this); in split_node()
953 fgt_multioutput_node<N>(CODEPTR(), FLOW_SPLIT_NODE, &this->my_graph, in split_node()
954 static_cast<receiver<input_type> *>(this), this->output_ports()); in split_node()
963 return emit_element<N>::emit_this(this->my_graph, t, output_ports()); in try_put_task()
1000 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1002 static_cast<receiver<input_type> *>(this), in __TBB_requires()
1003 … static_cast<sender<output_type> *>(this), this->my_body ); in __TBB_requires()
1017 make_edges_in_order(nodes, *this); in __TBB_requires()
1034 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1035 static_cast<receiver<input_type> *>(this), in __TBB_requires()
1036 … static_cast<sender<output_type> *>(this), this->my_body ); in __TBB_requires()
1050 make_edges_in_order(nodes, *this); in __TBB_requires()
1064 fgt_node_with_body( CODEPTR(), FLOW_CONTINUE_NODE, &this->my_graph, in __TBB_requires()
1065 static_cast<receiver<input_type> *>(this), in __TBB_requires()
1066 … static_cast<sender<output_type> *>(this), this->my_body ); in __TBB_requires()
1095 __TBB_NOINLINE_SYM explicit broadcast_node(graph& g) : graph_node(g), my_successors(this) { in broadcast_node()
1096 fgt_node( CODEPTR(), FLOW_BROADCAST_NODE, &this->my_graph, in broadcast_node()
1097 … static_cast<receiver<input_type> *>(this), static_cast<sender<output_type> *>(this) ); in broadcast_node()
1103 make_edges_in_order(nodes, *this); in broadcast_node()
1191 handle_operations_impl(op_list, this); in handle_operations()
1196 … __TBB_ASSERT(static_cast<class_type*>(derived) == this, "'this' is not a base class for derived"); in handle_operations_impl()
1218 if(is_graph_active(this->my_graph)) { in handle_operations_impl()
1222 … graph_task* new_task = allocator.new_object<task_type>(graph_reference(), allocator, *this); in handle_operations_impl()
1231 graph &g = this->my_graph; in handle_operations_impl()
1261 graph& g = this->my_graph; in forward_task()
1285 return this->my_item_valid(this->my_tail - 1); in is_item_valid()
1289 graph_task *new_task = my_successors.try_put_task(this->back()); in try_put_and_add_task()
1292 graph& g = this->my_graph; in try_put_and_add_task()
1294 this->destroy_back(); in try_put_and_add_task()
1301 internal_forward_task_impl(op, this); in internal_forward_task()
1306 … __TBB_ASSERT(static_cast<class_type*>(derived) == this, "'this' is not a base class for derived"); in internal_forward_task_impl()
1308 if (this->my_reserved || !derived->is_item_valid()) { in internal_forward_task_impl()
1310 this->forwarder_busy = false; in internal_forward_task_impl()
1331 this->push_back(*(op->elem)); in internal_push()
1338 if(this->pop_back(*(op->elem))) { in internal_pop()
1348 if(this->reserve_front(*(op->elem))) { in internal_reserve()
1357 this->consume_front(); in internal_consume()
1362 this->release_front(); in internal_release()
1370 sender<T>(), my_successors(this), forwarder_busy(false) in buffer_node()
1372 my_aggregator.initialize_handler(handler_type(this)); in buffer_node()
1373 fgt_node( CODEPTR(), FLOW_BUFFER_NODE, &this->my_graph, in buffer_node()
1374 … static_cast<receiver<input_type> *>(this), static_cast<sender<output_type> *>(this) ); in buffer_node()
1380 make_edges_in_order(nodes, *this); in buffer_node()
1406 tbb::detail::d1::remove_predecessor(r, *this); in remove_successor()
1510 return this->my_item_valid(this->my_head); in is_item_valid()
1514 graph_task *new_task = this->my_successors.try_put_task(this->front()); in try_put_and_add_task()
1517 graph& graph_ref = this->graph_reference(); in try_put_and_add_task()
1519 this->destroy_front(); in try_put_and_add_task()
1525 this->internal_forward_task_impl(op, this); in internal_forward_task()
1529 if ( this->my_reserved || !this->my_item_valid(this->my_head)){ in internal_pop()
1533 this->pop_front(*(op->elem)); in internal_pop()
1538 if (this->my_reserved || !this->my_item_valid(this->my_head)) { in internal_reserve()
1542 this->reserve_front(*(op->elem)); in internal_reserve()
1547 this->consume_front(); in internal_consume()
1559 fgt_node( CODEPTR(), FLOW_QUEUE_NODE, &(this->my_graph), in queue_node()
1560 static_cast<receiver<input_type> *>(this), in queue_node()
1561 static_cast<sender<output_type> *>(this) ); in queue_node()
1567 make_edges_in_order(nodes, *this); in queue_node()
1573 fgt_node( CODEPTR(), FLOW_QUEUE_NODE, &(this->my_graph), in queue_node()
1574 static_cast<receiver<input_type> *>(this), in queue_node()
1575 static_cast<sender<output_type> *>(this) ); in queue_node()
1603 fgt_node( CODEPTR(), FLOW_SEQUENCER_NODE, &(this->my_graph), in __TBB_requires()
1604 static_cast<receiver<input_type> *>(this), in __TBB_requires()
1605 static_cast<sender<output_type> *>(this) ); in __TBB_requires()
1613 make_edges_in_order(nodes, *this); in __TBB_requires()
1620 fgt_node( CODEPTR(), FLOW_SEQUENCER_NODE, &(this->my_graph), in __TBB_requires()
1621 static_cast<receiver<input_type> *>(this), in __TBB_requires()
1622 static_cast<sender<output_type> *>(this) ); in __TBB_requires()
1636 if (tag < this->my_head) { in __TBB_requires()
1643 size_t new_tail = (tag+1 > this->my_tail) ? tag+1 : this->my_tail; in __TBB_requires()
1645 if (this->size(new_tail) > this->capacity()) { in __TBB_requires()
1646 this->grow_my_array(this->size(new_tail)); in __TBB_requires()
1648 this->my_tail = new_tail; in __TBB_requires()
1650 const op_stat res = this->place_item(tag, *(op->elem)) ? SUCCEEDED : FAILED; in __TBB_requires()
1670 fgt_node( CODEPTR(), FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph),
1671 static_cast<receiver<input_type> *>(this),
1672 static_cast<sender<output_type> *>(this) );
1679 make_edges_in_order(nodes, *this);
1687 fgt_node( CODEPTR(), FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph), in priority_queue_node()
1688 static_cast<receiver<input_type> *>(this), in priority_queue_node()
1689 static_cast<sender<output_type> *>(this) ); in priority_queue_node()
1705 this->internal_forward_task_impl(op, this); in internal_forward_task()
1709 this->handle_operations_impl(op_list, this); in handle_operations()
1720 if ( this->my_reserved == true || this->my_tail == 0 ) { in internal_pop()
1733 if (this->my_reserved == true || this->my_tail == 0) { in internal_reserve()
1737 this->my_reserved = true; in internal_reserve()
1746 this->my_reserved = false; in internal_consume()
1753 this->my_reserved = false; in internal_release()
1761 if (mark < this->my_tail) heapify(); in order()
1762 __TBB_ASSERT(mark == this->my_tail, "mark unequal after heapify"); in order()
1766 return this->my_tail > 0; in is_item_valid()
1770 graph_task * new_task = this->my_successors.try_put_task(this->prio()); in try_put_and_add_task()
1773 graph& graph_ref = this->graph_reference(); in try_put_and_add_task()
1787 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds before test"); in prio_use_tail()
1788 …return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1)); in prio_use_tail()
1793 if ( this->my_tail >= this->my_array_size ) in prio_push()
1794 this->grow_my_array( this->my_tail + 1 ); in prio_push()
1795 (void) this->place_item(this->my_tail, src); in prio_push()
1796 ++(this->my_tail); in prio_push()
1797 __TBB_ASSERT(mark < this->my_tail, "mark outside bounds after push"); in prio_push()
1807 this->destroy_item(this->my_tail-1); in prio_pop()
1808 --(this->my_tail); in prio_pop()
1809 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop"); in prio_pop()
1812 this->destroy_item(0); in prio_pop()
1813 if(this->my_tail > 1) { in prio_pop()
1815 __TBB_ASSERT(this->my_item_valid(this->my_tail - 1), nullptr); in prio_pop()
1816 this->move_item(0,this->my_tail - 1); in prio_pop()
1818 --(this->my_tail); in prio_pop()
1819 if(mark > this->my_tail) --mark; in prio_pop()
1820 if (this->my_tail > 1) // don't reheap for heap of size 1 in prio_pop()
1822 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop"); in prio_pop()
1826 return this->get_my_item(prio_use_tail() ? this->my_tail-1 : 0); in prio()
1831 if(this->my_tail == 0) { in heapify()
1836 for (; mark<this->my_tail; ++mark) { // for each unheaped element in heapify()
1839 this->fetch_item(mark,to_place); in heapify()
1842 if (!compare(this->get_my_item(parent), to_place)) in heapify()
1844 this->move_item(cur_pos, parent); in heapify()
1847 (void) this->place_item(cur_pos, to_place); in heapify()
1857 compare(this->get_my_item(child), in reheap()
1858 this->get_my_item(child+1))) in reheap()
1861 if (compare(this->get_my_item(target), in reheap()
1862 this->get_my_item(cur_pos))) in reheap()
1865 this->swap_items(cur_pos, target); in reheap()
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()
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()
2001 CODEPTR(), FLOW_LIMITER_NODE, &this->my_graph, in initialize()
2002 … static_cast<receiver<input_type> *>(this), static_cast<receiver<DecrementType> *>(&decrement), in initialize()
2003 static_cast<sender<output_type> *>(this) in initialize()
2011 my_predecessors(this), my_successors(this), decrement(this) in limiter_node()
2020 make_edges_in_order(nodes, *this); 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()
2052 tbb::detail::d1::remove_predecessor(r, *this); in remove_successor()
2061 …if ( my_count + my_tries < my_threshold && !my_successors.empty() && is_graph_active(this->my_grap… in register_predecessor()
2064 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); 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()
2149 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_RESERVING, &this->my_graph, in join_node()
2150 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in join_node()
2156 make_edges_in_order(nodes, *this);
2161 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_RESERVING, &this->my_graph, in join_node()
2162 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in join_node()
2176 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_QUEUEING, &this->my_graph, in join_node()
2177 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in join_node()
2183 make_edges_in_order(nodes, *this);
2188 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_QUEUEING, &this->my_graph, in join_node()
2189 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in join_node()
2229 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2230 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2235 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2236 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2241 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2242 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2248 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2249 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2257 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2258 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2267 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2268 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2277 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2278 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2287 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2288 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2297 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in __TBB_requires()
2298 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in __TBB_requires()
2313 make_edges_in_order(nodes, *this); in join_node()
2318 fgt_multiinput_node<N>( CODEPTR(), FLOW_JOIN_NODE_TAG_MATCHING, &this->my_graph, in join_node()
2319 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in join_node()
2342 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2343 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2349 make_edges_in_order(nodes, *this); in indexer_node()
2355 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2356 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2369 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2370 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2376 make_edges_in_order(nodes, *this); in indexer_node()
2382 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2383 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2397 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2398 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2404 make_edges_in_order(nodes, *this); in indexer_node()
2410 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2411 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2425 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2426 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2432 make_edges_in_order(nodes, *this); in indexer_node()
2438 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2439 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2453 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2454 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2460 make_edges_in_order(nodes, *this); in indexer_node()
2466 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2467 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2482 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2483 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2489 make_edges_in_order(nodes, *this); in indexer_node()
2495 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2496 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2513 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2514 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2520 make_edges_in_order(nodes, *this); in indexer_node()
2526 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2527 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2544 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2545 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2551 make_edges_in_order(nodes, *this); in indexer_node()
2557 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2558 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2575 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2576 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2582 make_edges_in_order(nodes, *this); in indexer_node()
2588 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2589 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2606 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2607 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2613 make_edges_in_order(nodes, *this); in indexer_node()
2619 fgt_multiinput_node<N>( CODEPTR(), FLOW_INDEXER_NODE, &this->my_graph, in indexer_node()
2620 … this->input_ports(), static_cast< sender< output_type > *>(this) ); in indexer_node()
2719 fgt_multiinput_multioutput_node( CODEPTR(), FLOW_COMPOSITE_NODE, this, &this->my_graph ); in composite_node()
2727 fgt_internal_input_alias_helper<T1, NUM_INPUTS>::alias_port( this, input_ports_tuple); in set_external_ports()
2728 fgt_internal_output_alias_helper<T2, NUM_OUTPUTS>::alias_port( this, output_ports_tuple); in set_external_ports()
2735 void add_visible_nodes(const NodeTypes&... n) { add_nodes_impl(this, true, n...); } in add_visible_nodes()
2738 void add_nodes(const NodeTypes&... n) { add_nodes_impl(this, false, n...); } in add_nodes()
2767 fgt_composite( CODEPTR(), this, &g ); in composite_node()
2774 fgt_internal_input_alias_helper<T, NUM_INPUTS>::alias_port( this, input_ports_tuple); in set_external_ports()
2780 void add_visible_nodes(const NodeTypes&... n) { add_nodes_impl(this, true, n...); } in add_visible_nodes()
2783 void add_nodes( const NodeTypes&... n) { add_nodes_impl(this, false, n...); } in add_nodes()
2808 fgt_composite( CODEPTR(), this, &g ); in composite_node()
2815 fgt_internal_output_alias_helper<T, NUM_OUTPUTS>::alias_port( this, output_ports_tuple); in set_external_ports()
2821 void add_visible_nodes(const NodeTypes&... n) { add_nodes_impl(this, true, n...); } in add_visible_nodes()
2824 void add_nodes(const NodeTypes&... n) { add_nodes_impl(this, false, n...); } in add_nodes()
2861 tbb::detail::invoke(my_body, v, *this->my_gateway); in operator()
2914 async_node* self() { return this; } in __TBB_requires()
2918 multifunction_output<Output> &port_0 = output_port<0>(*this); in __TBB_requires()
2920 fgt_async_try_put_begin(this, &port_0); in __TBB_requires()
2928 enqueue_in_graph_arena(this->my_graph, tasks.pop_front()); in __TBB_requires()
2930 fgt_async_try_put_end(this, &port_0); in __TBB_requires()
2946 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
2947 this->output_ports(), this->my_body in __TBB_requires()
2963 make_edges_in_order(nodes, *this); in __TBB_requires()
2973 static_cast<async_body_base_type*>(this->my_body->get_body_ptr())->set_gateway(&my_gateway); in __TBB_requires()
2974 … static_cast<async_body_base_type*>(this->my_init_body->get_body_ptr())->set_gateway(&my_gateway); in __TBB_requires()
2977 &this->my_graph, static_cast<receiver<input_type> *>(this), in __TBB_requires()
2978 this->output_ports(), this->my_body ); in __TBB_requires()
3003 mfn_body_type &body_ref = *this->my_body; in __TBB_requires()
3026 : graph_node(g), my_successors(this), my_buffer_is_valid(false) in overwrite_node()
3028 fgt_node( CODEPTR(), FLOW_OVERWRITE_NODE, &this->my_graph, in overwrite_node()
3029 … static_cast<receiver<input_type> *>(this), static_cast<sender<output_type> *>(this) ); in overwrite_node()
3035 make_edges_in_order(nodes, *this); in overwrite_node()
3059 … graph_task* t = allocator.new_object<task_type>(graph_reference(), allocator, *this, s); in register_successor()
3178 fgt_node( CODEPTR(), FLOW_WRITE_ONCE_NODE, &(this->my_graph), in write_once_node()
3179 static_cast<receiver<input_type> *>(this), in write_once_node()
3180 static_cast<sender<output_type> *>(this) ); in write_once_node()
3186 make_edges_in_order(nodes, *this); in write_once_node()
3192 fgt_node( CODEPTR(), FLOW_WRITE_ONCE_NODE, &(this->my_graph), in write_once_node()
3193 static_cast<receiver<input_type> *>(this), in write_once_node()
3194 static_cast<sender<output_type> *>(this) ); in write_once_node()
3202 spin_mutex::scoped_lock l( this->my_mutex ); in try_put_task()
3203 return this->my_buffer_is_valid ? nullptr : this->try_put_task_impl(v); in try_put_task()