Searched refs:ChildN (Results 1 – 4 of 4) sorted by relevance
830 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local831 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()836 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()838 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()839 N = &ChildN; in switchInternalEdgeToRef()846 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()847 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()874 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()875 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()876 N->LowLink = ChildN.LowLink; in switchInternalEdgeToRef()[all …]
294 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);297 void setEdgeKind(Node &ChildN, Edge::Kind EK);300 bool removeEdgeInternal(Node &ChildN);
2136 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()2137 assert(Visited.insert(ChildN).second && in visitDomSubTree()2139 DomWorklist.push_back(ChildN); in visitDomSubTree()2686 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost() argument2687 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
1767 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1768 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1835 for (const SDValue &ChildN : N->op_values()) in Run() local1836 AddToWorklist(ChildN.getNode(), /*IsCandidateForPruning=*/true, in Run()