Home
last modified time | relevance | path

Searched refs:Successors (Results 1 – 25 of 48) sorted by relevance

12

/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DInterval.h52 : 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()
DIntervalIterator.h202 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/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DMachineBasicBlock.h72 std::vector<MachineBasicBlock *> Successors;
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.rend(); }
194 { return Successors.rend(); }
196 return (unsigned)Successors.size();
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DMachineBasicBlock.cpp346 Weights.resize(Successors.size()); in addSuccessor()
351 Successors.push_back(succ); in addSuccessor()
357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in removeSuccessor()
358 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
366 Successors.erase(I); in removeSuccessor()
371 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
380 return Successors.erase(I); in removeSuccessor()
386 succ_iterator SI = std::find(Successors.begin(), Successors.end(), Old); in replaceSuccessor()
449 const_succ_iterator I = std::find(Successors.begin(), Successors.end(), MBB); in isSuccessor()
450 return I != Successors.end(); in isSuccessor()
[all …]
/external/llvm/test/CodeGen/X86/
Dswitch-edge-weight.ll37 ; CHECK: Successors according to CFG: BB#4({{[0-9a-fx/= ]+}}72.22%) BB#5({{[0-9a-fx/= ]+}}27.78%)
42 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}76.92%) BB#7({{[0-9a-fx/= ]+}}23.08%)
47 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}40.00%) BB#6({{[0-9a-fx/= ]+}}60.00%)
52 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}66.67%) BB#2({{[0-9a-fx/= ]+}}33.33%)
105 ; CHECK: Successors according to CFG: BB#6({{[0-9a-fx/= ]+}}7.14%) BB#8({{[0-9a-fx/= ]+}}92.86%
114 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}15.38%) BB#6({{[0-9a-fx/= ]+}}7.69%) BB…
166 ; CHECK: Successors according to CFG: BB#6({{[0-9a-fx/= ]+}}16.67%) BB#8({{[0-9a-fx/= ]+}}83.33%)
174 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}20.00%) BB#2({{[0-9a-fx/= ]+}}20.00%) B…
219 ; CHECK: Successors according to CFG: BB#6({{[0-9a-fx/= ]+}}28.57%) BB#7({{[0-9a-fx/= ]+}}71.43%)
224 ; CHECK: Successors according to CFG: BB#2({{[0-9a-fx/= ]+}}60.00%) BB#3({{[0-9a-fx/= ]+}}40.00%)
[all …]
DMachineBranchProb.ll21 ; CHECK: Successors according to CFG: BB#3({{[0-9a-fx/= ]+}}1.53%) BB#4({{[0-9a-fx/= ]+}}98.47%)
23 ; CHECK: Successors according to CFG: BB#3({{[0-9a-fx/= ]+}}1.55%) BB#2({{[0-9a-fx/= ]+}}98.45%)
D2010-05-12-FastAllocKills.ll13 ; Successors according to CFG: BB#5
27 ; Successors according to CFG: BB#5
Dswitch-jump-table.ll58 ; CHECK-JT-PROB: Successors according to CFG: BB#6({{[0-9a-fx/= ]+}}14.29%) BB#8({{[0-9a-fx/= ]+}}8…
59 ; CHECK-JT-PROB: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}16.67%) BB#2({{[0-9a-fx/= ]+}}1…
/external/llvm/include/llvm/Analysis/
DInterval.h61 std::vector<BasicBlock*> Successors; variable
80 for (BasicBlock *Successor : Successors) in isSuccessor()
107 return I->Successors.begin(); in succ_begin()
110 return I->Successors.end(); in succ_end()
DIntervalIterator.h211 Int->Successors.push_back(NodeHeader); in ProcessNode()
218 Int->Successors.push_back(NodeHeader); in ProcessNode()
230 Int->Successors.erase(std::remove(Int->Successors.begin(), in ProcessNode()
231 Int->Successors.end(), NodeHeader), in ProcessNode()
232 Int->Successors.end()); in ProcessNode()
/external/llvm/test/CodeGen/Generic/
DMachineBranchProb.ll19 ; CHECK: Successors according to CFG: BB#2({{[0-9a-fx/= ]+}}75.29%) BB#4({{[0-9a-fx/= ]+}}24.71%)
21 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}47.62%) BB#5({{[0-9a-fx/= ]+}}52.38%)
23 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}36.36%) BB#3({{[0-9a-fx/= ]+}}63.64%)
64 ; CHECK-NOT: Successors
65 ; CHECK: Successors according to CFG: BB#8({{[0-9a-fx/= ]+}}39.71%) BB#9({{[0-9a-fx/= ]+}}60.29%)
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h94 std::vector<MachineBasicBlock *> Successors;
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.rend(); }
266 return (unsigned)Successors.size();
[all …]
/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp76 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon7ef96bbb0111::DAGDeltaAlgorithmImpl
101 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
102 return Successors[Node].begin(); in succ_begin()
105 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
106 return Successors[Node].end(); in succ_end()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
192 Successors[it->first].push_back(it->second); in DAGDeltaAlgorithmImpl()
/external/swiftshader/third_party/LLVM/lib/Support/
DDAGDeltaAlgorithm.cpp77 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon4343b8670111::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/test/CodeGen/ARM/Windows/
Ddbzchk.ll36 ; CHECK-DIV-DAG: Successors according to CFG: BB#5({{.*}}) BB#4
38 ; CHECK-DIV-DAG: Successors according to CFG: BB#3
40 ; CHECK-DIV-DAG: Successors according to CFG: BB#3
43 ; CHECK-DIV-DAG: Successors according to CFG: BB#1({{.*}}) BB#2
73 ; CHECK-MOD-DAG: Successors according to CFG: BB#2({{.*}}) BB#1
75 ; CHECK-MOD-DAG: Successors according to CFG: BB#4({{.*}}) BB#3
78 ; CHECK-MOD-DAG: Successors according to CFG: BB#2
/external/swiftshader/third_party/LLVM/lib/Analysis/
DInterval.cpp55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(), in print()
56 E = Successors.end(); I != E; ++I) in print()
DIntervalPartition.cpp60 for (Interval::succ_iterator I = Int->Successors.begin(), in updatePredecessors()
61 E = Int->Successors.end(); I != E; ++I) in updatePredecessors()
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() local
458 if (Successors) { in emitProfileArcs()
461 if (Successors == 1) { in emitProfileArcs()
483 for (int i = 0; i != Successors; ++i) in emitProfileArcs()
486 Edge += Successors; in emitProfileArcs()
545 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable() local
546 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { in buildEdgeLookupTable()
547 for (int i = 0; i != Successors; ++i) { in buildEdgeLookupTable()
556 Edge += Successors; in buildEdgeLookupTable()
/external/llvm/test/CodeGen/AArch64/
Darm64-misched-memdep-bug.ll9 ; CHECK: Successors:
13 ; CHECK: Successors:
/external/llvm/test/CodeGen/ARM/
D2012-06-12-SchedMemLatency.ll16 ; CHECK: Successors:
26 ; CHECK: Successors:
Dtaildup-branch-weight.ll6 ; CHECK: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}3.12%) BB#2({{[0-9a-fx/= ]+}}96.88%)
33 ; CHECK: Successors according to CFG: BB#2(0x7c000000 / 0x80000000 = 96.88%) BB#1(0x04000000 / 0x80…
Difcvt-iter-indbr.ll33 ; CHECK-PROB: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}50.00%) BB#2({{[0-9a-fx/= ]+}}25.0…
35 ; CHECK-PROB: Successors according to CFG: BB#2({{[0-9a-fx/= ]+}}75.00%) BB#4({{[0-9a-fx/= ]+}}25.0…
/external/llvm/lib/CodeGen/
DMachineBasicBlock.cpp531 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
533 Successors.push_back(Succ); in addSuccessor()
542 Successors.push_back(Succ); in addSuccessorWithoutProb()
548 succ_iterator I = std::find(Successors.begin(), Successors.end(), Succ); in removeSuccessor()
554 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
566 return Successors.erase(I); in removeSuccessor()
1182 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1183 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
1191 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1192 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp622 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() local
623 if (Successors) { in emitProfileArcs()
624 if (Successors == 1) { in emitProfileArcs()
643 for (int i = 0; i != Successors; ++i) in emitProfileArcs()
647 Edge += Successors; in emitProfileArcs()
741 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable() local
742 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { in buildEdgeLookupTable()
743 for (int i = 0; i != Successors; ++i) { in buildEdgeLookupTable()
752 Edge += Successors; in buildEdgeLookupTable()
/external/llvm/lib/Transforms/IPO/
DSampleProfile.cpp170 BlockEdgeMap Successors; member in __anon7eca00fa0111::SampleProfileLoader
396 Successors.clear(); in clearFunctionData()
832 NumTotalEdges = Successors[BB].size(); in propagateThroughEdges()
833 for (auto *Succ : Successors[BB]) { in propagateThroughEdges()
838 SingleEdge = std::make_pair(BB, Successors[BB][0]); in propagateThroughEdges()
936 if (!Successors[B1].empty()) in buildEdges()
941 Successors[B1].push_back(B2); in buildEdges()

12