Home
last modified time | relevance | path

Searched refs:base_task (Results 1 – 3 of 3) sorted by relevance

/oneTBB/examples/migration/recursive_fibonacci/
H A Dtask_emulation_layer.h46 class base_task {
48 base_task() = default;
50base_task(const base_task& t) : m_type(t.m_type), m_parent(t.m_parent), m_child_counter(t.m_child_… in base_task() function
53 virtual ~base_task() = default;
58 base_task* bypass = const_cast<base_task*>(this)->execute(); in operator()
83 virtual base_task* execute() = 0;
166 base_task* reset_parent(base_task* ptr = nullptr) {
172 base_task* m_parent{nullptr};
176 class root_task : public base_task {
180 m_type = base_task::task_type::allocated;
[all …]
H A Dfibonacci_two_tasks.h33 struct fib_continuation : task_emulation::base_task {
36 task_emulation::base_task* execute() override { in execute()
45 struct fib_computation : task_emulation::base_task {
48 task_emulation::base_task* execute() override { in execute()
49 task_emulation::base_task* bypass = nullptr; in execute()
H A Dfibonacci_single_task.h33 struct single_fib_task : task_emulation::base_task {
42 task_emulation::base_task* execute() override { in execute()
43 task_emulation::base_task* bypass = nullptr; in execute()
65 task_emulation::base_task* compute_impl() { in compute_impl()
66 task_emulation::base_task* bypass = nullptr; in compute_impl()