Lines Matching refs:dn
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))
25 kmp_int32 n = KMP_ATOMIC_DEC(&node->dn.nrefs) - 1; in __kmp_node_deref()
31 KMP_ASSERT(node->dn.nrefs == 0); in __kmp_node_deref()
116 if (UNLIKELY(node && (node->dn.mtx_num_locks < 0))) { in __kmp_release_deps()
118 node->dn.mtx_num_locks = -node->dn.mtx_num_locks; in __kmp_release_deps()
119 for (int i = node->dn.mtx_num_locks - 1; i >= 0; --i) { in __kmp_release_deps()
120 KMP_DEBUG_ASSERT(node->dn.mtx_locks[i] != NULL); in __kmp_release_deps()
121 __kmp_release_lock(node->dn.mtx_locks[i], gtid); in __kmp_release_deps()
144 node->dn.task = in __kmp_release_deps()
150 for (kmp_depnode_list_t *p = node->dn.successors; p; p = next) { in __kmp_release_deps()
155 kmp_int32 npredecessors = KMP_ATOMIC_DEC(&successor->dn.npredecessors) - 1; in __kmp_release_deps()
164 if (successor->dn.task) { in __kmp_release_deps()
167 gtid, successor->dn.task, task)); in __kmp_release_deps()
174 next_taskdata = KMP_TASK_TO_TASKDATA(successor->dn.task); in __kmp_release_deps()
182 __kmpc_give_task(successor->dn.task, encountering_tid); in __kmp_release_deps()
184 __kmp_omp_task(gtid, successor->dn.task, false); in __kmp_release_deps()
187 __kmp_omp_task(gtid, successor->dn.task, false); in __kmp_release_deps()