| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | 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() 93 E = MBB->succ_end(); I != E; ++I) { in getHotSucc()
|
| HD | EdgeBundles.cpp | 48 SE = MBB.succ_end(); SI != SE; ++SI) in runOnMachineFunction() 85 SE = MBB.succ_end(); SI != SE; ++SI) in WriteGraph()
|
| HD | MachineBasicBlock.cpp | 210 for (const_succ_iterator I = succ_begin(), E = succ_end(); I != E; ++I) in getLandingPadSuccessor() 315 for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI) { in print() 402 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator() 438 for (succ_iterator SI = succ_begin(), SE = succ_end(); SI != SE; ++SI) { in updateTerminator() 524 succ_iterator E = succ_end(); in replaceSuccessor() 615 return std::find(succ_begin(), succ_end(), MBB) != succ_end(); in isSuccessor() 1054 while (SI != succ_end()) { in CorrectExtraCFGEdges()
|
| HD | 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()
|
| HD | TailDuplication.cpp | 217 MBB->succ_end()); in TailDuplicateAndUpdate() 640 SE = A.succ_end(); SI != SE; ++SI) { in bothUsedInPHI() 675 TailBB->succ_end()); in duplicateSimpleBB() 847 E = TailBB->succ_end(); I != E; ++I) in TailDuplicate() 971 MBB->removeSuccessor(MBB->succ_end()-1); in RemoveDeadBlock()
|
| HD | DeadMachineInstructionElim.cpp | 115 E = MBB->succ_end(); S != E; S++) in runOnMachineFunction()
|
| HD | MachineBlockFrequencyInfo.cpp | 68 return N->succ_end(); in child_end()
|
| HD | MachineVerifier.cpp | 451 SuE = MBB->succ_end(); SuI != SuE; ++SuI) in markReachable() 482 MInfo.Succs.insert(MBB.succ_begin(), MBB.succ_end()); in visitMachineFunctionBefore() 524 E = MBB->succ_end(); I != E; ++I) { in visitMachineBasicBlockBefore() 1202 SuE = MBB.succ_end(); SuI != SuE; ++SuI) { in calcRegsPassed() 1216 SuE = MBB->succ_end(); SuI != SuE; ++SuI) { in calcRegsPassed() 1799 E = MBB->succ_end(); I != E; ++I) { in verifyStackFrame()
|
| /NextBSD/contrib/llvm/include/llvm/IR/ |
| HD | CFG.h | 262 inline succ_iterator succ_end(BasicBlock *BB) { in succ_end() function 265 inline succ_const_iterator succ_end(const BasicBlock *BB) { in succ_end() function 269 return succ_begin(BB) == succ_end(BB); in succ_empty() 272 return succ_range(succ_begin(BB), succ_end(BB)); in successors() 275 return succ_const_range(succ_begin(BB), succ_end(BB)); in successors() 301 return succ_end(N); 315 return succ_end(N);
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| HD | 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();
|
| /NextBSD/contrib/llvm/lib/Support/ |
| HD | DAGDeltaAlgorithm.cpp | 104 succ_iterator_ty succ_end(change_ty Node) { in succ_end() function in __anon1abbc3c80111::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()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | BranchProbabilityInfo.cpp | 133 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcUnreachableHeuristics() 242 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) in calcColdCallHeuristics() 331 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in calcLoopBranchHeuristics() 557 for (succ_const_iterator SI = succ_begin(BI), SE = succ_end(BI); in print() 567 for (succ_const_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getSumForBlock() 590 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) { in getHotSucc() 637 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I) in getEdgeWeight()
|
| HD | CFG.cpp | 46 while (I != succ_end(ParentBB)) { in FindFunctionBackedges() 164 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachableFromMany() 217 Worklist.append(succ_begin(BB), succ_end(BB)); in isPotentiallyReachable()
|
| HD | LoopInfo.cpp | 358 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I) { in getUniqueExitBlocks() 376 if (std::distance(succ_begin(current), succ_end(current)) <= 2) { in getUniqueExitBlocks() 559 succ_iterator I = succ_begin(BB), E = succ_end(BB); in getNearestLoop()
|
| HD | BlockFrequencyInfo.cpp | 64 return succ_end(N); in child_end()
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | MachineBasicBlock.h | 288 succ_iterator succ_end() { return Successors.end(); } 289 const_succ_iterator succ_end() const { return Successors.end(); } 310 return iterator_range<succ_iterator>(succ_begin(), succ_end()); 313 return iterator_range<const_succ_iterator>(succ_begin(), succ_end()); 741 return N->succ_end(); 754 return N->succ_end();
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | Interval.h | 107 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end() function 132 return succ_end(N);
|
| HD | RegionIterator.h | 222 while (Itor != succ_end(Node->getEntry()) 241 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_end(NodeType* Node) { in succ_end() function
|
| /NextBSD/contrib/llvm/lib/IR/ |
| HD | 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() 373 for (succ_iterator I = succ_begin(New), E = succ_end(New); I != E; ++I) { in splitBasicBlock()
|
| /NextBSD/contrib/llvm/lib/Target/X86/ |
| HD | X86VZeroUpper.cpp | 240 SE = MBB.succ_end(); in processBasicBlock() 312 SE = MBB.succ_end(); in runOnMachineFunction()
|
| HD | X86PadShortFunction.cpp | 159 I != MBB->succ_end(); ++I) { in findReturns()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Analysis/ |
| HD | CFG.h | 543 succ_iterator succ_end() { return Succs.end(); } in succ_end() function 545 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end() function 613 return filtered_succ_iterator(succ_begin(), succ_end(), this, f); in filtered_succ_start_end() 1012 { return N->succ_end(); } 1026 { return N->succ_end(); }
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | LoopInstSimplify.cpp | 154 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; in runOnLoop()
|
| /NextBSD/contrib/llvm/tools/clang/lib/Analysis/ |
| HD | 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()
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | LoopUnroll.cpp | 368 for (succ_iterator SI = succ_begin(*BB), SE = succ_end(*BB); in UnrollLoop() 454 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); in UnrollLoop()
|