/external/llvm/include/llvm/Transforms/Utils/ |
SSAUpdaterImpl.h | 50 unsigned NumPreds; // Number of predecessor blocks. 51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. 56 NumPreds(0), Preds(0), PHITag(0) { } 116 Info->NumPreds = Preds.size(); 117 if (Info->NumPreds == 0) 121 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*), 124 for (unsigned p = 0; p != Info->NumPreds; ++p) { 237 for (unsigned p = 0; p != Info->NumPreds; ++p) { 295 for (unsigned p = 0; p != Info->NumPreds; ++p) { 333 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater) [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAGPrinter.cpp | 45 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
|
ScheduleDAG.cpp | 98 assert(NumPreds < UINT_MAX && "NumPreds will overflow!"); 100 ++NumPreds; 149 assert(NumPreds > 0 && "NumPreds will underflow!"); 151 --NumPreds; 299 if (NumPreds < 2) 388 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
|
MachineSSAUpdater.cpp | 305 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds,
|
IfConversion.cpp | [all...] |
MachineScheduler.cpp | [all...] |
/external/llvm/include/llvm/CodeGen/ |
ScheduleDAG.h | 273 unsigned NumPreds; // # of SDep::Data preds. 313 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0), 327 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0), 340 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
|
/external/llvm/lib/Transforms/Utils/ |
CloneFunction.cpp | 426 unsigned NumPreds = OPN->getNumIncomingValues(); 436 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) { 458 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB)); 459 if (NumPreds != PN->getNumIncomingValues()) { 460 assert(NumPreds < PN->getNumIncomingValues());
|
SSAUpdater.cpp | 242 /// vector, set Info->NumPreds, and allocate space in Info->Preds. 265 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds, 267 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
|
/external/llvm/include/llvm/Analysis/ |
ProfileInfo.h | 163 BType *const *Preds, unsigned NumPreds);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ResourcePriorityQueue.cpp | 535 if (ParallelLiveRanges >= SU->NumPreds) 536 ParallelLiveRanges -= SU->NumPreds;
|
ScheduleDAGRRList.cpp | [all...] |
/external/llvm/lib/Analysis/ |
ProfileInfo.cpp | 444 unsigned NumPreds) { 450 DEBUG(dbgs() << "Splitting " << NumPreds << " Edges from " << BB->getName() 458 for (unsigned pred = 0; pred < NumPreds; ++pred) { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
IndVarSimplify.cpp | 495 unsigned NumPreds = PN->getNumIncomingValues(); 515 for (unsigned i = 0; i != NumPreds; ++i) { 596 if (NumPreds == 1) { 604 if (NumPreds != 1) { [all...] |
JumpThreading.cpp | 618 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); 619 if (NumPreds < MinNumPreds) { 621 MinNumPreds = NumPreds; [all...] |