Lines Matching refs:size
257 // Works also for size 1.
258 OptoReg::Name RegMask::find_first_set(const int size) const {
259 verify_sets(size);
264 return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+(size-1));
272 void RegMask::clear_to_sets(const int size) {
273 if (size == 1) return;
274 assert(2 <= size && size <= 8, "update low bits table");
275 assert(is_power_of_2(size), "sanity");
276 int low_bits_mask = low_bits[size>>2];
280 for (int j = 1; j < size; j++) {
284 if (size > 2) {
286 if (size > 4) {
292 verify_sets(size);
297 void RegMask::smear_to_sets(const int size) {
298 if (size == 1) return;
299 assert(2 <= size && size <= 8, "update low bits table");
300 assert(is_power_of_2(size), "sanity");
301 int low_bits_mask = low_bits[size>>2];
305 for (int j = 0; j < size; j++) {
310 if (size > 2) {
312 if (size > 4) {
318 verify_sets(size);
322 bool RegMask::is_aligned_sets(const int size) const {
323 if (size == 1) return true;
324 assert(2 <= size && size <= 8, "update low bits table");
325 assert(is_power_of_2(size), "sanity");
326 int low_bits_mask = low_bits[size>>2];
334 // Do extra work since (bit << size) may overflow.
335 int hi_bit = bit << (size-1); // high bit
347 // Works also for size 1.
348 int RegMask::is_bound_set(const int size) const {
350 assert(1 <= size && size <= 8, "update low bits table");
357 int hi_bit = bit << (size-1); // high bit
366 // The lower 24 bits should be 0 since it is split case and size <= 8.
369 set = (((set << size) - 1) >> 8);
393 // Compute size of register mask in bits