Home
last modified time | relevance | path

Searched refs:priority (Results 1 – 22 of 22) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_arena_priorities.cpp36 std::vector<tbb::task_arena::priority> g_task_info;
48 tbb::task_arena::priority,
59 record = tbb::task_arena::priority::normal; in prepare_logging_data()
111 tbb::task_arena::priority a_priority ) in decide_on_arguments()
113 const tbb::task_arena::priority default_priority = tbb::task_arena::priority::normal; in decide_on_arguments()
195 tbb::task_arena::priority high = tbb::task_arena::priority::high; in test()
196 tbb::task_arena::priority normal = tbb::task_arena::priority::normal; in test()
197 tbb::task_arena::priority low = tbb::task_arena::priority::low; in test()
306 tbb::task_arena::priority p = priorities[i]; in test()
335 auto priority = e.first; in test() local
[all …]
H A Dtest_concurrent_priority_queue.cpp51 std::size_t priority; member
55 MyDataType( int val ) : priority(std::size_t(val)) {} in MyDataType()
58 return MyDataType(int(priority + other.priority)); in operator +()
62 return this->priority == other.priority; in operator ==()
71 return d1.priority < d2.priority; in operator ()()
96 priority = other.priority; in operator =()
134 elem.priority = 42; in test_exceptions()
H A Dtest_flow_graph_priorities.cpp48 TaskInfo( int priority, int task_index ) in TaskInfo()
49 : my_priority(priority), my_task_index(task_index) {} in TaskInfo()
72 void body_func( int priority, utils::SpinBarrier& my_barrier ) { in body_func() argument
76 if( priority != no_priority ) in body_func()
88 Body( int priority, utils::SpinBarrier& barrier ) in Body()
89 : my_priority( priority ), my_barrier( barrier ) {} in Body()
625 node_priority_t priority = no_priority; in test() local
627 priority = 10; in test()
653 void common_body( int priority ) { in common_body() argument
655 g_task_info.push_back( TaskInfo( priority, current_task_index ) ); in common_body()
[all …]
H A Dtest_scheduler_mix.cpp412 …tbb::task_arena::priority priorities[] = { tbb::task_arena::priority::low , tbb::task_arena::prior… in create()
413 tbb::task_arena::priority priority = priorities[rnd.get() % 3]; in create() local
415 …ned_malloc(arenaAligment, arenaAligment)) tbb::task_arena{ num_threads , num_reserved , priority }; in create()
H A Dtest_continue_node.cpp395 tbb::flow::node_priority_t priority ) {
397 tbb::flow::continue_node<Input>(graph, body, priority);
399 tbb::flow::continue_node<Input>(graph, num, body, priority);
402 tbb::flow::continue_node<Input>(tbb::flow::follows(f), body, priority);
404 tbb::flow::continue_node<Input>(tbb::flow::follows(f), num, body, priority);
H A Dtest_function_node.cpp524 … tbb::flow::node_priority_t priority, tbb::flow::buffer_node<int>& f ) {
526 tbb::flow::function_node<Input, Output>(graph, concurrency, body, priority);
529 tbb::flow::function_node<Input, Output>(tbb::flow::follows(f), concurrency, body, priority);
H A Dtest_multifunction_node.cpp603 … tbb::flow::node_priority_t priority, tbb::flow::buffer_node<int>& f ) {
605 tbb::flow::multifunction_node<Input, Output>(graph, concurrency, body, priority);
608 … tbb::flow::multifunction_node<Input, Output>(tbb::flow::follows(f), concurrency, body, priority);
H A Dtest_async_node.cpp857 … Body body, tbb::flow::node_priority_t priority, tbb::flow::buffer_node<int>& f ) {
859 tbb::flow::async_node<Input, Output>(graph, concurrency, body, priority);
862 tbb::flow::async_node<Input, Output>(tbb::flow::follows(f), concurrency, body, priority);
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DNon-Preemptive_Priorities.rst26 to choose work based on some kind of priority relationship.
39 - Preemptive priorities are not necessary. If a higher priority item
40 appears, it is not necessary to immediately stop lower priority
62 The following example implements three priority levels. The user
97 WorkItem( Priority p ) : priority(p) {}
100 const Priority priority;
127 // One queue for each priority level
132 level[item->priority].push(item);
136 // Scan queues in priority order for an item.
152 higher priority item. There is one task for each item, but the
[all …]
H A DLocal_Serializer.rst67 implements three priority levels and local serializers. The user
101 * - No higher priority work is ready to run.
138 WorkItem( Priority p ) : priority(p) {}
141 const Priority priority;
/oneTBB/include/oneapi/tbb/
H A Dtask_arena.h120 enum class priority : int { enum
146 priority my_priority;
170 task_arena_base(int max_concurrency, unsigned reserved_for_masters, priority a_priority) in task_arena_base()
183 …task_arena_base(const constraints& constraints_, unsigned reserved_for_masters, priority a_priorit… in task_arena_base()
262 priority a_priority = priority::normal)
269 priority a_priority = priority::normal)
295 : task_arena_base(automatic, 1, priority::normal) // use default settings if attach fails in task_arena()
314 priority a_priority = priority::normal)
328 priority a_priority = priority::normal)
H A Dflow_graph.h168 if (second->priority > first->priority) in order_tasks()
271 virtual node_priority_t priority() const { return no_priority; } in priority() function
376 node_priority_t priority() const override { return my_priority; } in priority() function
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_impl.h132 , priority(node_priority) in my_graph()
137 node_priority_t priority; variable
154 return left->priority < right->priority; in operator()
188 __TBB_ASSERT(my_task->priority != no_priority, in next_task()
428 if( no_priority == gt.priority ) in prioritize_task()
H A D_flow_graph_cache_impl.h244 if( r.priority() != no_priority ) in register_successor()
297 if( r.priority() != no_priority ) in register_successor()
H A D_flow_graph_node_impl.h345 node_priority_t priority() const override { return my_priority; } in priority() function
/oneTBB/src/tbb/
H A Darena.cpp474 void assert_arena_priority_valid( tbb::task_arena::priority a_priority ) { in assert_arena_priority_valid()
476 a_priority == tbb::task_arena::priority::high || in assert_arena_priority_valid()
477 a_priority == tbb::task_arena::priority::normal || in assert_arena_priority_valid()
478 a_priority == tbb::task_arena::priority::low; in assert_arena_priority_valid()
483 void assert_arena_priority_valid( tbb::task_arena::priority ) {}
486 unsigned arena_priority_level( tbb::task_arena::priority a_priority ) { in arena_priority_level()
491 tbb::task_arena::priority arena_priority( unsigned priority_level ) { in arena_priority()
492 auto priority = tbb::task_arena::priority( in arena_priority() local
495 assert_arena_priority_valid( priority ); in arena_priority()
496 return priority; in arena_priority()
H A Dthread_dispatcher.cpp62 …y_unregister_client(thread_dispatcher_client* client, std::uint64_t aba_epoch, unsigned priority) { in try_unregister_client() argument
67 for (auto& it : my_client_list[priority]) { in try_unregister_client()
H A Dthread_dispatcher.h46 …ry_unregister_client(thread_dispatcher_client* client, std::uint64_t aba_epoch, unsigned priority);
H A Dtcm.h126 tcm_request_priority_t priority; member
/oneTBB/doc/main/tbb_userguide/
H A Dbroadcast_or_send.rst76 messages in the same order to all nodes or in the current priority order
81 next or "100", which has a higher priority? In any case, trying to
86 in the graph above, where each message will be processed in priority
91 values, and in priority order? You can easily create this behavior by
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md8 Note that since we re-visit nodes, the `f` estimate (on which the priority queue is sorted) is not …
/oneTBB/test/common/
H A Ddoctest.h2162 int registerReporter(const char* name, int priority, bool isReporter) {
2163 detail::registerReporterImpl(name, priority, detail::reporterCreator<Reporter>, isReporter);
2383 #define DOCTEST_REGISTER_REPORTER(name, priority, reporter) \
2385 doctest::registerReporter<reporter>(name, priority, true)) \
2389 #define DOCTEST_REGISTER_LISTENER(name, priority, reporter) \
2391 doctest::registerReporter<reporter>(name, priority, false)) \
2681 #define DOCTEST_REGISTER_REPORTER(name, priority, reporter)
2682 #define DOCTEST_REGISTER_LISTENER(name, priority, reporter)
3002 #define REGISTER_REPORTER(name, priority, reporter) DOCTEST_REGISTER_REPORTER(name, priority, repor…
3003 #define REGISTER_LISTENER(name, priority, reporter) DOCTEST_REGISTER_LISTENER(name, priority, repor…
[all …]