Home
last modified time | relevance | path

Searched refs:depth_first_ext (Results 1 – 12 of 12) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp142 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in run()
H A DBreakFalseDeps.cpp295 for (MachineBasicBlock *MBB : depth_first_ext(&mf, Reachable)) in runOnMachineFunction()
H A DLiveVariables.cpp646 for (MachineBasicBlock *MBB : depth_first_ext(Entry, Visited)) { in analyze()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h168 for (auto *BB : depth_first_ext(&F, Reachable)) in apply()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h255 iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G, in depth_first_ext() function
H A DGenericCycleImpl.h155 for (BlockT *BB : depth_first_ext(getHeader(), VisitSet)) { in verifyCycle()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp241 auto Range = depth_first_ext(&Start, Visited); in getReachableAvoiding()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp85 for (auto I : depth_first_ext(N, Visited)) in createAndConnectRootNode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DADCE.cpp285 for (auto *BB: depth_first_ext(&F.getEntryBlock(), State)) { in initialize()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfoImpl.h341 for (BlockT *BB : depth_first_ext(getHeader(), VisitSet)) { in verifyLoop()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp129 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in EliminateUnreachableBlocks()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86FloatingPoint.cpp372 for (MachineBasicBlock *BB : depth_first_ext(Entry, Processed)) in runOnMachineFunction()