| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | CFG.h | 249 inline succ_iterator succ_end(Instruction *I) { return succ_iterator(I, true); } in succ_end() function
250 inline succ_const_iterator succ_end(const Instruction *I) { in succ_end() function
254 return succ_begin(I) == succ_end(I); in succ_empty()
257 return std::distance(succ_begin(I), succ_end(I)); in succ_size()
260 return succ_range(succ_begin(I), succ_end(I)); in successors()
263 return succ_const_range(succ_begin(I), succ_end(I)); in successors()
272 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function
275 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function
279 return succ_begin(BB) == succ_end(BB); in succ_empty()
282 return std::distance(succ_begin(BB), succ_end(BB)); in succ_size()
[all …]
|
| D | CFGDiff.h | 186 {succ_end(N.second), N.first}), in child_begin()
200 make_range<ExistingChildIterator>({succ_end(N.second), N.first}, in child_end()
201 {succ_end(N.second), N.first}), in child_end()
|
| /external/llvm-project/llvm/include/llvm/IR/ |
| D | CFG.h | 250 inline succ_iterator succ_end(Instruction *I) { return succ_iterator(I, true); } in succ_end() function
251 inline const_succ_iterator succ_end(const Instruction *I) { in succ_end() function
255 return succ_begin(I) == succ_end(I); in succ_empty()
258 return std::distance(succ_begin(I), succ_end(I)); in succ_size()
261 return succ_range(succ_begin(I), succ_end(I)); in successors()
264 return const_succ_range(succ_begin(I), succ_end(I)); in successors()
273 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function
276 inline const_succ_iterator succ_end(const BasicBlock *BB) { in succ_end() function
280 return succ_begin(BB) == succ_end(BB); in succ_empty()
283 return std::distance(succ_begin(BB), succ_end(BB)); in succ_size()
[all …]
|
| /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/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/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon2272a9c20111::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-10.0/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 103 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon759566e40111::DAGDeltaAlgorithmImpl
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
197 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl()
235 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
|
| /external/llvm-project/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 103 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon3106a8f00111::DAGDeltaAlgorithmImpl
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
197 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl()
235 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
|
| /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-10.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/llvm-project/llvm/lib/CodeGen/ |
| D | EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction()
90 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
|
| /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/llvm-project/llvm/include/llvm/Analysis/ |
| D | Interval.h | 105 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function
127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | Interval.h | 105 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function
127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CFG.cpp | 46 while (I != succ_end(ParentBB)) { in FindFunctionBackedges()
197 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
253 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
| D | BranchProbabilityInfo.cpp | 243 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcUnreachableHeuristics()
389 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcColdCallHeuristics()
571 std::find(succ_begin(BB), succ_end(BB), B) == succ_end(BB)) in computeUnlikelySuccessors()
617 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics()
865 for (succ_const_iterator SI = succ_begin(&BI), SE = succ_end(&BI); SI != SE; in print()
884 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc()
928 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeProbability()
936 uint32_t succ_num = std::distance(succ_begin(Src), succ_end(Src)); in getEdgeProbability()
|
| /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/llvm-project/llvm/lib/Analysis/ |
| D | CFG.cpp | 53 while (I != succ_end(ParentBB)) { in FindFunctionBackedges()
202 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany()
258 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 282 succ_iterator succ_end() { return Successors.end(); }
283 const_succ_iterator succ_end() const { return Successors.end(); }
304 return make_range(succ_begin(), succ_end());
307 return make_range(succ_begin(), succ_end());
876 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
885 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); }
|
| /external/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 252 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
258 const_succ_iterator succ_end() const { in succ_end() function
259 return const_cast<ExplodedNode*>(this)->succ_end(); in succ_end()
533 return N->succ_end();
|
| /external/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyLateEHPrepare.cpp | 102 MBB->succ_end()); in eraseDeadBBsAndChildren()
103 WL.append(MBB->succ_begin(), MBB->succ_end()); in eraseDeadBBsAndChildren()
224 MBB.succ_end()); in removeUnnecessaryUnreachables()
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 254 succ_iterator SI = succ_begin(this), E = succ_end(this); in getSingleSuccessor()
262 succ_iterator SI = succ_begin(this), E = succ_end(this); in getUniqueSuccessor()
397 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { in splitBasicBlock()
|