567         Node &ChildN = *I->getNode();  in switchInternalEdgeToRef()  local
568         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()
1049         Node &ChildN = I->getNode(*G);  in removeInternalRefEdge()  local
1050         if (ChildN.DFSNumber == 0) {  in removeInternalRefEdge()
1057           ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;  in removeInternalRefEdge()
1058           N = &ChildN;  in removeInternalRefEdge()
1059           I = ChildN.begin();  in removeInternalRefEdge()
1060           E = ChildN.end();  in removeInternalRefEdge()
1063         if (ChildN.DFSNumber == -1) {  in removeInternalRefEdge()
1069           auto PostOrderI = PostOrderMapping.find(&ChildN);  in removeInternalRefEdge()
1088           RefSCC &ChildRC = *G->lookupRefSCC(ChildN);  in removeInternalRefEdge()
1096         assert(ChildN.LowLink != 0 &&  in removeInternalRefEdge()
1098         if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink)  in removeInternalRefEdge()
1099           N->LowLink = ChildN.LowLink;  in removeInternalRefEdge()
1327         Node &ChildN = *I->getNode();  in buildSCCs()  local
1328         if (ChildN.DFSNumber == 0) {  in buildSCCs()
1333           assert(!lookupSCC(ChildN) &&  in buildSCCs()
1335           ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++;  in buildSCCs()
1336           N = &ChildN;  in buildSCCs()
1345         if (ChildN.DFSNumber == -1) {  in buildSCCs()
1351         assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");  in buildSCCs()
1352         if (ChildN.LowLink < N->LowLink)  in buildSCCs()
1353           N->LowLink = ChildN.LowLink;  in buildSCCs()
1447       Node &ChildN = I->getNode(*this);  in getNextRefSCCInPostOrder()  local
1448       if (ChildN.DFSNumber == 0) {  in getNextRefSCCInPostOrder()
1453         assert(!SCCMap.count(&ChildN) &&  in getNextRefSCCInPostOrder()
1455         ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;  in getNextRefSCCInPostOrder()
1456         N = &ChildN;  in getNextRefSCCInPostOrder()
1465       if (ChildN.DFSNumber == -1) {  in getNextRefSCCInPostOrder()
1471       assert(ChildN.LowLink > 0 && "Must have a positive low-link number!");  in getNextRefSCCInPostOrder()
1472       if (ChildN.LowLink < N->LowLink)  in getNextRefSCCInPostOrder()
1473         N->LowLink = ChildN.LowLink;  in getNextRefSCCInPostOrder()