/external/swiftshader/third_party/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/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
D | cortex-a57-misched-vfma.ll | 13 ; CHECK: Successors: 22 ; CHECK: Successors: 30 ; CHECK: Successors: 52 ; CHECK: Successors: 61 ; CHECK: Successors: 69 ; CHECK: Successors: 90 ; CHECK: Successors: 99 ; CHECK: Successors: 107 ; CHECK: Successors: 129 ; CHECK: Successors: [all …]
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 72 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/ |
D | MachineBasicBlock.cpp | 346 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/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/ |
D | scheduledag-constreg.mir | 12 # CHECK-NOT: Successors: 15 # CHECK-NOT: Successors: 18 # CHECK-NOT: Successors: 21 # CHECK-NOT: Successors:
|
D | arm64-misched-memdep-bug.ll | 9 ; CHECK: Successors: 13 ; CHECK: Successors:
|
/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 …]
|
/external/llvm/include/llvm/Analysis/ |
D | Interval.h | 61 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()
|
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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
D | IntervalIterator.h | 212 Int->Successors.push_back(NodeHeader); in ProcessNode() 219 Int->Successors.push_back(NodeHeader); in ProcessNode() 231 Int->Successors.erase(std::remove(Int->Successors.begin(), in ProcessNode() 232 Int->Successors.end(), NodeHeader), in ProcessNode() 233 Int->Successors.end()); in ProcessNode()
|
D | Interval.h | 60 std::vector<BasicBlock*> Successors; variable 78 for (BasicBlock *Successor : Successors) in isSuccessor() 104 return I->Successors.begin(); in succ_begin() 107 return I->Successors.end(); in succ_end()
|
/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 | 94 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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 91 std::vector<MachineBasicBlock *> Successors; 270 succ_iterator succ_begin() { return Successors.begin(); } 271 const_succ_iterator succ_begin() const { return Successors.begin(); } 272 succ_iterator succ_end() { return Successors.end(); } 273 const_succ_iterator succ_end() const { return Successors.end(); } 275 { return Successors.rbegin(); } 277 { return Successors.rbegin(); } 279 { return Successors.rend(); } 281 { return Successors.rend(); } 283 return (unsigned)Successors.size(); [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 76 std::map<change_ty, std::vector<change_ty> > Successors; member in __anonb529823c0111::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/Support/ |
D | DAGDeltaAlgorithm.cpp | 76 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon2e55d3e40111::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/ |
D | DAGDeltaAlgorithm.cpp | 77 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon383d6b900111::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/ |
D | dbzchk.ll | 36 ; 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-7.0/llvm/lib/Transforms/Vectorize/ |
D | VPlanVerifier.cpp | 58 const auto &Successors = VPB->getSuccessors(); in verifyBlocksInRegion() local 61 assert(!hasDuplicates(Successors) && in verifyBlocksInRegion() 64 for (const VPBlockBase *Succ : Successors) { in verifyBlocksInRegion()
|
D | VPlan.cpp | 89 if (!Successors.empty() || !Parent) in getEnclosingBlockWithSuccessors() 441 auto &Successors = Block->getSuccessors(); in dumpEdges() local 442 if (Successors.size() == 1) in dumpEdges() 443 drawEdge(Block, Successors.front(), false, ""); in dumpEdges() 444 else if (Successors.size() == 2) { in dumpEdges() 445 drawEdge(Block, Successors.front(), false, "T"); in dumpEdges() 446 drawEdge(Block, Successors.back(), false, "F"); in dumpEdges() 449 for (auto *Successor : Successors) in dumpEdges()
|
D | VPlan.h | 341 SmallVector<VPBlockBase *, 1> Successors; variable 349 Successors.push_back(Successor); in appendSuccessor() 367 auto Pos = std::find(Successors.begin(), Successors.end(), Successor); in removeSuccessor() 369 Successors.erase(Pos); in removeSuccessor() 413 const VPBlocksTy &getSuccessors() const { return Successors; } in getSuccessors() 414 VPBlocksTy &getSuccessors() { return Successors; } in getSuccessors() 422 return (Successors.size() == 1 ? *Successors.begin() : nullptr); in getSingleSuccessor() 431 size_t getNumSuccessors() const { return Successors.size(); } in getNumSuccessors() 488 assert(Successors.empty() && "Setting one successor when others exist."); in setOneSuccessor() 498 assert(Successors.empty() && "Setting two successors when others exist."); in setTwoSuccessors()
|
/external/swiftshader/third_party/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()
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
D | GCOVProfiling.cpp | 457 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/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
D | MachineBlockPlacement.cpp | 414 SmallVector<MachineBasicBlock *, 4> &Successors); 619 SmallVector<MachineBasicBlock *, 4> &Successors) { in collectViableSuccessors() argument 654 Successors.push_back(Succ); in collectViableSuccessors() 679 SmallPtrSetImpl<const MachineBasicBlock *> &Successors) { in hasSameSuccessors() argument 680 if (BB.succ_size() != Successors.size()) in hasSameSuccessors() 683 if (Successors.count(&BB)) in hasSameSuccessors() 686 if (!Successors.count(Succ)) in hasSameSuccessors() 886 SmallPtrSet<const MachineBasicBlock *, 2> Successors(BB->succ_begin(), in isTrellis() local 895 if (Successors.count(SuccPred)) { in isTrellis() 898 if (!Successors.count(CheckSucc)) in isTrellis() [all …]
|