Home
last modified time | relevance | path

Searched refs:q (Results 1 – 25 of 27) sorted by relevance

12

/oneTBB/examples/parallel_for/tachyon/src/
H A Dquadric.cpp78 return q; in newquadric()
102 (q->mat.g * rd.y) + (q->mat.h * ro.z * rd.z) + (q->mat.i * rd.z)); in quadric_intersect()
105 (2.0 * q->mat.c * ro.x * ro.z) + (2.0 * q->mat.d * ro.x) + (q->mat.e * (ro.y * ro.y)) + in quadric_intersect()
106 (2.0 * q->mat.f * ro.y * ro.z) + (2.0 * q->mat.g * ro.y) + (q->mat.h * (ro.z * ro.z)) + in quadric_intersect()
107 (2.0 * q->mat.i * ro.z) + q->mat.j; in quadric_intersect()
126 N->x = (q->mat.a * (pnt->x - q->ctr.x) + q->mat.b * (pnt->y - q->ctr.y) + in quadric_normal()
127 q->mat.c * (pnt->z - q->ctr.z) + q->mat.d); in quadric_normal()
129 N->y = (q->mat.b * (pnt->x - q->ctr.x) + q->mat.e * (pnt->y - q->ctr.y) + in quadric_normal()
130 q->mat.f * (pnt->z - q->ctr.z) + q->mat.g); in quadric_normal()
132 N->z = (q->mat.c * (pnt->x - q->ctr.x) + q->mat.f * (pnt->y - q->ctr.y) + in quadric_normal()
[all …]
H A Dtrace.threads2d.cpp201 q->pch.starty = starty; in generate_work()
202 q->pch.stopy = stopy; in generate_work()
203 q->pch.startx = startx; in generate_work()
204 q->pch.stopx = stopx; in generate_work()
205 q->next = nullptr; in generate_work()
207 work_queue_head = q; in generate_work()
210 work_queue_tail->next = q; in generate_work()
212 work_queue_tail = q; in generate_work()
228 if (q != nullptr) { in schedule_thread_work()
229 pch = q->pch; in schedule_thread_work()
[all …]
H A Dapi.cpp391 quadric *q; in rt_quadsphere() local
396 q->ctr = ctr; in rt_quadsphere()
398 q->mat.a = factor; in rt_quadsphere()
399 q->mat.b = 0.0; in rt_quadsphere()
400 q->mat.c = 0.0; in rt_quadsphere()
401 q->mat.d = 0.0; in rt_quadsphere()
402 q->mat.e = factor; in rt_quadsphere()
403 q->mat.f = 0.0; in rt_quadsphere()
404 q->mat.g = 0.0; in rt_quadsphere()
406 q->mat.i = 0.0; in rt_quadsphere()
[all …]
/oneTBB/test/tbb/
H A Dtest_priority_queue_node.cpp57 parallel_puts( tbb::flow::priority_queue_node<T> &q ) : my_q(q) {} in parallel_puts()
69 parallel_gets( tbb::flow::priority_queue_node<T> &q) : my_q(q) {} in parallel_gets()
84 parallel_put_get( tbb::flow::priority_queue_node<T> &q ) : my_q(q) {} in parallel_put_get()
117 q.try_put(T(1)); in test_reservation()
118 q.try_put(T(2)); in test_reservation()
119 q.try_put(T(3)); in test_reservation()
177 spin_try_get( q, j ); in test_parallel()
199 tbb::flow::make_edge( q, q2 ); in test_parallel()
270 spin_try_get( q, j ); in test_serial()
278 tbb::flow::make_edge( q, q2 ); in test_serial()
[all …]
H A Dtest_concurrent_queue_whitebox.cpp47 : q(queue), elem_num(el_num) {} in FloggerBody()
53 q.push(elem); in operator ()()
54 bool res = q.try_pop(elem); in operator ()()
60 Q& q; member in FloggerBody
66 std::size_t nq = q.my_queue_representation->n_queue; in test_flogger_help()
70 q.my_queue_representation->head_counter = hack_val; in test_flogger_help()
71 q.my_queue_representation->tail_counter = hack_val; in test_flogger_help()
90 tbb::concurrent_queue<int> q; variable
91 test_flogger_help(q, q.my_queue_representation->items_per_page);
98 tbb::concurrent_bounded_queue<int> q; variable
[all …]
H A Dtest_queue_node.cpp70 parallel_puts( tbb::flow::queue_node<T> &q ) : my_q(q) {} in parallel_puts()
156 parallel_gets( tbb::flow::queue_node<T> &q, touches<T> &t) : my_q(q), my_touches(t) {} in parallel_gets()
174 parallel_put_get( tbb::flow::queue_node<T> &q, touches<T> &t ) : my_q(q), my_touches(t) {} in parallel_put_get()
206 tbb::flow::queue_node<T> q(g); in test_reservation() local
208 q.try_put(T(1)); in test_reservation()
209 q.try_put(T(2)); in test_reservation()
210 q.try_put(T(3)); in test_reservation()
267 spin_try_get( q, j ); in test_parallel()
388 spin_try_get( q, j ); in test_serial()
545 bool res = q.try_put(42);
[all …]
H A Dtest_concurrent_queue.cpp34 TestQueueElements( CQ& q, std::size_t n ) : queue(q), nthread(n) {} in TestQueueElements()
227 void fill_and_catch(Container& q, std::size_t elements_count) { in fill_and_catch() argument
233 q.emplace(); in fill_and_catch()
257 Container q; in test_tracking_dtors_on_clear() local
258 fill_and_catch(q, elements_count); in test_tracking_dtors_on_clear()
260 q.clear(); in test_tracking_dtors_on_clear()
262 CHECK(q.empty()); in test_tracking_dtors_on_clear()
270 Container q; in test_tracking_dtors_on_clear() local
271 fill_and_catch(q, elements_count); in test_tracking_dtors_on_clear()
H A Dtest_composite_node.cpp137 tbb::flow::make_edge(f3, q); in test_tiny()
142 q.try_get(i); in test_tiny()
144 q.try_get(j); in test_tiny()
148 tbb::flow::remove_edge(f3, q); in test_tiny()
153 tbb::flow::make_edge(f3, q); in test_tiny()
158 q.try_get(i); in test_tiny()
160 q.try_get(j); in test_tiny()
237 tbb::flow::make_edge( s2, q ); in test_adder()
250 q.try_get(j); in test_adder()
256 tbb::flow::remove_edge(s2, q); in test_adder()
[all …]
H A Dtest_sequencer_node.cpp45 bool wait_try_get( tbb::flow::graph &g, tbb::flow::sequencer_node<T> &q, T &value ) { in wait_try_get() argument
47 return q.try_get(value); in wait_try_get()
51 void spin_try_get( tbb::flow::queue_node<T> &q, T &value ) { in spin_try_get() argument
52 while ( q.try_get(value) != true ) ; in spin_try_get()
61 …parallel_puts( tbb::flow::sequencer_node<T> &q, int num_threads ) : my_q(q), my_num_threads(num_th… in parallel_puts()
143 …parallel_gets( tbb::flow::sequencer_node<T> &q, int num_threads, touches<T> &t ) : my_q(q), my_num… in parallel_gets()
H A Dtest_concurrent_priority_queue.cpp116 CPQExTestType q; in test_exceptions() local
128 CPQExTestType q(TOO_LARGE_SZ); in test_exceptions() local
139 CPQExTestType q(src_q); in test_exceptions() local
H A Dtest_flow_graph_priorities.cpp222 if ( q.empty() ) in try_pop()
224 item = q.front(); in try_pop()
225 q.pop(); in try_pop()
231 q.push(item); in push()
234 std::queue<T> q; member in ThreadsEagerReaction::concurrent_queue
/oneTBB/test/common/
H A Dconcurrent_priority_queue_common.h49 static void push(Q& q, T&& t) { in push()
50 q.push(std::forward<T>(t)); in push()
57 q.push(std::move(t)); in push()
93 QueueType q1(q), q2(q); in examine()
237 case 0: q.push(e); break; in push_selector()
239 case 2: q.emplace(e); break; in push_selector()
278 : my_max(max), q(cpq) {} in EmptyBody()
282 if (q->try_pop(last)) { in operator()
302 : q(cpq) {} in FloggerBody()
308 q->try_pop(elem); in operator()
[all …]
H A Dconcurrency_tracker.h38 unsigned q = ctPeakParallelism; in Started() local
39 while( q<p ) { in Started()
40 ctPeakParallelism.compare_exchange_strong(q, p); in Started()
H A Dexception_handling.h68 intptr_t q = g_ActualMaxThreads; in on_scheduler_entry() local
69 while(q < p) { in on_scheduler_entry()
70 g_ActualMaxThreads.compare_exchange_strong(q, p); in on_scheduler_entry()
/oneTBB/test/conformance/
H A Dconformance_concurrent_priority_queue.cpp38 std::vector<int> from_cpq = toVector(q); in test_to_vector()
460 cpq_type q(v.begin(), v.end()); in test_assignment_clear_swap() local
464 qo = q; in test_assignment_clear_swap()
479 q.clear(); in test_assignment_clear_swap()
481 REQUIRE_MESSAGE(q.empty(), "Failed clear empty test"); in test_assignment_clear_swap()
487 q = qo; in test_assignment_clear_swap()
494 q.swap(qo); in test_assignment_clear_swap()
497 REQUIRE_MESSAGE(!q.empty(), "Failed swap empty test"); in test_assignment_clear_swap()
510 push_selector(q, e, i); in test_serial_push_pop()
518 while(!q.empty()) { in test_serial_push_pop()
[all …]
H A Dconformance_concurrent_queue.cpp947 q->abort(); in operator ()()
978 q->pop(e); in operator ()()
1179 CQ q; in TestMoveSupport() local
1240 CHECK(std::equal(q.unsafe_begin(), q.unsafe_end(), vec.begin())); in AssertEquality()
1245 CHECK(q.empty()); in AssertEmptiness()
1246 CHECK(!q.size()); in AssertEmptiness()
1288 q.abort(); in bounded_queue_specific_test()
1480 QueueType q; in TestQueueIteratorComparisons() local
1481 q.emplace(1); in TestQueueIteratorComparisons()
1482 q.emplace(2); in TestQueueIteratorComparisons()
[all …]
H A Dconformance_composite_node.cpp103 oneapi::tbb::flow::queue_node<int> q(g);
110 …auto input_tuple = std::tie(ct, s, m_fxn, fxn, bc, oneapi::tbb::flow::input_port<0>(j), lim, q, on…
113 q, pq, ovw, wo, bf, seq);
119 a_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
120 a_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
134 b_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
135 b_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
148 c_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
150 c_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
/oneTBB/examples/parallel_pipeline/square/
H A Dsquare.cpp149 char* q = out->begin(); in operator ()() local
152 *q++ = *p++; in operator ()()
160 sprintf(q, "%ld", y); in operator ()()
161 q = strchr(q, 0); in operator ()()
163 out->set_end(q); in operator ()()
/oneTBB/doc/main/tbb_userguide/
H A DIterating_Over_a_Concurrent_Queue_for_Debugging.rst19 concurrent_queue<Foo> q;
22 for(iter i(q.unsafe_begin()); i!=q.unsafe_end(); ++i ) {
H A Dbroadcast_or_send.rst47 priority_queue_node< int > q(g);
50 make_edge( q, f1 );
51 make_edge( q, f2 );
53 q.try_put( i );
H A DWorking_on_the_Assembly_Line_pipeline.rst258 char* q = out->begin();
261 *q++ = *p++;
269 sprintf(q,"%ld",y);
270 q = strchr(q,0);
272 out->set_end(q);
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_queue_base.h131 padded_page* q = tail_page.load(std::memory_order_relaxed); in prepare_page() local
132 if (is_valid_page(q)) { in prepare_page()
133 q->next = p; in prepare_page()
269 padded_page* q = tail_page.load(std::memory_order_relaxed); in invalidate_page() local
270 if (is_valid_page(q)) { in invalidate_page()
271 q->next = invalid_page; in invalidate_page()
382 padded_page* q = p->next; in ~micro_queue_pop_finalizer() local
383 my_queue.head_page.store(q, std::memory_order_relaxed); in ~micro_queue_pop_finalizer()
384 if( !is_valid_page(q) ) { in ~micro_queue_pop_finalizer()
/oneTBB/examples/graph/som/
H A Dsom_graph.cpp118 *q[SPECULATION_CNT]; // queue for function nodes to put their results in variable
148 q[scnt] = new oneapi::tbb::flow::queue_node<search_result_type>(*(g[scnt])); // output queue in build_BMU_graph()
182 oneapi::tbb::flow::make_edge(*s, *(q[scnt])); // function_node -> queue_node in build_BMU_graph()
209 delete q[scnt]; in destroy_BMU_graph()
298 while ((q[indx])->try_get(sr)) { in graph_BMU()
/oneTBB/src/tbb/
H A Dobserver_proxy.cpp157 if (observer_proxy* q = p->my_next) { in do_notify_entry_observers() local
161 p = q; in do_notify_entry_observers()
/oneTBB/examples/task_arena/fractal/
H A DREADME.md43 * `q` - zoom in the active fractal.

12