| author | |
| committer | |
| log | e95dfac03eea942b53bbdf6117a716aaeba5eb4b |
| tree | 528e33c135c69eedde5d209b55df88a0a36365cf |
| parent | f766b25f82a6c94d6b77f6a4172bfc4feb1d9271 |
10 files changed, 264 insertions(+), 170 deletions(-)
src/arch/aarch64/CodeGen.zig+31-31| ... | ... | @@ -21,9 +21,6 @@ const DW = std.dwarf; |
| 21 | 21 | const leb128 = std.leb; |
| 22 | 22 | const log = std.log.scoped(.codegen); |
| 23 | 23 | const build_options = @import("build_options"); |
| 24 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 25 | const RegisterManager = RegisterManagerFn(Self, Register, &callee_preserved_regs); | |
| 26 | const RegisterLock = RegisterManager.RegisterLock; | |
| 27 | 24 | |
| 28 | 25 | const GenerateSymbolError = @import("../../codegen.zig").GenerateSymbolError; |
| 29 | 26 | const FnResult = @import("../../codegen.zig").FnResult; |
| ... | ... | @@ -31,11 +28,14 @@ const DebugInfoOutput = @import("../../codegen.zig").DebugInfoOutput; |
| 31 | 28 | |
| 32 | 29 | const bits = @import("bits.zig"); |
| 33 | 30 | const abi = @import("abi.zig"); |
| 31 | const RegisterManager = abi.RegisterManager; | |
| 32 | const RegisterLock = RegisterManager.RegisterLock; | |
| 34 | 33 | const Register = bits.Register; |
| 35 | 34 | const Instruction = bits.Instruction; |
| 36 | 35 | const callee_preserved_regs = abi.callee_preserved_regs; |
| 37 | 36 | const c_abi_int_param_regs = abi.c_abi_int_param_regs; |
| 38 | 37 | const c_abi_int_return_regs = abi.c_abi_int_return_regs; |
| 38 | const gp = abi.RegisterClass.gp; | |
| 39 | 39 | |
| 40 | 40 | const InnerError = error{ |
| 41 | 41 | OutOfMemory, |
| ... | ... | @@ -888,7 +888,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 888 | 888 | if (reg_ok) { |
| 889 | 889 | // Make sure the type can fit in a register before we try to allocate one. |
| 890 | 890 | if (abi_size <= 8) { |
| 891 | if (self.register_manager.tryAllocReg(inst, .{})) |reg| { | |
| 891 | if (self.register_manager.tryAllocReg(inst, gp)) |reg| { | |
| 892 | 892 | return MCValue{ .register = registerAlias(reg, abi_size) }; |
| 893 | 893 | } |
| 894 | 894 | } |
| ... | ... | @@ -951,7 +951,7 @@ fn spillCompareFlagsIfOccupied(self: *Self) !void { |
| 951 | 951 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 952 | 952 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 953 | 953 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 954 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 954 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 955 | 955 | const reg = registerAlias(raw_reg, ty.abiSize(self.target.*)); |
| 956 | 956 | try self.genSetReg(ty, reg, mcv); |
| 957 | 957 | return reg; |
| ... | ... | @@ -961,7 +961,7 @@ fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 961 | 961 | /// `reg_owner` is the instruction that gets associated with the register in the register table. |
| 962 | 962 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 963 | 963 | fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { |
| 964 | const raw_reg = try self.register_manager.allocReg(reg_owner, .{}); | |
| 964 | const raw_reg = try self.register_manager.allocReg(reg_owner, gp); | |
| 965 | 965 | const ty = self.air.typeOfIndex(reg_owner); |
| 966 | 966 | const reg = registerAlias(raw_reg, ty.abiSize(self.target.*)); |
| 967 | 967 | try self.genSetReg(self.air.typeOfIndex(reg_owner), reg, mcv); |
| ... | ... | @@ -1074,11 +1074,11 @@ fn trunc( |
| 1074 | 1074 | if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { |
| 1075 | 1075 | break :blk registerAlias(operand_reg, dest_ty.abiSize(self.target.*)); |
| 1076 | 1076 | } else { |
| 1077 | const raw_reg = try self.register_manager.allocReg(inst, .{}); | |
| 1077 | const raw_reg = try self.register_manager.allocReg(inst, gp); | |
| 1078 | 1078 | break :blk registerAlias(raw_reg, dest_ty.abiSize(self.target.*)); |
| 1079 | 1079 | } |
| 1080 | 1080 | } else blk: { |
| 1081 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 1081 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 1082 | 1082 | break :blk registerAlias(raw_reg, dest_ty.abiSize(self.target.*)); |
| 1083 | 1083 | }; |
| 1084 | 1084 | |
| ... | ... | @@ -1160,7 +1160,7 @@ fn airNot(self: *Self, inst: Air.Inst.Index) !void { |
| 1160 | 1160 | break :blk op_reg; |
| 1161 | 1161 | } |
| 1162 | 1162 | |
| 1163 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 1163 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 1164 | 1164 | break :blk raw_reg.to32(); |
| 1165 | 1165 | }; |
| 1166 | 1166 | |
| ... | ... | @@ -1193,7 +1193,7 @@ fn airNot(self: *Self, inst: Air.Inst.Index) !void { |
| 1193 | 1193 | break :blk op_reg; |
| 1194 | 1194 | } |
| 1195 | 1195 | |
| 1196 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 1196 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 1197 | 1197 | break :blk registerAlias(raw_reg, operand_ty.abiSize(self.target.*)); |
| 1198 | 1198 | }; |
| 1199 | 1199 | |
| ... | ... | @@ -1293,7 +1293,7 @@ fn binOpRegister( |
| 1293 | 1293 | break :inst Air.refToIndex(md.lhs).?; |
| 1294 | 1294 | } else null; |
| 1295 | 1295 | |
| 1296 | const raw_reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1296 | const raw_reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1297 | 1297 | const reg = registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1298 | 1298 | |
| 1299 | 1299 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| ... | ... | @@ -1308,7 +1308,7 @@ fn binOpRegister( |
| 1308 | 1308 | break :inst Air.refToIndex(md.rhs).?; |
| 1309 | 1309 | } else null; |
| 1310 | 1310 | |
| 1311 | const raw_reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1311 | const raw_reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1312 | 1312 | const reg = registerAlias(raw_reg, rhs_ty.abiAlignment(self.target.*)); |
| 1313 | 1313 | |
| 1314 | 1314 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| ... | ... | @@ -1326,11 +1326,11 @@ fn binOpRegister( |
| 1326 | 1326 | } else if (rhs_is_register and self.reuseOperand(md.inst, md.rhs, 1, rhs)) { |
| 1327 | 1327 | break :blk rhs_reg; |
| 1328 | 1328 | } else { |
| 1329 | const raw_reg = try self.register_manager.allocReg(md.inst, .{}); | |
| 1329 | const raw_reg = try self.register_manager.allocReg(md.inst, gp); | |
| 1330 | 1330 | break :blk registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1331 | 1331 | } |
| 1332 | 1332 | } else blk: { |
| 1333 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 1333 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 1334 | 1334 | break :blk registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1335 | 1335 | }, |
| 1336 | 1336 | }; |
| ... | ... | @@ -1431,7 +1431,7 @@ fn binOpImmediate( |
| 1431 | 1431 | ).?; |
| 1432 | 1432 | } else null; |
| 1433 | 1433 | |
| 1434 | const raw_reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1434 | const raw_reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1435 | 1435 | const reg = registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1436 | 1436 | |
| 1437 | 1437 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| ... | ... | @@ -1452,11 +1452,11 @@ fn binOpImmediate( |
| 1452 | 1452 | )) { |
| 1453 | 1453 | break :blk lhs_reg; |
| 1454 | 1454 | } else { |
| 1455 | const raw_reg = try self.register_manager.allocReg(md.inst, .{}); | |
| 1455 | const raw_reg = try self.register_manager.allocReg(md.inst, gp); | |
| 1456 | 1456 | break :blk registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1457 | 1457 | } |
| 1458 | 1458 | } else blk: { |
| 1459 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 1459 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 1460 | 1460 | break :blk registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 1461 | 1461 | }, |
| 1462 | 1462 | }; |
| ... | ... | @@ -1872,7 +1872,7 @@ fn airOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1872 | 1872 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 1873 | 1873 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 1874 | 1874 | |
| 1875 | const raw_truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 1875 | const raw_truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 1876 | 1876 | const truncated_reg = registerAlias(raw_truncated_reg, lhs_ty.abiSize(self.target.*)); |
| 1877 | 1877 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 1878 | 1878 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| ... | ... | @@ -1983,7 +1983,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1983 | 1983 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 1984 | 1984 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 1985 | 1985 | |
| 1986 | const truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 1986 | const truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 1987 | 1987 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 1988 | 1988 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 1989 | 1989 | |
| ... | ... | @@ -2048,7 +2048,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2048 | 2048 | defer if (rhs_lock) |reg| self.register_manager.unlockReg(reg); |
| 2049 | 2049 | |
| 2050 | 2050 | const lhs_reg = if (lhs_is_register) lhs.register else blk: { |
| 2051 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 2051 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 2052 | 2052 | const reg = registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 2053 | 2053 | break :blk reg; |
| 2054 | 2054 | }; |
| ... | ... | @@ -2056,7 +2056,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2056 | 2056 | defer if (new_lhs_lock) |reg| self.register_manager.unlockReg(reg); |
| 2057 | 2057 | |
| 2058 | 2058 | const rhs_reg = if (rhs_is_register) rhs.register else blk: { |
| 2059 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 2059 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 2060 | 2060 | const reg = registerAlias(raw_reg, rhs_ty.abiAlignment(self.target.*)); |
| 2061 | 2061 | break :blk reg; |
| 2062 | 2062 | }; |
| ... | ... | @@ -2067,7 +2067,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2067 | 2067 | if (!rhs_is_register) try self.genSetReg(rhs_ty, rhs_reg, rhs); |
| 2068 | 2068 | |
| 2069 | 2069 | const dest_reg = blk: { |
| 2070 | const raw_reg = try self.register_manager.allocReg(null, .{}); | |
| 2070 | const raw_reg = try self.register_manager.allocReg(null, gp); | |
| 2071 | 2071 | const reg = registerAlias(raw_reg, lhs_ty.abiSize(self.target.*)); |
| 2072 | 2072 | break :blk reg; |
| 2073 | 2073 | }; |
| ... | ... | @@ -2086,7 +2086,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2086 | 2086 | } }, |
| 2087 | 2087 | }); |
| 2088 | 2088 | |
| 2089 | const dest_high_reg = try self.register_manager.allocReg(null, .{}); | |
| 2089 | const dest_high_reg = try self.register_manager.allocReg(null, gp); | |
| 2090 | 2090 | const dest_high_reg_lock = self.register_manager.lockRegAssumeUnused(dest_high_reg); |
| 2091 | 2091 | defer self.register_manager.unlockReg(dest_high_reg_lock); |
| 2092 | 2092 | |
| ... | ... | @@ -2136,7 +2136,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2136 | 2136 | } |
| 2137 | 2137 | }, |
| 2138 | 2138 | .unsigned => { |
| 2139 | const dest_high_reg = try self.register_manager.allocReg(null, .{}); | |
| 2139 | const dest_high_reg = try self.register_manager.allocReg(null, gp); | |
| 2140 | 2140 | const dest_high_reg_lock = self.register_manager.lockRegAssumeUnused(dest_high_reg); |
| 2141 | 2141 | defer self.register_manager.unlockReg(dest_high_reg_lock); |
| 2142 | 2142 | |
| ... | ... | @@ -2192,7 +2192,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 2192 | 2192 | }, |
| 2193 | 2193 | } |
| 2194 | 2194 | |
| 2195 | const truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 2195 | const truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 2196 | 2196 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 2197 | 2197 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 2198 | 2198 | |
| ... | ... | @@ -2663,7 +2663,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2663 | 2663 | }, |
| 2664 | 2664 | .stack_offset => |off| { |
| 2665 | 2665 | if (elem_size <= 8) { |
| 2666 | const raw_tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2666 | const raw_tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2667 | 2667 | const tmp_reg = registerAlias(raw_tmp_reg, elem_size); |
| 2668 | 2668 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2669 | 2669 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| ... | ... | @@ -2672,7 +2672,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2672 | 2672 | try self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }); |
| 2673 | 2673 | } else { |
| 2674 | 2674 | // TODO optimize the register allocation |
| 2675 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, .{}); | |
| 2675 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); | |
| 2676 | 2676 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 2677 | 2677 | defer for (regs_locks) |reg| { |
| 2678 | 2678 | self.register_manager.unlockReg(reg); |
| ... | ... | @@ -2887,7 +2887,7 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2887 | 2887 | }, |
| 2888 | 2888 | else => { |
| 2889 | 2889 | if (abi_size <= 8) { |
| 2890 | const raw_tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2890 | const raw_tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2891 | 2891 | const tmp_reg = registerAlias(raw_tmp_reg, abi_size); |
| 2892 | 2892 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2893 | 2893 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| ... | ... | @@ -3002,7 +3002,7 @@ fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) !void { |
| 3002 | 3002 | // TODO return special MCValue condition flags |
| 3003 | 3003 | // get overflow bit: set register to C flag |
| 3004 | 3004 | // resp. V flag |
| 3005 | const raw_dest_reg = try self.register_manager.allocReg(null, .{}); | |
| 3005 | const raw_dest_reg = try self.register_manager.allocReg(null, gp); | |
| 3006 | 3006 | const dest_reg = raw_dest_reg.to32(); |
| 3007 | 3007 | |
| 3008 | 3008 | // C flag: cset reg, cs |
| ... | ... | @@ -4065,7 +4065,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerErro |
| 4065 | 4065 | |
| 4066 | 4066 | const overflow_bit_ty = ty.structFieldType(1); |
| 4067 | 4067 | const overflow_bit_offset = @intCast(u32, ty.structFieldOffset(1, self.target.*)); |
| 4068 | const raw_cond_reg = try self.register_manager.allocReg(null, .{}); | |
| 4068 | const raw_cond_reg = try self.register_manager.allocReg(null, gp); | |
| 4069 | 4069 | const cond_reg = registerAlias( |
| 4070 | 4070 | raw_cond_reg, |
| 4071 | 4071 | @intCast(u32, overflow_bit_ty.abiSize(self.target.*)), |
| ... | ... | @@ -4113,7 +4113,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerErro |
| 4113 | 4113 | const ptr_ty = Type.initPayload(&ptr_ty_payload.base); |
| 4114 | 4114 | |
| 4115 | 4115 | // TODO call extern memcpy |
| 4116 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, .{}); | |
| 4116 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); | |
| 4117 | 4117 | const regs_locks = self.register_manager.lockRegsAssumeUnused(5, regs); |
| 4118 | 4118 | defer for (regs_locks) |reg| { |
| 4119 | 4119 | self.register_manager.unlockReg(reg); |
src/arch/aarch64/abi.zig+17| ... | ... | @@ -1,6 +1,7 @@ |
| 1 | 1 | const builtin = @import("builtin"); |
| 2 | 2 | const bits = @import("bits.zig"); |
| 3 | 3 | const Register = bits.Register; |
| 4 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 4 | 5 | |
| 5 | 6 | const callee_preserved_regs_impl = if (builtin.os.tag.isDarwin()) struct { |
| 6 | 7 | pub const callee_preserved_regs = [_]Register{ |
| ... | ... | @@ -18,3 +19,19 @@ pub const callee_preserved_regs = callee_preserved_regs_impl.callee_preserved_re |
| 18 | 19 | |
| 19 | 20 | pub const c_abi_int_param_regs = [_]Register{ .x0, .x1, .x2, .x3, .x4, .x5, .x6, .x7 }; |
| 20 | 21 | pub const c_abi_int_return_regs = [_]Register{ .x0, .x1, .x2, .x3, .x4, .x5, .x6, .x7 }; |
| 22 | ||
| 23 | const allocatable_registers = callee_preserved_regs; | |
| 24 | pub const RegisterManager = RegisterManagerFn(@import("CodeGen.zig"), Register, &allocatable_registers); | |
| 25 | ||
| 26 | // Register classes | |
| 27 | const RegisterBitSet = RegisterManager.RegisterBitSet; | |
| 28 | pub const RegisterClass = struct { | |
| 29 | pub const gp: RegisterBitSet = blk: { | |
| 30 | var set = RegisterBitSet.initEmpty(); | |
| 31 | set.setRangeValue(.{ | |
| 32 | .start = 0, | |
| 33 | .end = callee_preserved_regs.len, | |
| 34 | }, true); | |
| 35 | break :blk set; | |
| 36 | }; | |
| 37 | }; |
src/arch/arm/CodeGen.zig+35-36| ... | ... | @@ -21,9 +21,6 @@ const DW = std.dwarf; |
| 21 | 21 | const leb128 = std.leb; |
| 22 | 22 | const log = std.log.scoped(.codegen); |
| 23 | 23 | const build_options = @import("build_options"); |
| 24 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 25 | const RegisterManager = RegisterManagerFn(Self, Register, &allocatable_registers); | |
| 26 | const RegisterLock = RegisterManager.RegisterLock; | |
| 27 | 24 | |
| 28 | 25 | const FnResult = @import("../../codegen.zig").FnResult; |
| 29 | 26 | const GenerateSymbolError = @import("../../codegen.zig").GenerateSymbolError; |
| ... | ... | @@ -31,14 +28,16 @@ const DebugInfoOutput = @import("../../codegen.zig").DebugInfoOutput; |
| 31 | 28 | |
| 32 | 29 | const bits = @import("bits.zig"); |
| 33 | 30 | const abi = @import("abi.zig"); |
| 31 | const RegisterManager = abi.RegisterManager; | |
| 32 | const RegisterLock = RegisterManager.RegisterLock; | |
| 34 | 33 | const Register = bits.Register; |
| 35 | 34 | const Instruction = bits.Instruction; |
| 36 | 35 | const Condition = bits.Condition; |
| 37 | 36 | const callee_preserved_regs = abi.callee_preserved_regs; |
| 38 | 37 | const caller_preserved_regs = abi.caller_preserved_regs; |
| 39 | const allocatable_registers = abi.allocatable_registers; | |
| 40 | 38 | const c_abi_int_param_regs = abi.c_abi_int_param_regs; |
| 41 | 39 | const c_abi_int_return_regs = abi.c_abi_int_return_regs; |
| 40 | const gp = abi.RegisterClass.gp; | |
| 42 | 41 | |
| 43 | 42 | const InnerError = error{ |
| 44 | 43 | OutOfMemory, |
| ... | ... | @@ -874,7 +873,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 874 | 873 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| 875 | 874 | const ptr_bytes: u64 = @divExact(ptr_bits, 8); |
| 876 | 875 | if (abi_size <= ptr_bytes) { |
| 877 | if (self.register_manager.tryAllocReg(inst, .{})) |reg| { | |
| 876 | if (self.register_manager.tryAllocReg(inst, gp)) |reg| { | |
| 878 | 877 | return MCValue{ .register = reg }; |
| 879 | 878 | } |
| 880 | 879 | } |
| ... | ... | @@ -939,7 +938,7 @@ fn spillCompareFlagsIfOccupied(self: *Self) !void { |
| 939 | 938 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 940 | 939 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 941 | 940 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 942 | const reg = try self.register_manager.allocReg(null, .{}); | |
| 941 | const reg = try self.register_manager.allocReg(null, gp); | |
| 943 | 942 | try self.genSetReg(ty, reg, mcv); |
| 944 | 943 | return reg; |
| 945 | 944 | } |
| ... | ... | @@ -948,7 +947,7 @@ fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 948 | 947 | /// `reg_owner` is the instruction that gets associated with the register in the register table. |
| 949 | 948 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 950 | 949 | fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { |
| 951 | const reg = try self.register_manager.allocReg(reg_owner, .{}); | |
| 950 | const reg = try self.register_manager.allocReg(reg_owner, gp); | |
| 952 | 951 | try self.genSetReg(self.air.typeOfIndex(reg_owner), reg, mcv); |
| 953 | 952 | return MCValue{ .register = reg }; |
| 954 | 953 | } |
| ... | ... | @@ -1065,9 +1064,9 @@ fn trunc( |
| 1065 | 1064 | if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { |
| 1066 | 1065 | break :blk operand_reg; |
| 1067 | 1066 | } else { |
| 1068 | break :blk try self.register_manager.allocReg(inst, .{}); | |
| 1067 | break :blk try self.register_manager.allocReg(inst, gp); | |
| 1069 | 1068 | } |
| 1070 | } else try self.register_manager.allocReg(null, .{}); | |
| 1069 | } else try self.register_manager.allocReg(null, gp); | |
| 1071 | 1070 | |
| 1072 | 1071 | switch (info_b.bits) { |
| 1073 | 1072 | 32 => { |
| ... | ... | @@ -1153,7 +1152,7 @@ fn airNot(self: *Self, inst: Air.Inst.Index) !void { |
| 1153 | 1152 | break :blk op_reg; |
| 1154 | 1153 | } |
| 1155 | 1154 | |
| 1156 | break :blk try self.register_manager.allocReg(null, .{}); | |
| 1155 | break :blk try self.register_manager.allocReg(null, gp); | |
| 1157 | 1156 | }; |
| 1158 | 1157 | |
| 1159 | 1158 | _ = try self.addInst(.{ |
| ... | ... | @@ -1183,7 +1182,7 @@ fn airNot(self: *Self, inst: Air.Inst.Index) !void { |
| 1183 | 1182 | break :blk op_reg; |
| 1184 | 1183 | } |
| 1185 | 1184 | |
| 1186 | break :blk try self.register_manager.allocReg(null, .{}); | |
| 1185 | break :blk try self.register_manager.allocReg(null, gp); | |
| 1187 | 1186 | }; |
| 1188 | 1187 | |
| 1189 | 1188 | _ = try self.addInst(.{ |
| ... | ... | @@ -1254,9 +1253,9 @@ fn minMax( |
| 1254 | 1253 | } else if (rhs_is_register and self.reuseOperand(inst, bin_op.rhs, 1, rhs)) { |
| 1255 | 1254 | break :blk rhs_reg; |
| 1256 | 1255 | } else { |
| 1257 | break :blk try self.register_manager.allocReg(inst, .{}); | |
| 1256 | break :blk try self.register_manager.allocReg(inst, gp); | |
| 1258 | 1257 | } |
| 1259 | } else try self.register_manager.allocReg(null, .{}); | |
| 1258 | } else try self.register_manager.allocReg(null, gp); | |
| 1260 | 1259 | |
| 1261 | 1260 | // lhs == reg should have been checked by airMinMax |
| 1262 | 1261 | // |
| ... | ... | @@ -1438,7 +1437,7 @@ fn airOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1438 | 1437 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 1439 | 1438 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 1440 | 1439 | |
| 1441 | const truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 1440 | const truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 1442 | 1441 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 1443 | 1442 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 1444 | 1443 | |
| ... | ... | @@ -1543,7 +1542,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1543 | 1542 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 1544 | 1543 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 1545 | 1544 | |
| 1546 | const truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 1545 | const truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 1547 | 1546 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 1548 | 1547 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 1549 | 1548 | |
| ... | ... | @@ -1582,18 +1581,18 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1582 | 1581 | const lhs_reg = if (lhs_is_register) |
| 1583 | 1582 | lhs.register |
| 1584 | 1583 | else |
| 1585 | try self.register_manager.allocReg(null, .{}); | |
| 1584 | try self.register_manager.allocReg(null, gp); | |
| 1586 | 1585 | const new_lhs_lock = self.register_manager.lockReg(lhs_reg); |
| 1587 | 1586 | defer if (new_lhs_lock) |reg| self.register_manager.unlockReg(reg); |
| 1588 | 1587 | |
| 1589 | 1588 | const rhs_reg = if (rhs_is_register) |
| 1590 | 1589 | rhs.register |
| 1591 | 1590 | else |
| 1592 | try self.register_manager.allocReg(null, .{}); | |
| 1591 | try self.register_manager.allocReg(null, gp); | |
| 1593 | 1592 | const new_rhs_lock = self.register_manager.lockReg(rhs_reg); |
| 1594 | 1593 | defer if (new_rhs_lock) |reg| self.register_manager.unlockReg(reg); |
| 1595 | 1594 | |
| 1596 | const dest_regs = try self.register_manager.allocRegs(2, .{ null, null }, .{}); | |
| 1595 | const dest_regs = try self.register_manager.allocRegs(2, .{ null, null }, gp); | |
| 1597 | 1596 | const dest_regs_locks = self.register_manager.lockRegsAssumeUnused(2, dest_regs); |
| 1598 | 1597 | defer for (dest_regs_locks) |reg| { |
| 1599 | 1598 | self.register_manager.unlockReg(reg); |
| ... | ... | @@ -1604,7 +1603,7 @@ fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { |
| 1604 | 1603 | if (!lhs_is_register) try self.genSetReg(lhs_ty, lhs_reg, lhs); |
| 1605 | 1604 | if (!rhs_is_register) try self.genSetReg(rhs_ty, rhs_reg, rhs); |
| 1606 | 1605 | |
| 1607 | const truncated_reg = try self.register_manager.allocReg(null, .{}); | |
| 1606 | const truncated_reg = try self.register_manager.allocReg(null, gp); | |
| 1608 | 1607 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 1609 | 1608 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 1610 | 1609 | |
| ... | ... | @@ -2026,7 +2025,7 @@ fn airSliceElemVal(self: *Self, inst: Air.Inst.Index) !void { |
| 2026 | 2025 | const base_reg_lock = self.register_manager.lockRegAssumeUnused(base_reg); |
| 2027 | 2026 | defer self.register_manager.unlockReg(base_reg_lock); |
| 2028 | 2027 | |
| 2029 | const dst_reg = try self.register_manager.allocReg(inst, .{}); | |
| 2028 | const dst_reg = try self.register_manager.allocReg(inst, gp); | |
| 2030 | 2029 | const dst_mcv = MCValue{ .register = dst_reg }; |
| 2031 | 2030 | const dst_reg_lock = self.register_manager.lockRegAssumeUnused(dst_reg); |
| 2032 | 2031 | defer self.register_manager.unlockReg(dst_reg_lock); |
| ... | ... | @@ -2234,7 +2233,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2234 | 2233 | }, |
| 2235 | 2234 | .stack_offset => |off| { |
| 2236 | 2235 | if (elem_size <= 4) { |
| 2237 | const tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2236 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2238 | 2237 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2239 | 2238 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 2240 | 2239 | |
| ... | ... | @@ -2242,7 +2241,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2242 | 2241 | try self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }); |
| 2243 | 2242 | } else { |
| 2244 | 2243 | // TODO optimize the register allocation |
| 2245 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, .{}); | |
| 2244 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); | |
| 2246 | 2245 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 2247 | 2246 | defer for (regs_locks) |reg_locked| { |
| 2248 | 2247 | self.register_manager.unlockReg(reg_locked); |
| ... | ... | @@ -2271,7 +2270,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2271 | 2270 | .stack_offset, |
| 2272 | 2271 | .stack_argument_offset, |
| 2273 | 2272 | => { |
| 2274 | const reg = try self.register_manager.allocReg(null, .{}); | |
| 2273 | const reg = try self.register_manager.allocReg(null, gp); | |
| 2275 | 2274 | const reg_lock = self.register_manager.lockRegAssumeUnused(reg); |
| 2276 | 2275 | defer self.register_manager.unlockReg(reg_lock); |
| 2277 | 2276 | |
| ... | ... | @@ -2338,14 +2337,14 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2338 | 2337 | }, |
| 2339 | 2338 | else => { |
| 2340 | 2339 | if (elem_size <= 4) { |
| 2341 | const tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2340 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2342 | 2341 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2343 | 2342 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 2344 | 2343 | |
| 2345 | 2344 | try self.genSetReg(value_ty, tmp_reg, value); |
| 2346 | 2345 | try self.store(ptr, .{ .register = tmp_reg }, ptr_ty, value_ty); |
| 2347 | 2346 | } else { |
| 2348 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, .{}); | |
| 2347 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); | |
| 2349 | 2348 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 2350 | 2349 | defer for (regs_locks) |reg| { |
| 2351 | 2350 | self.register_manager.unlockReg(reg); |
| ... | ... | @@ -2487,7 +2486,7 @@ fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) !void { |
| 2487 | 2486 | 1 => { |
| 2488 | 2487 | // get overflow bit: set register to C flag |
| 2489 | 2488 | // resp. V flag |
| 2490 | const dest_reg = try self.register_manager.allocReg(null, .{}); | |
| 2489 | const dest_reg = try self.register_manager.allocReg(null, gp); | |
| 2491 | 2490 | |
| 2492 | 2491 | // mov reg, #0 |
| 2493 | 2492 | _ = try self.addInst(.{ |
| ... | ... | @@ -2567,7 +2566,7 @@ fn binOpRegister( |
| 2567 | 2566 | break :inst Air.refToIndex(md.lhs).?; |
| 2568 | 2567 | } else null; |
| 2569 | 2568 | |
| 2570 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 2569 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 2571 | 2570 | |
| 2572 | 2571 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 2573 | 2572 | |
| ... | ... | @@ -2581,7 +2580,7 @@ fn binOpRegister( |
| 2581 | 2580 | break :inst Air.refToIndex(md.rhs).?; |
| 2582 | 2581 | } else null; |
| 2583 | 2582 | |
| 2584 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 2583 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 2585 | 2584 | |
| 2586 | 2585 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 2587 | 2586 | |
| ... | ... | @@ -2598,9 +2597,9 @@ fn binOpRegister( |
| 2598 | 2597 | } else if (rhs_is_register and self.reuseOperand(md.inst, md.rhs, 1, rhs)) { |
| 2599 | 2598 | break :blk rhs_reg; |
| 2600 | 2599 | } else { |
| 2601 | break :blk try self.register_manager.allocReg(md.inst, .{}); | |
| 2600 | break :blk try self.register_manager.allocReg(md.inst, gp); | |
| 2602 | 2601 | } |
| 2603 | } else try self.register_manager.allocReg(null, .{}), | |
| 2602 | } else try self.register_manager.allocReg(null, gp), | |
| 2604 | 2603 | }; |
| 2605 | 2604 | |
| 2606 | 2605 | if (!lhs_is_register) try self.genSetReg(lhs_ty, lhs_reg, lhs); |
| ... | ... | @@ -2684,7 +2683,7 @@ fn binOpImmediate( |
| 2684 | 2683 | ).?; |
| 2685 | 2684 | } else null; |
| 2686 | 2685 | |
| 2687 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 2686 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 2688 | 2687 | |
| 2689 | 2688 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 2690 | 2689 | |
| ... | ... | @@ -2704,9 +2703,9 @@ fn binOpImmediate( |
| 2704 | 2703 | )) { |
| 2705 | 2704 | break :blk lhs_reg; |
| 2706 | 2705 | } else { |
| 2707 | break :blk try self.register_manager.allocReg(md.inst, .{}); | |
| 2706 | break :blk try self.register_manager.allocReg(md.inst, gp); | |
| 2708 | 2707 | } |
| 2709 | } else try self.register_manager.allocReg(null, .{}), | |
| 2708 | } else try self.register_manager.allocReg(null, gp), | |
| 2710 | 2709 | }; |
| 2711 | 2710 | |
| 2712 | 2711 | if (!lhs_is_register) try self.genSetReg(lhs_ty, lhs_reg, lhs); |
| ... | ... | @@ -4363,7 +4362,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerErro |
| 4363 | 4362 | |
| 4364 | 4363 | const overflow_bit_ty = ty.structFieldType(1); |
| 4365 | 4364 | const overflow_bit_offset = @intCast(u32, ty.structFieldOffset(1, self.target.*)); |
| 4366 | const cond_reg = try self.register_manager.allocReg(null, .{}); | |
| 4365 | const cond_reg = try self.register_manager.allocReg(null, gp); | |
| 4367 | 4366 | |
| 4368 | 4367 | // C flag: movcs reg, #1 |
| 4369 | 4368 | // V flag: movvs reg, #1 |
| ... | ... | @@ -4408,7 +4407,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerErro |
| 4408 | 4407 | const ptr_ty = Type.initPayload(&ptr_ty_payload.base); |
| 4409 | 4408 | |
| 4410 | 4409 | // TODO call extern memcpy |
| 4411 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, .{}); | |
| 4410 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); | |
| 4412 | 4411 | const src_reg = regs[0]; |
| 4413 | 4412 | const dst_reg = regs[1]; |
| 4414 | 4413 | const len_reg = regs[2]; |
| ... | ... | @@ -4782,7 +4781,7 @@ fn genSetStackArgument(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) I |
| 4782 | 4781 | const ptr_ty = Type.initPayload(&ptr_ty_payload.base); |
| 4783 | 4782 | |
| 4784 | 4783 | // TODO call extern memcpy |
| 4785 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, .{}); | |
| 4784 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); | |
| 4786 | 4785 | const src_reg = regs[0]; |
| 4787 | 4786 | const dst_reg = regs[1]; |
| 4788 | 4787 | const len_reg = regs[2]; |
src/arch/arm/abi.zig+17-1| ... | ... | @@ -1,9 +1,25 @@ |
| 1 | 1 | const bits = @import("bits.zig"); |
| 2 | 2 | const Register = bits.Register; |
| 3 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 3 | 4 | |
| 4 | 5 | pub const callee_preserved_regs = [_]Register{ .r4, .r5, .r6, .r7, .r8, .r10 }; |
| 5 | 6 | pub const caller_preserved_regs = [_]Register{ .r0, .r1, .r2, .r3 }; |
| 6 | pub const allocatable_registers = callee_preserved_regs ++ caller_preserved_regs; | |
| 7 | 7 | |
| 8 | 8 | pub const c_abi_int_param_regs = [_]Register{ .r0, .r1, .r2, .r3 }; |
| 9 | 9 | pub const c_abi_int_return_regs = [_]Register{ .r0, .r1 }; |
| 10 | ||
| 11 | const allocatable_registers = callee_preserved_regs ++ caller_preserved_regs; | |
| 12 | pub const RegisterManager = RegisterManagerFn(@import("CodeGen.zig"), Register, &allocatable_registers); | |
| 13 | ||
| 14 | // Register classes | |
| 15 | const RegisterBitSet = RegisterManager.RegisterBitSet; | |
| 16 | pub const RegisterClass = struct { | |
| 17 | pub const gp: RegisterBitSet = blk: { | |
| 18 | var set = RegisterBitSet.initEmpty(); | |
| 19 | set.setRangeValue(.{ | |
| 20 | .start = 0, | |
| 21 | .end = caller_preserved_regs.len + callee_preserved_regs.len, | |
| 22 | }, true); | |
| 23 | break :blk set; | |
| 24 | }; | |
| 25 | }; |
src/arch/riscv64/CodeGen.zig+11-11| ... | ... | @@ -21,9 +21,6 @@ const DW = std.dwarf; |
| 21 | 21 | const leb128 = std.leb; |
| 22 | 22 | const log = std.log.scoped(.codegen); |
| 23 | 23 | const build_options = @import("build_options"); |
| 24 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 25 | const RegisterManager = RegisterManagerFn(Self, Register, &callee_preserved_regs); | |
| 26 | const RegisterLock = RegisterManager.RegisterLock; | |
| 27 | 24 | |
| 28 | 25 | const FnResult = @import("../../codegen.zig").FnResult; |
| 29 | 26 | const GenerateSymbolError = @import("../../codegen.zig").GenerateSymbolError; |
| ... | ... | @@ -32,8 +29,11 @@ const DebugInfoOutput = @import("../../codegen.zig").DebugInfoOutput; |
| 32 | 29 | const bits = @import("bits.zig"); |
| 33 | 30 | const abi = @import("abi.zig"); |
| 34 | 31 | const Register = bits.Register; |
| 32 | const RegisterManager = abi.RegisterManager; | |
| 33 | const RegisterLock = RegisterManager.RegisterLock; | |
| 35 | 34 | const Instruction = abi.Instruction; |
| 36 | 35 | const callee_preserved_regs = abi.callee_preserved_regs; |
| 36 | const gp = abi.RegisterClass.gp; | |
| 37 | 37 | |
| 38 | 38 | const InnerError = error{ |
| 39 | 39 | OutOfMemory, |
| ... | ... | @@ -803,7 +803,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 803 | 803 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| 804 | 804 | const ptr_bytes: u64 = @divExact(ptr_bits, 8); |
| 805 | 805 | if (abi_size <= ptr_bytes) { |
| 806 | if (self.register_manager.tryAllocReg(inst, .{})) |reg| { | |
| 806 | if (self.register_manager.tryAllocReg(inst, gp)) |reg| { | |
| 807 | 807 | return MCValue{ .register = reg }; |
| 808 | 808 | } |
| 809 | 809 | } |
| ... | ... | @@ -826,7 +826,7 @@ pub fn spillInstruction(self: *Self, reg: Register, inst: Air.Inst.Index) !void |
| 826 | 826 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 827 | 827 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 828 | 828 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 829 | const reg = try self.register_manager.allocReg(null, .{}); | |
| 829 | const reg = try self.register_manager.allocReg(null, gp); | |
| 830 | 830 | try self.genSetReg(ty, reg, mcv); |
| 831 | 831 | return reg; |
| 832 | 832 | } |
| ... | ... | @@ -835,7 +835,7 @@ fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 835 | 835 | /// `reg_owner` is the instruction that gets associated with the register in the register table. |
| 836 | 836 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 837 | 837 | fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { |
| 838 | const reg = try self.register_manager.allocReg(reg_owner, .{}); | |
| 838 | const reg = try self.register_manager.allocReg(reg_owner, gp); | |
| 839 | 839 | try self.genSetReg(self.air.typeOfIndex(reg_owner), reg, mcv); |
| 840 | 840 | return MCValue{ .register = reg }; |
| 841 | 841 | } |
| ... | ... | @@ -958,7 +958,7 @@ fn binOpRegister( |
| 958 | 958 | break :inst Air.refToIndex(bin_op.lhs).?; |
| 959 | 959 | } else null; |
| 960 | 960 | |
| 961 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 961 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 962 | 962 | |
| 963 | 963 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 964 | 964 | |
| ... | ... | @@ -973,7 +973,7 @@ fn binOpRegister( |
| 973 | 973 | break :inst Air.refToIndex(bin_op.rhs).?; |
| 974 | 974 | } else null; |
| 975 | 975 | |
| 976 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 976 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 977 | 977 | |
| 978 | 978 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 979 | 979 | |
| ... | ... | @@ -990,9 +990,9 @@ fn binOpRegister( |
| 990 | 990 | } else if (rhs_is_register and self.reuseOperand(inst, bin_op.rhs, 1, rhs)) { |
| 991 | 991 | break :blk rhs_reg; |
| 992 | 992 | } else { |
| 993 | break :blk try self.register_manager.allocReg(inst, .{}); | |
| 993 | break :blk try self.register_manager.allocReg(inst, gp); | |
| 994 | 994 | } |
| 995 | } else try self.register_manager.allocReg(null, .{}); | |
| 995 | } else try self.register_manager.allocReg(null, gp); | |
| 996 | 996 | |
| 997 | 997 | if (!lhs_is_register) try self.genSetReg(lhs_ty, lhs_reg, lhs); |
| 998 | 998 | if (!rhs_is_register) try self.genSetReg(rhs_ty, rhs_reg, rhs); |
| ... | ... | @@ -1482,7 +1482,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 1482 | 1482 | .memory, |
| 1483 | 1483 | .stack_offset, |
| 1484 | 1484 | => { |
| 1485 | const reg = try self.register_manager.allocReg(null, .{}); | |
| 1485 | const reg = try self.register_manager.allocReg(null, gp); | |
| 1486 | 1486 | const reg_lock = self.register_manager.lockRegAssumeUnused(reg); |
| 1487 | 1487 | defer self.register_manager.unlockReg(reg_lock); |
| 1488 | 1488 |
src/arch/riscv64/abi.zig+17| ... | ... | @@ -1,6 +1,23 @@ |
| 1 | 1 | const bits = @import("bits.zig"); |
| 2 | 2 | const Register = bits.Register; |
| 3 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 3 | 4 | |
| 4 | 5 | pub const callee_preserved_regs = [_]Register{ |
| 5 | 6 | .s0, .s1, .s2, .s3, .s4, .s5, .s6, .s7, .s8, .s9, .s10, .s11, |
| 6 | 7 | }; |
| 8 | ||
| 9 | const allocatable_registers = callee_preserved_regs; | |
| 10 | pub const RegisterManager = RegisterManagerFn(@import("CodeGen.zig"), Register, &allocatable_registers); | |
| 11 | ||
| 12 | // Register classes | |
| 13 | const RegisterBitSet = RegisterManager.RegisterBitSet; | |
| 14 | pub const RegisterClass = struct { | |
| 15 | pub const gp: RegisterBitSet = blk: { | |
| 16 | var set = RegisterBitSet.initEmpty(); | |
| 17 | set.setRangeValue(.{ | |
| 18 | .start = 0, | |
| 19 | .end = callee_preserved_regs.len, | |
| 20 | }, true); | |
| 21 | break :blk set; | |
| 22 | }; | |
| 23 | }; |
src/arch/sparc64/CodeGen.zig+16-16| ... | ... | @@ -21,9 +21,6 @@ const Type = @import("../../type.zig").Type; |
| 21 | 21 | const GenerateSymbolError = @import("../../codegen.zig").GenerateSymbolError; |
| 22 | 22 | const FnResult = @import("../../codegen.zig").FnResult; |
| 23 | 23 | const DebugInfoOutput = @import("../../codegen.zig").DebugInfoOutput; |
| 24 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 25 | const RegisterManager = RegisterManagerFn(Self, Register, &abi.allocatable_regs); | |
| 26 | const RegisterLock = RegisterManager.RegisterLock; | |
| 27 | 24 | |
| 28 | 25 | const build_options = @import("build_options"); |
| 29 | 26 | |
| ... | ... | @@ -31,7 +28,10 @@ const bits = @import("bits.zig"); |
| 31 | 28 | const abi = @import("abi.zig"); |
| 32 | 29 | const Instruction = bits.Instruction; |
| 33 | 30 | const ShiftWidth = Instruction.ShiftWidth; |
| 31 | const RegisterManager = abi.RegisterManager; | |
| 32 | const RegisterLock = RegisterManager.RegisterLock; | |
| 34 | 33 | const Register = bits.Register; |
| 34 | const gp = abi.RegisterClass.gp; | |
| 35 | 35 | |
| 36 | 36 | const Self = @This(); |
| 37 | 37 | |
| ... | ... | @@ -1613,7 +1613,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 1613 | 1613 | if (reg_ok) { |
| 1614 | 1614 | // Make sure the type can fit in a register before we try to allocate one. |
| 1615 | 1615 | if (abi_size <= 8) { |
| 1616 | if (self.register_manager.tryAllocReg(inst, .{})) |reg| { | |
| 1616 | if (self.register_manager.tryAllocReg(inst, gp)) |reg| { | |
| 1617 | 1617 | return MCValue{ .register = reg }; |
| 1618 | 1618 | } |
| 1619 | 1619 | } |
| ... | ... | @@ -1854,7 +1854,7 @@ fn binOpImmediate( |
| 1854 | 1854 | ).?; |
| 1855 | 1855 | } else null; |
| 1856 | 1856 | |
| 1857 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1857 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1858 | 1858 | |
| 1859 | 1859 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 1860 | 1860 | |
| ... | ... | @@ -1873,10 +1873,10 @@ fn binOpImmediate( |
| 1873 | 1873 | )) { |
| 1874 | 1874 | break :blk lhs_reg; |
| 1875 | 1875 | } else { |
| 1876 | break :blk try self.register_manager.allocReg(md.inst, .{}); | |
| 1876 | break :blk try self.register_manager.allocReg(md.inst, gp); | |
| 1877 | 1877 | } |
| 1878 | 1878 | } else blk: { |
| 1879 | break :blk try self.register_manager.allocReg(null, .{}); | |
| 1879 | break :blk try self.register_manager.allocReg(null, gp); | |
| 1880 | 1880 | }, |
| 1881 | 1881 | }; |
| 1882 | 1882 | |
| ... | ... | @@ -1953,7 +1953,7 @@ fn binOpRegister( |
| 1953 | 1953 | break :inst Air.refToIndex(md.lhs).?; |
| 1954 | 1954 | } else null; |
| 1955 | 1955 | |
| 1956 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1956 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1957 | 1957 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 1958 | 1958 | |
| 1959 | 1959 | break :blk reg; |
| ... | ... | @@ -1966,7 +1966,7 @@ fn binOpRegister( |
| 1966 | 1966 | break :inst Air.refToIndex(md.rhs).?; |
| 1967 | 1967 | } else null; |
| 1968 | 1968 | |
| 1969 | const reg = try self.register_manager.allocReg(track_inst, .{}); | |
| 1969 | const reg = try self.register_manager.allocReg(track_inst, gp); | |
| 1970 | 1970 | if (track_inst) |inst| branch.inst_table.putAssumeCapacity(inst, .{ .register = reg }); |
| 1971 | 1971 | |
| 1972 | 1972 | break :blk reg; |
| ... | ... | @@ -1981,10 +1981,10 @@ fn binOpRegister( |
| 1981 | 1981 | } else if (rhs_is_register and self.reuseOperand(md.inst, md.rhs, 1, rhs)) { |
| 1982 | 1982 | break :blk rhs_reg; |
| 1983 | 1983 | } else { |
| 1984 | break :blk try self.register_manager.allocReg(md.inst, .{}); | |
| 1984 | break :blk try self.register_manager.allocReg(md.inst, gp); | |
| 1985 | 1985 | } |
| 1986 | 1986 | } else blk: { |
| 1987 | break :blk try self.register_manager.allocReg(null, .{}); | |
| 1987 | break :blk try self.register_manager.allocReg(null, gp); | |
| 1988 | 1988 | }, |
| 1989 | 1989 | }; |
| 1990 | 1990 | |
| ... | ... | @@ -2077,7 +2077,7 @@ fn brVoid(self: *Self, block: Air.Inst.Index) !void { |
| 2077 | 2077 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 2078 | 2078 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 2079 | 2079 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 2080 | const reg = try self.register_manager.allocReg(null, .{}); | |
| 2080 | const reg = try self.register_manager.allocReg(null, gp); | |
| 2081 | 2081 | try self.genSetReg(ty, reg, mcv); |
| 2082 | 2082 | return reg; |
| 2083 | 2083 | } |
| ... | ... | @@ -2364,7 +2364,7 @@ fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void |
| 2364 | 2364 | }); |
| 2365 | 2365 | } else { |
| 2366 | 2366 | // Need to allocate a temporary register to load 64-bit immediates. |
| 2367 | const tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2367 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2368 | 2368 | |
| 2369 | 2369 | try self.genSetReg(ty, tmp_reg, .{ .immediate = @truncate(u32, x) }); |
| 2370 | 2370 | try self.genSetReg(ty, reg, .{ .immediate = @truncate(u32, x >> 32) }); |
| ... | ... | @@ -2478,7 +2478,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerErro |
| 2478 | 2478 | }; |
| 2479 | 2479 | const ptr_ty = Type.initPayload(&ptr_ty_payload.base); |
| 2480 | 2480 | |
| 2481 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, .{}); | |
| 2481 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); | |
| 2482 | 2482 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 2483 | 2483 | defer for (regs_locks) |reg| { |
| 2484 | 2484 | self.register_manager.unlockReg(reg); |
| ... | ... | @@ -2717,14 +2717,14 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2717 | 2717 | }, |
| 2718 | 2718 | .stack_offset => |off| { |
| 2719 | 2719 | if (elem_size <= 8) { |
| 2720 | const tmp_reg = try self.register_manager.allocReg(null, .{}); | |
| 2720 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2721 | 2721 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2722 | 2722 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 2723 | 2723 | |
| 2724 | 2724 | try self.load(.{ .register = tmp_reg }, ptr, ptr_ty); |
| 2725 | 2725 | try self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }); |
| 2726 | 2726 | } else { |
| 2727 | const regs = try self.register_manager.allocRegs(3, .{ null, null, null }, .{}); | |
| 2727 | const regs = try self.register_manager.allocRegs(3, .{ null, null, null }, gp); | |
| 2728 | 2728 | const regs_locks = self.register_manager.lockRegsAssumeUnused(3, regs); |
| 2729 | 2729 | defer for (regs_locks) |reg| { |
| 2730 | 2730 | self.register_manager.unlockReg(reg); |
src/arch/sparc64/abi.zig+17-1| ... | ... | @@ -1,5 +1,6 @@ |
| 1 | 1 | const bits = @import("bits.zig"); |
| 2 | 2 | const Register = bits.Register; |
| 3 | const RegisterManagerFn = @import("../../register_manager.zig").RegisterManager; | |
| 3 | 4 | |
| 4 | 5 | // SPARCv9 stack constants. |
| 5 | 6 | // See: Registers and the Stack Frame, page 3P-8, SCD 2.4.1. |
| ... | ... | @@ -21,7 +22,7 @@ pub const stack_save_area = 176; |
| 21 | 22 | pub const caller_preserved_regs = [_]Register{ .o0, .o1, .o2, .o3, .o4, .o5, .g1, .g4, .g5 }; |
| 22 | 23 | |
| 23 | 24 | // Try to allocate i, l, o, then g sets of registers, in order of priority. |
| 24 | pub const allocatable_regs = [_]Register{ | |
| 25 | const allocatable_regs = [_]Register{ | |
| 25 | 26 | // zig fmt: off |
| 26 | 27 | .@"i0", .@"i1", .@"i2", .@"i3", .@"i4", .@"i5", |
| 27 | 28 | .l0, .l1, .l2, .l3, .l4, .l5, .l6, .l7, |
| ... | ... | @@ -35,3 +36,18 @@ pub const c_abi_int_param_regs_callee_view = [_]Register{ .@"i0", .@"i1", .@"i2" |
| 35 | 36 | |
| 36 | 37 | pub const c_abi_int_return_regs_caller_view = [_]Register{ .o0, .o1, .o2, .o3 }; |
| 37 | 38 | pub const c_abi_int_return_regs_callee_view = [_]Register{ .@"i0", .@"i1", .@"i2", .@"i3" }; |
| 39 | ||
| 40 | pub const RegisterManager = RegisterManagerFn(@import("CodeGen.zig"), Register, &allocatable_regs); | |
| 41 | ||
| 42 | // Register classes | |
| 43 | const RegisterBitSet = RegisterManager.RegisterBitSet; | |
| 44 | pub const RegisterClass = struct { | |
| 45 | pub const gp: RegisterBitSet = blk: { | |
| 46 | var set = RegisterBitSet.initEmpty(); | |
| 47 | set.setRangeValue(.{ | |
| 48 | .start = 0, | |
| 49 | .end = allocatable_regs.len, | |
| 50 | }, true); | |
| 51 | break :blk set; | |
| 52 | }; | |
| 53 | }; |
src/arch/x86_64/CodeGen.zig+23-41| ... | ... | @@ -884,9 +884,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 884 | 884 | if (self.intrinsicsAllowed(elem_ty)) { |
| 885 | 885 | const ptr_bytes: u64 = 32; |
| 886 | 886 | if (abi_size <= ptr_bytes) { |
| 887 | if (self.register_manager.tryAllocReg(inst, .{ | |
| 888 | .selector_mask = sse, | |
| 889 | })) |reg| { | |
| 887 | if (self.register_manager.tryAllocReg(inst, sse)) |reg| { | |
| 890 | 888 | return MCValue{ .register = registerAlias(reg, abi_size) }; |
| 891 | 889 | } |
| 892 | 890 | } |
| ... | ... | @@ -899,9 +897,7 @@ fn allocRegOrMem(self: *Self, inst: Air.Inst.Index, reg_ok: bool) !MCValue { |
| 899 | 897 | const ptr_bits = self.target.cpu.arch.ptrBitWidth(); |
| 900 | 898 | const ptr_bytes: u64 = @divExact(ptr_bits, 8); |
| 901 | 899 | if (abi_size <= ptr_bytes) { |
| 902 | if (self.register_manager.tryAllocReg(inst, .{ | |
| 903 | .selector_mask = gp, | |
| 904 | })) |reg| { | |
| 900 | if (self.register_manager.tryAllocReg(inst, gp)) |reg| { | |
| 905 | 901 | return MCValue{ .register = registerAlias(reg, abi_size) }; |
| 906 | 902 | } |
| 907 | 903 | } |
| ... | ... | @@ -972,16 +968,14 @@ pub fn spillRegisters(self: *Self, comptime count: comptime_int, registers: [cou |
| 972 | 968 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 973 | 969 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 974 | 970 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 975 | const mask: RegisterManager.RegisterBitSet = switch (ty.zigTypeTag()) { | |
| 971 | const reg_class: RegisterManager.RegisterBitSet = switch (ty.zigTypeTag()) { | |
| 976 | 972 | .Float => blk: { |
| 977 | 973 | if (self.intrinsicsAllowed(ty)) break :blk sse; |
| 978 | 974 | return self.fail("TODO copy {} to register", .{ty.fmtDebug()}); |
| 979 | 975 | }, |
| 980 | 976 | else => gp, |
| 981 | 977 | }; |
| 982 | const reg: Register = try self.register_manager.allocReg(null, .{ | |
| 983 | .selector_mask = mask, | |
| 984 | }); | |
| 978 | const reg: Register = try self.register_manager.allocReg(null, reg_class); | |
| 985 | 979 | try self.genSetReg(ty, reg, mcv); |
| 986 | 980 | return reg; |
| 987 | 981 | } |
| ... | ... | @@ -991,16 +985,14 @@ fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { |
| 991 | 985 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 992 | 986 | /// WARNING make sure that the allocated register matches the returned MCValue from an instruction! |
| 993 | 987 | fn copyToRegisterWithInstTracking(self: *Self, reg_owner: Air.Inst.Index, ty: Type, mcv: MCValue) !MCValue { |
| 994 | const mask: RegisterManager.RegisterBitSet = switch (ty.zigTypeTag()) { | |
| 988 | const reg_class: RegisterManager.RegisterBitSet = switch (ty.zigTypeTag()) { | |
| 995 | 989 | .Float => blk: { |
| 996 | 990 | if (self.intrinsicsAllowed(ty)) break :blk sse; |
| 997 | 991 | return self.fail("TODO copy {} to register", .{ty.fmtDebug()}); |
| 998 | 992 | }, |
| 999 | 993 | else => gp, |
| 1000 | 994 | }; |
| 1001 | const reg: Register = try self.register_manager.allocReg(reg_owner, .{ | |
| 1002 | .selector_mask = mask, | |
| 1003 | }); | |
| 995 | const reg: Register = try self.register_manager.allocReg(reg_owner, reg_class); | |
| 1004 | 996 | try self.genSetReg(ty, reg, mcv); |
| 1005 | 997 | return MCValue{ .register = reg }; |
| 1006 | 998 | } |
| ... | ... | @@ -1056,9 +1048,7 @@ fn airIntCast(self: *Self, inst: Air.Inst.Index) !void { |
| 1056 | 1048 | }; |
| 1057 | 1049 | defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); |
| 1058 | 1050 | |
| 1059 | const reg = try self.register_manager.allocReg(inst, .{ | |
| 1060 | .selector_mask = gp, | |
| 1061 | }); | |
| 1051 | const reg = try self.register_manager.allocReg(inst, gp); | |
| 1062 | 1052 | try self.genSetReg(dest_ty, reg, .{ .immediate = 0 }); |
| 1063 | 1053 | try self.genSetReg(operand_ty, reg, operand); |
| 1064 | 1054 | break :blk MCValue{ .register = reg }; |
| ... | ... | @@ -1413,9 +1403,7 @@ fn genSetStackTruncatedOverflowCompare( |
| 1413 | 1403 | .unsigned => ty, |
| 1414 | 1404 | }; |
| 1415 | 1405 | |
| 1416 | const temp_regs = try self.register_manager.allocRegs(3, .{ null, null, null }, .{ | |
| 1417 | .selector_mask = gp, | |
| 1418 | }); | |
| 1406 | const temp_regs = try self.register_manager.allocRegs(3, .{ null, null, null }, gp); | |
| 1419 | 1407 | const temp_regs_locks = self.register_manager.lockRegsAssumeUnused(3, temp_regs); |
| 1420 | 1408 | defer for (temp_regs_locks) |rreg| { |
| 1421 | 1409 | self.register_manager.unlockReg(rreg); |
| ... | ... | @@ -2077,9 +2065,7 @@ fn genSliceElemPtr(self: *Self, lhs: Air.Inst.Ref, rhs: Air.Inst.Ref) !MCValue { |
| 2077 | 2065 | const offset_reg_lock = self.register_manager.lockRegAssumeUnused(offset_reg); |
| 2078 | 2066 | defer self.register_manager.unlockReg(offset_reg_lock); |
| 2079 | 2067 | |
| 2080 | const addr_reg = try self.register_manager.allocReg(null, .{ | |
| 2081 | .selector_mask = gp, | |
| 2082 | }); | |
| 2068 | const addr_reg = try self.register_manager.allocReg(null, gp); | |
| 2083 | 2069 | switch (slice_mcv) { |
| 2084 | 2070 | .stack_offset => |off| { |
| 2085 | 2071 | // mov reg, [rbp - 8] |
| ... | ... | @@ -2158,9 +2144,7 @@ fn airArrayElemVal(self: *Self, inst: Air.Inst.Index) !void { |
| 2158 | 2144 | const offset_reg_lock = self.register_manager.lockRegAssumeUnused(offset_reg); |
| 2159 | 2145 | defer self.register_manager.unlockReg(offset_reg_lock); |
| 2160 | 2146 | |
| 2161 | const addr_reg = try self.register_manager.allocReg(null, .{ | |
| 2162 | .selector_mask = gp, | |
| 2163 | }); | |
| 2147 | const addr_reg = try self.register_manager.allocReg(null, gp); | |
| 2164 | 2148 | switch (array) { |
| 2165 | 2149 | .register => { |
| 2166 | 2150 | const off = @intCast(i32, try self.allocMem( |
| ... | ... | @@ -2527,7 +2511,7 @@ fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!vo |
| 2527 | 2511 | }, |
| 2528 | 2512 | .stack_offset => |off| { |
| 2529 | 2513 | if (abi_size <= 8) { |
| 2530 | const tmp_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 2514 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2531 | 2515 | try self.load(.{ .register = tmp_reg }, ptr, ptr_ty); |
| 2532 | 2516 | return self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }, .{}); |
| 2533 | 2517 | } |
| ... | ... | @@ -2728,7 +2712,7 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2728 | 2712 | }; |
| 2729 | 2713 | defer if (value_lock) |lock| self.register_manager.unlockReg(lock); |
| 2730 | 2714 | |
| 2731 | const addr_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 2715 | const addr_reg = try self.register_manager.allocReg(null, gp); | |
| 2732 | 2716 | const addr_reg_lock = self.register_manager.lockRegAssumeUnused(addr_reg); |
| 2733 | 2717 | defer self.register_manager.unlockReg(addr_reg_lock); |
| 2734 | 2718 | |
| ... | ... | @@ -2800,7 +2784,7 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2800 | 2784 | .memory, |
| 2801 | 2785 | => { |
| 2802 | 2786 | if (abi_size <= 8) { |
| 2803 | const tmp_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 2787 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 2804 | 2788 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 2805 | 2789 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 2806 | 2790 | |
| ... | ... | @@ -2918,7 +2902,7 @@ fn structFieldPtr(self: *Self, inst: Air.Inst.Index, operand: Air.Inst.Ref, inde |
| 2918 | 2902 | if (can_reuse_operand) { |
| 2919 | 2903 | break :blk reg; |
| 2920 | 2904 | } else { |
| 2921 | const result_reg = try self.register_manager.allocReg(inst, .{ .selector_mask = gp }); | |
| 2905 | const result_reg = try self.register_manager.allocReg(inst, gp); | |
| 2922 | 2906 | try self.genSetReg(ptr_ty, result_reg, mcv); |
| 2923 | 2907 | break :blk result_reg; |
| 2924 | 2908 | } |
| ... | ... | @@ -3019,7 +3003,7 @@ fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) !void { |
| 3019 | 3003 | const reg_lock = self.register_manager.lockRegAssumeUnused(reg); |
| 3020 | 3004 | defer self.register_manager.unlockReg(reg_lock); |
| 3021 | 3005 | |
| 3022 | const dst_reg = try self.register_manager.allocReg(inst, .{ .selector_mask = gp }); | |
| 3006 | const dst_reg = try self.register_manager.allocReg(inst, gp); | |
| 3023 | 3007 | const flags: u2 = switch (mcv) { |
| 3024 | 3008 | .register_overflow_unsigned => 0b10, |
| 3025 | 3009 | .register_overflow_signed => 0b00, |
| ... | ... | @@ -5428,7 +5412,7 @@ fn genSetStack(self: *Self, ty: Type, stack_offset: i32, mcv: MCValue, opts: Inl |
| 5428 | 5412 | |
| 5429 | 5413 | const overflow_bit_ty = ty.structFieldType(1); |
| 5430 | 5414 | const overflow_bit_offset = ty.structFieldOffset(1, self.target.*); |
| 5431 | const tmp_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 5415 | const tmp_reg = try self.register_manager.allocReg(null, gp); | |
| 5432 | 5416 | const flags: u2 = switch (mcv) { |
| 5433 | 5417 | .register_overflow_unsigned => 0b10, |
| 5434 | 5418 | .register_overflow_signed => 0b00, |
| ... | ... | @@ -5656,7 +5640,7 @@ fn genInlineMemcpy( |
| 5656 | 5640 | null; |
| 5657 | 5641 | defer if (dsbase_lock) |lock| self.register_manager.unlockReg(lock); |
| 5658 | 5642 | |
| 5659 | const dst_addr_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 5643 | const dst_addr_reg = try self.register_manager.allocReg(null, gp); | |
| 5660 | 5644 | switch (dst_ptr) { |
| 5661 | 5645 | .memory, |
| 5662 | 5646 | .got_load, |
| ... | ... | @@ -5691,7 +5675,7 @@ fn genInlineMemcpy( |
| 5691 | 5675 | const dst_addr_reg_lock = self.register_manager.lockRegAssumeUnused(dst_addr_reg); |
| 5692 | 5676 | defer self.register_manager.unlockReg(dst_addr_reg_lock); |
| 5693 | 5677 | |
| 5694 | const src_addr_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 5678 | const src_addr_reg = try self.register_manager.allocReg(null, gp); | |
| 5695 | 5679 | switch (src_ptr) { |
| 5696 | 5680 | .memory, |
| 5697 | 5681 | .got_load, |
| ... | ... | @@ -5726,9 +5710,7 @@ fn genInlineMemcpy( |
| 5726 | 5710 | const src_addr_reg_lock = self.register_manager.lockRegAssumeUnused(src_addr_reg); |
| 5727 | 5711 | defer self.register_manager.unlockReg(src_addr_reg_lock); |
| 5728 | 5712 | |
| 5729 | const regs = try self.register_manager.allocRegs(2, .{ null, null }, .{ | |
| 5730 | .selector_mask = gp, | |
| 5731 | }); | |
| 5713 | const regs = try self.register_manager.allocRegs(2, .{ null, null }, gp); | |
| 5732 | 5714 | const count_reg = regs[0].to64(); |
| 5733 | 5715 | const tmp_reg = regs[1].to8(); |
| 5734 | 5716 | |
| ... | ... | @@ -5828,7 +5810,7 @@ fn genInlineMemset( |
| 5828 | 5810 | const rax_lock = self.register_manager.lockRegAssumeUnused(.rax); |
| 5829 | 5811 | defer self.register_manager.unlockReg(rax_lock); |
| 5830 | 5812 | |
| 5831 | const addr_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 5813 | const addr_reg = try self.register_manager.allocReg(null, gp); | |
| 5832 | 5814 | switch (dst_ptr) { |
| 5833 | 5815 | .memory, |
| 5834 | 5816 | .got_load, |
| ... | ... | @@ -6087,7 +6069,7 @@ fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void |
| 6087 | 6069 | => { |
| 6088 | 6070 | switch (ty.zigTypeTag()) { |
| 6089 | 6071 | .Float => { |
| 6090 | const base_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 6072 | const base_reg = try self.register_manager.allocReg(null, gp); | |
| 6091 | 6073 | try self.loadMemPtrIntoRegister(base_reg, Type.usize, mcv); |
| 6092 | 6074 | |
| 6093 | 6075 | if (self.intrinsicsAllowed(ty)) { |
| ... | ... | @@ -6130,7 +6112,7 @@ fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void |
| 6130 | 6112 | }, |
| 6131 | 6113 | .memory => |x| switch (ty.zigTypeTag()) { |
| 6132 | 6114 | .Float => { |
| 6133 | const base_reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 6115 | const base_reg = try self.register_manager.allocReg(null, gp); | |
| 6134 | 6116 | try self.loadMemPtrIntoRegister(base_reg, Type.usize, mcv); |
| 6135 | 6117 | |
| 6136 | 6118 | if (self.intrinsicsAllowed(ty)) { |
| ... | ... | @@ -6461,7 +6443,7 @@ fn airMemcpy(self: *Self, inst: Air.Inst.Index) !void { |
| 6461 | 6443 | const src: MCValue = blk: { |
| 6462 | 6444 | switch (src_ptr) { |
| 6463 | 6445 | .got_load, .direct_load, .memory => { |
| 6464 | const reg = try self.register_manager.allocReg(null, .{ .selector_mask = gp }); | |
| 6446 | const reg = try self.register_manager.allocReg(null, gp); | |
| 6465 | 6447 | try self.loadMemPtrIntoRegister(reg, src_ty, src_ptr); |
| 6466 | 6448 | _ = try self.addInst(.{ |
| 6467 | 6449 | .tag = .mov, |
src/register_manager.zig+80-33| ... | ... | @@ -57,6 +57,11 @@ pub fn RegisterManager( |
| 57 | 57 | return @fieldParentPtr(Function, "register_manager", self); |
| 58 | 58 | } |
| 59 | 59 | |
| 60 | fn excludeRegister(reg: Register, register_class: RegisterBitSet) bool { | |
| 61 | const index = indexOfRegIntoTracked(reg) orelse return true; | |
| 62 | return !register_class.isSet(index); | |
| 63 | } | |
| 64 | ||
| 60 | 65 | fn markRegAllocated(self: *Self, reg: Register) void { |
| 61 | 66 | const index = indexOfRegIntoTracked(reg) orelse return; |
| 62 | 67 | self.allocated_registers.set(index); |
| ... | ... | @@ -167,10 +172,6 @@ pub fn RegisterManager( |
| 167 | 172 | return self.locked_registers.count() > 0; |
| 168 | 173 | } |
| 169 | 174 | |
| 170 | const AllocOpts = struct { | |
| 171 | selector_mask: ?RegisterBitSet = null, | |
| 172 | }; | |
| 173 | ||
| 174 | 175 | /// Allocates a specified number of registers, optionally |
| 175 | 176 | /// tracking them. Returns `null` if not enough registers are |
| 176 | 177 | /// free. |
| ... | ... | @@ -178,14 +179,12 @@ pub fn RegisterManager( |
| 178 | 179 | self: *Self, |
| 179 | 180 | comptime count: comptime_int, |
| 180 | 181 | insts: [count]?Air.Inst.Index, |
| 181 | opts: AllocOpts, | |
| 182 | register_class: RegisterBitSet, | |
| 182 | 183 | ) ?[count]Register { |
| 183 | 184 | comptime assert(count > 0 and count <= tracked_registers.len); |
| 184 | 185 | |
| 185 | const available_registers = opts.selector_mask orelse RegisterBitSet.initFull(); | |
| 186 | ||
| 187 | 186 | var free_and_not_locked_registers = self.free_registers; |
| 188 | free_and_not_locked_registers.setIntersection(available_registers); | |
| 187 | free_and_not_locked_registers.setIntersection(register_class); | |
| 189 | 188 | |
| 190 | 189 | var unlocked_registers = self.locked_registers; |
| 191 | 190 | unlocked_registers.toggleAll(); |
| ... | ... | @@ -198,6 +197,7 @@ pub fn RegisterManager( |
| 198 | 197 | var i: usize = 0; |
| 199 | 198 | for (tracked_registers) |reg| { |
| 200 | 199 | if (i >= count) break; |
| 200 | if (excludeRegister(reg, register_class)) continue; | |
| 201 | 201 | if (self.isRegLocked(reg)) continue; |
| 202 | 202 | if (!self.isRegFree(reg)) continue; |
| 203 | 203 | |
| ... | ... | @@ -223,8 +223,8 @@ pub fn RegisterManager( |
| 223 | 223 | /// Allocates a register and optionally tracks it with a |
| 224 | 224 | /// corresponding instruction. Returns `null` if all registers |
| 225 | 225 | /// are allocated. |
| 226 | pub fn tryAllocReg(self: *Self, inst: ?Air.Inst.Index, opts: AllocOpts) ?Register { | |
| 227 | return if (tryAllocRegs(self, 1, .{inst}, opts)) |regs| regs[0] else null; | |
| 226 | pub fn tryAllocReg(self: *Self, inst: ?Air.Inst.Index, register_class: RegisterBitSet) ?Register { | |
| 227 | return if (tryAllocRegs(self, 1, .{inst}, register_class)) |regs| regs[0] else null; | |
| 228 | 228 | } |
| 229 | 229 | |
| 230 | 230 | /// Allocates a specified number of registers, optionally |
| ... | ... | @@ -234,18 +234,16 @@ pub fn RegisterManager( |
| 234 | 234 | self: *Self, |
| 235 | 235 | comptime count: comptime_int, |
| 236 | 236 | insts: [count]?Air.Inst.Index, |
| 237 | opts: AllocOpts, | |
| 237 | register_class: RegisterBitSet, | |
| 238 | 238 | ) AllocateRegistersError![count]Register { |
| 239 | 239 | comptime assert(count > 0 and count <= tracked_registers.len); |
| 240 | 240 | |
| 241 | const available_registers = opts.selector_mask orelse RegisterBitSet.initFull(); | |
| 242 | ||
| 243 | 241 | var locked_registers = self.locked_registers; |
| 244 | locked_registers.setIntersection(available_registers); | |
| 242 | locked_registers.setIntersection(register_class); | |
| 245 | 243 | |
| 246 | if (count > available_registers.count() - locked_registers.count()) return error.OutOfRegisters; | |
| 244 | if (count > register_class.count() - locked_registers.count()) return error.OutOfRegisters; | |
| 247 | 245 | |
| 248 | const result = self.tryAllocRegs(count, insts, opts) orelse blk: { | |
| 246 | const result = self.tryAllocRegs(count, insts, register_class) orelse blk: { | |
| 249 | 247 | // We'll take over the first count registers. Spill |
| 250 | 248 | // the instructions that were previously there to a |
| 251 | 249 | // stack allocations. |
| ... | ... | @@ -253,6 +251,7 @@ pub fn RegisterManager( |
| 253 | 251 | var i: usize = 0; |
| 254 | 252 | for (tracked_registers) |reg| { |
| 255 | 253 | if (i >= count) break; |
| 254 | if (excludeRegister(reg, register_class)) continue; | |
| 256 | 255 | if (self.isRegLocked(reg)) continue; |
| 257 | 256 | |
| 258 | 257 | regs[i] = reg; |
| ... | ... | @@ -288,8 +287,12 @@ pub fn RegisterManager( |
| 288 | 287 | |
| 289 | 288 | /// Allocates a register and optionally tracks it with a |
| 290 | 289 | /// corresponding instruction. |
| 291 | pub fn allocReg(self: *Self, inst: ?Air.Inst.Index, opts: AllocOpts) AllocateRegistersError!Register { | |
| 292 | return (try self.allocRegs(1, .{inst}, opts))[0]; | |
| 290 | pub fn allocReg( | |
| 291 | self: *Self, | |
| 292 | inst: ?Air.Inst.Index, | |
| 293 | register_class: RegisterBitSet, | |
| 294 | ) AllocateRegistersError!Register { | |
| 295 | return (try self.allocRegs(1, .{inst}, register_class))[0]; | |
| 293 | 296 | } |
| 294 | 297 | |
| 295 | 298 | /// Spills the register if it is currently allocated. If a |
| ... | ... | @@ -374,11 +377,15 @@ const MockRegister2 = enum(u2) { |
| 374 | 377 | fn MockFunction(comptime Register: type) type { |
| 375 | 378 | return struct { |
| 376 | 379 | allocator: Allocator, |
| 377 | register_manager: RegisterManager(Self, Register, &Register.allocatable_registers) = .{}, | |
| 380 | register_manager: RegisterManagerT = .{}, | |
| 378 | 381 | spilled: std.ArrayListUnmanaged(Register) = .{}, |
| 379 | 382 | |
| 380 | 383 | const Self = @This(); |
| 381 | 384 | |
| 385 | const RegisterManagerT = RegisterManager(Self, Register, &Register.allocatable_registers); | |
| 386 | ||
| 387 | pub const reg_class: RegisterManagerT.RegisterBitSet = RegisterManagerT.RegisterBitSet.initFull(); | |
| 388 | ||
| 382 | 389 | pub fn deinit(self: *Self) void { |
| 383 | 390 | self.spilled.deinit(self.allocator); |
| 384 | 391 | } |
| ... | ... | @@ -423,10 +430,20 @@ test "tryAllocReg: no spilling" { |
| 423 | 430 | defer function.deinit(); |
| 424 | 431 | |
| 425 | 432 | const mock_instruction: Air.Inst.Index = 1; |
| 426 | ||
| 427 | try expectEqual(@as(?MockRegister1, .r2), function.register_manager.tryAllocReg(mock_instruction, .{})); | |
| 428 | try expectEqual(@as(?MockRegister1, .r3), function.register_manager.tryAllocReg(mock_instruction, .{})); | |
| 429 | try expectEqual(@as(?MockRegister1, null), function.register_manager.tryAllocReg(mock_instruction, .{})); | |
| 433 | const reg_class = MockFunction1.reg_class; | |
| 434 | ||
| 435 | try expectEqual(@as(?MockRegister1, .r2), function.register_manager.tryAllocReg( | |
| 436 | mock_instruction, | |
| 437 | reg_class, | |
| 438 | )); | |
| 439 | try expectEqual(@as(?MockRegister1, .r3), function.register_manager.tryAllocReg( | |
| 440 | mock_instruction, | |
| 441 | reg_class, | |
| 442 | )); | |
| 443 | try expectEqual(@as(?MockRegister1, null), function.register_manager.tryAllocReg( | |
| 444 | mock_instruction, | |
| 445 | reg_class, | |
| 446 | )); | |
| 430 | 447 | |
| 431 | 448 | try expect(function.register_manager.isRegAllocated(.r2)); |
| 432 | 449 | try expect(function.register_manager.isRegAllocated(.r3)); |
| ... | ... | @@ -451,17 +468,30 @@ test "allocReg: spilling" { |
| 451 | 468 | defer function.deinit(); |
| 452 | 469 | |
| 453 | 470 | const mock_instruction: Air.Inst.Index = 1; |
| 471 | const reg_class = MockFunction1.reg_class; | |
| 454 | 472 | |
| 455 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(mock_instruction, .{})); | |
| 456 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, .{})); | |
| 473 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg( | |
| 474 | mock_instruction, | |
| 475 | reg_class, | |
| 476 | )); | |
| 477 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg( | |
| 478 | mock_instruction, | |
| 479 | reg_class, | |
| 480 | )); | |
| 457 | 481 | |
| 458 | 482 | // Spill a register |
| 459 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg(mock_instruction, .{})); | |
| 483 | try expectEqual(@as(?MockRegister1, .r2), try function.register_manager.allocReg( | |
| 484 | mock_instruction, | |
| 485 | reg_class, | |
| 486 | )); | |
| 460 | 487 | try expectEqualSlices(MockRegister1, &[_]MockRegister1{.r2}, function.spilled.items); |
| 461 | 488 | |
| 462 | 489 | // No spilling necessary |
| 463 | 490 | function.register_manager.freeReg(.r3); |
| 464 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, .{})); | |
| 491 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg( | |
| 492 | mock_instruction, | |
| 493 | reg_class, | |
| 494 | )); | |
| 465 | 495 | try expectEqualSlices(MockRegister1, &[_]MockRegister1{.r2}, function.spilled.items); |
| 466 | 496 | |
| 467 | 497 | // Locked registers |
| ... | ... | @@ -470,7 +500,10 @@ test "allocReg: spilling" { |
| 470 | 500 | const lock = function.register_manager.lockReg(.r2); |
| 471 | 501 | defer if (lock) |reg| function.register_manager.unlockReg(reg); |
| 472 | 502 | |
| 473 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg(mock_instruction, .{})); | |
| 503 | try expectEqual(@as(?MockRegister1, .r3), try function.register_manager.allocReg( | |
| 504 | mock_instruction, | |
| 505 | reg_class, | |
| 506 | )); | |
| 474 | 507 | } |
| 475 | 508 | try expect(!function.register_manager.lockedRegsExist()); |
| 476 | 509 | } |
| ... | ... | @@ -483,7 +516,13 @@ test "tryAllocRegs" { |
| 483 | 516 | }; |
| 484 | 517 | defer function.deinit(); |
| 485 | 518 | |
| 486 | try expectEqual([_]MockRegister2{ .r0, .r1, .r2 }, function.register_manager.tryAllocRegs(3, .{ null, null, null }, .{}).?); | |
| 519 | const reg_class = MockFunction2.reg_class; | |
| 520 | ||
| 521 | try expectEqual([_]MockRegister2{ .r0, .r1, .r2 }, function.register_manager.tryAllocRegs( | |
| 522 | 3, | |
| 523 | .{ null, null, null }, | |
| 524 | reg_class, | |
| 525 | ).?); | |
| 487 | 526 | |
| 488 | 527 | try expect(function.register_manager.isRegAllocated(.r0)); |
| 489 | 528 | try expect(function.register_manager.isRegAllocated(.r1)); |
| ... | ... | @@ -498,7 +537,11 @@ test "tryAllocRegs" { |
| 498 | 537 | const lock = function.register_manager.lockReg(.r1); |
| 499 | 538 | defer if (lock) |reg| function.register_manager.unlockReg(reg); |
| 500 | 539 | |
| 501 | try expectEqual([_]MockRegister2{ .r0, .r2, .r3 }, function.register_manager.tryAllocRegs(3, .{ null, null, null }, .{}).?); | |
| 540 | try expectEqual([_]MockRegister2{ .r0, .r2, .r3 }, function.register_manager.tryAllocRegs( | |
| 541 | 3, | |
| 542 | .{ null, null, null }, | |
| 543 | reg_class, | |
| 544 | ).?); | |
| 502 | 545 | } |
| 503 | 546 | try expect(!function.register_manager.lockedRegsExist()); |
| 504 | 547 | |
| ... | ... | @@ -518,6 +561,8 @@ test "allocRegs: normal usage" { |
| 518 | 561 | }; |
| 519 | 562 | defer function.deinit(); |
| 520 | 563 | |
| 564 | const reg_class = MockFunction2.reg_class; | |
| 565 | ||
| 521 | 566 | { |
| 522 | 567 | const result_reg: MockRegister2 = .r1; |
| 523 | 568 | |
| ... | ... | @@ -537,7 +582,7 @@ test "allocRegs: normal usage" { |
| 537 | 582 | const lock = function.register_manager.lockReg(result_reg); |
| 538 | 583 | defer if (lock) |reg| function.register_manager.unlockReg(reg); |
| 539 | 584 | |
| 540 | const regs = try function.register_manager.allocRegs(2, .{ null, null }, .{}); | |
| 585 | const regs = try function.register_manager.allocRegs(2, .{ null, null }, reg_class); | |
| 541 | 586 | try function.genAdd(result_reg, regs[0], regs[1]); |
| 542 | 587 | } |
| 543 | 588 | } |
| ... | ... | @@ -552,6 +597,8 @@ test "allocRegs: selectively reducing register pressure" { |
| 552 | 597 | }; |
| 553 | 598 | defer function.deinit(); |
| 554 | 599 | |
| 600 | const reg_class = MockFunction2.reg_class; | |
| 601 | ||
| 555 | 602 | { |
| 556 | 603 | const result_reg: MockRegister2 = .r1; |
| 557 | 604 | |
| ... | ... | @@ -559,12 +606,12 @@ test "allocRegs: selectively reducing register pressure" { |
| 559 | 606 | |
| 560 | 607 | // Here, we don't defer unlock because we manually unlock |
| 561 | 608 | // after genAdd |
| 562 | const regs = try function.register_manager.allocRegs(2, .{ null, null }, .{}); | |
| 609 | const regs = try function.register_manager.allocRegs(2, .{ null, null }, reg_class); | |
| 563 | 610 | |
| 564 | 611 | try function.genAdd(result_reg, regs[0], regs[1]); |
| 565 | 612 | function.register_manager.unlockReg(lock.?); |
| 566 | 613 | |
| 567 | const extra_summand_reg = try function.register_manager.allocReg(null, .{}); | |
| 614 | const extra_summand_reg = try function.register_manager.allocReg(null, reg_class); | |
| 568 | 615 | try function.genAdd(result_reg, result_reg, extra_summand_reg); |
| 569 | 616 | } |
| 570 | 617 | } |