Home
last modified time | relevance | path

Searched refs:succ_end (Results 1 – 25 of 172) sorted by relevance

1234567

/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DCFG.h137 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/
DCFG.h126 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/
DBranchProbabilityInfo.cpp131 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()
DCFG.cpp46 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/
DExplodedGraph.h218 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/
DDAGDeltaAlgorithm.cpp104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anonaf6b677e0111::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/
DDAGDeltaAlgorithm.cpp104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon634b90e60111::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/llvm/lib/CodeGen/
DMachineBranchProbabilityInfo.cpp54 std::find(Src->succ_begin(), Src->succ_end(), Dst)); in getEdgeProbability()
68 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
DEdgeBundles.cpp48 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction()
85 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
DMachineBasicBlock.cpp202 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in hasEHPadSuccessor()
311 for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI) { in print()
426 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
466 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
574 succ_iterator E = succ_end(); in replaceSuccessor()
668 return std::find(succ_begin(), succ_end(), MBB) != succ_end(); in isSuccessor()
1112 while (SI != succ_end()) { in CorrectExtraCFGEdges()
DUnreachableBlockElim.cpp60 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in eliminateUnreachableBlock()
158 while (BB->succ_begin() != BB->succ_end()) { in runOnMachineFunction()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DEdgeBundles.cpp49 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction()
89 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
DMachineBasicBlock.cpp226 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in hasEHPadSuccessor()
349 for (auto I = succ_begin(), E = succ_end(); I != E; ++I) { in print()
361 for (auto I = succ_begin(), E = succ_end(); I != E; ++I) { in print()
542 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
582 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
666 assert(OldI != succ_end() && "Old is not a successor of this block!"); in splitSuccessor()
667 assert(llvm::find(successors(), New) == succ_end() && in splitSuccessor()
709 succ_iterator E = succ_end(); in replaceSuccessor()
1259 while (SI != succ_end()) { in CorrectExtraCFGEdges()
DUnreachableBlockElim.cpp61 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in eliminateUnreachableBlock()
159 while (BB->succ_begin() != BB->succ_end()) { in runOnMachineFunction()
DMachineBranchProbabilityInfo.cpp67 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DCFG.cpp46 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()
DBranchProbabilityInfo.cpp214 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()
/external/llvm/include/llvm/Analysis/
DInterval.h109 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function
134 return succ_end(N);
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DInterval.h106 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function
128 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
DLoopIterator.h80 {succ_end(Node.second), Node.first}), in child_begin()
88 {succ_end(Node.second), Node.first}), in child_end()
/external/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h255 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/CodeGen/
DMachineBasicBlock.h272 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(); }
/external/llvm/lib/IR/
DBasicBlock.cpp254 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()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/
DBasicBlock.cpp263 succ_const_iterator SI = succ_begin(this), E = succ_end(this); in getSingleSuccessor()
271 succ_const_iterator SI = succ_begin(this), E = succ_end(this); in getUniqueSuccessor()
424 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { in splitBasicBlock()
/external/clang/include/clang/Analysis/
DCFG.h542 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
544 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end() function
612 return filtered_succ_iterator(succ_begin(), succ_end(), this, f); in filtered_succ_start_end()
1011 { return N->succ_end(); }
1025 { return N->succ_end(); }

1234567