Home
last modified time | relevance | path

Searched refs:DFSNumber (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp256 assert(N->DFSNumber == -1 && in verify()
790 N->DFSNumber = N->LowLink = 0; in switchInternalEdgeToRef()
802 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
814 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
815 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
820 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
829 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()
836 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()
844 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()
857 N.DFSNumber = N.LowLink = -1; in switchInternalEdgeToRef()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNHoist.cpp271 DenseMap<const Value *, unsigned> DFSNumber; member in llvm::GVNHoist
286 unsigned I1DFS = DFSNumber.lookup(I1); in firstInBB()
287 unsigned I2DFS = DFSNumber.lookup(I2); in firstInBB()
516 DFSNumber[BB] = ++BBI; in run()
519 DFSNumber[&Inst] = ++I; in run()
560 auto Result = DFSNumber.lookup(V); in rank()
1114 DFSNumber[Repl] = DFSNumber[Last]++; in hoist()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h378 int DFSNumber = 0; variable