| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 42 unsigned NumPreds; // Number of predecessor blocks.
43 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
48 NumPreds(0), Preds(0), PHITag(0) { }
108 Info->NumPreds = Preds.size();
109 if (Info->NumPreds == 0)
113 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*),
116 for (unsigned p = 0; p != Info->NumPreds; ++p) {
229 for (unsigned p = 0; p != Info->NumPreds; ++p) {
287 for (unsigned p = 0; p != Info->NumPreds; ++p) {
325 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater)
[all...] |
| BasicBlockUtils.h | 167 /// Preds array, which has NumPreds elements in it. The new block is given a
177 unsigned NumPreds, const char *Suffix,
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 247 unsigned NumPreds; // # of SDep::Data preds.
281 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
295 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
308 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 100 assert(NumPreds < UINT_MAX && "NumPreds will overflow!");
102 ++NumPreds;
147 assert(NumPreds > 0 && "NumPreds will underflow!");
149 --NumPreds;
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
|
| MachineSSAUpdater.cpp | 312 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds,
|
| IfConversion.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 447 /// Preds array, which has NumPreds elements in it. The new block is given a
457 unsigned NumPreds, const char *Suffix,
467 for (unsigned i = 0; i != NumPreds; ++i) {
480 if (NumPreds == 0) {
489 UpdateAnalysisInformation(BB, NewBB, ArrayRef<BasicBlock*>(Preds, NumPreds),
493 UpdatePHINodes(BB, NewBB, ArrayRef<BasicBlock*>(Preds, NumPreds), BI,
|
| CloneFunction.cpp | 418 unsigned NumPreds = OPN->getNumIncomingValues();
428 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
450 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
451 if (NumPreds != PN->getNumIncomingValues()) {
452 assert(NumPreds < PN->getNumIncomingValues());
|
| SSAUpdater.cpp | 276 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
299 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds,
301 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
|
| /external/llvm/include/llvm/Analysis/ |
| ProfileInfo.h | 164 BType *const *Preds, unsigned NumPreds);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| 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/ |
| JumpThreading.cpp | 602 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB));
603 if (NumPreds < MinNumPreds) {
605 MinNumPreds = NumPreds;
[all...] |
| IndVarSimplify.cpp | 512 unsigned NumPreds = PN->getNumIncomingValues();
532 for (unsigned i = 0; i != NumPreds; ++i) {
572 if (NumPreds == 1) {
580 if (NumPreds != 1) {
[all...] |
