Lines Matching refs:U
49 for (uint32_t U = 0, NU = TRI.getNumRegUnits(); U != NU; ++U) { in PhysicalRegisterInfo() local
50 if (UnitInfos[U].Reg != 0) in PhysicalRegisterInfo()
52 MCRegUnitRootIterator R(U, &TRI); in PhysicalRegisterInfo()
57 UnitInfos[U].Mask = LaneBitmask::getAll(); in PhysicalRegisterInfo()
58 UnitInfos[U].Reg = F; in PhysicalRegisterInfo()
91 for (uint32_t U = 0, NU = TRI.getNumRegUnits(); U != NU; ++U) { in PhysicalRegisterInfo() local
93 for (MCRegUnitRootIterator R(U, &TRI); R.isValid(); ++R) in PhysicalRegisterInfo()
96 AliasInfos[U].Regs = AS; in PhysicalRegisterInfo()
136 auto [U, M] = *UM; in getUnits()
138 Units.insert(U); in getUnits()
157 for (MCRegUnit U : TRI.regunits(CR)) in getUnits() local
158 Units.insert(U); in getUnits()
274 for (unsigned U : A.units()) in print() local
275 OS << ' ' << printRegUnit(U, &TRI); in print()
283 for (MCRegUnitMaskIterator U(RR.Reg, &PRI.getTRI()); U.isValid(); ++U) { in hasAliasOf() local
284 std::pair<uint32_t, LaneBitmask> P = *U; in hasAliasOf()
298 for (MCRegUnitMaskIterator U(RR.Reg, &PRI.getTRI()); U.isValid(); ++U) { in hasCoverOf() local
299 std::pair<uint32_t, LaneBitmask> P = *U; in hasCoverOf()
313 for (MCRegUnitMaskIterator U(RR.Reg, &PRI.getTRI()); U.isValid(); ++U) { in insert() local
314 std::pair<uint32_t, LaneBitmask> P = *U; in insert()
359 int U = Units.find_first(); in makeRegRef() local
360 if (U < 0) in makeRegRef()
367 BitVector Regs = PRI.getUnitAliases(U); in makeRegRef()
368 U = Units.find_next(U); in makeRegRef()
372 while (U >= 0) { in makeRegRef()
373 Regs &= PRI.getUnitAliases(U); in makeRegRef()
374 U = Units.find_next(U); in makeRegRef()
396 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in ref_iterator() local
397 RegisterRef R = RG.PRI.getRefForUnit(U); in ref_iterator()