Searched refs:ChildN (Results 1 – 4 of 4) sorted by relevance
785 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local786 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()791 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()793 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()794 N = &ChildN; in switchInternalEdgeToRef()801 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()802 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()829 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()830 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()831 N->LowLink = ChildN.LowLink; in switchInternalEdgeToRef()[all …]
301 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);304 void setEdgeKind(Node &ChildN, Edge::Kind EK);307 bool removeEdgeInternal(Node &ChildN);
1910 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()1911 assert(Visited.insert(ChildN).second && in visitDomSubTree()1913 DomWorklist.push_back(ChildN); in visitDomSubTree()2361 N.begin(), N.end(), BBCostIt->second, [&](int Sum, DomTreeNode *ChildN) { in computeDomSubtreeCost() argument2362 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
1385 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1386 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1448 for (const SDValue &ChildN : N->op_values()) in Run() local1449 if (!CombinedNodes.count(ChildN.getNode())) in Run()1450 AddToWorklist(ChildN.getNode()); in Run()