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()  local
392       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()
422         E = ChildN.end();  in internalDFS()
428       assert(ChildN.LowLink != 0 &&  in internalDFS()
430       if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink)  in internalDFS()
431         N->LowLink = ChildN.LowLink;  in internalDFS()
504     for (Node &ChildN : *N) {  in removeIntraSCCEdge()
505       SCC &ChildSCC = *G->SCCMap.lookup(&ChildN);  in removeIntraSCCEdge()
640       Node &ChildN = *I;  in getNextSCCInPostOrder()  local
641       if (ChildN.DFSNumber == 0) {  in getNextSCCInPostOrder()
648         assert(!SCCMap.count(&ChildN) &&  in getNextSCCInPostOrder()
650         ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;  in getNextSCCInPostOrder()
651         N = &ChildN;  in getNextSCCInPostOrder()
652         I = ChildN.begin();  in getNextSCCInPostOrder()
653         E = ChildN.end();  in getNextSCCInPostOrder()
658       assert(ChildN.LowLink != 0 &&  in getNextSCCInPostOrder()
660       if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink)  in getNextSCCInPostOrder()
661         N->LowLink = ChildN.LowLink;  in getNextSCCInPostOrder()
690   for (LazyCallGraph::Node &ChildN : N)  in printNodes()
691     if (Printed.insert(&ChildN).second)  in printNodes()
692       printNodes(OS, ChildN, Printed);  in printNodes()