| /oneTBB/test/tbb/ |
| H A D | test_flow_graph_whitebox.cpp | 102 utils::SpinWaitWhile([&] { return !bnode.my_successors.empty(); }); in TestBufferingNode() 301 CHECK_MESSAGE( (!fnode1.my_predecessors.empty()), "Missing predecessor"); in TestFunctionNode() 338 …CHECK_MESSAGE( (fnode0.my_predecessors.empty() && qnode0.my_successors.empty()), "function_node ed… in TestFunctionNode() 491 CHECK_MESSAGE( (ln.my_predecessors.empty()), "input edge reversed"); in TestLimiterNode() 495 CHECK_MESSAGE( (ln.my_predecessors.empty()), "input edge reversed"); in TestLimiterNode() 506 CHECK_MESSAGE( (ln.my_predecessors.empty()), "input edge not reset"); in TestLimiterNode() 558 bool operator()(T& node) const { return node.my_predecessors.empty(); } in operator ()() 614 CHECK_MESSAGE( (mf.my_predecessors.empty()), "edge didn't reset"); in TestMultifunctionNode() 615 …CHECK_MESSAGE( ((ii == 0 && !qin.my_successors.empty()) || (ii == 1 && qin.my_successors.empty()))… in TestMultifunctionNode() 648 CHECK_MESSAGE( (!on.my_successors.empty()), "edge not added"); in TestScalarNode() [all …]
|
| H A D | test_concurrent_priority_queue.cpp | 150 REQUIRE(assign_q.empty()); in test_exceptions() 165 REQUIRE_MESSAGE(!pq.empty(), "Failed: pq should not be empty"); in test_exceptions() 181 REQUIRE_MESSAGE(!pq2.empty(), "Failed: pq should not be empty"); in test_exceptions()
|
| H A D | test_concurrent_queue.cpp | 262 CHECK(q.empty()); in test_tracking_dtors_on_clear() 263 CHECK(TrackableItem::object_addresses.empty()); in test_tracking_dtors_on_clear() 273 CHECK(TrackableItem::object_addresses.empty()); in test_tracking_dtors_on_clear()
|
| H A D | test_intrusive_list.cpp | 80 REQUIRE_MESSAGE(!il.empty(), "Incorrect result of empty() or the list is corrupted"); in check_list_nodes() 135 REQUIRE_MESSAGE(il.empty(), "Incorrect result of empty() or not all items were removed"); in test_list_operations()
|
| H A D | test_resumable_tasks.cpp | 60 CHECK(m_tagQueue.empty()); in ~AsyncActivity() 74 async->m_condvar.wait(lock, [async] {return !async->m_tagQueue.empty(); }); in asyncLoop() 208 CHECK(m_tagQueue.empty()); in ~EpochAsyncActivity() 222 async->m_condvar.wait(lock, [async] {return !async->m_tagQueue.empty(); }); in asyncLoop()
|
| /oneTBB/test/common/ |
| H A D | node_handling_support.h | 92 REQUIRE_MESSAGE(nh.empty(), "Node handle: moved-from node_type object is not empty"); in test_node_handle() 114 REQUIRE_MESSAGE(!nh2.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 115 REQUIRE_MESSAGE(!nh3.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 123 REQUIRE_MESSAGE(!nh2.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 124 REQUIRE_MESSAGE(!nh3.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 132 REQUIRE_MESSAGE(nh3.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 137 REQUIRE_MESSAGE(empty_node.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 142 REQUIRE_MESSAGE(nh3.empty(), "Node handle: Wrong node handle swap behavior"); in test_node_handle() 228 REQUIRE_MESSAGE(nh.empty(), "Insert: Failed insertion to multitable"); in test_insert_overloads() 368 REQUIRE_MESSAGE(src_tables[i].empty(), "Merge: Some elements were not merged"); in check_concurrent_merge() [all …]
|
| H A D | concurrent_priority_queue_common.h | 64 REQUIRE((!q1.empty() && q1.size() == vec_sorted.size())); in examine() 68 REQUIRE((q2.empty() && !q2.size() && !q2.try_pop(elem))); in examine() 80 REQUIRE((q1.empty() && !q1.size())); in examine() 81 REQUIRE((!q2.empty() && q2.size() == vec_sorted.size())); in examine() 84 REQUIRE((q2.empty() && !q2.size())); in examine() 85 REQUIRE((!q1.empty() && q1.size() == vec_sorted.size())); in examine() 326 REQUIRE_MESSAGE(!q.empty(), "Failed concurrent push empty test"); in test_parallel_push_pop() 337 REQUIRE_MESSAGE(q.empty(), "Failed flogger empty test"); in test_flogger()
|
| H A D | concurrent_associative_common.h | 430 REQUIRE(cont.empty()); 432 REQUIRE_MESSAGE(r.empty(), "Empty container range should be empty"); 644 REQUIRE(!cont.range().empty()); 645 REQUIRE(!ccont.range().empty()); 1137 if (!(!c.empty() && c.size() == lst.size() && c.max_size() >= c.size())) { 1139 std::cout << "Empty? " << c.empty() << std::endl; 1145 REQUIRE((!c.empty() && c.size() == lst.size() && c.max_size() >= c.size())); 1353 REQUIRE_MESSAGE(!int_key_extract.empty(), "Empty node with exists key"); 1359 REQUIRE_MESSAGE(not_exists.empty(), "Not empty node with not exists key"); 1419 REQUIRE_MESSAGE(!char_key_extract.empty(), "Empty node with exists key"); [all …]
|
| /oneTBB/src/tbb/ |
| H A D | task_stream.h | 136 __TBB_ASSERT(!queue.empty(), nullptr); in get_item() 141 } while ( !result && !queue.empty() ); in get_item() 196 for (atomic_backoff b; !empty() && !popped; b.pause()) { in pop() 213 if( lock.try_acquire(lane.my_mutex) && !lane.my_queue.empty() ) { in pop_specific() 215 if( lane.my_queue.empty() ) in pop_specific() 222 } while( !empty() && idx != last_used_lane ); in pop_specific() 228 bool empty() { in empty() function 251 if( lock.try_acquire( lane.my_mutex ) && !lane.my_queue.empty() ) { in try_pop() 253 if( lane.my_queue.empty() ) in try_pop() 261 __TBB_ASSERT( !queue.empty(), nullptr); in look_specific()
|
| H A D | global_control.cpp | 62 return !my_list.empty() ? my_active_value : default_value(); in active_value() 66 return !my_list.empty() ? my_active_value : default_value(); in active_value_unsafe() 85 if (my_list.empty()) { in active_value() 194 if (c->my_list.empty() || c->is_first_arg_preferred(gc.my_value, c->my_active_value)) { in create() 207 … __TBB_ASSERT(gc.my_param == d1::global_control::scheduler_handle || !c->my_list.empty(), nullptr); in destroy() 214 if (c->my_list.empty()) { in destroy() 230 __TBB_ASSERT(!c->my_list.empty(), nullptr); in remove_and_check_if_empty() 232 return c->my_list.empty(); in remove_and_check_if_empty()
|
| H A D | concurrent_monitor.h | 51 inline bool empty() const { return size() == 0; } in empty() function 281 if (my_waitset.empty()) { in notify_one_relaxed() 320 if (my_waitset.empty()) { in notify_all_relaxed() 358 if (my_waitset.empty()) { in notify_relaxed() 393 if (my_waitset.empty()) { in notify_one_relaxed() 428 if (my_waitset.empty()) { in abort_all_relaxed() 458 __TBB_ASSERT(this->my_waitset.empty(), "waitset not empty?"); in destroy()
|
| H A D | mailbox.h | 171 bool empty() { in empty() function 225 bool empty() { in empty() function 226 return my_putter->empty(); in empty()
|
| H A D | thread_dispatcher.cpp | 44 if (!my_client_list[idx].empty()) { in select_next_client() 149 } while (clients[curr_priority_level].empty()); in client_in_need()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Advanced_Topic_Other_Kinds_of_Iteration_Spaces.rst | 20 // True if range is empty 21 bool empty() const; 22 // True if range can be split into non-empty subranges 34 The method ``empty`` should return true if the range is empty. The 36 into two non-empty subspaces, and such a split is worth the overhead. 63 and the constructed object are not empty. The parallel algorithm
|
| H A D | Concurrent_Queue_Classes.rst | 25 if( !MySerialQueue.empty() ) { 35 queue. For example, ``MySerialQueue.empty()`` might return true just 62 or to wait for the queue to become non-empty. Typically this is 88 ``concurrent_queue`` is empty, and there are ``n`` pending pop 91 ``empty()`` is defined to be true if and only if ``size()`` is not
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_priority_queue.cpp | 401 REQUIRE_MESSAGE(cpq1.empty(), "Failed empty test for default ctor"); in test_ctors_dtor_accessors() 411 REQUIRE_MESSAGE(cpq3.empty(), "Failed empty test for compare ctor"); in test_ctors_dtor_accessors() 447 REQUIRE_MESSAGE(!cpq9.empty(), "Failed empty test for copy ctor"); in test_ctors_dtor_accessors() 466 REQUIRE_MESSAGE(!qo.empty(), "Failed assignment empty test"); in test_assignment_clear_swap() 475 REQUIRE_MESSAGE(!assigned_q.empty(), "Failed assign empty test"); in test_assignment_clear_swap() 481 REQUIRE_MESSAGE(q.empty(), "Failed clear empty test"); in test_assignment_clear_swap() 489 REQUIRE_MESSAGE(!q.empty(), "Failed assignment empty test"); in test_assignment_clear_swap() 497 REQUIRE_MESSAGE(!q.empty(), "Failed swap empty test"); in test_assignment_clear_swap() 499 REQUIRE_MESSAGE(!qo.empty(), "Failed swap empty test"); in test_assignment_clear_swap() 515 REQUIRE_MESSAGE(!q.empty(), "Failed push empty test"); in test_serial_push_pop() [all …]
|
| H A D | conformance_blocked_rangeNd.cpp | 110 if (range.dim(N - 1).empty()) { return true; } in is_empty() 173 utils::AssertSameType(r.empty(), bool()); in SerialTest() 176 REQUIRE((r.empty() == utils_t::is_empty(r) && r.empty())); in SerialTest() 181 REQUIRE((r.empty() == utils_t::is_empty(r) && !r.empty())); in SerialTest()
|
| H A D | conformance_task_group.cpp | 96 bool empty = (h == nullptr); variable 97 CHECK_MESSAGE(empty, "default constructed task_handle should be empty"); 111 bool empty = ! static_cast<bool>(h); variable 112 CHECK_MESSAGE(empty, "default constructed task_handle should be empty");
|
| H A D | conformance_enumerable_thread_specific.cpp | 380 REQUIRE( sums.empty()); in run_parallel_scalar_tests_nocombine() 382 REQUIRE( !sums.empty()); in run_parallel_scalar_tests_nocombine() 384 REQUIRE( finit_ets.empty()); in run_parallel_scalar_tests_nocombine() 386 REQUIRE( !finit_ets.empty()); in run_parallel_scalar_tests_nocombine() 388 REQUIRE(static_sums.empty()); in run_parallel_scalar_tests_nocombine() 649 REQUIRE( vs.empty() ); in run_parallel_vector_tests() 652 REQUIRE( !vs.empty() ); in run_parallel_vector_tests() 701 REQUIRE( vvs.empty() ); in run_parallel_vector_tests() 703 REQUIRE( !vvs.empty() ); in run_parallel_vector_tests() 736 REQUIRE( vs.empty()); in run_cross_type_vector_tests() [all …]
|
| H A D | conformance_concurrent_queue.cpp | 705 CHECK_FAST(!queue.empty()); in TestPushPop() 717 CHECK_FAST(!queue.empty()); in TestPushPop() 1129 if( queue.empty() ) return false; in pop() 1245 CHECK(q.empty()); in AssertEmptiness() 1352 CHECK(dst_queue2.empty()); in TestMoveConstructors() 1404 CHECK(cq.empty()); in TestEmplaceInQueue() 1415 CHECK(cq.empty()); in TestEmplaceInQueue() 1623 CHECK(!container.empty()); in test_basics() 1633 CHECK(container.empty()); in test_basics() 1700 CHECK(q3.empty()); in test_queue_helper() [all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | blocked_range3d.h | 68 bool empty() const { in __TBB_requires() 70 return my_pages.empty() || my_rows.empty() || my_cols.empty(); in __TBB_requires()
|
| H A D | blocked_range2d.h | 61 bool empty() const { in __TBB_requires() 63 return my_rows.empty() || my_cols.empty(); in __TBB_requires()
|
| H A D | blocked_rangeNd.h | 88 bool empty() const { in __TBB_requires() 90 return d.empty(); in __TBB_requires()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _node_handle.h | 62 __TBB_nodiscard bool empty() const { return my_node == nullptr; } in empty() function 116 __TBB_ASSERT(!this->empty(), "Cannot get key from the empty node_type object"); in key() 121 __TBB_ASSERT(!this->empty(), "Cannot get mapped value from the empty node_type object"); in mapped() 142 __TBB_ASSERT(!this->empty(), "Cannot get value from the empty node_type object"); in value()
|
| H A D | _flow_graph_cache_impl.h | 33 bool empty() { in empty() function 54 while( !my_q.empty()) (void)my_q.pop(); in clear() 65 return my_q.empty(); in internal_empty() 261 bool empty() { in empty() function 263 return my_successors.empty(); in empty() 320 bool empty() { in empty() function 322 return my_successors.empty(); in empty()
|