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.cpp258 assert(N->DFSNumber == -1 && in verify()
792 N->DFSNumber = N->LowLink = 0; in switchInternalEdgeToRef()
804 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
816 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
817 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
822 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
831 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()
838 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()
846 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()
859 N.DFSNumber = N.LowLink = -1; in switchInternalEdgeToRef()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNHoist.cpp270 DenseMap<const Value *, unsigned> DFSNumber; member in llvm::GVNHoist
285 unsigned I1DFS = DFSNumber.lookup(I1); in firstInBB()
286 unsigned I2DFS = DFSNumber.lookup(I2); in firstInBB()
515 DFSNumber[BB] = ++BBI; in run()
518 DFSNumber[&Inst] = ++I; in run()
559 auto Result = DFSNumber.lookup(V); in rank()
1112 DFSNumber[Repl] = DFSNumber[Last]++; in hoist()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h376 int DFSNumber = 0; variable