/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
D | CFG.h | 137 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function 140 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function 144 return succ_begin(BB) == succ_end(BB); in succ_empty() 147 return std::distance(succ_begin(BB), succ_end(BB)); in succ_size() 150 return succ_range(succ_begin(BB), succ_end(BB)); in successors() 153 return succ_const_range(succ_begin(BB), succ_end(BB)); in successors() 174 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); } 184 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
|
/external/llvm/include/llvm/IR/ |
D | CFG.h | 126 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function 129 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function 133 return succ_begin(BB) == succ_end(BB); in succ_empty() 136 return succ_range(succ_begin(BB), succ_end(BB)); in successors() 139 return succ_const_range(succ_begin(BB), succ_end(BB)); in successors() 165 return succ_end(N); 179 return succ_end(N);
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
D | RegionIterator.h | 99 while (succ_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator() 109 BItor(succ_end(node->getEntry())) {} in RNSuccIterator() 135 while (BItor != succ_end(getNode()->getEntry()) 188 while (succ_end(Node->getEntry()) != Itor in RNSuccIterator() 194 Itor(succ_end(node->getEntry())) { in RNSuccIterator() 225 while (Itor != succ_end(Node->getEntry()) 254 inline RNSuccIterator<NodeType> succ_end(NodeType* Node) { in succ_end() function
|
D | Interval.h | 110 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function 135 return succ_end(N);
|
/external/llvm/lib/Analysis/ |
D | BranchProbabilityInfo.cpp | 131 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics() 260 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcColdCallHeuristics() 355 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics() 545 for (succ_const_iterator SI = succ_begin(&BI), SE = succ_end(&BI); SI != SE; in print() 564 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc() 593 static_cast<uint32_t>(std::distance(succ_begin(Src), succ_end(Src)))}; in getEdgeProbability() 609 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeProbability() 617 uint32_t succ_num = std::distance(succ_begin(Src), succ_end(Src)); in getEdgeProbability()
|
D | CFG.cpp | 46 while (I != succ_end(ParentBB)) { in FindFunctionBackedges() 165 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany() 219 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | ExplodedGraph.h | 218 succ_iterator succ_end() { return Succs.end(); } in succ_end() function 223 const_succ_iterator succ_end() const { in succ_end() function 224 return const_cast<ExplodedNode*>(this)->succ_end(); in succ_end() 467 return N->succ_end(); 493 return N->succ_end();
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon0ee530f30111::DAGDeltaAlgorithmImpl 130 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest() 198 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl() 236 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl() 238 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
|
/external/llvm/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon7ef96bbb0111::DAGDeltaAlgorithmImpl 131 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest() 198 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl() 235 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl() 238 ie2 = succ_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
D | DAGDeltaAlgorithm.cpp | 105 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon4343b8670111::DAGDeltaAlgorithmImpl 132 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest() 204 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl() 241 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl() 244 ie2 = succ_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
D | CFG.h | 226 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function 229 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function 251 return succ_end(N); 265 return succ_end(N);
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | BranchProbabilityInfo.cpp | 214 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcUnreachableHeuristics() 360 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcColdCallHeuristics() 542 std::find(succ_begin(BB), succ_end(BB), B) == succ_end(BB)) in computeUnlikelySuccessors() 588 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics() 825 for (succ_const_iterator SI = succ_begin(&BI), SE = succ_end(&BI); SI != SE; in print() 844 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc() 888 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeProbability() 896 uint32_t succ_num = std::distance(succ_begin(Src), succ_end(Src)); in getEdgeProbability()
|
D | CFG.cpp | 46 while (I != succ_end(ParentBB)) { in FindFunctionBackedges() 165 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany() 219 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
/external/llvm/lib/CodeGen/ |
D | MachineBranchProbabilityInfo.cpp | 54 std::find(Src->succ_begin(), Src->succ_end(), Dst)); in getEdgeProbability() 68 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
|
D | EdgeBundles.cpp | 48 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction() 85 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
D | EdgeBundles.cpp | 49 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction() 89 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
D | ProfileInfo.cpp | 98 succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB); in getExecutionCount() 250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); in GetPath() 386 for(succ_const_iterator BBI = succ_begin(FirstBB), BBE = succ_end(FirstBB); in splitEdge() 528 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB); in CalculateMissingEdge() 599 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB); in EstimateMissingEdges() 681 succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); in repair() 751 for (succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); in repair() 803 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); in repair() 818 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); in repair() 859 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB); in repair() [all …]
|
D | ProfileVerifierPass.cpp | 116 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in printDebugInfo() 138 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in printDebugInfo() 262 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock() 341 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
|
/external/llvm/include/llvm/Analysis/ |
D | Interval.h | 109 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function 134 return succ_end(N);
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction() 91 SE = I->succ_end(); SI != SE; ++SI) in WriteGraph()
|
D | MachineBranchProbabilityInfo.cpp | 34 E = MBB->succ_end(); I != E; ++I) { in getSumForBlock() 73 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 255 succ_iterator succ_end() { return Successors.end(); } 256 const_succ_iterator succ_end() const { return Successors.end(); } 277 return make_range(succ_begin(), succ_end()); 280 return make_range(succ_begin(), succ_end()); 750 return N->succ_end(); 763 return N->succ_end();
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
D | Interval.h | 106 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function 128 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 185 succ_iterator succ_end() { return Successors.end(); } 186 const_succ_iterator succ_end() const { return Successors.end(); } 478 return N->succ_end(); 491 return N->succ_end();
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
D | MachineBasicBlock.h | 272 succ_iterator succ_end() { return Successors.end(); } 273 const_succ_iterator succ_end() const { return Successors.end(); } 294 return make_range(succ_begin(), succ_end()); 297 return make_range(succ_begin(), succ_end()); 846 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } 855 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
|