| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {} in Interval()
64 std::vector<BasicBlock*> Successors; variable
82 for (unsigned i = 0; i < Successors.size(); ++i) in isSuccessor()
83 if (Successors[i] == BB) return true; in isSuccessor()
108 return I->Successors.begin(); in succ_begin()
111 return I->Successors.end(); in succ_end()
|
| D | IntervalIterator.h | 202 Int->Successors.push_back(NodeHeader); in ProcessNode()
209 Int->Successors.push_back(NodeHeader); in ProcessNode()
221 Int->Successors.erase(std::remove(Int->Successors.begin(), in ProcessNode()
222 Int->Successors.end(), NodeHeader), in ProcessNode()
223 Int->Successors.end()); in ProcessNode()
|
| /external/llvm/unittests/Support/ |
| D | IntegersSubsetTest.cpp | 120 unsigned Successors[3] = {0, 1, 2}; in TEST() local
126 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i); in TEST()
127 TheMapping.add(Int(111), Int(222), Successors); in TEST()
137 EXPECT_EQ(CaseIt->first, Successors + i); in TEST()
145 ImproperMapping.add(Int(10), Int(11), Successors + 0); in TEST()
146 ImproperMapping.add(Int(11), Int(12), Successors + 1); in TEST()
153 ProperMapping.add(Int(10), Int(11), Successors + 0); in TEST()
154 ProperMapping.add(Int(12), Int(13), Successors + 1); in TEST()
163 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i); in TEST()
164 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors + i); in TEST()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 72 std::vector<MachineBasicBlock *> Successors;
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.rend(); }
284 { return Successors.rend(); }
286 return (unsigned)Successors.size();
[all …]
|
| /external/llvm/test/CodeGen/Generic/ |
| D | MachineBranchProb.ll | 15 ; CHECK: Successors according to CFG: BB#2(64) BB#4(14)
17 ; CHECK: Successors according to CFG: BB#1(10) BB#5(4)
19 ; CHECK: Successors according to CFG: BB#1(4) BB#3(7)
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 77 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon528261c10111::DAGDeltaAlgorithmImpl
102 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
103 return Successors[Node].begin(); in succ_begin()
106 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
107 return Successors[Node].end(); in succ_end()
193 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
198 Successors[it->first].push_back(it->second); in DAGDeltaAlgorithmImpl()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBasicBlock.cpp | 447 Weights.resize(Successors.size()); in addSuccessor()
452 Successors.push_back(succ); in addSuccessor()
458 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in removeSuccessor()
459 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
467 Successors.erase(I); in removeSuccessor()
472 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
481 return Successors.erase(I); in removeSuccessor()
521 Successors.erase(OldI); in replaceSuccessor()
958 assert(Weights.size() == Successors.size() && "Async weight list!"); in getWeightIterator()
959 size_t index = std::distance(Successors.begin(), I); in getWeightIterator()
[all …]
|
| D | README.txt | 37 Successors according to CFG: 0x8b03bf0 (#5)
|
| /external/llvm/lib/Analysis/ |
| D | Interval.cpp | 55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(), in print()
56 E = Successors.end(); I != E; ++I) in print()
|
| D | IntervalPartition.cpp | 60 for (Interval::succ_iterator I = Int->Successors.begin(), in updatePredecessors()
61 E = Int->Successors.end(); I != E; ++I) in updatePredecessors()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 459 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() local
460 if (Successors) { in emitProfileArcs()
463 if (Successors == 1) { in emitProfileArcs()
485 for (int i = 0; i != Successors; ++i) in emitProfileArcs()
488 Edge += Successors; in emitProfileArcs()
553 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable() local
554 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { in buildEdgeLookupTable()
555 for (int i = 0; i != Successors; ++i) { in buildEdgeLookupTable()
564 Edge += Successors; in buildEdgeLookupTable()
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2010-05-12-FastAllocKills.ll | 13 ; Successors according to CFG: BB#5
27 ; Successors according to CFG: BB#5
|
| /external/llvm/lib/Target/X86/ |
| D | README-X86-64.txt | 108 Successors according to CFG: 0x203afb0 (#3)
113 Successors according to CFG: 0x203afb0 (#3)
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | CodeGenPrepare.cpp | 189 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); in runOnFunction() local
194 II = Successors.begin(), IE = Successors.end(); II != IE; ++II) in runOnFunction()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMISelLowering.cpp | 6224 SmallVector<MachineBasicBlock*, 4> Successors(BB->succ_begin(), in EmitSjLjDispatchBlock() local
6226 while (!Successors.empty()) { in EmitSjLjDispatchBlock()
6227 MachineBasicBlock *SMBB = Successors.pop_back_val(); in EmitSjLjDispatchBlock()
|