167 static inline std::pair<graph_task*, graph_task*> order_tasks(graph_task* first, graph_task* second…  in order_tasks()
174 static inline graph_task* combine_tasks(graph& g, graph_task* left, graph_task* right) {  in combine_tasks()
247         graph_task *res = try_put_task(t);  in try_put()
264     virtual graph_task *try_put_task(const T& t) = 0;
341     graph_task* try_put_task( const input_type & ) override {  in try_put_task()
349         graph_task* res = execute();  in try_put_task()
372     virtual graph_task* execute() = 0;
724     graph_task* create_put_task() {  in __TBB_requires()
727         graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);  in __TBB_requires()
741     graph_task* apply_body_bypass( ) {  in __TBB_requires()
746         graph_task *last_task = my_successors.try_put_task(v);  in __TBB_requires()
960     graph_task *try_put_task(const TupleType& t) override {  in try_put_task()
1127     graph_task *try_put_task(const T& t) override {  in try_put_task()
1128         graph_task *new_task = my_successors.try_put_task(t);  in try_put_task()
1175         graph_task* ltask;
1222 …       graph_task* new_task = allocator.new_object<task_type>(graph_reference(), allocator, *this);  in handle_operations_impl()
1230                 graph_task *z = tmp->ltask;  in handle_operations_impl()
1237     inline graph_task *grab_forwarding_task( buffer_operation &op_data) {  in grab_forwarding_task()
1242         graph_task *ft = grab_forwarding_task(op_data);  in enqueue_forwarding_task()
1251     virtual graph_task *forward_task() {  in forward_task()
1253         graph_task *last_task = nullptr;  in forward_task()
1260             graph_task *xtask = op_data.ltask;  in forward_task()
1288     void try_put_and_add_task(graph_task*& last_task) {  in try_put_and_add_task()
1289         graph_task *new_task = my_successors.try_put_task(this->back());  in try_put_and_add_task()
1314         graph_task* last_task = nullptr;  in internal_forward_task_impl()
1463     graph_task *try_put_task(const T &t) override {  in try_put_task()
1466         graph_task *ft = grab_forwarding_task(op_data);  in try_put_task()
1513     void try_put_and_add_task(graph_task*& last_task) {  in try_put_and_add_task()
1514         graph_task *new_task = this->my_successors.try_put_task(this->front());  in try_put_and_add_task()
1769     void try_put_and_add_task(graph_task*& last_task) {  in try_put_and_add_task()
1770         graph_task * new_task = this->my_successors.try_put_task(this->prio());  in try_put_and_add_task()
1897     graph_task* decrement_counter( long long delta ) {  in decrement_counter()
1931     graph_task* forward_task() {  in forward_task()
1933         graph_task* rval = nullptr;  in forward_task()
1969 …                 graph_task* rtask = allocator.new_object<task_type>( my_graph, allocator, *this );  in forward_task()
1989                     graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);  in forward_task()
2040                 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);  in register_successor()
2064             graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);  in register_predecessor()
2083     graph_task* try_put_task( const T &t ) override {  in try_put_task()
2092         graph_task* rtask = my_successors.try_put_task(t);  in try_put_task()
3059 …           graph_task* t = allocator.new_object<task_type>(graph_reference(), allocator, *this, s);  in register_successor()
3111     graph_task* try_put_task( const input_type &v ) override {  in try_put_task()
3116     graph_task * try_put_task_impl(const input_type &v) {  in try_put_task_impl()
3119         graph_task* rtask = my_successors.try_put_task(v);  in try_put_task_impl()
3129     struct register_predecessor_task : public graph_task {
3132             : graph_task(g, allocator), o(owner), s(succ) {};  in register_predecessor_task()
3201     graph_task *try_put_task( const T &v ) override {  in try_put_task()