Lines Matching defs:npredecessors

255       sink_info->npredecessors++;
303   kmp_int32 npredecessors = 0;
330           npredecessors++;
336   return npredecessors;
347   kmp_int32 npredecessors = 0;
377               // decrement npredecessors if sink->dn.task belongs to a taskgraph
381               npredecessors--;
385       npredecessors++;
390   return npredecessors;
400   kmp_int32 npredecessors = 0;
403   npredecessors +=
426         npredecessors +=
434         npredecessors +=
446                 npredecessors));
447   return npredecessors;
460   kmp_int32 npredecessors = 0;
475         npredecessors +=
483         npredecessors +=
499         npredecessors +=
502         npredecessors +=
513         npredecessors +=
563                 gtid, npredecessors));
564   return npredecessors;
624   // npredecessors is set -1 to ensure that none of the releasing tasks queues
626   node->dn.npredecessors = -1;
628   // used to pack all npredecessors additions into a single atomic operation at
630   int npredecessors;
633     npredecessors = __kmp_process_deps<true>(gtid, node, hash, dep_barrier,
635     npredecessors += __kmp_process_deps<false>(
638     npredecessors = __kmp_process_dep_all(gtid, node, *hash, dep_barrier, task);
645   npredecessors++;
650   npredecessors =
651       node->dn.npredecessors.fetch_add(npredecessors) + npredecessors;
654                 gtid, npredecessors, taskdata));
658   return npredecessors > 0 ? true : false;
716           new_record[i].npredecessors = 0;
1026       (std::atomic<kmp_uint32> *)&node.dn.npredecessors, 0U);
1027   while (node.dn.npredecessors > 0) {