Home
last modified time | relevance | path

Searched refs:limit (Results 1 – 25 of 47) sorted by relevance

12

/oneTBB/test/conformance/
H A Dconformance_limiter_node.cpp33 constexpr int limit = 5; variable
34 oneapi::tbb::flow::limiter_node<input_msg> node1(g, limit);
39 for(int i = 0; i < limit * 2; ++i)
108 oneapi::tbb::flow::limiter_node<int, int> limit(g, threshold);
110 make_edge(limit, queue);
112 …CHECK_MESSAGE(( limit.try_put( m++ )), "Newly constructed limiter node does not accept message." );
113 CHECK_MESSAGE(limit.decrementer().try_put( -threshold ), // close limiter's gate
115 CHECK_MESSAGE(( !limit.try_put( m++ )), "Closed limiter node's accepts message." );
116 CHECK_MESSAGE(limit.decrementer().try_put( threshold + 5 ), // open limiter's gate
119 CHECK_MESSAGE(( limit.try_put( m++ )), "Limiter node does not accept message while open." );
[all …]
H A Dconformance_graph.cpp126 constexpr int limit = 5; in test_limiter_node_rf_reset_protocol() local
127 oneapi::tbb::flow::limiter_node<int> testing_node(g, limit); in test_limiter_node_rf_reset_protocol()
132 for(int i = 0; i < limit * 2; ++i) in test_limiter_node_rf_reset_protocol()
136 …CHECK_MESSAGE((conformance::get_values(suc_node).size() == limit), "Descendant of the node needs b… in test_limiter_node_rf_reset_protocol()
140 for(int i = 0; i < limit * 2; ++i) in test_limiter_node_rf_reset_protocol()
144 …CHECK_MESSAGE((conformance::get_values(suc_node).size() == limit), "Descendant of the node needs b… in test_limiter_node_rf_reset_protocol()
/oneTBB/doc/main/tbb_userguide/
H A Davoiding_data_races.rst9 on ``function_node`` and ``multifunction_node`` objects limit the maximum number
27 int limit = 100000;
30 if ( src_count <= limit ) {
50 << " and closed form = " << limit*(limit+1)/2 << "\n";
H A Duse_concurrency_limits.rst8 concurrency limit on the node. To cause it to reject messages after it
9 reaches its concurrency limit, you construct it as a "rejecting" node.
15 reached its concurrency limit still accepts incoming messages, but
75 ``function_node`` drops below its concurrency limit, it will pull new
H A DNodes.rst43 …- The concurrency limit for the node. You can use the concurrency limit to control how many…
96 concurrency limit of 1. When it receives the message sequence 1, 2 and
108 you construct the node with a different concurrency limit, parallelism
123 You can use unlimited as the concurrency limit to instruct the library
126 as 4 or 8, to limit concurrency to at most 4 or 8, respectively. It is
H A DPartitioner_Summary.rst50 - The subrange size for ``operator()`` must not exceed a limit. That
59 memory locations. Keeping the subrange below a limit might enable the
H A Duse_limiter_node.rst7 One way to limit resource consumption is to use a limiter_node to set a
8 limit on the number of messages that can flow through a given point in
H A DAutomatic_Chunking.rst10 needs. The heuristic attempts to limit overheads while
H A Duse_input_node.rst75 const int limit = 10;
80 if ( count < limit ) {
H A DEdges.rst42 while ``m`` has a concurrency limit of 1. The invocations of ``n`` can all
/oneTBB/test/tbb/
H A Dtest_limiter_node.cpp339 limiter_node<int, int> limit(g,2); //threshold of 2 in test_reserve_release_messages() local
342 make_edge(input_queue, limit); in test_reserve_release_messages()
343 make_edge(limit, output_queue); in test_reserve_release_messages()
344 make_edge(broad,limit.decrementer()); in test_reserve_release_messages()
353 remove_edge(limit, output_queue); //remove successor in test_reserve_release_messages()
359 tbb::flow::make_edge(limit, output_queue); //putting the successor back in test_reserve_release_messages()
378 tbb::flow::limiter_node<int, int> limit(g, threshold); in test_decrementer() local
380 make_edge(limit, queue); in test_decrementer()
383 CHECK_MESSAGE( limit.decrementer().try_put( -threshold ), // close limiter's gate in test_decrementer()
385 CHECK_MESSAGE( ( !limit.try_put( m++ )), "Closed limiter node's accepts message." ); in test_decrementer()
[all …]
H A Dtest_eh_thread.cpp44 void limitThreads(size_t limit) in limitThreads() argument
51 …rlim.rlim_cur = (rlim.rlim_max == (rlim_t)RLIM_INFINITY) ? limit : utils::min(limit, rlim.rlim_max… in limitThreads()
H A Dtest_task_group.cpp771 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
782 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
792 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
805 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
815 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
839 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
850 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
860 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
870 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
880 tbb::global_control limit(tbb::global_control::max_allowed_parallelism, p);
H A Dtest_concurrent_vector.cpp139 int limit, factor = 3; in is_prime() local
143 limit = long(sqrtf(float(val))+0.5f); in is_prime()
144 while( factor<=limit && val % factor ) in is_prime()
146 return factor>limit; in is_prime()
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_extended.cpp35 std::size_t limit = str.size() - (std::max)(i, j); in SerialSubStringFinder() local
36 for (std::size_t k = 0; k < limit; ++k) { in SerialSubStringFinder()
62 std::size_t limit = len - (std::max)(i, j); in operator ()() local
63 for (std::size_t k = 0; k < limit; ++k) { in operator ()()
H A Dsub_string_finder.cpp42 std::size_t limit = str.size() - (std::max)(i, j); in operator ()() local
43 for (std::size_t k = 0; k < limit; ++k) { in operator ()()
H A Dsub_string_finder_pretty.cpp39 std::size_t limit = str.size() - (std::max)(i, j); in operator ()() local
40 for (std::size_t k = 0; k < limit; ++k) { in operator ()()
/oneTBB/src/tbb/
H A Dthread_request_serializer.cpp54 int thread_request_serializer::limit_delta(int delta, int limit, int new_value) { in limit_delta() argument
73 new_value = min(limit, new_value); in limit_delta()
74 prev_value = min(limit, prev_value); in limit_delta()
H A Dthread_request_serializer.h47 static int limit_delta(int delta, int limit, int new_value);
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_compliance.cpp56 void limitMem( size_t limit ) in limitMem() argument
62 jobInfo.ProcessMemoryLimit = limit? limit*MByte : 2*MByte*1024; in limitMem()
88 void limitMem( size_t limit ) in limitMem() argument
97 rlim.rlim_cur = (limit > 0) ? limit*MByte : rlim.rlim_max; in limitMem()
98 …else rlim.rlim_cur = (limit > 0 && static_cast<rlim_t>(limit)<rlim.rlim_max) ? limit*MByte : rlim.… in limitMem()
218 size_t limit; member in Limit
220 Limit(size_t a_limit) : limit(a_limit) {} in Limit()
222 limitMem(limit); in operator ()()
1084 for (int limit=0; limit<2; limit++) { variable
1085 int ret = scalable_allocation_mode(TBBMALLOC_SET_SOFT_HEAP_LIMIT, 16*1024*limit);
/oneTBB/examples/graph/fgbzip2/
H A Dhuffman.cpp220 void BZ2_hbCreateDecodeTables(Int32 *limit, in BZ2_hbCreateDecodeTables() argument
246 limit[i] = 0; in BZ2_hbCreateDecodeTables()
251 limit[i] = vec - 1; in BZ2_hbCreateDecodeTables()
255 base[i] = ((limit[i - 1] + 1) << 1) - base[i]; in BZ2_hbCreateDecodeTables()
H A DREADME.md26 * `-l` - use memory limit for compression algorithm with 1 MB (minimum) granularity.
/oneTBB/test/common/
H A Dexception_handling.h289 const intptr_t limit = 10000000; in WaitUntilReady() local
293 } while( !s_Ready && ++n < limit ); in WaitUntilReady()
295 REQUIRE( (s_Ready || n == limit) ); in WaitUntilReady()
H A Dcontainer_move_support.h609 LimitAllocatedItemsInScope( std::size_t limit, bool act = true )
613 StaticCountingAllocatorType::set_limits(limit); in previous_state()
630 LimitFooCountInScope( std::size_t limit, bool act = true )
634 max_foo_count = limit; in previous_state()
775 std::size_t limit = allocator_type::items_allocated + fixture.container_size / 4; in test_ex_move_ctor_unequal_allocator_memory_failure() local
776 LimitAllocatedItemsInScope<allocator_type> alloc_limit(limit); in test_ex_move_ctor_unequal_allocator_memory_failure()
788 std::size_t limit = foo_count + fixture.container_size / 4; in test_ex_move_ctor_unequal_allocator_element_ctor_failure() local
789 LimitFooCountInScope foo_limit(limit); in test_ex_move_ctor_unequal_allocator_element_ctor_failure()
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp41 inline NumberType strike(NumberType start, NumberType limit, NumberType stride) { in strike() argument
45 for (; start < limit; start += stride) in strike()

12