| /oneTBB/test/conformance/ |
| H A D | conformance_blocked_rangeNd.cpp | 114 static bool is_divisible(const range_t& range) { in is_divisible() function
115 if (range.dim(N - 1).is_divisible()) { return true; } in is_divisible()
116 return range_utils<range_t, N - 1>::is_divisible(range); in is_divisible()
152 static bool is_divisible(const range_t&) { return false; } in is_divisible() function
172 utils::AssertSameType(r.is_divisible(), bool()); in SerialTest()
177 REQUIRE(r.is_divisible() == utils_t::is_divisible(r)); in SerialTest()
182 REQUIRE((r.is_divisible() == utils_t::is_divisible(r) && r.is_divisible())); in SerialTest()
|
| H A D | conformance_blocked_range.cpp | 73 utils::AssertSameType( r.is_divisible(), true ); in SerialTest()
74 CHECK( r.is_divisible()==(std::size_t(y-x)>k) ); in SerialTest()
76 if( r.is_divisible() ) { in SerialTest()
|
| H A D | conformance_blocked_range2d.cpp | 84 utils::AssertSameType( r.is_divisible(), true ); in SerialTest()
91 … REQUIRE( r.is_divisible()==(row_y-row_x>row_grain||col_y-col_x>col_grain) ); in SerialTest()
92 if( r.is_divisible() ) { in SerialTest()
|
| H A D | conformance_blocked_range3d.cpp | 93 utils::AssertSameType( r.is_divisible(), true ); in SerialTest()
107 …REQUIRE( r.is_divisible()==(page_y-page_x>page_grain||row_y-row_x>row_grain||col_y-col_x>col_grain… in SerialTest()
109 if( r.is_divisible() ) { in SerialTest()
|
| H A D | conformance_parallel_for.cpp | 74 bool is_divisible() const {return size>1;} in is_divisible() function in FooRange
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | blocked_range3d.h | 74 bool is_divisible() const { in __TBB_requires()
75 return my_pages.is_divisible() || my_rows.is_divisible() || my_cols.is_divisible(); in __TBB_requires()
|
| H A D | blocked_range2d.h | 67 bool is_divisible() const { in __TBB_requires()
68 return my_rows.is_divisible() || my_cols.is_divisible(); in __TBB_requires()
|
| H A D | partitioner.h | 212 while( my_size < MaxCapacity && is_divisible(max_depth) ) { in split_to_fill()
251 bool is_divisible(depth_t max_depth) { in is_divisible() function
252 return back_depth() < max_depth && back().is_divisible(); in is_divisible()
281 if ( range.is_divisible() ) { in execute()
282 if ( self().is_divisible() ) { in execute()
286 } while ( range.is_divisible() && self().is_divisible() ); in execute()
335 bool is_divisible() { // part of old should_execute_range() in is_divisible() function
434 if( !range.is_divisible() || !self().max_depth() ) { in work_balance()
447 … if( range_pool.is_divisible(self().max_depth()) ) // was not enough depth to fork a task in work_balance()
482 bool is_divisible() { // part of old should_execute_range() in is_divisible() function
[all …]
|
| H A D | blocked_range.h | 86 bool is_divisible() const { return my_grainsize<size(); } in __TBB_requires()
121 __TBB_ASSERT( r.is_divisible(), "cannot split blocked_range that is not divisible" ); in __TBB_requires()
129 __TBB_ASSERT( r.is_divisible(), "cannot split blocked_range that is not divisible" ); in __TBB_requires()
|
| H A D | blocked_rangeNd.h | 95 bool is_divisible() const { in __TBB_requires()
97 return d.is_divisible(); in __TBB_requires()
118 __TBB_ASSERT(r.is_divisible(), "can't split not divisible range"); in __TBB_requires()
|
| H A D | parallel_sort.h | 124 bool is_divisible() const { return size >= grainsize; } in is_divisible() function
|
| H A D | parallel_scan.h | 469 …if( (m_is_right_child && !treat_as_stolen) || !m_range.is_divisible() || m_partition.should_execut… in execute()
|
| H A D | concurrent_hash_map.h | 512 bool is_divisible() const { in is_divisible() function
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Advanced_Topic_Other_Kinds_of_Iteration_Spaces.rst | 23 bool is_divisible() const;
35 method ``is_divisible`` should return true if the range can be split
65 ``r.is_divisible`` is true.
|
| H A D | std_invoke.rst | 45 bool is_divisible() const {
|
| /oneTBB/examples/parallel_reduce/primes/ |
| H A D | primes.cpp | 197 bool is_divisible() const { in is_divisible() function in SieveRange
207 assert(r.is_divisible()); in SieveRange()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _range_common.h | 102 { range.is_divisible() } -> relaxed_convertible_to<bool>;
|
| H A D | _concurrent_skip_list.h | 678 bool is_divisible() const { in is_divisible() function
|
| H A D | _concurrent_unordered_base.h | 712 bool is_divisible() const { in is_divisible() function
|
| /oneTBB/test/tbb/ |
| H A D | test_partitioner.h | 132 bool is_divisible() const { return (my_end - my_begin) > 1; } in is_divisible() function
468 bool is_divisible() const { in is_divisible() function
|
| H A D | test_parallel_reduce.cpp | 459 bool is_divisible() const {return end-begin>=2;} in is_divisible() function in MinimalRange
|
| H A D | test_eh_algorithms.cpp | 119 if(!r.is_divisible()) return intptr_t(1); in CountSubranges()
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | polyover.cpp | 261 bool is_divisible() const { in is_divisible() function in blocked_range_with_maps
262 return my_range.is_divisible(); in is_divisible()
|
| /oneTBB/test/common/ |
| H A D | concepts_common.h | 113 bool is_divisible() const requires (EnableIsDivisible == State::correct) { return true; } in is_divisible() function
114 bool is_divisible() requires (EnableIsDivisible == State::incorrect_constness) { return true; } in is_divisible() function
115 …Dummy is_divisible() const requires (EnableIsDivisible == State::incorrect_return_type) { return D… in is_divisible() function
|
| H A D | concurrent_associative_common.h | 330 if (range.is_divisible()) {
433 REQUIRE_MESSAGE(!r.is_divisible(), "Empty container range should not be divisible");
|