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

  /external/llvm/lib/MC/
MCFunction.cpp 49 Predecessors.push_back(MCBB);
53 return std::find(Predecessors.begin(), Predecessors.end(),
54 MCBB) != Predecessors.end();
  /external/llvm/lib/Analysis/
Interval.cpp 30 // There is a loop in this interval iff one of the predecessors of the header
49 OS << "Interval Predecessors:\n";
50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(),
51 E = Predecessors.end(); I != E; ++I)
IntervalPartition.cpp 62 getBlockInterval(*I)->Predecessors.push_back(Header);
82 // predecessors for each block.
110 // predecessors for each block.
  /external/llvm/include/llvm/MC/
MCFunction.h 41 /// \name Predecessors/Successors, to represent the CFG.
45 BasicBlockListTy Predecessors;
58 /// MC CFG access: Predecessors/Successors.
65 pred_const_iterator pred_begin() const { return Predecessors.begin(); }
66 pred_const_iterator pred_end() const { return Predecessors.end(); }
  /external/llvm/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
66 /// Predecessors - List of BasicBlocks that have this Interval's header block
69 std::vector<BasicBlock*> Predecessors;
118 return I->Predecessors.begin();
121 return I->Predecessors.end();
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 69 /// Predecessors/Successors - Keep track of the predecessor / successor
71 std::vector<MachineBasicBlock *> Predecessors;
260 pred_iterator pred_begin() { return Predecessors.begin(); }
261 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
262 pred_iterator pred_end() { return Predecessors.end(); }
263 const_pred_iterator pred_end() const { return Predecessors.end(); }
265 { return Predecessors.rbegin();}
267 { return Predecessors.rbegin();}
269 { return Predecessors.rend(); }
271 { return Predecessors.rend();
    [all...]
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 76 std::map<change_ty, std::vector<change_ty> > Predecessors;
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
197 Predecessors[it->second].push_back(it->first);
  /art/compiler/dex/
mir_optimization.cc 23 static unsigned int Predecessors(BasicBlock* bb) {
24 return bb->predecessors->Size();
112 if ((bb == NULL) || Predecessors(bb) != 1) {
164 if (bb == NULL || (Predecessors(bb) != 1)) {
347 (Predecessors(tk) == 1) && (Predecessors(ft) == 1)) {
511 if ((walker->block_type == kEntryBlock) || (Predecessors(walker) != 1)) {
514 BasicBlock* prev = walker->predecessors->Get(0);
583 DCHECK_EQ(Predecessors(bb_next), 1U);
633 } else if (bb->predecessors->Size() == 1)
    [all...]
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 302 OS << " Predecessors according to CFG:";
396 assert(!B && "UpdateTerminators requires analyzable predecessors!");
565 Predecessors.push_back(pred);
569 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred);
570 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
571 Predecessors.erase(I);
863 assert(VNI && "PHI sources should be live out of their predecessors.");
914 // If all the other predecessors of "Succ" are dominated by "Succ" itself
    [all...]

Completed in 261 milliseconds