1166   auto IsRelated = [this, RA](Ref TA) -> bool {  in getNextRelated()  argument
1167     if (TA.Addr->getKind() != RA.Addr->getKind())  in getNextRelated()
1169     if (!getPRI().equal_to(TA.Addr->getRegRef(*this),  in getNextRelated()
1178     auto Cond = [&IsRelated, RA](Ref TA) -> bool {  in getNextRelated()  argument
1179       return IsRelated(TA) && &RA.Addr->getOp() == &TA.Addr->getOp();  in getNextRelated()
1185   auto Cond = [&IsRelated, RA](Ref TA) -> bool {  in getNextRelated()  argument
1186     if (!IsRelated(TA))  in getNextRelated()
1188     if (TA.Addr->getKind() != NodeAttrs::Use)  in getNextRelated()
1191     return PhiUse(TA).Addr->getPredecessor() ==  in getNextRelated()
1229   auto IsShadow = [Flags](Ref TA) -> bool {  in getNextShadow()  argument
1230     return TA.Addr->getFlags() == Flags;  in getNextShadow()
1507 void DataFlowGraph::linkRefUp(Instr IA, NodeAddr<T> TA, DefStack &DS) {  in linkRefUp()  argument
1510   RegisterRef RR = TA.Addr->getRegRef(*this);  in linkRefUp()
1534       TAP = TA;  in linkRefUp()
1669   auto TA = addr<UseNode *>(RDA.Addr->getReachedUse());  in unlinkUseDF()  local
1670   if (TA.Id == UA.Id) {  in unlinkUseDF()
1675   while (TA.Id != 0) {  in unlinkUseDF()
1676     NodeId S = TA.Addr->getSibling();  in unlinkUseDF()
1678       TA.Addr->setSibling(UA.Addr->getSibling());  in unlinkUseDF()
1681     TA = addr<UseNode *>(S);  in unlinkUseDF()
1743   auto TA = addr<DefNode *>(RDA.Addr->getReachedDef());  in unlinkDefDF()  local
1744   if (TA.Id == DA.Id) {  in unlinkDefDF()
1751     while (TA.Id != 0) {  in unlinkDefDF()
1752       NodeId S = TA.Addr->getSibling();  in unlinkDefDF()
1754         TA.Addr->setSibling(Sib);  in unlinkDefDF()
1757       TA = addr<DefNode *>(S);  in unlinkDefDF()