Searched refs:ChildN (Results 1 – 4 of 4) sorted by relevance
835 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local836 if (ChildN.DFSNumber == 0) { in switchInternalEdgeToRef()841 assert(!G->SCCMap.count(&ChildN) && in switchInternalEdgeToRef()843 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()844 N = &ChildN; in switchInternalEdgeToRef()851 if (ChildN.DFSNumber == -1) { in switchInternalEdgeToRef()852 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()879 assert(ChildN.LowLink > 0 && "Must have a positive low-link number!"); in switchInternalEdgeToRef()880 if (ChildN.LowLink < N->LowLink) in switchInternalEdgeToRef()881 N->LowLink = ChildN.LowLink; in switchInternalEdgeToRef()[all …]
299 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);302 void setEdgeKind(Node &ChildN, Edge::Kind EK);305 bool removeEdgeInternal(Node &ChildN);
2014 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()2015 assert(Visited.insert(ChildN).second && in visitDomSubTree()2017 DomWorklist.push_back(ChildN); in visitDomSubTree()2496 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost() argument2497 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
1489 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1490 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1552 for (const SDValue &ChildN : N->op_values()) in Run() local1553 if (!CombinedNodes.count(ChildN.getNode())) in Run()1554 AddToWorklist(ChildN.getNode()); in Run()