Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp799 for (Node *RootN : Worklist) { in switchInternalEdgeToRef()
806 if (RootN->DFSNumber != 0) { in switchInternalEdgeToRef()
807 assert(RootN->DFSNumber == -1 && in switchInternalEdgeToRef()
812 RootN->DFSNumber = RootN->LowLink = 1; in switchInternalEdgeToRef()
815 DFSStack.emplace_back(RootN, (*RootN)->call_begin()); in switchInternalEdgeToRef()
1227 Node *RootN = Worklist.pop_back_val(); in removeInternalRefEdge() local
1229 if (RootN->DFSNumber != 0) { in removeInternalRefEdge()
1230 assert(RootN->DFSNumber == -1 && in removeInternalRefEdge()
1235 RootN->DFSNumber = RootN->LowLink = 1; in removeInternalRefEdge()
1238 DFSStack.emplace_back(RootN, (*RootN)->begin()); in removeInternalRefEdge()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp562 for (const Node &RootN : G.nodes()) { in elimMitigatedEdgesAndNodes() local
563 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) in elimMitigatedEdgesAndNodes()
579 FindReachableNodes(&RootN, true); in elimMitigatedEdgesAndNodes()
582 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()