89     OS << Print<NodeId>(RA.Id, G) << '<'  in printRefHeader()
162     OS << Print<NodeId>(I.Id, P.G);  in operator <<()
203   OS << Print<NodeId>(P.Obj.Id, P.G) << ": phi ["  in operator <<()
212   OS << Print<NodeId>(P.Obj.Id, P.G) << ": " << P.G.getTII().getName(Opc)  in operator <<()
228       OS << "instr? " << Print<NodeId>(P.Obj.Id, P.G);  in operator <<()
249   OS << Print<NodeId>(P.Obj.Id, P.G) << ": === BB#" << BB->getNumber()  in operator <<()
271   OS << "DFG dump:[\n" << Print<NodeId>(P.Obj.Id, P.G) << ": Function: "  in operator <<()
292     OS << Print<NodeId>(I->Id, P.G)  in operator <<()
369   if (Next != NA.Id) {  in append()
370     Next = NA.Id;  in append()
417   Ref.RD = DA.Id;  in linkToDef()
424   Ref.RD = DA.Id;  in linkToDef()
446   if (ML.Id != 0) {  in addMember()
449     Code.FirstM = NA.Id;  in addMember()
453   Code.LastM = NA.Id;  in addMember()
460   if (Code.LastM == MA.Id)  in addMemberAfter()
461     Code.LastM = NA.Id;  in addMemberAfter()
467   assert(MA.Id != 0);  in removeMember()
470   if (MA.Id == NA.Id) {  in removeMember()
471     if (Code.LastM == MA.Id) {  in removeMember()
483     if (MX == NA.Id) {  in removeMember()
487       if (Code.LastM == NA.Id)  in removeMember()
488         Code.LastM = MA.Id;  in removeMember()
518   if (M.Id == 0) {  in addPhi()
527     Code.FirstM = PA.Id;  in addPhi()
528     PA.Addr->setNext(M.Id);  in addPhi()
882   PUA.Addr->setPredecessor(PredB.Id);  in newPhiUse()
1025     if (Visited.count(DA.Id))  in pushDefs()
1049       Visited.insert(T.Id);  in pushDefs()
1057   assert(IA.Id != 0 && RA.Id != 0);  in getRelatedRefs()
1060   NodeId Start = RA.Id;  in getRelatedRefs()
1064   } while (RA.Id != 0 && RA.Id != Start);  in getRelatedRefs()
1084   assert(IA.Id != 0 && RA.Id != 0);  in getNextRelated()
1123   assert(IA.Id != 0 && RA.Id != 0);  in locateNextRef()
1126   NodeId Start = RA.Id;  in locateNextRef()
1129     if (NA.Id == 0 || NA.Id == Start)  in locateNextRef()
1136   if (NA.Id != 0 && NA.Id != Start)  in locateNextRef()
1145   assert(IA.Id != 0 && RA.Id != 0);  in getNextShadow()
1152   if (Loc.second.Id != 0 || !Create)  in getNextShadow()
1166   assert(IA.Id != 0 && RA.Id != 0);  in getNextShadow()
1275   auto &Refs = RefM[BA.Id];  in buildBlockRefs()
1282     const auto &SRs = RefM[SBA.Id];  in buildBlockRefs()
1330   RegisterSet &Refs = RefM[BA.Id];  in recordDefsForDF()
1333     const auto &Rs = RefM[DBA.Id];  in recordDefsForDF()
1339     PhiM[DBA.Id].insert(Defs.begin(), Defs.end());  in recordDefsForDF()
1349   auto HasDF = PhiM.find(BA.Id);  in buildPhis()
1369   auto &RefB = RefM[BA.Id];  in buildPhis()
1396     PredList.push_back(B.Id);  in buildPhis()
1448       PhiQ.insert(P.Id);  in removeUnusedPhis()
1467     PhiQ.remove(PA.Id);  in removeUnusedPhis()
1476           PhiQ.insert(OA.Id);  in removeUnusedPhis()
1519     if (TAP.Id == 0) {  in linkRefUp()
1528     TAP.Addr->linkToDef(TAP.Id, RDA);  in linkRefUp()
1567   markBlock(BA.Id, DefM);  in linkBlockRefs()
1597     return PUA.Addr->getPredecessor() == BA.Id;  in linkBlockRefs()
1613   releaseBlock(BA.Id, DefM);  in linkBlockRefs()
1628   if (TA.Id == UA.Id) {  in unlinkUseDF()
1633   while (TA.Id != 0) {  in unlinkUseDF()
1635     if (S == UA.Id) {  in unlinkUseDF()
1702   if (TA.Id == DA.Id) {  in unlinkDefDF()
1709     while (TA.Id != 0) {  in unlinkDefDF()
1711       if (S == DA.Id) {  in unlinkDefDF()
1723     RDA.Addr->setReachedDef(ReachedDefs.front().Id);  in unlinkDefDF()
1729     RDA.Addr->setReachedUse(ReachedUses.front().Id);  in unlinkDefDF()