Home
last modified time | relevance | path

Searched refs:RootN (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp809 for (Node *RootN : Worklist) { in switchInternalEdgeToRef()
816 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
817 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
822 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
825 DFSStack.emplace_back(RootN, (*RootN)->call_begin()); in switchInternalEdgeToRef()
1233 Node *RootN = Worklist.pop_back_val(); in removeInternalRefEdges() local
1235 if (RootN->DFSNumber != 0) { in removeInternalRefEdges()
1236 assert(RootN->DFSNumber == -1 && in removeInternalRefEdges()
1241 RootN->DFSNumber = RootN->LowLink = 1; in removeInternalRefEdges()
1244 DFSStack.emplace_back(RootN, (*RootN)->begin()); in removeInternalRefEdges()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp558 for (const Node &RootN : G.nodes()) { in elimMitigatedEdgesAndNodes() local
559 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) in elimMitigatedEdgesAndNodes()
575 FindReachableNodes(&RootN, true); in elimMitigatedEdgesAndNodes()
578 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()