17 #include "kmp_wait_release.h" 18 #include "kmp_taskdeps.h" 20 #include "ompt-specific.h" 34 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 35 static std::atomic<kmp_int32> kmp_node_id_seed = ATOMIC_VAR_INIT(0);
38 static void __kmp_init_node(kmp_depnode_t *node) {
39 node->dn.successors = NULL;
42 for (
int i = 0; i < MAX_MTX_DEPS; ++i)
43 node->dn.mtx_locks[i] = NULL;
44 node->dn.mtx_num_locks = 0;
45 __kmp_init_lock(&node->dn.lock);
46 KMP_ATOMIC_ST_RLX(&node->dn.nrefs, 1);
47 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 48 node->dn.id = KMP_ATOMIC_INC(&kmp_node_id_seed);
52 static inline kmp_depnode_t *__kmp_node_ref(kmp_depnode_t *node) {
53 KMP_ATOMIC_INC(&node->dn.nrefs);
57 enum { KMP_DEPHASH_OTHER_SIZE = 97, KMP_DEPHASH_MASTER_SIZE = 997 };
59 static inline kmp_int32 __kmp_dephash_hash(kmp_intptr_t addr,
size_t hsize) {
62 return ((addr >> 6) ^ (addr >> 2)) % hsize;
65 static kmp_dephash_t *__kmp_dephash_create(kmp_info_t *thread,
66 kmp_taskdata_t *current_task) {
71 if (current_task->td_flags.tasktype == TASK_IMPLICIT)
72 h_size = KMP_DEPHASH_MASTER_SIZE;
74 h_size = KMP_DEPHASH_OTHER_SIZE;
77 h_size *
sizeof(kmp_dephash_entry_t *) +
sizeof(kmp_dephash_t);
80 h = (kmp_dephash_t *)__kmp_fast_allocate(thread, size);
82 h = (kmp_dephash_t *)__kmp_thread_malloc(thread, size);
90 h->buckets = (kmp_dephash_entry **)(h + 1);
92 for (
size_t i = 0; i < h_size; i++)
98 #define ENTRY_LAST_INS 0 99 #define ENTRY_LAST_MTXS 1 101 static kmp_dephash_entry *
102 __kmp_dephash_find(kmp_info_t *thread, kmp_dephash_t *h, kmp_intptr_t addr) {
103 kmp_int32 bucket = __kmp_dephash_hash(addr, h->size);
105 kmp_dephash_entry_t *entry;
106 for (entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket)
107 if (entry->addr == addr)
113 entry = (kmp_dephash_entry_t *)__kmp_fast_allocate(
114 thread,
sizeof(kmp_dephash_entry_t));
116 entry = (kmp_dephash_entry_t *)__kmp_thread_malloc(
117 thread,
sizeof(kmp_dephash_entry_t));
120 entry->last_out = NULL;
121 entry->last_ins = NULL;
122 entry->last_mtxs = NULL;
123 entry->last_flag = ENTRY_LAST_INS;
124 entry->mtx_lock = NULL;
125 entry->next_in_bucket = h->buckets[bucket];
126 h->buckets[bucket] = entry;
129 if (entry->next_in_bucket)
136 static kmp_depnode_list_t *__kmp_add_node(kmp_info_t *thread,
137 kmp_depnode_list_t *list,
138 kmp_depnode_t *node) {
139 kmp_depnode_list_t *new_head;
142 new_head = (kmp_depnode_list_t *)__kmp_fast_allocate(
143 thread,
sizeof(kmp_depnode_list_t));
145 new_head = (kmp_depnode_list_t *)__kmp_thread_malloc(
146 thread,
sizeof(kmp_depnode_list_t));
149 new_head->node = __kmp_node_ref(node);
150 new_head->next = list;
155 static inline void __kmp_track_dependence(kmp_depnode_t *source,
157 kmp_task_t *sink_task) {
158 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 159 kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);
162 kmp_taskdata_t *task_sink = KMP_TASK_TO_TASKDATA(sink_task);
164 __kmp_printf(
"%d(%s) -> %d(%s)\n", source->dn.id,
165 task_source->td_ident->psource, sink->dn.id,
166 task_sink->td_ident->psource);
168 #if OMPT_SUPPORT && OMPT_OPTIONAL 172 if (ompt_enabled.ompt_callback_task_dependence) {
173 kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);
174 kmp_taskdata_t *task_sink = KMP_TASK_TO_TASKDATA(sink_task);
176 ompt_callbacks.ompt_callback(ompt_callback_task_dependence)(
177 &(task_source->ompt_task_info.task_data),
178 &(task_sink->ompt_task_info.task_data));
183 static inline kmp_int32
184 __kmp_depnode_link_successor(kmp_int32 gtid, kmp_info_t *thread,
185 kmp_task_t *task, kmp_depnode_t *node,
186 kmp_depnode_list_t *plist) {
189 kmp_int32 npredecessors = 0;
191 for (kmp_depnode_list_t *p = plist; p; p = p->next) {
192 kmp_depnode_t *dep = p->node;
194 KMP_ACQUIRE_DEPNODE(gtid, dep);
196 __kmp_track_dependence(dep, node, task);
197 dep->dn.successors = __kmp_add_node(thread, dep->dn.successors, node);
198 KA_TRACE(40, (
"__kmp_process_deps: T#%d adding dependence from %p to " 200 gtid, KMP_TASK_TO_TASKDATA(dep->dn.task),
201 KMP_TASK_TO_TASKDATA(task)));
204 KMP_RELEASE_DEPNODE(gtid, dep);
207 return npredecessors;
210 static inline kmp_int32 __kmp_depnode_link_successor(kmp_int32 gtid,
213 kmp_depnode_t *source,
214 kmp_depnode_t *sink) {
217 kmp_int32 npredecessors = 0;
220 KMP_ACQUIRE_DEPNODE(gtid, sink);
222 __kmp_track_dependence(sink, source, task);
223 sink->dn.successors = __kmp_add_node(thread, sink->dn.successors, source);
224 KA_TRACE(40, (
"__kmp_process_deps: T#%d adding dependence from %p to " 226 gtid, KMP_TASK_TO_TASKDATA(sink->dn.task),
227 KMP_TASK_TO_TASKDATA(task)));
230 KMP_RELEASE_DEPNODE(gtid, sink);
232 return npredecessors;
235 template <
bool filter>
236 static inline kmp_int32
237 __kmp_process_deps(kmp_int32 gtid, kmp_depnode_t *node, kmp_dephash_t *hash,
238 bool dep_barrier, kmp_int32 ndeps,
239 kmp_depend_info_t *dep_list, kmp_task_t *task) {
240 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d processing %d dependencies : " 241 "dep_barrier = %d\n",
242 filter, gtid, ndeps, dep_barrier));
244 kmp_info_t *thread = __kmp_threads[gtid];
245 kmp_int32 npredecessors = 0;
246 for (kmp_int32 i = 0; i < ndeps; i++) {
247 const kmp_depend_info_t *dep = &dep_list[i];
249 if (filter && dep->base_addr == 0)
252 kmp_dephash_entry_t *info =
253 __kmp_dephash_find(thread, hash, dep->base_addr);
254 kmp_depnode_t *last_out = info->last_out;
255 kmp_depnode_list_t *last_ins = info->last_ins;
256 kmp_depnode_list_t *last_mtxs = info->last_mtxs;
258 if (dep->flags.out) {
259 if (last_ins || last_mtxs) {
260 if (info->last_flag == ENTRY_LAST_INS) {
262 __kmp_depnode_link_successor(gtid, thread, task, node, last_ins);
265 __kmp_depnode_link_successor(gtid, thread, task, node, last_mtxs);
267 __kmp_depnode_list_free(thread, last_ins);
268 __kmp_depnode_list_free(thread, last_mtxs);
269 info->last_ins = NULL;
270 info->last_mtxs = NULL;
273 __kmp_depnode_link_successor(gtid, thread, task, node, last_out);
275 __kmp_node_deref(thread, last_out);
280 info->last_out = NULL;
282 info->last_out = __kmp_node_ref(node);
284 }
else if (dep->flags.in) {
288 __kmp_depnode_link_successor(gtid, thread, task, node, last_mtxs);
289 __kmp_node_deref(thread, last_out);
290 info->last_out = NULL;
291 if (info->last_flag == ENTRY_LAST_MTXS && last_ins) {
293 __kmp_depnode_list_free(thread, last_ins);
294 info->last_ins = NULL;
299 __kmp_depnode_link_successor(gtid, thread, task, node, last_out);
301 info->last_flag = ENTRY_LAST_INS;
302 info->last_ins = __kmp_add_node(thread, info->last_ins, node);
304 KMP_DEBUG_ASSERT(dep->flags.mtx == 1);
308 __kmp_depnode_link_successor(gtid, thread, task, node, last_ins);
309 __kmp_node_deref(thread, last_out);
310 info->last_out = NULL;
311 if (info->last_flag == ENTRY_LAST_INS && last_mtxs) {
313 __kmp_depnode_list_free(thread, last_mtxs);
314 info->last_mtxs = NULL;
319 __kmp_depnode_link_successor(gtid, thread, task, node, last_out);
321 info->last_flag = ENTRY_LAST_MTXS;
322 info->last_mtxs = __kmp_add_node(thread, info->last_mtxs, node);
323 if (info->mtx_lock == NULL) {
324 info->mtx_lock = (kmp_lock_t *)__kmp_allocate(
sizeof(kmp_lock_t));
325 __kmp_init_lock(info->mtx_lock);
327 KMP_DEBUG_ASSERT(node->dn.mtx_num_locks < MAX_MTX_DEPS);
330 for (m = 0; m < MAX_MTX_DEPS; ++m) {
332 if (node->dn.mtx_locks[m] < info->mtx_lock) {
333 KMP_DEBUG_ASSERT(node->dn.mtx_locks[node->dn.mtx_num_locks] == NULL);
334 for (
int n = node->dn.mtx_num_locks; n > m; --n) {
336 KMP_DEBUG_ASSERT(node->dn.mtx_locks[n - 1] != NULL);
337 node->dn.mtx_locks[n] = node->dn.mtx_locks[n - 1];
339 node->dn.mtx_locks[m] = info->mtx_lock;
343 KMP_DEBUG_ASSERT(m < MAX_MTX_DEPS);
344 node->dn.mtx_num_locks++;
347 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d found %d predecessors\n", filter,
348 gtid, npredecessors));
349 return npredecessors;
352 #define NO_DEP_BARRIER (false) 353 #define DEP_BARRIER (true) 356 static bool __kmp_check_deps(kmp_int32 gtid, kmp_depnode_t *node,
357 kmp_task_t *task, kmp_dephash_t *hash,
358 bool dep_barrier, kmp_int32 ndeps,
359 kmp_depend_info_t *dep_list,
360 kmp_int32 ndeps_noalias,
361 kmp_depend_info_t *noalias_dep_list) {
364 kmp_taskdata_t *taskdata = KMP_TASK_TO_TASKDATA(task);
366 KA_TRACE(20, (
"__kmp_check_deps: T#%d checking dependencies for task %p : %d " 367 "possibly aliased dependencies, %d non-aliased depedencies : " 368 "dep_barrier=%d .\n",
369 gtid, taskdata, ndeps, ndeps_noalias, dep_barrier));
373 for (i = 0; i < ndeps; i++) {
374 if (dep_list[i].base_addr != 0) {
375 for (
int j = i + 1; j < ndeps; j++) {
376 if (dep_list[i].base_addr == dep_list[j].base_addr) {
377 dep_list[i].flags.in |= dep_list[j].flags.in;
378 dep_list[i].flags.out |=
379 (dep_list[j].flags.out ||
380 (dep_list[i].flags.in && dep_list[j].flags.mtx) ||
381 (dep_list[i].flags.mtx && dep_list[j].flags.in));
382 dep_list[i].flags.mtx =
383 dep_list[i].flags.mtx | dep_list[j].flags.mtx &&
384 !dep_list[i].flags.out;
385 dep_list[j].base_addr = 0;
388 if (dep_list[i].flags.mtx) {
390 if (n_mtxs < MAX_MTX_DEPS && task != NULL) {
393 dep_list[i].flags.in = 1;
394 dep_list[i].flags.out = 1;
395 dep_list[i].flags.mtx = 0;
405 node->dn.npredecessors = -1;
411 npredecessors = __kmp_process_deps<true>(gtid, node, hash, dep_barrier, ndeps,
413 npredecessors += __kmp_process_deps<false>(
414 gtid, node, hash, dep_barrier, ndeps_noalias, noalias_dep_list, task);
416 node->dn.task = task;
426 node->dn.npredecessors.fetch_add(npredecessors) + npredecessors;
428 KA_TRACE(20, (
"__kmp_check_deps: T#%d found %d predecessors for task %p \n",
429 gtid, npredecessors, taskdata));
433 return npredecessors > 0 ? true :
false;
453 kmp_task_t *new_task, kmp_int32 ndeps,
454 kmp_depend_info_t *dep_list,
455 kmp_int32 ndeps_noalias,
456 kmp_depend_info_t *noalias_dep_list) {
458 kmp_taskdata_t *new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
459 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(enter): T#%d loc=%p task=%p\n", gtid,
460 loc_ref, new_taskdata));
462 kmp_info_t *thread = __kmp_threads[gtid];
463 kmp_taskdata_t *current_task = thread->th.th_current_task;
466 if (ompt_enabled.enabled) {
467 OMPT_STORE_RETURN_ADDRESS(gtid);
468 if (!current_task->ompt_task_info.frame.enter_frame.ptr)
469 current_task->ompt_task_info.frame.enter_frame.ptr =
470 OMPT_GET_FRAME_ADDRESS(0);
471 if (ompt_enabled.ompt_callback_task_create) {
472 ompt_data_t task_data = ompt_data_none;
473 ompt_callbacks.ompt_callback(ompt_callback_task_create)(
474 current_task ? &(current_task->ompt_task_info.task_data) : &task_data,
475 current_task ? &(current_task->ompt_task_info.frame) : NULL,
476 &(new_taskdata->ompt_task_info.task_data),
477 ompt_task_explicit | TASK_TYPE_DETAILS_FORMAT(new_taskdata), 1,
478 OMPT_LOAD_RETURN_ADDRESS(gtid));
481 new_taskdata->ompt_task_info.frame.enter_frame.ptr = OMPT_GET_FRAME_ADDRESS(0);
486 if (ndeps + ndeps_noalias > 0 &&
487 ompt_enabled.ompt_callback_dependences) {
490 new_taskdata->ompt_task_info.ndeps = ndeps + ndeps_noalias;
491 new_taskdata->ompt_task_info.deps =
492 (ompt_dependence_t *)KMP_OMPT_DEPS_ALLOC(
493 thread, (ndeps + ndeps_noalias) *
sizeof(ompt_dependence_t));
495 KMP_ASSERT(new_taskdata->ompt_task_info.deps != NULL);
497 for (i = 0; i < ndeps; i++) {
498 new_taskdata->ompt_task_info.deps[i].variable.ptr =
499 (
void *)dep_list[i].base_addr;
500 if (dep_list[i].flags.in && dep_list[i].flags.out)
501 new_taskdata->ompt_task_info.deps[i].dependence_type =
502 ompt_dependence_type_inout;
503 else if (dep_list[i].flags.out)
504 new_taskdata->ompt_task_info.deps[i].dependence_type =
505 ompt_dependence_type_out;
506 else if (dep_list[i].flags.in)
507 new_taskdata->ompt_task_info.deps[i].dependence_type =
508 ompt_dependence_type_in;
510 for (i = 0; i < ndeps_noalias; i++) {
511 new_taskdata->ompt_task_info.deps[ndeps + i].variable.ptr =
512 (
void *)noalias_dep_list[i].base_addr;
513 if (noalias_dep_list[i].flags.in && noalias_dep_list[i].flags.out)
514 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_type =
515 ompt_dependence_type_inout;
516 else if (noalias_dep_list[i].flags.out)
517 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_type =
518 ompt_dependence_type_out;
519 else if (noalias_dep_list[i].flags.in)
520 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_type =
521 ompt_dependence_type_in;
523 ompt_callbacks.ompt_callback(ompt_callback_dependences)(
524 &(new_taskdata->ompt_task_info.task_data),
525 new_taskdata->ompt_task_info.deps, new_taskdata->ompt_task_info.ndeps);
528 KMP_OMPT_DEPS_FREE(thread, new_taskdata->ompt_task_info.deps);
529 new_taskdata->ompt_task_info.deps = NULL;
530 new_taskdata->ompt_task_info.ndeps = 0;
535 bool serial = current_task->td_flags.team_serial ||
536 current_task->td_flags.tasking_ser ||
537 current_task->td_flags.final;
539 kmp_task_team_t *task_team = thread->th.th_task_team;
540 serial = serial && !(task_team && task_team->tt.tt_found_proxy_tasks);
543 if (!serial && (ndeps > 0 || ndeps_noalias > 0)) {
545 if (current_task->td_dephash == NULL)
546 current_task->td_dephash = __kmp_dephash_create(thread, current_task);
549 kmp_depnode_t *node =
550 (kmp_depnode_t *)__kmp_fast_allocate(thread,
sizeof(kmp_depnode_t));
552 kmp_depnode_t *node =
553 (kmp_depnode_t *)__kmp_thread_malloc(thread,
sizeof(kmp_depnode_t));
556 __kmp_init_node(node);
557 new_taskdata->td_depnode = node;
559 if (__kmp_check_deps(gtid, node, new_task, current_task->td_dephash,
560 NO_DEP_BARRIER, ndeps, dep_list, ndeps_noalias,
562 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had blocking " 564 "loc=%p task=%p, return: TASK_CURRENT_NOT_QUEUED\n",
565 gtid, loc_ref, new_taskdata));
567 if (ompt_enabled.enabled) {
568 current_task->ompt_task_info.frame.enter_frame = ompt_data_none;
571 return TASK_CURRENT_NOT_QUEUED;
574 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d ignored dependencies " 575 "for task (serialized)" 577 gtid, loc_ref, new_taskdata));
580 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had no blocking " 582 "loc=%p task=%p, transferring to __kmp_omp_task\n",
583 gtid, loc_ref, new_taskdata));
585 kmp_int32 ret = __kmp_omp_task(gtid, new_task,
true);
587 if (ompt_enabled.enabled) {
588 current_task->ompt_task_info.frame.enter_frame = ompt_data_none;
606 kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias,
607 kmp_depend_info_t *noalias_dep_list) {
608 KA_TRACE(10, (
"__kmpc_omp_wait_deps(enter): T#%d loc=%p\n", gtid, loc_ref));
610 if (ndeps == 0 && ndeps_noalias == 0) {
611 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no dependencies to " 612 "wait upon : loc=%p\n",
617 kmp_info_t *thread = __kmp_threads[gtid];
618 kmp_taskdata_t *current_task = thread->th.th_current_task;
623 bool ignore = current_task->td_flags.team_serial ||
624 current_task->td_flags.tasking_ser ||
625 current_task->td_flags.final;
627 ignore = ignore && thread->th.th_task_team != NULL &&
628 thread->th.th_task_team->tt.tt_found_proxy_tasks == FALSE;
630 ignore = ignore || current_task->td_dephash == NULL;
633 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking " 634 "dependencies : loc=%p\n",
639 kmp_depnode_t node = {0};
640 __kmp_init_node(&node);
642 if (!__kmp_check_deps(gtid, &node, NULL, current_task->td_dephash,
643 DEP_BARRIER, ndeps, dep_list, ndeps_noalias,
645 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking " 646 "dependencies : loc=%p\n",
651 int thread_finished = FALSE;
652 kmp_flag_32 flag((std::atomic<kmp_uint32> *)&node.dn.npredecessors, 0U);
653 while (node.dn.npredecessors > 0) {
654 flag.execute_tasks(thread, gtid, FALSE,
655 &thread_finished USE_ITT_BUILD_ARG(NULL),
656 __kmp_task_stealing_constraint);
659 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d finished waiting : loc=%p\n",
void __kmpc_omp_wait_deps(ident_t *loc_ref, kmp_int32 gtid, kmp_int32 ndeps, kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list)
kmp_int32 __kmpc_omp_task_with_deps(ident_t *loc_ref, kmp_int32 gtid, kmp_task_t *new_task, kmp_int32 ndeps, kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias, kmp_depend_info_t *noalias_dep_list)