| /oneTBB/test/common/ |
| H A D | exception_handling.h | 129 inline void ThrowTestException ( intptr_t threshold ) { in ThrowTestException() argument 137 while ( Existed < threshold ) in ThrowTestException() 280 Cancellator( tbb::task_group_context& ctx, intptr_t threshold ) in Cancellator() 281 : m_groupToCancel(ctx), m_cancellationThreshold(threshold) in Cancellator() 303 void RunCancellationTest ( intptr_t threshold = 1 ) 308 CancellatorT cancellator(ctx, threshold);
|
| H A D | graph_utils.h | 860 constexpr int threshold = 10; 867 FuncNodeType tested_node(g, oneapi::tbb::flow::serial, throwing_body<threshold>(counter)); 870 utils::NativeParallelFor( threshold * 2, [&](int i){ 885 CHECK_MESSAGE( exc == threshold, "graph.wait_for_all() rethrow current exception" ); 888 CHECK_MESSAGE( counter == threshold, "Graph must cancel all tasks after exception" );
|
| /oneTBB/test/conformance/ |
| H A D | conformance_limiter_node.cpp | 106 const int threshold = 5; variable 108 oneapi::tbb::flow::limiter_node<int, int> limit(g, threshold); 113 CHECK_MESSAGE(limit.decrementer().try_put( -threshold ), // close limiter's gate 116 CHECK_MESSAGE(limit.decrementer().try_put( threshold + 5 ), // open limiter's gate 118 for( int i = 0; i < threshold; ++i )
|
| /oneTBB/test/tbb/ |
| H A D | test_limiter_node.cpp | 376 const int threshold = 5; in test_decrementer() local 378 tbb::flow::limiter_node<int, int> limit(g, threshold); in test_decrementer() 383 CHECK_MESSAGE( limit.decrementer().try_put( -threshold ), // close limiter's gate in test_decrementer() 386 CHECK_MESSAGE( limit.decrementer().try_put( threshold + 5 ), // open limiter's gate in test_decrementer() 388 for( int i = 0; i < threshold; ++i ) in test_decrementer() 510 constexpr int threshold = 50000; in test_decrement_while_try_put_task() local 516 if (i++ >= threshold) fc.stop(); in test_decrement_while_try_put_task() 522 if (value != threshold) in test_decrement_while_try_put_task() 534 CHECK_MESSAGE(processed.load() == threshold, "decrementer terminate flow graph work"); in test_decrement_while_try_put_task()
|
| H A D | test_eh_algorithms.cpp | 1178 intptr_t threshold = get_iter_range_size() / 4; in TestCancelation1_parallel_for_each() local 1179 …REQUIRE_MESSAGE(get_iter_range_size() - threshold > g_NumThreads, "Threshold should leave more tha… in TestCancelation1_parallel_for_each() 1182 Cancellator cancellator(ctx, threshold); in TestCancelation1_parallel_for_each() 1671 intptr_t threshold = get_iter_range_size() / 4; in TestCancelation1_pipeline() local 1672 …REQUIRE_MESSAGE(get_iter_range_size() - threshold > g_NumThreads, "Threshold should leave more tha… in TestCancelation1_pipeline() 1673 RunCancellationTest<PipelineLauncher<FilterToCancel>, Cancellator>(threshold); in TestCancelation1_pipeline()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | use_limiter_node.rst | 15 limiter_node( graph &g, size_t threshold ) 76 objects at once. The ``limiter_node`` has a threshold of 3, and will 83 drops below the threshold, messages begin flowing from the ``input_node``
|
| H A D | use_concurrency_limits.rst | 70 concurrently. The node's concurrency threshold that limits the node to
|
| H A D | Predefined_Node_Types.rst | 45 …asts a message. If the increment causes it to reach its user-assigned threshold, it will broadca…
|
| H A D | Controlling_Chunking_os.rst | 41 The grainsize sets a minimum threshold for parallelization. The
|
| /oneTBB/doc/main/reference/ |
| H A D | constructors_for_nodes.rst | 83 limiter_node(follows(...), std::size_t threshold); 84 limiter_node(precedes(...), std::size_t threshold);
|
| /oneTBB/src/tbbmalloc/ |
| H A D | large_objects.h | 194 intptr_t threshold = ageThreshold.load(std::memory_order_relaxed); in decreaseThreshold() local 195 if (threshold) in decreaseThreshold() 196 …ageThreshold.store((threshold + meanHitRange.load(std::memory_order_relaxed)) / 2, std::memory_ord… in decreaseThreshold()
|
| H A D | large_objects.cpp | 612 intptr_t threshold = ageThreshold.load(std::memory_order_relaxed); in forgetOutdatedState() local 613 if (threshold) in forgetOutdatedState() 614 doCleanup = sinceLastGet > static_cast<uintptr_t>(Props::LongWaitFactor * threshold); in forgetOutdatedState()
|
| H A D | frontend.cpp | 1337 const float threshold = (slabSize - sizeof(Block)) * (1 - emptyEnoughRatio); in adjustFullness() local 1340 isFull = (allocatedCount*objectSize > threshold) ? true : false; in adjustFullness() 2416 size_t threshold = isMemoryBlockHuge ? copySize / 2 : 0; in reallocAligned() local 2417 if (newSize > threshold) { in reallocAligned()
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | api.cpp | 186 void rt_boundthresh(SceneHandle voidscene, int threshold) { in rt_boundthresh() argument 189 if (threshold > 1) { in rt_boundthresh() 190 scene->boundthresh = threshold; in rt_boundthresh()
|
| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_whitebox.cpp | 945 intptr_t threshold = cacheBinModel.ageThreshold.load(std::memory_order_relaxed); in doCleanup() local 946 if (tooLargeLOC > 3 && threshold) { in doCleanup() 947 … threshold = (threshold + cacheBinModel.meanHitRange.load(std::memory_order_relaxed)) / 2; in doCleanup() 948 cacheBinModel.ageThreshold.store(threshold, std::memory_order_relaxed); in doCleanup() 952 while (!objects.empty() && (intptr_t)(currTime - objects.front()) > threshold) { in doCleanup() 976 intptr_t threshold = cacheBinModel.ageThreshold.load(std::memory_order_relaxed); in get() local 977 if ((threshold && sinceLastGet > Props::LongWaitFactor * threshold) || in get()
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Agglomeration.rst | 131 some threshold is reached. For example, a recursive sort might solve 132 sub-problems in parallel only if they are above a certain threshold
|
| H A D | Divide_and_Conquer.rst | 209 example, use the serial walk for subtrees under a certain threshold.
|
| /oneTBB/examples/parallel_for/tachyon/ |
| H A D | README.md | 34 * `boundthresh` - bounding threshold value.
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | flow_graph.h | 2009 limiter_node(graph &g, size_t threshold) in limiter_node() argument 2010 : graph_node(g), my_threshold(threshold), my_count(0), my_tries(0), my_future_decrement(0), in limiter_node() 2018 limiter_node(const node_set<Args...>& nodes, size_t threshold) in limiter_node() argument 2019 : limiter_node(nodes.graph_reference(), threshold) { in limiter_node()
|
| /oneTBB/doc/ |
| H A D | Doxyfile.in | 2288 # become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the 2290 # for no limit. Note that the threshold may be exceeded by 50% before the limit 2291 # is enforced. So when you set the threshold to 10, up to 15 fields may appear,
|