| /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/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()
457 return N->succ_end();
483 return N->succ_end();
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBranchProbabilityInfo.cpp | 42 std::find(Src->succ_begin(), Src->succ_end(), Dst)); in getEdgeProbability()
58 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()
|
| D | MachineBasicBlock.cpp | 206 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in getLandingPadSuccessor()
213 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in hasEHPadSuccessor()
321 for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI) { in print()
435 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
471 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
571 succ_iterator E = succ_end(); in replaceSuccessor()
665 return std::find(succ_begin(), succ_end(), MBB) != succ_end(); in isSuccessor()
1098 while (SI != succ_end()) { in CorrectExtraCFGEdges()
|
| D | UnreachableBlockElim.cpp | 81 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in runOnFunction()
144 while (BB->succ_begin() != BB->succ_end()) { in runOnMachineFunction()
|
| D | DeadMachineInstructionElim.cpp | 112 E = MBB.succ_end(); S != E; S++) in runOnMachineFunction()
|
| D | MachineBlockFrequencyInfo.cpp | 68 return N->succ_end(); in child_end()
|
| D | IfConversion.cpp | 442 E = BB->succ_end(); SI != E; ++SI) { in findFalseBlock()
1256 std::find(BBI.BB->succ_begin(), BBI.BB->succ_end(), NewTrueBB); in IfConvertTriangle()
1257 if (NewTrueBBIter != BBI.BB->succ_end()) in IfConvertTriangle()
1631 FromBBI.BB->succ_end()); in CopyAndPredicateBlock()
1672 FromBBI.BB->succ_end()); in MergeBlocks()
1684 std::find(ToBBI.BB->succ_begin(), ToBBI.BB->succ_end(), FromBBI.BB), in MergeBlocks()
1738 std::find(ToBBI.BB->succ_begin(), ToBBI.BB->succ_end(), Succ), in MergeBlocks()
|
| D | TailDuplication.cpp | 217 MBB->succ_end()); in TailDuplicateAndUpdate()
689 TailBB->succ_end()); in duplicateSimpleBB()
860 E = TailBB->succ_end(); I != E; ++I) in TailDuplicate()
984 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anondc8290600111::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/Analysis/ |
| D | BranchProbabilityInfo.cpp | 133 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics()
252 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcColdCallHeuristics()
342 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics()
528 for (succ_const_iterator SI = succ_begin(&BI), SE = succ_end(&BI); SI != SE; in print()
538 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getSumForBlock()
561 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc()
608 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeWeight()
|
| 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()
|
| D | LoopInfo.cpp | 389 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I) { in getUniqueExitBlocks()
407 if (std::distance(succ_begin(current), succ_end(current)) <= 2) { in getUniqueExitBlocks()
590 succ_iterator I = succ_begin(BB), E = succ_end(BB); in getNearestLoop()
|
| D | BlockFrequencyInfo.cpp | 64 return succ_end(N); in child_end()
|
| /external/llvm/include/llvm/Analysis/ |
| D | Interval.h | 107 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function
132 return succ_end(N);
|
| D | RegionIterator.h | 222 while (Itor != succ_end(Node->getEntry())
241 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_end(NodeType* Node) { in succ_end() function
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 312 succ_iterator succ_end() { return Successors.end(); }
313 const_succ_iterator succ_end() const { return Successors.end(); }
334 return make_range(succ_begin(), succ_end());
337 return make_range(succ_begin(), succ_end());
805 return N->succ_end();
818 return N->succ_end();
|
| /external/llvm/lib/IR/ |
| D | BasicBlock.cpp | 239 succ_iterator SI = succ_begin(this), E = succ_end(this); in getSingleSuccessor()
247 succ_iterator SI = succ_begin(this), E = succ_end(this); in getUniqueSuccessor()
384 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { in splitBasicBlock()
|
| /external/llvm/lib/Target/X86/ |
| D | X86VZeroUpper.cpp | 240 SE = MBB.succ_end(); in processBasicBlock()
312 SE = MBB.succ_end(); in runOnMachineFunction()
|
| D | X86PadShortFunction.cpp | 158 I != MBB->succ_end(); ++I) { in findReturns()
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 542 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(); }
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopInstSimplify.cpp | 154 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; in runOnLoop()
|
| /external/clang/lib/Analysis/ |
| D | UninitializedValues.cpp | 230 E = block->succ_end(); I != E; ++I) { in enqueueSuccessors()
619 SE = Pred->succ_end(); in getUninitUse()
644 E = Block->succ_end(); I != E; ++I) { in getUninitUse()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUnroll.cpp | 369 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB); in UnrollLoop()
456 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); in UnrollLoop()
|