| /oneTBB/test/tbb/ |
| H A D | test_concurrent_priority_queue.cpp | 111 MyThrowingType elem; in test_exceptions() local
134 elem.priority = 42; in test_exceptions()
135 for (std::size_t i = 0; i < 42; ++i) src_q.push(elem); in test_exceptions()
156 push_selector(pq, elem, i); in test_exceptions()
157 push_selector(pq, elem, i); in test_exceptions()
158 push_selector(pq, elem, i); in test_exceptions()
163 push_selector(pq, elem, i); in test_exceptions()
167 REQUIRE_MESSAGE(pq.try_pop(elem), "Failed: pq is not functional"); in test_exceptions()
173 push_selector(pq2, elem, i); in test_exceptions()
174 push_selector(pq2, elem, i); in test_exceptions()
[all …]
|
| H A D | test_concurrent_queue_whitebox.cpp | 51 value_type elem = value_type(thread_id); in operator ()() local
53 q.push(elem); in operator ()()
54 bool res = q.try_pop(elem); in operator ()()
|
| H A D | test_partitioner.cpp | 170 for (auto elem : res) { in test_custom_range() local
171 REQUIRE(min_size * diff_mult + 2 >= elem); in test_custom_range()
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 65 value_type elem; in examine() local
261 push_selector(*q, elem, i); in operator()
262 if (elem == my_max) elem = my_min; in operator()
263 elem = elem + T(int(n_thread)); in operator()
281 T elem(my_max), last; in operator()
284 while(q->try_pop(elem)) { in operator()
286 last = elem; in operator()
287 elem = my_max; in operator()
305 T elem = T(int(thread_id + 1)); in operator() local
307 push_selector(*q, elem, i); in operator()
[all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_priority_queue.h | 234 value_type* elem; member
238 : type(t), elem(const_cast<value_type*>(&value)) {} in cpq_operation()
278 *(tmp->elem) = std::move(data.back()); in handle_operations()
295 push_back_helper(*(tmp->elem)); in handle_operations()
297 data.push_back(std::move(*(tmp->elem))); in handle_operations()
323 *(tmp->elem) = std::move(data.back()); in handle_operations()
328 *(tmp->elem) = std::move(data[0]); in handle_operations()
|
| H A D | flow_graph.h | 1174 T* elem; variable
1330 __TBB_ASSERT(op->elem, nullptr); in internal_push()
1331 this->push_back(*(op->elem)); in internal_push()
1337 __TBB_ASSERT(op->elem, nullptr); in internal_pop()
1347 __TBB_ASSERT(op->elem, nullptr); in internal_reserve()
1422 op_data.elem = &v; in try_get()
1433 op_data.elem = &v; in try_reserve()
1713 prio_push(*(op->elem)); in internal_push()
1725 *(op->elem) = prio(); in internal_pop()
1738 *(op->elem) = prio(); in internal_reserve()
[all …]
|
| H A D | partitioner.h | 200 range_vector(const T& elem) : my_head(0), my_tail(0), my_size(1) { in range_vector() argument
202 new( static_cast<void *>(my_pool.begin()) ) T(elem);//TODO: std::move? in range_vector()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_parallel_invoke.cpp | 55 for (auto& elem : data_array) in run_validate_and_reset() local
56 elem.store(0, std::memory_order_relaxed); in run_validate_and_reset()
|
| H A D | conformance_concurrent_queue.cpp | 1247 typename Queue::value_type elem; in AssertEmptiness() local
1248 CHECK(!q.try_pop(elem)); in AssertEmptiness()
1262 value_type elem; in EmptyTest() local
1264 while (popper<pop_op>::pop(q, elem)) { in EmptyTest()
1265 CHECK(elem == *it); in EmptyTest()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_node_impl.h | 157 input_type *elem; member
162 type(char(t)), elem(const_cast<input_type*>(&e)), bypass_t(nullptr) {} in operation_type()
236 graph_task * new_task = create_body_task(*(op->elem)); in internal_try_put_task()
239 } else if ( my_queue && my_queue->push(*(op->elem)) ) { in internal_try_put_task()
|