Home
last modified time | relevance | path

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

/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci_single_task.h43 task_emulation::base_task* bypass = nullptr; in execute() local
46 bypass = compute_impl(); in execute()
55 bypass = compute_impl(); in execute()
62 return bypass; in execute()
66 task_emulation::base_task* bypass = nullptr; in compute_impl() local
71 bypass = this->allocate_child_and_increment<single_fib_task>(n - 2, &x_r); in compute_impl()
78 return bypass; in compute_impl()
H A Dfibonacci_two_tasks.h49 task_emulation::base_task* bypass = nullptr; in execute() local
62 bypass = this; in execute()
64 return bypass; in execute()
H A Dtask_emulation_layer.h58 base_task* bypass = const_cast<base_task*>(this)->execute(); in operator() local
70 if (bypass != nullptr) { in operator()
79 bypass->operator()(); in operator()
/oneTBB/doc/main/tbb_userguide/
H A DTask_Scheduler_Bypass.rst6 Scheduler bypass is an optimization where you directly specify the next task to run.