Searched defs:Successors (Results 1 - 6 of 6) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DInterval.h57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
61 std::vector<BasicBlock*> Successors; member in class:llvm::Interval
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();
/external/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp76 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon10598::DAGDeltaAlgorithmImpl
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/Transforms/Scalar/
H A DSampleProfile.cpp159 /// \brief Successors for each basic block in the CFG.
160 BlockEdgeMap Successors; member in class:__anon11084::SampleProfileLoader
458 for (auto *Succ : Successors[BB]) {
552 if (!Successors[B1].empty())
557 Successors[B1].push_back(B2);
/external/v8/src/compiler/
H A Dschedule.h100 typedef Uses Successors; typedef in class:v8::internal::compiler::FINAL
103 Successors successors() { return static_cast<Successors>(uses()); }
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h69 /// Predecessors/Successors - Keep track of the predecessor / successor
72 std::vector<MachineBasicBlock *> Successors; member in class:llvm::MachineBasicBlock
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(); }
295 { return Successors
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp604 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
605 if (Successors) {
606 if (Successors == 1) {
628 for (int i = 0; i != Successors; ++i)
632 Edge += Successors;
726 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
727 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) {
728 for (int i = 0; i != Successors; ++i) {
737 Edge += Successors;

Completed in 95 milliseconds