HomeSort by relevance Sort by last modified time
    Searched defs:Preds (Results 1 - 8 of 8) sorted by null

  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 100 assert(I != E && "No preds, but we have an edge to the block?");
107 // non-critical iff all preds come from TI's block.
122 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
125 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
146 PHINode::Create(PN->getType(), Preds.size(), "split",
149 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
150 NewPN->addIncoming(V, Preds[i]);
353 // Collect all the preds that are inside the loop, and note
354 // whether there are any preds outside the loop
    [all...]
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
56 NumPreds(0), Preds(0), PHITag(0) { }
111 SmallVector<BlkT*, 10> Preds;
114 Preds.clear();
115 Traits::FindPredecessorBlocks(Info->BB, &Preds);
116 Info->NumPreds = Preds.size();
118 Info->Preds = 0;
120 Info->Preds = static_cast<BBInfo**>
125 BlkT *Pred = Preds[p];
130 Info->Preds[p] = BBMapBucket.second
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 117 /// Preds - The predecessors of this node.
118 NodeGroup Preds;
181 unsigned pred_size() const { return Preds.size(); }
183 bool pred_empty() const { return Preds.empty(); }
205 pred_iterator pred_begin() { return Preds.begin(); }
206 pred_iterator pred_end() { return Preds.end(); }
239 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); }
  /external/llvm/lib/Target/R600/
AMDGPUStructurizeCFG.cpp 472 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
478 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
692 BBPredicates &Preds = Predicates[Node->getEntry()];
693 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
705 BBPredicates &Preds = Predicates[Node->getEntry()];
712 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 281 // Preds/Succs - The SUnits before/after us in the graph.
282 SmallVector<SDep, 4> Preds; // All sunit predecessors.
292 unsigned NumPreds; // # of SDep::Data preds.
294 unsigned NumPredsLeft; // # of preds not scheduled.
296 unsigned WeakPredsLeft; // # of weak preds not scheduled.
457 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
458 if (Preds[i].getSUnit() == N)
636 return Node->Preds[Operand].getSUnit();
650 return SUnitIterator(N, (unsigned)N->Preds.size());
663 return Node->Preds[Operand]
    [all...]
  /external/llvm/lib/CodeGen/
MachineVerifier.cpp 123 BlockSet Preds, Succs;
467 MInfo.Preds.insert(I->pred_begin(), I->pred_end());
468 if (MInfo.Preds.size() != I->pred_size())
513 if (!MBBInfoMap[*I].Preds.count(MBB)) {
    [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 546 SmallVector<BasicBlock *, 2> Preds;
615 edge_iterator pred_begin() { return Preds.begin(); }
616 edge_iterator pred_end() { return Preds.end(); }
621 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp     [all...]

Completed in 620 milliseconds