Searched refs:ChildN (Results 1 – 7 of 7) sorted by relevance
567 Node &ChildN = *I->getNode(); in switchInternalEdgeToRef() local568 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()573 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()575 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()576 N = &ChildN; in switchInternalEdgeToRef()583 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()584 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()611 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()612 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()613 N->LowLink = ChildN.LowLink; in switchInternalEdgeToRef()[all …]
772 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local773 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()778 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()780 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()781 N = &ChildN; in switchInternalEdgeToRef()788 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()789 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()816 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()817 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()818 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);
1777 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()1778 assert(Visited.insert(ChildN).second && in visitDomSubTree()1780 DomWorklist.push_back(ChildN); in visitDomSubTree()2165 N.begin(), N.end(), BBCostIt->second, [&](int Sum, DomTreeNode *ChildN) { in computeDomSubtreeCost() argument2166 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
218 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
1227 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1228 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1299 for (const SDValue &ChildN : N->op_values()) in Run() local1300 if (!CombinedNodes.count(ChildN.getNode())) in Run()1301 AddToWorklist(ChildN.getNode()); in Run()
1377 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1378 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1449 for (const SDValue &ChildN : N->op_values()) in Run() local1450 if (!CombinedNodes.count(ChildN.getNode())) in Run()1451 AddToWorklist(ChildN.getNode()); in Run()