Searched defs:Successors (Results 1 - 5 of 5) sorted by relevance
/external/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 52 : 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/unittests/Support/ |
H A D | IntegersSubsetTest.cpp | 118 unsigned Successors[3] = {0, 1, 2}; local 124 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i); 125 TheMapping.add(Int(111), Int(222), Successors); 135 EXPECT_EQ(CaseIt->first, Successors + i); 143 ImproperMapping.add(Int(10), Int(11), Successors + 0); 144 ImproperMapping.add(Int(11), Int(12), Successors + 1); 151 ProperMapping.add(Int(10), Int(11), Successors + 0); 152 ProperMapping.add(Int(12), Int(13), Successors + 1); 161 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i); 162 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors [all...] |
/external/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 77 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon9619::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/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 69 /// 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 273 succ_iterator succ_begin() { return Successors.begin(); } 274 const_succ_iterator succ_begin() const { return Successors.begin(); } 275 succ_iterator succ_end() { return Successors.end(); } 276 const_succ_iterator succ_end() const { return Successors.end(); } 278 { return Successors.rbegin(); } 280 { return Successors.rbegin(); } 282 { return Successors [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 486 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 487 if (Successors) { 490 if (Successors == 1) { 509 for (int i = 0; i != Successors; ++i) 512 Edge += Successors; 611 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 612 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { 613 for (int i = 0; i != Successors; ++i) { 622 Edge += Successors;
|
Completed in 115 milliseconds