Home
last modified time | relevance | path

Searched refs:NumPreds (Results 1 – 21 of 21) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp43 std::vector<unsigned> NumPreds; member in __anon091349650111::GCNMinRegScheduler
47 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
52 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
57 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
58 return NumPreds[SU->NodeNum]; in getNumPreds()
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
64 return --NumPreds[SU->NodeNum]; in decNumPreds()
88 NumPreds.resize(SUnits.size()); in initNumPreds()
90 NumPreds[I] = SUnits[I].NumPredsLeft; in initNumPreds()
H A DGCNILPSched.cpp89 if (SU->NumSuccs == 0 && SU->NumPreds != 0) in getNodePriority()
97 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in getNodePriority()
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h61 unsigned NumPreds = 0; variable
132 Info->NumPreds = Preds.size(); in BuildBlockList()
133 if (Info->NumPreds == 0) in BuildBlockList()
137 Info->NumPreds * sizeof(BBInfo *), alignof(BBInfo *))); in BuildBlockList()
139 for (unsigned p = 0; p != Info->NumPreds; ++p) { in BuildBlockList()
252 for (unsigned p = 0; p != Info->NumPreds; ++p) { in FindDominators()
310 for (unsigned p = 0; p != Info->NumPreds; ++p) { in FindPHIPlacement()
348 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); in FindAvailableVals()
372 for (unsigned p = 0; p != Info->NumPreds; ++p) { in FindAvailableVals()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp135 assert(NumPreds < std::numeric_limits<unsigned>::max() && in addPred()
139 ++NumPreds; in addPred()
186 assert(NumPreds > 0 && "NumPreds will underflow!"); in removePred()
188 --NumPreds; in removePred()
322 if (NumPreds < 2) in biasCriticalPath()
391 if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) { in VerifyScheduledDAG()
H A DScheduleDAGPrinter.cpp40 return (Node->NumPreds > 10 || Node->NumSuccs > 10); in isNodeHidden()
H A DMachineSSAUpdater.cpp304 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI() argument
H A DWinEHPrepare.cpp824 unsigned NumPreds = PN->getNumIncomingValues(); in cloneCommonBlocks() local
825 for (unsigned PredIdx = 0, PredEnd = NumPreds; PredIdx != PredEnd; in cloneCommonBlocks()
H A DIfConversion.cpp1958 unsigned NumPreds = TailBB->pred_size(); in IfConvertDiamond() local
1959 if (NumPreds > 1) in IfConvertDiamond()
1961 else if (NumPreds == 1 && CanMergeTail) { in IfConvertDiamond()
H A DMachinePipeliner.cpp1090 else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0) in apply()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp72 void BasicBlock::reservePredecessors(unsigned NumPreds) { in reservePredecessors() argument
73 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
76 Ph->values().reserve(NumPreds, Arena); in reservePredecessors()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp509 unsigned NumPreds = OPN->getNumIncomingValues(); in CloneAndPruneIntoFromInst() local
519 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) { in CloneAndPruneIntoFromInst()
542 NumPreds = pred_size(NewBB); in CloneAndPruneIntoFromInst()
543 if (NumPreds != PN->getNumIncomingValues()) { in CloneAndPruneIntoFromInst()
544 assert(NumPreds < PN->getNumIncomingValues()); in CloneAndPruneIntoFromInst()
H A DSSAUpdater.cpp279 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI() argument
281 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds, in CreateEmptyPHI()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp518 if (ParallelLiveRanges >= SU->NumPreds) in scheduledNode()
519 ParallelLiveRanges -= SU->NumPreds; in scheduledNode()
H A DScheduleDAGRRList.cpp2026 if (SU->NumSuccs == 0 && SU->NumPreds != 0) in getNodePriority()
2033 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in getNodePriority()
2707 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in canEnableCoalescing()
2932 if (SU.NumPreds != 1) in PrescheduleNodesWithMultipleUses()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DSpeculateAroundPHIs.cpp417 int NumPreds, DominatorTree &DT, TargetTransformInfo &TTI) { in findProfitablePHIs() argument
490 SpecCost *= (NumPreds - 1); in findProfitablePHIs()
H A DJumpThreading.cpp956 unsigned NumPreds = pred_size(TestBB); in GetBestDestForJumpOnUndef() local
957 if (NumPreds < MinNumPreds) { in GetBestDestForJumpOnUndef()
959 MinNumPreds = NumPreds; in GetBestDestForJumpOnUndef()
H A DRewriteStatepointsForGC.cpp970 int NumPreds = pred_size(BB); in findBasePointer() local
971 assert(NumPreds > 0 && "how did we reach here"); in findBasePointer()
973 return PHINode::Create(I->getType(), NumPreds, Name, I); in findBasePointer()
H A DIndVarSimplify.cpp582 unsigned NumPreds = PN->getNumIncomingValues(); in rewriteLoopExitValues() local
601 for (unsigned i = 0; i != NumPreds; ++i) { in rewriteLoopExitValues()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DMemorySSA.h487 MemoryPhi(LLVMContext &C, BasicBlock *BB, unsigned Ver, unsigned NumPreds = 0)
489 ReservedSpace(NumPreds) {
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h270 unsigned NumPreds = 0; ///< # of SDep::Data preds.
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h1604 void reservePredecessors(unsigned NumPreds);