Lines Matching refs:next_task
4167 kmp_task_t *next_task; in __kmp_taskloop_linear() local
4204 next_task = __kmp_task_dup_alloc(thread, task); // allocate new task in __kmp_taskloop_linear()
4205 kmp_taskdata_t *next_taskdata = KMP_TASK_TO_TASKDATA(next_task); in __kmp_taskloop_linear()
4207 kmp_taskloop_bounds_t(next_task, task_bounds); in __kmp_taskloop_linear()
4218 ptask_dup(next_task, task, lastpriv); in __kmp_taskloop_linear()
4222 gtid, i, next_task, lower, upper, st, in __kmp_taskloop_linear()
4226 __kmp_omp_taskloop_task(NULL, gtid, next_task, in __kmp_taskloop_linear()
4229 __kmp_omp_task(gtid, next_task, true); // schedule new task in __kmp_taskloop_linear()
4350 kmp_task_t *next_task; in __kmp_taskloop_recur() local
4381 next_task = __kmp_task_dup_alloc(thread, task); // duplicate the task in __kmp_taskloop_recur()
4383 *(kmp_uint64 *)((char *)next_task + lower_offset) = lb1; in __kmp_taskloop_recur()
4385 ptask_dup(next_task, task, 0); in __kmp_taskloop_recur()
4398 p->task = next_task; in __kmp_taskloop_recur()
4399 p->lb = (kmp_uint64 *)((char *)next_task + lower_offset); in __kmp_taskloop_recur()
4400 p->ub = (kmp_uint64 *)((char *)next_task + upper_offset); in __kmp_taskloop_recur()