Searched refs:NumSuccs (Results 1 – 9 of 9) sorted by relevance
140 assert(N->NumSuccs < std::numeric_limits<unsigned>::max() && in addPred()143 ++N->NumSuccs; in addPred()188 assert(N->NumSuccs > 0 && "NumSuccs will underflow!"); in removePred()190 --N->NumSuccs; in removePred()398 if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) { in VerifyScheduledDAG()
34 return (Node->NumPreds > 10 || Node->NumSuccs > 10); in isNodeHidden()
891 if (SU->NumSuccs == 0 && SU->Latency > 1 && (HasVRegDef || MI.mayLoad())) { in buildSchedGraph()
155 unsigned NumSuccs = MBB.succ_size(); in runOnMachineFunction() local184 if ((NumSuccs == 2) && LayoutSucc && (LayoutSucc->pred_size() == 1)) { in runOnMachineFunction()
407 unsigned NumSuccs = succ_size(BB); in buildPlainCFG() local408 if (NumSuccs == 1) { in buildPlainCFG()415 assert(BI->isConditional() && NumSuccs == 2 && BI->isConditional() && in buildPlainCFG()
88 if (SU->NumSuccs == 0 && SU->NumPreds != 0) in getNodePriority()96 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in getNodePriority()
2053 if (SU->NumSuccs == 0 && SU->NumPreds != 0) in getNodePriority()2060 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in getNodePriority()2121 if (!N->isMachineOpcode() || !SU->NumSuccs) in MayReduceRegPressure()2167 if (!N || !N->isMachineOpcode() || !SU->NumSuccs) in RegPressureDiff()2324 if (SU->NumSuccs && N->isMachineOpcode()) { in unscheduledNode()2743 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in canEnableCoalescing()2962 if (SU.NumSuccs != 0) in PrescheduleNodesWithMultipleUses()3011 if (PredSU->NumSuccs == 1) in PrescheduleNodesWithMultipleUses()3026 if (PredSuccSU->NumSuccs == 0) in PrescheduleNodesWithMultipleUses()
810 size_t NumSuccs = SuccNodes[SrcBB].size(); in getBestMergeGain() 811 for (size_t Idx = 0; Idx < NumSuccs; Idx++) { in getBestMergeGain() 812 size_t DstBB = SuccNodes[SrcBB][NumSuccs - Idx - 1]; in getBestMergeGain() 751 size_t NumSuccs = SuccNodes[SrcBB].size(); mergeColdChains() local
273 unsigned NumSuccs = 0; ///< # of SDep::Data sucss. variable