Home
last modified time | relevance | path

Searched refs:t (Results 1 – 25 of 120) sorted by relevance

12345

/oneTBB/src/tbb/
H A Dtask_dispatcher.h54 return t; in get_self_recall_task()
222 t = get_critical_task(t, ed, isolation, critical_allowed); in receive_or_steal_task()
239 return t; in receive_or_steal_task()
276 ed.context = t ? task_accessor::context(*t) : nullptr; in local_wait_for_all()
285 t = get_critical_task(t, ed, isolation, critical_allowed); in local_wait_for_all()
321 t = t->cancel(ed); in local_wait_for_all()
323 t = t->execute(ed); in local_wait_for_all()
403 return t; in get_critical_task()
427 t = crit_t; in get_critical_task()
433 return t; in get_critical_task()
[all …]
H A Dtask_dispatcher.cpp25 slot->spawn(t); in spawn_and_notify()
36 task_accessor::context(t) = &ctx; in spawn()
39 spawn_and_notify(t, slot, a); in spawn()
50 task_accessor::context(t) = &ctx; in spawn()
52 task_accessor::isolation(t) = ed.isolation; in spawn()
73 spawn_and_notify(t, slot, a); in spawn()
84 task_accessor::context(t) = &ctx; in submit()
98 slot->spawn(t); in submit()
120 task_accessor::context(t) = &t_ctx; in execute_and_wait()
160 if (t) { in execute_and_wait()
[all …]
H A Dwaiters.h57 bool continue_execution(arena_slot& slot, d1::task*& t) const { in continue_execution() argument
58 __TBB_ASSERT(t == nullptr, nullptr); in continue_execution()
65 t = get_self_recall_task(slot); in continue_execution()
127 bool continue_execution(arena_slot& slot, d1::task*& t) const { in continue_execution() argument
128 __TBB_ASSERT(t == nullptr, nullptr); in continue_execution()
131 t = get_self_recall_task(slot); in continue_execution()
163 bool continue_execution(arena_slot& slot, d1::task*& t) const { in continue_execution() argument
164 __TBB_ASSERT(t == nullptr, nullptr); in continue_execution()
165 t = get_self_recall_task(slot); in continue_execution()
185 static bool postpone_execution(d1::task& t) { in postpone_execution() argument
[all …]
H A Dscheduler_common.h107 static d1::task_group_context*& context(d1::task& t) { in context()
111 static isolation_type& isolation(d1::task& t) { in isolation()
115 static void set_proxy_trait(d1::task& t) { in set_proxy_trait()
118 t.m_version_and_traits |= proxy_task_trait; in set_proxy_trait()
120 static bool is_proxy_task(d1::task& t) { in is_proxy_task()
121 return (t.m_version_and_traits & proxy_task_trait) != 0; in is_proxy_task()
123 static void set_resume_trait(d1::task& t) { in set_resume_trait()
125 t.m_version_and_traits |= resume_task_trait; in set_resume_trait()
127 static bool is_resume_task(d1::task& t) { in is_resume_task()
349 inline void assert_task_valid(const d1::task* t) { in assert_task_valid() argument
[all …]
H A Dmailbox.h159 void push( task_proxy* t ) { in push() argument
160 assert_pointer_valid(t); in push()
161 t->next_in_mailbox.store(nullptr, std::memory_order_relaxed); in push()
162 atomic_proxy_ptr* const link = my_last.exchange(&t->next_in_mailbox); in push()
167 link->store(t, std::memory_order_release); in push()
191 for( ; task_proxy* t = my_first; ) { in drain()
192 my_first.store(t->next_in_mailbox, std::memory_order_relaxed); in drain()
193 t->allocator.delete_object(t); in drain()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtriangle.cpp71 tri *t; in newtri() local
87 t->v0 = v0; in newtri()
88 t->edge1 = edge1; in newtri()
98 stri *t; in newstri() local
114 t->v0 = v0; in newstri()
117 t->n0 = n0; in newstri()
118 t->n1 = n1; in newstri()
119 t->n2 = n2; in newstri()
140 tri *t = (tri *)obj; in tri_bbox() local
143 VAdd(&t->v0, &t->edge1, &v1); in tri_bbox()
[all …]
H A Dintersect.cpp112 intstruct->list[0].t = FHUGE; in reset_intersection()
114 intstruct->list[1].t = FHUGE; in reset_intersection()
118 void add_intersection(flt t, object *obj, ray *ry) { in add_intersection() argument
121 if (t > EPSILON) { in add_intersection()
123 if (t < ry->maxdist) { in add_intersection()
124 ry->maxdist = t; in add_intersection()
134 intstruct->list[intstruct->num].t = t; in add_intersection()
140 *t = FHUGE; in closest_intersection()
143 if (intstruct->list[i].t < *t) { in closest_intersection()
144 *t = intstruct->list[i].t; in closest_intersection()
[all …]
H A Dcylinder.cpp92 flt t, s, tin, tout, ln, d; in cylinder_intersect() local
121 VDOT(t, O, n); in cylinder_intersect()
122 t = -t / ln; in cylinder_intersect()
127 tin = t - s; in cylinder_intersect()
129 tout = t + s; in cylinder_intersect()
136 flt t; in cylinder_normal() local
144 VDOT(t, a, c); in cylinder_normal()
226 VDOT(t, O, n); in fcylinder_intersect()
227 t = -t / ln; in fcylinder_intersect()
232 tin = t - s; in fcylinder_intersect()
[all …]
H A Dring.cpp96 flt t, td; in ring_intersect() local
101 t = -(d + VDot(&(rng->norm), &(ry->o))); in ring_intersect()
104 t = t / td; in ring_intersect()
105 if (t >= 0.0) { in ring_intersect()
106 hit = Raypnt(ry, t); in ring_intersect()
111 add_intersection(t, (object *)rng, ry); in ring_intersect()
H A Dplane.cpp85 flt t, td; in plane_intersect() local
87 t = -(pln->d + VDot(&pln->norm, &ry->o)); in plane_intersect()
90 t /= td; in plane_intersect()
91 if (t > 0.0) in plane_intersect()
92 add_intersection(t, (object *)pln, ry); in plane_intersect()
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp334 tag_t t; in operator ()() local
335 t.tag = 0; in operator ()()
336 t.a[0] = k; in operator ()()
343 t.a[2] = k; in operator ()()
365 tag_t t; in operator ()() local
366 t.tag = 0; in operator ()()
367 t.a[0] = k; in operator ()()
396 tag_t t; in operator ()() local
397 t.tag = 0; in operator ()()
497 tag_t t; in func() local
[all …]
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp50 TextSlice* t = (TextSlice*)oneapi::tbb::tbb_allocator<char>().allocate(sizeof(TextSlice) + in allocate() local
52 t->logical_end = t->begin(); in allocate()
53 t->physical_end = t->begin() + max_size; in allocate()
54 return t; in allocate()
122 TextSlice* t = next_slice; in operator ()() local
124 char* p = t->end() + n; in operator ()()
128 while (p > t->begin() && isdigit(p[-1])) in operator ()()
130 assert(p > t->begin()); // Number too large to fit in buffer in operator ()()
131 next_slice->append(p, t->end() + n); in operator ()()
133 t->set_end(p); in operator ()()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_impl.h41 bool push( T& t ) { in push() argument
42 return this->push_back( t ); in push()
163 operation_type(op_type t) : type(char(t)), r(nullptr), bypass_t(nullptr) {} in operation_type() argument
272 return apply_body_bypass(t); in try_put_task_impl()
277 return apply_body_bypass(t); in try_put_task_impl()
285 return create_body_task(t); in try_put_task_impl()
307 return t; in create_body_task()
334 return t; in create_forward_task()
566 if (t && t != SUCCESSFULLY_ENQUEUED) {
567 spawn_in_graph_arena(g, *t);
[all …]
H A D_flow_graph_trace_impl.h196 itt_make_task_group( ITT_DOMAIN_FLOW, input_port, FLOW_NODE, g, FLOW_GRAPH, t );
203 itt_make_task_group( ITT_DOMAIN_FLOW, input_port, FLOW_NODE, g, FLOW_GRAPH, t );
211 itt_make_task_group( ITT_DOMAIN_FLOW, output_port, FLOW_NODE, g, FLOW_GRAPH, t );
216 static inline void fgt_multiinput_multioutput_node( void* codeptr, string_resource_index t, void *n…
217 itt_make_task_group( ITT_DOMAIN_FLOW, n, FLOW_NODE, g, FLOW_GRAPH, t );
226 static inline void fgt_node( void* codeptr, string_resource_index t, void *g, void *output_port ) {
227 itt_make_task_group( ITT_DOMAIN_FLOW, output_port, FLOW_NODE, g, FLOW_GRAPH, t );
232 itt_make_task_group( ITT_DOMAIN_FLOW, output_port, FLOW_NODE, g, FLOW_GRAPH, t );
238 fgt_node( codeptr, t, g, output_port );
243 fgt_node_with_body( codeptr, t, g, output_port, body );
[all …]
H A D_task.h50 TBB_EXPORT void __TBB_EXPORTED_FUNC spawn(d1::task& t, d1::task_group_context& ctx);
51 TBB_EXPORT void __TBB_EXPORTED_FUNC spawn(d1::task& t, d1::task_group_context& ctx, d1::slot_id id);
52 TBB_EXPORT void __TBB_EXPORTED_FUNC execute_and_wait(d1::task& t, d1::task_group_context& t_ctx, d1…
180 inline void spawn(task& t, task_group_context& ctx) { in spawn() argument
181 call_itt_task_notify(releasing, &t); in spawn()
182 r1::spawn(t, ctx); in spawn()
185 inline void spawn(task& t, task_group_context& ctx, slot_id id) { in spawn() argument
186 call_itt_task_notify(releasing, &t); in spawn()
187 r1::spawn(t, ctx, id); in spawn()
190 inline void execute_and_wait(task& t, task_group_context& t_ctx, wait_context& wait_ctx, task_group… in execute_and_wait() argument
[all …]
H A D_flow_graph_join_impl.h228 reserving_port_operation(const predecessor_type &s, op_type t) : type(char(t)),
230 reserving_port_operation(op_type t) : type(char(t)) {}
396 queueing_port_operation(op_type t) : type(char(t)), my_arg(nullptr)
556 key_matching_port_operation(op_type t) : type(char(t)), my_arg(nullptr) {}
776 return t;
864 … key_matching_FE_operation(const unref_key_type& e , op_type t) : type(char(t)), my_val(e),
868 … key_matching_FE_operation(op_type t) : type(char(t)), my_output(nullptr), bypass_t(nullptr) {}
882 this->current_key = t;
1055 join_node_base_operation(const output_type& e, op_type t) : type(char(t)),
1057 join_node_base_operation(const successor_type &s, op_type t) : type(char(t)),
[all …]
H A D_task_handle.h87 task_handle(task_handle_task* t) : m_handle {t}{}; in task_handle() argument
95 static task_handle construct(task_handle_task* t) { return {t}; } in construct()
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp54 ValueType t = (ValueType)i / (ValueType)UniverseHeight; in InitializeUniverse() local
60 if (t < 0.3f) { in InitializeUniverse()
65 else if (fabs(t - 0.7 + 0.2 * exp(-8 * x * x) + 0.025 * x) <= 0.1) { in InitializeUniverse()
82 ValueType t = (i - ColorMapSize / 2) * scale; in InitializeUniverse() local
83 ValueType r = t > 0 ? t : 0; in InitializeUniverse()
84 ValueType b = t < 0 ? -t : 0; in InitializeUniverse()
85 ValueType g = 0.5f * fabs(t); in InitializeUniverse()
110 ValueType t = (pulseCounter - pulseTime / 2) * 0.05f; in UpdatePulse() local
111 V[pulseY][pulseX] += 64 * sqrt(M[pulseY][pulseX]) * exp(-t * t); in UpdatePulse()
/oneTBB/test/tbb/
H A Dtest_composite_node.cpp116 tiny_node t(g, hidden); in test_tiny() local
117 …CHECK_MESSAGE( (&tbb::flow::input_port<0>(t) == &t.f1), "f1 not bound to input port 0 in composite… in test_tiny()
118 …CHECK_MESSAGE( (&tbb::flow::output_port<0>(t) == &t.f2), "f2 not bound to output port 0 in composi… in test_tiny()
132 tbb::flow::make_edge( f0, t ); in test_tiny()
133 tbb::flow::make_edge( t, t1 ); in test_tiny()
175 return std::get<0>(t) + std::get<1>(t); in operator ()()
354 return my_tuple_t( std::get<0>(t), in operator ()()
355 std::get<0>(t) + std::get<1>(t), in operator ()()
356 std::get<0>(t) + std::get<1>(t) + std::get<2>(t), in operator ()()
357 std::get<0>(t) + std::get<1>(t) + std::get<2>(t) + std::get<3>(t), in operator ()()
[all …]
H A Dtest_write_once_node.cpp42 for ( int t = 0; t < T; ++t ) { in simple_read_write_tests() local
53 if ( t % 2 ) { in simple_read_write_tests()
64 if ( t%2 ) { in simple_read_write_tests()
75 if ( !(t%2) && i == 1 ) in simple_read_write_tests()
85 if ( t%2 ) in simple_read_write_tests()
134 for ( int t = 0; t < T; ++t ) { in parallel_read_write_tests() local
H A Dtest_buffer_node.cpp104 parallel_gets( tbb::flow::buffer_node<T> &b, touches<T> &t) : my_b(b), my_touches(t) {} in parallel_gets()
122 parallel_put_get( tbb::flow::buffer_node<T> &b, touches<T> &t ) : my_b(b), my_touches(t) {} in parallel_put_get()
229 touches< T > t( num_threads ); in test_parallel() local
230 NativeParallelFor( num_threads, parallel_gets<T>(b, t) ); in test_parallel()
232 CHECK_MESSAGE( t.validate_touches(), "" ); in test_parallel()
240 touches< T > t( num_threads ); in test_parallel() local
243 CHECK_MESSAGE( t.validate_touches(), "" ); in test_parallel()
254 touches< T > t( num_threads ); in test_parallel() local
257 CHECK_MESSAGE( t.validate_touches(), "" ); in test_parallel()
284 touches< T > t( num_threads ); in test_parallel() local
[all …]
H A Dtest_overwrite_node.cpp41 for ( int t = 0; t < T; ++t ) { in simple_read_write_tests() local
50 if ( t % 2 ) { in simple_read_write_tests()
73 CHECK_MESSAGE( int(c) == N+t%2, "" ); in simple_read_write_tests()
81 CHECK_MESSAGE( int(c) == N+t%2, "" ); in simple_read_write_tests()
112 for ( int t = 0; t < T; ++t ) { in parallel_read_write_tests() local
H A Dtest_enumerable_thread_specific.cpp73 T& check_alignment(T& t, const char *aname) { in check_alignment() argument
74 if( !tbb::detail::is_aligned(&t, AlignMask)) { in check_alignment()
76 REPORT("alignment error with %s allocator (%x)\n", aname, (int)size_t(&t) & (AlignMask-1)); in check_alignment()
78 return t; in check_alignment()
82 const T& check_alignment(const T& t, const char *aname) { in check_alignment() argument
83 if( !tbb::detail::is_aligned(&t, AlignMask)) { in check_alignment()
85 REPORT("alignment error with %s allocator (%x)\n", aname, (int)size_t(&t) & (AlignMask-1)); in check_alignment()
87 return t; in check_alignment()
344 typedef struct { char t; U padded; } test_alignment; member
/oneTBB/include/oneapi/tbb/
H A Dpartitioner.h144 static void mark_task_stolen(Task &t) { in mark_task_stolen()
154 static bool is_peer_stolen(Task &t) { in is_peer_stolen()
374 spawn(t, ctx, slot_id(my_head)); in spawn_task()
376 spawn(t, ctx); in spawn_task()
419 tree_node::mark_task_stolen(t); in check_being_stolen()
456 bool check_for_demand(Task& t) { in check_for_demand()
492 bool check_for_demand(Task& t) { in check_for_demand() argument
493 if (tree_node::is_peer_stolen(t)) { in check_for_demand()
499 spawn(t, ctx); in spawn_task()
516 spawn(t, ctx); in spawn_task()
[all …]
/oneTBB/test/conformance/
H A Dconformance_resumable_tasks.cpp36 std::thread t; variable
37 oneapi::tbb::task::suspend([&t, &suspend, &resume](oneapi::tbb::task::suspend_point sp) { in __anon366fea4d0102()
39 t = std::thread([sp, &resume] { in __anon366fea4d0102()
48 t.join();

12345