| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 49 std::vector<unsigned> NumPreds; member in class:__anon3945::GCNMinRegScheduler
53 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max();
58 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max();
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());
64 return NumPreds[SU->NodeNum];
69 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());
70 return --NumPreds[SU->NodeNum];
94 NumPreds.resize(SUnits.size());
96 NumPreds[I] = SUnits[I].NumPredsLeft;
|
| H A D | GCNILPSched.cpp | 89 if (SU->NumSuccs == 0 && SU->NumPreds != 0)
97 if (SU->NumPreds == 0 && SU->NumSuccs != 0)
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SSAUpdaterImpl.h | 60 unsigned NumPreds = 0; member in class:llvm::SSAUpdaterImpl::BBInfo
62 // Array[NumPreds] of predecessor blocks.
131 Info->NumPreds = Preds.size();
132 if (Info->NumPreds == 0)
136 Info->NumPreds * sizeof(BBInfo *), alignof(BBInfo *)));
138 for (unsigned p = 0; p != Info->NumPreds; ++p) {
251 for (unsigned p = 0; p != Info->NumPreds; ++p) {
309 for (unsigned p = 0; p != Info->NumPreds; ++p) {
347 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater);
371 for (unsigned p = 0; p != Info->NumPreds;
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGPrinter.cpp | 39 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
|
| H A D | ScheduleDAG.cpp | 139 assert(NumPreds < std::numeric_limits<unsigned>::max() &&
140 "NumPreds will overflow!");
143 ++NumPreds;
190 assert(NumPreds > 0 && "NumPreds will underflow!");
192 --NumPreds;
326 if (NumPreds < 2)
395 if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) {
718 assert(SU->NumPreds == 0 && "Can only add SU's with no predecessors");
|
| H A D | MachineSSAUpdater.cpp | 303 static Register CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, argument
|
| H A D | WinEHPrepare.cpp | 847 unsigned NumPreds = PN->getNumIncomingValues();
848 for (unsigned PredIdx = 0, PredEnd = NumPreds; PredIdx != PredEnd;
|
| H A D | IfConversion.cpp | 2088 unsigned NumPreds = TailBB->pred_size(); local
2089 if (NumPreds > 1)
2091 else if (NumPreds == 1 && CanMergeTail) {
|
| H A D | MachinePipeliner.cpp | 1381 else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0)
|
| /freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 71 void BasicBlock::reservePredecessors(unsigned NumPreds) { argument
72 Predecessors.reserve(NumPreds, Arena);
75 Ph->values().reserve(NumPreds, Arena);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CloneFunction.cpp | 520 unsigned NumPreds = OPN->getNumIncomingValues(); local
530 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
553 NumPreds = pred_size(NewBB);
554 if (NumPreds != PN->getNumIncomingValues()) {
555 assert(NumPreds < PN->getNumIncomingValues());
|
| H A D | SSAUpdater.cpp | 251 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
273 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds, argument
275 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
|
| H A D | LoopUtils.cpp | 1307 unsigned NumPreds = PN->getNumIncomingValues(); local
1326 for (unsigned i = 0; i != NumPreds; ++i) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 336 unsigned NumPreds = cast<PHINode>(front()).getNumIncomingValues(); local
345 if (NumPreds > 1) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ResourcePriorityQueue.cpp | 524 if (ParallelLiveRanges >= SU->NumPreds)
525 ParallelLiveRanges -= SU->NumPreds;
|
| H A D | ScheduleDAGRRList.cpp | 2043 if (SU->NumSuccs == 0 && SU->NumPreds != 0)
2050 if (SU->NumPreds == 0 && SU->NumSuccs != 0)
2724 if (SU->NumPreds == 0 && SU->NumSuccs != 0)
2949 if (SU.NumPreds != 1)
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SpeculateAroundPHIs.cpp | 428 int NumPreds, DominatorTree &DT, TargetTransformInfo &TTI) {
501 SpecCost *= (NumPreds - 1);
425 findProfitablePHIs(ArrayRef<PHINode *> PNs, const SmallDenseMap<PHINode *, int, 16> &CostSavingsMap, const SmallPtrSetImpl<Instruction *> &PotentialSpecSet, int NumPreds, DominatorTree &DT, TargetTransformInfo &TTI) argument
|
| H A D | JumpThreading.cpp | 965 unsigned NumPreds = pred_size(TestBB); local
966 if (NumPreds < MinNumPreds) {
968 MinNumPreds = NumPreds;
|
| H A D | RewriteStatepointsForGC.cpp | 1016 int NumPreds = pred_size(BB);
1017 assert(NumPreds > 0 && "how did we reach here");
1019 return PHINode::Create(I->getType(), NumPreds, Name, I);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | MemorySSA.h | 490 MemoryPhi(LLVMContext &C, BasicBlock *BB, unsigned Ver, unsigned NumPreds = 0)
492 ReservedSpace(NumPreds) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 266 unsigned NumPreds = 0; ///< # of SDep::Data preds. variable
|
| /freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1602 // Reserve space for NumPreds predecessors, including space in phi nodes.
1603 void reservePredecessors(unsigned NumPreds);
|