Lines Matching refs:Unit
176 /// Preincrement. Move to the next unit.
195 // Return true of this unit appears in RegUnits.
196 static bool hasRegUnit(CodeGenRegister::RegUnitList &RegUnits, unsigned Unit) {
197 return RegUnits.test(Unit);
363 // Absent any ad hoc aliasing, we create one register unit per leaf register.
367 // When there is ad hoc aliasing, we simply create one unit per edge in the
379 unsigned Unit = RegBank.newRegUnit(this, AR);
380 RegUnits.set(Unit);
381 AR->RegUnits.set(Unit);
385 // a leaf register with ad hoc aliases doesn't get its own unit - it isn't
386 // necessary. This means the aliasing leaf registers can share a single unit.
523 // Get the sum of this register's unit weights.
1161 // sub-register index level. Each bit in the lane mask is like a register unit
1290 // register unit weights.
1292 // A Weight field caches the max per-register unit weight in each UberRegSet.
1295 // for which the unit weight equals the set weight. These units should not have
1371 // Recompute each UberSet weight after changing unit weights.
1378 // Initialize all unit weights in this set, and remember the max units/reg.
1400 for (auto &Unit : I->Regs)
1401 dbgs() << " " << Unit->getName();
1457 // A register unit's weight can be adjusted only if it is the singular unit
1464 // We don't have an adjustable unit, so adopt a new one.
1467 // Adopting a unit does not immediately require recomputing set weights.
1470 // Adjust the existing single unit.
1472 // The unit may be shared among sets and registers within this set.
1484 // Compute a weight for each register unit created during getSubRegs.
1496 // Iterate over each Register, normalizing the unit weights until reaching
1500 assert(NumIters <= NumNativeRegUnits && "Runaway register unit weights");
1532 /// Iteratively prune unit sets. Prune subsets that are close to the superset,
1542 /// are not nicely defined by merging nearly identical register unit sets
1632 // Iteratively prune unit sets.
1646 // Iterate over all unit sets, including new ones added by this loop.
1652 assert(Idx < (2*NumRegUnitSubSets) && "runaway unit set inference");
1693 // Iteratively prune unit sets after inferring supersets.
1736 assert(!RegClassUnitSets[RCIdx].empty() && "missing unit set for regclass");
1739 // For each register unit, ensure that we have the list of UnitSets that
1740 // contain the unit. Normally, this matches an existing list of UnitSets for a
1811 // Compute a weight for each register unit created during getSubRegs.
1812 // This may create adopted register units (with unit # >= NumNativeRegUnits).
