37   node->dn.successors = NULL;  in __kmp_init_node()
38   node->dn.task = NULL; // will point to the right task  in __kmp_init_node()
41     node->dn.mtx_locks[i] = NULL;  in __kmp_init_node()
42   node->dn.mtx_num_locks = 0;  in __kmp_init_node()
43   __kmp_init_lock(&node->dn.lock);  in __kmp_init_node()
44   KMP_ATOMIC_ST_RLX(&node->dn.nrefs, 1); // init creates the first reference  in __kmp_init_node()
46   node->dn.id = KMP_ATOMIC_INC(&kmp_node_id_seed);  in __kmp_init_node()
54   KMP_ATOMIC_INC(&node->dn.nrefs);  in __kmp_node_ref()
222   kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);  in __kmp_track_dependence()
224   if (source->dn.task && sink_task) {  in __kmp_track_dependence()
260   kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);  in __kmp_track_dependence()
261   // do not use sink->dn.task as that is only filled after the dependences  in __kmp_track_dependence()
265   __kmp_printf("%d(%s) -> %d(%s)\n", source->dn.id,  in __kmp_track_dependence()
266                task_source->td_ident->psource, sink->dn.id,  in __kmp_track_dependence()
274     kmp_taskdata_t *task_source = KMP_TASK_TO_TASKDATA(source->dn.task);  in __kmp_track_dependence()
289   return td->td_depnode ? &(td->td_depnode->dn) : NULL;  in __kmpc_task_get_depnode()
294   return td->td_depnode->dn.successors;  in __kmpc_task_get_successors()
317     if (dep->dn.task) {  in __kmp_depnode_link_successor()
319       if (dep->dn.task) {  in __kmp_depnode_link_successor()
320         if (!dep->dn.successors || dep->dn.successors->node != node) {  in __kmp_depnode_link_successor()
325           dep->dn.successors = __kmp_add_node(thread, dep->dn.successors, node);  in __kmp_depnode_link_successor()
328                         gtid, KMP_TASK_TO_TASKDATA(dep->dn.task),  in __kmp_depnode_link_successor()
354     if (__kmp_tdg_is_recording(tdg_status) && sink->dn.task)  in __kmp_depnode_link_successor()
358   if (sink->dn.task) {  in __kmp_depnode_link_successor()
361     if (sink->dn.task) {  in __kmp_depnode_link_successor()
362       if (!sink->dn.successors || sink->dn.successors->node != source) {  in __kmp_depnode_link_successor()
367         sink->dn.successors = __kmp_add_node(thread, sink->dn.successors, source);  in __kmp_depnode_link_successor()
370                     gtid, KMP_TASK_TO_TASKDATA(sink->dn.task),  in __kmp_depnode_link_successor()
374           kmp_taskdata_t *tdd = KMP_TASK_TO_TASKDATA(sink->dn.task);  in __kmp_depnode_link_successor()
377               // decrement npredecessors if sink->dn.task belongs to a taskgraph  in __kmp_depnode_link_successor()
541         KMP_DEBUG_ASSERT(node->dn.mtx_num_locks < MAX_MTX_DEPS);  in __kmp_process_deps()
546           if (node->dn.mtx_locks[m] < info->mtx_lock) {  in __kmp_process_deps()
547             KMP_DEBUG_ASSERT(!node->dn.mtx_locks[node->dn.mtx_num_locks]);  in __kmp_process_deps()
548             for (int n = node->dn.mtx_num_locks; n > m; --n) {  in __kmp_process_deps()
550               KMP_DEBUG_ASSERT(node->dn.mtx_locks[n - 1] != NULL);  in __kmp_process_deps()
551               node->dn.mtx_locks[n] = node->dn.mtx_locks[n - 1];  in __kmp_process_deps()
553             node->dn.mtx_locks[m] = info->mtx_lock;  in __kmp_process_deps()
558         node->dn.mtx_num_locks++;  in __kmp_process_deps()
626   node->dn.npredecessors = -1;  in __kmp_check_deps()
641   node->dn.task = task;  in __kmp_check_deps()
651       node->dn.npredecessors.fetch_add(npredecessors) + npredecessors;  in __kmp_check_deps()
1026       (std::atomic<kmp_uint32> *)&node.dn.npredecessors, 0U);  in __kmpc_omp_taskwait_deps_51()
1027   while (node.dn.npredecessors > 0) {  in __kmpc_omp_taskwait_deps_51()
1036   while (node.dn.nrefs > 1)  in __kmpc_omp_taskwait_deps_51()