| ... | ... | @@ -4,6 +4,7 @@ const mem = std.mem; |
| 4 | 4 | const assert = std.debug.assert; |
| 5 | 5 | const Allocator = std.mem.Allocator; |
| 6 | 6 | const Air = @import("Air.zig"); |
| 7 | const StaticBitSet = std.bit_set.StaticBitSet; |
| 7 | 8 | const Type = @import("type.zig").Type; |
| 8 | 9 | const Module = @import("Module.zig"); |
| 9 | 10 | const expect = std.testing.expect; |
| ... | ... | @@ -41,49 +42,39 @@ pub fn RegisterManager( |
| 41 | 42 | registers: [tracked_registers.len]Air.Inst.Index = undefined, |
| 42 | 43 | /// Tracks which registers are free (in which case the |
| 43 | 44 | /// corresponding bit is set to 1) |
| 44 | | free_registers: RegisterBitSet = math.maxInt(RegisterBitSet), |
| 45 | free_registers: RegisterBitSet = RegisterBitSet.initFull(), |
| 45 | 46 | /// Tracks all registers allocated in the course of this |
| 46 | 47 | /// function |
| 47 | | allocated_registers: RegisterBitSet = 0, |
| 48 | allocated_registers: RegisterBitSet = RegisterBitSet.initEmpty(), |
| 48 | 49 | /// Tracks registers which are locked from being allocated |
| 49 | | locked_registers: RegisterBitSet = 0, |
| 50 | locked_registers: RegisterBitSet = RegisterBitSet.initEmpty(), |
| 50 | 51 | |
| 51 | 52 | const Self = @This(); |
| 52 | 53 | |
| 53 | | /// An integer whose bits represent all the registers and |
| 54 | | /// whether they are free. |
| 55 | | pub const RegisterBitSet = std.meta.Int(.unsigned, tracked_registers.len); |
| 56 | | const ShiftInt = math.Log2Int(RegisterBitSet); |
| 54 | pub const RegisterBitSet = StaticBitSet(tracked_registers.len); |
| 57 | 55 | |
| 58 | 56 | fn getFunction(self: *Self) *Function { |
| 59 | 57 | return @fieldParentPtr(Function, "register_manager", self); |
| 60 | 58 | } |
| 61 | 59 | |
| 62 | 60 | fn excludeRegister(reg: Register, register_class: RegisterBitSet) bool { |
| 63 | | const mask = getRegisterMask(reg) orelse return true; |
| 64 | | return mask & register_class == 0; |
| 65 | | } |
| 66 | | |
| 67 | | fn getRegisterMask(reg: Register) ?RegisterBitSet { |
| 68 | | const index = indexOfRegIntoTracked(reg) orelse return null; |
| 69 | | const shift = @intCast(ShiftInt, index); |
| 70 | | const mask = @as(RegisterBitSet, 1) << shift; |
| 71 | | return mask; |
| 61 | const index = indexOfRegIntoTracked(reg) orelse return true; |
| 62 | return !register_class.isSet(index); |
| 72 | 63 | } |
| 73 | 64 | |
| 74 | 65 | fn markRegAllocated(self: *Self, reg: Register) void { |
| 75 | | const mask = getRegisterMask(reg) orelse return; |
| 76 | | self.allocated_registers |= mask; |
| 66 | const index = indexOfRegIntoTracked(reg) orelse return; |
| 67 | self.allocated_registers.set(index); |
| 77 | 68 | } |
| 78 | 69 | |
| 79 | 70 | fn markRegUsed(self: *Self, reg: Register) void { |
| 80 | | const mask = getRegisterMask(reg) orelse return; |
| 81 | | self.free_registers &= ~mask; |
| 71 | const index = indexOfRegIntoTracked(reg) orelse return; |
| 72 | self.free_registers.unset(index); |
| 82 | 73 | } |
| 83 | 74 | |
| 84 | 75 | fn markRegFree(self: *Self, reg: Register) void { |
| 85 | | const mask = getRegisterMask(reg) orelse return; |
| 86 | | self.free_registers |= mask; |
| 76 | const index = indexOfRegIntoTracked(reg) orelse return; |
| 77 | self.free_registers.set(index); |
| 87 | 78 | } |
| 88 | 79 | |
| 89 | 80 | pub fn indexOfReg( |
| ... | ... | @@ -96,14 +87,14 @@ pub fn RegisterManager( |
| 96 | 87 | return null; |
| 97 | 88 | } |
| 98 | 89 | |
| 99 | | pub fn indexOfRegIntoTracked(reg: Register) ?ShiftInt { |
| 90 | pub fn indexOfRegIntoTracked(reg: Register) ?RegisterBitSet.ShiftInt { |
| 100 | 91 | return indexOfReg(tracked_registers, reg); |
| 101 | 92 | } |
| 102 | 93 | |
| 103 | 94 | /// Returns true when this register is not tracked |
| 104 | 95 | pub fn isRegFree(self: Self, reg: Register) bool { |
| 105 | | const mask = getRegisterMask(reg) orelse return true; |
| 106 | | return self.free_registers & mask != 0; |
| 96 | const index = indexOfRegIntoTracked(reg) orelse return true; |
| 97 | return self.free_registers.isSet(index); |
| 107 | 98 | } |
| 108 | 99 | |
| 109 | 100 | /// Returns whether this register was allocated in the course |
| ... | ... | @@ -111,16 +102,16 @@ pub fn RegisterManager( |
| 111 | 102 | /// |
| 112 | 103 | /// Returns false when this register is not tracked |
| 113 | 104 | pub fn isRegAllocated(self: Self, reg: Register) bool { |
| 114 | | const mask = getRegisterMask(reg) orelse return false; |
| 115 | | return self.allocated_registers & mask != 0; |
| 105 | const index = indexOfRegIntoTracked(reg) orelse return false; |
| 106 | return self.allocated_registers.isSet(index); |
| 116 | 107 | } |
| 117 | 108 | |
| 118 | 109 | /// Returns whether this register is locked |
| 119 | 110 | /// |
| 120 | 111 | /// Returns false when this register is not tracked |
| 121 | 112 | pub fn isRegLocked(self: Self, reg: Register) bool { |
| 122 | | const mask = getRegisterMask(reg) orelse return false; |
| 123 | | return self.locked_registers & mask != 0; |
| 113 | const index = indexOfRegIntoTracked(reg) orelse return false; |
| 114 | return self.locked_registers.isSet(index); |
| 124 | 115 | } |
| 125 | 116 | |
| 126 | 117 | pub const RegisterLock = struct { |
| ... | ... | @@ -139,8 +130,8 @@ pub fn RegisterManager( |
| 139 | 130 | log.debug(" register already locked", .{}); |
| 140 | 131 | return null; |
| 141 | 132 | } |
| 142 | | const mask = getRegisterMask(reg) orelse return null; |
| 143 | | self.locked_registers |= mask; |
| 133 | const index = indexOfRegIntoTracked(reg) orelse return null; |
| 134 | self.locked_registers.set(index); |
| 144 | 135 | return RegisterLock{ .register = reg }; |
| 145 | 136 | } |
| 146 | 137 | |
| ... | ... | @@ -149,8 +140,8 @@ pub fn RegisterManager( |
| 149 | 140 | pub fn lockRegAssumeUnused(self: *Self, reg: Register) RegisterLock { |
| 150 | 141 | log.debug("locking asserting free {}", .{reg}); |
| 151 | 142 | assert(!self.isRegLocked(reg)); |
| 152 | | const mask = getRegisterMask(reg) orelse unreachable; |
| 153 | | self.locked_registers |= mask; |
| 143 | const index = indexOfRegIntoTracked(reg) orelse unreachable; |
| 144 | self.locked_registers.set(index); |
| 154 | 145 | return RegisterLock{ .register = reg }; |
| 155 | 146 | } |
| 156 | 147 | |
| ... | ... | @@ -172,13 +163,13 @@ pub fn RegisterManager( |
| 172 | 163 | /// Call `lockReg` to obtain the lock first. |
| 173 | 164 | pub fn unlockReg(self: *Self, lock: RegisterLock) void { |
| 174 | 165 | log.debug("unlocking {}", .{lock.register}); |
| 175 | | const mask = getRegisterMask(lock.register) orelse return; |
| 176 | | self.locked_registers &= ~mask; |
| 166 | const index = indexOfRegIntoTracked(lock.register) orelse return; |
| 167 | self.locked_registers.unset(index); |
| 177 | 168 | } |
| 178 | 169 | |
| 179 | 170 | /// Returns true when at least one register is locked |
| 180 | 171 | pub fn lockedRegsExist(self: Self) bool { |
| 181 | | return self.locked_registers != 0; |
| 172 | return self.locked_registers.count() > 0; |
| 182 | 173 | } |
| 183 | 174 | |
| 184 | 175 | /// Allocates a specified number of registers, optionally |
| ... | ... | @@ -192,10 +183,15 @@ pub fn RegisterManager( |
| 192 | 183 | ) ?[count]Register { |
| 193 | 184 | comptime assert(count > 0 and count <= tracked_registers.len); |
| 194 | 185 | |
| 195 | | const free_registers = self.free_registers & register_class; |
| 196 | | const free_and_not_locked_registers = free_registers & ~self.locked_registers; |
| 197 | | const free_and_not_locked_registers_count = @popCount(RegisterBitSet, free_and_not_locked_registers); |
| 198 | | if (free_and_not_locked_registers_count < count) return null; |
| 186 | var free_and_not_locked_registers = self.free_registers; |
| 187 | free_and_not_locked_registers.setIntersection(register_class); |
| 188 | |
| 189 | var unlocked_registers = self.locked_registers; |
| 190 | unlocked_registers.toggleAll(); |
| 191 | |
| 192 | free_and_not_locked_registers.setIntersection(unlocked_registers); |
| 193 | |
| 194 | if (free_and_not_locked_registers.count() < count) return null; |
| 199 | 195 | |
| 200 | 196 | var regs: [count]Register = undefined; |
| 201 | 197 | var i: usize = 0; |
| ... | ... | @@ -242,10 +238,10 @@ pub fn RegisterManager( |
| 242 | 238 | ) AllocateRegistersError![count]Register { |
| 243 | 239 | comptime assert(count > 0 and count <= tracked_registers.len); |
| 244 | 240 | |
| 245 | | const available_registers_count = @popCount(RegisterBitSet, register_class); |
| 246 | | const locked_registers = self.locked_registers & register_class; |
| 247 | | const locked_registers_count = @popCount(RegisterBitSet, locked_registers); |
| 248 | | if (count > available_registers_count - locked_registers_count) return error.OutOfRegisters; |
| 241 | var locked_registers = self.locked_registers; |
| 242 | locked_registers.setIntersection(register_class); |
| 243 | |
| 244 | if (count > register_class.count() - locked_registers.count()) return error.OutOfRegisters; |
| 249 | 245 | |
| 250 | 246 | const result = self.tryAllocRegs(count, insts, register_class) orelse blk: { |
| 251 | 247 | // We'll take over the first count registers. Spill |
| ... | ... | @@ -255,7 +251,7 @@ pub fn RegisterManager( |
| 255 | 251 | var i: usize = 0; |
| 256 | 252 | for (tracked_registers) |reg| { |
| 257 | 253 | if (i >= count) break; |
| 258 | | if (excludeRegister(reg, register_class)) continue; |
| 254 | if (excludeRegister(reg, register_class)) break; |
| 259 | 255 | if (self.isRegLocked(reg)) continue; |
| 260 | 256 | |
| 261 | 257 | regs[i] = reg; |
| ... | ... | @@ -352,334 +348,6 @@ pub fn RegisterManager( |
| 352 | 348 | }; |
| 353 | 349 | } |
| 354 | 350 | |
| 355 | | // TODO delete current implementation of RegisterManager above, and uncomment the one |
| 356 | | // below once #11680 is fixed: |
| 357 | | // https://github.com/ziglang/zig/issues/11680 |
| 358 | | |
| 359 | | //pub fn RegisterManager( |
| 360 | | // comptime Function: type, |
| 361 | | // comptime Register: type, |
| 362 | | // comptime tracked_registers: []const Register, |
| 363 | | //) type { |
| 364 | | // // architectures which do not have a concept of registers should |
| 365 | | // // refrain from using RegisterManager |
| 366 | | // assert(tracked_registers.len > 0); // see note above |
| 367 | | |
| 368 | | // return struct { |
| 369 | | // /// Tracks the AIR instruction allocated to every register. If |
| 370 | | // /// no instruction is allocated to a register (i.e. the |
| 371 | | // /// register is free), the value in that slot is undefined. |
| 372 | | // /// |
| 373 | | // /// The key must be canonical register. |
| 374 | | // registers: [tracked_registers.len]Air.Inst.Index = undefined, |
| 375 | | // /// Tracks which registers are free (in which case the |
| 376 | | // /// corresponding bit is set to 1) |
| 377 | | // free_registers: RegisterBitSet = RegisterBitSet.initFull(), |
| 378 | | // /// Tracks all registers allocated in the course of this |
| 379 | | // /// function |
| 380 | | // allocated_registers: RegisterBitSet = RegisterBitSet.initEmpty(), |
| 381 | | // /// Tracks registers which are locked from being allocated |
| 382 | | // locked_registers: RegisterBitSet = RegisterBitSet.initEmpty(), |
| 383 | | |
| 384 | | // const Self = @This(); |
| 385 | | |
| 386 | | // pub const RegisterBitSet = StaticBitSet(tracked_registers.len); |
| 387 | | |
| 388 | | // fn getFunction(self: *Self) *Function { |
| 389 | | // return @fieldParentPtr(Function, "register_manager", self); |
| 390 | | // } |
| 391 | | |
| 392 | | // fn excludeRegister(reg: Register, register_class: RegisterBitSet) bool { |
| 393 | | // const index = indexOfRegIntoTracked(reg) orelse return true; |
| 394 | | // return !register_class.isSet(index); |
| 395 | | // } |
| 396 | | |
| 397 | | // fn markRegAllocated(self: *Self, reg: Register) void { |
| 398 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 399 | | // self.allocated_registers.set(index); |
| 400 | | // } |
| 401 | | |
| 402 | | // fn markRegUsed(self: *Self, reg: Register) void { |
| 403 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 404 | | // self.free_registers.unset(index); |
| 405 | | // } |
| 406 | | |
| 407 | | // fn markRegFree(self: *Self, reg: Register) void { |
| 408 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 409 | | // self.free_registers.set(index); |
| 410 | | // } |
| 411 | | |
| 412 | | // pub fn indexOfReg( |
| 413 | | // comptime registers: []const Register, |
| 414 | | // reg: Register, |
| 415 | | // ) ?std.math.IntFittingRange(0, registers.len - 1) { |
| 416 | | // inline for (tracked_registers) |cpreg, i| { |
| 417 | | // if (reg.id() == cpreg.id()) return i; |
| 418 | | // } |
| 419 | | // return null; |
| 420 | | // } |
| 421 | | |
| 422 | | // pub fn indexOfRegIntoTracked(reg: Register) ?RegisterBitSet.ShiftInt { |
| 423 | | // return indexOfReg(tracked_registers, reg); |
| 424 | | // } |
| 425 | | |
| 426 | | // /// Returns true when this register is not tracked |
| 427 | | // pub fn isRegFree(self: Self, reg: Register) bool { |
| 428 | | // const index = indexOfRegIntoTracked(reg) orelse return true; |
| 429 | | // return self.free_registers.isSet(index); |
| 430 | | // } |
| 431 | | |
| 432 | | // /// Returns whether this register was allocated in the course |
| 433 | | // /// of this function. |
| 434 | | // /// |
| 435 | | // /// Returns false when this register is not tracked |
| 436 | | // pub fn isRegAllocated(self: Self, reg: Register) bool { |
| 437 | | // const index = indexOfRegIntoTracked(reg) orelse return false; |
| 438 | | // return self.allocated_registers.isSet(index); |
| 439 | | // } |
| 440 | | |
| 441 | | // /// Returns whether this register is locked |
| 442 | | // /// |
| 443 | | // /// Returns false when this register is not tracked |
| 444 | | // pub fn isRegLocked(self: Self, reg: Register) bool { |
| 445 | | // const index = indexOfRegIntoTracked(reg) orelse return false; |
| 446 | | // return self.locked_registers.isSet(index); |
| 447 | | // } |
| 448 | | |
| 449 | | // pub const RegisterLock = struct { |
| 450 | | // register: Register, |
| 451 | | // }; |
| 452 | | |
| 453 | | // /// Prevents the register from being allocated until they are |
| 454 | | // /// unlocked again. |
| 455 | | // /// Returns `RegisterLock` if the register was not already |
| 456 | | // /// locked, or `null` otherwise. |
| 457 | | // /// Only the owner of the `RegisterLock` can unlock the |
| 458 | | // /// register later. |
| 459 | | // pub fn lockReg(self: *Self, reg: Register) ?RegisterLock { |
| 460 | | // log.debug("locking {}", .{reg}); |
| 461 | | // if (self.isRegLocked(reg)) { |
| 462 | | // log.debug(" register already locked", .{}); |
| 463 | | // return null; |
| 464 | | // } |
| 465 | | // const index = indexOfRegIntoTracked(reg) orelse return null; |
| 466 | | // self.locked_registers.set(index); |
| 467 | | // return RegisterLock{ .register = reg }; |
| 468 | | // } |
| 469 | | |
| 470 | | // /// Like `lockReg` but asserts the register was unused always |
| 471 | | // /// returning a valid lock. |
| 472 | | // pub fn lockRegAssumeUnused(self: *Self, reg: Register) RegisterLock { |
| 473 | | // log.debug("locking asserting free {}", .{reg}); |
| 474 | | // assert(!self.isRegLocked(reg)); |
| 475 | | // const index = indexOfRegIntoTracked(reg) orelse unreachable; |
| 476 | | // self.locked_registers.set(index); |
| 477 | | // return RegisterLock{ .register = reg }; |
| 478 | | // } |
| 479 | | |
| 480 | | // /// Like `lockRegAssumeUnused` but locks multiple registers. |
| 481 | | // pub fn lockRegsAssumeUnused( |
| 482 | | // self: *Self, |
| 483 | | // comptime count: comptime_int, |
| 484 | | // regs: [count]Register, |
| 485 | | // ) [count]RegisterLock { |
| 486 | | // var buf: [count]RegisterLock = undefined; |
| 487 | | // for (regs) |reg, i| { |
| 488 | | // buf[i] = self.lockRegAssumeUnused(reg); |
| 489 | | // } |
| 490 | | // return buf; |
| 491 | | // } |
| 492 | | |
| 493 | | // /// Unlocks the register allowing its re-allocation and re-use. |
| 494 | | // /// Requires `RegisterLock` to unlock a register. |
| 495 | | // /// Call `lockReg` to obtain the lock first. |
| 496 | | // pub fn unlockReg(self: *Self, lock: RegisterLock) void { |
| 497 | | // log.debug("unlocking {}", .{lock.register}); |
| 498 | | // const index = indexOfRegIntoTracked(lock.register) orelse return; |
| 499 | | // self.locked_registers.unset(index); |
| 500 | | // } |
| 501 | | |
| 502 | | // /// Returns true when at least one register is locked |
| 503 | | // pub fn lockedRegsExist(self: Self) bool { |
| 504 | | // return self.locked_registers.count() > 0; |
| 505 | | // } |
| 506 | | |
| 507 | | // /// Allocates a specified number of registers, optionally |
| 508 | | // /// tracking them. Returns `null` if not enough registers are |
| 509 | | // /// free. |
| 510 | | // pub fn tryAllocRegs( |
| 511 | | // self: *Self, |
| 512 | | // comptime count: comptime_int, |
| 513 | | // insts: [count]?Air.Inst.Index, |
| 514 | | // register_class: RegisterBitSet, |
| 515 | | // ) ?[count]Register { |
| 516 | | // comptime assert(count > 0 and count <= tracked_registers.len); |
| 517 | | |
| 518 | | // var free_and_not_locked_registers = self.free_registers; |
| 519 | | // free_and_not_locked_registers.setIntersection(register_class); |
| 520 | | |
| 521 | | // var unlocked_registers = self.locked_registers; |
| 522 | | // unlocked_registers.toggleAll(); |
| 523 | | |
| 524 | | // free_and_not_locked_registers.setIntersection(unlocked_registers); |
| 525 | | |
| 526 | | // if (free_and_not_locked_registers.count() < count) return null; |
| 527 | | |
| 528 | | // var regs: [count]Register = undefined; |
| 529 | | // var i: usize = 0; |
| 530 | | // for (tracked_registers) |reg| { |
| 531 | | // if (i >= count) break; |
| 532 | | // if (excludeRegister(reg, register_class)) continue; |
| 533 | | // if (self.isRegLocked(reg)) continue; |
| 534 | | // if (!self.isRegFree(reg)) continue; |
| 535 | | |
| 536 | | // regs[i] = reg; |
| 537 | | // i += 1; |
| 538 | | // } |
| 539 | | // assert(i == count); |
| 540 | | |
| 541 | | // for (regs) |reg, j| { |
| 542 | | // self.markRegAllocated(reg); |
| 543 | | |
| 544 | | // if (insts[j]) |inst| { |
| 545 | | // // Track the register |
| 546 | | // const index = indexOfRegIntoTracked(reg).?; // indexOfReg() on a callee-preserved reg should never return null |
| 547 | | // self.registers[index] = inst; |
| 548 | | // self.markRegUsed(reg); |
| 549 | | // } |
| 550 | | // } |
| 551 | | |
| 552 | | // return regs; |
| 553 | | // } |
| 554 | | |
| 555 | | // /// Allocates a register and optionally tracks it with a |
| 556 | | // /// corresponding instruction. Returns `null` if all registers |
| 557 | | // /// are allocated. |
| 558 | | // pub fn tryAllocReg(self: *Self, inst: ?Air.Inst.Index, register_class: RegisterBitSet) ?Register { |
| 559 | | // return if (tryAllocRegs(self, 1, .{inst}, register_class)) |regs| regs[0] else null; |
| 560 | | // } |
| 561 | | |
| 562 | | // /// Allocates a specified number of registers, optionally |
| 563 | | // /// tracking them. Asserts that count is not |
| 564 | | // /// larger than the total number of registers available. |
| 565 | | // pub fn allocRegs( |
| 566 | | // self: *Self, |
| 567 | | // comptime count: comptime_int, |
| 568 | | // insts: [count]?Air.Inst.Index, |
| 569 | | // register_class: RegisterBitSet, |
| 570 | | // ) AllocateRegistersError![count]Register { |
| 571 | | // comptime assert(count > 0 and count <= tracked_registers.len); |
| 572 | | |
| 573 | | // var locked_registers = self.locked_registers; |
| 574 | | // locked_registers.setIntersection(register_class); |
| 575 | | |
| 576 | | // if (count > register_class.count() - locked_registers.count()) return error.OutOfRegisters; |
| 577 | | |
| 578 | | // const result = self.tryAllocRegs(count, insts, register_class) orelse blk: { |
| 579 | | // // We'll take over the first count registers. Spill |
| 580 | | // // the instructions that were previously there to a |
| 581 | | // // stack allocations. |
| 582 | | // var regs: [count]Register = undefined; |
| 583 | | // var i: usize = 0; |
| 584 | | // for (tracked_registers) |reg| { |
| 585 | | // if (i >= count) break; |
| 586 | | // if (excludeRegister(reg, register_class)) break; |
| 587 | | // if (self.isRegLocked(reg)) continue; |
| 588 | | |
| 589 | | // regs[i] = reg; |
| 590 | | // self.markRegAllocated(reg); |
| 591 | | // const index = indexOfRegIntoTracked(reg).?; // indexOfReg() on a callee-preserved reg should never return null |
| 592 | | // if (insts[i]) |inst| { |
| 593 | | // // Track the register |
| 594 | | // if (self.isRegFree(reg)) { |
| 595 | | // self.markRegUsed(reg); |
| 596 | | // } else { |
| 597 | | // const spilled_inst = self.registers[index]; |
| 598 | | // try self.getFunction().spillInstruction(reg, spilled_inst); |
| 599 | | // } |
| 600 | | // self.registers[index] = inst; |
| 601 | | // } else { |
| 602 | | // // Don't track the register |
| 603 | | // if (!self.isRegFree(reg)) { |
| 604 | | // const spilled_inst = self.registers[index]; |
| 605 | | // try self.getFunction().spillInstruction(reg, spilled_inst); |
| 606 | | // self.freeReg(reg); |
| 607 | | // } |
| 608 | | // } |
| 609 | | |
| 610 | | // i += 1; |
| 611 | | // } |
| 612 | | |
| 613 | | // break :blk regs; |
| 614 | | // }; |
| 615 | | |
| 616 | | // log.debug("allocated registers {any} for insts {any}", .{ result, insts }); |
| 617 | | // return result; |
| 618 | | // } |
| 619 | | |
| 620 | | // /// Allocates a register and optionally tracks it with a |
| 621 | | // /// corresponding instruction. |
| 622 | | // pub fn allocReg( |
| 623 | | // self: *Self, |
| 624 | | // inst: ?Air.Inst.Index, |
| 625 | | // register_class: RegisterBitSet, |
| 626 | | // ) AllocateRegistersError!Register { |
| 627 | | // return (try self.allocRegs(1, .{inst}, register_class))[0]; |
| 628 | | // } |
| 629 | | |
| 630 | | // /// Spills the register if it is currently allocated. If a |
| 631 | | // /// corresponding instruction is passed, will also track this |
| 632 | | // /// register. |
| 633 | | // pub fn getReg(self: *Self, reg: Register, inst: ?Air.Inst.Index) AllocateRegistersError!void { |
| 634 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 635 | | // log.debug("getReg {} for inst {}", .{ reg, inst }); |
| 636 | | // self.markRegAllocated(reg); |
| 637 | | |
| 638 | | // if (inst) |tracked_inst| |
| 639 | | // if (!self.isRegFree(reg)) { |
| 640 | | // // Move the instruction that was previously there to a |
| 641 | | // // stack allocation. |
| 642 | | // const spilled_inst = self.registers[index]; |
| 643 | | // self.registers[index] = tracked_inst; |
| 644 | | // try self.getFunction().spillInstruction(reg, spilled_inst); |
| 645 | | // } else { |
| 646 | | // self.getRegAssumeFree(reg, tracked_inst); |
| 647 | | // } |
| 648 | | // else { |
| 649 | | // if (!self.isRegFree(reg)) { |
| 650 | | // // Move the instruction that was previously there to a |
| 651 | | // // stack allocation. |
| 652 | | // const spilled_inst = self.registers[index]; |
| 653 | | // try self.getFunction().spillInstruction(reg, spilled_inst); |
| 654 | | // self.freeReg(reg); |
| 655 | | // } |
| 656 | | // } |
| 657 | | // } |
| 658 | | |
| 659 | | // /// Allocates the specified register with the specified |
| 660 | | // /// instruction. Asserts that the register is free and no |
| 661 | | // /// spilling is necessary. |
| 662 | | // pub fn getRegAssumeFree(self: *Self, reg: Register, inst: Air.Inst.Index) void { |
| 663 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 664 | | // log.debug("getRegAssumeFree {} for inst {}", .{ reg, inst }); |
| 665 | | // self.markRegAllocated(reg); |
| 666 | | |
| 667 | | // assert(self.isRegFree(reg)); |
| 668 | | // self.registers[index] = inst; |
| 669 | | // self.markRegUsed(reg); |
| 670 | | // } |
| 671 | | |
| 672 | | // /// Marks the specified register as free |
| 673 | | // pub fn freeReg(self: *Self, reg: Register) void { |
| 674 | | // const index = indexOfRegIntoTracked(reg) orelse return; |
| 675 | | // log.debug("freeing register {}", .{reg}); |
| 676 | | |
| 677 | | // self.registers[index] = undefined; |
| 678 | | // self.markRegFree(reg); |
| 679 | | // } |
| 680 | | // }; |
| 681 | | //} |
| 682 | | |
| 683 | 351 | const MockRegister1 = enum(u2) { |
| 684 | 352 | r0, |
| 685 | 353 | r1, |
| ... | ... | @@ -698,7 +366,14 @@ const MockRegister1 = enum(u2) { |
| 698 | 366 | &MockRegister1.allocatable_registers, |
| 699 | 367 | ); |
| 700 | 368 | |
| 701 | | const gp: RM.RegisterBitSet = std.math.maxInt(RM.RegisterBitSet); |
| 369 | const gp: RM.RegisterBitSet = blk: { |
| 370 | var set = RM.RegisterBitSet.initEmpty(); |
| 371 | set.setRangeValue(.{ |
| 372 | .start = 0, |
| 373 | .end = allocatable_registers.len, |
| 374 | }, true); |
| 375 | break :blk set; |
| 376 | }; |
| 702 | 377 | }; |
| 703 | 378 | |
| 704 | 379 | const MockRegister2 = enum(u2) { |
| ... | ... | @@ -719,7 +394,14 @@ const MockRegister2 = enum(u2) { |
| 719 | 394 | &MockRegister2.allocatable_registers, |
| 720 | 395 | ); |
| 721 | 396 | |
| 722 | | const gp: RM.RegisterBitSet = std.math.maxInt(RM.RegisterBitSet); |
| 397 | const gp: RM.RegisterBitSet = blk: { |
| 398 | var set = RM.RegisterBitSet.initEmpty(); |
| 399 | set.setRangeValue(.{ |
| 400 | .start = 0, |
| 401 | .end = allocatable_registers.len, |
| 402 | }, true); |
| 403 | break :blk set; |
| 404 | }; |
| 723 | 405 | }; |
| 724 | 406 | |
| 725 | 407 | const MockRegister3 = enum(u3) { |
| ... | ... | @@ -753,11 +435,22 @@ const MockRegister3 = enum(u3) { |
| 753 | 435 | &MockRegister3.allocatable_registers, |
| 754 | 436 | ); |
| 755 | 437 | |
| 756 | | const gp: RM.RegisterBitSet = @as(RM.RegisterBitSet, std.math.maxInt(std.meta.Int( |
| 757 | | .unsigned, |
| 758 | | gp_regs.len, |
| 759 | | ))); |
| 760 | | const ext: RM.RegisterBitSet = std.math.maxInt(RM.RegisterBitSet) - gp; |
| 438 | const gp: RM.RegisterBitSet = blk: { |
| 439 | var set = RM.RegisterBitSet.initEmpty(); |
| 440 | set.setRangeValue(.{ |
| 441 | .start = 0, |
| 442 | .end = gp_regs.len, |
| 443 | }, true); |
| 444 | break :blk set; |
| 445 | }; |
| 446 | const ext: RM.RegisterBitSet = blk: { |
| 447 | var set = RM.RegisterBitSet.initEmpty(); |
| 448 | set.setRangeValue(.{ |
| 449 | .start = gp_regs.len, |
| 450 | .end = allocatable_registers.len, |
| 451 | }, true); |
| 452 | break :blk set; |
| 453 | }; |
| 761 | 454 | }; |
| 762 | 455 | |
| 763 | 456 | fn MockFunction(comptime Register: type) type { |
Jakub Konka <kubkon@jakubkonka.com> 2022-05-26 09:06:42+02:00