18#define KMP_ACQUIRE_DEPNODE(gtid, n) __kmp_acquire_lock(&(n)->dn.lock, (gtid))
19#define KMP_RELEASE_DEPNODE(gtid, n) __kmp_release_lock(&(n)->dn.lock, (gtid))
21static inline void __kmp_node_deref(kmp_info_t *thread, kmp_depnode_t *node) {
25 kmp_int32 n = KMP_ATOMIC_DEC(&node->dn.nrefs) - 1;
26 KMP_DEBUG_ASSERT(n >= 0);
28#if USE_ITT_BUILD && USE_ITT_NOTIFY
29 __itt_sync_destroy(node);
31 KMP_ASSERT(node->dn.nrefs == 0);
33 __kmp_fast_free(thread, node);
35 __kmp_thread_free(thread, node);
40static inline void __kmp_depnode_list_free(kmp_info_t *thread,
41 kmp_depnode_list *list) {
42 kmp_depnode_list *next;
44 for (; list; list = next) {
47 __kmp_node_deref(thread, list->node);
49 __kmp_fast_free(thread, list);
51 __kmp_thread_free(thread, list);
56static inline void __kmp_dephash_free_entries(kmp_info_t *thread,
58 for (
size_t i = 0; i < h->size; i++) {
60 kmp_dephash_entry_t *next;
61 for (kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next) {
62 next = entry->next_in_bucket;
63 __kmp_depnode_list_free(thread, entry->last_set);
64 __kmp_depnode_list_free(thread, entry->prev_set);
65 __kmp_node_deref(thread, entry->last_out);
66 if (entry->mtx_lock) {
67 __kmp_destroy_lock(entry->mtx_lock);
68 __kmp_free(entry->mtx_lock);
71 __kmp_fast_free(thread, entry);
73 __kmp_thread_free(thread, entry);
79 __kmp_node_deref(thread, h->last_all);
83static inline void __kmp_dephash_free(kmp_info_t *thread, kmp_dephash_t *h) {
84 __kmp_dephash_free_entries(thread, h);
86 __kmp_fast_free(thread, h);
88 __kmp_thread_free(thread, h);
92extern void __kmpc_give_task(kmp_task_t *ptask, kmp_int32 start);
94static inline void __kmp_release_deps(kmp_int32 gtid, kmp_taskdata_t *task) {
95 kmp_info_t *thread = __kmp_threads[gtid];
96 kmp_depnode_t *node = task->td_depnode;
99 if (UNLIKELY(node && (node->dn.mtx_num_locks < 0))) {
101 node->dn.mtx_num_locks = -node->dn.mtx_num_locks;
102 for (
int i = node->dn.mtx_num_locks - 1; i >= 0; --i) {
103 KMP_DEBUG_ASSERT(node->dn.mtx_locks[i] != NULL);
104 __kmp_release_lock(node->dn.mtx_locks[i], gtid);
108 if (task->td_dephash) {
110 40, (
"__kmp_release_deps: T#%d freeing dependencies hash of task %p.\n",
112 __kmp_dephash_free(thread, task->td_dephash);
113 task->td_dephash = NULL;
119 KA_TRACE(20, (
"__kmp_release_deps: T#%d notifying successors of task %p.\n",
122 KMP_ACQUIRE_DEPNODE(gtid, node);
125 KMP_RELEASE_DEPNODE(gtid, node);
127 kmp_depnode_list_t *next;
128 kmp_taskdata_t *next_taskdata;
129 for (kmp_depnode_list_t *p = node->dn.successors; p; p = next) {
130 kmp_depnode_t *successor = p->node;
131#if USE_ITT_BUILD && USE_ITT_NOTIFY
132 __itt_sync_releasing(successor);
134 kmp_int32 npredecessors = KMP_ATOMIC_DEC(&successor->dn.npredecessors) - 1;
138 if (npredecessors == 0) {
139#if USE_ITT_BUILD && USE_ITT_NOTIFY
140 __itt_sync_acquired(successor);
143 if (successor->dn.task) {
144 KA_TRACE(20, (
"__kmp_release_deps: T#%d successor %p of %p scheduled "
146 gtid, successor->dn.task, task));
150 if (KMP_HIDDEN_HELPER_THREAD(gtid)) {
152 KMP_ASSERT(task->td_flags.hidden_helper);
153 next_taskdata = KMP_TASK_TO_TASKDATA(successor->dn.task);
157 if (!next_taskdata->td_flags.hidden_helper) {
158 kmp_int32 encountering_gtid =
159 next_taskdata->td_alloc_thread->th.th_info.ds.ds_gtid;
160 kmp_int32 encountering_tid = __kmp_tid_from_gtid(encountering_gtid);
161 __kmpc_give_task(successor->dn.task, encountering_tid);
163 __kmp_omp_task(gtid, successor->dn.task,
false);
166 __kmp_omp_task(gtid, successor->dn.task,
false);
172 __kmp_node_deref(thread, p->node);
174 __kmp_fast_free(thread, p);
176 __kmp_thread_free(thread, p);
180 __kmp_node_deref(thread, node);
184 (
"__kmp_release_deps: T#%d all successors of %p notified of completion\n",