| /external/llvm/lib/MC/MCAnalysis/ |
| D | MCFunction.cpp | 49 Successors.push_back(MCBB); in addSuccessor()
53 return std::find(Successors.begin(), Successors.end(), in isSuccessor()
54 MCBB) != Successors.end(); in isSuccessor()
71 assert(SplitBB->Successors.empty() && in splitBasicBlock()
73 SplitBB->Successors = Successors; in splitBasicBlock()
74 Successors.clear(); in splitBasicBlock()
|
| /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 | 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/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 72 std::vector<MachineBasicBlock *> Successors;
286 succ_iterator succ_begin() { return Successors.begin(); }
287 const_succ_iterator succ_begin() const { return Successors.begin(); }
288 succ_iterator succ_end() { return Successors.end(); }
289 const_succ_iterator succ_end() const { return Successors.end(); }
291 { return Successors.rbegin(); }
293 { return Successors.rbegin(); }
295 { return Successors.rend(); }
297 { return Successors.rend(); }
299 return (unsigned)Successors.size();
[all …]
|
| /external/llvm/test/CodeGen/Generic/ |
| D | MachineBranchProb.ll | 18 ; CHECK: Successors according to CFG: BB#2(64) BB#4(14)
20 ; CHECK: Successors according to CFG: BB#1(10) BB#5(4)
22 ; CHECK: Successors according to CFG: BB#1(4) BB#3(7)
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 79 std::map<change_ty, std::vector<change_ty> > Successors; member in __anon86cd86b20111::DAGDeltaAlgorithmImpl
104 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
105 return Successors[Node].begin(); in succ_begin()
108 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
109 return Successors[Node].end(); in succ_end()
195 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
200 Successors[it->first].push_back(it->second); in DAGDeltaAlgorithmImpl()
|
| /external/llvm/include/llvm/MC/MCAnalysis/ |
| D | MCFunction.h | 45 BasicBlockListTy Successors; variable
62 succ_const_iterator succ_begin() const { return Successors.begin(); } in succ_begin()
63 succ_const_iterator succ_end() const { return Successors.end(); } in succ_end()
|
| /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/CodeGen/ |
| D | MachineBasicBlock.cpp | 493 Weights.resize(Successors.size()); in addSuccessor()
498 Successors.push_back(succ); in addSuccessor()
504 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in removeSuccessor()
505 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
513 Successors.erase(I); in removeSuccessor()
518 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
527 return Successors.erase(I); in removeSuccessor()
567 Successors.erase(OldI); in replaceSuccessor()
1139 assert(Weights.size() == Successors.size() && "Async weight list!"); in getWeightIterator()
1140 size_t index = std::distance(Successors.begin(), I); in getWeightIterator()
[all …]
|
| D | CodeGenPrepare.cpp | 220 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); in runOnFunction() local
225 II = Successors.begin(), IE = Successors.end(); II != IE; ++II) in runOnFunction()
235 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); in runOnFunction() local
240 II = Successors.begin(), IE = Successors.end(); II != IE; ++II) in runOnFunction()
|
| /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(4) BB#2(124)
33 ; CHECK: Successors according to CFG: BB#1(8) BB#2(248)
|
| D | ifcvt-branch-weight.ll | 22 ; CHECK: Successors according to CFG: BB#3(192) BB#4(192)
|
| D | ifcvt-branch-weight-bug.ll | 25 ; CHECK: Successors according to CFG: BB#2(130023362) BB#4(62)
|
| /external/chromium_org/v8/src/compiler/ |
| D | schedule.cc | 73 BasicBlock::Successors successors = block->successors(); in operator <<()
75 for (BasicBlock::Successors::iterator j = successors.begin(); in operator <<()
|
| D | schedule.h | 100 typedef Uses Successors; typedef
103 Successors successors() { return static_cast<Successors>(uses()); } in successors()
|
| D | instruction.cc | 472 BasicBlock::Successors successors = block->successors(); in operator <<()
473 for (BasicBlock::Successors::iterator iter = successors.begin(); in operator <<()
|
| D | register-allocator.cc | 533 BasicBlock::Successors successors = block->successors(); in ComputeLiveOut()
534 for (BasicBlock::Successors::iterator i = successors.begin(); in ComputeLiveOut()
775 BasicBlock::Successors successors = block->successors(); in MeetRegisterConstraintsForLastInstructionInBlock()
776 for (BasicBlock::Successors::iterator succ = successors.begin(); in MeetRegisterConstraintsForLastInstructionInBlock()
793 BasicBlock::Successors successors = block->successors(); in MeetRegisterConstraintsForLastInstructionInBlock()
794 for (BasicBlock::Successors::iterator succ = successors.begin(); in MeetRegisterConstraintsForLastInstructionInBlock()
|
| /external/llvm/test/CodeGen/X86/ |
| D | MachineBranchProb.ll | 21 ; CHECK: Successors according to CFG: BB#3(56008718) BB#4(2203492365)
23 ; CHECK: Successors according to CFG: BB#3(112017436) BB#2(4294967294)
|
| D | 2010-05-12-FastAllocKills.ll | 13 ; Successors according to CFG: BB#5
27 ; Successors according to CFG: BB#5
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 606 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() local
607 if (Successors) { in emitProfileArcs()
608 if (Successors == 1) { in emitProfileArcs()
629 for (int i = 0; i != Successors; ++i) in emitProfileArcs()
633 Edge += Successors; in emitProfileArcs()
727 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable() local
728 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { in buildEdgeLookupTable()
729 for (int i = 0; i != Successors; ++i) { in buildEdgeLookupTable()
738 Edge += Successors; in buildEdgeLookupTable()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SampleProfile.cpp | 211 BlockEdgeMap Successors; member in __anonb789d65f0211::SampleFunctionProfile
782 for (size_t I = 0; I < Successors[BB].size(); I++) { in propagateThroughEdges()
783 Edge E = std::make_pair(BB, Successors[BB][I]); in propagateThroughEdges()
876 if (!Successors[B1].empty()) in buildEdges()
881 Successors[B1].push_back(B2); in buildEdges()
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | arm64-misched-forwarding-A53.ll | 10 ; CHECK: Successors:
|
| /external/llvm/lib/Target/X86/ |
| D | README-X86-64.txt | 108 Successors according to CFG: 0x203afb0 (#3)
113 Successors according to CFG: 0x203afb0 (#3)
|