29 long serial_fib_1(int n) {  in serial_fib_1()  argument
30     return n < 2 ? n : serial_fib_1(n - 1) + serial_fib_1(n - 2);  in serial_fib_1()
39     single_fib_task(int n, int* x) : n(n), x(x), s(state::compute)  in single_fib_task()
53                     if (n == cutoff && num_recycles > 0) {  in execute()
67         if (n < cutoff) {  in compute_impl()
68             *x = serial_fib_1(n);  in compute_impl()
71             bypass = this->allocate_child_and_increment<single_fib_task>(n - 2, &x_r);  in compute_impl()
72 …        task_emulation::run_task(this->allocate_child_and_increment<single_fib_task>(n - 1, &x_l));  in compute_impl()
82     int n;  member
90 int fibonacci_single_task(int n) {  in fibonacci_single_task()  argument
93 …d_wait(tg, task_emulation::allocate_root_task<single_fib_task>(/* for root task = */ tg, n, &sum));  in fibonacci_single_task()