Searched refs:isBoundaryNode (Results 1 – 9 of 9) sorted by relevance
45 assert(!SU->isBoundaryNode()); in isScheduled()50 assert(!SU->isBoundaryNode()); in setIsScheduled()55 assert(!SU->isBoundaryNode()); in getNumPreds()61 assert(!SU->isBoundaryNode()); in decNumPreds()98 assert(!PSU->isBoundaryNode()); in getReadySuccessors()186 if (S.getSUnit()->isBoundaryNode() || isScheduled(S.getSUnit()) || in bumpPredsPriority()191 assert(!PSU->isBoundaryNode()); in bumpPredsPriority()200 assert(!SU->isBoundaryNode()); in bumpPredsPriority()202 if (!P.getSUnit()->isBoundaryNode() && !isScheduled(P.getSUnit()) && in bumpPredsPriority()225 assert(SuccSU->isBoundaryNode() || getNumPreds(SuccSU) > 0); in releaseSuccessors()[all …]
281 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()285 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()
184 if (DepSU.isBoundaryNode()) in scheduleAdjacentImpl()
626 if (Succ->isBoundaryNode()) in GetSubGraph()660 if (Pred->isBoundaryNode()) in GetSubGraph()
1439 !SuccDep.getSUnit()->isBoundaryNode()) in hasDataSucc()1466 || PredDep.getSUnit()->isBoundaryNode()) { in compute()
1163 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()1514 if (Cur->isBoundaryNode()) in computePath()2720 if (SuccSU->isBoundaryNode()) in checkValidNodeOrder()
832 assert(!SU.isBoundaryNode() && "Boundary node should not be in SUnits"); in findRootsAndBiasEdges()
344 bool isBoundaryNode() const { return NodeNum == BoundaryID; } in isBoundaryNode() function
493 if (Dst->isBoundaryNode()) in isBestZeroLatency()