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

  /external/llvm/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
63 /// Predecessors - List of BasicBlocks that have this Interval's header block
66 std::vector<BasicBlock*> Predecessors;
115 return I->Predecessors.begin();
118 return I->Predecessors.end();
  /external/llvm/include/llvm/MC/MCAnalysis/
MCFunction.h 42 /// \name Predecessors/Successors, to represent the CFG.
46 BasicBlockListTy Predecessors;
59 /// MC CFG access: Predecessors/Successors.
66 pred_const_iterator pred_begin() const { return Predecessors.begin(); }
67 pred_const_iterator pred_end() const { return Predecessors.end(); }
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 78 std::map<change_ty, std::vector<change_ty> > Predecessors;
86 assert(Predecessors.count(Node) && "Invalid node!");
87 return Predecessors[Node].begin();
90 assert(Predecessors.count(Node) && "Invalid node!");
91 return Predecessors[Node].end();
194 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
199 Predecessors[it->second].push_back(it->first);
  /external/chromium_org/v8/src/compiler/
schedule.h 101 typedef Inputs Predecessors;
104 Predecessors predecessors() { return static_cast<Predecessors>(inputs()); } function in class:v8::internal::compiler::FINAL
113 BasicBlock::Predecessors predecessors = this->predecessors(); local
114 for (BasicBlock::Predecessors::iterator i = predecessors.begin();
115 i != predecessors.end(); ++i)
    [all...]
  /art/compiler/dex/
mir_optimization.cc 28 static unsigned int Predecessors(BasicBlock* bb) {
29 return bb->predecessors->Size();
113 if ((bb == NULL) || Predecessors(bb) != 1) {
166 if (bb == NULL || (Predecessors(bb) != 1)) {
449 (Predecessors(tk) == 1) && (Predecessors(ft) == 1)) {
615 if ((walker->block_type == kEntryBlock) || (Predecessors(walker) != 1)) {
618 BasicBlock* prev = GetBasicBlock(walker->predecessors->Get(0));
695 DCHECK_EQ(Predecessors(bb_next), 1U);
770 } else if (bb->predecessors->Size() == 1)
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 69 /// Predecessors/Successors - Keep track of the predecessor / successor
71 std::vector<MachineBasicBlock *> Predecessors;
270 pred_iterator pred_begin() { return Predecessors.begin(); }
271 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
272 pred_iterator pred_end() { return Predecessors.end(); }
273 const_pred_iterator pred_end() const { return Predecessors.end(); }
275 { return Predecessors.rbegin();}
277 { return Predecessors.rbegin();}
279 { return Predecessors.rend(); }
281 { return Predecessors.rend();
303 inline iterator_range<pred_iterator> predecessors() { function in class:llvm::MachineBasicBlock
306 inline iterator_range<const_pred_iterator> predecessors() const { function in class:llvm::MachineBasicBlock
    [all...]
  /external/llvm/lib/Transforms/Scalar/
SampleProfile.cpp 207 /// \brief Predecessors for each basic block in the CFG.
208 BlockEdgeMap Predecessors;
774 for (size_t I = 0; I < Predecessors[BB].size(); I++) {
775 Edge E = std::make_pair(Predecessors[BB][I], BB);
    [all...]
  /external/clang/include/clang/Analysis/Analyses/
ThreadSafetyTIL.h 1436 const BlockArray &predecessors() const { return Predecessors; } function in class:clang::threadSafety::BasicBlock
1437 BlockArray &predecessors() { return Predecessors; } function in class:clang::threadSafety::BasicBlock
    [all...]

Completed in 1533 milliseconds