Searched refs:ChildN (Results 1 – 4 of 4) sorted by relevance
828 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local829 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()834 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()836 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()837 N = &ChildN; in switchInternalEdgeToRef()844 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()845 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()872 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()873 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()874 N->LowLink = ChildN.LowLink; in switchInternalEdgeToRef()[all …]
296 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);299 void setEdgeKind(Node &ChildN, Edge::Kind EK);302 bool removeEdgeInternal(Node &ChildN);
2131 for (DomTreeNode *ChildN : *N) { in visitDomSubTree() 2132 assert(Visited.insert(ChildN).second && in visitDomSubTree() 2134 DomWorklist.push_back(ChildN); in visitDomSubTree() 2680 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost() 2681 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost() 2679 __anondb665f8c1702(InstructionCost Sum, DomTreeNode *ChildN) computeDomSubtreeCost() argument
1710 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1711 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1778 for (const SDValue &ChildN : N->op_values()) in Run() local1779 AddToWorklist(ChildN.getNode(), /*IsCandidateForPruning=*/true, in Run()