Home
last modified time | relevance | path

Searched refs:try_put_task (Results 1 – 10 of 10) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_cache_impl.h270 virtual graph_task* try_put_task( const T& t ) = 0;
329 virtual graph_task* try_put_task( const continue_msg& t ) = 0;
346 graph_task* try_put_task( const T &t ) override { in try_put_task() function
351 graph_task *new_task = (*i)->try_put_task(t); in try_put_task()
375 graph_task * new_task = (*i)->try_put_task(t); in gather_successful_try_puts()
414 graph_task* try_put_task( const T &t ) override { in try_put_task() function
418 graph_task* new_task = (*i)->try_put_task(t); in try_put_task()
H A D_flow_graph_node_impl.h89 graph_task* try_put_task( const input_type& t) override { in try_put_task() function
413 graph_task* successor_task = successors().try_put_task(v); in apply_body_impl_bypass()
577 graph_task* last_task = std::get<N-1>(p).try_put_task(std::get<N-1>(t));
587 graph_task* last_task = std::get<0>(p).try_put_task(std::get<0>(t));
665 return successors().try_put_task( v );
740 graph_task *res = try_put_task(i);
754 graph_task* try_put_task(const output_type &i) {
755 return my_successors.try_put_task(i);
H A D_flow_graph_indexer_impl.h36 return reinterpret_cast<IndexerNodeBaseType *>(p)->try_put_task(&o); in do_try_put()
78 graph_task* try_put_task(const T &v) override {
156 current->bypass_t = my_successors.try_put_task(*(current->my_arg));
189 graph_task* try_put_task(output_type const *v) { // not a virtual method in this class
H A D_flow_graph_body_impl.h339 graph_task* try_put_task( const DecrementType& value ) override {
H A D_flow_graph_join_impl.h293 graph_task* try_put_task( const T & ) override {
450 graph_task* try_put_task(const T &v) override {
596 graph_task* try_put_task(const input_type& v) override {
1115 graph_task *new_task = my_successors.try_put_task(out);
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h247 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() function
825 using input_impl_type::try_put_task; in __TBB_requires()
960 graph_task *try_put_task(const TupleType& t) override { in try_put_task() function
1073 using input_impl_type::try_put_task; in __TBB_requires()
1127 graph_task *try_put_task(const T& t) override { in try_put_task() function
1463 graph_task *try_put_task(const T &t) override { in try_put_task() function
2083 graph_task* try_put_task( const T &t ) override { in try_put_task() function
2092 graph_task* rtask = my_successors.try_put_task(t); in try_put_task()
[all …]
/oneTBB/test/tbb/
H A Dtest_limiter_node.cpp51 graph_task* try_put_task( const T &v ) override { in try_put_task() function
69 graph_task* try_put_task( const T &/*v*/ ) override { in try_put_task() function
H A Dtest_broadcast_node.cpp71 tbb::task * try_put_task( const T &v ) override { in try_put_task() function in counting_array_receiver
H A Dtest_input_node.cpp58 graph_task* try_put_task( const T &v ) override { in try_put_task() function in test_push_receiver
/oneTBB/test/common/
H A Dgraph_utils.h280 tbb::detail::d1::graph_task *try_put_task( const T & ) override {
326 tbb::detail::d1::graph_task* try_put_task( const T &t ) override {