18 #include "kmp_wait_release.h" 20 #include "ompt-specific.h" 34 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 35 static kmp_int32 kmp_node_id_seed = 0;
38 static void __kmp_init_node(kmp_depnode_t *node) {
41 node->dn.successors = NULL;
42 __kmp_init_lock(&node->dn.lock);
44 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 45 node->dn.id = KMP_TEST_THEN_INC32(&kmp_node_id_seed);
49 static inline kmp_depnode_t *__kmp_node_ref(kmp_depnode_t *node) {
50 KMP_TEST_THEN_INC32(CCAST(kmp_int32 *, &node->dn.nrefs));
54 static inline void __kmp_node_deref(kmp_info_t *thread, kmp_depnode_t *node) {
58 kmp_int32 n = KMP_TEST_THEN_DEC32(CCAST(kmp_int32 *, &node->dn.nrefs)) - 1;
60 KMP_ASSERT(node->dn.nrefs == 0);
62 __kmp_fast_free(thread, node);
64 __kmp_thread_free(thread, node);
69 #define KMP_ACQUIRE_DEPNODE(gtid, n) __kmp_acquire_lock(&(n)->dn.lock, (gtid)) 70 #define KMP_RELEASE_DEPNODE(gtid, n) __kmp_release_lock(&(n)->dn.lock, (gtid)) 72 static void __kmp_depnode_list_free(kmp_info_t *thread, kmp_depnode_list *list);
74 enum { KMP_DEPHASH_OTHER_SIZE = 97, KMP_DEPHASH_MASTER_SIZE = 997 };
76 static inline kmp_int32 __kmp_dephash_hash(kmp_intptr_t addr,
size_t hsize) {
79 return ((addr >> 6) ^ (addr >> 2)) % hsize;
82 static kmp_dephash_t *__kmp_dephash_create(kmp_info_t *thread,
83 kmp_taskdata_t *current_task) {
88 if (current_task->td_flags.tasktype == TASK_IMPLICIT)
89 h_size = KMP_DEPHASH_MASTER_SIZE;
91 h_size = KMP_DEPHASH_OTHER_SIZE;
94 h_size *
sizeof(kmp_dephash_entry_t *) +
sizeof(kmp_dephash_t);
97 h = (kmp_dephash_t *)__kmp_fast_allocate(thread, size);
99 h = (kmp_dephash_t *)__kmp_thread_malloc(thread, size);
107 h->buckets = (kmp_dephash_entry **)(h + 1);
109 for (
size_t i = 0; i < h_size; i++)
115 void __kmp_dephash_free_entries(kmp_info_t *thread, kmp_dephash_t *h) {
116 for (
size_t i = 0; i < h->size; i++) {
118 kmp_dephash_entry_t *next;
119 for (kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next) {
120 next = entry->next_in_bucket;
121 __kmp_depnode_list_free(thread, entry->last_ins);
122 __kmp_node_deref(thread, entry->last_out);
124 __kmp_fast_free(thread, entry);
126 __kmp_thread_free(thread, entry);
134 void __kmp_dephash_free(kmp_info_t *thread, kmp_dephash_t *h) {
135 __kmp_dephash_free_entries(thread, h);
137 __kmp_fast_free(thread, h);
139 __kmp_thread_free(thread, h);
143 static kmp_dephash_entry *
144 __kmp_dephash_find(kmp_info_t *thread, kmp_dephash_t *h, kmp_intptr_t addr) {
145 kmp_int32 bucket = __kmp_dephash_hash(addr, h->size);
147 kmp_dephash_entry_t *entry;
148 for (entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket)
149 if (entry->addr == addr)
155 entry = (kmp_dephash_entry_t *)__kmp_fast_allocate(
156 thread,
sizeof(kmp_dephash_entry_t));
158 entry = (kmp_dephash_entry_t *)__kmp_thread_malloc(
159 thread,
sizeof(kmp_dephash_entry_t));
162 entry->last_out = NULL;
163 entry->last_ins = NULL;
164 entry->next_in_bucket = h->buckets[bucket];
165 h->buckets[bucket] = entry;
168 if (entry->next_in_bucket)
175 static kmp_depnode_list_t *__kmp_add_node(kmp_info_t *thread,
176 kmp_depnode_list_t *list,
177 kmp_depnode_t *node) {
178 kmp_depnode_list_t *new_head;
181 new_head = (kmp_depnode_list_t *)__kmp_fast_allocate(
182 thread,
sizeof(kmp_depnode_list_t));
184 new_head = (kmp_depnode_list_t *)__kmp_thread_malloc(
185 thread,
sizeof(kmp_depnode_list_t));
188 new_head->node = __kmp_node_ref(node);
189 new_head->next = list;
194 static void __kmp_depnode_list_free(kmp_info_t *thread,
195 kmp_depnode_list *list) {
196 kmp_depnode_list *next;
198 for (; list; list = next) {
201 __kmp_node_deref(thread, list->node);
203 __kmp_fast_free(thread, list);
205 __kmp_thread_free(thread, list);
210 static inline void __kmp_track_dependence(kmp_depnode_t *source,
212 kmp_task_t *sink_task) {
213 #ifdef KMP_SUPPORT_GRAPH_OUTPUT 214 kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);
217 kmp_taskdata_t *task_sink = KMP_TASK_TO_TASKDATA(sink_task);
219 __kmp_printf(
"%d(%s) -> %d(%s)\n", source->dn.id,
220 task_source->td_ident->psource, sink->dn.id,
221 task_sink->td_ident->psource);
223 #if OMPT_SUPPORT && OMPT_OPTIONAL 227 if (ompt_enabled.ompt_callback_task_dependence) {
228 kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);
229 kmp_taskdata_t *task_sink = KMP_TASK_TO_TASKDATA(sink_task);
231 ompt_callbacks.ompt_callback(ompt_callback_task_dependence)(
232 &(task_source->ompt_task_info.task_data),
233 &(task_sink->ompt_task_info.task_data));
238 template <
bool filter>
239 static inline kmp_int32
240 __kmp_process_deps(kmp_int32 gtid, kmp_depnode_t *node, kmp_dephash_t *hash,
241 bool dep_barrier, kmp_int32 ndeps,
242 kmp_depend_info_t *dep_list, kmp_task_t *task) {
243 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d processing %d dependencies : " 244 "dep_barrier = %d\n",
245 filter, gtid, ndeps, dep_barrier));
247 kmp_info_t *thread = __kmp_threads[gtid];
248 kmp_int32 npredecessors = 0;
249 for (kmp_int32 i = 0; i < ndeps; i++) {
250 const kmp_depend_info_t *dep = &dep_list[i];
252 KMP_DEBUG_ASSERT(dep->flags.in);
254 if (filter && dep->base_addr == 0)
257 kmp_dephash_entry_t *info =
258 __kmp_dephash_find(thread, hash, dep->base_addr);
259 kmp_depnode_t *last_out = info->last_out;
261 if (dep->flags.out && info->last_ins) {
262 for (kmp_depnode_list_t *p = info->last_ins; p; p = p->next) {
263 kmp_depnode_t *indep = p->node;
264 if (indep->dn.task) {
265 KMP_ACQUIRE_DEPNODE(gtid, indep);
266 if (indep->dn.task) {
267 __kmp_track_dependence(indep, node, task);
268 indep->dn.successors =
269 __kmp_add_node(thread, indep->dn.successors, node);
270 KA_TRACE(40, (
"__kmp_process_deps<%d>: T#%d adding dependence from " 272 filter, gtid, KMP_TASK_TO_TASKDATA(indep->dn.task),
273 KMP_TASK_TO_TASKDATA(task)));
276 KMP_RELEASE_DEPNODE(gtid, indep);
280 __kmp_depnode_list_free(thread, info->last_ins);
281 info->last_ins = NULL;
283 }
else if (last_out && last_out->dn.task) {
284 KMP_ACQUIRE_DEPNODE(gtid, last_out);
285 if (last_out->dn.task) {
286 __kmp_track_dependence(last_out, node, task);
287 last_out->dn.successors =
288 __kmp_add_node(thread, last_out->dn.successors, node);
291 (
"__kmp_process_deps<%d>: T#%d adding dependence from %p to %p\n",
292 filter, gtid, KMP_TASK_TO_TASKDATA(last_out->dn.task),
293 KMP_TASK_TO_TASKDATA(task)));
297 KMP_RELEASE_DEPNODE(gtid, last_out);
304 __kmp_node_deref(thread, last_out);
305 info->last_out = NULL;
307 if (dep->flags.out) {
308 __kmp_node_deref(thread, last_out);
309 info->last_out = __kmp_node_ref(node);
311 info->last_ins = __kmp_add_node(thread, info->last_ins, node);
315 KA_TRACE(30, (
"__kmp_process_deps<%d>: T#%d found %d predecessors\n", filter,
316 gtid, npredecessors));
318 return npredecessors;
321 #define NO_DEP_BARRIER (false) 322 #define DEP_BARRIER (true) 325 static bool __kmp_check_deps(kmp_int32 gtid, kmp_depnode_t *node,
326 kmp_task_t *task, kmp_dephash_t *hash,
327 bool dep_barrier, kmp_int32 ndeps,
328 kmp_depend_info_t *dep_list,
329 kmp_int32 ndeps_noalias,
330 kmp_depend_info_t *noalias_dep_list) {
334 kmp_taskdata_t *taskdata = KMP_TASK_TO_TASKDATA(task);
336 KA_TRACE(20, (
"__kmp_check_deps: T#%d checking dependencies for task %p : %d " 337 "possibly aliased dependencies, %d non-aliased depedencies : " 338 "dep_barrier=%d .\n",
339 gtid, taskdata, ndeps, ndeps_noalias, dep_barrier));
343 for (i = 0; i < ndeps; i++) {
344 if (dep_list[i].base_addr != 0)
345 for (
int j = i + 1; j < ndeps; j++)
346 if (dep_list[i].base_addr == dep_list[j].base_addr) {
347 dep_list[i].flags.in |= dep_list[j].flags.in;
348 dep_list[i].flags.out |= dep_list[j].flags.out;
349 dep_list[j].base_addr = 0;
357 node->dn.npredecessors = -1;
363 npredecessors = __kmp_process_deps<true>(gtid, node, hash, dep_barrier, ndeps,
365 npredecessors += __kmp_process_deps<false>(
366 gtid, node, hash, dep_barrier, ndeps_noalias, noalias_dep_list, task);
368 node->dn.task = task;
378 KMP_TEST_THEN_ADD32(CCAST(kmp_int32 *, &node->dn.npredecessors),
382 KA_TRACE(20, (
"__kmp_check_deps: T#%d found %d predecessors for task %p \n",
383 gtid, npredecessors, taskdata));
387 return npredecessors > 0 ? true :
false;
390 void __kmp_release_deps(kmp_int32 gtid, kmp_taskdata_t *task) {
391 kmp_info_t *thread = __kmp_threads[gtid];
392 kmp_depnode_t *node = task->td_depnode;
394 if (task->td_dephash) {
396 40, (
"__kmp_release_deps: T#%d freeing dependencies hash of task %p.\n",
398 __kmp_dephash_free(thread, task->td_dephash);
399 task->td_dephash = NULL;
405 KA_TRACE(20, (
"__kmp_release_deps: T#%d notifying successors of task %p.\n",
408 KMP_ACQUIRE_DEPNODE(gtid, node);
411 KMP_RELEASE_DEPNODE(gtid, node);
413 kmp_depnode_list_t *next;
414 for (kmp_depnode_list_t *p = node->dn.successors; p; p = next) {
415 kmp_depnode_t *successor = p->node;
416 kmp_int32 npredecessors =
417 KMP_TEST_THEN_DEC32(CCAST(kmp_int32 *, &successor->dn.npredecessors)) -
421 if (npredecessors == 0) {
423 if (successor->dn.task) {
424 KA_TRACE(20, (
"__kmp_release_deps: T#%d successor %p of %p scheduled " 426 gtid, successor->dn.task, task));
427 __kmp_omp_task(gtid, successor->dn.task,
false);
432 __kmp_node_deref(thread, p->node);
434 __kmp_fast_free(thread, p);
436 __kmp_thread_free(thread, p);
440 __kmp_node_deref(thread, node);
444 (
"__kmp_release_deps: T#%d all successors of %p notified of completion\n",
465 kmp_task_t *new_task, kmp_int32 ndeps,
466 kmp_depend_info_t *dep_list,
467 kmp_int32 ndeps_noalias,
468 kmp_depend_info_t *noalias_dep_list) {
470 kmp_taskdata_t *new_taskdata = KMP_TASK_TO_TASKDATA(new_task);
471 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(enter): T#%d loc=%p task=%p\n", gtid,
472 loc_ref, new_taskdata));
474 kmp_info_t *thread = __kmp_threads[gtid];
475 kmp_taskdata_t *current_task = thread->th.th_current_task;
478 if (ompt_enabled.enabled) {
479 OMPT_STORE_RETURN_ADDRESS(gtid);
480 if (!current_task->ompt_task_info.frame.enter_frame)
481 current_task->ompt_task_info.frame.enter_frame = OMPT_GET_FRAME_ADDRESS(1);
482 if (ompt_enabled.ompt_callback_task_create) {
483 ompt_data_t task_data = ompt_data_none;
484 ompt_callbacks.ompt_callback(ompt_callback_task_create)(
485 current_task ? &(current_task->ompt_task_info.task_data) : &task_data,
486 current_task ? &(current_task->ompt_task_info.frame) : NULL,
487 &(new_taskdata->ompt_task_info.task_data),
488 ompt_task_explicit | TASK_TYPE_DETAILS_FORMAT(new_taskdata), 1,
489 OMPT_LOAD_RETURN_ADDRESS(gtid));
492 new_taskdata->ompt_task_info.frame.enter_frame = OMPT_GET_FRAME_ADDRESS(0);
497 if (ndeps + ndeps_noalias > 0 &&
498 ompt_enabled.ompt_callback_task_dependences) {
501 new_taskdata->ompt_task_info.ndeps = ndeps + ndeps_noalias;
502 new_taskdata->ompt_task_info.deps =
503 (ompt_task_dependence_t *)KMP_OMPT_DEPS_ALLOC(
504 thread, (ndeps + ndeps_noalias) *
sizeof(ompt_task_dependence_t));
506 KMP_ASSERT(new_taskdata->ompt_task_info.deps != NULL);
508 for (i = 0; i < ndeps; i++) {
509 new_taskdata->ompt_task_info.deps[i].variable_addr =
510 (
void *)dep_list[i].base_addr;
511 if (dep_list[i].flags.in && dep_list[i].flags.out)
512 new_taskdata->ompt_task_info.deps[i].dependence_flags =
513 ompt_task_dependence_type_inout;
514 else if (dep_list[i].flags.out)
515 new_taskdata->ompt_task_info.deps[i].dependence_flags =
516 ompt_task_dependence_type_out;
517 else if (dep_list[i].flags.in)
518 new_taskdata->ompt_task_info.deps[i].dependence_flags =
519 ompt_task_dependence_type_in;
521 for (i = 0; i < ndeps_noalias; i++) {
522 new_taskdata->ompt_task_info.deps[ndeps + i].variable_addr =
523 (
void *)noalias_dep_list[i].base_addr;
524 if (noalias_dep_list[i].flags.in && noalias_dep_list[i].flags.out)
525 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_flags =
526 ompt_task_dependence_type_inout;
527 else if (noalias_dep_list[i].flags.out)
528 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_flags =
529 ompt_task_dependence_type_out;
530 else if (noalias_dep_list[i].flags.in)
531 new_taskdata->ompt_task_info.deps[ndeps + i].dependence_flags =
532 ompt_task_dependence_type_in;
534 ompt_callbacks.ompt_callback(ompt_callback_task_dependences)(
535 &(new_taskdata->ompt_task_info.task_data),
536 new_taskdata->ompt_task_info.deps, new_taskdata->ompt_task_info.ndeps);
539 KMP_OMPT_DEPS_FREE(thread, new_taskdata->ompt_task_info.deps);
540 new_taskdata->ompt_task_info.deps = NULL;
541 new_taskdata->ompt_task_info.ndeps = 0;
546 bool serial = current_task->td_flags.team_serial ||
547 current_task->td_flags.tasking_ser ||
548 current_task->td_flags.final;
550 kmp_task_team_t *task_team = thread->th.th_task_team;
551 serial = serial && !(task_team && task_team->tt.tt_found_proxy_tasks);
554 if (!serial && (ndeps > 0 || ndeps_noalias > 0)) {
556 if (current_task->td_dephash == NULL)
557 current_task->td_dephash = __kmp_dephash_create(thread, current_task);
560 kmp_depnode_t *node =
561 (kmp_depnode_t *)__kmp_fast_allocate(thread,
sizeof(kmp_depnode_t));
563 kmp_depnode_t *node =
564 (kmp_depnode_t *)__kmp_thread_malloc(thread,
sizeof(kmp_depnode_t));
567 __kmp_init_node(node);
568 new_taskdata->td_depnode = node;
570 if (__kmp_check_deps(gtid, node, new_task, current_task->td_dephash,
571 NO_DEP_BARRIER, ndeps, dep_list, ndeps_noalias,
573 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had blocking " 575 "loc=%p task=%p, return: TASK_CURRENT_NOT_QUEUED\n",
576 gtid, loc_ref, new_taskdata));
578 if (ompt_enabled.enabled) {
579 current_task->ompt_task_info.frame.enter_frame = NULL;
582 return TASK_CURRENT_NOT_QUEUED;
585 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d ignored dependencies " 586 "for task (serialized)" 588 gtid, loc_ref, new_taskdata));
591 KA_TRACE(10, (
"__kmpc_omp_task_with_deps(exit): T#%d task had no blocking " 593 "loc=%p task=%p, transferring to __kmpc_omp_task\n",
594 gtid, loc_ref, new_taskdata));
596 kmp_int32 ret = __kmp_omp_task(gtid, new_task,
true);
598 if (ompt_enabled.enabled) {
599 current_task->ompt_task_info.frame.enter_frame = NULL;
617 kmp_depend_info_t *dep_list, kmp_int32 ndeps_noalias,
618 kmp_depend_info_t *noalias_dep_list) {
619 KA_TRACE(10, (
"__kmpc_omp_wait_deps(enter): T#%d loc=%p\n", gtid, loc_ref));
621 if (ndeps == 0 && ndeps_noalias == 0) {
622 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no dependencies to " 623 "wait upon : loc=%p\n",
628 kmp_info_t *thread = __kmp_threads[gtid];
629 kmp_taskdata_t *current_task = thread->th.th_current_task;
634 bool ignore = current_task->td_flags.team_serial ||
635 current_task->td_flags.tasking_ser ||
636 current_task->td_flags.final;
638 ignore = ignore && thread->th.th_task_team != NULL &&
639 thread->th.th_task_team->tt.tt_found_proxy_tasks == FALSE;
641 ignore = ignore || current_task->td_dephash == NULL;
644 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking " 645 "dependencies : loc=%p\n",
651 __kmp_init_node(&node);
653 if (!__kmp_check_deps(gtid, &node, NULL, current_task->td_dephash,
654 DEP_BARRIER, ndeps, dep_list, ndeps_noalias,
656 KA_TRACE(10, (
"__kmpc_omp_wait_deps(exit): T#%d has no blocking " 657 "dependencies : loc=%p\n",
662 int thread_finished = FALSE;
663 kmp_flag_32 flag((
volatile kmp_uint32 *)&(node.dn.npredecessors), 0U);
664 while (node.dn.npredecessors > 0) {
665 flag.execute_tasks(thread, gtid, FALSE, &thread_finished,
669 __kmp_task_stealing_constraint);
672 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)