Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp248 assert(N->DFSNumber == -1 && in verify()
782 N->DFSNumber = N->LowLink = 0; in switchInternalEdgeToRef()
794 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
806 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
807 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
812 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
821 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()
828 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()
836 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()
849 N.DFSNumber = N.LowLink = -1; in switchInternalEdgeToRef()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DGVNHoist.cpp286 DenseMap<const Value *, unsigned> DFSNumber; member in llvm::GVNHoist
301 unsigned I1DFS = DFSNumber.lookup(I1); in firstInBB()
302 unsigned I2DFS = DFSNumber.lookup(I2); in firstInBB()
564 DFSNumber[BB] = ++BBI; in run()
567 DFSNumber[&Inst] = ++I; in run()
608 auto Result = DFSNumber.lookup(V); in rank()
1149 DFSNumber[Repl] = DFSNumber[Last]++; in hoist()
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h378 int DFSNumber = 0; variable