Home
last modified time | relevance | path

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

/src/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp807 for (Node *RootN : Worklist) { in switchInternalEdgeToRef()
814 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
815 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
820 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
823 DFSStack.emplace_back(RootN, (*RootN)->call_begin()); in switchInternalEdgeToRef()
1231 Node *RootN = Worklist.pop_back_val(); in removeInternalRefEdges() local
1233 if (RootN->DFSNumber != 0) { in removeInternalRefEdges()
1234 assert(RootN->DFSNumber == -1 && in removeInternalRefEdges()
1239 RootN->DFSNumber = RootN->LowLink = 1; in removeInternalRefEdges()
1242 DFSStack.emplace_back(RootN, (*RootN)->begin()); in removeInternalRefEdges()
[all …]
/src/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp560 for (const Node &RootN : G.nodes()) { in elimMitigatedEdgesAndNodes() local
561 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) in elimMitigatedEdgesAndNodes()
577 FindReachableNodes(&RootN, true); in elimMitigatedEdgesAndNodes()
580 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()