Lines Matching defs:Refs
970 // Link all the refs. This will recursively traverse the dominator tree.
1059 NodeList Refs;
1062 Refs.push_back(RA);
1065 return Refs;
1275 auto &Refs = RefM[BA.Id];
1283 Refs.insert(SRs.begin(), SRs.end());
1288 Refs.insert(RA.Addr->getRegRef());
1330 RegisterSet &Refs = RefM[BA.Id];
1334 Refs.insert(Rs.begin(), Rs.end());
1353 // First, remove all R in Refs in such that there exists T in Refs
1354 // such that T covers R. In other words, only leave those refs that
1377 // Sort the refs so that the phis will be created in a deterministic order.
1468 NodeList Refs = PA.Addr->members(*this);
1469 if (HasUsedDef(Refs))
1471 for (NodeAddr<RefNode*> RA : Refs) {
