Searched refs:ChildN (Results 1 – 3 of 3) sorted by relevance
300 for (Node &ChildN : *N) { in insertIncomingEdge()301 SCC &ChildC = *G->SCCMap.lookup(&ChildN); in insertIncomingEdge()311 for (Node &ChildN : **I) { in insertIncomingEdge()312 SCC &ChildC = *G->SCCMap.lookup(&ChildN); in insertIncomingEdge()391 Node &ChildN = *I; in internalDFS() local392 if (SCC *ChildSCC = G->SCCMap.lookup(&ChildN)) { in internalDFS()412 if (ChildN.DFSNumber == 0) { in internalDFS()419 ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++; in internalDFS()420 N = &ChildN; in internalDFS()421 I = ChildN.begin(); in internalDFS()[all …]
149 Node &ChildN = G->get(*F); variable150 *I = &ChildN;151 return ChildN;
1231 for (const SDValue &ChildN : N->op_values()) in recursivelyDeleteUnusedNodes() local1232 Nodes.insert(ChildN.getNode()); in recursivelyDeleteUnusedNodes()1304 for (const SDValue &ChildN : N->op_values()) in Run() local1305 if (!CombinedNodes.count(ChildN.getNode())) in Run()1306 AddToWorklist(ChildN.getNode()); in Run()