Home
last modified time | relevance | path

Searched refs:priorities (Results 1 – 4 of 4) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_arena_priorities.cpp203 tbb::task_arena::priority priorities[] = {high, normal, low}; // keep it sorted in test() local
204 const unsigned priorities_num = sizeof(priorities) / sizeof(priorities[0]); in test()
232 tbb::task_arena::priority a_priority = priorities[arena_idx]; in test()
282 tbb::task_arena::priority* end_ptr = priorities + adjusted_progressing_arenas; in test()
297 end_ptr != std::find(priorities, end_ptr, p) in test()
306 tbb::task_arena::priority p = priorities[i]; in test()
338 auto priorities_it = std::find( end_ptr, priorities + priorities_num, priority ); in test()
339 CHECK_MESSAGE( priorities_it != priorities + priorities_num, in test()
H A Dtest_scheduler_mix.cpp412 …tbb::task_arena::priority priorities[] = { tbb::task_arena::priority::low , tbb::task_arena::prior… in create() local
413 tbb::task_arena::priority priority = priorities[rnd.get() % 3]; in create()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DNon-Preemptive_Priorities.rst13 Choose the next work item to do, based on priorities.
39 - Preemptive priorities are not necessary. If a higher priority item
41 items in flight. If preemptive priorities are necessary, then
172 very fine grained priorities.
H A DLocal_Serializer.rst66 to implement local serialization in addition to priorities. It
251 If priorities are not necessary, there are two variations on method