Searched refs:isBoundaryNode (Results 1 – 10 of 10) sorted by relevance
39 assert(!SU->isBoundaryNode()); in isScheduled()44 assert(!SU->isBoundaryNode()); in setIsScheduled()49 assert(!SU->isBoundaryNode()); in getNumPreds()55 assert(!SU->isBoundaryNode()); in decNumPreds()92 assert(!PSU->isBoundaryNode()); in getReadySuccessors()180 if (S.getSUnit()->isBoundaryNode() || isScheduled(S.getSUnit()) || in bumpPredsPriority()185 assert(!PSU->isBoundaryNode()); in bumpPredsPriority()194 assert(!SU->isBoundaryNode()); in bumpPredsPriority()196 if (!P.getSUnit()->isBoundaryNode() && !isScheduled(P.getSUnit()) && in bumpPredsPriority()218 assert(SuccSU->isBoundaryNode() || getNumPreds(SuccSU) > 0); in releaseSuccessors()[all …]
280 assert(PredSU->isBoundaryNode() || PredSU->NumSuccsLeft > 0); in releasePredecessors()284 if (!PredSU->isBoundaryNode() && --PredSU->NumSuccsLeft == 0) in releasePredecessors()
174 if (JSUI->isBoundaryNode()) in apply()
198 if (DepSU.isBoundaryNode()) in scheduleAdjacentImpl()
626 if (Succ->isBoundaryNode()) in GetSubGraph()660 if (Pred->isBoundaryNode()) in GetSubGraph()
1614 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()1803 if (D.isArtificial() || D.getSUnit()->isBoundaryNode()) in ignoreDependence()1852 if (succ->isBoundaryNode()) in computeNodeFunctions()1948 if (Cur->isBoundaryNode()) in computePath()2170 if (!SI.isArtificial() && !Successor->isBoundaryNode() && in addConnectedNodes()2668 Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode()) in isLoopCarriedDep()2832 if (Visited.count(SuccSU) || SuccSU->isBoundaryNode()) in latestCycleInChain()3176 if (SI.isAssignedRegDep() && !SI.getSUnit()->isBoundaryNode()) in isValidSchedule()3248 if (SuccSU->isBoundaryNode()) in checkValidNodeOrder()
1457 !SuccDep.getSUnit()->isBoundaryNode()) in hasDataSucc()1484 || PredDep.getSUnit()->isBoundaryNode()) { in compute()
882 assert(!SU.isBoundaryNode() && "Boundary node should not be in SUnits"); in findRootsAndBiasEdges()
344 bool isBoundaryNode() const { return NodeNum == BoundaryID; } in isBoundaryNode() function
642 if (Dst->isBoundaryNode()) in isBestZeroLatency()