Searched refs:ChildN (Results 1 – 4 of 4) sorted by relevance
836 Node &ChildN = I->getNode(); in switchInternalEdgeToRef() local844 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in switchInternalEdgeToRef()845 N = &ChildN; in switchInternalEdgeToRef()1273 ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++; in removeInternalRefEdge()1274 N = &ChildN; in removeInternalRefEdge()1275 I = ChildN->begin(); in removeInternalRefEdge()1276 E = ChildN->end(); in removeInternalRefEdge()1290 if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink) in removeInternalRefEdge()1819 Node &ChildN = GetNode(I); in buildGenericSCCs() local1825 ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++; in buildGenericSCCs()[all …]
296 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);299 void setEdgeKind(Node &ChildN, Edge::Kind EK);302 bool removeEdgeInternal(Node &ChildN);
2040 for (DomTreeNode *ChildN : *N) { in visitDomSubTree()2041 assert(Visited.insert(ChildN).second && in visitDomSubTree()2043 DomWorklist.push_back(ChildN); in visitDomSubTree()2546 [&](InstructionCost Sum, DomTreeNode *ChildN) -> InstructionCost { in computeDomSubtreeCost() argument2547 return Sum + computeDomSubtreeCost(*ChildN, BBCostMap, DTCostMap); in computeDomSubtreeCost()
1553 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1554 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1616 for (const SDValue &ChildN : N->op_values()) in Run() local1617 if (!CombinedNodes.count(ChildN.getNode())) in Run()1618 AddToWorklist(ChildN.getNode()); in Run()