| /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/lib/MC/MCAnalysis/ |
| MCFunction.cpp | 59 Predecessors.push_back(MCBB);
63 return std::find(Predecessors.begin(), Predecessors.end(),
64 MCBB) != Predecessors.end();
|
| /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/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 52 unsigned Idx = Predecessors.size();
53 Predecessors.reserveCheck(1, Arena);
54 Predecessors.push_back(Pred);
65 Predecessors.reserve(NumPreds, Arena);
|
| /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/chromium_org/v8/src/compiler/ |
| schedule.cc | 40 BasicBlock::Predecessors predecessors = block->predecessors(); local
42 for (BasicBlock::Predecessors::iterator j = predecessors.begin();
43 j != predecessors.end(); ++j) {
|
| 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...] |
| instruction.cc | 436 << ")\n predecessors:";
438 BasicBlock::Predecessors predecessors = block->predecessors(); local
439 for (BasicBlock::Predecessors::iterator iter = predecessors.begin();
440 iter != predecessors.end(); ++iter) {
|
| scheduler.cc | 329 BasicBlock::Predecessors::iterator current_pred =
330 current_rpo->predecessors().begin();
331 BasicBlock::Predecessors::iterator end =
332 current_rpo->predecessors().end();
336 // For multiple predecessors, walk up the rpo ordering until a common
532 *hoist_block->predecessors().begin() == pre_header);
805 // Push the member onto the queue and process its predecessors.
812 // Propagate loop membership backwards. All predecessors of M up to the
[all...] |
| register-allocator.cc | 1268 BasicBlock::Predecessors predecessors = block->predecessors(); local
[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/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/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...] |
| /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/lib/CodeGen/ |
| MachineBasicBlock.cpp | 304 OS << " Predecessors according to CFG:";
402 assert(!B && "UpdateTerminators requires analyzable predecessors!");
571 Predecessors.push_back(pred);
575 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred);
576 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
577 Predecessors.erase(I);
874 assert(VNI && "PHI sources should be live out of their predecessors.");
925 // If all the other predecessors of "Succ" are dominated by "Succ" itself
[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...] |
