HomeSort by relevance Sort by last modified time
    Searched refs:NumPreds (Results 1 - 14 of 14) sorted by null

  /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 164 /// Preds array, which has NumPreds elements in it. The new block is given a
174 unsigned NumPreds, const char *Suffix,
  /external/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 321 /// Preds array, which has NumPreds elements in it. The new block is given a
331 unsigned NumPreds, const char *Suffix,
350 for (unsigned i = 0; i != NumPreds; ++i) {
386 if (NumPreds == 0) {
402 for (unsigned i = 0; i != NumPreds; ++i)
433 for (unsigned i = 1; i != NumPreds; ++i)
444 for (unsigned i = 0; i != NumPreds; ++i)
450 PHINode::Create(PN->getType(), NumPreds, PN->getName()+".ph", BI);
454 for (unsigned i = 0; i != NumPreds; ++i) {
CloneFunction.cpp 422 unsigned NumPreds = OPN->getNumIncomingValues();
432 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
454 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
455 if (NumPreds != PN->getNumIncomingValues()) {
456 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/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;
146 assert(NumPreds > 0 && "NumPreds will underflow!");
148 --NumPreds;
357 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
MachineSSAUpdater.cpp 312 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds,
IfConversion.cpp     [all...]
  /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 533 unsigned NumPreds = PN->getNumIncomingValues();
553 for (unsigned i = 0; i != NumPreds; ++i) {
593 if (NumPreds == 1) {
601 if (NumPreds != 1) {
    [all...]

Completed in 134 milliseconds