| /external/llvm/lib/CodeGen/ |
| D | MachineBranchProbabilityInfo.cpp | 40 E = MBB->succ_end(); I != E; ++I) { in getSumForBlock()
55 E = MBB->succ_end(); I != E; ++I) { in getSumForBlock()
77 return getEdgeWeight(Src, std::find(Src->succ_begin(), Src->succ_end(), Dst)); in getEdgeWeight()
92 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
|
| D | EdgeBundles.cpp | 50 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction()
91 SE = I->succ_end(); SI != SE; ++SI) in WriteGraph()
|
| D | MachineBasicBlock.cpp | 228 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in getLandingPadSuccessor()
319 for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI) { in print()
370 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
406 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator()
492 succ_iterator E = succ_end(); in replaceSuccessor()
583 return std::find(succ_begin(), succ_end(), MBB) != succ_end(); in isSuccessor()
1039 while (SI != succ_end()) { in CorrectExtraCFGEdges()
|
| D | UnreachableBlockElim.cpp | 84 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) in runOnFunction()
151 while (BB->succ_begin() != BB->succ_end()) { in runOnMachineFunction()
|
| D | TailDuplication.cpp | 202 MBB->succ_end()); in TailDuplicateAndUpdate()
632 SE = A.succ_end(); SI != SE; ++SI) { in bothUsedInPHI()
643 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end()); in canCompletelyDuplicateBB()
669 TailBB->succ_end()); in duplicateSimpleBB()
842 E = TailBB->succ_end(); I != E; ++I) in TailDuplicate()
966 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
|
| D | ShrinkWrapping.cpp | 206 SE = MBB->succ_end(); SI != SE; ++SI) { in calcAnticInOut()
474 SE = EntryBlock->succ_end(); SI != SE; ++SI) { in calculateSets()
561 SE = MBB->succ_end(); SI != SE; ++SI) { in addUsesForMEMERegion()
595 SE = MBB->succ_end(); SI != SE; ++SI) { in addUsesForMEMERegion()
746 SE = MBB->succ_end(); SI != SE; ++SI) { in calcRestorePlacements()
893 SE = EntryBlock->succ_end(); SI != SE; ++SI) { in findFastExitPath()
|
| D | MachineBlockPlacement.cpp | 293 SE = (*CBI)->succ_end(); in markChainSuccessors()
336 SE = BB->succ_end(); in selectBestSuccessor()
654 SE = (*I)->succ_end(); in findBestLoopExit()
754 SE = Bottom->succ_end(); in rotateLoop()
1151 SE = I->succ_end(); in INITIALIZE_PASS_DEPENDENCY()
|
| /external/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/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 216 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
221 const_succ_iterator succ_end() const { in succ_end() function
222 return const_cast<ExplodedNode*>(this)->succ_end(); in succ_end()
454 return N->succ_end();
480 return N->succ_end();
|
| /external/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 105 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anonc4a346e10111::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/llvm/lib/Analysis/ |
| D | BranchProbabilityInfo.cpp | 121 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics()
240 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics()
433 for (succ_const_iterator SI = succ_begin(BI), SE = succ_end(BI); in print()
443 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getSumForBlock()
466 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc()
507 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeWeight()
|
| 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 | 117 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in printDebugInfo()
139 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in printDebugInfo()
263 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
342 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
|
| D | ProfileEstimatorPass.cpp | 263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
312 for (succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); in recurseBasicBlock()
413 succ_const_iterator succi = succ_begin(BB), succe = succ_end(BB); in runOnFunction()
|
| D | LoopInfo.cpp | 326 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I) { in getUniqueExitBlocks()
344 if (std::distance(succ_begin(current), succ_end(current)) <= 2) { in getUniqueExitBlocks()
527 succ_iterator I = succ_begin(BB), E = succ_end(BB); in getNearestLoop()
|
| D | RegionInfo.cpp | 210 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in verifyBBInRegion()
227 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in verifyWalk()
531 unsigned num_successors = succ_end(entry) - succ_begin(entry); in isTrivialRegion()
740 else if (++succ_begin(BB) == succ_end(BB)) in getMaxRegionExit()
|
| D | DominanceFrontier.cpp | 67 for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB); in calculate()
|
| /external/llvm/include/llvm/Support/ |
| D | CFG.h | 232 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function
235 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function
257 return succ_end(N);
271 return succ_end(N);
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SimplifyCFGPass.cpp | 76 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in changeToUnreachable()
183 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in markAliveBlocks()
210 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) in removeUnreachableBlocksFromFn()
|
| D | BasicBlockPlacement.cpp | 127 succ_iterator SI = succ_begin(BB), E = succ_end(BB); in PlaceBlocks()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 275 succ_iterator succ_end() { return Successors.end(); }
276 const_succ_iterator succ_end() const { return Successors.end(); }
677 return N->succ_end();
690 return N->succ_end();
|
| /external/llvm/tools/llvm-objdump/ |
| D | MCFunction.h | 57 succ_iterator succ_end() const { return Succs.end(); } in succ_end() function
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 436 succ_iterator succ_end() { return Succs.end(); } in succ_end() function
438 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end() function
501 return filtered_succ_iterator(succ_begin(), succ_end(), this, f); in filtered_succ_start_end()
871 { return N->succ_end(); }
885 { return N->succ_end(); }
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| D | DataflowSolver.h | 76 static NextBItr NextEnd(const CFGBlock *B) { return B->succ_end(); }
96 static PrevBItr PrevEnd(const CFGBlock *B) { return B->succ_end(); }
|