Searched defs:Successors (Results 1 - 11 of 11) 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
80 for (BasicBlock *Successor : Successors)
85 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
107 return I->Successors.begin();
110 return I->Successors.end();
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DInterval.h52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {}
60 /// Successors - List of BasicBlocks that are reachable directly from nodes in
64 std::vector<BasicBlock*> Successors; member in class:llvm::Interval
82 for (unsigned i = 0; i < Successors.size(); ++i)
83 if (Successors[i] == BB) return true;
86 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
108 return I->Successors
[all...]
/external/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp76 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon12892::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/swiftshader/third_party/LLVM/lib/Support/
H A DDAGDeltaAlgorithm.cpp77 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon19967::DAGDeltaAlgorithmImpl
102 assert(Successors.count(Node) && "Invalid node!");
103 return Successors[Node].begin();
106 assert(Successors.count(Node) && "Invalid node!");
107 return Successors[Node].end();
193 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
198 Successors[it->first].push_back(it->second);
/external/swiftshader/third_party/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
76 /// has the same order as Successors, or it is empty if we don't use it
183 succ_iterator succ_begin() { return Successors.begin(); }
184 const_succ_iterator succ_begin() const { return Successors.begin(); }
185 succ_iterator succ_end() { return Successors.end(); }
186 const_succ_iterator succ_end() const { return Successors.end(); }
188 { return Successors.rbegin(); }
190 { return Successors.rbegin(); }
192 { return Successors
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h94 std::vector<MachineBasicBlock *> Successors; member in class:llvm::MachineBasicBlock
97 /// same order as Successors, or it is empty if we don't use it (disable
253 succ_iterator succ_begin() { return Successors.begin(); }
254 const_succ_iterator succ_begin() const { return Successors.begin(); }
255 succ_iterator succ_end() { return Successors.end(); }
256 const_succ_iterator succ_end() const { return Successors.end(); }
258 { return Successors.rbegin(); }
260 { return Successors.rbegin(); }
262 { return Successors.rend(); }
264 { return Successors
[all...]
/external/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp291 SmallVector<MachineBasicBlock *, 4> &Successors);
427 SmallVector<MachineBasicBlock *, 4> &Successors) {
461 Successors.push_back(Succ);
677 SmallVector<MachineBasicBlock *, 4> Successors; local
679 collectViableSuccessors(BB, Chain, BlockFilter, Successors);
682 for (MachineBasicBlock *Succ : Successors) {
425 collectViableSuccessors( MachineBasicBlock *BB, BlockChain &Chain, const BlockFilterSet *BlockFilter, SmallVector<MachineBasicBlock *, 4> &Successors) argument
/external/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp169 /// \brief Successors for each basic block in the CFG.
170 BlockEdgeMap Successors; member in class:__anon13419::SampleProfileLoader
396 Successors.clear();
832 NumTotalEdges = Successors[BB].size();
833 for (auto *Succ : Successors[BB]) {
838 SingleEdge = std::make_pair(BB, Successors[BB][0]);
936 if (!Successors[B1].empty())
941 Successors[B1].push_back(B2);
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp622 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
623 if (Successors) {
624 if (Successors == 1) {
643 for (int i = 0; i != Successors; ++i)
647 Edge += Successors;
741 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
742 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) {
743 for (int i = 0; i != Successors; ++i) {
752 Edge += Successors;
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
458 if (Successors) {
461 if (Successors == 1) {
483 for (int i = 0; i != Successors; ++i)
486 Edge += Successors;
545 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
546 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) {
547 for (int i = 0; i != Successors; ++i) {
556 Edge += Successors;
/external/v8/src/compiler/
H A Dinstruction.h1388 typedef ZoneVector<RpoNumber> Successors; typedef in class:v8::internal::compiler::final
1389 Successors& successors() { return successors_; }
1390 const Successors& successors() const { return successors_; }
1410 Successors successors_;

Completed in 1463 milliseconds