| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 61 std::vector<BasicBlock*> Successors; variable
79 for (unsigned i = 0; i < Successors.size(); ++i) in isSuccessor()
80 if (Successors[i] == BB) return true; in isSuccessor()
105 return I->Successors.begin(); in succ_begin()
108 return I->Successors.end(); in succ_end()
|
| D | IntervalIterator.h | 211 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/X86/ |
| D | switch-edge-weight.ll | 37 ; 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 …]
|
| D | MachineBranchProb.ll | 21 ; 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%)
|
| D | stack-protector-weight.ll | 5 ; SELDAG: Successors according to CFG: BB#[[SUCCESS:[0-9]+]]({{[0-9a-fx/= ]+}}100.00%) BB#[[FAILURE…
11 ; IR: Successors according to CFG: BB#[[SUCCESS:[0-9]+]]({{[0-9a-fx/= ]+}}100.00%) BB#[[FAILURE:[0-…
|
| D | 2010-05-12-FastAllocKills.ll | 13 ; Successors according to CFG: BB#5
27 ; Successors according to CFG: BB#5
|
| D | switch-jump-table.ll | 58 ; 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/test/CodeGen/Generic/ |
| D | MachineBranchProb.ll | 19 ; 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/ |
| D | MachineBasicBlock.h | 92 std::vector<MachineBasicBlock *> Successors;
310 succ_iterator succ_begin() { return Successors.begin(); }
311 const_succ_iterator succ_begin() const { return Successors.begin(); }
312 succ_iterator succ_end() { return Successors.end(); }
313 const_succ_iterator succ_end() const { return Successors.end(); }
315 { return Successors.rbegin(); }
317 { return Successors.rbegin(); }
319 { return Successors.rend(); }
321 { return Successors.rend(); }
323 return (unsigned)Successors.size();
[all …]
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 76 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/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/test/CodeGen/ARM/ |
| D | 2012-06-12-SchedMemLatency.ll | 16 ; CHECK: Successors:
26 ; CHECK: Successors:
|
| D | taildup-branch-weight.ll | 6 ; 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…
|
| D | ifcvt-iter-indbr.ll | 33 ; 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…
|
| D | ifcvt-branch-weight.ll | 22 ; CHECK: Successors according to CFG: BB#3({{[0-9a-fx/= ]+}}50.00%) BB#4({{[0-9a-fx/= ]+}}50.00%)
|
| D | tail-merge-branch-weight.ll | 12 ; CHECK: Successors according to CFG: BB#{{[0-9]+}}({{[0-9a-fx/= ]+}}20.00%) BB#{{[0-9]+}}({{[0-9a-…
|
| D | ifcvt-branch-weight-bug.ll | 25 ; CHECK: Successors according to CFG: BB#2(0x7ffffc00 / 0x80000000 = 100.00%) BB#4(0x00000400 / 0x8…
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBasicBlock.cpp | 528 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
530 Successors.push_back(Succ); in addSuccessor()
539 Successors.push_back(Succ); in addSuccessorWithoutProb()
545 succ_iterator I = std::find(Successors.begin(), Successors.end(), Succ); in removeSuccessor()
551 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
563 return Successors.erase(I); in removeSuccessor()
1168 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1169 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
1177 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1178 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 610 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() local
611 if (Successors) { in emitProfileArcs()
612 if (Successors == 1) { in emitProfileArcs()
634 for (int i = 0; i != Successors; ++i) in emitProfileArcs()
638 Edge += Successors; in emitProfileArcs()
732 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable() local
733 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { in buildEdgeLookupTable()
734 for (int i = 0; i != Successors; ++i) { in buildEdgeLookupTable()
743 Edge += Successors; in buildEdgeLookupTable()
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | arm64-misched-forwarding-A53.ll | 10 ; CHECK: Successors:
|
| D | tailcall_misched_graph.ll | 39 ; CHECK: Successors:
|
| /external/llvm/lib/Transforms/IPO/ |
| D | SampleProfile.cpp | 188 BlockEdgeMap Successors; member in __anon7eca00fa0111::SampleProfileLoader
389 Successors.clear(); in clearFunctionData()
875 for (auto *Succ : Successors[BB]) { in propagateThroughEdges()
969 if (!Successors[B1].empty()) in buildEdges()
974 Successors[B1].push_back(B2); in buildEdges()
|
| /external/llvm/test/CodeGen/Hexagon/ |
| D | ifcvt-edge-weight.ll | 5 ; CHECK: Successors according to CFG: BB#2({{[0-9a-fx/= ]+}}10.00%) BB#1({{[0-9a-fx/= ]+}}90.00%)
|
| /external/llvm/lib/Target/X86/ |
| D | README-X86-64.txt | 108 Successors according to CFG: 0x203afb0 (#3)
113 Successors according to CFG: 0x203afb0 (#3)
|