| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
61 std::vector<BasicBlock*> Successors;
64 /// as one of their successors.
79 for (unsigned i = 0; i < Successors.size(); ++i)
80 if (Successors[i] == BB) return true;
83 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
105 return I->Successors.begin();
108 return I->Successors.end()
[all...] |
| IntervalIterator.h | 142 // their successors now.
154 // We ran out of successors for this interval... pop off the stack
182 // Check all of our successors to see if they are in the interval...
211 Int->Successors.push_back(NodeHeader);
218 Int->Successors.push_back(NodeHeader);
230 Int->Successors.erase(std::remove(Int->Successors.begin(),
231 Int->Successors.end(), NodeHeader),
232 Int->Successors.end());
236 // of its successors are as well
[all...] |
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 54 OS << "Interval Successors:\n";
55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
56 E = Successors.end(); I != E; ++I)
|
| IntervalPartition.cpp | 60 for (Interval::succ_iterator I = Int->Successors.begin(),
61 E = Int->Successors.end(); I != E; ++I)
|
| /external/v8/src/compiler/ |
| schedule.cc | 73 BasicBlock::Successors successors = block->successors(); local
75 for (BasicBlock::Successors::iterator j = successors.begin();
76 j != successors.end(); ++j) {
|
| schedule.h | 100 typedef Uses Successors;
103 Successors successors() { return static_cast<Successors>(uses()); } function in class:v8::internal::compiler::FINAL
|
| instruction.cc | 472 BasicBlock::Successors successors = block->successors(); local
473 for (BasicBlock::Successors::iterator iter = successors.begin();
474 iter != successors.end(); ++iter) {
|
| register-allocator.cc | 533 BasicBlock::Successors successors = block->successors(); local
534 for (BasicBlock::Successors::iterator i = successors.begin();
535 i != successors.end(); ++i) {
775 BasicBlock::Successors successors = block->successors(); local
776 for (BasicBlock::Successors::iterator succ = successors.begin()
793 BasicBlock::Successors successors = block->successors(); local
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 69 /// Predecessors/Successors - Keep track of the predecessor / successor
72 std::vector<MachineBasicBlock *> Successors;
74 /// Weights - Keep track of the weights to the successors. This vector
75 /// has the same order as Successors, or it is empty if we don't use it
286 succ_iterator succ_begin() { return Successors.begin(); }
287 const_succ_iterator succ_begin() const { return Successors.begin(); }
288 succ_iterator succ_end() { return Successors.end(); }
289 const_succ_iterator succ_end() const { return Successors.end(); }
291 { return Successors.rbegin(); }
293 { return Successors.rbegin();
309 inline iterator_range<succ_iterator> successors() { function in class:llvm::MachineBasicBlock
312 inline iterator_range<const_succ_iterator> successors() const { function in class:llvm::MachineBasicBlock
[all...] |
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 76 std::map<change_ty, std::vector<change_ty> > Successors;
101 assert(Successors.count(Node) && "Invalid node!");
102 return Successors[Node].begin();
105 assert(Successors.count(Node) && "Invalid node!");
106 return Successors[Node].end();
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
192 Successors[it->first].push_back(it->second);
|
| /external/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 313 // Print the successors of this block according to the CFG.
316 OS << " Successors according to CFG:";
385 // A block with no successors has no concerns with fall-through edges.
424 // successors is its layout successor, rewrite it to a fallthrough
436 // Walk through the successors and find the successor which is not
484 Weights.resize(Successors.size());
489 Successors.push_back(succ);
495 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
496 assert(I != Successors.end() && "Not a current successor!")
[all...] |
| CodeGenPrepare.cpp | 265 SmallVector<BasicBlock *, 2> Successors(succ_begin(&BB), succ_end(&BB));
270 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
275 // Delete the dead blocks and any of their dead successors.
280 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
285 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SampleProfile.cpp | 159 /// \brief Successors for each basic block in the CFG.
160 BlockEdgeMap Successors;
458 for (auto *Succ : Successors[BB]) {
550 // Add successors for B1.
552 if (!Successors[B1].empty())
553 llvm_unreachable("Found a stale successors list in a basic block.");
557 Successors[B1].push_back(B2);
584 // unique predecessors and successors. This is necessary to handle
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 517 if (int successors = TI->getNumSuccessors()) {
518 for (int i = 0; i != successors; ++i) {
604 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
605 if (Successors) {
606 if (Successors == 1) {
628 for (int i = 0; i != Successors; ++i)
632 Edge += Successors;
702 // All edges with successors that aren't branches are "complex", because it
726 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
727 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMISelLowering.cpp | [all...] |
