| ... | @@ -1,6401 +0,0 @@ |
| 1 | const std = @import("std"); |
| 2 | const builtin = @import("builtin"); |
| 3 | const mem = std.mem; |
| 4 | const math = std.math; |
| 5 | const assert = std.debug.assert; |
| 6 | const codegen = @import("../../codegen.zig"); |
| 7 | const Air = @import("../../Air.zig"); |
| 8 | const Mir = @import("Mir.zig"); |
| 9 | const Emit = @import("Emit.zig"); |
| 10 | const Type = @import("../../Type.zig"); |
| 11 | const Value = @import("../../Value.zig"); |
| 12 | const link = @import("../../link.zig"); |
| 13 | const Zcu = @import("../../Zcu.zig"); |
| 14 | const InternPool = @import("../../InternPool.zig"); |
| 15 | const Compilation = @import("../../Compilation.zig"); |
| 16 | const ErrorMsg = Zcu.ErrorMsg; |
| 17 | const Target = std.Target; |
| 18 | const Allocator = mem.Allocator; |
| 19 | const trace = @import("../../tracy.zig").trace; |
| 20 | const leb128 = std.leb; |
| 21 | const log = std.log.scoped(.codegen); |
| 22 | const build_options = @import("build_options"); |
| 23 | const Alignment = InternPool.Alignment; |
| 24 | |
| 25 | const CodeGenError = codegen.CodeGenError; |
| 26 | |
| 27 | const bits = @import("bits.zig"); |
| 28 | const abi = @import("abi.zig"); |
| 29 | const errUnionPayloadOffset = codegen.errUnionPayloadOffset; |
| 30 | const errUnionErrorOffset = codegen.errUnionErrorOffset; |
| 31 | const RegisterManager = abi.RegisterManager; |
| 32 | const RegisterLock = RegisterManager.RegisterLock; |
| 33 | const Register = bits.Register; |
| 34 | const Instruction = bits.Instruction; |
| 35 | const Condition = bits.Instruction.Condition; |
| 36 | const callee_preserved_regs = abi.callee_preserved_regs; |
| 37 | const c_abi_int_param_regs = abi.c_abi_int_param_regs; |
| 38 | const c_abi_int_return_regs = abi.c_abi_int_return_regs; |
| 39 | const gp = abi.RegisterClass.gp; |
| 40 | |
| 41 | const InnerError = CodeGenError || error{OutOfRegisters}; |
| 42 | |
| 43 | pub fn legalizeFeatures(_: *const std.Target) ?*const Air.Legalize.Features { |
| 44 | return null; |
| 45 | } |
| 46 | |
| 47 | gpa: Allocator, |
| 48 | pt: Zcu.PerThread, |
| 49 | air: Air, |
| 50 | liveness: Air.Liveness, |
| 51 | bin_file: *link.File, |
| 52 | target: *const std.Target, |
| 53 | func_index: InternPool.Index, |
| 54 | owner_nav: InternPool.Nav.Index, |
| 55 | args: []MCValue, |
| 56 | ret_mcv: MCValue, |
| 57 | fn_type: Type, |
| 58 | arg_index: u32, |
| 59 | src_loc: Zcu.LazySrcLoc, |
| 60 | stack_align: u32, |
| 61 | |
| 62 | /// MIR Instructions |
| 63 | mir_instructions: std.MultiArrayList(Mir.Inst) = .{}, |
| 64 | /// MIR extra data |
| 65 | mir_extra: std.ArrayListUnmanaged(u32) = .empty, |
| 66 | |
| 67 | /// Byte offset within the source file of the ending curly. |
| 68 | end_di_line: u32, |
| 69 | end_di_column: u32, |
| 70 | |
| 71 | /// The value is an offset into the `Function` `code` from the beginning. |
| 72 | /// To perform the reloc, write 32-bit signed little-endian integer |
| 73 | /// which is a relative jump, based on the address following the reloc. |
| 74 | exitlude_jump_relocs: std.ArrayListUnmanaged(usize) = .empty, |
| 75 | |
| 76 | reused_operands: std.StaticBitSet(Air.Liveness.bpi - 1) = undefined, |
| 77 | |
| 78 | /// We postpone the creation of debug info for function args and locals |
| 79 | /// until after all Mir instructions have been generated. Only then we |
| 80 | /// will know saved_regs_stack_space which is necessary in order to |
| 81 | /// calculate the right stack offsest with respect to the `.fp` register. |
| 82 | dbg_info_relocs: std.ArrayListUnmanaged(DbgInfoReloc) = .empty, |
| 83 | |
| 84 | /// Whenever there is a runtime branch, we push a Branch onto this stack, |
| 85 | /// and pop it off when the runtime branch joins. This provides an "overlay" |
| 86 | /// of the table of mappings from instructions to `MCValue` from within the branch. |
| 87 | /// This way we can modify the `MCValue` for an instruction in different ways |
| 88 | /// within different branches. Special consideration is needed when a branch |
| 89 | /// joins with its parent, to make sure all instructions have the same MCValue |
| 90 | /// across each runtime branch upon joining. |
| 91 | branch_stack: *std.ArrayList(Branch), |
| 92 | |
| 93 | // Key is the block instruction |
| 94 | blocks: std.AutoHashMapUnmanaged(Air.Inst.Index, BlockData) = .empty, |
| 95 | |
| 96 | register_manager: RegisterManager = .{}, |
| 97 | /// Maps offset to what is stored there. |
| 98 | stack: std.AutoHashMapUnmanaged(u32, StackAllocation) = .empty, |
| 99 | /// Tracks the current instruction allocated to the compare flags |
| 100 | compare_flags_inst: ?Air.Inst.Index = null, |
| 101 | |
| 102 | /// Offset from the stack base, representing the end of the stack frame. |
| 103 | max_end_stack: u32 = 0, |
| 104 | /// Represents the current end stack offset. If there is no existing slot |
| 105 | /// to place a new stack allocation, it goes here, and then bumps `max_end_stack`. |
| 106 | next_stack_offset: u32 = 0, |
| 107 | |
| 108 | saved_regs_stack_space: u32 = 0, |
| 109 | |
| 110 | /// Debug field, used to find bugs in the compiler. |
| 111 | air_bookkeeping: @TypeOf(air_bookkeeping_init) = air_bookkeeping_init, |
| 112 | |
| 113 | const air_bookkeeping_init = if (std.debug.runtime_safety) @as(usize, 0) else {}; |
| 114 | |
| 115 | const MCValue = union(enum) { |
| 116 | /// No runtime bits. `void` types, empty structs, u0, enums with 1 |
| 117 | /// tag, etc. |
| 118 | /// |
| 119 | /// TODO Look into deleting this tag and using `dead` instead, |
| 120 | /// since every use of MCValue.none should be instead looking at |
| 121 | /// the type and noticing it is 0 bits. |
| 122 | none, |
| 123 | /// Control flow will not allow this value to be observed. |
| 124 | unreach, |
| 125 | /// No more references to this value remain. |
| 126 | dead, |
| 127 | /// The value is undefined. |
| 128 | undef, |
| 129 | /// A pointer-sized integer that fits in a register. |
| 130 | /// |
| 131 | /// If the type is a pointer, this is the pointer address in |
| 132 | /// virtual address space. |
| 133 | immediate: u64, |
| 134 | /// The value is in a target-specific register. |
| 135 | register: Register, |
| 136 | /// The value is a tuple { wrapped: u32, overflow: u1 } where |
| 137 | /// wrapped is stored in the register and the overflow bit is |
| 138 | /// stored in the C (signed) or V (unsigned) flag of the CPSR. |
| 139 | /// |
| 140 | /// This MCValue is only generated by a add_with_overflow or |
| 141 | /// sub_with_overflow instruction operating on 32- or 64-bit values. |
| 142 | register_with_overflow: struct { reg: Register, flag: bits.Instruction.Condition }, |
| 143 | /// The value is in memory at a hard-coded address. |
| 144 | /// |
| 145 | /// If the type is a pointer, it means the pointer address is at |
| 146 | /// this memory location. |
| 147 | memory: u64, |
| 148 | /// The value is in memory but requires a linker relocation fixup. |
| 149 | linker_load: codegen.LinkerLoad, |
| 150 | /// The value is one of the stack variables. |
| 151 | /// |
| 152 | /// If the type is a pointer, it means the pointer address is in |
| 153 | /// the stack at this offset. |
| 154 | stack_offset: u32, |
| 155 | /// The value is a pointer to one of the stack variables (payload |
| 156 | /// is stack offset). |
| 157 | ptr_stack_offset: u32, |
| 158 | /// The value resides in the N, Z, C, V flags. The value is 1 (if |
| 159 | /// the type is u1) or true (if the type in bool) iff the |
| 160 | /// specified condition is true. |
| 161 | compare_flags: Condition, |
| 162 | /// The value is a function argument passed via the stack. |
| 163 | stack_argument_offset: u32, |
| 164 | }; |
| 165 | |
| 166 | const DbgInfoReloc = struct { |
| 167 | tag: Air.Inst.Tag, |
| 168 | ty: Type, |
| 169 | name: [:0]const u8, |
| 170 | mcv: MCValue, |
| 171 | |
| 172 | fn genDbgInfo(reloc: DbgInfoReloc, function: Self) !void { |
| 173 | switch (reloc.tag) { |
| 174 | .arg, |
| 175 | .dbg_arg_inline, |
| 176 | => try reloc.genArgDbgInfo(function), |
| 177 | |
| 178 | .dbg_var_ptr, |
| 179 | .dbg_var_val, |
| 180 | => try reloc.genVarDbgInfo(function), |
| 181 | |
| 182 | else => unreachable, |
| 183 | } |
| 184 | } |
| 185 | |
| 186 | fn genArgDbgInfo(reloc: DbgInfoReloc, function: Self) !void { |
| 187 | // TODO: Add a pseudo-instruction or something to defer this work until Emit. |
| 188 | // We aren't allowed to interact with linker state here. |
| 189 | if (true) return; |
| 190 | switch (function.debug_output) { |
| 191 | .dwarf => |dw| { |
| 192 | const loc: link.File.Dwarf.Loc = switch (reloc.mcv) { |
| 193 | .register => |reg| .{ .reg = reg.dwarfNum() }, |
| 194 | .stack_offset, |
| 195 | .stack_argument_offset, |
| 196 | => |offset| blk: { |
| 197 | const adjusted_offset = switch (reloc.mcv) { |
| 198 | .stack_offset => -@as(i32, @intCast(offset)), |
| 199 | .stack_argument_offset => @as(i32, @intCast(function.saved_regs_stack_space + offset)), |
| 200 | else => unreachable, |
| 201 | }; |
| 202 | break :blk .{ .plus = .{ |
| 203 | &.{ .breg = Register.x29.dwarfNum() }, |
| 204 | &.{ .consts = adjusted_offset }, |
| 205 | } }; |
| 206 | }, |
| 207 | else => unreachable, // not a possible argument |
| 208 | |
| 209 | }; |
| 210 | try dw.genLocalDebugInfo(.local_arg, reloc.name, reloc.ty, loc); |
| 211 | }, |
| 212 | .plan9 => {}, |
| 213 | .none => {}, |
| 214 | } |
| 215 | } |
| 216 | |
| 217 | fn genVarDbgInfo(reloc: DbgInfoReloc, function: Self) !void { |
| 218 | // TODO: Add a pseudo-instruction or something to defer this work until Emit. |
| 219 | // We aren't allowed to interact with linker state here. |
| 220 | if (true) return; |
| 221 | switch (function.debug_output) { |
| 222 | .dwarf => |dwarf| { |
| 223 | const loc: link.File.Dwarf.Loc = switch (reloc.mcv) { |
| 224 | .register => |reg| .{ .reg = reg.dwarfNum() }, |
| 225 | .ptr_stack_offset, |
| 226 | .stack_offset, |
| 227 | .stack_argument_offset, |
| 228 | => |offset| blk: { |
| 229 | const adjusted_offset = switch (reloc.mcv) { |
| 230 | .ptr_stack_offset, |
| 231 | .stack_offset, |
| 232 | => -@as(i32, @intCast(offset)), |
| 233 | .stack_argument_offset => @as(i32, @intCast(function.saved_regs_stack_space + offset)), |
| 234 | else => unreachable, |
| 235 | }; |
| 236 | break :blk .{ .plus = .{ |
| 237 | &.{ .reg = Register.x29.dwarfNum() }, |
| 238 | &.{ .consts = adjusted_offset }, |
| 239 | } }; |
| 240 | }, |
| 241 | .memory => |address| .{ .constu = address }, |
| 242 | .immediate => |x| .{ .constu = x }, |
| 243 | .none => .empty, |
| 244 | else => blk: { |
| 245 | log.debug("TODO generate debug info for {}", .{reloc.mcv}); |
| 246 | break :blk .empty; |
| 247 | }, |
| 248 | }; |
| 249 | try dwarf.genLocalDebugInfo(.local_var, reloc.name, reloc.ty, loc); |
| 250 | }, |
| 251 | .plan9 => {}, |
| 252 | .none => {}, |
| 253 | } |
| 254 | } |
| 255 | }; |
| 256 | |
| 257 | const Branch = struct { |
| 258 | inst_table: std.AutoArrayHashMapUnmanaged(Air.Inst.Index, MCValue) = .empty, |
| 259 | |
| 260 | fn deinit(self: *Branch, gpa: Allocator) void { |
| 261 | self.inst_table.deinit(gpa); |
| 262 | self.* = undefined; |
| 263 | } |
| 264 | }; |
| 265 | |
| 266 | const StackAllocation = struct { |
| 267 | inst: Air.Inst.Index, |
| 268 | /// TODO do we need size? should be determined by inst.ty.abiSize() |
| 269 | size: u32, |
| 270 | }; |
| 271 | |
| 272 | const BlockData = struct { |
| 273 | relocs: std.ArrayListUnmanaged(Mir.Inst.Index), |
| 274 | /// The first break instruction encounters `null` here and chooses a |
| 275 | /// machine code value for the block result, populating this field. |
| 276 | /// Following break instructions encounter that value and use it for |
| 277 | /// the location to store their block results. |
| 278 | mcv: MCValue, |
| 279 | }; |
| 280 | |
| 281 | const BigTomb = struct { |
| 282 | function: *Self, |
| 283 | inst: Air.Inst.Index, |
| 284 | lbt: Air.Liveness.BigTomb, |
| 285 | |
| 286 | fn feed(bt: *BigTomb, op_ref: Air.Inst.Ref) void { |
| 287 | const dies = bt.lbt.feed(); |
| 288 | const op_index = op_ref.toIndex() orelse return; |
| 289 | if (!dies) return; |
| 290 | bt.function.processDeath(op_index); |
| 291 | } |
| 292 | |
| 293 | fn finishAir(bt: *BigTomb, result: MCValue) void { |
| 294 | const is_used = !bt.function.liveness.isUnused(bt.inst); |
| 295 | if (is_used) { |
| 296 | log.debug("%{d} => {}", .{ bt.inst, result }); |
| 297 | const branch = &bt.function.branch_stack.items[bt.function.branch_stack.items.len - 1]; |
| 298 | branch.inst_table.putAssumeCapacityNoClobber(bt.inst, result); |
| 299 | |
| 300 | switch (result) { |
| 301 | .register => |reg| { |
| 302 | // In some cases (such as bitcast), an operand |
| 303 | // may be the same MCValue as the result. If |
| 304 | // that operand died and was a register, it |
| 305 | // was freed by processDeath. We have to |
| 306 | // "re-allocate" the register. |
| 307 | if (bt.function.register_manager.isRegFree(reg)) { |
| 308 | bt.function.register_manager.getRegAssumeFree(reg, bt.inst); |
| 309 | } |
| 310 | }, |
| 311 | .register_with_overflow => |rwo| { |
| 312 | if (bt.function.register_manager.isRegFree(rwo.reg)) { |
| 313 | bt.function.register_manager.getRegAssumeFree(rwo.reg, bt.inst); |
| 314 | } |
| 315 | bt.function.compare_flags_inst = bt.inst; |
| 316 | }, |
| 317 | .compare_flags => |_| { |
| 318 | bt.function.compare_flags_inst = bt.inst; |
| 319 | }, |
| 320 | else => {}, |
| 321 | } |
| 322 | } |
| 323 | bt.function.finishAirBookkeeping(); |
| 324 | } |
| 325 | }; |
| 326 | |
| 327 | const Self = @This(); |
| 328 | |
| 329 | pub fn generate( |
| 330 | lf: *link.File, |
| 331 | pt: Zcu.PerThread, |
| 332 | src_loc: Zcu.LazySrcLoc, |
| 333 | func_index: InternPool.Index, |
| 334 | air: *const Air, |
| 335 | liveness: *const Air.Liveness, |
| 336 | ) CodeGenError!Mir { |
| 337 | const zcu = pt.zcu; |
| 338 | const gpa = zcu.gpa; |
| 339 | const func = zcu.funcInfo(func_index); |
| 340 | const fn_type = Type.fromInterned(func.ty); |
| 341 | const file_scope = zcu.navFileScope(func.owner_nav); |
| 342 | const target = &file_scope.mod.?.resolved_target.result; |
| 343 | |
| 344 | var branch_stack = std.ArrayList(Branch).init(gpa); |
| 345 | defer { |
| 346 | assert(branch_stack.items.len == 1); |
| 347 | branch_stack.items[0].deinit(gpa); |
| 348 | branch_stack.deinit(); |
| 349 | } |
| 350 | try branch_stack.append(.{}); |
| 351 | |
| 352 | var function: Self = .{ |
| 353 | .gpa = gpa, |
| 354 | .pt = pt, |
| 355 | .air = air.*, |
| 356 | .liveness = liveness.*, |
| 357 | .target = target, |
| 358 | .bin_file = lf, |
| 359 | .func_index = func_index, |
| 360 | .owner_nav = func.owner_nav, |
| 361 | .args = undefined, // populated after `resolveCallingConventionValues` |
| 362 | .ret_mcv = undefined, // populated after `resolveCallingConventionValues` |
| 363 | .fn_type = fn_type, |
| 364 | .arg_index = 0, |
| 365 | .branch_stack = &branch_stack, |
| 366 | .src_loc = src_loc, |
| 367 | .stack_align = undefined, |
| 368 | .end_di_line = func.rbrace_line, |
| 369 | .end_di_column = func.rbrace_column, |
| 370 | }; |
| 371 | defer function.stack.deinit(gpa); |
| 372 | defer function.blocks.deinit(gpa); |
| 373 | defer function.exitlude_jump_relocs.deinit(gpa); |
| 374 | defer function.dbg_info_relocs.deinit(gpa); |
| 375 | |
| 376 | var call_info = function.resolveCallingConventionValues(fn_type) catch |err| switch (err) { |
| 377 | error.CodegenFail => return error.CodegenFail, |
| 378 | else => |e| return e, |
| 379 | }; |
| 380 | defer call_info.deinit(&function); |
| 381 | |
| 382 | function.args = call_info.args; |
| 383 | function.ret_mcv = call_info.return_value; |
| 384 | function.stack_align = call_info.stack_align; |
| 385 | function.max_end_stack = call_info.stack_byte_count; |
| 386 | |
| 387 | function.gen() catch |err| switch (err) { |
| 388 | error.CodegenFail => return error.CodegenFail, |
| 389 | error.OutOfRegisters => return function.fail("ran out of registers (Zig compiler bug)", .{}), |
| 390 | else => |e| return e, |
| 391 | }; |
| 392 | |
| 393 | for (function.dbg_info_relocs.items) |reloc| { |
| 394 | reloc.genDbgInfo(function) catch |err| |
| 395 | return function.fail("failed to generate debug info: {s}", .{@errorName(err)}); |
| 396 | } |
| 397 | |
| 398 | var mir: Mir = .{ |
| 399 | .instructions = function.mir_instructions.toOwnedSlice(), |
| 400 | .extra = &.{}, // fallible, so assign after errdefer |
| 401 | .max_end_stack = function.max_end_stack, |
| 402 | .saved_regs_stack_space = function.saved_regs_stack_space, |
| 403 | }; |
| 404 | errdefer mir.deinit(gpa); |
| 405 | mir.extra = try function.mir_extra.toOwnedSlice(gpa); |
| 406 | return mir; |
| 407 | } |
| 408 | |
| 409 | fn addInst(self: *Self, inst: Mir.Inst) error{OutOfMemory}!Mir.Inst.Index { |
| 410 | const gpa = self.gpa; |
| 411 | |
| 412 | try self.mir_instructions.ensureUnusedCapacity(gpa, 1); |
| 413 | |
| 414 | const result_index: Mir.Inst.Index = @intCast(self.mir_instructions.len); |
| 415 | self.mir_instructions.appendAssumeCapacity(inst); |
| 416 | return result_index; |
| 417 | } |
| 418 | |
| 419 | fn addNop(self: *Self) error{OutOfMemory}!Mir.Inst.Index { |
| 420 | return try self.addInst(.{ |
| 421 | .tag = .nop, |
| 422 | .data = .{ .nop = {} }, |
| 423 | }); |
| 424 | } |
| 425 | |
| 426 | pub fn addExtra(self: *Self, extra: anytype) Allocator.Error!u32 { |
| 427 | const fields = std.meta.fields(@TypeOf(extra)); |
| 428 | try self.mir_extra.ensureUnusedCapacity(self.gpa, fields.len); |
| 429 | return self.addExtraAssumeCapacity(extra); |
| 430 | } |
| 431 | |
| 432 | pub fn addExtraAssumeCapacity(self: *Self, extra: anytype) u32 { |
| 433 | const fields = std.meta.fields(@TypeOf(extra)); |
| 434 | const result = @as(u32, @intCast(self.mir_extra.items.len)); |
| 435 | inline for (fields) |field| { |
| 436 | self.mir_extra.appendAssumeCapacity(switch (field.type) { |
| 437 | u32 => @field(extra, field.name), |
| 438 | i32 => @as(u32, @bitCast(@field(extra, field.name))), |
| 439 | else => @compileError("bad field type"), |
| 440 | }); |
| 441 | } |
| 442 | return result; |
| 443 | } |
| 444 | |
| 445 | fn gen(self: *Self) !void { |
| 446 | const pt = self.pt; |
| 447 | const zcu = pt.zcu; |
| 448 | const cc = self.fn_type.fnCallingConvention(zcu); |
| 449 | if (cc != .naked) { |
| 450 | // stp fp, lr, [sp, #-16]! |
| 451 | _ = try self.addInst(.{ |
| 452 | .tag = .stp, |
| 453 | .data = .{ .load_store_register_pair = .{ |
| 454 | .rt = .x29, |
| 455 | .rt2 = .x30, |
| 456 | .rn = .sp, |
| 457 | .offset = Instruction.LoadStorePairOffset.pre_index(-16), |
| 458 | } }, |
| 459 | }); |
| 460 | |
| 461 | // <store other registers> |
| 462 | const backpatch_save_registers = try self.addNop(); |
| 463 | |
| 464 | // mov fp, sp |
| 465 | _ = try self.addInst(.{ |
| 466 | .tag = .mov_to_from_sp, |
| 467 | .data = .{ .rr = .{ .rd = .x29, .rn = .sp } }, |
| 468 | }); |
| 469 | |
| 470 | // sub sp, sp, #reloc |
| 471 | const backpatch_reloc = try self.addNop(); |
| 472 | |
| 473 | if (self.ret_mcv == .stack_offset) { |
| 474 | // The address of where to store the return value is in x0 |
| 475 | // (or w0 when pointer size is 32 bits). As this register |
| 476 | // might get overwritten along the way, save the address |
| 477 | // to the stack. |
| 478 | const ret_ptr_reg = self.registerAlias(.x0, Type.usize); |
| 479 | |
| 480 | const stack_offset = try self.allocMem(8, .@"8", null); |
| 481 | |
| 482 | try self.genSetStack(Type.usize, stack_offset, MCValue{ .register = ret_ptr_reg }); |
| 483 | self.ret_mcv = MCValue{ .stack_offset = stack_offset }; |
| 484 | } |
| 485 | |
| 486 | for (self.args, 0..) |*arg, arg_index| { |
| 487 | // Copy register arguments to the stack |
| 488 | switch (arg.*) { |
| 489 | .register => |reg| { |
| 490 | // The first AIR instructions of the main body are guaranteed |
| 491 | // to be the functions arguments |
| 492 | const inst = self.air.getMainBody()[arg_index]; |
| 493 | assert(self.air.instructions.items(.tag)[@intFromEnum(inst)] == .arg); |
| 494 | |
| 495 | const ty = self.typeOfIndex(inst); |
| 496 | |
| 497 | const abi_size = @as(u32, @intCast(ty.abiSize(zcu))); |
| 498 | const abi_align = ty.abiAlignment(zcu); |
| 499 | const stack_offset = try self.allocMem(abi_size, abi_align, inst); |
| 500 | try self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); |
| 501 | |
| 502 | arg.* = MCValue{ .stack_offset = stack_offset }; |
| 503 | }, |
| 504 | else => {}, |
| 505 | } |
| 506 | } |
| 507 | |
| 508 | _ = try self.addInst(.{ |
| 509 | .tag = .dbg_prologue_end, |
| 510 | .data = .{ .nop = {} }, |
| 511 | }); |
| 512 | |
| 513 | try self.genBody(self.air.getMainBody()); |
| 514 | |
| 515 | // Backpatch push callee saved regs |
| 516 | var saved_regs: u32 = 0; |
| 517 | self.saved_regs_stack_space = 16; |
| 518 | inline for (callee_preserved_regs) |reg| { |
| 519 | if (self.register_manager.isRegAllocated(reg)) { |
| 520 | saved_regs |= @as(u32, 1) << @as(u5, @intCast(reg.id())); |
| 521 | self.saved_regs_stack_space += 8; |
| 522 | } |
| 523 | } |
| 524 | |
| 525 | // Emit.mirPopPushRegs automatically adds extra empty space so |
| 526 | // that sp is always aligned to 16 |
| 527 | if (!std.mem.isAlignedGeneric(u32, self.saved_regs_stack_space, 16)) { |
| 528 | self.saved_regs_stack_space += 8; |
| 529 | } |
| 530 | assert(std.mem.isAlignedGeneric(u32, self.saved_regs_stack_space, 16)); |
| 531 | |
| 532 | self.mir_instructions.set(backpatch_save_registers, .{ |
| 533 | .tag = .push_regs, |
| 534 | .data = .{ .reg_list = saved_regs }, |
| 535 | }); |
| 536 | |
| 537 | // Backpatch stack offset |
| 538 | const total_stack_size = self.max_end_stack + self.saved_regs_stack_space; |
| 539 | const aligned_total_stack_end = mem.alignForward(u32, total_stack_size, self.stack_align); |
| 540 | const stack_size = aligned_total_stack_end - self.saved_regs_stack_space; |
| 541 | self.max_end_stack = stack_size; |
| 542 | if (math.cast(u12, stack_size)) |size| { |
| 543 | self.mir_instructions.set(backpatch_reloc, .{ |
| 544 | .tag = .sub_immediate, |
| 545 | .data = .{ .rr_imm12_sh = .{ .rd = .sp, .rn = .sp, .imm12 = size } }, |
| 546 | }); |
| 547 | } else { |
| 548 | @panic("TODO AArch64: allow larger stacks"); |
| 549 | } |
| 550 | |
| 551 | _ = try self.addInst(.{ |
| 552 | .tag = .dbg_epilogue_begin, |
| 553 | .data = .{ .nop = {} }, |
| 554 | }); |
| 555 | |
| 556 | // exitlude jumps |
| 557 | if (self.exitlude_jump_relocs.items.len > 0 and |
| 558 | self.exitlude_jump_relocs.items[self.exitlude_jump_relocs.items.len - 1] == self.mir_instructions.len - 2) |
| 559 | { |
| 560 | // If the last Mir instruction (apart from the |
| 561 | // dbg_epilogue_begin) is the last exitlude jump |
| 562 | // relocation (which would just jump one instruction |
| 563 | // further), it can be safely removed |
| 564 | self.mir_instructions.orderedRemove(self.exitlude_jump_relocs.pop().?); |
| 565 | } |
| 566 | |
| 567 | for (self.exitlude_jump_relocs.items) |jmp_reloc| { |
| 568 | self.mir_instructions.set(jmp_reloc, .{ |
| 569 | .tag = .b, |
| 570 | .data = .{ .inst = @as(u32, @intCast(self.mir_instructions.len)) }, |
| 571 | }); |
| 572 | } |
| 573 | |
| 574 | // add sp, sp, #stack_size |
| 575 | _ = try self.addInst(.{ |
| 576 | .tag = .add_immediate, |
| 577 | .data = .{ .rr_imm12_sh = .{ .rd = .sp, .rn = .sp, .imm12 = @as(u12, @intCast(stack_size)) } }, |
| 578 | }); |
| 579 | |
| 580 | // <load other registers> |
| 581 | _ = try self.addInst(.{ |
| 582 | .tag = .pop_regs, |
| 583 | .data = .{ .reg_list = saved_regs }, |
| 584 | }); |
| 585 | |
| 586 | // ldp fp, lr, [sp], #16 |
| 587 | _ = try self.addInst(.{ |
| 588 | .tag = .ldp, |
| 589 | .data = .{ .load_store_register_pair = .{ |
| 590 | .rt = .x29, |
| 591 | .rt2 = .x30, |
| 592 | .rn = .sp, |
| 593 | .offset = Instruction.LoadStorePairOffset.post_index(16), |
| 594 | } }, |
| 595 | }); |
| 596 | |
| 597 | // ret lr |
| 598 | _ = try self.addInst(.{ |
| 599 | .tag = .ret, |
| 600 | .data = .{ .reg = .x30 }, |
| 601 | }); |
| 602 | } else { |
| 603 | _ = try self.addInst(.{ |
| 604 | .tag = .dbg_prologue_end, |
| 605 | .data = .{ .nop = {} }, |
| 606 | }); |
| 607 | |
| 608 | try self.genBody(self.air.getMainBody()); |
| 609 | |
| 610 | _ = try self.addInst(.{ |
| 611 | .tag = .dbg_epilogue_begin, |
| 612 | .data = .{ .nop = {} }, |
| 613 | }); |
| 614 | } |
| 615 | |
| 616 | // Drop them off at the rbrace. |
| 617 | _ = try self.addInst(.{ |
| 618 | .tag = .dbg_line, |
| 619 | .data = .{ .dbg_line_column = .{ |
| 620 | .line = self.end_di_line, |
| 621 | .column = self.end_di_column, |
| 622 | } }, |
| 623 | }); |
| 624 | } |
| 625 | |
| 626 | fn genBody(self: *Self, body: []const Air.Inst.Index) InnerError!void { |
| 627 | const pt = self.pt; |
| 628 | const zcu = pt.zcu; |
| 629 | const ip = &zcu.intern_pool; |
| 630 | const air_tags = self.air.instructions.items(.tag); |
| 631 | |
| 632 | for (body) |inst| { |
| 633 | // TODO: remove now-redundant isUnused calls from AIR handler functions |
| 634 | if (self.liveness.isUnused(inst) and !self.air.mustLower(inst, ip)) |
| 635 | continue; |
| 636 | |
| 637 | const old_air_bookkeeping = self.air_bookkeeping; |
| 638 | try self.ensureProcessDeathCapacity(Air.Liveness.bpi); |
| 639 | |
| 640 | self.reused_operands = @TypeOf(self.reused_operands).initEmpty(); |
| 641 | switch (air_tags[@intFromEnum(inst)]) { |
| 642 | // zig fmt: off |
| 643 | .add => try self.airBinOp(inst, .add), |
| 644 | .add_wrap => try self.airBinOp(inst, .add_wrap), |
| 645 | .sub => try self.airBinOp(inst, .sub), |
| 646 | .sub_wrap => try self.airBinOp(inst, .sub_wrap), |
| 647 | .mul => try self.airBinOp(inst, .mul), |
| 648 | .mul_wrap => try self.airBinOp(inst, .mul_wrap), |
| 649 | .shl => try self.airBinOp(inst, .shl), |
| 650 | .shl_exact => try self.airBinOp(inst, .shl_exact), |
| 651 | .bool_and => try self.airBinOp(inst, .bool_and), |
| 652 | .bool_or => try self.airBinOp(inst, .bool_or), |
| 653 | .bit_and => try self.airBinOp(inst, .bit_and), |
| 654 | .bit_or => try self.airBinOp(inst, .bit_or), |
| 655 | .xor => try self.airBinOp(inst, .xor), |
| 656 | .shr => try self.airBinOp(inst, .shr), |
| 657 | .shr_exact => try self.airBinOp(inst, .shr_exact), |
| 658 | .div_float => try self.airBinOp(inst, .div_float), |
| 659 | .div_trunc => try self.airBinOp(inst, .div_trunc), |
| 660 | .div_floor => try self.airBinOp(inst, .div_floor), |
| 661 | .div_exact => try self.airBinOp(inst, .div_exact), |
| 662 | .rem => try self.airBinOp(inst, .rem), |
| 663 | .mod => try self.airBinOp(inst, .mod), |
| 664 | |
| 665 | .ptr_add => try self.airPtrArithmetic(inst, .ptr_add), |
| 666 | .ptr_sub => try self.airPtrArithmetic(inst, .ptr_sub), |
| 667 | |
| 668 | .min => try self.airMinMax(inst), |
| 669 | .max => try self.airMinMax(inst), |
| 670 | |
| 671 | .add_sat => try self.airAddSat(inst), |
| 672 | .sub_sat => try self.airSubSat(inst), |
| 673 | .mul_sat => try self.airMulSat(inst), |
| 674 | .shl_sat => try self.airShlSat(inst), |
| 675 | .slice => try self.airSlice(inst), |
| 676 | |
| 677 | .sqrt, |
| 678 | .sin, |
| 679 | .cos, |
| 680 | .tan, |
| 681 | .exp, |
| 682 | .exp2, |
| 683 | .log, |
| 684 | .log2, |
| 685 | .log10, |
| 686 | .floor, |
| 687 | .ceil, |
| 688 | .round, |
| 689 | .trunc_float, |
| 690 | .neg, |
| 691 | => try self.airUnaryMath(inst), |
| 692 | |
| 693 | .add_with_overflow => try self.airOverflow(inst), |
| 694 | .sub_with_overflow => try self.airOverflow(inst), |
| 695 | .mul_with_overflow => try self.airMulWithOverflow(inst), |
| 696 | .shl_with_overflow => try self.airShlWithOverflow(inst), |
| 697 | |
| 698 | .cmp_lt => try self.airCmp(inst, .lt), |
| 699 | .cmp_lte => try self.airCmp(inst, .lte), |
| 700 | .cmp_eq => try self.airCmp(inst, .eq), |
| 701 | .cmp_gte => try self.airCmp(inst, .gte), |
| 702 | .cmp_gt => try self.airCmp(inst, .gt), |
| 703 | .cmp_neq => try self.airCmp(inst, .neq), |
| 704 | |
| 705 | .cmp_vector => try self.airCmpVector(inst), |
| 706 | .cmp_lt_errors_len => try self.airCmpLtErrorsLen(inst), |
| 707 | |
| 708 | .alloc => try self.airAlloc(inst), |
| 709 | .ret_ptr => try self.airRetPtr(inst), |
| 710 | .arg => try self.airArg(inst), |
| 711 | .assembly => try self.airAsm(inst), |
| 712 | .bitcast => try self.airBitCast(inst), |
| 713 | .block => try self.airBlock(inst), |
| 714 | .br => try self.airBr(inst), |
| 715 | .repeat => return self.fail("TODO implement `repeat`", .{}), |
| 716 | .switch_dispatch => return self.fail("TODO implement `switch_dispatch`", .{}), |
| 717 | .trap => try self.airTrap(), |
| 718 | .breakpoint => try self.airBreakpoint(), |
| 719 | .ret_addr => try self.airRetAddr(inst), |
| 720 | .frame_addr => try self.airFrameAddress(inst), |
| 721 | .cond_br => try self.airCondBr(inst), |
| 722 | .fptrunc => try self.airFptrunc(inst), |
| 723 | .fpext => try self.airFpext(inst), |
| 724 | .intcast => try self.airIntCast(inst), |
| 725 | .trunc => try self.airTrunc(inst), |
| 726 | .is_non_null => try self.airIsNonNull(inst), |
| 727 | .is_non_null_ptr => try self.airIsNonNullPtr(inst), |
| 728 | .is_null => try self.airIsNull(inst), |
| 729 | .is_null_ptr => try self.airIsNullPtr(inst), |
| 730 | .is_non_err => try self.airIsNonErr(inst), |
| 731 | .is_non_err_ptr => try self.airIsNonErrPtr(inst), |
| 732 | .is_err => try self.airIsErr(inst), |
| 733 | .is_err_ptr => try self.airIsErrPtr(inst), |
| 734 | .load => try self.airLoad(inst), |
| 735 | .loop => try self.airLoop(inst), |
| 736 | .not => try self.airNot(inst), |
| 737 | .ret => try self.airRet(inst), |
| 738 | .ret_safe => try self.airRet(inst), // TODO |
| 739 | .ret_load => try self.airRetLoad(inst), |
| 740 | .store => try self.airStore(inst, false), |
| 741 | .store_safe => try self.airStore(inst, true), |
| 742 | .struct_field_ptr=> try self.airStructFieldPtr(inst), |
| 743 | .struct_field_val=> try self.airStructFieldVal(inst), |
| 744 | .array_to_slice => try self.airArrayToSlice(inst), |
| 745 | .float_from_int => try self.airFloatFromInt(inst), |
| 746 | .int_from_float => try self.airIntFromFloat(inst), |
| 747 | .cmpxchg_strong => try self.airCmpxchg(inst), |
| 748 | .cmpxchg_weak => try self.airCmpxchg(inst), |
| 749 | .atomic_rmw => try self.airAtomicRmw(inst), |
| 750 | .atomic_load => try self.airAtomicLoad(inst), |
| 751 | .memcpy => try self.airMemcpy(inst), |
| 752 | .memmove => try self.airMemmove(inst), |
| 753 | .memset => try self.airMemset(inst, false), |
| 754 | .memset_safe => try self.airMemset(inst, true), |
| 755 | .set_union_tag => try self.airSetUnionTag(inst), |
| 756 | .get_union_tag => try self.airGetUnionTag(inst), |
| 757 | .clz => try self.airClz(inst), |
| 758 | .ctz => try self.airCtz(inst), |
| 759 | .popcount => try self.airPopcount(inst), |
| 760 | .abs => try self.airAbs(inst), |
| 761 | .byte_swap => try self.airByteSwap(inst), |
| 762 | .bit_reverse => try self.airBitReverse(inst), |
| 763 | .tag_name => try self.airTagName(inst), |
| 764 | .error_name => try self.airErrorName(inst), |
| 765 | .splat => try self.airSplat(inst), |
| 766 | .select => try self.airSelect(inst), |
| 767 | .shuffle_one => try self.airShuffleOne(inst), |
| 768 | .shuffle_two => try self.airShuffleTwo(inst), |
| 769 | .reduce => try self.airReduce(inst), |
| 770 | .aggregate_init => try self.airAggregateInit(inst), |
| 771 | .union_init => try self.airUnionInit(inst), |
| 772 | .prefetch => try self.airPrefetch(inst), |
| 773 | .mul_add => try self.airMulAdd(inst), |
| 774 | .addrspace_cast => return self.fail("TODO implement addrspace_cast", .{}), |
| 775 | |
| 776 | .@"try" => try self.airTry(inst), |
| 777 | .try_cold => try self.airTry(inst), |
| 778 | .try_ptr => try self.airTryPtr(inst), |
| 779 | .try_ptr_cold => try self.airTryPtr(inst), |
| 780 | |
| 781 | .dbg_stmt => try self.airDbgStmt(inst), |
| 782 | .dbg_empty_stmt => self.finishAirBookkeeping(), |
| 783 | .dbg_inline_block => try self.airDbgInlineBlock(inst), |
| 784 | .dbg_var_ptr, |
| 785 | .dbg_var_val, |
| 786 | .dbg_arg_inline, |
| 787 | => try self.airDbgVar(inst), |
| 788 | |
| 789 | .call => try self.airCall(inst, .auto), |
| 790 | .call_always_tail => try self.airCall(inst, .always_tail), |
| 791 | .call_never_tail => try self.airCall(inst, .never_tail), |
| 792 | .call_never_inline => try self.airCall(inst, .never_inline), |
| 793 | |
| 794 | .atomic_store_unordered => try self.airAtomicStore(inst, .unordered), |
| 795 | .atomic_store_monotonic => try self.airAtomicStore(inst, .monotonic), |
| 796 | .atomic_store_release => try self.airAtomicStore(inst, .release), |
| 797 | .atomic_store_seq_cst => try self.airAtomicStore(inst, .seq_cst), |
| 798 | |
| 799 | .struct_field_ptr_index_0 => try self.airStructFieldPtrIndex(inst, 0), |
| 800 | .struct_field_ptr_index_1 => try self.airStructFieldPtrIndex(inst, 1), |
| 801 | .struct_field_ptr_index_2 => try self.airStructFieldPtrIndex(inst, 2), |
| 802 | .struct_field_ptr_index_3 => try self.airStructFieldPtrIndex(inst, 3), |
| 803 | |
| 804 | .field_parent_ptr => try self.airFieldParentPtr(inst), |
| 805 | |
| 806 | .switch_br => try self.airSwitch(inst), |
| 807 | .loop_switch_br => return self.fail("TODO implement `loop_switch_br`", .{}), |
| 808 | .slice_ptr => try self.airSlicePtr(inst), |
| 809 | .slice_len => try self.airSliceLen(inst), |
| 810 | |
| 811 | .ptr_slice_len_ptr => try self.airPtrSliceLenPtr(inst), |
| 812 | .ptr_slice_ptr_ptr => try self.airPtrSlicePtrPtr(inst), |
| 813 | |
| 814 | .array_elem_val => try self.airArrayElemVal(inst), |
| 815 | .slice_elem_val => try self.airSliceElemVal(inst), |
| 816 | .slice_elem_ptr => try self.airSliceElemPtr(inst), |
| 817 | .ptr_elem_val => try self.airPtrElemVal(inst), |
| 818 | .ptr_elem_ptr => try self.airPtrElemPtr(inst), |
| 819 | |
| 820 | .inferred_alloc, .inferred_alloc_comptime => unreachable, |
| 821 | .unreach => self.finishAirBookkeeping(), |
| 822 | |
| 823 | .optional_payload => try self.airOptionalPayload(inst), |
| 824 | .optional_payload_ptr => try self.airOptionalPayloadPtr(inst), |
| 825 | .optional_payload_ptr_set => try self.airOptionalPayloadPtrSet(inst), |
| 826 | .unwrap_errunion_err => try self.airUnwrapErrErr(inst), |
| 827 | .unwrap_errunion_payload => try self.airUnwrapErrPayload(inst), |
| 828 | .unwrap_errunion_err_ptr => try self.airUnwrapErrErrPtr(inst), |
| 829 | .unwrap_errunion_payload_ptr=> try self.airUnwrapErrPayloadPtr(inst), |
| 830 | .errunion_payload_ptr_set => try self.airErrUnionPayloadPtrSet(inst), |
| 831 | .err_return_trace => try self.airErrReturnTrace(inst), |
| 832 | .set_err_return_trace => try self.airSetErrReturnTrace(inst), |
| 833 | .save_err_return_trace_index=> try self.airSaveErrReturnTraceIndex(inst), |
| 834 | |
| 835 | .wrap_optional => try self.airWrapOptional(inst), |
| 836 | .wrap_errunion_payload => try self.airWrapErrUnionPayload(inst), |
| 837 | .wrap_errunion_err => try self.airWrapErrUnionErr(inst), |
| 838 | |
| 839 | .add_optimized, |
| 840 | .sub_optimized, |
| 841 | .mul_optimized, |
| 842 | .div_float_optimized, |
| 843 | .div_trunc_optimized, |
| 844 | .div_floor_optimized, |
| 845 | .div_exact_optimized, |
| 846 | .rem_optimized, |
| 847 | .mod_optimized, |
| 848 | .neg_optimized, |
| 849 | .cmp_lt_optimized, |
| 850 | .cmp_lte_optimized, |
| 851 | .cmp_eq_optimized, |
| 852 | .cmp_gte_optimized, |
| 853 | .cmp_gt_optimized, |
| 854 | .cmp_neq_optimized, |
| 855 | .cmp_vector_optimized, |
| 856 | .reduce_optimized, |
| 857 | .int_from_float_optimized, |
| 858 | => return self.fail("TODO implement optimized float mode", .{}), |
| 859 | |
| 860 | .add_safe, |
| 861 | .sub_safe, |
| 862 | .mul_safe, |
| 863 | .intcast_safe, |
| 864 | .int_from_float_safe, |
| 865 | .int_from_float_optimized_safe, |
| 866 | => return self.fail("TODO implement safety_checked_instructions", .{}), |
| 867 | |
| 868 | .is_named_enum_value => return self.fail("TODO implement is_named_enum_value", .{}), |
| 869 | .error_set_has_value => return self.fail("TODO implement error_set_has_value", .{}), |
| 870 | .vector_store_elem => return self.fail("TODO implement vector_store_elem", .{}), |
| 871 | .runtime_nav_ptr => return self.fail("TODO implement runtime_nav_ptr", .{}), |
| 872 | |
| 873 | .c_va_arg => return self.fail("TODO implement c_va_arg", .{}), |
| 874 | .c_va_copy => return self.fail("TODO implement c_va_copy", .{}), |
| 875 | .c_va_end => return self.fail("TODO implement c_va_end", .{}), |
| 876 | .c_va_start => return self.fail("TODO implement c_va_start", .{}), |
| 877 | |
| 878 | .wasm_memory_size => unreachable, |
| 879 | .wasm_memory_grow => unreachable, |
| 880 | |
| 881 | .work_item_id => unreachable, |
| 882 | .work_group_size => unreachable, |
| 883 | .work_group_id => unreachable, |
| 884 | // zig fmt: on |
| 885 | } |
| 886 | |
| 887 | assert(!self.register_manager.lockedRegsExist()); |
| 888 | |
| 889 | if (std.debug.runtime_safety) { |
| 890 | if (self.air_bookkeeping < old_air_bookkeeping + 1) { |
| 891 | std.debug.panic("in codegen.zig, handling of AIR instruction %{d} ('{}') did not do proper bookkeeping. Look for a missing call to finishAir.", .{ inst, air_tags[@intFromEnum(inst)] }); |
| 892 | } |
| 893 | } |
| 894 | } |
| 895 | } |
| 896 | |
| 897 | /// Asserts there is already capacity to insert into top branch inst_table. |
| 898 | fn processDeath(self: *Self, inst: Air.Inst.Index) void { |
| 899 | // When editing this function, note that the logic must synchronize with `reuseOperand`. |
| 900 | const prev_value = self.getResolvedInstValue(inst); |
| 901 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 902 | branch.inst_table.putAssumeCapacity(inst, .dead); |
| 903 | switch (prev_value) { |
| 904 | .register => |reg| { |
| 905 | self.register_manager.freeReg(reg); |
| 906 | }, |
| 907 | .register_with_overflow => |rwo| { |
| 908 | self.register_manager.freeReg(rwo.reg); |
| 909 | self.compare_flags_inst = null; |
| 910 | }, |
| 911 | .compare_flags => { |
| 912 | self.compare_flags_inst = null; |
| 913 | }, |
| 914 | else => {}, // TODO process stack allocation death |
| 915 | } |
| 916 | } |
| 917 | |
| 918 | /// Called when there are no operands, and the instruction is always unreferenced. |
| 919 | fn finishAirBookkeeping(self: *Self) void { |
| 920 | if (std.debug.runtime_safety) { |
| 921 | self.air_bookkeeping += 1; |
| 922 | } |
| 923 | } |
| 924 | |
| 925 | fn finishAir(self: *Self, inst: Air.Inst.Index, result: MCValue, operands: [Air.Liveness.bpi - 1]Air.Inst.Ref) void { |
| 926 | const tomb_bits = self.liveness.getTombBits(inst); |
| 927 | for (0.., operands) |op_index, op| { |
| 928 | if (tomb_bits & @as(Air.Liveness.Bpi, 1) << @intCast(op_index) == 0) continue; |
| 929 | if (self.reused_operands.isSet(op_index)) continue; |
| 930 | self.processDeath(op.toIndexAllowNone() orelse continue); |
| 931 | } |
| 932 | if (tomb_bits & 1 << (Air.Liveness.bpi - 1) == 0) { |
| 933 | log.debug("%{d} => {}", .{ inst, result }); |
| 934 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 935 | branch.inst_table.putAssumeCapacityNoClobber(inst, result); |
| 936 | |
| 937 | switch (result) { |
| 938 | .register => |reg| { |
| 939 | // In some cases (such as bitcast), an operand |
| 940 | // may be the same MCValue as the result. If |
| 941 | // that operand died and was a register, it |
| 942 | // was freed by processDeath. We have to |
| 943 | // "re-allocate" the register. |
| 944 | if (self.register_manager.isRegFree(reg)) { |
| 945 | self.register_manager.getRegAssumeFree(reg, inst); |
| 946 | } |
| 947 | }, |
| 948 | .register_with_overflow => |rwo| { |
| 949 | if (self.register_manager.isRegFree(rwo.reg)) { |
| 950 | self.register_manager.getRegAssumeFree(rwo.reg, inst); |
| 951 | } |
| 952 | self.compare_flags_inst = inst; |
| 953 | }, |
| 954 | .compare_flags => |_| { |
| 955 | self.compare_flags_inst = inst; |
| 956 | }, |
| 957 | else => {}, |
| 958 | } |
| 959 | } |
| 960 | self.finishAirBookkeeping(); |
| 961 | } |
| 962 | |
| 963 | fn ensureProcessDeathCapacity(self: *Self, additional_count: usize) !void { |
| 964 | const table = &self.branch_stack.items[self.branch_stack.items.len - 1].inst_table; |
| 965 | try table.ensureUnusedCapacity(self.gpa, additional_count); |
| 966 | } |
| 967 | |
| 968 | fn allocMem( |
| 969 | self: *Self, |
| 970 | abi_size: u32, |
| 971 | abi_align: Alignment, |
| 972 | maybe_inst: ?Air.Inst.Index, |
| 973 | ) !u32 { |
| 974 | assert(abi_size > 0); |
| 975 | assert(abi_align != .none); |
| 976 | |
| 977 | // In order to efficiently load and store stack items that fit |
| 978 | // into registers, we bump up the alignment to the next power of |
| 979 | // two. |
| 980 | const adjusted_align = if (abi_size > 8) |
| 981 | abi_align |
| 982 | else |
| 983 | Alignment.fromNonzeroByteUnits(std.math.ceilPowerOfTwoAssert(u64, abi_size)); |
| 984 | |
| 985 | // TODO find a free slot instead of always appending |
| 986 | const offset: u32 = @intCast(adjusted_align.forward(self.next_stack_offset) + abi_size); |
| 987 | self.next_stack_offset = offset; |
| 988 | self.max_end_stack = @max(self.max_end_stack, self.next_stack_offset); |
| 989 | |
| 990 | if (maybe_inst) |inst| { |
| 991 | try self.stack.putNoClobber(self.gpa, offset, .{ |
| 992 | .inst = inst, |
| 993 | .size = abi_size, |
| 994 | }); |
| 995 | } |
| 996 | |
| 997 | return offset; |
| 998 | } |
| 999 | |
| 1000 | /// Use a pointer instruction as the basis for allocating stack memory. |
| 1001 | fn allocMemPtr(self: *Self, inst: Air.Inst.Index) !u32 { |
| 1002 | const pt = self.pt; |
| 1003 | const zcu = pt.zcu; |
| 1004 | const elem_ty = self.typeOfIndex(inst).childType(zcu); |
| 1005 | |
| 1006 | if (!elem_ty.hasRuntimeBits(zcu)) { |
| 1007 | // return the stack offset 0. Stack offset 0 will be where all |
| 1008 | // zero-sized stack allocations live as non-zero-sized |
| 1009 | // allocations will always have an offset > 0. |
| 1010 | return @as(u32, 0); |
| 1011 | } |
| 1012 | |
| 1013 | const abi_size = math.cast(u32, elem_ty.abiSize(zcu)) orelse { |
| 1014 | return self.fail("type '{}' too big to fit into stack frame", .{elem_ty.fmt(pt)}); |
| 1015 | }; |
| 1016 | // TODO swap this for inst.ty.ptrAlign |
| 1017 | const abi_align = elem_ty.abiAlignment(zcu); |
| 1018 | |
| 1019 | return self.allocMem(abi_size, abi_align, inst); |
| 1020 | } |
| 1021 | |
| 1022 | fn allocRegOrMem(self: *Self, elem_ty: Type, reg_ok: bool, maybe_inst: ?Air.Inst.Index) !MCValue { |
| 1023 | const pt = self.pt; |
| 1024 | const abi_size = math.cast(u32, elem_ty.abiSize(pt.zcu)) orelse { |
| 1025 | return self.fail("type '{}' too big to fit into stack frame", .{elem_ty.fmt(pt)}); |
| 1026 | }; |
| 1027 | const abi_align = elem_ty.abiAlignment(pt.zcu); |
| 1028 | |
| 1029 | if (reg_ok) { |
| 1030 | // Make sure the type can fit in a register before we try to allocate one. |
| 1031 | if (abi_size <= 8) { |
| 1032 | if (self.register_manager.tryAllocReg(maybe_inst, gp)) |reg| { |
| 1033 | return MCValue{ .register = self.registerAlias(reg, elem_ty) }; |
| 1034 | } |
| 1035 | } |
| 1036 | } |
| 1037 | |
| 1038 | const stack_offset = try self.allocMem(abi_size, abi_align, maybe_inst); |
| 1039 | return MCValue{ .stack_offset = stack_offset }; |
| 1040 | } |
| 1041 | |
| 1042 | pub fn spillInstruction(self: *Self, reg: Register, inst: Air.Inst.Index) !void { |
| 1043 | const stack_mcv = try self.allocRegOrMem(self.typeOfIndex(inst), false, inst); |
| 1044 | log.debug("spilling {d} to stack mcv {any}", .{ inst, stack_mcv }); |
| 1045 | |
| 1046 | const reg_mcv = self.getResolvedInstValue(inst); |
| 1047 | switch (reg_mcv) { |
| 1048 | .register => |r| assert(reg.id() == r.id()), |
| 1049 | .register_with_overflow => |rwo| assert(rwo.reg.id() == reg.id()), |
| 1050 | else => unreachable, // not a register |
| 1051 | } |
| 1052 | |
| 1053 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 1054 | try branch.inst_table.put(self.gpa, inst, stack_mcv); |
| 1055 | try self.genSetStack(self.typeOfIndex(inst), stack_mcv.stack_offset, reg_mcv); |
| 1056 | } |
| 1057 | |
| 1058 | /// Save the current instruction stored in the compare flags if |
| 1059 | /// occupied |
| 1060 | fn spillCompareFlagsIfOccupied(self: *Self) !void { |
| 1061 | if (self.compare_flags_inst) |inst_to_save| { |
| 1062 | const ty = self.typeOfIndex(inst_to_save); |
| 1063 | const mcv = self.getResolvedInstValue(inst_to_save); |
| 1064 | const new_mcv = switch (mcv) { |
| 1065 | .compare_flags => try self.allocRegOrMem(ty, true, inst_to_save), |
| 1066 | .register_with_overflow => try self.allocRegOrMem(ty, false, inst_to_save), |
| 1067 | else => unreachable, // mcv doesn't occupy the compare flags |
| 1068 | }; |
| 1069 | |
| 1070 | try self.setRegOrMem(self.typeOfIndex(inst_to_save), new_mcv, mcv); |
| 1071 | log.debug("spilling {d} to mcv {any}", .{ inst_to_save, new_mcv }); |
| 1072 | |
| 1073 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 1074 | try branch.inst_table.put(self.gpa, inst_to_save, new_mcv); |
| 1075 | |
| 1076 | self.compare_flags_inst = null; |
| 1077 | |
| 1078 | // TODO consolidate with register manager and spillInstruction |
| 1079 | // this call should really belong in the register manager! |
| 1080 | switch (mcv) { |
| 1081 | .register_with_overflow => |rwo| self.register_manager.freeReg(rwo.reg), |
| 1082 | else => {}, |
| 1083 | } |
| 1084 | } |
| 1085 | } |
| 1086 | |
| 1087 | /// Copies a value to a register without tracking the register. The register is not considered |
| 1088 | /// allocated. A second call to `copyToTmpRegister` may return the same register. |
| 1089 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 1090 | fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) InnerError!Register { |
| 1091 | const raw_reg = try self.register_manager.allocReg(null, gp); |
| 1092 | const reg = self.registerAlias(raw_reg, ty); |
| 1093 | try self.genSetReg(ty, reg, mcv); |
| 1094 | return reg; |
| 1095 | } |
| 1096 | |
| 1097 | /// Allocates a new register and copies `mcv` into it. |
| 1098 | /// `reg_owner` is the instruction that gets associated with the register in the register table. |
| 1099 | /// This can have a side effect of spilling instructions to the stack to free up a register. |
| 1100 | fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { |
| 1101 | const raw_reg = try self.register_manager.allocReg(reg_owner, gp); |
| 1102 | const ty = self.typeOfIndex(reg_owner); |
| 1103 | const reg = self.registerAlias(raw_reg, ty); |
| 1104 | try self.genSetReg(self.typeOfIndex(reg_owner), reg, mcv); |
| 1105 | return MCValue{ .register = reg }; |
| 1106 | } |
| 1107 | |
| 1108 | fn airAlloc(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1109 | const stack_offset = try self.allocMemPtr(inst); |
| 1110 | return self.finishAir(inst, .{ .ptr_stack_offset = stack_offset }, .{ .none, .none, .none }); |
| 1111 | } |
| 1112 | |
| 1113 | fn airRetPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1114 | const pt = self.pt; |
| 1115 | const zcu = pt.zcu; |
| 1116 | const result: MCValue = switch (self.ret_mcv) { |
| 1117 | .none, .register => .{ .ptr_stack_offset = try self.allocMemPtr(inst) }, |
| 1118 | .stack_offset => blk: { |
| 1119 | // self.ret_mcv is an address to where this function |
| 1120 | // should store its result into |
| 1121 | const ret_ty = self.fn_type.fnReturnType(zcu); |
| 1122 | const ptr_ty = try pt.singleMutPtrType(ret_ty); |
| 1123 | |
| 1124 | // addr_reg will contain the address of where to store the |
| 1125 | // result into |
| 1126 | const addr_reg = try self.copyToTmpRegister(ptr_ty, self.ret_mcv); |
| 1127 | break :blk .{ .register = addr_reg }; |
| 1128 | }, |
| 1129 | else => unreachable, // invalid return result |
| 1130 | }; |
| 1131 | |
| 1132 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 1133 | } |
| 1134 | |
| 1135 | fn airFptrunc(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1136 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1137 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFptrunc for {}", .{self.target.cpu.arch}); |
| 1138 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 1139 | } |
| 1140 | |
| 1141 | fn airFpext(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1142 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1143 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFpext for {}", .{self.target.cpu.arch}); |
| 1144 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 1145 | } |
| 1146 | |
| 1147 | fn airIntCast(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1148 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1149 | if (self.liveness.isUnused(inst)) |
| 1150 | return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); |
| 1151 | |
| 1152 | const pt = self.pt; |
| 1153 | const zcu = pt.zcu; |
| 1154 | const operand = ty_op.operand; |
| 1155 | const operand_mcv = try self.resolveInst(operand); |
| 1156 | const operand_ty = self.typeOf(operand); |
| 1157 | const operand_info = operand_ty.intInfo(zcu); |
| 1158 | |
| 1159 | const dest_ty = self.typeOfIndex(inst); |
| 1160 | const dest_info = dest_ty.intInfo(zcu); |
| 1161 | |
| 1162 | const result: MCValue = result: { |
| 1163 | const operand_lock: ?RegisterLock = switch (operand_mcv) { |
| 1164 | .register => |reg| self.register_manager.lockRegAssumeUnused(reg), |
| 1165 | else => null, |
| 1166 | }; |
| 1167 | defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); |
| 1168 | |
| 1169 | const truncated: MCValue = switch (operand_mcv) { |
| 1170 | .register => |r| MCValue{ .register = self.registerAlias(r, dest_ty) }, |
| 1171 | else => operand_mcv, |
| 1172 | }; |
| 1173 | |
| 1174 | if (dest_info.bits > operand_info.bits) { |
| 1175 | const dest_mcv = try self.allocRegOrMem(dest_ty, true, inst); |
| 1176 | try self.setRegOrMem(self.typeOfIndex(inst), dest_mcv, truncated); |
| 1177 | break :result dest_mcv; |
| 1178 | } else { |
| 1179 | if (self.reuseOperand(inst, operand, 0, truncated)) { |
| 1180 | break :result truncated; |
| 1181 | } else { |
| 1182 | const dest_mcv = try self.allocRegOrMem(dest_ty, true, inst); |
| 1183 | try self.setRegOrMem(self.typeOfIndex(inst), dest_mcv, truncated); |
| 1184 | break :result dest_mcv; |
| 1185 | } |
| 1186 | } |
| 1187 | }; |
| 1188 | |
| 1189 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 1190 | } |
| 1191 | |
| 1192 | fn truncRegister( |
| 1193 | self: *Self, |
| 1194 | operand_reg: Register, |
| 1195 | dest_reg: Register, |
| 1196 | int_signedness: std.builtin.Signedness, |
| 1197 | int_bits: u16, |
| 1198 | ) !void { |
| 1199 | switch (int_bits) { |
| 1200 | 1...31, 33...63 => { |
| 1201 | _ = try self.addInst(.{ |
| 1202 | .tag = switch (int_signedness) { |
| 1203 | .signed => .sbfx, |
| 1204 | .unsigned => .ubfx, |
| 1205 | }, |
| 1206 | .data = .{ .rr_lsb_width = .{ |
| 1207 | .rd = dest_reg, |
| 1208 | .rn = operand_reg, |
| 1209 | .lsb = 0, |
| 1210 | .width = @as(u6, @intCast(int_bits)), |
| 1211 | } }, |
| 1212 | }); |
| 1213 | }, |
| 1214 | 32, 64 => { |
| 1215 | _ = try self.addInst(.{ |
| 1216 | .tag = .mov_register, |
| 1217 | .data = .{ .rr = .{ |
| 1218 | .rd = if (int_bits == 32) dest_reg.toW() else dest_reg.toX(), |
| 1219 | .rn = if (int_bits == 32) operand_reg.toW() else operand_reg.toX(), |
| 1220 | } }, |
| 1221 | }); |
| 1222 | }, |
| 1223 | else => unreachable, |
| 1224 | } |
| 1225 | } |
| 1226 | |
| 1227 | fn trunc( |
| 1228 | self: *Self, |
| 1229 | maybe_inst: ?Air.Inst.Index, |
| 1230 | operand: MCValue, |
| 1231 | operand_ty: Type, |
| 1232 | dest_ty: Type, |
| 1233 | ) !MCValue { |
| 1234 | const pt = self.pt; |
| 1235 | const zcu = pt.zcu; |
| 1236 | const info_a = operand_ty.intInfo(zcu); |
| 1237 | const info_b = dest_ty.intInfo(zcu); |
| 1238 | |
| 1239 | if (info_b.bits <= 64) { |
| 1240 | const operand_reg = switch (operand) { |
| 1241 | .register => |r| r, |
| 1242 | else => operand_reg: { |
| 1243 | if (info_a.bits <= 64) { |
| 1244 | const raw_reg = try self.copyToTmpRegister(operand_ty, operand); |
| 1245 | break :operand_reg self.registerAlias(raw_reg, operand_ty); |
| 1246 | } else { |
| 1247 | return self.fail("TODO load least significant word into register", .{}); |
| 1248 | } |
| 1249 | }, |
| 1250 | }; |
| 1251 | const lock = self.register_manager.lockReg(operand_reg); |
| 1252 | defer if (lock) |reg| self.register_manager.unlockReg(reg); |
| 1253 | |
| 1254 | const dest_reg = if (maybe_inst) |inst| blk: { |
| 1255 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1256 | |
| 1257 | if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { |
| 1258 | break :blk self.registerAlias(operand_reg, dest_ty); |
| 1259 | } else { |
| 1260 | const raw_reg = try self.register_manager.allocReg(inst, gp); |
| 1261 | break :blk self.registerAlias(raw_reg, dest_ty); |
| 1262 | } |
| 1263 | } else blk: { |
| 1264 | const raw_reg = try self.register_manager.allocReg(null, gp); |
| 1265 | break :blk self.registerAlias(raw_reg, dest_ty); |
| 1266 | }; |
| 1267 | |
| 1268 | try self.truncRegister(operand_reg, dest_reg, info_b.signedness, info_b.bits); |
| 1269 | |
| 1270 | return MCValue{ .register = dest_reg }; |
| 1271 | } else { |
| 1272 | return self.fail("TODO: truncate to ints > 64 bits", .{}); |
| 1273 | } |
| 1274 | } |
| 1275 | |
| 1276 | fn airTrunc(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1277 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1278 | const operand = try self.resolveInst(ty_op.operand); |
| 1279 | const operand_ty = self.typeOf(ty_op.operand); |
| 1280 | const dest_ty = self.typeOfIndex(inst); |
| 1281 | |
| 1282 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else blk: { |
| 1283 | break :blk try self.trunc(inst, operand, operand_ty, dest_ty); |
| 1284 | }; |
| 1285 | |
| 1286 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 1287 | } |
| 1288 | |
| 1289 | fn airNot(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1290 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 1291 | const pt = self.pt; |
| 1292 | const zcu = pt.zcu; |
| 1293 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 1294 | const operand = try self.resolveInst(ty_op.operand); |
| 1295 | const operand_ty = self.typeOf(ty_op.operand); |
| 1296 | switch (operand) { |
| 1297 | .dead => unreachable, |
| 1298 | .unreach => unreachable, |
| 1299 | .compare_flags => |cond| break :result MCValue{ .compare_flags = cond.negate() }, |
| 1300 | else => { |
| 1301 | switch (operand_ty.zigTypeTag(zcu)) { |
| 1302 | .bool => { |
| 1303 | // TODO convert this to mvn + and |
| 1304 | const op_reg = switch (operand) { |
| 1305 | .register => |r| r, |
| 1306 | else => try self.copyToTmpRegister(operand_ty, operand), |
| 1307 | }; |
| 1308 | const reg_lock = self.register_manager.lockRegAssumeUnused(op_reg); |
| 1309 | defer self.register_manager.unlockReg(reg_lock); |
| 1310 | |
| 1311 | const dest_reg = blk: { |
| 1312 | if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { |
| 1313 | break :blk op_reg; |
| 1314 | } |
| 1315 | |
| 1316 | const raw_reg = try self.register_manager.allocReg(null, gp); |
| 1317 | break :blk self.registerAlias(raw_reg, operand_ty); |
| 1318 | }; |
| 1319 | |
| 1320 | _ = try self.addInst(.{ |
| 1321 | .tag = .eor_immediate, |
| 1322 | .data = .{ .rr_bitmask = .{ |
| 1323 | .rd = dest_reg, |
| 1324 | .rn = op_reg, |
| 1325 | .imms = 0b000000, |
| 1326 | .immr = 0b000000, |
| 1327 | .n = 0b0, |
| 1328 | } }, |
| 1329 | }); |
| 1330 | |
| 1331 | break :result MCValue{ .register = dest_reg }; |
| 1332 | }, |
| 1333 | .vector => return self.fail("TODO bitwise not for vectors", .{}), |
| 1334 | .int => { |
| 1335 | const int_info = operand_ty.intInfo(zcu); |
| 1336 | if (int_info.bits <= 64) { |
| 1337 | const op_reg = switch (operand) { |
| 1338 | .register => |r| r, |
| 1339 | else => try self.copyToTmpRegister(operand_ty, operand), |
| 1340 | }; |
| 1341 | const reg_lock = self.register_manager.lockRegAssumeUnused(op_reg); |
| 1342 | defer self.register_manager.unlockReg(reg_lock); |
| 1343 | |
| 1344 | const dest_reg = blk: { |
| 1345 | if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { |
| 1346 | break :blk op_reg; |
| 1347 | } |
| 1348 | |
| 1349 | const raw_reg = try self.register_manager.allocReg(null, gp); |
| 1350 | break :blk self.registerAlias(raw_reg, operand_ty); |
| 1351 | }; |
| 1352 | |
| 1353 | _ = try self.addInst(.{ |
| 1354 | .tag = .mvn, |
| 1355 | .data = .{ .rr_imm6_logical_shift = .{ |
| 1356 | .rd = dest_reg, |
| 1357 | .rm = op_reg, |
| 1358 | .imm6 = 0, |
| 1359 | .shift = .lsl, |
| 1360 | } }, |
| 1361 | }); |
| 1362 | |
| 1363 | try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); |
| 1364 | |
| 1365 | break :result MCValue{ .register = dest_reg }; |
| 1366 | } else { |
| 1367 | return self.fail("TODO AArch64 not on integers > u64/i64", .{}); |
| 1368 | } |
| 1369 | }, |
| 1370 | else => unreachable, |
| 1371 | } |
| 1372 | }, |
| 1373 | } |
| 1374 | }; |
| 1375 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 1376 | } |
| 1377 | |
| 1378 | fn minMax( |
| 1379 | self: *Self, |
| 1380 | tag: Air.Inst.Tag, |
| 1381 | lhs_bind: ReadArg.Bind, |
| 1382 | rhs_bind: ReadArg.Bind, |
| 1383 | lhs_ty: Type, |
| 1384 | rhs_ty: Type, |
| 1385 | maybe_inst: ?Air.Inst.Index, |
| 1386 | ) !MCValue { |
| 1387 | const pt = self.pt; |
| 1388 | const zcu = pt.zcu; |
| 1389 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 1390 | .float => return self.fail("TODO ARM min/max on floats", .{}), |
| 1391 | .vector => return self.fail("TODO ARM min/max on vectors", .{}), |
| 1392 | .int => { |
| 1393 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 1394 | const int_info = lhs_ty.intInfo(zcu); |
| 1395 | if (int_info.bits <= 64) { |
| 1396 | var lhs_reg: Register = undefined; |
| 1397 | var rhs_reg: Register = undefined; |
| 1398 | var dest_reg: Register = undefined; |
| 1399 | |
| 1400 | const read_args = [_]ReadArg{ |
| 1401 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 1402 | .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, |
| 1403 | }; |
| 1404 | const write_args = [_]WriteArg{ |
| 1405 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 1406 | }; |
| 1407 | try self.allocRegs( |
| 1408 | &read_args, |
| 1409 | &write_args, |
| 1410 | if (maybe_inst) |inst| .{ |
| 1411 | .corresponding_inst = inst, |
| 1412 | .operand_mapping = &.{ 0, 1 }, |
| 1413 | } else null, |
| 1414 | ); |
| 1415 | |
| 1416 | // lhs == reg should have been checked by airMinMax |
| 1417 | assert(lhs_reg != rhs_reg); // see note above |
| 1418 | |
| 1419 | _ = try self.addInst(.{ |
| 1420 | .tag = .cmp_shifted_register, |
| 1421 | .data = .{ .rr_imm6_shift = .{ |
| 1422 | .rn = lhs_reg, |
| 1423 | .rm = rhs_reg, |
| 1424 | .imm6 = 0, |
| 1425 | .shift = .lsl, |
| 1426 | } }, |
| 1427 | }); |
| 1428 | |
| 1429 | const cond_choose_lhs: Condition = switch (tag) { |
| 1430 | .max => switch (int_info.signedness) { |
| 1431 | .signed => Condition.gt, |
| 1432 | .unsigned => Condition.hi, |
| 1433 | }, |
| 1434 | .min => switch (int_info.signedness) { |
| 1435 | .signed => Condition.lt, |
| 1436 | .unsigned => Condition.cc, |
| 1437 | }, |
| 1438 | else => unreachable, |
| 1439 | }; |
| 1440 | |
| 1441 | _ = try self.addInst(.{ |
| 1442 | .tag = .csel, |
| 1443 | .data = .{ .rrr_cond = .{ |
| 1444 | .rd = dest_reg, |
| 1445 | .rn = lhs_reg, |
| 1446 | .rm = rhs_reg, |
| 1447 | .cond = cond_choose_lhs, |
| 1448 | } }, |
| 1449 | }); |
| 1450 | |
| 1451 | return MCValue{ .register = dest_reg }; |
| 1452 | } else { |
| 1453 | return self.fail("TODO ARM min/max on integers > u32/i32", .{}); |
| 1454 | } |
| 1455 | }, |
| 1456 | else => unreachable, |
| 1457 | } |
| 1458 | } |
| 1459 | |
| 1460 | fn airMinMax(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1461 | const tag = self.air.instructions.items(.tag)[@intFromEnum(inst)]; |
| 1462 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 1463 | const lhs_ty = self.typeOf(bin_op.lhs); |
| 1464 | const rhs_ty = self.typeOf(bin_op.rhs); |
| 1465 | |
| 1466 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 1467 | const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; |
| 1468 | const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; |
| 1469 | |
| 1470 | const lhs = try self.resolveInst(bin_op.lhs); |
| 1471 | if (bin_op.lhs == bin_op.rhs) break :result lhs; |
| 1472 | |
| 1473 | break :result try self.minMax(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst); |
| 1474 | }; |
| 1475 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 1476 | } |
| 1477 | |
| 1478 | fn airSlice(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 1479 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 1480 | const bin_op = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 1481 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 1482 | const ptr = try self.resolveInst(bin_op.lhs); |
| 1483 | const ptr_ty = self.typeOf(bin_op.lhs); |
| 1484 | const len = try self.resolveInst(bin_op.rhs); |
| 1485 | const len_ty = self.typeOf(bin_op.rhs); |
| 1486 | |
| 1487 | const stack_offset = try self.allocMem(16, .@"8", inst); |
| 1488 | try self.genSetStack(ptr_ty, stack_offset, ptr); |
| 1489 | try self.genSetStack(len_ty, stack_offset - 8, len); |
| 1490 | break :result MCValue{ .stack_offset = stack_offset }; |
| 1491 | }; |
| 1492 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 1493 | } |
| 1494 | |
| 1495 | /// An argument to a Mir instruction which is read (and possibly also |
| 1496 | /// written to) by the respective instruction |
| 1497 | const ReadArg = struct { |
| 1498 | ty: Type, |
| 1499 | bind: Bind, |
| 1500 | class: RegisterManager.RegisterBitSet, |
| 1501 | reg: *Register, |
| 1502 | |
| 1503 | const Bind = union(enum) { |
| 1504 | inst: Air.Inst.Ref, |
| 1505 | mcv: MCValue, |
| 1506 | |
| 1507 | fn resolveToMcv(bind: Bind, function: *Self) InnerError!MCValue { |
| 1508 | return switch (bind) { |
| 1509 | .inst => |inst| try function.resolveInst(inst), |
| 1510 | .mcv => |mcv| mcv, |
| 1511 | }; |
| 1512 | } |
| 1513 | |
| 1514 | fn resolveToImmediate(bind: Bind, function: *Self) InnerError!?u64 { |
| 1515 | switch (bind) { |
| 1516 | .inst => |inst| { |
| 1517 | // TODO resolve independently of inst_table |
| 1518 | const mcv = try function.resolveInst(inst); |
| 1519 | switch (mcv) { |
| 1520 | .immediate => |imm| return imm, |
| 1521 | else => return null, |
| 1522 | } |
| 1523 | }, |
| 1524 | .mcv => |mcv| { |
| 1525 | switch (mcv) { |
| 1526 | .immediate => |imm| return imm, |
| 1527 | else => return null, |
| 1528 | } |
| 1529 | }, |
| 1530 | } |
| 1531 | } |
| 1532 | }; |
| 1533 | }; |
| 1534 | |
| 1535 | /// An argument to a Mir instruction which is written to (but not read |
| 1536 | /// from) by the respective instruction |
| 1537 | const WriteArg = struct { |
| 1538 | ty: Type, |
| 1539 | bind: Bind, |
| 1540 | class: RegisterManager.RegisterBitSet, |
| 1541 | reg: *Register, |
| 1542 | |
| 1543 | const Bind = union(enum) { |
| 1544 | reg: Register, |
| 1545 | none: void, |
| 1546 | }; |
| 1547 | }; |
| 1548 | |
| 1549 | /// Holds all data necessary for enabling the potential reuse of |
| 1550 | /// operand registers as destinations |
| 1551 | const ReuseMetadata = struct { |
| 1552 | corresponding_inst: Air.Inst.Index, |
| 1553 | |
| 1554 | /// Maps every element index of read_args to the corresponding |
| 1555 | /// index in the Air instruction |
| 1556 | /// |
| 1557 | /// When the order of read_args corresponds exactly to the order |
| 1558 | /// of the inputs of the Air instruction, this would be e.g. |
| 1559 | /// &.{ 0, 1 }. However, when the order is not the same or some |
| 1560 | /// inputs to the Air instruction are omitted (e.g. when they can |
| 1561 | /// be represented as immediates to the Mir instruction), |
| 1562 | /// operand_mapping should reflect that fact. |
| 1563 | operand_mapping: []const Air.Liveness.OperandInt, |
| 1564 | }; |
| 1565 | |
| 1566 | /// Allocate a set of registers for use as arguments for a Mir |
| 1567 | /// instruction |
| 1568 | /// |
| 1569 | /// If the Mir instruction these registers are allocated for |
| 1570 | /// corresponds exactly to a single Air instruction, populate |
| 1571 | /// reuse_metadata in order to enable potential reuse of an operand as |
| 1572 | /// the destination (provided that that operand dies in this |
| 1573 | /// instruction). |
| 1574 | /// |
| 1575 | /// Reusing an operand register as destination is the only time two |
| 1576 | /// arguments may share the same register. In all other cases, |
| 1577 | /// allocRegs guarantees that a register will never be allocated to |
| 1578 | /// more than one argument. |
| 1579 | /// |
| 1580 | /// Furthermore, allocReg guarantees that all arguments which are |
| 1581 | /// already bound to registers before calling allocRegs will not |
| 1582 | /// change their register binding. This is done by locking these |
| 1583 | /// registers. |
| 1584 | fn allocRegs( |
| 1585 | self: *Self, |
| 1586 | read_args: []const ReadArg, |
| 1587 | write_args: []const WriteArg, |
| 1588 | reuse_metadata: ?ReuseMetadata, |
| 1589 | ) InnerError!void { |
| 1590 | // Air instructions have exactly one output |
| 1591 | assert(!(reuse_metadata != null and write_args.len != 1)); // see note above |
| 1592 | |
| 1593 | // The operand mapping is a 1:1 mapping of read args to their |
| 1594 | // corresponding operand index in the Air instruction |
| 1595 | assert(!(reuse_metadata != null and reuse_metadata.?.operand_mapping.len != read_args.len)); // see note above |
| 1596 | |
| 1597 | const locks = try self.gpa.alloc(?RegisterLock, read_args.len + write_args.len); |
| 1598 | defer self.gpa.free(locks); |
| 1599 | const read_locks = locks[0..read_args.len]; |
| 1600 | const write_locks = locks[read_args.len..]; |
| 1601 | |
| 1602 | @memset(locks, null); |
| 1603 | defer for (locks) |lock| { |
| 1604 | if (lock) |locked_reg| self.register_manager.unlockReg(locked_reg); |
| 1605 | }; |
| 1606 | |
| 1607 | // When we reuse a read_arg as a destination, the corresponding |
| 1608 | // MCValue of the read_arg will be set to .dead. In that case, we |
| 1609 | // skip allocating this read_arg. |
| 1610 | var reused_read_arg: ?usize = null; |
| 1611 | |
| 1612 | // Lock all args which are already allocated to registers |
| 1613 | for (read_args, 0..) |arg, i| { |
| 1614 | const mcv = try arg.bind.resolveToMcv(self); |
| 1615 | if (mcv == .register) { |
| 1616 | read_locks[i] = self.register_manager.lockReg(mcv.register); |
| 1617 | } |
| 1618 | } |
| 1619 | |
| 1620 | for (write_args, 0..) |arg, i| { |
| 1621 | if (arg.bind == .reg) { |
| 1622 | write_locks[i] = self.register_manager.lockReg(arg.bind.reg); |
| 1623 | } |
| 1624 | } |
| 1625 | |
| 1626 | // Allocate registers for all args which aren't allocated to |
| 1627 | // registers yet |
| 1628 | for (read_args, 0..) |arg, i| { |
| 1629 | const mcv = try arg.bind.resolveToMcv(self); |
| 1630 | if (mcv == .register) { |
| 1631 | const raw_reg = mcv.register; |
| 1632 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1633 | } else { |
| 1634 | const track_inst: ?Air.Inst.Index = switch (arg.bind) { |
| 1635 | .inst => |inst| inst.toIndex().?, |
| 1636 | else => null, |
| 1637 | }; |
| 1638 | const raw_reg = try self.register_manager.allocReg(track_inst, gp); |
| 1639 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1640 | read_locks[i] = self.register_manager.lockRegAssumeUnused(arg.reg.*); |
| 1641 | } |
| 1642 | } |
| 1643 | |
| 1644 | if (reuse_metadata != null) { |
| 1645 | const inst = reuse_metadata.?.corresponding_inst; |
| 1646 | const operand_mapping = reuse_metadata.?.operand_mapping; |
| 1647 | const arg = write_args[0]; |
| 1648 | if (arg.bind == .reg) { |
| 1649 | const raw_reg = arg.bind.reg; |
| 1650 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1651 | } else { |
| 1652 | reuse_operand: for (read_args, 0..) |read_arg, i| { |
| 1653 | if (read_arg.bind == .inst) { |
| 1654 | const operand = read_arg.bind.inst; |
| 1655 | const mcv = try self.resolveInst(operand); |
| 1656 | if (mcv == .register and |
| 1657 | std.meta.eql(arg.class, read_arg.class) and |
| 1658 | self.reuseOperand(inst, operand, operand_mapping[i], mcv)) |
| 1659 | { |
| 1660 | const raw_reg = mcv.register; |
| 1661 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1662 | write_locks[0] = null; |
| 1663 | reused_read_arg = i; |
| 1664 | break :reuse_operand; |
| 1665 | } |
| 1666 | } |
| 1667 | } else { |
| 1668 | const raw_reg = try self.register_manager.allocReg(inst, arg.class); |
| 1669 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1670 | write_locks[0] = self.register_manager.lockReg(arg.reg.*); |
| 1671 | } |
| 1672 | } |
| 1673 | } else { |
| 1674 | for (write_args, 0..) |arg, i| { |
| 1675 | if (arg.bind == .reg) { |
| 1676 | const raw_reg = arg.bind.reg; |
| 1677 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1678 | } else { |
| 1679 | const raw_reg = try self.register_manager.allocReg(null, arg.class); |
| 1680 | arg.reg.* = self.registerAlias(raw_reg, arg.ty); |
| 1681 | write_locks[i] = self.register_manager.lockReg(arg.reg.*); |
| 1682 | } |
| 1683 | } |
| 1684 | } |
| 1685 | |
| 1686 | // For all read_args which need to be moved from non-register to |
| 1687 | // register, perform the move |
| 1688 | for (read_args, 0..) |arg, i| { |
| 1689 | if (reused_read_arg) |j| { |
| 1690 | // Check whether this read_arg was reused |
| 1691 | if (i == j) continue; |
| 1692 | } |
| 1693 | |
| 1694 | const mcv = try arg.bind.resolveToMcv(self); |
| 1695 | if (mcv != .register) { |
| 1696 | if (arg.bind == .inst) { |
| 1697 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 1698 | const inst = arg.bind.inst.toIndex().?; |
| 1699 | |
| 1700 | // Overwrite the MCValue associated with this inst |
| 1701 | branch.inst_table.putAssumeCapacity(inst, .{ .register = arg.reg.* }); |
| 1702 | |
| 1703 | // If the previous MCValue occupied some space we track, we |
| 1704 | // need to make sure it is marked as free now. |
| 1705 | switch (mcv) { |
| 1706 | .compare_flags => { |
| 1707 | assert(self.compare_flags_inst.? == inst); |
| 1708 | self.compare_flags_inst = null; |
| 1709 | }, |
| 1710 | .register => |prev_reg| { |
| 1711 | assert(!self.register_manager.isRegFree(prev_reg)); |
| 1712 | self.register_manager.freeReg(prev_reg); |
| 1713 | }, |
| 1714 | else => {}, |
| 1715 | } |
| 1716 | } |
| 1717 | |
| 1718 | try self.genSetReg(arg.ty, arg.reg.*, mcv); |
| 1719 | } |
| 1720 | } |
| 1721 | } |
| 1722 | |
| 1723 | /// Wrapper around allocRegs and addInst tailored for specific Mir |
| 1724 | /// instructions which are binary operations acting on two registers |
| 1725 | /// |
| 1726 | /// Returns the destination register |
| 1727 | fn binOpRegister( |
| 1728 | self: *Self, |
| 1729 | mir_tag: Mir.Inst.Tag, |
| 1730 | lhs_bind: ReadArg.Bind, |
| 1731 | rhs_bind: ReadArg.Bind, |
| 1732 | lhs_ty: Type, |
| 1733 | rhs_ty: Type, |
| 1734 | maybe_inst: ?Air.Inst.Index, |
| 1735 | ) !MCValue { |
| 1736 | var lhs_reg: Register = undefined; |
| 1737 | var rhs_reg: Register = undefined; |
| 1738 | var dest_reg: Register = undefined; |
| 1739 | |
| 1740 | const read_args = [_]ReadArg{ |
| 1741 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 1742 | .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, |
| 1743 | }; |
| 1744 | const write_args = [_]WriteArg{ |
| 1745 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 1746 | }; |
| 1747 | try self.allocRegs( |
| 1748 | &read_args, |
| 1749 | &write_args, |
| 1750 | if (maybe_inst) |inst| .{ |
| 1751 | .corresponding_inst = inst, |
| 1752 | .operand_mapping = &.{ 0, 1 }, |
| 1753 | } else null, |
| 1754 | ); |
| 1755 | |
| 1756 | const mir_data: Mir.Inst.Data = switch (mir_tag) { |
| 1757 | .add_shifted_register, |
| 1758 | .adds_shifted_register, |
| 1759 | .sub_shifted_register, |
| 1760 | .subs_shifted_register, |
| 1761 | => .{ .rrr_imm6_shift = .{ |
| 1762 | .rd = dest_reg, |
| 1763 | .rn = lhs_reg, |
| 1764 | .rm = rhs_reg, |
| 1765 | .imm6 = 0, |
| 1766 | .shift = .lsl, |
| 1767 | } }, |
| 1768 | .mul, |
| 1769 | .lsl_register, |
| 1770 | .asr_register, |
| 1771 | .lsr_register, |
| 1772 | .sdiv, |
| 1773 | .udiv, |
| 1774 | => .{ .rrr = .{ |
| 1775 | .rd = dest_reg, |
| 1776 | .rn = lhs_reg, |
| 1777 | .rm = rhs_reg, |
| 1778 | } }, |
| 1779 | .smull, |
| 1780 | .umull, |
| 1781 | => .{ .rrr = .{ |
| 1782 | .rd = dest_reg.toX(), |
| 1783 | .rn = lhs_reg, |
| 1784 | .rm = rhs_reg, |
| 1785 | } }, |
| 1786 | .and_shifted_register, |
| 1787 | .orr_shifted_register, |
| 1788 | .eor_shifted_register, |
| 1789 | => .{ .rrr_imm6_logical_shift = .{ |
| 1790 | .rd = dest_reg, |
| 1791 | .rn = lhs_reg, |
| 1792 | .rm = rhs_reg, |
| 1793 | .imm6 = 0, |
| 1794 | .shift = .lsl, |
| 1795 | } }, |
| 1796 | else => unreachable, |
| 1797 | }; |
| 1798 | |
| 1799 | _ = try self.addInst(.{ |
| 1800 | .tag = mir_tag, |
| 1801 | .data = mir_data, |
| 1802 | }); |
| 1803 | |
| 1804 | return MCValue{ .register = dest_reg }; |
| 1805 | } |
| 1806 | |
| 1807 | /// Wrapper around allocRegs and addInst tailored for specific Mir |
| 1808 | /// instructions which are binary operations acting on a register and |
| 1809 | /// an immediate |
| 1810 | /// |
| 1811 | /// Returns the destination register |
| 1812 | fn binOpImmediate( |
| 1813 | self: *Self, |
| 1814 | mir_tag: Mir.Inst.Tag, |
| 1815 | lhs_bind: ReadArg.Bind, |
| 1816 | rhs_immediate: u64, |
| 1817 | lhs_ty: Type, |
| 1818 | lhs_and_rhs_swapped: bool, |
| 1819 | maybe_inst: ?Air.Inst.Index, |
| 1820 | ) !MCValue { |
| 1821 | var lhs_reg: Register = undefined; |
| 1822 | var dest_reg: Register = undefined; |
| 1823 | |
| 1824 | const read_args = [_]ReadArg{ |
| 1825 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 1826 | }; |
| 1827 | const write_args = [_]WriteArg{ |
| 1828 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 1829 | }; |
| 1830 | const operand_mapping: []const Air.Liveness.OperandInt = if (lhs_and_rhs_swapped) &.{1} else &.{0}; |
| 1831 | try self.allocRegs( |
| 1832 | &read_args, |
| 1833 | &write_args, |
| 1834 | if (maybe_inst) |inst| .{ |
| 1835 | .corresponding_inst = inst, |
| 1836 | .operand_mapping = operand_mapping, |
| 1837 | } else null, |
| 1838 | ); |
| 1839 | |
| 1840 | const mir_data: Mir.Inst.Data = switch (mir_tag) { |
| 1841 | .add_immediate, |
| 1842 | .adds_immediate, |
| 1843 | .sub_immediate, |
| 1844 | .subs_immediate, |
| 1845 | => .{ .rr_imm12_sh = .{ |
| 1846 | .rd = dest_reg, |
| 1847 | .rn = lhs_reg, |
| 1848 | .imm12 = @as(u12, @intCast(rhs_immediate)), |
| 1849 | } }, |
| 1850 | .lsl_immediate, |
| 1851 | .asr_immediate, |
| 1852 | .lsr_immediate, |
| 1853 | => .{ .rr_shift = .{ |
| 1854 | .rd = dest_reg, |
| 1855 | .rn = lhs_reg, |
| 1856 | .shift = @as(u6, @intCast(rhs_immediate)), |
| 1857 | } }, |
| 1858 | else => unreachable, |
| 1859 | }; |
| 1860 | |
| 1861 | _ = try self.addInst(.{ |
| 1862 | .tag = mir_tag, |
| 1863 | .data = mir_data, |
| 1864 | }); |
| 1865 | |
| 1866 | return MCValue{ .register = dest_reg }; |
| 1867 | } |
| 1868 | |
| 1869 | fn addSub( |
| 1870 | self: *Self, |
| 1871 | tag: Air.Inst.Tag, |
| 1872 | lhs_bind: ReadArg.Bind, |
| 1873 | rhs_bind: ReadArg.Bind, |
| 1874 | lhs_ty: Type, |
| 1875 | rhs_ty: Type, |
| 1876 | maybe_inst: ?Air.Inst.Index, |
| 1877 | ) InnerError!MCValue { |
| 1878 | const pt = self.pt; |
| 1879 | const zcu = pt.zcu; |
| 1880 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 1881 | .float => return self.fail("TODO binary operations on floats", .{}), |
| 1882 | .vector => return self.fail("TODO binary operations on vectors", .{}), |
| 1883 | .int => { |
| 1884 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 1885 | const int_info = lhs_ty.intInfo(zcu); |
| 1886 | if (int_info.bits <= 64) { |
| 1887 | const lhs_immediate = try lhs_bind.resolveToImmediate(self); |
| 1888 | const rhs_immediate = try rhs_bind.resolveToImmediate(self); |
| 1889 | |
| 1890 | // Only say yes if the operation is |
| 1891 | // commutative, i.e. we can swap both of the |
| 1892 | // operands |
| 1893 | const lhs_immediate_ok = switch (tag) { |
| 1894 | .add => if (lhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, |
| 1895 | .sub => false, |
| 1896 | else => unreachable, |
| 1897 | }; |
| 1898 | const rhs_immediate_ok = switch (tag) { |
| 1899 | .add, |
| 1900 | .sub, |
| 1901 | => if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, |
| 1902 | else => unreachable, |
| 1903 | }; |
| 1904 | |
| 1905 | const mir_tag_register: Mir.Inst.Tag = switch (tag) { |
| 1906 | .add => .add_shifted_register, |
| 1907 | .sub => .sub_shifted_register, |
| 1908 | else => unreachable, |
| 1909 | }; |
| 1910 | const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { |
| 1911 | .add => .add_immediate, |
| 1912 | .sub => .sub_immediate, |
| 1913 | else => unreachable, |
| 1914 | }; |
| 1915 | |
| 1916 | if (rhs_immediate_ok) { |
| 1917 | return try self.binOpImmediate(mir_tag_immediate, lhs_bind, rhs_immediate.?, lhs_ty, false, maybe_inst); |
| 1918 | } else if (lhs_immediate_ok) { |
| 1919 | // swap lhs and rhs |
| 1920 | return try self.binOpImmediate(mir_tag_immediate, rhs_bind, lhs_immediate.?, rhs_ty, true, maybe_inst); |
| 1921 | } else { |
| 1922 | return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 1923 | } |
| 1924 | } else { |
| 1925 | return self.fail("TODO binary operations on int with bits > 64", .{}); |
| 1926 | } |
| 1927 | }, |
| 1928 | else => unreachable, |
| 1929 | } |
| 1930 | } |
| 1931 | |
| 1932 | fn mul( |
| 1933 | self: *Self, |
| 1934 | lhs_bind: ReadArg.Bind, |
| 1935 | rhs_bind: ReadArg.Bind, |
| 1936 | lhs_ty: Type, |
| 1937 | rhs_ty: Type, |
| 1938 | maybe_inst: ?Air.Inst.Index, |
| 1939 | ) InnerError!MCValue { |
| 1940 | const pt = self.pt; |
| 1941 | const zcu = pt.zcu; |
| 1942 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 1943 | .vector => return self.fail("TODO binary operations on vectors", .{}), |
| 1944 | .int => { |
| 1945 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 1946 | const int_info = lhs_ty.intInfo(zcu); |
| 1947 | if (int_info.bits <= 64) { |
| 1948 | // TODO add optimisations for multiplication |
| 1949 | // with immediates, for example a * 2 can be |
| 1950 | // lowered to a << 1 |
| 1951 | return try self.binOpRegister(.mul, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 1952 | } else { |
| 1953 | return self.fail("TODO binary operations on int with bits > 64", .{}); |
| 1954 | } |
| 1955 | }, |
| 1956 | else => unreachable, |
| 1957 | } |
| 1958 | } |
| 1959 | |
| 1960 | fn divFloat( |
| 1961 | self: *Self, |
| 1962 | lhs_bind: ReadArg.Bind, |
| 1963 | rhs_bind: ReadArg.Bind, |
| 1964 | lhs_ty: Type, |
| 1965 | rhs_ty: Type, |
| 1966 | maybe_inst: ?Air.Inst.Index, |
| 1967 | ) InnerError!MCValue { |
| 1968 | _ = lhs_bind; |
| 1969 | _ = rhs_bind; |
| 1970 | _ = rhs_ty; |
| 1971 | _ = maybe_inst; |
| 1972 | |
| 1973 | const pt = self.pt; |
| 1974 | const zcu = pt.zcu; |
| 1975 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 1976 | .float => return self.fail("TODO div_float", .{}), |
| 1977 | .vector => return self.fail("TODO div_float on vectors", .{}), |
| 1978 | else => unreachable, |
| 1979 | } |
| 1980 | } |
| 1981 | |
| 1982 | fn divTrunc( |
| 1983 | self: *Self, |
| 1984 | lhs_bind: ReadArg.Bind, |
| 1985 | rhs_bind: ReadArg.Bind, |
| 1986 | lhs_ty: Type, |
| 1987 | rhs_ty: Type, |
| 1988 | maybe_inst: ?Air.Inst.Index, |
| 1989 | ) InnerError!MCValue { |
| 1990 | const pt = self.pt; |
| 1991 | const zcu = pt.zcu; |
| 1992 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 1993 | .float => return self.fail("TODO div on floats", .{}), |
| 1994 | .vector => return self.fail("TODO div on vectors", .{}), |
| 1995 | .int => { |
| 1996 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 1997 | const int_info = lhs_ty.intInfo(zcu); |
| 1998 | if (int_info.bits <= 64) { |
| 1999 | switch (int_info.signedness) { |
| 2000 | .signed => { |
| 2001 | // TODO optimize integer division by constants |
| 2002 | return try self.binOpRegister(.sdiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2003 | }, |
| 2004 | .unsigned => { |
| 2005 | // TODO optimize integer division by constants |
| 2006 | return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2007 | }, |
| 2008 | } |
| 2009 | } else { |
| 2010 | return self.fail("TODO integer division for ints with bits > 64", .{}); |
| 2011 | } |
| 2012 | }, |
| 2013 | else => unreachable, |
| 2014 | } |
| 2015 | } |
| 2016 | |
| 2017 | fn divFloor( |
| 2018 | self: *Self, |
| 2019 | lhs_bind: ReadArg.Bind, |
| 2020 | rhs_bind: ReadArg.Bind, |
| 2021 | lhs_ty: Type, |
| 2022 | rhs_ty: Type, |
| 2023 | maybe_inst: ?Air.Inst.Index, |
| 2024 | ) InnerError!MCValue { |
| 2025 | const pt = self.pt; |
| 2026 | const zcu = pt.zcu; |
| 2027 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2028 | .float => return self.fail("TODO div on floats", .{}), |
| 2029 | .vector => return self.fail("TODO div on vectors", .{}), |
| 2030 | .int => { |
| 2031 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2032 | const int_info = lhs_ty.intInfo(zcu); |
| 2033 | if (int_info.bits <= 64) { |
| 2034 | switch (int_info.signedness) { |
| 2035 | .signed => { |
| 2036 | return self.fail("TODO div_floor on signed integers", .{}); |
| 2037 | }, |
| 2038 | .unsigned => { |
| 2039 | // TODO optimize integer division by constants |
| 2040 | return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2041 | }, |
| 2042 | } |
| 2043 | } else { |
| 2044 | return self.fail("TODO integer division for ints with bits > 64", .{}); |
| 2045 | } |
| 2046 | }, |
| 2047 | else => unreachable, |
| 2048 | } |
| 2049 | } |
| 2050 | |
| 2051 | fn divExact( |
| 2052 | self: *Self, |
| 2053 | lhs_bind: ReadArg.Bind, |
| 2054 | rhs_bind: ReadArg.Bind, |
| 2055 | lhs_ty: Type, |
| 2056 | rhs_ty: Type, |
| 2057 | maybe_inst: ?Air.Inst.Index, |
| 2058 | ) InnerError!MCValue { |
| 2059 | const pt = self.pt; |
| 2060 | const zcu = pt.zcu; |
| 2061 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2062 | .float => return self.fail("TODO div on floats", .{}), |
| 2063 | .vector => return self.fail("TODO div on vectors", .{}), |
| 2064 | .int => { |
| 2065 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2066 | const int_info = lhs_ty.intInfo(zcu); |
| 2067 | if (int_info.bits <= 64) { |
| 2068 | switch (int_info.signedness) { |
| 2069 | .signed => { |
| 2070 | // TODO optimize integer division by constants |
| 2071 | return try self.binOpRegister(.sdiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2072 | }, |
| 2073 | .unsigned => { |
| 2074 | // TODO optimize integer division by constants |
| 2075 | return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2076 | }, |
| 2077 | } |
| 2078 | } else { |
| 2079 | return self.fail("TODO integer division for ints with bits > 64", .{}); |
| 2080 | } |
| 2081 | }, |
| 2082 | else => unreachable, |
| 2083 | } |
| 2084 | } |
| 2085 | |
| 2086 | fn rem( |
| 2087 | self: *Self, |
| 2088 | lhs_bind: ReadArg.Bind, |
| 2089 | rhs_bind: ReadArg.Bind, |
| 2090 | lhs_ty: Type, |
| 2091 | rhs_ty: Type, |
| 2092 | maybe_inst: ?Air.Inst.Index, |
| 2093 | ) InnerError!MCValue { |
| 2094 | _ = maybe_inst; |
| 2095 | |
| 2096 | const pt = self.pt; |
| 2097 | const zcu = pt.zcu; |
| 2098 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2099 | .float => return self.fail("TODO rem/zcu on floats", .{}), |
| 2100 | .vector => return self.fail("TODO rem/zcu on vectors", .{}), |
| 2101 | .int => { |
| 2102 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2103 | const int_info = lhs_ty.intInfo(zcu); |
| 2104 | if (int_info.bits <= 64) { |
| 2105 | var lhs_reg: Register = undefined; |
| 2106 | var rhs_reg: Register = undefined; |
| 2107 | var quotient_reg: Register = undefined; |
| 2108 | var remainder_reg: Register = undefined; |
| 2109 | |
| 2110 | const read_args = [_]ReadArg{ |
| 2111 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 2112 | .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, |
| 2113 | }; |
| 2114 | const write_args = [_]WriteArg{ |
| 2115 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = "ient_reg }, |
| 2116 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &remainder_reg }, |
| 2117 | }; |
| 2118 | try self.allocRegs( |
| 2119 | &read_args, |
| 2120 | &write_args, |
| 2121 | null, |
| 2122 | ); |
| 2123 | |
| 2124 | _ = try self.addInst(.{ |
| 2125 | .tag = switch (int_info.signedness) { |
| 2126 | .signed => .sdiv, |
| 2127 | .unsigned => .udiv, |
| 2128 | }, |
| 2129 | .data = .{ .rrr = .{ |
| 2130 | .rd = quotient_reg, |
| 2131 | .rn = lhs_reg, |
| 2132 | .rm = rhs_reg, |
| 2133 | } }, |
| 2134 | }); |
| 2135 | |
| 2136 | _ = try self.addInst(.{ |
| 2137 | .tag = .msub, |
| 2138 | .data = .{ .rrrr = .{ |
| 2139 | .rd = remainder_reg, |
| 2140 | .rn = quotient_reg, |
| 2141 | .rm = rhs_reg, |
| 2142 | .ra = lhs_reg, |
| 2143 | } }, |
| 2144 | }); |
| 2145 | |
| 2146 | return MCValue{ .register = remainder_reg }; |
| 2147 | } else { |
| 2148 | return self.fail("TODO rem/zcu for integers with bits > 64", .{}); |
| 2149 | } |
| 2150 | }, |
| 2151 | else => unreachable, |
| 2152 | } |
| 2153 | } |
| 2154 | |
| 2155 | fn modulo( |
| 2156 | self: *Self, |
| 2157 | lhs_bind: ReadArg.Bind, |
| 2158 | rhs_bind: ReadArg.Bind, |
| 2159 | lhs_ty: Type, |
| 2160 | rhs_ty: Type, |
| 2161 | maybe_inst: ?Air.Inst.Index, |
| 2162 | ) InnerError!MCValue { |
| 2163 | _ = lhs_bind; |
| 2164 | _ = rhs_bind; |
| 2165 | _ = rhs_ty; |
| 2166 | _ = maybe_inst; |
| 2167 | |
| 2168 | const pt = self.pt; |
| 2169 | const zcu = pt.zcu; |
| 2170 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2171 | .float => return self.fail("TODO zcu on floats", .{}), |
| 2172 | .vector => return self.fail("TODO zcu on vectors", .{}), |
| 2173 | .int => return self.fail("TODO zcu on ints", .{}), |
| 2174 | else => unreachable, |
| 2175 | } |
| 2176 | } |
| 2177 | |
| 2178 | fn wrappingArithmetic( |
| 2179 | self: *Self, |
| 2180 | tag: Air.Inst.Tag, |
| 2181 | lhs_bind: ReadArg.Bind, |
| 2182 | rhs_bind: ReadArg.Bind, |
| 2183 | lhs_ty: Type, |
| 2184 | rhs_ty: Type, |
| 2185 | maybe_inst: ?Air.Inst.Index, |
| 2186 | ) InnerError!MCValue { |
| 2187 | const pt = self.pt; |
| 2188 | const zcu = pt.zcu; |
| 2189 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2190 | .vector => return self.fail("TODO binary operations on vectors", .{}), |
| 2191 | .int => { |
| 2192 | const int_info = lhs_ty.intInfo(zcu); |
| 2193 | if (int_info.bits <= 64) { |
| 2194 | // Generate an add/sub/mul |
| 2195 | const result: MCValue = switch (tag) { |
| 2196 | .add_wrap => try self.addSub(.add, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), |
| 2197 | .sub_wrap => try self.addSub(.sub, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), |
| 2198 | .mul_wrap => try self.mul(lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), |
| 2199 | else => unreachable, |
| 2200 | }; |
| 2201 | |
| 2202 | // Truncate if necessary |
| 2203 | const result_reg = result.register; |
| 2204 | try self.truncRegister(result_reg, result_reg, int_info.signedness, int_info.bits); |
| 2205 | return result; |
| 2206 | } else { |
| 2207 | return self.fail("TODO binary operations on integers > u64/i64", .{}); |
| 2208 | } |
| 2209 | }, |
| 2210 | else => unreachable, |
| 2211 | } |
| 2212 | } |
| 2213 | |
| 2214 | fn bitwise( |
| 2215 | self: *Self, |
| 2216 | tag: Air.Inst.Tag, |
| 2217 | lhs_bind: ReadArg.Bind, |
| 2218 | rhs_bind: ReadArg.Bind, |
| 2219 | lhs_ty: Type, |
| 2220 | rhs_ty: Type, |
| 2221 | maybe_inst: ?Air.Inst.Index, |
| 2222 | ) InnerError!MCValue { |
| 2223 | const pt = self.pt; |
| 2224 | const zcu = pt.zcu; |
| 2225 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2226 | .vector => return self.fail("TODO binary operations on vectors", .{}), |
| 2227 | .int => { |
| 2228 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2229 | const int_info = lhs_ty.intInfo(zcu); |
| 2230 | if (int_info.bits <= 64) { |
| 2231 | // TODO implement bitwise operations with immediates |
| 2232 | const mir_tag: Mir.Inst.Tag = switch (tag) { |
| 2233 | .bit_and => .and_shifted_register, |
| 2234 | .bit_or => .orr_shifted_register, |
| 2235 | .xor => .eor_shifted_register, |
| 2236 | else => unreachable, |
| 2237 | }; |
| 2238 | |
| 2239 | return try self.binOpRegister(mir_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2240 | } else { |
| 2241 | return self.fail("TODO binary operations on int with bits > 64", .{}); |
| 2242 | } |
| 2243 | }, |
| 2244 | else => unreachable, |
| 2245 | } |
| 2246 | } |
| 2247 | |
| 2248 | fn shiftExact( |
| 2249 | self: *Self, |
| 2250 | tag: Air.Inst.Tag, |
| 2251 | lhs_bind: ReadArg.Bind, |
| 2252 | rhs_bind: ReadArg.Bind, |
| 2253 | lhs_ty: Type, |
| 2254 | rhs_ty: Type, |
| 2255 | maybe_inst: ?Air.Inst.Index, |
| 2256 | ) InnerError!MCValue { |
| 2257 | const pt = self.pt; |
| 2258 | const zcu = pt.zcu; |
| 2259 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2260 | .vector => if (!rhs_ty.isVector(zcu)) |
| 2261 | return self.fail("TODO vector shift with scalar rhs", .{}) |
| 2262 | else |
| 2263 | return self.fail("TODO binary operations on vectors", .{}), |
| 2264 | .int => { |
| 2265 | const int_info = lhs_ty.intInfo(zcu); |
| 2266 | if (int_info.bits <= 64) { |
| 2267 | const rhs_immediate = try rhs_bind.resolveToImmediate(self); |
| 2268 | |
| 2269 | const mir_tag_register: Mir.Inst.Tag = switch (tag) { |
| 2270 | .shl_exact => .lsl_register, |
| 2271 | .shr_exact => switch (int_info.signedness) { |
| 2272 | .signed => Mir.Inst.Tag.asr_register, |
| 2273 | .unsigned => Mir.Inst.Tag.lsr_register, |
| 2274 | }, |
| 2275 | else => unreachable, |
| 2276 | }; |
| 2277 | const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { |
| 2278 | .shl_exact => .lsl_immediate, |
| 2279 | .shr_exact => switch (int_info.signedness) { |
| 2280 | .signed => Mir.Inst.Tag.asr_immediate, |
| 2281 | .unsigned => Mir.Inst.Tag.lsr_immediate, |
| 2282 | }, |
| 2283 | else => unreachable, |
| 2284 | }; |
| 2285 | |
| 2286 | if (rhs_immediate) |imm| { |
| 2287 | return try self.binOpImmediate(mir_tag_immediate, lhs_bind, imm, lhs_ty, false, maybe_inst); |
| 2288 | } else { |
| 2289 | // We intentionally pass lhs_ty here in order to |
| 2290 | // prevent using the 32-bit register alias when |
| 2291 | // lhs_ty is > 32 bits. |
| 2292 | return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, lhs_ty, maybe_inst); |
| 2293 | } |
| 2294 | } else { |
| 2295 | return self.fail("TODO binary operations on int with bits > 64", .{}); |
| 2296 | } |
| 2297 | }, |
| 2298 | else => unreachable, |
| 2299 | } |
| 2300 | } |
| 2301 | |
| 2302 | fn shiftNormal( |
| 2303 | self: *Self, |
| 2304 | tag: Air.Inst.Tag, |
| 2305 | lhs_bind: ReadArg.Bind, |
| 2306 | rhs_bind: ReadArg.Bind, |
| 2307 | lhs_ty: Type, |
| 2308 | rhs_ty: Type, |
| 2309 | maybe_inst: ?Air.Inst.Index, |
| 2310 | ) InnerError!MCValue { |
| 2311 | const pt = self.pt; |
| 2312 | const zcu = pt.zcu; |
| 2313 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2314 | .vector => if (!rhs_ty.isVector(zcu)) |
| 2315 | return self.fail("TODO vector shift with scalar rhs", .{}) |
| 2316 | else |
| 2317 | return self.fail("TODO binary operations on vectors", .{}), |
| 2318 | .int => { |
| 2319 | const int_info = lhs_ty.intInfo(zcu); |
| 2320 | if (int_info.bits <= 64) { |
| 2321 | // Generate a shl_exact/shr_exact |
| 2322 | const result: MCValue = switch (tag) { |
| 2323 | .shl => try self.shiftExact(.shl_exact, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), |
| 2324 | .shr => try self.shiftExact(.shr_exact, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), |
| 2325 | else => unreachable, |
| 2326 | }; |
| 2327 | |
| 2328 | // Truncate if necessary |
| 2329 | switch (tag) { |
| 2330 | .shr => return result, |
| 2331 | .shl => { |
| 2332 | const result_reg = result.register; |
| 2333 | try self.truncRegister(result_reg, result_reg, int_info.signedness, int_info.bits); |
| 2334 | return result; |
| 2335 | }, |
| 2336 | else => unreachable, |
| 2337 | } |
| 2338 | } else { |
| 2339 | return self.fail("TODO binary operations on integers > u64/i64", .{}); |
| 2340 | } |
| 2341 | }, |
| 2342 | else => unreachable, |
| 2343 | } |
| 2344 | } |
| 2345 | |
| 2346 | fn booleanOp( |
| 2347 | self: *Self, |
| 2348 | tag: Air.Inst.Tag, |
| 2349 | lhs_bind: ReadArg.Bind, |
| 2350 | rhs_bind: ReadArg.Bind, |
| 2351 | lhs_ty: Type, |
| 2352 | rhs_ty: Type, |
| 2353 | maybe_inst: ?Air.Inst.Index, |
| 2354 | ) InnerError!MCValue { |
| 2355 | const pt = self.pt; |
| 2356 | const zcu = pt.zcu; |
| 2357 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2358 | .bool => { |
| 2359 | assert((try lhs_bind.resolveToImmediate(self)) == null); // should have been handled by Sema |
| 2360 | assert((try rhs_bind.resolveToImmediate(self)) == null); // should have been handled by Sema |
| 2361 | |
| 2362 | const mir_tag_register: Mir.Inst.Tag = switch (tag) { |
| 2363 | .bool_and => .and_shifted_register, |
| 2364 | .bool_or => .orr_shifted_register, |
| 2365 | else => unreachable, |
| 2366 | }; |
| 2367 | |
| 2368 | return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); |
| 2369 | }, |
| 2370 | else => unreachable, |
| 2371 | } |
| 2372 | } |
| 2373 | |
| 2374 | fn ptrArithmetic( |
| 2375 | self: *Self, |
| 2376 | tag: Air.Inst.Tag, |
| 2377 | lhs_bind: ReadArg.Bind, |
| 2378 | rhs_bind: ReadArg.Bind, |
| 2379 | lhs_ty: Type, |
| 2380 | rhs_ty: Type, |
| 2381 | maybe_inst: ?Air.Inst.Index, |
| 2382 | ) InnerError!MCValue { |
| 2383 | const pt = self.pt; |
| 2384 | const zcu = pt.zcu; |
| 2385 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2386 | .pointer => { |
| 2387 | assert(rhs_ty.eql(Type.usize, zcu)); |
| 2388 | |
| 2389 | const ptr_ty = lhs_ty; |
| 2390 | const elem_ty = switch (ptr_ty.ptrSize(zcu)) { |
| 2391 | .one => ptr_ty.childType(zcu).childType(zcu), // ptr to array, so get array element type |
| 2392 | else => ptr_ty.childType(zcu), |
| 2393 | }; |
| 2394 | const elem_size = elem_ty.abiSize(zcu); |
| 2395 | |
| 2396 | const base_tag: Air.Inst.Tag = switch (tag) { |
| 2397 | .ptr_add => .add, |
| 2398 | .ptr_sub => .sub, |
| 2399 | else => unreachable, |
| 2400 | }; |
| 2401 | |
| 2402 | if (elem_size == 1) { |
| 2403 | return try self.addSub(base_tag, lhs_bind, rhs_bind, Type.usize, Type.usize, maybe_inst); |
| 2404 | } else { |
| 2405 | // convert the offset into a byte offset by |
| 2406 | // multiplying it with elem_size |
| 2407 | const imm_bind = ReadArg.Bind{ .mcv = .{ .immediate = elem_size } }; |
| 2408 | |
| 2409 | const offset = try self.mul(rhs_bind, imm_bind, Type.usize, Type.usize, null); |
| 2410 | const offset_bind = ReadArg.Bind{ .mcv = offset }; |
| 2411 | |
| 2412 | const addr = try self.addSub(base_tag, lhs_bind, offset_bind, Type.usize, Type.usize, null); |
| 2413 | return addr; |
| 2414 | } |
| 2415 | }, |
| 2416 | else => unreachable, |
| 2417 | } |
| 2418 | } |
| 2419 | |
| 2420 | fn airBinOp(self: *Self, inst: Air.Inst.Index, tag: Air.Inst.Tag) InnerError!void { |
| 2421 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 2422 | const lhs_ty = self.typeOf(bin_op.lhs); |
| 2423 | const rhs_ty = self.typeOf(bin_op.rhs); |
| 2424 | |
| 2425 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 2426 | const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; |
| 2427 | const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; |
| 2428 | |
| 2429 | break :result switch (tag) { |
| 2430 | .add => try self.addSub(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2431 | .sub => try self.addSub(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2432 | |
| 2433 | .mul => try self.mul(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2434 | |
| 2435 | .div_float => try self.divFloat(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2436 | |
| 2437 | .div_trunc => try self.divTrunc(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2438 | |
| 2439 | .div_floor => try self.divFloor(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2440 | |
| 2441 | .div_exact => try self.divExact(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2442 | |
| 2443 | .rem => try self.rem(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2444 | |
| 2445 | .mod => try self.modulo(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2446 | |
| 2447 | .add_wrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2448 | .sub_wrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2449 | .mul_wrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2450 | |
| 2451 | .bit_and => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2452 | .bit_or => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2453 | .xor => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2454 | |
| 2455 | .shl_exact => try self.shiftExact(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2456 | .shr_exact => try self.shiftExact(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2457 | |
| 2458 | .shl => try self.shiftNormal(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2459 | .shr => try self.shiftNormal(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2460 | |
| 2461 | .bool_and => try self.booleanOp(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2462 | .bool_or => try self.booleanOp(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), |
| 2463 | |
| 2464 | else => unreachable, |
| 2465 | }; |
| 2466 | }; |
| 2467 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 2468 | } |
| 2469 | |
| 2470 | fn airPtrArithmetic(self: *Self, inst: Air.Inst.Index, tag: Air.Inst.Tag) InnerError!void { |
| 2471 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 2472 | const bin_op = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 2473 | const lhs_ty = self.typeOf(bin_op.lhs); |
| 2474 | const rhs_ty = self.typeOf(bin_op.rhs); |
| 2475 | |
| 2476 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 2477 | const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; |
| 2478 | const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; |
| 2479 | |
| 2480 | break :result try self.ptrArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst); |
| 2481 | }; |
| 2482 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 2483 | } |
| 2484 | |
| 2485 | fn airAddSat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2486 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 2487 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement add_sat for {}", .{self.target.cpu.arch}); |
| 2488 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 2489 | } |
| 2490 | |
| 2491 | fn airSubSat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2492 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 2493 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement sub_sat for {}", .{self.target.cpu.arch}); |
| 2494 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 2495 | } |
| 2496 | |
| 2497 | fn airMulSat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2498 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 2499 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement mul_sat for {}", .{self.target.cpu.arch}); |
| 2500 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 2501 | } |
| 2502 | |
| 2503 | fn airOverflow(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2504 | const tag = self.air.instructions.items(.tag)[@intFromEnum(inst)]; |
| 2505 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 2506 | const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 2507 | const pt = self.pt; |
| 2508 | const zcu = pt.zcu; |
| 2509 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 2510 | const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; |
| 2511 | const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; |
| 2512 | const lhs_ty = self.typeOf(extra.lhs); |
| 2513 | const rhs_ty = self.typeOf(extra.rhs); |
| 2514 | |
| 2515 | const tuple_ty = self.typeOfIndex(inst); |
| 2516 | const tuple_size: u32 = @intCast(tuple_ty.abiSize(zcu)); |
| 2517 | const tuple_align = tuple_ty.abiAlignment(zcu); |
| 2518 | const overflow_bit_offset: u32 = @intCast(tuple_ty.structFieldOffset(1, zcu)); |
| 2519 | |
| 2520 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2521 | .vector => return self.fail("TODO implement add_with_overflow/sub_with_overflow for vectors", .{}), |
| 2522 | .int => { |
| 2523 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2524 | const int_info = lhs_ty.intInfo(zcu); |
| 2525 | switch (int_info.bits) { |
| 2526 | 1...31, 33...63 => { |
| 2527 | const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); |
| 2528 | |
| 2529 | try self.spillCompareFlagsIfOccupied(); |
| 2530 | self.compare_flags_inst = null; |
| 2531 | |
| 2532 | const base_tag: Air.Inst.Tag = switch (tag) { |
| 2533 | .add_with_overflow => .add, |
| 2534 | .sub_with_overflow => .sub, |
| 2535 | else => unreachable, |
| 2536 | }; |
| 2537 | const dest = try self.addSub(base_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); |
| 2538 | const dest_reg = dest.register; |
| 2539 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 2540 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 2541 | |
| 2542 | const raw_truncated_reg = try self.register_manager.allocReg(null, gp); |
| 2543 | const truncated_reg = self.registerAlias(raw_truncated_reg, lhs_ty); |
| 2544 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 2545 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 2546 | |
| 2547 | // sbfx/ubfx truncated, dest, #0, #bits |
| 2548 | try self.truncRegister(dest_reg, truncated_reg, int_info.signedness, int_info.bits); |
| 2549 | |
| 2550 | // cmp dest, truncated |
| 2551 | _ = try self.addInst(.{ |
| 2552 | .tag = .cmp_shifted_register, |
| 2553 | .data = .{ .rr_imm6_shift = .{ |
| 2554 | .rn = dest_reg, |
| 2555 | .rm = truncated_reg, |
| 2556 | .imm6 = 0, |
| 2557 | .shift = .lsl, |
| 2558 | } }, |
| 2559 | }); |
| 2560 | |
| 2561 | try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); |
| 2562 | try self.genSetStack(Type.u1, stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); |
| 2563 | |
| 2564 | break :result MCValue{ .stack_offset = stack_offset }; |
| 2565 | }, |
| 2566 | 32, 64 => { |
| 2567 | const lhs_immediate = try lhs_bind.resolveToImmediate(self); |
| 2568 | const rhs_immediate = try rhs_bind.resolveToImmediate(self); |
| 2569 | |
| 2570 | // Only say yes if the operation is |
| 2571 | // commutative, i.e. we can swap both of the |
| 2572 | // operands |
| 2573 | const lhs_immediate_ok = switch (tag) { |
| 2574 | .add_with_overflow => if (lhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, |
| 2575 | .sub_with_overflow => false, |
| 2576 | else => unreachable, |
| 2577 | }; |
| 2578 | const rhs_immediate_ok = switch (tag) { |
| 2579 | .add_with_overflow, |
| 2580 | .sub_with_overflow, |
| 2581 | => if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, |
| 2582 | else => unreachable, |
| 2583 | }; |
| 2584 | |
| 2585 | const mir_tag_register: Mir.Inst.Tag = switch (tag) { |
| 2586 | .add_with_overflow => .adds_shifted_register, |
| 2587 | .sub_with_overflow => .subs_shifted_register, |
| 2588 | else => unreachable, |
| 2589 | }; |
| 2590 | const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { |
| 2591 | .add_with_overflow => .adds_immediate, |
| 2592 | .sub_with_overflow => .subs_immediate, |
| 2593 | else => unreachable, |
| 2594 | }; |
| 2595 | |
| 2596 | try self.spillCompareFlagsIfOccupied(); |
| 2597 | self.compare_flags_inst = inst; |
| 2598 | |
| 2599 | const dest = blk: { |
| 2600 | if (rhs_immediate_ok) { |
| 2601 | break :blk try self.binOpImmediate(mir_tag_immediate, lhs_bind, rhs_immediate.?, lhs_ty, false, null); |
| 2602 | } else if (lhs_immediate_ok) { |
| 2603 | // swap lhs and rhs |
| 2604 | break :blk try self.binOpImmediate(mir_tag_immediate, rhs_bind, lhs_immediate.?, rhs_ty, true, null); |
| 2605 | } else { |
| 2606 | break :blk try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); |
| 2607 | } |
| 2608 | }; |
| 2609 | |
| 2610 | const flag: bits.Instruction.Condition = switch (int_info.signedness) { |
| 2611 | .unsigned => switch (tag) { |
| 2612 | .add_with_overflow => bits.Instruction.Condition.cs, |
| 2613 | .sub_with_overflow => bits.Instruction.Condition.cc, |
| 2614 | else => unreachable, |
| 2615 | }, |
| 2616 | .signed => .vs, |
| 2617 | }; |
| 2618 | break :result MCValue{ .register_with_overflow = .{ |
| 2619 | .reg = dest.register, |
| 2620 | .flag = flag, |
| 2621 | } }; |
| 2622 | }, |
| 2623 | else => return self.fail("TODO overflow operations on integers > u32/i32", .{}), |
| 2624 | } |
| 2625 | }, |
| 2626 | else => unreachable, |
| 2627 | } |
| 2628 | }; |
| 2629 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); |
| 2630 | } |
| 2631 | |
| 2632 | fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2633 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 2634 | const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 2635 | if (self.liveness.isUnused(inst)) return self.finishAir(inst, .dead, .{ extra.lhs, extra.rhs, .none }); |
| 2636 | const zcu = self.pt.zcu; |
| 2637 | const result: MCValue = result: { |
| 2638 | const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; |
| 2639 | const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; |
| 2640 | const lhs_ty = self.typeOf(extra.lhs); |
| 2641 | const rhs_ty = self.typeOf(extra.rhs); |
| 2642 | |
| 2643 | const tuple_ty = self.typeOfIndex(inst); |
| 2644 | const tuple_size = @as(u32, @intCast(tuple_ty.abiSize(zcu))); |
| 2645 | const tuple_align = tuple_ty.abiAlignment(zcu); |
| 2646 | const overflow_bit_offset = @as(u32, @intCast(tuple_ty.structFieldOffset(1, zcu))); |
| 2647 | |
| 2648 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2649 | .vector => return self.fail("TODO implement mul_with_overflow for vectors", .{}), |
| 2650 | .int => { |
| 2651 | assert(lhs_ty.eql(rhs_ty, zcu)); |
| 2652 | const int_info = lhs_ty.intInfo(zcu); |
| 2653 | if (int_info.bits <= 32) { |
| 2654 | const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); |
| 2655 | |
| 2656 | try self.spillCompareFlagsIfOccupied(); |
| 2657 | |
| 2658 | const base_tag: Mir.Inst.Tag = switch (int_info.signedness) { |
| 2659 | .signed => .smull, |
| 2660 | .unsigned => .umull, |
| 2661 | }; |
| 2662 | |
| 2663 | const dest = try self.binOpRegister(base_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); |
| 2664 | const dest_reg = dest.register; |
| 2665 | const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); |
| 2666 | defer self.register_manager.unlockReg(dest_reg_lock); |
| 2667 | |
| 2668 | const truncated_reg = try self.register_manager.allocReg(null, gp); |
| 2669 | const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); |
| 2670 | defer self.register_manager.unlockReg(truncated_reg_lock); |
| 2671 | |
| 2672 | try self.truncRegister( |
| 2673 | dest_reg.toW(), |
| 2674 | truncated_reg.toW(), |
| 2675 | int_info.signedness, |
| 2676 | int_info.bits, |
| 2677 | ); |
| 2678 | |
| 2679 | switch (int_info.signedness) { |
| 2680 | .signed => { |
| 2681 | _ = try self.addInst(.{ |
| 2682 | .tag = .cmp_extended_register, |
| 2683 | .data = .{ .rr_extend_shift = .{ |
| 2684 | .rn = dest_reg.toX(), |
| 2685 | .rm = truncated_reg.toW(), |
| 2686 | .ext_type = .sxtw, |
| 2687 | .imm3 = 0, |
| 2688 | } }, |
| 2689 | }); |
| 2690 | }, |
| 2691 | .unsigned => { |
| 2692 | _ = try self.addInst(.{ |
| 2693 | .tag = .cmp_extended_register, |
| 2694 | .data = .{ .rr_extend_shift = .{ |
| 2695 | .rn = dest_reg.toX(), |
| 2696 | .rm = truncated_reg.toW(), |
| 2697 | .ext_type = .uxtw, |
| 2698 | .imm3 = 0, |
| 2699 | } }, |
| 2700 | }); |
| 2701 | }, |
| 2702 | } |
| 2703 | |
| 2704 | try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); |
| 2705 | try self.genSetStack(Type.u1, stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); |
| 2706 | |
| 2707 | break :result MCValue{ .stack_offset = stack_offset }; |
| 2708 | } else if (int_info.bits <= 64) { |
| 2709 | const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); |
| 2710 | |
| 2711 | try self.spillCompareFlagsIfOccupied(); |
| 2712 | |
| 2713 | var lhs_reg: Register = undefined; |
| 2714 | var rhs_reg: Register = undefined; |
| 2715 | var dest_reg: Register = undefined; |
| 2716 | var dest_high_reg: Register = undefined; |
| 2717 | var truncated_reg: Register = undefined; |
| 2718 | |
| 2719 | const read_args = [_]ReadArg{ |
| 2720 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 2721 | .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, |
| 2722 | }; |
| 2723 | const write_args = [_]WriteArg{ |
| 2724 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 2725 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_high_reg }, |
| 2726 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &truncated_reg }, |
| 2727 | }; |
| 2728 | try self.allocRegs( |
| 2729 | &read_args, |
| 2730 | &write_args, |
| 2731 | null, |
| 2732 | ); |
| 2733 | |
| 2734 | switch (int_info.signedness) { |
| 2735 | .signed => { |
| 2736 | // mul dest, lhs, rhs |
| 2737 | _ = try self.addInst(.{ |
| 2738 | .tag = .mul, |
| 2739 | .data = .{ .rrr = .{ |
| 2740 | .rd = dest_reg, |
| 2741 | .rn = lhs_reg, |
| 2742 | .rm = rhs_reg, |
| 2743 | } }, |
| 2744 | }); |
| 2745 | |
| 2746 | // smulh dest_high, lhs, rhs |
| 2747 | _ = try self.addInst(.{ |
| 2748 | .tag = .smulh, |
| 2749 | .data = .{ .rrr = .{ |
| 2750 | .rd = dest_high_reg, |
| 2751 | .rn = lhs_reg, |
| 2752 | .rm = rhs_reg, |
| 2753 | } }, |
| 2754 | }); |
| 2755 | |
| 2756 | // cmp dest_high, dest, asr #63 |
| 2757 | _ = try self.addInst(.{ |
| 2758 | .tag = .cmp_shifted_register, |
| 2759 | .data = .{ .rr_imm6_shift = .{ |
| 2760 | .rn = dest_high_reg, |
| 2761 | .rm = dest_reg, |
| 2762 | .imm6 = 63, |
| 2763 | .shift = .asr, |
| 2764 | } }, |
| 2765 | }); |
| 2766 | |
| 2767 | const shift: u6 = @as(u6, @intCast(@as(u7, 64) - @as(u7, @intCast(int_info.bits)))); |
| 2768 | if (shift > 0) { |
| 2769 | // lsl dest_high, dest, #shift |
| 2770 | _ = try self.addInst(.{ |
| 2771 | .tag = .lsl_immediate, |
| 2772 | .data = .{ .rr_shift = .{ |
| 2773 | .rd = dest_high_reg, |
| 2774 | .rn = dest_reg, |
| 2775 | .shift = shift, |
| 2776 | } }, |
| 2777 | }); |
| 2778 | |
| 2779 | // cmp dest, dest_high, #shift |
| 2780 | _ = try self.addInst(.{ |
| 2781 | .tag = .cmp_shifted_register, |
| 2782 | .data = .{ .rr_imm6_shift = .{ |
| 2783 | .rn = dest_reg, |
| 2784 | .rm = dest_high_reg, |
| 2785 | .imm6 = shift, |
| 2786 | .shift = .asr, |
| 2787 | } }, |
| 2788 | }); |
| 2789 | } |
| 2790 | }, |
| 2791 | .unsigned => { |
| 2792 | // umulh dest_high, lhs, rhs |
| 2793 | _ = try self.addInst(.{ |
| 2794 | .tag = .umulh, |
| 2795 | .data = .{ .rrr = .{ |
| 2796 | .rd = dest_high_reg, |
| 2797 | .rn = lhs_reg, |
| 2798 | .rm = rhs_reg, |
| 2799 | } }, |
| 2800 | }); |
| 2801 | |
| 2802 | // mul dest, lhs, rhs |
| 2803 | _ = try self.addInst(.{ |
| 2804 | .tag = .mul, |
| 2805 | .data = .{ .rrr = .{ |
| 2806 | .rd = dest_reg, |
| 2807 | .rn = lhs_reg, |
| 2808 | .rm = rhs_reg, |
| 2809 | } }, |
| 2810 | }); |
| 2811 | |
| 2812 | _ = try self.addInst(.{ |
| 2813 | .tag = .cmp_immediate, |
| 2814 | .data = .{ .r_imm12_sh = .{ |
| 2815 | .rn = dest_high_reg, |
| 2816 | .imm12 = 0, |
| 2817 | } }, |
| 2818 | }); |
| 2819 | |
| 2820 | if (int_info.bits < 64) { |
| 2821 | // lsr dest_high, dest, #shift |
| 2822 | _ = try self.addInst(.{ |
| 2823 | .tag = .lsr_immediate, |
| 2824 | .data = .{ .rr_shift = .{ |
| 2825 | .rd = dest_high_reg, |
| 2826 | .rn = dest_reg, |
| 2827 | .shift = @as(u6, @intCast(int_info.bits)), |
| 2828 | } }, |
| 2829 | }); |
| 2830 | |
| 2831 | _ = try self.addInst(.{ |
| 2832 | .tag = .cmp_immediate, |
| 2833 | .data = .{ .r_imm12_sh = .{ |
| 2834 | .rn = dest_high_reg, |
| 2835 | .imm12 = 0, |
| 2836 | } }, |
| 2837 | }); |
| 2838 | } |
| 2839 | }, |
| 2840 | } |
| 2841 | |
| 2842 | try self.truncRegister(dest_reg, truncated_reg, int_info.signedness, int_info.bits); |
| 2843 | |
| 2844 | try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); |
| 2845 | try self.genSetStack(Type.u1, stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); |
| 2846 | |
| 2847 | break :result MCValue{ .stack_offset = stack_offset }; |
| 2848 | } else return self.fail("TODO implement mul_with_overflow for integers > u64/i64", .{}); |
| 2849 | }, |
| 2850 | else => unreachable, |
| 2851 | } |
| 2852 | }; |
| 2853 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); |
| 2854 | } |
| 2855 | |
| 2856 | fn airShlWithOverflow(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2857 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 2858 | const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 2859 | if (self.liveness.isUnused(inst)) return self.finishAir(inst, .dead, .{ extra.lhs, extra.rhs, .none }); |
| 2860 | const pt = self.pt; |
| 2861 | const zcu = pt.zcu; |
| 2862 | const result: MCValue = result: { |
| 2863 | const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; |
| 2864 | const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; |
| 2865 | const lhs_ty = self.typeOf(extra.lhs); |
| 2866 | const rhs_ty = self.typeOf(extra.rhs); |
| 2867 | |
| 2868 | const tuple_ty = self.typeOfIndex(inst); |
| 2869 | const tuple_size = @as(u32, @intCast(tuple_ty.abiSize(zcu))); |
| 2870 | const tuple_align = tuple_ty.abiAlignment(zcu); |
| 2871 | const overflow_bit_offset = @as(u32, @intCast(tuple_ty.structFieldOffset(1, zcu))); |
| 2872 | |
| 2873 | switch (lhs_ty.zigTypeTag(zcu)) { |
| 2874 | .vector => if (!rhs_ty.isVector(zcu)) |
| 2875 | return self.fail("TODO implement vector shl_with_overflow with scalar rhs", .{}) |
| 2876 | else |
| 2877 | return self.fail("TODO implement shl_with_overflow for vectors", .{}), |
| 2878 | .int => { |
| 2879 | const int_info = lhs_ty.intInfo(zcu); |
| 2880 | if (int_info.bits <= 64) { |
| 2881 | const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); |
| 2882 | |
| 2883 | try self.spillCompareFlagsIfOccupied(); |
| 2884 | |
| 2885 | var lhs_reg: Register = undefined; |
| 2886 | var rhs_reg: Register = undefined; |
| 2887 | var dest_reg: Register = undefined; |
| 2888 | var reconstructed_reg: Register = undefined; |
| 2889 | |
| 2890 | const rhs_immediate = try rhs_bind.resolveToImmediate(self); |
| 2891 | if (rhs_immediate) |imm| { |
| 2892 | const read_args = [_]ReadArg{ |
| 2893 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 2894 | }; |
| 2895 | const write_args = [_]WriteArg{ |
| 2896 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 2897 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &reconstructed_reg }, |
| 2898 | }; |
| 2899 | try self.allocRegs( |
| 2900 | &read_args, |
| 2901 | &write_args, |
| 2902 | null, |
| 2903 | ); |
| 2904 | |
| 2905 | // lsl dest, lhs, rhs |
| 2906 | _ = try self.addInst(.{ |
| 2907 | .tag = .lsl_immediate, |
| 2908 | .data = .{ .rr_shift = .{ |
| 2909 | .rd = dest_reg, |
| 2910 | .rn = lhs_reg, |
| 2911 | .shift = @as(u6, @intCast(imm)), |
| 2912 | } }, |
| 2913 | }); |
| 2914 | |
| 2915 | try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); |
| 2916 | |
| 2917 | // asr/lsr reconstructed, dest, rhs |
| 2918 | _ = try self.addInst(.{ |
| 2919 | .tag = switch (int_info.signedness) { |
| 2920 | .signed => Mir.Inst.Tag.asr_immediate, |
| 2921 | .unsigned => Mir.Inst.Tag.lsr_immediate, |
| 2922 | }, |
| 2923 | .data = .{ .rr_shift = .{ |
| 2924 | .rd = reconstructed_reg, |
| 2925 | .rn = dest_reg, |
| 2926 | .shift = @as(u6, @intCast(imm)), |
| 2927 | } }, |
| 2928 | }); |
| 2929 | } else { |
| 2930 | const read_args = [_]ReadArg{ |
| 2931 | .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, |
| 2932 | .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, |
| 2933 | }; |
| 2934 | const write_args = [_]WriteArg{ |
| 2935 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 2936 | .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &reconstructed_reg }, |
| 2937 | }; |
| 2938 | try self.allocRegs( |
| 2939 | &read_args, |
| 2940 | &write_args, |
| 2941 | null, |
| 2942 | ); |
| 2943 | |
| 2944 | // lsl dest, lhs, rhs |
| 2945 | _ = try self.addInst(.{ |
| 2946 | .tag = .lsl_register, |
| 2947 | .data = .{ .rrr = .{ |
| 2948 | .rd = dest_reg, |
| 2949 | .rn = lhs_reg, |
| 2950 | .rm = rhs_reg, |
| 2951 | } }, |
| 2952 | }); |
| 2953 | |
| 2954 | try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); |
| 2955 | |
| 2956 | // asr/lsr reconstructed, dest, rhs |
| 2957 | _ = try self.addInst(.{ |
| 2958 | .tag = switch (int_info.signedness) { |
| 2959 | .signed => Mir.Inst.Tag.asr_register, |
| 2960 | .unsigned => Mir.Inst.Tag.lsr_register, |
| 2961 | }, |
| 2962 | .data = .{ .rrr = .{ |
| 2963 | .rd = reconstructed_reg, |
| 2964 | .rn = dest_reg, |
| 2965 | .rm = rhs_reg, |
| 2966 | } }, |
| 2967 | }); |
| 2968 | } |
| 2969 | |
| 2970 | // cmp lhs, reconstructed |
| 2971 | _ = try self.addInst(.{ |
| 2972 | .tag = .cmp_shifted_register, |
| 2973 | .data = .{ .rr_imm6_shift = .{ |
| 2974 | .rn = lhs_reg, |
| 2975 | .rm = reconstructed_reg, |
| 2976 | .imm6 = 0, |
| 2977 | .shift = .lsl, |
| 2978 | } }, |
| 2979 | }); |
| 2980 | |
| 2981 | try self.genSetStack(lhs_ty, stack_offset, .{ .register = dest_reg }); |
| 2982 | try self.genSetStack(Type.u1, stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); |
| 2983 | |
| 2984 | break :result MCValue{ .stack_offset = stack_offset }; |
| 2985 | } else { |
| 2986 | return self.fail("TODO ARM overflow operations on integers > u32/i32", .{}); |
| 2987 | } |
| 2988 | }, |
| 2989 | else => unreachable, |
| 2990 | } |
| 2991 | }; |
| 2992 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); |
| 2993 | } |
| 2994 | |
| 2995 | fn airShlSat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 2996 | const zcu = self.pt.zcu; |
| 2997 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 2998 | const result: MCValue = if (self.liveness.isUnused(inst)) |
| 2999 | .dead |
| 3000 | else if (self.typeOf(bin_op.lhs).isVector(zcu) and !self.typeOf(bin_op.rhs).isVector(zcu)) |
| 3001 | return self.fail("TODO implement vector shl_sat with scalar rhs for {}", .{self.target.cpu.arch}) |
| 3002 | else |
| 3003 | return self.fail("TODO implement shl_sat for {}", .{self.target.cpu.arch}); |
| 3004 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 3005 | } |
| 3006 | |
| 3007 | fn airOptionalPayload(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3008 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3009 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3010 | const optional_ty = self.typeOf(ty_op.operand); |
| 3011 | const mcv = try self.resolveInst(ty_op.operand); |
| 3012 | break :result try self.optionalPayload(inst, mcv, optional_ty); |
| 3013 | }; |
| 3014 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3015 | } |
| 3016 | |
| 3017 | fn optionalPayload(self: *Self, inst: Air.Inst.Index, mcv: MCValue, optional_ty: Type) !MCValue { |
| 3018 | const pt = self.pt; |
| 3019 | const zcu = pt.zcu; |
| 3020 | const payload_ty = optional_ty.optionalChild(zcu); |
| 3021 | if (!payload_ty.hasRuntimeBits(zcu)) return MCValue.none; |
| 3022 | if (optional_ty.isPtrLikeOptional(zcu)) { |
| 3023 | // TODO should we reuse the operand here? |
| 3024 | const raw_reg = try self.register_manager.allocReg(inst, gp); |
| 3025 | const reg = self.registerAlias(raw_reg, payload_ty); |
| 3026 | try self.genSetReg(payload_ty, reg, mcv); |
| 3027 | return MCValue{ .register = reg }; |
| 3028 | } |
| 3029 | |
| 3030 | switch (mcv) { |
| 3031 | .register => { |
| 3032 | // TODO should we reuse the operand here? |
| 3033 | const raw_reg = try self.register_manager.allocReg(inst, gp); |
| 3034 | const dest_reg = raw_reg.toX(); |
| 3035 | |
| 3036 | try self.genSetReg(payload_ty, dest_reg, mcv); |
| 3037 | return MCValue{ .register = self.registerAlias(dest_reg, payload_ty) }; |
| 3038 | }, |
| 3039 | .stack_argument_offset, .stack_offset, .memory => return mcv, |
| 3040 | else => unreachable, // invalid MCValue for an error union |
| 3041 | } |
| 3042 | } |
| 3043 | |
| 3044 | fn airOptionalPayloadPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3045 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3046 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .optional_payload_ptr for {}", .{self.target.cpu.arch}); |
| 3047 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3048 | } |
| 3049 | |
| 3050 | fn airOptionalPayloadPtrSet(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3051 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3052 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .optional_payload_ptr_set for {}", .{self.target.cpu.arch}); |
| 3053 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3054 | } |
| 3055 | |
| 3056 | /// Given an error union, returns the error |
| 3057 | fn errUnionErr( |
| 3058 | self: *Self, |
| 3059 | error_union_bind: ReadArg.Bind, |
| 3060 | error_union_ty: Type, |
| 3061 | maybe_inst: ?Air.Inst.Index, |
| 3062 | ) !MCValue { |
| 3063 | const pt = self.pt; |
| 3064 | const zcu = pt.zcu; |
| 3065 | const err_ty = error_union_ty.errorUnionSet(zcu); |
| 3066 | const payload_ty = error_union_ty.errorUnionPayload(zcu); |
| 3067 | if (err_ty.errorSetIsEmpty(zcu)) { |
| 3068 | return MCValue{ .immediate = 0 }; |
| 3069 | } |
| 3070 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) { |
| 3071 | return try error_union_bind.resolveToMcv(self); |
| 3072 | } |
| 3073 | |
| 3074 | const err_offset: u32 = @intCast(errUnionErrorOffset(payload_ty, zcu)); |
| 3075 | switch (try error_union_bind.resolveToMcv(self)) { |
| 3076 | .register => { |
| 3077 | var operand_reg: Register = undefined; |
| 3078 | var dest_reg: Register = undefined; |
| 3079 | |
| 3080 | const read_args = [_]ReadArg{ |
| 3081 | .{ .ty = error_union_ty, .bind = error_union_bind, .class = gp, .reg = &operand_reg }, |
| 3082 | }; |
| 3083 | const write_args = [_]WriteArg{ |
| 3084 | .{ .ty = err_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 3085 | }; |
| 3086 | try self.allocRegs( |
| 3087 | &read_args, |
| 3088 | &write_args, |
| 3089 | if (maybe_inst) |inst| .{ |
| 3090 | .corresponding_inst = inst, |
| 3091 | .operand_mapping = &.{0}, |
| 3092 | } else null, |
| 3093 | ); |
| 3094 | |
| 3095 | const err_bit_offset = err_offset * 8; |
| 3096 | const err_bit_size = @as(u32, @intCast(err_ty.abiSize(zcu))) * 8; |
| 3097 | |
| 3098 | _ = try self.addInst(.{ |
| 3099 | .tag = .ubfx, // errors are unsigned integers |
| 3100 | .data = .{ |
| 3101 | .rr_lsb_width = .{ |
| 3102 | // Set both registers to the X variant to get the full width |
| 3103 | .rd = dest_reg.toX(), |
| 3104 | .rn = operand_reg.toX(), |
| 3105 | .lsb = @as(u6, @intCast(err_bit_offset)), |
| 3106 | .width = @as(u7, @intCast(err_bit_size)), |
| 3107 | }, |
| 3108 | }, |
| 3109 | }); |
| 3110 | |
| 3111 | return MCValue{ .register = dest_reg }; |
| 3112 | }, |
| 3113 | .stack_argument_offset => |off| { |
| 3114 | return MCValue{ .stack_argument_offset = off + err_offset }; |
| 3115 | }, |
| 3116 | .stack_offset => |off| { |
| 3117 | return MCValue{ .stack_offset = off - err_offset }; |
| 3118 | }, |
| 3119 | .memory => |addr| { |
| 3120 | return MCValue{ .memory = addr + err_offset }; |
| 3121 | }, |
| 3122 | else => unreachable, // invalid MCValue for an error union |
| 3123 | } |
| 3124 | } |
| 3125 | |
| 3126 | fn airUnwrapErrErr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3127 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3128 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3129 | const error_union_bind: ReadArg.Bind = .{ .inst = ty_op.operand }; |
| 3130 | const error_union_ty = self.typeOf(ty_op.operand); |
| 3131 | |
| 3132 | break :result try self.errUnionErr(error_union_bind, error_union_ty, inst); |
| 3133 | }; |
| 3134 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3135 | } |
| 3136 | |
| 3137 | /// Given an error union, returns the payload |
| 3138 | fn errUnionPayload( |
| 3139 | self: *Self, |
| 3140 | error_union_bind: ReadArg.Bind, |
| 3141 | error_union_ty: Type, |
| 3142 | maybe_inst: ?Air.Inst.Index, |
| 3143 | ) !MCValue { |
| 3144 | const pt = self.pt; |
| 3145 | const zcu = pt.zcu; |
| 3146 | const err_ty = error_union_ty.errorUnionSet(zcu); |
| 3147 | const payload_ty = error_union_ty.errorUnionPayload(zcu); |
| 3148 | if (err_ty.errorSetIsEmpty(zcu)) { |
| 3149 | return try error_union_bind.resolveToMcv(self); |
| 3150 | } |
| 3151 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) { |
| 3152 | return MCValue.none; |
| 3153 | } |
| 3154 | |
| 3155 | const payload_offset = @as(u32, @intCast(errUnionPayloadOffset(payload_ty, zcu))); |
| 3156 | switch (try error_union_bind.resolveToMcv(self)) { |
| 3157 | .register => { |
| 3158 | var operand_reg: Register = undefined; |
| 3159 | var dest_reg: Register = undefined; |
| 3160 | |
| 3161 | const read_args = [_]ReadArg{ |
| 3162 | .{ .ty = error_union_ty, .bind = error_union_bind, .class = gp, .reg = &operand_reg }, |
| 3163 | }; |
| 3164 | const write_args = [_]WriteArg{ |
| 3165 | .{ .ty = err_ty, .bind = .none, .class = gp, .reg = &dest_reg }, |
| 3166 | }; |
| 3167 | try self.allocRegs( |
| 3168 | &read_args, |
| 3169 | &write_args, |
| 3170 | if (maybe_inst) |inst| .{ |
| 3171 | .corresponding_inst = inst, |
| 3172 | .operand_mapping = &.{0}, |
| 3173 | } else null, |
| 3174 | ); |
| 3175 | |
| 3176 | const payload_bit_offset = payload_offset * 8; |
| 3177 | const payload_bit_size = @as(u32, @intCast(payload_ty.abiSize(zcu))) * 8; |
| 3178 | |
| 3179 | _ = try self.addInst(.{ |
| 3180 | .tag = if (payload_ty.isSignedInt(zcu)) Mir.Inst.Tag.sbfx else .ubfx, |
| 3181 | .data = .{ |
| 3182 | .rr_lsb_width = .{ |
| 3183 | // Set both registers to the X variant to get the full width |
| 3184 | .rd = dest_reg.toX(), |
| 3185 | .rn = operand_reg.toX(), |
| 3186 | .lsb = @as(u5, @intCast(payload_bit_offset)), |
| 3187 | .width = @as(u6, @intCast(payload_bit_size)), |
| 3188 | }, |
| 3189 | }, |
| 3190 | }); |
| 3191 | |
| 3192 | return MCValue{ .register = dest_reg }; |
| 3193 | }, |
| 3194 | .stack_argument_offset => |off| { |
| 3195 | return MCValue{ .stack_argument_offset = off + payload_offset }; |
| 3196 | }, |
| 3197 | .stack_offset => |off| { |
| 3198 | return MCValue{ .stack_offset = off - payload_offset }; |
| 3199 | }, |
| 3200 | .memory => |addr| { |
| 3201 | return MCValue{ .memory = addr + payload_offset }; |
| 3202 | }, |
| 3203 | else => unreachable, // invalid MCValue for an error union |
| 3204 | } |
| 3205 | } |
| 3206 | |
| 3207 | fn airUnwrapErrPayload(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3208 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3209 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3210 | const error_union_bind: ReadArg.Bind = .{ .inst = ty_op.operand }; |
| 3211 | const error_union_ty = self.typeOf(ty_op.operand); |
| 3212 | |
| 3213 | break :result try self.errUnionPayload(error_union_bind, error_union_ty, inst); |
| 3214 | }; |
| 3215 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3216 | } |
| 3217 | |
| 3218 | // *(E!T) -> E |
| 3219 | fn airUnwrapErrErrPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3220 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3221 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement unwrap error union error ptr for {}", .{self.target.cpu.arch}); |
| 3222 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3223 | } |
| 3224 | |
| 3225 | // *(E!T) -> *T |
| 3226 | fn airUnwrapErrPayloadPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3227 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3228 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement unwrap error union payload ptr for {}", .{self.target.cpu.arch}); |
| 3229 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3230 | } |
| 3231 | |
| 3232 | fn airErrUnionPayloadPtrSet(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3233 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3234 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .errunion_payload_ptr_set for {}", .{self.target.cpu.arch}); |
| 3235 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3236 | } |
| 3237 | |
| 3238 | fn airErrReturnTrace(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3239 | const result: MCValue = if (self.liveness.isUnused(inst)) |
| 3240 | .dead |
| 3241 | else |
| 3242 | return self.fail("TODO implement airErrReturnTrace for {}", .{self.target.cpu.arch}); |
| 3243 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 3244 | } |
| 3245 | |
| 3246 | fn airSetErrReturnTrace(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3247 | _ = inst; |
| 3248 | return self.fail("TODO implement airSetErrReturnTrace for {}", .{self.target.cpu.arch}); |
| 3249 | } |
| 3250 | |
| 3251 | fn airSaveErrReturnTraceIndex(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3252 | _ = inst; |
| 3253 | return self.fail("TODO implement airSaveErrReturnTraceIndex for {}", .{self.target.cpu.arch}); |
| 3254 | } |
| 3255 | |
| 3256 | fn airWrapOptional(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3257 | const pt = self.pt; |
| 3258 | const zcu = pt.zcu; |
| 3259 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3260 | |
| 3261 | if (self.liveness.isUnused(inst)) { |
| 3262 | return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); |
| 3263 | } |
| 3264 | |
| 3265 | const result: MCValue = result: { |
| 3266 | const payload_ty = self.typeOf(ty_op.operand); |
| 3267 | if (!payload_ty.hasRuntimeBits(zcu)) { |
| 3268 | break :result MCValue{ .immediate = 1 }; |
| 3269 | } |
| 3270 | |
| 3271 | const optional_ty = self.typeOfIndex(inst); |
| 3272 | const operand = try self.resolveInst(ty_op.operand); |
| 3273 | const operand_lock: ?RegisterLock = switch (operand) { |
| 3274 | .register => |reg| self.register_manager.lockRegAssumeUnused(reg), |
| 3275 | else => null, |
| 3276 | }; |
| 3277 | defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); |
| 3278 | |
| 3279 | if (optional_ty.isPtrLikeOptional(zcu)) { |
| 3280 | // TODO should we check if we can reuse the operand? |
| 3281 | const raw_reg = try self.register_manager.allocReg(inst, gp); |
| 3282 | const reg = self.registerAlias(raw_reg, payload_ty); |
| 3283 | try self.genSetReg(payload_ty, raw_reg, operand); |
| 3284 | break :result MCValue{ .register = reg }; |
| 3285 | } |
| 3286 | |
| 3287 | const optional_abi_size: u32 = @intCast(optional_ty.abiSize(zcu)); |
| 3288 | const optional_abi_align = optional_ty.abiAlignment(zcu); |
| 3289 | const offset: u32 = @intCast(payload_ty.abiSize(zcu)); |
| 3290 | |
| 3291 | const stack_offset = try self.allocMem(optional_abi_size, optional_abi_align, inst); |
| 3292 | try self.genSetStack(payload_ty, stack_offset, operand); |
| 3293 | try self.genSetStack(Type.bool, stack_offset - offset, .{ .immediate = 1 }); |
| 3294 | |
| 3295 | break :result MCValue{ .stack_offset = stack_offset }; |
| 3296 | }; |
| 3297 | |
| 3298 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3299 | } |
| 3300 | |
| 3301 | /// T to E!T |
| 3302 | fn airWrapErrUnionPayload(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3303 | const pt = self.pt; |
| 3304 | const zcu = pt.zcu; |
| 3305 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3306 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3307 | const error_union_ty = ty_op.ty.toType(); |
| 3308 | const error_ty = error_union_ty.errorUnionSet(zcu); |
| 3309 | const payload_ty = error_union_ty.errorUnionPayload(zcu); |
| 3310 | const operand = try self.resolveInst(ty_op.operand); |
| 3311 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) break :result operand; |
| 3312 | |
| 3313 | const abi_size = @as(u32, @intCast(error_union_ty.abiSize(zcu))); |
| 3314 | const abi_align = error_union_ty.abiAlignment(zcu); |
| 3315 | const stack_offset = try self.allocMem(abi_size, abi_align, inst); |
| 3316 | const payload_off = errUnionPayloadOffset(payload_ty, zcu); |
| 3317 | const err_off = errUnionErrorOffset(payload_ty, zcu); |
| 3318 | try self.genSetStack(payload_ty, stack_offset - @as(u32, @intCast(payload_off)), operand); |
| 3319 | try self.genSetStack(error_ty, stack_offset - @as(u32, @intCast(err_off)), .{ .immediate = 0 }); |
| 3320 | |
| 3321 | break :result MCValue{ .stack_offset = stack_offset }; |
| 3322 | }; |
| 3323 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3324 | } |
| 3325 | |
| 3326 | /// E to E!T |
| 3327 | fn airWrapErrUnionErr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3328 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3329 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3330 | const pt = self.pt; |
| 3331 | const zcu = pt.zcu; |
| 3332 | const error_union_ty = ty_op.ty.toType(); |
| 3333 | const error_ty = error_union_ty.errorUnionSet(zcu); |
| 3334 | const payload_ty = error_union_ty.errorUnionPayload(zcu); |
| 3335 | const operand = try self.resolveInst(ty_op.operand); |
| 3336 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) break :result operand; |
| 3337 | |
| 3338 | const abi_size = @as(u32, @intCast(error_union_ty.abiSize(zcu))); |
| 3339 | const abi_align = error_union_ty.abiAlignment(zcu); |
| 3340 | const stack_offset = try self.allocMem(abi_size, abi_align, inst); |
| 3341 | const payload_off = errUnionPayloadOffset(payload_ty, zcu); |
| 3342 | const err_off = errUnionErrorOffset(payload_ty, zcu); |
| 3343 | try self.genSetStack(error_ty, stack_offset - @as(u32, @intCast(err_off)), operand); |
| 3344 | try self.genSetStack(payload_ty, stack_offset - @as(u32, @intCast(payload_off)), .undef); |
| 3345 | |
| 3346 | break :result MCValue{ .stack_offset = stack_offset }; |
| 3347 | }; |
| 3348 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3349 | } |
| 3350 | |
| 3351 | fn slicePtr(mcv: MCValue) MCValue { |
| 3352 | switch (mcv) { |
| 3353 | .dead, .unreach, .none => unreachable, |
| 3354 | .register => unreachable, // a slice doesn't fit in one register |
| 3355 | .stack_argument_offset => |off| { |
| 3356 | return MCValue{ .stack_argument_offset = off }; |
| 3357 | }, |
| 3358 | .stack_offset => |off| { |
| 3359 | return MCValue{ .stack_offset = off }; |
| 3360 | }, |
| 3361 | .memory => |addr| { |
| 3362 | return MCValue{ .memory = addr }; |
| 3363 | }, |
| 3364 | else => unreachable, // invalid MCValue for a slice |
| 3365 | } |
| 3366 | } |
| 3367 | |
| 3368 | fn airSlicePtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3369 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3370 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3371 | const mcv = try self.resolveInst(ty_op.operand); |
| 3372 | break :result slicePtr(mcv); |
| 3373 | }; |
| 3374 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3375 | } |
| 3376 | |
| 3377 | fn airSliceLen(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3378 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3379 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3380 | const ptr_bits = 64; |
| 3381 | const ptr_bytes = @divExact(ptr_bits, 8); |
| 3382 | const mcv = try self.resolveInst(ty_op.operand); |
| 3383 | switch (mcv) { |
| 3384 | .dead, .unreach, .none => unreachable, |
| 3385 | .register => unreachable, // a slice doesn't fit in one register |
| 3386 | .stack_argument_offset => |off| { |
| 3387 | break :result MCValue{ .stack_argument_offset = off + ptr_bytes }; |
| 3388 | }, |
| 3389 | .stack_offset => |off| { |
| 3390 | break :result MCValue{ .stack_offset = off - ptr_bytes }; |
| 3391 | }, |
| 3392 | .memory => |addr| { |
| 3393 | break :result MCValue{ .memory = addr + ptr_bytes }; |
| 3394 | }, |
| 3395 | else => return self.fail("TODO implement slice_len for {}", .{mcv}), |
| 3396 | } |
| 3397 | }; |
| 3398 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3399 | } |
| 3400 | |
| 3401 | fn airPtrSliceLenPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3402 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3403 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3404 | const ptr_bits = 64; |
| 3405 | const ptr_bytes = @divExact(ptr_bits, 8); |
| 3406 | const mcv = try self.resolveInst(ty_op.operand); |
| 3407 | switch (mcv) { |
| 3408 | .dead, .unreach, .none => unreachable, |
| 3409 | .ptr_stack_offset => |off| { |
| 3410 | break :result MCValue{ .ptr_stack_offset = off - ptr_bytes }; |
| 3411 | }, |
| 3412 | else => return self.fail("TODO implement ptr_slice_len_ptr for {}", .{mcv}), |
| 3413 | } |
| 3414 | }; |
| 3415 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3416 | } |
| 3417 | |
| 3418 | fn airPtrSlicePtrPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3419 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3420 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3421 | const mcv = try self.resolveInst(ty_op.operand); |
| 3422 | switch (mcv) { |
| 3423 | .dead, .unreach, .none => unreachable, |
| 3424 | .ptr_stack_offset => |off| { |
| 3425 | break :result MCValue{ .ptr_stack_offset = off }; |
| 3426 | }, |
| 3427 | else => return self.fail("TODO implement ptr_slice_len_ptr for {}", .{mcv}), |
| 3428 | } |
| 3429 | }; |
| 3430 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3431 | } |
| 3432 | |
| 3433 | fn airSliceElemVal(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3434 | const pt = self.pt; |
| 3435 | const zcu = pt.zcu; |
| 3436 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 3437 | const slice_ty = self.typeOf(bin_op.lhs); |
| 3438 | const result: MCValue = if (!slice_ty.isVolatilePtr(zcu) and self.liveness.isUnused(inst)) .dead else result: { |
| 3439 | const ptr_ty = slice_ty.slicePtrFieldType(zcu); |
| 3440 | |
| 3441 | const slice_mcv = try self.resolveInst(bin_op.lhs); |
| 3442 | const base_mcv = slicePtr(slice_mcv); |
| 3443 | |
| 3444 | const base_bind: ReadArg.Bind = .{ .mcv = base_mcv }; |
| 3445 | const index_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; |
| 3446 | |
| 3447 | break :result try self.ptrElemVal(base_bind, index_bind, ptr_ty, inst); |
| 3448 | }; |
| 3449 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 3450 | } |
| 3451 | |
| 3452 | fn ptrElemVal( |
| 3453 | self: *Self, |
| 3454 | ptr_bind: ReadArg.Bind, |
| 3455 | index_bind: ReadArg.Bind, |
| 3456 | ptr_ty: Type, |
| 3457 | maybe_inst: ?Air.Inst.Index, |
| 3458 | ) !MCValue { |
| 3459 | const pt = self.pt; |
| 3460 | const zcu = pt.zcu; |
| 3461 | const elem_ty = ptr_ty.childType(zcu); |
| 3462 | const elem_size = @as(u32, @intCast(elem_ty.abiSize(zcu))); |
| 3463 | |
| 3464 | // TODO optimize for elem_sizes of 1, 2, 4, 8 |
| 3465 | switch (elem_size) { |
| 3466 | else => { |
| 3467 | const addr = try self.ptrArithmetic(.ptr_add, ptr_bind, index_bind, ptr_ty, Type.usize, null); |
| 3468 | |
| 3469 | const dest = try self.allocRegOrMem(elem_ty, true, maybe_inst); |
| 3470 | try self.load(dest, addr, ptr_ty); |
| 3471 | return dest; |
| 3472 | }, |
| 3473 | } |
| 3474 | } |
| 3475 | |
| 3476 | fn airSliceElemPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3477 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 3478 | const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 3479 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3480 | const slice_mcv = try self.resolveInst(extra.lhs); |
| 3481 | const base_mcv = slicePtr(slice_mcv); |
| 3482 | |
| 3483 | const base_bind: ReadArg.Bind = .{ .mcv = base_mcv }; |
| 3484 | const index_bind: ReadArg.Bind = .{ .inst = extra.rhs }; |
| 3485 | |
| 3486 | const slice_ty = self.typeOf(extra.lhs); |
| 3487 | const index_ty = self.typeOf(extra.rhs); |
| 3488 | |
| 3489 | const addr = try self.ptrArithmetic(.ptr_add, base_bind, index_bind, slice_ty, index_ty, null); |
| 3490 | break :result addr; |
| 3491 | }; |
| 3492 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); |
| 3493 | } |
| 3494 | |
| 3495 | fn airArrayElemVal(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3496 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 3497 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement array_elem_val for {}", .{self.target.cpu.arch}); |
| 3498 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 3499 | } |
| 3500 | |
| 3501 | fn airPtrElemVal(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3502 | const pt = self.pt; |
| 3503 | const zcu = pt.zcu; |
| 3504 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 3505 | const ptr_ty = self.typeOf(bin_op.lhs); |
| 3506 | const result: MCValue = if (!ptr_ty.isVolatilePtr(zcu) and self.liveness.isUnused(inst)) .dead else result: { |
| 3507 | const base_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; |
| 3508 | const index_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; |
| 3509 | |
| 3510 | break :result try self.ptrElemVal(base_bind, index_bind, ptr_ty, inst); |
| 3511 | }; |
| 3512 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 3513 | } |
| 3514 | |
| 3515 | fn airPtrElemPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3516 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 3517 | const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; |
| 3518 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 3519 | const ptr_bind: ReadArg.Bind = .{ .inst = extra.lhs }; |
| 3520 | const index_bind: ReadArg.Bind = .{ .inst = extra.rhs }; |
| 3521 | |
| 3522 | const ptr_ty = self.typeOf(extra.lhs); |
| 3523 | const index_ty = self.typeOf(extra.rhs); |
| 3524 | |
| 3525 | const addr = try self.ptrArithmetic(.ptr_add, ptr_bind, index_bind, ptr_ty, index_ty, null); |
| 3526 | break :result addr; |
| 3527 | }; |
| 3528 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); |
| 3529 | } |
| 3530 | |
| 3531 | fn airSetUnionTag(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3532 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 3533 | _ = bin_op; |
| 3534 | return self.fail("TODO implement airSetUnionTag for {}", .{self.target.cpu.arch}); |
| 3535 | } |
| 3536 | |
| 3537 | fn airGetUnionTag(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3538 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3539 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airGetUnionTag for {}", .{self.target.cpu.arch}); |
| 3540 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3541 | } |
| 3542 | |
| 3543 | fn airClz(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3544 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3545 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airClz for {}", .{self.target.cpu.arch}); |
| 3546 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3547 | } |
| 3548 | |
| 3549 | fn airCtz(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3550 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3551 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airCtz for {}", .{self.target.cpu.arch}); |
| 3552 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3553 | } |
| 3554 | |
| 3555 | fn airPopcount(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3556 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3557 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airPopcount for {}", .{self.target.cpu.arch}); |
| 3558 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3559 | } |
| 3560 | |
| 3561 | fn airAbs(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3562 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3563 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airAbs for {}", .{self.target.cpu.arch}); |
| 3564 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3565 | } |
| 3566 | |
| 3567 | fn airByteSwap(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3568 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3569 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airByteSwap for {}", .{self.target.cpu.arch}); |
| 3570 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3571 | } |
| 3572 | |
| 3573 | fn airBitReverse(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3574 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3575 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airBitReverse for {}", .{self.target.cpu.arch}); |
| 3576 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3577 | } |
| 3578 | |
| 3579 | fn airUnaryMath(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3580 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 3581 | const result: MCValue = if (self.liveness.isUnused(inst)) |
| 3582 | .dead |
| 3583 | else |
| 3584 | return self.fail("TODO implement airUnaryMath for {}", .{self.target.cpu.arch}); |
| 3585 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 3586 | } |
| 3587 | |
| 3588 | fn reuseOperand( |
| 3589 | self: *Self, |
| 3590 | inst: Air.Inst.Index, |
| 3591 | operand: Air.Inst.Ref, |
| 3592 | op_index: Air.Liveness.OperandInt, |
| 3593 | mcv: MCValue, |
| 3594 | ) bool { |
| 3595 | if (!self.liveness.operandDies(inst, op_index)) |
| 3596 | return false; |
| 3597 | |
| 3598 | switch (mcv) { |
| 3599 | .register => |reg| { |
| 3600 | // If it's in the registers table, need to associate the register with the |
| 3601 | // new instruction. |
| 3602 | if (RegisterManager.indexOfRegIntoTracked(reg)) |index| { |
| 3603 | if (!self.register_manager.isRegFree(reg)) { |
| 3604 | self.register_manager.registers[index] = inst; |
| 3605 | } |
| 3606 | } |
| 3607 | log.debug("%{d} => {} (reused)", .{ inst, reg }); |
| 3608 | }, |
| 3609 | .stack_offset => |off| { |
| 3610 | log.debug("%{d} => stack offset {d} (reused)", .{ inst, off }); |
| 3611 | }, |
| 3612 | else => return false, |
| 3613 | } |
| 3614 | |
| 3615 | // Prevent the operand deaths processing code from deallocating it. |
| 3616 | self.reused_operands.set(op_index); |
| 3617 | |
| 3618 | // That makes us responsible for doing the rest of the stuff that processDeath would have done. |
| 3619 | const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; |
| 3620 | branch.inst_table.putAssumeCapacity(operand.toIndex().?, .dead); |
| 3621 | |
| 3622 | return true; |
| 3623 | } |
| 3624 | |
| 3625 | fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!void { |
| 3626 | const pt = self.pt; |
| 3627 | const zcu = pt.zcu; |
| 3628 | const elem_ty = ptr_ty.childType(zcu); |
| 3629 | const elem_size = elem_ty.abiSize(zcu); |
| 3630 | |
| 3631 | switch (ptr) { |
| 3632 | .none => unreachable, |
| 3633 | .undef => unreachable, |
| 3634 | .unreach => unreachable, |
| 3635 | .dead => unreachable, |
| 3636 | .compare_flags, |
| 3637 | .register_with_overflow, |
| 3638 | => unreachable, // cannot hold an address |
| 3639 | .immediate => |imm| try self.setRegOrMem(elem_ty, dst_mcv, .{ .memory = imm }), |
| 3640 | .ptr_stack_offset => |off| try self.setRegOrMem(elem_ty, dst_mcv, .{ .stack_offset = off }), |
| 3641 | .register => |addr_reg| { |
| 3642 | const addr_reg_lock = self.register_manager.lockReg(addr_reg); |
| 3643 | defer if (addr_reg_lock) |reg| self.register_manager.unlockReg(reg); |
| 3644 | |
| 3645 | switch (dst_mcv) { |
| 3646 | .dead => unreachable, |
| 3647 | .undef => unreachable, |
| 3648 | .compare_flags => unreachable, |
| 3649 | .register => |dst_reg| { |
| 3650 | try self.genLdrRegister(dst_reg, addr_reg, elem_ty); |
| 3651 | }, |
| 3652 | .stack_offset => |off| { |
| 3653 | if (elem_size <= 8) { |
| 3654 | const raw_tmp_reg = try self.register_manager.allocReg(null, gp); |
| 3655 | const tmp_reg = self.registerAlias(raw_tmp_reg, elem_ty); |
| 3656 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 3657 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 3658 | |
| 3659 | try self.load(.{ .register = tmp_reg }, ptr, ptr_ty); |
| 3660 | try self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }); |
| 3661 | } else { |
| 3662 | // TODO optimize the register allocation |
| 3663 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); |
| 3664 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 3665 | defer for (regs_locks) |reg| { |
| 3666 | self.register_manager.unlockReg(reg); |
| 3667 | }; |
| 3668 | |
| 3669 | const src_reg = addr_reg; |
| 3670 | const dst_reg = regs[0]; |
| 3671 | const len_reg = regs[1]; |
| 3672 | const count_reg = regs[2]; |
| 3673 | const tmp_reg = regs[3]; |
| 3674 | |
| 3675 | // sub dst_reg, fp, #off |
| 3676 | try self.genSetReg(ptr_ty, dst_reg, .{ .ptr_stack_offset = off }); |
| 3677 | |
| 3678 | // mov len, #elem_size |
| 3679 | try self.genSetReg(Type.usize, len_reg, .{ .immediate = elem_size }); |
| 3680 | |
| 3681 | // memcpy(src, dst, len) |
| 3682 | try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); |
| 3683 | } |
| 3684 | }, |
| 3685 | else => return self.fail("TODO load from register into {}", .{dst_mcv}), |
| 3686 | } |
| 3687 | }, |
| 3688 | .memory, |
| 3689 | .stack_offset, |
| 3690 | .stack_argument_offset, |
| 3691 | .linker_load, |
| 3692 | => { |
| 3693 | const addr_reg = try self.copyToTmpRegister(ptr_ty, ptr); |
| 3694 | try self.load(dst_mcv, .{ .register = addr_reg }, ptr_ty); |
| 3695 | }, |
| 3696 | } |
| 3697 | } |
| 3698 | |
| 3699 | fn genInlineMemcpy( |
| 3700 | self: *Self, |
| 3701 | src: Register, |
| 3702 | dst: Register, |
| 3703 | len: Register, |
| 3704 | count: Register, |
| 3705 | tmp: Register, |
| 3706 | ) !void { |
| 3707 | // movz count, #0 |
| 3708 | _ = try self.addInst(.{ |
| 3709 | .tag = .movz, |
| 3710 | .data = .{ .r_imm16_sh = .{ |
| 3711 | .rd = count, |
| 3712 | .imm16 = 0, |
| 3713 | } }, |
| 3714 | }); |
| 3715 | |
| 3716 | // loop: |
| 3717 | // cmp count, len |
| 3718 | _ = try self.addInst(.{ |
| 3719 | .tag = .cmp_shifted_register, |
| 3720 | .data = .{ .rr_imm6_shift = .{ |
| 3721 | .rn = count, |
| 3722 | .rm = len, |
| 3723 | .imm6 = 0, |
| 3724 | .shift = .lsl, |
| 3725 | } }, |
| 3726 | }); |
| 3727 | |
| 3728 | // bge end |
| 3729 | _ = try self.addInst(.{ |
| 3730 | .tag = .b_cond, |
| 3731 | .data = .{ .inst_cond = .{ |
| 3732 | .inst = @as(u32, @intCast(self.mir_instructions.len + 5)), |
| 3733 | .cond = .ge, |
| 3734 | } }, |
| 3735 | }); |
| 3736 | |
| 3737 | // ldrb tmp, [src, count] |
| 3738 | _ = try self.addInst(.{ |
| 3739 | .tag = .ldrb_register, |
| 3740 | .data = .{ .load_store_register_register = .{ |
| 3741 | .rt = tmp, |
| 3742 | .rn = src, |
| 3743 | .offset = Instruction.LoadStoreOffset.reg(count).register, |
| 3744 | } }, |
| 3745 | }); |
| 3746 | |
| 3747 | // strb tmp, [dest, count] |
| 3748 | _ = try self.addInst(.{ |
| 3749 | .tag = .strb_register, |
| 3750 | .data = .{ .load_store_register_register = .{ |
| 3751 | .rt = tmp, |
| 3752 | .rn = dst, |
| 3753 | .offset = Instruction.LoadStoreOffset.reg(count).register, |
| 3754 | } }, |
| 3755 | }); |
| 3756 | |
| 3757 | // add count, count, #1 |
| 3758 | _ = try self.addInst(.{ |
| 3759 | .tag = .add_immediate, |
| 3760 | .data = .{ .rr_imm12_sh = .{ |
| 3761 | .rd = count, |
| 3762 | .rn = count, |
| 3763 | .imm12 = 1, |
| 3764 | } }, |
| 3765 | }); |
| 3766 | |
| 3767 | // b loop |
| 3768 | _ = try self.addInst(.{ |
| 3769 | .tag = .b, |
| 3770 | .data = .{ .inst = @as(u32, @intCast(self.mir_instructions.len - 5)) }, |
| 3771 | }); |
| 3772 | |
| 3773 | // end: |
| 3774 | } |
| 3775 | |
| 3776 | fn genInlineMemset( |
| 3777 | self: *Self, |
| 3778 | dst: MCValue, |
| 3779 | val: MCValue, |
| 3780 | len: MCValue, |
| 3781 | ) !void { |
| 3782 | const dst_reg = switch (dst) { |
| 3783 | .register => |r| r, |
| 3784 | else => try self.copyToTmpRegister(Type.manyptr_u8, dst), |
| 3785 | }; |
| 3786 | const dst_reg_lock = self.register_manager.lockReg(dst_reg); |
| 3787 | defer if (dst_reg_lock) |lock| self.register_manager.unlockReg(lock); |
| 3788 | |
| 3789 | const val_reg = switch (val) { |
| 3790 | .register => |r| r, |
| 3791 | else => try self.copyToTmpRegister(Type.u8, val), |
| 3792 | }; |
| 3793 | const val_reg_lock = self.register_manager.lockReg(val_reg); |
| 3794 | defer if (val_reg_lock) |lock| self.register_manager.unlockReg(lock); |
| 3795 | |
| 3796 | const len_reg = switch (len) { |
| 3797 | .register => |r| r, |
| 3798 | else => try self.copyToTmpRegister(Type.usize, len), |
| 3799 | }; |
| 3800 | const len_reg_lock = self.register_manager.lockReg(len_reg); |
| 3801 | defer if (len_reg_lock) |lock| self.register_manager.unlockReg(lock); |
| 3802 | |
| 3803 | const count_reg = try self.register_manager.allocReg(null, gp); |
| 3804 | |
| 3805 | try self.genInlineMemsetCode(dst_reg, val_reg, len_reg, count_reg); |
| 3806 | } |
| 3807 | |
| 3808 | fn genInlineMemsetCode( |
| 3809 | self: *Self, |
| 3810 | dst: Register, |
| 3811 | val: Register, |
| 3812 | len: Register, |
| 3813 | count: Register, |
| 3814 | ) !void { |
| 3815 | // mov count, #0 |
| 3816 | _ = try self.addInst(.{ |
| 3817 | .tag = .movz, |
| 3818 | .data = .{ .r_imm16_sh = .{ |
| 3819 | .rd = count, |
| 3820 | .imm16 = 0, |
| 3821 | } }, |
| 3822 | }); |
| 3823 | |
| 3824 | // loop: |
| 3825 | // cmp count, len |
| 3826 | _ = try self.addInst(.{ |
| 3827 | .tag = .cmp_shifted_register, |
| 3828 | .data = .{ .rr_imm6_shift = .{ |
| 3829 | .rn = count, |
| 3830 | .rm = len, |
| 3831 | .imm6 = 0, |
| 3832 | .shift = .lsl, |
| 3833 | } }, |
| 3834 | }); |
| 3835 | |
| 3836 | // bge end |
| 3837 | _ = try self.addInst(.{ |
| 3838 | .tag = .b_cond, |
| 3839 | .data = .{ .inst_cond = .{ |
| 3840 | .inst = @as(u32, @intCast(self.mir_instructions.len + 4)), |
| 3841 | .cond = .ge, |
| 3842 | } }, |
| 3843 | }); |
| 3844 | |
| 3845 | // strb val, [src, count] |
| 3846 | _ = try self.addInst(.{ |
| 3847 | .tag = .strb_register, |
| 3848 | .data = .{ .load_store_register_register = .{ |
| 3849 | .rt = val, |
| 3850 | .rn = dst, |
| 3851 | .offset = Instruction.LoadStoreOffset.reg(count).register, |
| 3852 | } }, |
| 3853 | }); |
| 3854 | |
| 3855 | // add count, count, #1 |
| 3856 | _ = try self.addInst(.{ |
| 3857 | .tag = .add_immediate, |
| 3858 | .data = .{ .rr_imm12_sh = .{ |
| 3859 | .rd = count, |
| 3860 | .rn = count, |
| 3861 | .imm12 = 1, |
| 3862 | } }, |
| 3863 | }); |
| 3864 | |
| 3865 | // b loop |
| 3866 | _ = try self.addInst(.{ |
| 3867 | .tag = .b, |
| 3868 | .data = .{ .inst = @as(u32, @intCast(self.mir_instructions.len - 4)) }, |
| 3869 | }); |
| 3870 | |
| 3871 | // end: |
| 3872 | } |
| 3873 | |
| 3874 | fn airLoad(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 3875 | const pt = self.pt; |
| 3876 | const zcu = pt.zcu; |
| 3877 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 3878 | const elem_ty = self.typeOfIndex(inst); |
| 3879 | const elem_size = elem_ty.abiSize(zcu); |
| 3880 | const result: MCValue = result: { |
| 3881 | if (!elem_ty.hasRuntimeBits(zcu)) |
| 3882 | break :result MCValue.none; |
| 3883 | |
| 3884 | const ptr = try self.resolveInst(ty_op.operand); |
| 3885 | const is_volatile = self.typeOf(ty_op.operand).isVolatilePtr(zcu); |
| 3886 | if (self.liveness.isUnused(inst) and !is_volatile) |
| 3887 | break :result MCValue.dead; |
| 3888 | |
| 3889 | const dst_mcv: MCValue = blk: { |
| 3890 | if (elem_size <= 8 and self.reuseOperand(inst, ty_op.operand, 0, ptr)) { |
| 3891 | // The MCValue that holds the pointer can be re-used as the value. |
| 3892 | break :blk switch (ptr) { |
| 3893 | .register => |reg| MCValue{ .register = self.registerAlias(reg, elem_ty) }, |
| 3894 | else => ptr, |
| 3895 | }; |
| 3896 | } else { |
| 3897 | break :blk try self.allocRegOrMem(elem_ty, true, inst); |
| 3898 | } |
| 3899 | }; |
| 3900 | try self.load(dst_mcv, ptr, self.typeOf(ty_op.operand)); |
| 3901 | break :result dst_mcv; |
| 3902 | }; |
| 3903 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 3904 | } |
| 3905 | |
| 3906 | fn genLdrRegister(self: *Self, value_reg: Register, addr_reg: Register, ty: Type) !void { |
| 3907 | const pt = self.pt; |
| 3908 | const zcu = pt.zcu; |
| 3909 | const abi_size = ty.abiSize(zcu); |
| 3910 | |
| 3911 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 3912 | 1 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsb_immediate else .ldrb_immediate, |
| 3913 | 2 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsh_immediate else .ldrh_immediate, |
| 3914 | 4 => .ldr_immediate, |
| 3915 | 8 => .ldr_immediate, |
| 3916 | 3, 5, 6, 7 => return self.fail("TODO: genLdrRegister for more abi_sizes", .{}), |
| 3917 | else => unreachable, |
| 3918 | }; |
| 3919 | |
| 3920 | _ = try self.addInst(.{ |
| 3921 | .tag = tag, |
| 3922 | .data = .{ .load_store_register_immediate = .{ |
| 3923 | .rt = value_reg, |
| 3924 | .rn = addr_reg, |
| 3925 | .offset = Instruction.LoadStoreOffset.none.immediate, |
| 3926 | } }, |
| 3927 | }); |
| 3928 | } |
| 3929 | |
| 3930 | fn genStrRegister(self: *Self, value_reg: Register, addr_reg: Register, ty: Type) !void { |
| 3931 | const pt = self.pt; |
| 3932 | const abi_size = ty.abiSize(pt.zcu); |
| 3933 | |
| 3934 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 3935 | 1 => .strb_immediate, |
| 3936 | 2 => .strh_immediate, |
| 3937 | 4, 8 => .str_immediate, |
| 3938 | 3, 5, 6, 7 => return self.fail("TODO: genStrRegister for more abi_sizes", .{}), |
| 3939 | else => unreachable, |
| 3940 | }; |
| 3941 | |
| 3942 | _ = try self.addInst(.{ |
| 3943 | .tag = tag, |
| 3944 | .data = .{ .load_store_register_immediate = .{ |
| 3945 | .rt = value_reg, |
| 3946 | .rn = addr_reg, |
| 3947 | .offset = Instruction.LoadStoreOffset.none.immediate, |
| 3948 | } }, |
| 3949 | }); |
| 3950 | } |
| 3951 | |
| 3952 | fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type) InnerError!void { |
| 3953 | const pt = self.pt; |
| 3954 | log.debug("store: storing {} to {}", .{ value, ptr }); |
| 3955 | const abi_size = value_ty.abiSize(pt.zcu); |
| 3956 | |
| 3957 | switch (ptr) { |
| 3958 | .none => unreachable, |
| 3959 | .undef => unreachable, |
| 3960 | .unreach => unreachable, |
| 3961 | .dead => unreachable, |
| 3962 | .compare_flags, |
| 3963 | .register_with_overflow, |
| 3964 | => unreachable, // cannot hold an address |
| 3965 | .immediate => |imm| { |
| 3966 | try self.setRegOrMem(value_ty, .{ .memory = imm }, value); |
| 3967 | }, |
| 3968 | .ptr_stack_offset => |off| { |
| 3969 | try self.genSetStack(value_ty, off, value); |
| 3970 | }, |
| 3971 | .register => |addr_reg| { |
| 3972 | const addr_reg_lock = self.register_manager.lockReg(addr_reg); |
| 3973 | defer if (addr_reg_lock) |reg| self.register_manager.unlockReg(reg); |
| 3974 | |
| 3975 | switch (value) { |
| 3976 | .dead => unreachable, |
| 3977 | .undef => { |
| 3978 | try self.genSetReg(value_ty, addr_reg, value); |
| 3979 | }, |
| 3980 | .register => |value_reg| { |
| 3981 | log.debug("store: register {} to {}", .{ value_reg, addr_reg }); |
| 3982 | try self.genStrRegister(value_reg, addr_reg, value_ty); |
| 3983 | }, |
| 3984 | else => { |
| 3985 | if (abi_size <= 8) { |
| 3986 | const raw_tmp_reg = try self.register_manager.allocReg(null, gp); |
| 3987 | const tmp_reg = self.registerAlias(raw_tmp_reg, value_ty); |
| 3988 | const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); |
| 3989 | defer self.register_manager.unlockReg(tmp_reg_lock); |
| 3990 | |
| 3991 | try self.genSetReg(value_ty, tmp_reg, value); |
| 3992 | try self.store(ptr, .{ .register = tmp_reg }, ptr_ty, value_ty); |
| 3993 | } else { |
| 3994 | const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); |
| 3995 | const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); |
| 3996 | defer for (regs_locks) |reg| { |
| 3997 | self.register_manager.unlockReg(reg); |
| 3998 | }; |
| 3999 | |
| 4000 | const src_reg = regs[0]; |
| 4001 | const dst_reg = addr_reg; |
| 4002 | const len_reg = regs[1]; |
| 4003 | const count_reg = regs[2]; |
| 4004 | const tmp_reg = regs[3]; |
| 4005 | |
| 4006 | switch (value) { |
| 4007 | .stack_offset => |off| { |
| 4008 | // sub src_reg, fp, #off |
| 4009 | try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); |
| 4010 | }, |
| 4011 | .stack_argument_offset => |off| { |
| 4012 | _ = try self.addInst(.{ |
| 4013 | .tag = .ldr_ptr_stack_argument, |
| 4014 | .data = .{ .load_store_stack = .{ |
| 4015 | .rt = src_reg, |
| 4016 | .offset = off, |
| 4017 | } }, |
| 4018 | }); |
| 4019 | }, |
| 4020 | .memory => |addr| try self.genSetReg(Type.usize, src_reg, .{ .immediate = @as(u32, @intCast(addr)) }), |
| 4021 | .linker_load => |load_struct| { |
| 4022 | const tag: Mir.Inst.Tag = switch (load_struct.type) { |
| 4023 | .got => .load_memory_ptr_got, |
| 4024 | .direct => .load_memory_ptr_direct, |
| 4025 | .import => unreachable, |
| 4026 | }; |
| 4027 | const atom_index = switch (self.bin_file.tag) { |
| 4028 | .macho => { |
| 4029 | // const macho_file = self.bin_file.cast(link.File.MachO).?; |
| 4030 | // const atom = try macho_file.getOrCreateAtomForDecl(self.owner_decl); |
| 4031 | // break :blk macho_file.getAtom(atom).getSymbolIndex().?; |
| 4032 | @panic("TODO store"); |
| 4033 | }, |
| 4034 | .coff => blk: { |
| 4035 | const coff_file = self.bin_file.cast(.coff).?; |
| 4036 | const atom = try coff_file.getOrCreateAtomForNav(self.owner_nav); |
| 4037 | break :blk coff_file.getAtom(atom).getSymbolIndex().?; |
| 4038 | }, |
| 4039 | else => unreachable, // unsupported target format |
| 4040 | }; |
| 4041 | _ = try self.addInst(.{ |
| 4042 | .tag = tag, |
| 4043 | .data = .{ |
| 4044 | .payload = try self.addExtra(Mir.LoadMemoryPie{ |
| 4045 | .register = @intFromEnum(src_reg), |
| 4046 | .atom_index = atom_index, |
| 4047 | .sym_index = load_struct.sym_index, |
| 4048 | }), |
| 4049 | }, |
| 4050 | }); |
| 4051 | }, |
| 4052 | else => return self.fail("TODO store {} to register", .{value}), |
| 4053 | } |
| 4054 | |
| 4055 | // mov len, #abi_size |
| 4056 | try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); |
| 4057 | |
| 4058 | // memcpy(src, dst, len) |
| 4059 | try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); |
| 4060 | } |
| 4061 | }, |
| 4062 | } |
| 4063 | }, |
| 4064 | .memory, |
| 4065 | .stack_offset, |
| 4066 | .stack_argument_offset, |
| 4067 | .linker_load, |
| 4068 | => { |
| 4069 | const addr_reg = try self.copyToTmpRegister(ptr_ty, ptr); |
| 4070 | try self.store(.{ .register = addr_reg }, value, ptr_ty, value_ty); |
| 4071 | }, |
| 4072 | } |
| 4073 | } |
| 4074 | |
| 4075 | fn airStore(self: *Self, inst: Air.Inst.Index, safety: bool) InnerError!void { |
| 4076 | if (safety) { |
| 4077 | // TODO if the value is undef, write 0xaa bytes to dest |
| 4078 | } else { |
| 4079 | // TODO if the value is undef, don't lower this instruction |
| 4080 | } |
| 4081 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 4082 | const ptr = try self.resolveInst(bin_op.lhs); |
| 4083 | const value = try self.resolveInst(bin_op.rhs); |
| 4084 | const ptr_ty = self.typeOf(bin_op.lhs); |
| 4085 | const value_ty = self.typeOf(bin_op.rhs); |
| 4086 | |
| 4087 | try self.store(ptr, value, ptr_ty, value_ty); |
| 4088 | |
| 4089 | return self.finishAir(inst, .dead, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 4090 | } |
| 4091 | |
| 4092 | fn airStructFieldPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4093 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 4094 | const extra = self.air.extraData(Air.StructField, ty_pl.payload).data; |
| 4095 | const result = try self.structFieldPtr(inst, extra.struct_operand, extra.field_index); |
| 4096 | return self.finishAir(inst, result, .{ extra.struct_operand, .none, .none }); |
| 4097 | } |
| 4098 | |
| 4099 | fn airStructFieldPtrIndex(self: *Self, inst: Air.Inst.Index, index: u8) InnerError!void { |
| 4100 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 4101 | const result = try self.structFieldPtr(inst, ty_op.operand, index); |
| 4102 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 4103 | } |
| 4104 | |
| 4105 | fn structFieldPtr(self: *Self, inst: Air.Inst.Index, operand: Air.Inst.Ref, index: u32) !MCValue { |
| 4106 | return if (self.liveness.isUnused(inst)) .dead else result: { |
| 4107 | const pt = self.pt; |
| 4108 | const zcu = pt.zcu; |
| 4109 | const mcv = try self.resolveInst(operand); |
| 4110 | const ptr_ty = self.typeOf(operand); |
| 4111 | const struct_ty = ptr_ty.childType(zcu); |
| 4112 | const struct_field_offset = @as(u32, @intCast(struct_ty.structFieldOffset(index, zcu))); |
| 4113 | switch (mcv) { |
| 4114 | .ptr_stack_offset => |off| { |
| 4115 | break :result MCValue{ .ptr_stack_offset = off - struct_field_offset }; |
| 4116 | }, |
| 4117 | else => { |
| 4118 | const lhs_bind: ReadArg.Bind = .{ .mcv = mcv }; |
| 4119 | const rhs_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = struct_field_offset } }; |
| 4120 | |
| 4121 | break :result try self.addSub(.add, lhs_bind, rhs_bind, Type.usize, Type.usize, null); |
| 4122 | }, |
| 4123 | } |
| 4124 | }; |
| 4125 | } |
| 4126 | |
| 4127 | fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4128 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 4129 | const extra = self.air.extraData(Air.StructField, ty_pl.payload).data; |
| 4130 | const operand = extra.struct_operand; |
| 4131 | const index = extra.field_index; |
| 4132 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4133 | const pt = self.pt; |
| 4134 | const zcu = pt.zcu; |
| 4135 | const mcv = try self.resolveInst(operand); |
| 4136 | const struct_ty = self.typeOf(operand); |
| 4137 | const struct_field_ty = struct_ty.fieldType(index, zcu); |
| 4138 | const struct_field_offset = @as(u32, @intCast(struct_ty.structFieldOffset(index, zcu))); |
| 4139 | |
| 4140 | switch (mcv) { |
| 4141 | .dead, .unreach => unreachable, |
| 4142 | .stack_argument_offset => |off| { |
| 4143 | break :result MCValue{ .stack_argument_offset = off + struct_field_offset }; |
| 4144 | }, |
| 4145 | .stack_offset => |off| { |
| 4146 | break :result MCValue{ .stack_offset = off - struct_field_offset }; |
| 4147 | }, |
| 4148 | .memory => |addr| { |
| 4149 | break :result MCValue{ .memory = addr + struct_field_offset }; |
| 4150 | }, |
| 4151 | .register_with_overflow => |rwo| { |
| 4152 | const reg_lock = self.register_manager.lockRegAssumeUnused(rwo.reg); |
| 4153 | defer self.register_manager.unlockReg(reg_lock); |
| 4154 | |
| 4155 | const field: MCValue = switch (index) { |
| 4156 | // get wrapped value: return register |
| 4157 | 0 => MCValue{ .register = rwo.reg }, |
| 4158 | |
| 4159 | // get overflow bit: return C or V flag |
| 4160 | 1 => MCValue{ .compare_flags = rwo.flag }, |
| 4161 | |
| 4162 | else => unreachable, |
| 4163 | }; |
| 4164 | |
| 4165 | if (self.reuseOperand(inst, operand, 0, field)) { |
| 4166 | break :result field; |
| 4167 | } else { |
| 4168 | // Copy to new register |
| 4169 | const raw_dest_reg = try self.register_manager.allocReg(null, gp); |
| 4170 | const dest_reg = self.registerAlias(raw_dest_reg, struct_field_ty); |
| 4171 | try self.genSetReg(struct_field_ty, dest_reg, field); |
| 4172 | |
| 4173 | break :result MCValue{ .register = dest_reg }; |
| 4174 | } |
| 4175 | }, |
| 4176 | else => return self.fail("TODO implement codegen struct_field_val for {}", .{mcv}), |
| 4177 | } |
| 4178 | }; |
| 4179 | |
| 4180 | return self.finishAir(inst, result, .{ extra.struct_operand, .none, .none }); |
| 4181 | } |
| 4182 | |
| 4183 | fn airFieldParentPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4184 | const pt = self.pt; |
| 4185 | const zcu = pt.zcu; |
| 4186 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 4187 | const extra = self.air.extraData(Air.FieldParentPtr, ty_pl.payload).data; |
| 4188 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4189 | const field_ptr = try self.resolveInst(extra.field_ptr); |
| 4190 | const struct_ty = ty_pl.ty.toType().childType(zcu); |
| 4191 | const struct_field_offset = @as(u32, @intCast(struct_ty.structFieldOffset(extra.field_index, zcu))); |
| 4192 | switch (field_ptr) { |
| 4193 | .ptr_stack_offset => |off| { |
| 4194 | break :result MCValue{ .ptr_stack_offset = off + struct_field_offset }; |
| 4195 | }, |
| 4196 | else => { |
| 4197 | const lhs_bind: ReadArg.Bind = .{ .mcv = field_ptr }; |
| 4198 | const rhs_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = struct_field_offset } }; |
| 4199 | |
| 4200 | break :result try self.addSub(.sub, lhs_bind, rhs_bind, Type.usize, Type.usize, null); |
| 4201 | }, |
| 4202 | } |
| 4203 | }; |
| 4204 | return self.finishAir(inst, result, .{ extra.field_ptr, .none, .none }); |
| 4205 | } |
| 4206 | |
| 4207 | fn airArg(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4208 | // skip zero-bit arguments as they don't have a corresponding arg instruction |
| 4209 | var arg_index = self.arg_index; |
| 4210 | while (self.args[arg_index] == .none) arg_index += 1; |
| 4211 | self.arg_index = arg_index + 1; |
| 4212 | |
| 4213 | const zcu = self.pt.zcu; |
| 4214 | const func_zir = zcu.funcInfo(self.func_index).zir_body_inst.resolveFull(&zcu.intern_pool).?; |
| 4215 | const file = zcu.fileByIndex(func_zir.file); |
| 4216 | if (!file.mod.?.strip) { |
| 4217 | const tag = self.air.instructions.items(.tag)[@intFromEnum(inst)]; |
| 4218 | const arg = self.air.instructions.items(.data)[@intFromEnum(inst)].arg; |
| 4219 | const ty = self.typeOfIndex(inst); |
| 4220 | const zir = &file.zir.?; |
| 4221 | const name = zir.nullTerminatedString(zir.getParamName(zir.getParamBody(func_zir.inst)[arg.zir_param_index]).?); |
| 4222 | try self.dbg_info_relocs.append(self.gpa, .{ |
| 4223 | .tag = tag, |
| 4224 | .ty = ty, |
| 4225 | .name = name, |
| 4226 | .mcv = self.args[arg_index], |
| 4227 | }); |
| 4228 | } |
| 4229 | |
| 4230 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else self.args[arg_index]; |
| 4231 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 4232 | } |
| 4233 | |
| 4234 | fn airTrap(self: *Self) InnerError!void { |
| 4235 | _ = try self.addInst(.{ |
| 4236 | .tag = .brk, |
| 4237 | .data = .{ .imm16 = 0x0001 }, |
| 4238 | }); |
| 4239 | return self.finishAirBookkeeping(); |
| 4240 | } |
| 4241 | |
| 4242 | fn airBreakpoint(self: *Self) InnerError!void { |
| 4243 | _ = try self.addInst(.{ |
| 4244 | .tag = .brk, |
| 4245 | .data = .{ .imm16 = 0xf000 }, |
| 4246 | }); |
| 4247 | return self.finishAirBookkeeping(); |
| 4248 | } |
| 4249 | |
| 4250 | fn airRetAddr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4251 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airRetAddr for aarch64", .{}); |
| 4252 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 4253 | } |
| 4254 | |
| 4255 | fn airFrameAddress(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4256 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFrameAddress for aarch64", .{}); |
| 4257 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 4258 | } |
| 4259 | |
| 4260 | fn airCall(self: *Self, inst: Air.Inst.Index, modifier: std.builtin.CallModifier) InnerError!void { |
| 4261 | if (modifier == .always_tail) return self.fail("TODO implement tail calls for aarch64", .{}); |
| 4262 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 4263 | const callee = pl_op.operand; |
| 4264 | const extra = self.air.extraData(Air.Call, pl_op.payload); |
| 4265 | const args: []const Air.Inst.Ref = @ptrCast(self.air.extra.items[extra.end..][0..extra.data.args_len]); |
| 4266 | const ty = self.typeOf(callee); |
| 4267 | const pt = self.pt; |
| 4268 | const zcu = pt.zcu; |
| 4269 | const ip = &zcu.intern_pool; |
| 4270 | |
| 4271 | const fn_ty = switch (ty.zigTypeTag(zcu)) { |
| 4272 | .@"fn" => ty, |
| 4273 | .pointer => ty.childType(zcu), |
| 4274 | else => unreachable, |
| 4275 | }; |
| 4276 | |
| 4277 | var info = try self.resolveCallingConventionValues(fn_ty); |
| 4278 | defer info.deinit(self); |
| 4279 | |
| 4280 | // According to the Procedure Call Standard for the ARM |
| 4281 | // Architecture, compare flags are not preserved across |
| 4282 | // calls. Therefore, if some value is currently stored there, we |
| 4283 | // need to save it. |
| 4284 | // |
| 4285 | // TODO once caller-saved registers are implemented, save them |
| 4286 | // here too, but crucially *after* we save the compare flags as |
| 4287 | // saving compare flags may require a new caller-saved register |
| 4288 | try self.spillCompareFlagsIfOccupied(); |
| 4289 | |
| 4290 | if (info.return_value == .stack_offset) { |
| 4291 | log.debug("airCall: return by reference", .{}); |
| 4292 | const ret_ty = fn_ty.fnReturnType(zcu); |
| 4293 | const ret_abi_size: u32 = @intCast(ret_ty.abiSize(zcu)); |
| 4294 | const ret_abi_align = ret_ty.abiAlignment(zcu); |
| 4295 | const stack_offset = try self.allocMem(ret_abi_size, ret_abi_align, inst); |
| 4296 | |
| 4297 | const ret_ptr_reg = self.registerAlias(.x0, Type.usize); |
| 4298 | |
| 4299 | const ptr_ty = try pt.singleMutPtrType(ret_ty); |
| 4300 | try self.register_manager.getReg(ret_ptr_reg, null); |
| 4301 | try self.genSetReg(ptr_ty, ret_ptr_reg, .{ .ptr_stack_offset = stack_offset }); |
| 4302 | |
| 4303 | info.return_value = .{ .stack_offset = stack_offset }; |
| 4304 | } |
| 4305 | |
| 4306 | // Make space for the arguments passed via the stack |
| 4307 | self.max_end_stack += info.stack_byte_count; |
| 4308 | |
| 4309 | for (info.args, 0..) |mc_arg, arg_i| { |
| 4310 | const arg = args[arg_i]; |
| 4311 | const arg_ty = self.typeOf(arg); |
| 4312 | const arg_mcv = try self.resolveInst(args[arg_i]); |
| 4313 | |
| 4314 | switch (mc_arg) { |
| 4315 | .none => continue, |
| 4316 | .register => |reg| { |
| 4317 | try self.register_manager.getReg(reg, null); |
| 4318 | try self.genSetReg(arg_ty, reg, arg_mcv); |
| 4319 | }, |
| 4320 | .stack_offset => unreachable, |
| 4321 | .stack_argument_offset => |offset| try self.genSetStackArgument( |
| 4322 | arg_ty, |
| 4323 | offset, |
| 4324 | arg_mcv, |
| 4325 | ), |
| 4326 | else => unreachable, |
| 4327 | } |
| 4328 | } |
| 4329 | |
| 4330 | // Due to incremental compilation, how function calls are generated depends |
| 4331 | // on linking. |
| 4332 | if (try self.air.value(callee, pt)) |func_value| switch (ip.indexToKey(func_value.toIntern())) { |
| 4333 | .func => |func| { |
| 4334 | if (self.bin_file.cast(.elf)) |_| { |
| 4335 | return self.fail("TODO implement calling functions for Elf", .{}); |
| 4336 | } else if (self.bin_file.cast(.macho)) |_| { |
| 4337 | return self.fail("TODO implement calling functions for MachO", .{}); |
| 4338 | } else if (self.bin_file.cast(.coff)) |coff_file| { |
| 4339 | const atom = try coff_file.getOrCreateAtomForNav(func.owner_nav); |
| 4340 | const sym_index = coff_file.getAtom(atom).getSymbolIndex().?; |
| 4341 | try self.genSetReg(Type.u64, .x30, .{ |
| 4342 | .linker_load = .{ |
| 4343 | .type = .got, |
| 4344 | .sym_index = sym_index, |
| 4345 | }, |
| 4346 | }); |
| 4347 | } else if (self.bin_file.cast(.plan9)) |p9| { |
| 4348 | const atom_index = try p9.seeNav(pt, func.owner_nav); |
| 4349 | const atom = p9.getAtom(atom_index); |
| 4350 | try self.genSetReg(Type.usize, .x30, .{ .memory = atom.getOffsetTableAddress(p9) }); |
| 4351 | } else unreachable; |
| 4352 | |
| 4353 | _ = try self.addInst(.{ |
| 4354 | .tag = .blr, |
| 4355 | .data = .{ .reg = .x30 }, |
| 4356 | }); |
| 4357 | }, |
| 4358 | .@"extern" => |@"extern"| { |
| 4359 | const nav_name = ip.getNav(@"extern".owner_nav).name.toSlice(ip); |
| 4360 | const lib_name = @"extern".lib_name.toSlice(ip); |
| 4361 | if (self.bin_file.cast(.macho)) |_| { |
| 4362 | return self.fail("TODO implement calling extern functions for MachO", .{}); |
| 4363 | } else if (self.bin_file.cast(.coff)) |coff_file| { |
| 4364 | const sym_index = try coff_file.getGlobalSymbol(nav_name, lib_name); |
| 4365 | try self.genSetReg(Type.u64, .x30, .{ |
| 4366 | .linker_load = .{ |
| 4367 | .type = .import, |
| 4368 | .sym_index = sym_index, |
| 4369 | }, |
| 4370 | }); |
| 4371 | _ = try self.addInst(.{ |
| 4372 | .tag = .blr, |
| 4373 | .data = .{ .reg = .x30 }, |
| 4374 | }); |
| 4375 | } else { |
| 4376 | return self.fail("TODO implement calling extern functions", .{}); |
| 4377 | } |
| 4378 | }, |
| 4379 | else => return self.fail("TODO implement calling bitcasted functions", .{}), |
| 4380 | } else { |
| 4381 | assert(ty.zigTypeTag(zcu) == .pointer); |
| 4382 | const mcv = try self.resolveInst(callee); |
| 4383 | try self.genSetReg(ty, .x30, mcv); |
| 4384 | |
| 4385 | _ = try self.addInst(.{ |
| 4386 | .tag = .blr, |
| 4387 | .data = .{ .reg = .x30 }, |
| 4388 | }); |
| 4389 | } |
| 4390 | |
| 4391 | const result: MCValue = result: { |
| 4392 | switch (info.return_value) { |
| 4393 | .register => |reg| { |
| 4394 | if (RegisterManager.indexOfReg(&callee_preserved_regs, reg) == null) { |
| 4395 | // Save function return value in a callee saved register |
| 4396 | break :result try self.copyToNewRegister(inst, info.return_value); |
| 4397 | } |
| 4398 | }, |
| 4399 | else => {}, |
| 4400 | } |
| 4401 | break :result info.return_value; |
| 4402 | }; |
| 4403 | |
| 4404 | if (args.len + 1 <= Air.Liveness.bpi - 1) { |
| 4405 | var buf = [1]Air.Inst.Ref{.none} ** (Air.Liveness.bpi - 1); |
| 4406 | buf[0] = callee; |
| 4407 | @memcpy(buf[1..][0..args.len], args); |
| 4408 | return self.finishAir(inst, result, buf); |
| 4409 | } |
| 4410 | var bt = try self.iterateBigTomb(inst, 1 + args.len); |
| 4411 | bt.feed(callee); |
| 4412 | for (args) |arg| { |
| 4413 | bt.feed(arg); |
| 4414 | } |
| 4415 | return bt.finishAir(result); |
| 4416 | } |
| 4417 | |
| 4418 | fn airRet(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4419 | const pt = self.pt; |
| 4420 | const zcu = pt.zcu; |
| 4421 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4422 | const operand = try self.resolveInst(un_op); |
| 4423 | const ret_ty = self.fn_type.fnReturnType(zcu); |
| 4424 | |
| 4425 | switch (self.ret_mcv) { |
| 4426 | .none => {}, |
| 4427 | .immediate => { |
| 4428 | assert(ret_ty.isError(zcu)); |
| 4429 | }, |
| 4430 | .register => |reg| { |
| 4431 | // Return result by value |
| 4432 | try self.genSetReg(ret_ty, reg, operand); |
| 4433 | }, |
| 4434 | .stack_offset => { |
| 4435 | // Return result by reference |
| 4436 | // |
| 4437 | // self.ret_mcv is an address to where this function |
| 4438 | // should store its result into |
| 4439 | const ptr_ty = try pt.singleMutPtrType(ret_ty); |
| 4440 | try self.store(self.ret_mcv, operand, ptr_ty, ret_ty); |
| 4441 | }, |
| 4442 | else => unreachable, |
| 4443 | } |
| 4444 | |
| 4445 | // Just add space for an instruction, patch this later |
| 4446 | try self.exitlude_jump_relocs.append(self.gpa, try self.addNop()); |
| 4447 | |
| 4448 | return self.finishAir(inst, .dead, .{ un_op, .none, .none }); |
| 4449 | } |
| 4450 | |
| 4451 | fn airRetLoad(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4452 | const pt = self.pt; |
| 4453 | const zcu = pt.zcu; |
| 4454 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4455 | const ptr = try self.resolveInst(un_op); |
| 4456 | const ptr_ty = self.typeOf(un_op); |
| 4457 | const ret_ty = self.fn_type.fnReturnType(zcu); |
| 4458 | |
| 4459 | switch (self.ret_mcv) { |
| 4460 | .none => {}, |
| 4461 | .register => { |
| 4462 | // Return result by value |
| 4463 | try self.load(self.ret_mcv, ptr, ptr_ty); |
| 4464 | }, |
| 4465 | .stack_offset => { |
| 4466 | // Return result by reference |
| 4467 | // |
| 4468 | // self.ret_mcv is an address to where this function |
| 4469 | // should store its result into |
| 4470 | // |
| 4471 | // If the operand is a ret_ptr instruction, we are done |
| 4472 | // here. Else we need to load the result from the location |
| 4473 | // pointed to by the operand and store it to the result |
| 4474 | // location. |
| 4475 | const op_inst = un_op.toIndex().?; |
| 4476 | if (self.air.instructions.items(.tag)[@intFromEnum(op_inst)] != .ret_ptr) { |
| 4477 | const abi_size = @as(u32, @intCast(ret_ty.abiSize(zcu))); |
| 4478 | const abi_align = ret_ty.abiAlignment(zcu); |
| 4479 | |
| 4480 | const offset = try self.allocMem(abi_size, abi_align, null); |
| 4481 | |
| 4482 | const tmp_mcv = MCValue{ .stack_offset = offset }; |
| 4483 | try self.load(tmp_mcv, ptr, ptr_ty); |
| 4484 | try self.store(self.ret_mcv, tmp_mcv, ptr_ty, ret_ty); |
| 4485 | } |
| 4486 | }, |
| 4487 | else => unreachable, // invalid return result |
| 4488 | } |
| 4489 | |
| 4490 | try self.exitlude_jump_relocs.append(self.gpa, try self.addNop()); |
| 4491 | |
| 4492 | return self.finishAir(inst, .dead, .{ un_op, .none, .none }); |
| 4493 | } |
| 4494 | |
| 4495 | fn airCmp(self: *Self, inst: Air.Inst.Index, op: math.CompareOperator) InnerError!void { |
| 4496 | const bin_op = self.air.instructions.items(.data)[@intFromEnum(inst)].bin_op; |
| 4497 | const lhs_ty = self.typeOf(bin_op.lhs); |
| 4498 | |
| 4499 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else blk: { |
| 4500 | break :blk try self.cmp(.{ .inst = bin_op.lhs }, .{ .inst = bin_op.rhs }, lhs_ty, op); |
| 4501 | }; |
| 4502 | |
| 4503 | return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); |
| 4504 | } |
| 4505 | |
| 4506 | fn cmp( |
| 4507 | self: *Self, |
| 4508 | lhs: ReadArg.Bind, |
| 4509 | rhs: ReadArg.Bind, |
| 4510 | lhs_ty: Type, |
| 4511 | op: math.CompareOperator, |
| 4512 | ) !MCValue { |
| 4513 | const pt = self.pt; |
| 4514 | const zcu = pt.zcu; |
| 4515 | const int_ty = switch (lhs_ty.zigTypeTag(zcu)) { |
| 4516 | .optional => blk: { |
| 4517 | const payload_ty = lhs_ty.optionalChild(zcu); |
| 4518 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) { |
| 4519 | break :blk Type.u1; |
| 4520 | } else if (lhs_ty.isPtrLikeOptional(zcu)) { |
| 4521 | break :blk Type.usize; |
| 4522 | } else { |
| 4523 | return self.fail("TODO ARM cmp non-pointer optionals", .{}); |
| 4524 | } |
| 4525 | }, |
| 4526 | .float => return self.fail("TODO ARM cmp floats", .{}), |
| 4527 | .@"enum" => lhs_ty.intTagType(zcu), |
| 4528 | .int => lhs_ty, |
| 4529 | .bool => Type.u1, |
| 4530 | .pointer => Type.usize, |
| 4531 | .error_set => Type.u16, |
| 4532 | else => unreachable, |
| 4533 | }; |
| 4534 | |
| 4535 | const int_info = int_ty.intInfo(zcu); |
| 4536 | if (int_info.bits <= 64) { |
| 4537 | try self.spillCompareFlagsIfOccupied(); |
| 4538 | |
| 4539 | var lhs_reg: Register = undefined; |
| 4540 | var rhs_reg: Register = undefined; |
| 4541 | |
| 4542 | const rhs_immediate = try rhs.resolveToImmediate(self); |
| 4543 | const rhs_immediate_ok = if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false; |
| 4544 | |
| 4545 | if (rhs_immediate_ok) { |
| 4546 | const read_args = [_]ReadArg{ |
| 4547 | .{ .ty = int_ty, .bind = lhs, .class = gp, .reg = &lhs_reg }, |
| 4548 | }; |
| 4549 | try self.allocRegs( |
| 4550 | &read_args, |
| 4551 | &.{}, |
| 4552 | null, // we won't be able to reuse a register as there are no write_regs |
| 4553 | ); |
| 4554 | |
| 4555 | _ = try self.addInst(.{ |
| 4556 | .tag = .cmp_immediate, |
| 4557 | .data = .{ .r_imm12_sh = .{ |
| 4558 | .rn = lhs_reg, |
| 4559 | .imm12 = @as(u12, @intCast(rhs_immediate.?)), |
| 4560 | } }, |
| 4561 | }); |
| 4562 | } else { |
| 4563 | const read_args = [_]ReadArg{ |
| 4564 | .{ .ty = int_ty, .bind = lhs, .class = gp, .reg = &lhs_reg }, |
| 4565 | .{ .ty = int_ty, .bind = rhs, .class = gp, .reg = &rhs_reg }, |
| 4566 | }; |
| 4567 | try self.allocRegs( |
| 4568 | &read_args, |
| 4569 | &.{}, |
| 4570 | null, // we won't be able to reuse a register as there are no write_regs |
| 4571 | ); |
| 4572 | |
| 4573 | _ = try self.addInst(.{ |
| 4574 | .tag = .cmp_shifted_register, |
| 4575 | .data = .{ .rr_imm6_shift = .{ |
| 4576 | .rn = lhs_reg, |
| 4577 | .rm = rhs_reg, |
| 4578 | .imm6 = 0, |
| 4579 | .shift = .lsl, |
| 4580 | } }, |
| 4581 | }); |
| 4582 | } |
| 4583 | |
| 4584 | return switch (int_info.signedness) { |
| 4585 | .signed => MCValue{ .compare_flags = Condition.fromCompareOperatorSigned(op) }, |
| 4586 | .unsigned => MCValue{ .compare_flags = Condition.fromCompareOperatorUnsigned(op) }, |
| 4587 | }; |
| 4588 | } else { |
| 4589 | return self.fail("TODO AArch64 cmp for ints > 64 bits", .{}); |
| 4590 | } |
| 4591 | } |
| 4592 | |
| 4593 | fn airCmpVector(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4594 | _ = inst; |
| 4595 | return self.fail("TODO implement airCmpVector for {}", .{self.target.cpu.arch}); |
| 4596 | } |
| 4597 | |
| 4598 | fn airCmpLtErrorsLen(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4599 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4600 | const operand = try self.resolveInst(un_op); |
| 4601 | _ = operand; |
| 4602 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airCmpLtErrorsLen for {}", .{self.target.cpu.arch}); |
| 4603 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4604 | } |
| 4605 | |
| 4606 | fn airDbgStmt(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4607 | const dbg_stmt = self.air.instructions.items(.data)[@intFromEnum(inst)].dbg_stmt; |
| 4608 | |
| 4609 | _ = try self.addInst(.{ |
| 4610 | .tag = .dbg_line, |
| 4611 | .data = .{ .dbg_line_column = .{ |
| 4612 | .line = dbg_stmt.line, |
| 4613 | .column = dbg_stmt.column, |
| 4614 | } }, |
| 4615 | }); |
| 4616 | |
| 4617 | return self.finishAirBookkeeping(); |
| 4618 | } |
| 4619 | |
| 4620 | fn airDbgInlineBlock(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4621 | const pt = self.pt; |
| 4622 | const zcu = pt.zcu; |
| 4623 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 4624 | const extra = self.air.extraData(Air.DbgInlineBlock, ty_pl.payload); |
| 4625 | const func = zcu.funcInfo(extra.data.func); |
| 4626 | // TODO emit debug info for function change |
| 4627 | _ = func; |
| 4628 | try self.lowerBlock(inst, @ptrCast(self.air.extra.items[extra.end..][0..extra.data.body_len])); |
| 4629 | } |
| 4630 | |
| 4631 | fn airDbgVar(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4632 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 4633 | const operand = pl_op.operand; |
| 4634 | const tag = self.air.instructions.items(.tag)[@intFromEnum(inst)]; |
| 4635 | const ty = self.typeOf(operand); |
| 4636 | const mcv = try self.resolveInst(operand); |
| 4637 | const name: Air.NullTerminatedString = @enumFromInt(pl_op.payload); |
| 4638 | |
| 4639 | log.debug("airDbgVar: %{d}: {}, {}", .{ inst, ty.fmtDebug(), mcv }); |
| 4640 | |
| 4641 | try self.dbg_info_relocs.append(self.gpa, .{ |
| 4642 | .tag = tag, |
| 4643 | .ty = ty, |
| 4644 | .name = name.toSlice(self.air), |
| 4645 | .mcv = mcv, |
| 4646 | }); |
| 4647 | |
| 4648 | return self.finishAir(inst, .dead, .{ operand, .none, .none }); |
| 4649 | } |
| 4650 | |
| 4651 | fn condBr(self: *Self, condition: MCValue) !Mir.Inst.Index { |
| 4652 | switch (condition) { |
| 4653 | .compare_flags => |cond| return try self.addInst(.{ |
| 4654 | .tag = .b_cond, |
| 4655 | .data = .{ |
| 4656 | .inst_cond = .{ |
| 4657 | .inst = undefined, // populated later through performReloc |
| 4658 | // Here we map to the opposite condition because the jump is to the false branch. |
| 4659 | .cond = cond.negate(), |
| 4660 | }, |
| 4661 | }, |
| 4662 | }), |
| 4663 | else => { |
| 4664 | const reg = switch (condition) { |
| 4665 | .register => |r| r, |
| 4666 | else => try self.copyToTmpRegister(Type.bool, condition), |
| 4667 | }; |
| 4668 | |
| 4669 | return try self.addInst(.{ |
| 4670 | .tag = .cbz, |
| 4671 | .data = .{ |
| 4672 | .r_inst = .{ |
| 4673 | .rt = reg, |
| 4674 | .inst = undefined, // populated later through performReloc |
| 4675 | }, |
| 4676 | }, |
| 4677 | }); |
| 4678 | }, |
| 4679 | } |
| 4680 | } |
| 4681 | |
| 4682 | fn airCondBr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4683 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 4684 | const cond = try self.resolveInst(pl_op.operand); |
| 4685 | const extra = self.air.extraData(Air.CondBr, pl_op.payload); |
| 4686 | const then_body: []const Air.Inst.Index = @ptrCast(self.air.extra.items[extra.end..][0..extra.data.then_body_len]); |
| 4687 | const else_body: []const Air.Inst.Index = @ptrCast(self.air.extra.items[extra.end + then_body.len ..][0..extra.data.else_body_len]); |
| 4688 | const liveness_condbr = self.liveness.getCondBr(inst); |
| 4689 | |
| 4690 | const reloc = try self.condBr(cond); |
| 4691 | |
| 4692 | // If the condition dies here in this condbr instruction, process |
| 4693 | // that death now instead of later as this has an effect on |
| 4694 | // whether it needs to be spilled in the branches |
| 4695 | if (self.liveness.operandDies(inst, 0)) { |
| 4696 | if (pl_op.operand.toIndex()) |op_index| { |
| 4697 | self.processDeath(op_index); |
| 4698 | } |
| 4699 | } |
| 4700 | |
| 4701 | // Capture the state of register and stack allocation state so that we can revert to it. |
| 4702 | const parent_next_stack_offset = self.next_stack_offset; |
| 4703 | const parent_free_registers = self.register_manager.free_registers; |
| 4704 | var parent_stack = try self.stack.clone(self.gpa); |
| 4705 | defer parent_stack.deinit(self.gpa); |
| 4706 | const parent_registers = self.register_manager.registers; |
| 4707 | const parent_compare_flags_inst = self.compare_flags_inst; |
| 4708 | |
| 4709 | try self.branch_stack.append(.{}); |
| 4710 | errdefer { |
| 4711 | _ = self.branch_stack.pop().?; |
| 4712 | } |
| 4713 | |
| 4714 | try self.ensureProcessDeathCapacity(liveness_condbr.then_deaths.len); |
| 4715 | for (liveness_condbr.then_deaths) |operand| { |
| 4716 | self.processDeath(operand); |
| 4717 | } |
| 4718 | try self.genBody(then_body); |
| 4719 | |
| 4720 | // Revert to the previous register and stack allocation state. |
| 4721 | |
| 4722 | var saved_then_branch = self.branch_stack.pop().?; |
| 4723 | defer saved_then_branch.deinit(self.gpa); |
| 4724 | |
| 4725 | self.register_manager.registers = parent_registers; |
| 4726 | self.compare_flags_inst = parent_compare_flags_inst; |
| 4727 | |
| 4728 | self.stack.deinit(self.gpa); |
| 4729 | self.stack = parent_stack; |
| 4730 | parent_stack = .{}; |
| 4731 | |
| 4732 | self.next_stack_offset = parent_next_stack_offset; |
| 4733 | self.register_manager.free_registers = parent_free_registers; |
| 4734 | |
| 4735 | try self.performReloc(reloc); |
| 4736 | const else_branch = self.branch_stack.addOneAssumeCapacity(); |
| 4737 | else_branch.* = .{}; |
| 4738 | |
| 4739 | try self.ensureProcessDeathCapacity(liveness_condbr.else_deaths.len); |
| 4740 | for (liveness_condbr.else_deaths) |operand| { |
| 4741 | self.processDeath(operand); |
| 4742 | } |
| 4743 | try self.genBody(else_body); |
| 4744 | |
| 4745 | // At this point, each branch will possibly have conflicting values for where |
| 4746 | // each instruction is stored. They agree, however, on which instructions are alive/dead. |
| 4747 | // We use the first ("then") branch as canonical, and here emit |
| 4748 | // instructions into the second ("else") branch to make it conform. |
| 4749 | // We continue respect the data structure semantic guarantees of the else_branch so |
| 4750 | // that we can use all the code emitting abstractions. This is why at the bottom we |
| 4751 | // assert that parent_branch.free_registers equals the saved_then_branch.free_registers |
| 4752 | // rather than assigning it. |
| 4753 | const parent_branch = &self.branch_stack.items[self.branch_stack.items.len - 2]; |
| 4754 | try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, else_branch.inst_table.count()); |
| 4755 | |
| 4756 | const else_slice = else_branch.inst_table.entries.slice(); |
| 4757 | const else_keys = else_slice.items(.key); |
| 4758 | const else_values = else_slice.items(.value); |
| 4759 | for (else_keys, 0..) |else_key, else_idx| { |
| 4760 | const else_value = else_values[else_idx]; |
| 4761 | const canon_mcv = if (saved_then_branch.inst_table.fetchSwapRemove(else_key)) |then_entry| blk: { |
| 4762 | // The instruction's MCValue is overridden in both branches. |
| 4763 | parent_branch.inst_table.putAssumeCapacity(else_key, then_entry.value); |
| 4764 | if (else_value == .dead) { |
| 4765 | assert(then_entry.value == .dead); |
| 4766 | continue; |
| 4767 | } |
| 4768 | break :blk then_entry.value; |
| 4769 | } else blk: { |
| 4770 | if (else_value == .dead) |
| 4771 | continue; |
| 4772 | // The instruction is only overridden in the else branch. |
| 4773 | var i: usize = self.branch_stack.items.len - 1; |
| 4774 | while (true) { |
| 4775 | i -= 1; // If this overflows, the question is: why wasn't the instruction marked dead? |
| 4776 | if (self.branch_stack.items[i].inst_table.get(else_key)) |mcv| { |
| 4777 | assert(mcv != .dead); |
| 4778 | break :blk mcv; |
| 4779 | } |
| 4780 | } |
| 4781 | }; |
| 4782 | log.debug("consolidating else_entry {d} {}=>{}", .{ else_key, else_value, canon_mcv }); |
| 4783 | // TODO make sure the destination stack offset / register does not already have something |
| 4784 | // going on there. |
| 4785 | try self.setRegOrMem(self.typeOfIndex(else_key), canon_mcv, else_value); |
| 4786 | // TODO track the new register / stack allocation |
| 4787 | } |
| 4788 | try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, saved_then_branch.inst_table.count()); |
| 4789 | const then_slice = saved_then_branch.inst_table.entries.slice(); |
| 4790 | const then_keys = then_slice.items(.key); |
| 4791 | const then_values = then_slice.items(.value); |
| 4792 | for (then_keys, 0..) |then_key, then_idx| { |
| 4793 | const then_value = then_values[then_idx]; |
| 4794 | // We already deleted the items from this table that matched the else_branch. |
| 4795 | // So these are all instructions that are only overridden in the then branch. |
| 4796 | parent_branch.inst_table.putAssumeCapacity(then_key, then_value); |
| 4797 | if (then_value == .dead) |
| 4798 | continue; |
| 4799 | const parent_mcv = blk: { |
| 4800 | var i: usize = self.branch_stack.items.len - 1; |
| 4801 | while (true) { |
| 4802 | i -= 1; |
| 4803 | if (self.branch_stack.items[i].inst_table.get(then_key)) |mcv| { |
| 4804 | assert(mcv != .dead); |
| 4805 | break :blk mcv; |
| 4806 | } |
| 4807 | } |
| 4808 | }; |
| 4809 | log.debug("consolidating then_entry {d} {}=>{}", .{ then_key, parent_mcv, then_value }); |
| 4810 | // TODO make sure the destination stack offset / register does not already have something |
| 4811 | // going on there. |
| 4812 | try self.setRegOrMem(self.typeOfIndex(then_key), parent_mcv, then_value); |
| 4813 | // TODO track the new register / stack allocation |
| 4814 | } |
| 4815 | |
| 4816 | { |
| 4817 | var item = self.branch_stack.pop().?; |
| 4818 | item.deinit(self.gpa); |
| 4819 | } |
| 4820 | |
| 4821 | // We already took care of pl_op.operand earlier, so we're going |
| 4822 | // to pass .none here |
| 4823 | return self.finishAir(inst, .unreach, .{ .none, .none, .none }); |
| 4824 | } |
| 4825 | |
| 4826 | fn isNull(self: *Self, operand_bind: ReadArg.Bind, operand_ty: Type) !MCValue { |
| 4827 | const pt = self.pt; |
| 4828 | const zcu = pt.zcu; |
| 4829 | const sentinel: struct { ty: Type, bind: ReadArg.Bind } = if (!operand_ty.isPtrLikeOptional(zcu)) blk: { |
| 4830 | const payload_ty = operand_ty.optionalChild(zcu); |
| 4831 | if (!payload_ty.hasRuntimeBitsIgnoreComptime(zcu)) |
| 4832 | break :blk .{ .ty = operand_ty, .bind = operand_bind }; |
| 4833 | |
| 4834 | const offset = @as(u32, @intCast(payload_ty.abiSize(zcu))); |
| 4835 | const operand_mcv = try operand_bind.resolveToMcv(self); |
| 4836 | const new_mcv: MCValue = switch (operand_mcv) { |
| 4837 | .register => |source_reg| new: { |
| 4838 | // TODO should we reuse the operand here? |
| 4839 | const raw_reg = try self.register_manager.allocReg(null, gp); |
| 4840 | const dest_reg = raw_reg.toX(); |
| 4841 | |
| 4842 | const shift = @as(u6, @intCast(offset * 8)); |
| 4843 | if (shift == 0) { |
| 4844 | try self.genSetReg(payload_ty, dest_reg, operand_mcv); |
| 4845 | } else { |
| 4846 | _ = try self.addInst(.{ |
| 4847 | .tag = if (payload_ty.isSignedInt(zcu)) |
| 4848 | Mir.Inst.Tag.asr_immediate |
| 4849 | else |
| 4850 | Mir.Inst.Tag.lsr_immediate, |
| 4851 | .data = .{ .rr_shift = .{ |
| 4852 | .rd = dest_reg, |
| 4853 | .rn = source_reg.toX(), |
| 4854 | .shift = shift, |
| 4855 | } }, |
| 4856 | }); |
| 4857 | } |
| 4858 | |
| 4859 | break :new .{ .register = self.registerAlias(dest_reg, payload_ty) }; |
| 4860 | }, |
| 4861 | .stack_argument_offset => |off| .{ .stack_argument_offset = off + offset }, |
| 4862 | .stack_offset => |off| .{ .stack_offset = off - offset }, |
| 4863 | .memory => |addr| .{ .memory = addr + offset }, |
| 4864 | else => unreachable, // invalid MCValue for an optional |
| 4865 | }; |
| 4866 | |
| 4867 | break :blk .{ .ty = Type.bool, .bind = .{ .mcv = new_mcv } }; |
| 4868 | } else .{ .ty = operand_ty, .bind = operand_bind }; |
| 4869 | const imm_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = 0 } }; |
| 4870 | return self.cmp(sentinel.bind, imm_bind, sentinel.ty, .eq); |
| 4871 | } |
| 4872 | |
| 4873 | fn isNonNull(self: *Self, operand_bind: ReadArg.Bind, operand_ty: Type) !MCValue { |
| 4874 | const is_null_res = try self.isNull(operand_bind, operand_ty); |
| 4875 | assert(is_null_res.compare_flags == .eq); |
| 4876 | return MCValue{ .compare_flags = is_null_res.compare_flags.negate() }; |
| 4877 | } |
| 4878 | |
| 4879 | fn isErr( |
| 4880 | self: *Self, |
| 4881 | error_union_bind: ReadArg.Bind, |
| 4882 | error_union_ty: Type, |
| 4883 | ) !MCValue { |
| 4884 | const pt = self.pt; |
| 4885 | const zcu = pt.zcu; |
| 4886 | const error_type = error_union_ty.errorUnionSet(zcu); |
| 4887 | |
| 4888 | if (error_type.errorSetIsEmpty(zcu)) { |
| 4889 | return MCValue{ .immediate = 0 }; // always false |
| 4890 | } |
| 4891 | |
| 4892 | const error_mcv = try self.errUnionErr(error_union_bind, error_union_ty, null); |
| 4893 | return try self.cmp(.{ .mcv = error_mcv }, .{ .mcv = .{ .immediate = 0 } }, error_type, .gt); |
| 4894 | } |
| 4895 | |
| 4896 | fn isNonErr( |
| 4897 | self: *Self, |
| 4898 | error_union_bind: ReadArg.Bind, |
| 4899 | error_union_ty: Type, |
| 4900 | ) !MCValue { |
| 4901 | const is_err_result = try self.isErr(error_union_bind, error_union_ty); |
| 4902 | switch (is_err_result) { |
| 4903 | .compare_flags => |cond| { |
| 4904 | assert(cond == .hi); |
| 4905 | return MCValue{ .compare_flags = cond.negate() }; |
| 4906 | }, |
| 4907 | .immediate => |imm| { |
| 4908 | assert(imm == 0); |
| 4909 | return MCValue{ .immediate = 1 }; |
| 4910 | }, |
| 4911 | else => unreachable, |
| 4912 | } |
| 4913 | } |
| 4914 | |
| 4915 | fn airIsNull(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4916 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4917 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4918 | const operand = try self.resolveInst(un_op); |
| 4919 | const operand_ty = self.typeOf(un_op); |
| 4920 | |
| 4921 | break :result try self.isNull(.{ .mcv = operand }, operand_ty); |
| 4922 | }; |
| 4923 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4924 | } |
| 4925 | |
| 4926 | fn airIsNullPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4927 | const pt = self.pt; |
| 4928 | const zcu = pt.zcu; |
| 4929 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4930 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4931 | const operand_ptr = try self.resolveInst(un_op); |
| 4932 | const ptr_ty = self.typeOf(un_op); |
| 4933 | const elem_ty = ptr_ty.childType(zcu); |
| 4934 | |
| 4935 | const operand = try self.allocRegOrMem(elem_ty, true, null); |
| 4936 | try self.load(operand, operand_ptr, ptr_ty); |
| 4937 | |
| 4938 | break :result try self.isNull(.{ .mcv = operand }, elem_ty); |
| 4939 | }; |
| 4940 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4941 | } |
| 4942 | |
| 4943 | fn airIsNonNull(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4944 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4945 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4946 | const operand = try self.resolveInst(un_op); |
| 4947 | const operand_ty = self.typeOf(un_op); |
| 4948 | |
| 4949 | break :result try self.isNonNull(.{ .mcv = operand }, operand_ty); |
| 4950 | }; |
| 4951 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4952 | } |
| 4953 | |
| 4954 | fn airIsNonNullPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4955 | const pt = self.pt; |
| 4956 | const zcu = pt.zcu; |
| 4957 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4958 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4959 | const operand_ptr = try self.resolveInst(un_op); |
| 4960 | const ptr_ty = self.typeOf(un_op); |
| 4961 | const elem_ty = ptr_ty.childType(zcu); |
| 4962 | |
| 4963 | const operand = try self.allocRegOrMem(elem_ty, true, null); |
| 4964 | try self.load(operand, operand_ptr, ptr_ty); |
| 4965 | |
| 4966 | break :result try self.isNonNull(.{ .mcv = operand }, elem_ty); |
| 4967 | }; |
| 4968 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4969 | } |
| 4970 | |
| 4971 | fn airIsErr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4972 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4973 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4974 | const error_union_bind: ReadArg.Bind = .{ .inst = un_op }; |
| 4975 | const error_union_ty = self.typeOf(un_op); |
| 4976 | |
| 4977 | break :result try self.isErr(error_union_bind, error_union_ty); |
| 4978 | }; |
| 4979 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4980 | } |
| 4981 | |
| 4982 | fn airIsErrPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 4983 | const pt = self.pt; |
| 4984 | const zcu = pt.zcu; |
| 4985 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 4986 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 4987 | const operand_ptr = try self.resolveInst(un_op); |
| 4988 | const ptr_ty = self.typeOf(un_op); |
| 4989 | const elem_ty = ptr_ty.childType(zcu); |
| 4990 | |
| 4991 | const operand = try self.allocRegOrMem(elem_ty, true, null); |
| 4992 | try self.load(operand, operand_ptr, ptr_ty); |
| 4993 | |
| 4994 | break :result try self.isErr(.{ .mcv = operand }, elem_ty); |
| 4995 | }; |
| 4996 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 4997 | } |
| 4998 | |
| 4999 | fn airIsNonErr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5000 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 5001 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 5002 | const error_union_bind: ReadArg.Bind = .{ .inst = un_op }; |
| 5003 | const error_union_ty = self.typeOf(un_op); |
| 5004 | |
| 5005 | break :result try self.isNonErr(error_union_bind, error_union_ty); |
| 5006 | }; |
| 5007 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 5008 | } |
| 5009 | |
| 5010 | fn airIsNonErrPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5011 | const pt = self.pt; |
| 5012 | const zcu = pt.zcu; |
| 5013 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 5014 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 5015 | const operand_ptr = try self.resolveInst(un_op); |
| 5016 | const ptr_ty = self.typeOf(un_op); |
| 5017 | const elem_ty = ptr_ty.childType(zcu); |
| 5018 | |
| 5019 | const operand = try self.allocRegOrMem(elem_ty, true, null); |
| 5020 | try self.load(operand, operand_ptr, ptr_ty); |
| 5021 | |
| 5022 | break :result try self.isNonErr(.{ .mcv = operand }, elem_ty); |
| 5023 | }; |
| 5024 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 5025 | } |
| 5026 | |
| 5027 | fn airLoop(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5028 | // A loop is a setup to be able to jump back to the beginning. |
| 5029 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 5030 | const loop = self.air.extraData(Air.Block, ty_pl.payload); |
| 5031 | const body: []const Air.Inst.Index = @ptrCast(self.air.extra.items[loop.end..][0..loop.data.body_len]); |
| 5032 | const start_index = @as(u32, @intCast(self.mir_instructions.len)); |
| 5033 | |
| 5034 | try self.genBody(body); |
| 5035 | try self.jump(start_index); |
| 5036 | |
| 5037 | return self.finishAirBookkeeping(); |
| 5038 | } |
| 5039 | |
| 5040 | /// Send control flow to `inst`. |
| 5041 | fn jump(self: *Self, inst: Mir.Inst.Index) !void { |
| 5042 | _ = try self.addInst(.{ |
| 5043 | .tag = .b, |
| 5044 | .data = .{ .inst = inst }, |
| 5045 | }); |
| 5046 | } |
| 5047 | |
| 5048 | fn airBlock(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5049 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 5050 | const extra = self.air.extraData(Air.Block, ty_pl.payload); |
| 5051 | try self.lowerBlock(inst, @ptrCast(self.air.extra.items[extra.end..][0..extra.data.body_len])); |
| 5052 | } |
| 5053 | |
| 5054 | fn lowerBlock(self: *Self, inst: Air.Inst.Index, body: []const Air.Inst.Index) !void { |
| 5055 | try self.blocks.putNoClobber(self.gpa, inst, .{ |
| 5056 | // A block is a setup to be able to jump to the end. |
| 5057 | .relocs = .{}, |
| 5058 | // It also acts as a receptacle for break operands. |
| 5059 | // Here we use `MCValue.none` to represent a null value so that the first |
| 5060 | // break instruction will choose a MCValue for the block result and overwrite |
| 5061 | // this field. Following break instructions will use that MCValue to put their |
| 5062 | // block results. |
| 5063 | .mcv = MCValue{ .none = {} }, |
| 5064 | }); |
| 5065 | defer self.blocks.getPtr(inst).?.relocs.deinit(self.gpa); |
| 5066 | |
| 5067 | // TODO emit debug info lexical block |
| 5068 | try self.genBody(body); |
| 5069 | |
| 5070 | // relocations for `br` instructions |
| 5071 | const relocs = &self.blocks.getPtr(inst).?.relocs; |
| 5072 | if (relocs.items.len > 0 and relocs.items[relocs.items.len - 1] == self.mir_instructions.len - 1) { |
| 5073 | // If the last Mir instruction is the last relocation (which |
| 5074 | // would just jump one instruction further), it can be safely |
| 5075 | // removed |
| 5076 | self.mir_instructions.orderedRemove(relocs.pop().?); |
| 5077 | } |
| 5078 | for (relocs.items) |reloc| { |
| 5079 | try self.performReloc(reloc); |
| 5080 | } |
| 5081 | |
| 5082 | const result = self.blocks.getPtr(inst).?.mcv; |
| 5083 | return self.finishAir(inst, result, .{ .none, .none, .none }); |
| 5084 | } |
| 5085 | |
| 5086 | fn airSwitch(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5087 | const switch_br = self.air.unwrapSwitch(inst); |
| 5088 | const condition_ty = self.typeOf(switch_br.operand); |
| 5089 | const liveness = try self.liveness.getSwitchBr( |
| 5090 | self.gpa, |
| 5091 | inst, |
| 5092 | switch_br.cases_len + 1, |
| 5093 | ); |
| 5094 | defer self.gpa.free(liveness.deaths); |
| 5095 | |
| 5096 | var it = switch_br.iterateCases(); |
| 5097 | while (it.next()) |case| { |
| 5098 | if (case.ranges.len > 0) return self.fail("TODO: switch with ranges", .{}); |
| 5099 | |
| 5100 | // For every item, we compare it to condition and branch into |
| 5101 | // the prong if they are equal. After we compared to all |
| 5102 | // items, we branch into the next prong (or if no other prongs |
| 5103 | // exist out of the switch statement). |
| 5104 | // |
| 5105 | // cmp condition, item1 |
| 5106 | // beq prong |
| 5107 | // cmp condition, item2 |
| 5108 | // beq prong |
| 5109 | // cmp condition, item3 |
| 5110 | // beq prong |
| 5111 | // b out |
| 5112 | // prong: ... |
| 5113 | // ... |
| 5114 | // out: ... |
| 5115 | const branch_into_prong_relocs = try self.gpa.alloc(u32, case.items.len); |
| 5116 | defer self.gpa.free(branch_into_prong_relocs); |
| 5117 | |
| 5118 | for (case.items, 0..) |item, idx| { |
| 5119 | const cmp_result = try self.cmp(.{ .inst = switch_br.operand }, .{ .inst = item }, condition_ty, .neq); |
| 5120 | branch_into_prong_relocs[idx] = try self.condBr(cmp_result); |
| 5121 | } |
| 5122 | |
| 5123 | const branch_away_from_prong_reloc = try self.addInst(.{ |
| 5124 | .tag = .b, |
| 5125 | .data = .{ .inst = undefined }, // populated later through performReloc |
| 5126 | }); |
| 5127 | |
| 5128 | for (branch_into_prong_relocs) |reloc| { |
| 5129 | try self.performReloc(reloc); |
| 5130 | } |
| 5131 | |
| 5132 | // Capture the state of register and stack allocation state so that we can revert to it. |
| 5133 | const parent_next_stack_offset = self.next_stack_offset; |
| 5134 | const parent_free_registers = self.register_manager.free_registers; |
| 5135 | const parent_compare_flags_inst = self.compare_flags_inst; |
| 5136 | var parent_stack = try self.stack.clone(self.gpa); |
| 5137 | defer parent_stack.deinit(self.gpa); |
| 5138 | const parent_registers = self.register_manager.registers; |
| 5139 | |
| 5140 | try self.branch_stack.append(.{}); |
| 5141 | errdefer { |
| 5142 | _ = self.branch_stack.pop().?; |
| 5143 | } |
| 5144 | |
| 5145 | try self.ensureProcessDeathCapacity(liveness.deaths[case.idx].len); |
| 5146 | for (liveness.deaths[case.idx]) |operand| { |
| 5147 | self.processDeath(operand); |
| 5148 | } |
| 5149 | try self.genBody(case.body); |
| 5150 | |
| 5151 | // Revert to the previous register and stack allocation state. |
| 5152 | var saved_case_branch = self.branch_stack.pop().?; |
| 5153 | defer saved_case_branch.deinit(self.gpa); |
| 5154 | |
| 5155 | self.register_manager.registers = parent_registers; |
| 5156 | self.compare_flags_inst = parent_compare_flags_inst; |
| 5157 | self.stack.deinit(self.gpa); |
| 5158 | self.stack = parent_stack; |
| 5159 | parent_stack = .{}; |
| 5160 | |
| 5161 | self.next_stack_offset = parent_next_stack_offset; |
| 5162 | self.register_manager.free_registers = parent_free_registers; |
| 5163 | |
| 5164 | try self.performReloc(branch_away_from_prong_reloc); |
| 5165 | } |
| 5166 | |
| 5167 | if (switch_br.else_body_len > 0) { |
| 5168 | const else_body = it.elseBody(); |
| 5169 | |
| 5170 | // Capture the state of register and stack allocation state so that we can revert to it. |
| 5171 | const parent_next_stack_offset = self.next_stack_offset; |
| 5172 | const parent_free_registers = self.register_manager.free_registers; |
| 5173 | const parent_compare_flags_inst = self.compare_flags_inst; |
| 5174 | var parent_stack = try self.stack.clone(self.gpa); |
| 5175 | defer parent_stack.deinit(self.gpa); |
| 5176 | const parent_registers = self.register_manager.registers; |
| 5177 | |
| 5178 | try self.branch_stack.append(.{}); |
| 5179 | errdefer { |
| 5180 | _ = self.branch_stack.pop().?; |
| 5181 | } |
| 5182 | |
| 5183 | const else_deaths = liveness.deaths.len - 1; |
| 5184 | try self.ensureProcessDeathCapacity(liveness.deaths[else_deaths].len); |
| 5185 | for (liveness.deaths[else_deaths]) |operand| { |
| 5186 | self.processDeath(operand); |
| 5187 | } |
| 5188 | try self.genBody(else_body); |
| 5189 | |
| 5190 | // Revert to the previous register and stack allocation state. |
| 5191 | var saved_case_branch = self.branch_stack.pop().?; |
| 5192 | defer saved_case_branch.deinit(self.gpa); |
| 5193 | |
| 5194 | self.register_manager.registers = parent_registers; |
| 5195 | self.compare_flags_inst = parent_compare_flags_inst; |
| 5196 | self.stack.deinit(self.gpa); |
| 5197 | self.stack = parent_stack; |
| 5198 | parent_stack = .{}; |
| 5199 | |
| 5200 | self.next_stack_offset = parent_next_stack_offset; |
| 5201 | self.register_manager.free_registers = parent_free_registers; |
| 5202 | |
| 5203 | // TODO consolidate returned MCValues between prongs and else branch like we do |
| 5204 | // in airCondBr. |
| 5205 | } |
| 5206 | |
| 5207 | return self.finishAir(inst, .unreach, .{ switch_br.operand, .none, .none }); |
| 5208 | } |
| 5209 | |
| 5210 | fn performReloc(self: *Self, inst: Mir.Inst.Index) !void { |
| 5211 | const tag = self.mir_instructions.items(.tag)[inst]; |
| 5212 | switch (tag) { |
| 5213 | .cbz => self.mir_instructions.items(.data)[inst].r_inst.inst = @intCast(self.mir_instructions.len), |
| 5214 | .b_cond => self.mir_instructions.items(.data)[inst].inst_cond.inst = @intCast(self.mir_instructions.len), |
| 5215 | .b => self.mir_instructions.items(.data)[inst].inst = @intCast(self.mir_instructions.len), |
| 5216 | else => unreachable, |
| 5217 | } |
| 5218 | } |
| 5219 | |
| 5220 | fn airBr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5221 | const branch = self.air.instructions.items(.data)[@intFromEnum(inst)].br; |
| 5222 | try self.br(branch.block_inst, branch.operand); |
| 5223 | return self.finishAir(inst, .dead, .{ branch.operand, .none, .none }); |
| 5224 | } |
| 5225 | |
| 5226 | fn br(self: *Self, block: Air.Inst.Index, operand: Air.Inst.Ref) !void { |
| 5227 | const pt = self.pt; |
| 5228 | const zcu = pt.zcu; |
| 5229 | const block_data = self.blocks.getPtr(block).?; |
| 5230 | |
| 5231 | if (self.typeOf(operand).hasRuntimeBits(zcu)) { |
| 5232 | const operand_mcv = try self.resolveInst(operand); |
| 5233 | const block_mcv = block_data.mcv; |
| 5234 | if (block_mcv == .none) { |
| 5235 | block_data.mcv = switch (operand_mcv) { |
| 5236 | .none, .dead, .unreach => unreachable, |
| 5237 | .register, .stack_offset, .memory => operand_mcv, |
| 5238 | .immediate, .stack_argument_offset, .compare_flags => blk: { |
| 5239 | const new_mcv = try self.allocRegOrMem(self.typeOfIndex(block), true, block); |
| 5240 | try self.setRegOrMem(self.typeOfIndex(block), new_mcv, operand_mcv); |
| 5241 | break :blk new_mcv; |
| 5242 | }, |
| 5243 | else => return self.fail("TODO implement block_data.mcv = operand_mcv for {}", .{operand_mcv}), |
| 5244 | }; |
| 5245 | } else { |
| 5246 | try self.setRegOrMem(self.typeOfIndex(block), block_mcv, operand_mcv); |
| 5247 | } |
| 5248 | } |
| 5249 | return self.brVoid(block); |
| 5250 | } |
| 5251 | |
| 5252 | fn brVoid(self: *Self, block: Air.Inst.Index) !void { |
| 5253 | const block_data = self.blocks.getPtr(block).?; |
| 5254 | |
| 5255 | // Emit a jump with a relocation. It will be patched up after the block ends. |
| 5256 | try block_data.relocs.ensureUnusedCapacity(self.gpa, 1); |
| 5257 | |
| 5258 | block_data.relocs.appendAssumeCapacity(try self.addInst(.{ |
| 5259 | .tag = .b, |
| 5260 | .data = .{ .inst = undefined }, // populated later through performReloc |
| 5261 | })); |
| 5262 | } |
| 5263 | |
| 5264 | fn airAsm(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5265 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 5266 | const extra = self.air.extraData(Air.Asm, ty_pl.payload); |
| 5267 | const is_volatile = @as(u1, @truncate(extra.data.flags >> 31)) != 0; |
| 5268 | const clobbers_len = @as(u31, @truncate(extra.data.flags)); |
| 5269 | var extra_i: usize = extra.end; |
| 5270 | const outputs: []const Air.Inst.Ref = @ptrCast(self.air.extra.items[extra_i..][0..extra.data.outputs_len]); |
| 5271 | extra_i += outputs.len; |
| 5272 | const inputs: []const Air.Inst.Ref = @ptrCast(self.air.extra.items[extra_i..][0..extra.data.inputs_len]); |
| 5273 | extra_i += inputs.len; |
| 5274 | |
| 5275 | const dead = !is_volatile and self.liveness.isUnused(inst); |
| 5276 | const result: MCValue = if (dead) .dead else result: { |
| 5277 | if (outputs.len > 1) { |
| 5278 | return self.fail("TODO implement codegen for asm with more than 1 output", .{}); |
| 5279 | } |
| 5280 | |
| 5281 | const output_constraint: ?[]const u8 = for (outputs) |output| { |
| 5282 | if (output != .none) { |
| 5283 | return self.fail("TODO implement codegen for non-expr asm", .{}); |
| 5284 | } |
| 5285 | const extra_bytes = std.mem.sliceAsBytes(self.air.extra.items[extra_i..]); |
| 5286 | const constraint = std.mem.sliceTo(std.mem.sliceAsBytes(self.air.extra.items[extra_i..]), 0); |
| 5287 | const name = std.mem.sliceTo(extra_bytes[constraint.len + 1 ..], 0); |
| 5288 | // This equation accounts for the fact that even if we have exactly 4 bytes |
| 5289 | // for the string, we still use the next u32 for the null terminator. |
| 5290 | extra_i += (constraint.len + name.len + (2 + 3)) / 4; |
| 5291 | |
| 5292 | break constraint; |
| 5293 | } else null; |
| 5294 | |
| 5295 | for (inputs) |input| { |
| 5296 | const input_bytes = std.mem.sliceAsBytes(self.air.extra.items[extra_i..]); |
| 5297 | const constraint = std.mem.sliceTo(input_bytes, 0); |
| 5298 | const name = std.mem.sliceTo(input_bytes[constraint.len + 1 ..], 0); |
| 5299 | // This equation accounts for the fact that even if we have exactly 4 bytes |
| 5300 | // for the string, we still use the next u32 for the null terminator. |
| 5301 | extra_i += (constraint.len + name.len + (2 + 3)) / 4; |
| 5302 | |
| 5303 | if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { |
| 5304 | return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); |
| 5305 | } |
| 5306 | const reg_name = constraint[1 .. constraint.len - 1]; |
| 5307 | const reg = parseRegName(reg_name) orelse |
| 5308 | return self.fail("unrecognized register: '{s}'", .{reg_name}); |
| 5309 | |
| 5310 | const arg_mcv = try self.resolveInst(input); |
| 5311 | try self.register_manager.getReg(reg, null); |
| 5312 | try self.genSetReg(self.typeOf(input), reg, arg_mcv); |
| 5313 | } |
| 5314 | |
| 5315 | { |
| 5316 | var clobber_i: u32 = 0; |
| 5317 | while (clobber_i < clobbers_len) : (clobber_i += 1) { |
| 5318 | const clobber = std.mem.sliceTo(std.mem.sliceAsBytes(self.air.extra.items[extra_i..]), 0); |
| 5319 | // This equation accounts for the fact that even if we have exactly 4 bytes |
| 5320 | // for the string, we still use the next u32 for the null terminator. |
| 5321 | extra_i += clobber.len / 4 + 1; |
| 5322 | |
| 5323 | // TODO honor these |
| 5324 | } |
| 5325 | } |
| 5326 | |
| 5327 | const asm_source = std.mem.sliceAsBytes(self.air.extra.items[extra_i..])[0..extra.data.source_len]; |
| 5328 | |
| 5329 | if (mem.eql(u8, asm_source, "svc #0")) { |
| 5330 | _ = try self.addInst(.{ |
| 5331 | .tag = .svc, |
| 5332 | .data = .{ .imm16 = 0x0 }, |
| 5333 | }); |
| 5334 | } else if (mem.eql(u8, asm_source, "svc #0x80")) { |
| 5335 | _ = try self.addInst(.{ |
| 5336 | .tag = .svc, |
| 5337 | .data = .{ .imm16 = 0x80 }, |
| 5338 | }); |
| 5339 | } else { |
| 5340 | return self.fail("TODO implement support for more aarch64 assembly instructions", .{}); |
| 5341 | } |
| 5342 | |
| 5343 | if (output_constraint) |output| { |
| 5344 | if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { |
| 5345 | return self.fail("unrecognized asm output constraint: '{s}'", .{output}); |
| 5346 | } |
| 5347 | const reg_name = output[2 .. output.len - 1]; |
| 5348 | const reg = parseRegName(reg_name) orelse |
| 5349 | return self.fail("unrecognized register: '{s}'", .{reg_name}); |
| 5350 | break :result MCValue{ .register = reg }; |
| 5351 | } else { |
| 5352 | break :result MCValue{ .none = {} }; |
| 5353 | } |
| 5354 | }; |
| 5355 | |
| 5356 | simple: { |
| 5357 | var buf = [1]Air.Inst.Ref{.none} ** (Air.Liveness.bpi - 1); |
| 5358 | var buf_index: usize = 0; |
| 5359 | for (outputs) |output| { |
| 5360 | if (output == .none) continue; |
| 5361 | |
| 5362 | if (buf_index >= buf.len) break :simple; |
| 5363 | buf[buf_index] = output; |
| 5364 | buf_index += 1; |
| 5365 | } |
| 5366 | if (buf_index + inputs.len > buf.len) break :simple; |
| 5367 | @memcpy(buf[buf_index..][0..inputs.len], inputs); |
| 5368 | return self.finishAir(inst, result, buf); |
| 5369 | } |
| 5370 | var bt = try self.iterateBigTomb(inst, outputs.len + inputs.len); |
| 5371 | for (outputs) |output| { |
| 5372 | if (output == .none) continue; |
| 5373 | |
| 5374 | bt.feed(output); |
| 5375 | } |
| 5376 | for (inputs) |input| { |
| 5377 | bt.feed(input); |
| 5378 | } |
| 5379 | return bt.finishAir(result); |
| 5380 | } |
| 5381 | |
| 5382 | fn iterateBigTomb(self: *Self, inst: Air.Inst.Index, operand_count: usize) !BigTomb { |
| 5383 | try self.ensureProcessDeathCapacity(operand_count + 1); |
| 5384 | return BigTomb{ |
| 5385 | .function = self, |
| 5386 | .inst = inst, |
| 5387 | .lbt = self.liveness.iterateBigTomb(inst), |
| 5388 | }; |
| 5389 | } |
| 5390 | |
| 5391 | /// Sets the value without any modifications to register allocation metadata or stack allocation metadata. |
| 5392 | fn setRegOrMem(self: *Self, ty: Type, loc: MCValue, val: MCValue) !void { |
| 5393 | switch (loc) { |
| 5394 | .none => return, |
| 5395 | .register => |reg| return self.genSetReg(ty, reg, val), |
| 5396 | .stack_offset => |off| return self.genSetStack(ty, off, val), |
| 5397 | .memory => { |
| 5398 | return self.fail("TODO implement setRegOrMem for memory", .{}); |
| 5399 | }, |
| 5400 | else => unreachable, |
| 5401 | } |
| 5402 | } |
| 5403 | |
| 5404 | fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { |
| 5405 | const pt = self.pt; |
| 5406 | const zcu = pt.zcu; |
| 5407 | const abi_size = @as(u32, @intCast(ty.abiSize(zcu))); |
| 5408 | switch (mcv) { |
| 5409 | .dead => unreachable, |
| 5410 | .unreach, .none => return, // Nothing to do. |
| 5411 | .undef => { |
| 5412 | if (!self.wantSafety()) |
| 5413 | return; // The already existing value will do just fine. |
| 5414 | // TODO Upgrade this to a memset call when we have that available. |
| 5415 | switch (abi_size) { |
| 5416 | 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), |
| 5417 | 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), |
| 5418 | 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), |
| 5419 | 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), |
| 5420 | else => try self.genInlineMemset( |
| 5421 | .{ .ptr_stack_offset = stack_offset }, |
| 5422 | .{ .immediate = 0xaa }, |
| 5423 | .{ .immediate = abi_size }, |
| 5424 | ), |
| 5425 | } |
| 5426 | }, |
| 5427 | .compare_flags, |
| 5428 | .immediate, |
| 5429 | .ptr_stack_offset, |
| 5430 | => { |
| 5431 | const reg = try self.copyToTmpRegister(ty, mcv); |
| 5432 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); |
| 5433 | }, |
| 5434 | .register => |reg| { |
| 5435 | switch (abi_size) { |
| 5436 | 1, 2, 4, 8 => { |
| 5437 | assert(std.mem.isAlignedGeneric(u32, stack_offset, abi_size)); |
| 5438 | |
| 5439 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 5440 | 1 => .strb_stack, |
| 5441 | 2 => .strh_stack, |
| 5442 | 4, 8 => .str_stack, |
| 5443 | else => unreachable, // unexpected abi size |
| 5444 | }; |
| 5445 | const rt = self.registerAlias(reg, ty); |
| 5446 | |
| 5447 | _ = try self.addInst(.{ |
| 5448 | .tag = tag, |
| 5449 | .data = .{ .load_store_stack = .{ |
| 5450 | .rt = rt, |
| 5451 | .offset = stack_offset, |
| 5452 | } }, |
| 5453 | }); |
| 5454 | }, |
| 5455 | else => return self.fail("TODO implement storing other types abi_size={}", .{abi_size}), |
| 5456 | } |
| 5457 | }, |
| 5458 | .register_with_overflow => |rwo| { |
| 5459 | const reg_lock = self.register_manager.lockReg(rwo.reg); |
| 5460 | defer if (reg_lock) |locked_reg| self.register_manager.unlockReg(locked_reg); |
| 5461 | |
| 5462 | const wrapped_ty = ty.fieldType(0, zcu); |
| 5463 | try self.genSetStack(wrapped_ty, stack_offset, .{ .register = rwo.reg }); |
| 5464 | |
| 5465 | const overflow_bit_ty = ty.fieldType(1, zcu); |
| 5466 | const overflow_bit_offset = @as(u32, @intCast(ty.structFieldOffset(1, zcu))); |
| 5467 | const raw_cond_reg = try self.register_manager.allocReg(null, gp); |
| 5468 | const cond_reg = self.registerAlias(raw_cond_reg, overflow_bit_ty); |
| 5469 | |
| 5470 | _ = try self.addInst(.{ |
| 5471 | .tag = .cset, |
| 5472 | .data = .{ .r_cond = .{ |
| 5473 | .rd = cond_reg, |
| 5474 | .cond = rwo.flag, |
| 5475 | } }, |
| 5476 | }); |
| 5477 | |
| 5478 | try self.genSetStack(overflow_bit_ty, stack_offset - overflow_bit_offset, .{ |
| 5479 | .register = cond_reg, |
| 5480 | }); |
| 5481 | }, |
| 5482 | .linker_load, |
| 5483 | .memory, |
| 5484 | .stack_argument_offset, |
| 5485 | .stack_offset, |
| 5486 | => { |
| 5487 | switch (mcv) { |
| 5488 | .stack_offset => |off| { |
| 5489 | if (stack_offset == off) |
| 5490 | return; // Copy stack variable to itself; nothing to do. |
| 5491 | }, |
| 5492 | else => {}, |
| 5493 | } |
| 5494 | |
| 5495 | if (abi_size <= 8) { |
| 5496 | const reg = try self.copyToTmpRegister(ty, mcv); |
| 5497 | return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); |
| 5498 | } else { |
| 5499 | const ptr_ty = try pt.singleMutPtrType(ty); |
| 5500 | |
| 5501 | // TODO call extern memcpy |
| 5502 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); |
| 5503 | const regs_locks = self.register_manager.lockRegsAssumeUnused(5, regs); |
| 5504 | defer for (regs_locks) |reg| { |
| 5505 | self.register_manager.unlockReg(reg); |
| 5506 | }; |
| 5507 | |
| 5508 | const src_reg = regs[0]; |
| 5509 | const dst_reg = regs[1]; |
| 5510 | const len_reg = regs[2]; |
| 5511 | const count_reg = regs[3]; |
| 5512 | const tmp_reg = regs[4]; |
| 5513 | |
| 5514 | switch (mcv) { |
| 5515 | .stack_offset => |off| { |
| 5516 | // sub src_reg, fp, #off |
| 5517 | try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); |
| 5518 | }, |
| 5519 | .stack_argument_offset => |off| { |
| 5520 | _ = try self.addInst(.{ |
| 5521 | .tag = .ldr_ptr_stack_argument, |
| 5522 | .data = .{ .load_store_stack = .{ |
| 5523 | .rt = src_reg, |
| 5524 | .offset = off, |
| 5525 | } }, |
| 5526 | }); |
| 5527 | }, |
| 5528 | .memory => |addr| try self.genSetReg(Type.usize, src_reg, .{ .immediate = addr }), |
| 5529 | .linker_load => |load_struct| { |
| 5530 | const tag: Mir.Inst.Tag = switch (load_struct.type) { |
| 5531 | .got => .load_memory_ptr_got, |
| 5532 | .direct => .load_memory_ptr_direct, |
| 5533 | .import => unreachable, |
| 5534 | }; |
| 5535 | const atom_index = switch (self.bin_file.tag) { |
| 5536 | .macho => { |
| 5537 | // const macho_file = self.bin_file.cast(link.File.MachO).?; |
| 5538 | // const atom = try macho_file.getOrCreateAtomForDecl(self.owner_decl); |
| 5539 | // break :blk macho_file.getAtom(atom).getSymbolIndex().?; |
| 5540 | @panic("TODO genSetStack"); |
| 5541 | }, |
| 5542 | .coff => blk: { |
| 5543 | const coff_file = self.bin_file.cast(.coff).?; |
| 5544 | const atom = try coff_file.getOrCreateAtomForNav(self.owner_nav); |
| 5545 | break :blk coff_file.getAtom(atom).getSymbolIndex().?; |
| 5546 | }, |
| 5547 | else => unreachable, // unsupported target format |
| 5548 | }; |
| 5549 | _ = try self.addInst(.{ |
| 5550 | .tag = tag, |
| 5551 | .data = .{ |
| 5552 | .payload = try self.addExtra(Mir.LoadMemoryPie{ |
| 5553 | .register = @intFromEnum(src_reg), |
| 5554 | .atom_index = atom_index, |
| 5555 | .sym_index = load_struct.sym_index, |
| 5556 | }), |
| 5557 | }, |
| 5558 | }); |
| 5559 | }, |
| 5560 | else => unreachable, |
| 5561 | } |
| 5562 | |
| 5563 | // sub dst_reg, fp, #stack_offset |
| 5564 | try self.genSetReg(ptr_ty, dst_reg, .{ .ptr_stack_offset = stack_offset }); |
| 5565 | |
| 5566 | // mov len, #abi_size |
| 5567 | try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); |
| 5568 | |
| 5569 | // memcpy(src, dst, len) |
| 5570 | try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); |
| 5571 | } |
| 5572 | }, |
| 5573 | } |
| 5574 | } |
| 5575 | |
| 5576 | fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void { |
| 5577 | const pt = self.pt; |
| 5578 | const zcu = pt.zcu; |
| 5579 | switch (mcv) { |
| 5580 | .dead => unreachable, |
| 5581 | .unreach, .none => return, // Nothing to do. |
| 5582 | .undef => { |
| 5583 | if (!self.wantSafety()) |
| 5584 | return; // The already existing value will do just fine. |
| 5585 | // Write the debug undefined value. |
| 5586 | switch (reg.size()) { |
| 5587 | 32 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaa }), |
| 5588 | 64 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), |
| 5589 | else => unreachable, // unexpected register size |
| 5590 | } |
| 5591 | }, |
| 5592 | .ptr_stack_offset => |off| { |
| 5593 | _ = try self.addInst(.{ |
| 5594 | .tag = .ldr_ptr_stack, |
| 5595 | .data = .{ .load_store_stack = .{ |
| 5596 | .rt = reg, |
| 5597 | .offset = @intCast(off), |
| 5598 | } }, |
| 5599 | }); |
| 5600 | }, |
| 5601 | .compare_flags => |condition| { |
| 5602 | _ = try self.addInst(.{ |
| 5603 | .tag = .cset, |
| 5604 | .data = .{ .r_cond = .{ |
| 5605 | .rd = reg, |
| 5606 | .cond = condition, |
| 5607 | } }, |
| 5608 | }); |
| 5609 | }, |
| 5610 | .immediate => |x| { |
| 5611 | _ = try self.addInst(.{ |
| 5612 | .tag = .movz, |
| 5613 | .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(x) } }, |
| 5614 | }); |
| 5615 | |
| 5616 | if (x & 0x0000_0000_ffff_0000 != 0) { |
| 5617 | _ = try self.addInst(.{ |
| 5618 | .tag = .movk, |
| 5619 | .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(x >> 16), .hw = 1 } }, |
| 5620 | }); |
| 5621 | } |
| 5622 | |
| 5623 | if (reg.size() == 64) { |
| 5624 | if (x & 0x0000_ffff_0000_0000 != 0) { |
| 5625 | _ = try self.addInst(.{ |
| 5626 | .tag = .movk, |
| 5627 | .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(x >> 32), .hw = 2 } }, |
| 5628 | }); |
| 5629 | } |
| 5630 | if (x & 0xffff_0000_0000_0000 != 0) { |
| 5631 | _ = try self.addInst(.{ |
| 5632 | .tag = .movk, |
| 5633 | .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(x >> 48), .hw = 3 } }, |
| 5634 | }); |
| 5635 | } |
| 5636 | } |
| 5637 | }, |
| 5638 | .register => |src_reg| { |
| 5639 | assert(src_reg.size() == reg.size()); |
| 5640 | |
| 5641 | // If the registers are the same, nothing to do. |
| 5642 | if (src_reg.id() == reg.id()) |
| 5643 | return; |
| 5644 | |
| 5645 | // mov reg, src_reg |
| 5646 | _ = try self.addInst(.{ |
| 5647 | .tag = .mov_register, |
| 5648 | .data = .{ .rr = .{ .rd = reg, .rn = src_reg } }, |
| 5649 | }); |
| 5650 | }, |
| 5651 | .register_with_overflow => unreachable, // doesn't fit into a register |
| 5652 | .linker_load => |load_struct| { |
| 5653 | const tag: Mir.Inst.Tag = switch (load_struct.type) { |
| 5654 | .got => .load_memory_got, |
| 5655 | .direct => .load_memory_direct, |
| 5656 | .import => .load_memory_import, |
| 5657 | }; |
| 5658 | const atom_index = switch (self.bin_file.tag) { |
| 5659 | .macho => { |
| 5660 | @panic("TODO genSetReg"); |
| 5661 | // const macho_file = self.bin_file.cast(link.File.MachO).?; |
| 5662 | // const atom = try macho_file.getOrCreateAtomForDecl(self.owner_decl); |
| 5663 | // break :blk macho_file.getAtom(atom).getSymbolIndex().?; |
| 5664 | }, |
| 5665 | .coff => blk: { |
| 5666 | const coff_file = self.bin_file.cast(.coff).?; |
| 5667 | const atom = try coff_file.getOrCreateAtomForNav(self.owner_nav); |
| 5668 | break :blk coff_file.getAtom(atom).getSymbolIndex().?; |
| 5669 | }, |
| 5670 | else => unreachable, // unsupported target format |
| 5671 | }; |
| 5672 | _ = try self.addInst(.{ |
| 5673 | .tag = tag, |
| 5674 | .data = .{ |
| 5675 | .payload = try self.addExtra(Mir.LoadMemoryPie{ |
| 5676 | .register = @intFromEnum(reg), |
| 5677 | .atom_index = atom_index, |
| 5678 | .sym_index = load_struct.sym_index, |
| 5679 | }), |
| 5680 | }, |
| 5681 | }); |
| 5682 | }, |
| 5683 | .memory => |addr| { |
| 5684 | // The value is in memory at a hard-coded address. |
| 5685 | // If the type is a pointer, it means the pointer address is at this memory location. |
| 5686 | try self.genSetReg(ty, reg.toX(), .{ .immediate = addr }); |
| 5687 | try self.genLdrRegister(reg, reg.toX(), ty); |
| 5688 | }, |
| 5689 | .stack_offset => |off| { |
| 5690 | const abi_size = ty.abiSize(zcu); |
| 5691 | |
| 5692 | switch (abi_size) { |
| 5693 | 1, 2, 4, 8 => { |
| 5694 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 5695 | 1 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsb_stack else .ldrb_stack, |
| 5696 | 2 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsh_stack else .ldrh_stack, |
| 5697 | 4, 8 => .ldr_stack, |
| 5698 | else => unreachable, // unexpected abi size |
| 5699 | }; |
| 5700 | |
| 5701 | _ = try self.addInst(.{ |
| 5702 | .tag = tag, |
| 5703 | .data = .{ .load_store_stack = .{ |
| 5704 | .rt = reg, |
| 5705 | .offset = @intCast(off), |
| 5706 | } }, |
| 5707 | }); |
| 5708 | }, |
| 5709 | 3, 5, 6, 7 => return self.fail("TODO implement genSetReg types size {}", .{abi_size}), |
| 5710 | else => unreachable, |
| 5711 | } |
| 5712 | }, |
| 5713 | .stack_argument_offset => |off| { |
| 5714 | const abi_size = ty.abiSize(zcu); |
| 5715 | |
| 5716 | switch (abi_size) { |
| 5717 | 1, 2, 4, 8 => { |
| 5718 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 5719 | 1 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsb_stack_argument else .ldrb_stack_argument, |
| 5720 | 2 => if (ty.isSignedInt(zcu)) Mir.Inst.Tag.ldrsh_stack_argument else .ldrh_stack_argument, |
| 5721 | 4, 8 => .ldr_stack_argument, |
| 5722 | else => unreachable, // unexpected abi size |
| 5723 | }; |
| 5724 | |
| 5725 | _ = try self.addInst(.{ |
| 5726 | .tag = tag, |
| 5727 | .data = .{ .load_store_stack = .{ |
| 5728 | .rt = reg, |
| 5729 | .offset = @intCast(off), |
| 5730 | } }, |
| 5731 | }); |
| 5732 | }, |
| 5733 | 3, 5, 6, 7 => return self.fail("TODO implement genSetReg types size {}", .{abi_size}), |
| 5734 | else => unreachable, |
| 5735 | } |
| 5736 | }, |
| 5737 | } |
| 5738 | } |
| 5739 | |
| 5740 | fn genSetStackArgument(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { |
| 5741 | const pt = self.pt; |
| 5742 | const zcu = pt.zcu; |
| 5743 | const abi_size = @as(u32, @intCast(ty.abiSize(zcu))); |
| 5744 | switch (mcv) { |
| 5745 | .dead => unreachable, |
| 5746 | .none, .unreach => return, |
| 5747 | .undef => { |
| 5748 | if (!self.wantSafety()) |
| 5749 | return; // The already existing value will do just fine. |
| 5750 | // TODO Upgrade this to a memset call when we have that available. |
| 5751 | switch (ty.abiSize(pt.zcu)) { |
| 5752 | 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), |
| 5753 | 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), |
| 5754 | 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), |
| 5755 | 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), |
| 5756 | else => return self.fail("TODO implement memset", .{}), |
| 5757 | } |
| 5758 | }, |
| 5759 | .register => |reg| { |
| 5760 | switch (abi_size) { |
| 5761 | 1, 2, 4, 8 => { |
| 5762 | const tag: Mir.Inst.Tag = switch (abi_size) { |
| 5763 | 1 => .strb_immediate, |
| 5764 | 2 => .strh_immediate, |
| 5765 | 4, 8 => .str_immediate, |
| 5766 | else => unreachable, // unexpected abi size |
| 5767 | }; |
| 5768 | const rt = self.registerAlias(reg, ty); |
| 5769 | const offset = switch (abi_size) { |
| 5770 | 1 => blk: { |
| 5771 | if (math.cast(u12, stack_offset)) |imm| { |
| 5772 | break :blk Instruction.LoadStoreOffset.imm(imm); |
| 5773 | } else { |
| 5774 | return self.fail("TODO genSetStackArgument byte with larger offset", .{}); |
| 5775 | } |
| 5776 | }, |
| 5777 | 2 => blk: { |
| 5778 | assert(std.mem.isAlignedGeneric(u32, stack_offset, 2)); // misaligned stack entry |
| 5779 | if (math.cast(u12, @divExact(stack_offset, 2))) |imm| { |
| 5780 | break :blk Instruction.LoadStoreOffset.imm(imm); |
| 5781 | } else { |
| 5782 | return self.fail("TODO getSetStackArgument halfword with larger offset", .{}); |
| 5783 | } |
| 5784 | }, |
| 5785 | 4, 8 => blk: { |
| 5786 | const alignment = abi_size; |
| 5787 | assert(std.mem.isAlignedGeneric(u32, stack_offset, alignment)); // misaligned stack entry |
| 5788 | if (math.cast(u12, @divExact(stack_offset, alignment))) |imm| { |
| 5789 | break :blk Instruction.LoadStoreOffset.imm(imm); |
| 5790 | } else { |
| 5791 | return self.fail("TODO genSetStackArgument with larger offset", .{}); |
| 5792 | } |
| 5793 | }, |
| 5794 | else => unreachable, |
| 5795 | }; |
| 5796 | |
| 5797 | _ = try self.addInst(.{ |
| 5798 | .tag = tag, |
| 5799 | .data = .{ .load_store_register_immediate = .{ |
| 5800 | .rt = rt, |
| 5801 | .rn = .sp, |
| 5802 | .offset = offset.immediate, |
| 5803 | } }, |
| 5804 | }); |
| 5805 | }, |
| 5806 | else => return self.fail("TODO genSetStackArgument other types abi_size={}", .{abi_size}), |
| 5807 | } |
| 5808 | }, |
| 5809 | .register_with_overflow => { |
| 5810 | return self.fail("TODO implement genSetStackArgument {}", .{mcv}); |
| 5811 | }, |
| 5812 | .linker_load, |
| 5813 | .memory, |
| 5814 | .stack_argument_offset, |
| 5815 | .stack_offset, |
| 5816 | => { |
| 5817 | if (abi_size <= 4) { |
| 5818 | const reg = try self.copyToTmpRegister(ty, mcv); |
| 5819 | return self.genSetStackArgument(ty, stack_offset, MCValue{ .register = reg }); |
| 5820 | } else { |
| 5821 | const ptr_ty = try pt.singleMutPtrType(ty); |
| 5822 | |
| 5823 | // TODO call extern memcpy |
| 5824 | const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); |
| 5825 | const regs_locks = self.register_manager.lockRegsAssumeUnused(5, regs); |
| 5826 | defer for (regs_locks) |reg| { |
| 5827 | self.register_manager.unlockReg(reg); |
| 5828 | }; |
| 5829 | |
| 5830 | const src_reg = regs[0]; |
| 5831 | const dst_reg = regs[1]; |
| 5832 | const len_reg = regs[2]; |
| 5833 | const count_reg = regs[3]; |
| 5834 | const tmp_reg = regs[4]; |
| 5835 | |
| 5836 | switch (mcv) { |
| 5837 | .stack_offset => |off| { |
| 5838 | // sub src_reg, fp, #off |
| 5839 | try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); |
| 5840 | }, |
| 5841 | .stack_argument_offset => |off| { |
| 5842 | _ = try self.addInst(.{ |
| 5843 | .tag = .ldr_ptr_stack_argument, |
| 5844 | .data = .{ .load_store_stack = .{ |
| 5845 | .rt = src_reg, |
| 5846 | .offset = off, |
| 5847 | } }, |
| 5848 | }); |
| 5849 | }, |
| 5850 | .memory => |addr| try self.genSetReg(ptr_ty, src_reg, .{ .immediate = @as(u32, @intCast(addr)) }), |
| 5851 | .linker_load => |load_struct| { |
| 5852 | const tag: Mir.Inst.Tag = switch (load_struct.type) { |
| 5853 | .got => .load_memory_ptr_got, |
| 5854 | .direct => .load_memory_ptr_direct, |
| 5855 | .import => unreachable, |
| 5856 | }; |
| 5857 | const atom_index = switch (self.bin_file.tag) { |
| 5858 | .macho => { |
| 5859 | @panic("TODO genSetStackArgument"); |
| 5860 | // const macho_file = self.bin_file.cast(link.File.MachO).?; |
| 5861 | // const atom = try macho_file.getOrCreateAtomForDecl(self.owner_decl); |
| 5862 | // break :blk macho_file.getAtom(atom).getSymbolIndex().?; |
| 5863 | }, |
| 5864 | .coff => blk: { |
| 5865 | const coff_file = self.bin_file.cast(.coff).?; |
| 5866 | const atom = try coff_file.getOrCreateAtomForNav(self.owner_nav); |
| 5867 | break :blk coff_file.getAtom(atom).getSymbolIndex().?; |
| 5868 | }, |
| 5869 | else => unreachable, // unsupported target format |
| 5870 | }; |
| 5871 | _ = try self.addInst(.{ |
| 5872 | .tag = tag, |
| 5873 | .data = .{ |
| 5874 | .payload = try self.addExtra(Mir.LoadMemoryPie{ |
| 5875 | .register = @intFromEnum(src_reg), |
| 5876 | .atom_index = atom_index, |
| 5877 | .sym_index = load_struct.sym_index, |
| 5878 | }), |
| 5879 | }, |
| 5880 | }); |
| 5881 | }, |
| 5882 | else => unreachable, |
| 5883 | } |
| 5884 | |
| 5885 | // add dst_reg, sp, #stack_offset |
| 5886 | _ = try self.addInst(.{ |
| 5887 | .tag = .add_immediate, |
| 5888 | .data = .{ .rr_imm12_sh = .{ |
| 5889 | .rd = dst_reg, |
| 5890 | .rn = .sp, |
| 5891 | .imm12 = math.cast(u12, stack_offset) orelse { |
| 5892 | return self.fail("TODO load: set reg to stack offset with all possible offsets", .{}); |
| 5893 | }, |
| 5894 | } }, |
| 5895 | }); |
| 5896 | |
| 5897 | // mov len, #abi_size |
| 5898 | try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); |
| 5899 | |
| 5900 | // memcpy(src, dst, len) |
| 5901 | try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); |
| 5902 | } |
| 5903 | }, |
| 5904 | .compare_flags, |
| 5905 | .immediate, |
| 5906 | .ptr_stack_offset, |
| 5907 | => { |
| 5908 | const reg = try self.copyToTmpRegister(ty, mcv); |
| 5909 | return self.genSetStackArgument(ty, stack_offset, MCValue{ .register = reg }); |
| 5910 | }, |
| 5911 | } |
| 5912 | } |
| 5913 | |
| 5914 | fn airBitCast(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5915 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 5916 | const result = if (self.liveness.isUnused(inst)) .dead else result: { |
| 5917 | const operand = try self.resolveInst(ty_op.operand); |
| 5918 | if (self.reuseOperand(inst, ty_op.operand, 0, operand)) break :result operand; |
| 5919 | |
| 5920 | const operand_lock = switch (operand) { |
| 5921 | .register => |reg| self.register_manager.lockReg(reg), |
| 5922 | .register_with_overflow => |rwo| self.register_manager.lockReg(rwo.reg), |
| 5923 | else => null, |
| 5924 | }; |
| 5925 | defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); |
| 5926 | |
| 5927 | const dest_ty = self.typeOfIndex(inst); |
| 5928 | const dest = try self.allocRegOrMem(dest_ty, true, inst); |
| 5929 | try self.setRegOrMem(dest_ty, dest, operand); |
| 5930 | break :result dest; |
| 5931 | }; |
| 5932 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 5933 | } |
| 5934 | |
| 5935 | fn airArrayToSlice(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5936 | const pt = self.pt; |
| 5937 | const zcu = pt.zcu; |
| 5938 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 5939 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { |
| 5940 | const ptr_ty = self.typeOf(ty_op.operand); |
| 5941 | const ptr = try self.resolveInst(ty_op.operand); |
| 5942 | const array_ty = ptr_ty.childType(zcu); |
| 5943 | const array_len = @as(u32, @intCast(array_ty.arrayLen(zcu))); |
| 5944 | const ptr_bytes = 8; |
| 5945 | const stack_offset = try self.allocMem(ptr_bytes * 2, .@"8", inst); |
| 5946 | try self.genSetStack(ptr_ty, stack_offset, ptr); |
| 5947 | try self.genSetStack(Type.usize, stack_offset - ptr_bytes, .{ .immediate = array_len }); |
| 5948 | break :result MCValue{ .stack_offset = stack_offset }; |
| 5949 | }; |
| 5950 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 5951 | } |
| 5952 | |
| 5953 | fn airFloatFromInt(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5954 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 5955 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFloatFromInt for {}", .{ |
| 5956 | self.target.cpu.arch, |
| 5957 | }); |
| 5958 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 5959 | } |
| 5960 | |
| 5961 | fn airIntFromFloat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5962 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 5963 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airIntFromFloat for {}", .{ |
| 5964 | self.target.cpu.arch, |
| 5965 | }); |
| 5966 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 5967 | } |
| 5968 | |
| 5969 | fn airCmpxchg(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5970 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 5971 | const extra = self.air.extraData(Air.Block, ty_pl.payload); |
| 5972 | _ = extra; |
| 5973 | |
| 5974 | return self.fail("TODO implement airCmpxchg for {}", .{ |
| 5975 | self.target.cpu.arch, |
| 5976 | }); |
| 5977 | } |
| 5978 | |
| 5979 | fn airAtomicRmw(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5980 | _ = inst; |
| 5981 | return self.fail("TODO implement airCmpxchg for {}", .{self.target.cpu.arch}); |
| 5982 | } |
| 5983 | |
| 5984 | fn airAtomicLoad(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 5985 | _ = inst; |
| 5986 | return self.fail("TODO implement airAtomicLoad for {}", .{self.target.cpu.arch}); |
| 5987 | } |
| 5988 | |
| 5989 | fn airAtomicStore(self: *Self, inst: Air.Inst.Index, order: std.builtin.AtomicOrder) InnerError!void { |
| 5990 | _ = inst; |
| 5991 | _ = order; |
| 5992 | return self.fail("TODO implement airAtomicStore for {}", .{self.target.cpu.arch}); |
| 5993 | } |
| 5994 | |
| 5995 | fn airMemset(self: *Self, inst: Air.Inst.Index, safety: bool) InnerError!void { |
| 5996 | _ = inst; |
| 5997 | if (safety) { |
| 5998 | // TODO if the value is undef, write 0xaa bytes to dest |
| 5999 | } else { |
| 6000 | // TODO if the value is undef, don't lower this instruction |
| 6001 | } |
| 6002 | return self.fail("TODO implement airMemset for {}", .{self.target.cpu.arch}); |
| 6003 | } |
| 6004 | |
| 6005 | fn airMemcpy(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6006 | _ = inst; |
| 6007 | return self.fail("TODO implement airMemcpy for {}", .{self.target.cpu.arch}); |
| 6008 | } |
| 6009 | |
| 6010 | fn airMemmove(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6011 | _ = inst; |
| 6012 | return self.fail("TODO implement airMemmove for {}", .{self.target.cpu.arch}); |
| 6013 | } |
| 6014 | |
| 6015 | fn airTagName(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6016 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 6017 | const operand = try self.resolveInst(un_op); |
| 6018 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { |
| 6019 | _ = operand; |
| 6020 | return self.fail("TODO implement airTagName for aarch64", .{}); |
| 6021 | }; |
| 6022 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 6023 | } |
| 6024 | |
| 6025 | fn airErrorName(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6026 | const un_op = self.air.instructions.items(.data)[@intFromEnum(inst)].un_op; |
| 6027 | const operand = try self.resolveInst(un_op); |
| 6028 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { |
| 6029 | _ = operand; |
| 6030 | return self.fail("TODO implement airErrorName for aarch64", .{}); |
| 6031 | }; |
| 6032 | return self.finishAir(inst, result, .{ un_op, .none, .none }); |
| 6033 | } |
| 6034 | |
| 6035 | fn airSplat(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6036 | const ty_op = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_op; |
| 6037 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airSplat for {}", .{self.target.cpu.arch}); |
| 6038 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 6039 | } |
| 6040 | |
| 6041 | fn airSelect(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6042 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 6043 | const extra = self.air.extraData(Air.Bin, pl_op.payload).data; |
| 6044 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airSelect for {}", .{self.target.cpu.arch}); |
| 6045 | return self.finishAir(inst, result, .{ pl_op.operand, extra.lhs, extra.rhs }); |
| 6046 | } |
| 6047 | |
| 6048 | fn airShuffleOne(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6049 | _ = inst; |
| 6050 | return self.fail("TODO implement airShuffleOne for {}", .{self.target.cpu.arch}); |
| 6051 | } |
| 6052 | |
| 6053 | fn airShuffleTwo(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6054 | _ = inst; |
| 6055 | return self.fail("TODO implement airShuffleTwo for {}", .{self.target.cpu.arch}); |
| 6056 | } |
| 6057 | |
| 6058 | fn airReduce(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6059 | const reduce = self.air.instructions.items(.data)[@intFromEnum(inst)].reduce; |
| 6060 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airReduce for aarch64", .{}); |
| 6061 | return self.finishAir(inst, result, .{ reduce.operand, .none, .none }); |
| 6062 | } |
| 6063 | |
| 6064 | fn airAggregateInit(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6065 | const pt = self.pt; |
| 6066 | const zcu = pt.zcu; |
| 6067 | const vector_ty = self.typeOfIndex(inst); |
| 6068 | const len = vector_ty.vectorLen(zcu); |
| 6069 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 6070 | const elements: []const Air.Inst.Ref = @ptrCast(self.air.extra.items[ty_pl.payload..][0..len]); |
| 6071 | const result: MCValue = res: { |
| 6072 | if (self.liveness.isUnused(inst)) break :res MCValue.dead; |
| 6073 | return self.fail("TODO implement airAggregateInit for {}", .{self.target.cpu.arch}); |
| 6074 | }; |
| 6075 | |
| 6076 | if (elements.len <= Air.Liveness.bpi - 1) { |
| 6077 | var buf = [1]Air.Inst.Ref{.none} ** (Air.Liveness.bpi - 1); |
| 6078 | @memcpy(buf[0..elements.len], elements); |
| 6079 | return self.finishAir(inst, result, buf); |
| 6080 | } |
| 6081 | var bt = try self.iterateBigTomb(inst, elements.len); |
| 6082 | for (elements) |elem| { |
| 6083 | bt.feed(elem); |
| 6084 | } |
| 6085 | return bt.finishAir(result); |
| 6086 | } |
| 6087 | |
| 6088 | fn airUnionInit(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6089 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 6090 | const extra = self.air.extraData(Air.UnionInit, ty_pl.payload).data; |
| 6091 | _ = extra; |
| 6092 | return self.fail("TODO implement airUnionInit for aarch64", .{}); |
| 6093 | } |
| 6094 | |
| 6095 | fn airPrefetch(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6096 | const prefetch = self.air.instructions.items(.data)[@intFromEnum(inst)].prefetch; |
| 6097 | return self.finishAir(inst, MCValue.dead, .{ prefetch.ptr, .none, .none }); |
| 6098 | } |
| 6099 | |
| 6100 | fn airMulAdd(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6101 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 6102 | const extra = self.air.extraData(Air.Bin, pl_op.payload).data; |
| 6103 | const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { |
| 6104 | return self.fail("TODO implement airMulAdd for aarch64", .{}); |
| 6105 | }; |
| 6106 | return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, pl_op.operand }); |
| 6107 | } |
| 6108 | |
| 6109 | fn airTry(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6110 | const pt = self.pt; |
| 6111 | const pl_op = self.air.instructions.items(.data)[@intFromEnum(inst)].pl_op; |
| 6112 | const extra = self.air.extraData(Air.Try, pl_op.payload); |
| 6113 | const body: []const Air.Inst.Index = @ptrCast(self.air.extra.items[extra.end..][0..extra.data.body_len]); |
| 6114 | const result: MCValue = result: { |
| 6115 | const error_union_bind: ReadArg.Bind = .{ .inst = pl_op.operand }; |
| 6116 | const error_union_ty = self.typeOf(pl_op.operand); |
| 6117 | const error_union_size = @as(u32, @intCast(error_union_ty.abiSize(pt.zcu))); |
| 6118 | const error_union_align = error_union_ty.abiAlignment(pt.zcu); |
| 6119 | |
| 6120 | // The error union will die in the body. However, we need the |
| 6121 | // error union after the body in order to extract the payload |
| 6122 | // of the error union, so we create a copy of it |
| 6123 | const error_union_copy = try self.allocMem(error_union_size, error_union_align, null); |
| 6124 | try self.genSetStack(error_union_ty, error_union_copy, try error_union_bind.resolveToMcv(self)); |
| 6125 | |
| 6126 | const is_err_result = try self.isErr(error_union_bind, error_union_ty); |
| 6127 | const reloc = try self.condBr(is_err_result); |
| 6128 | |
| 6129 | try self.genBody(body); |
| 6130 | try self.performReloc(reloc); |
| 6131 | |
| 6132 | break :result try self.errUnionPayload(.{ .mcv = .{ .stack_offset = error_union_copy } }, error_union_ty, null); |
| 6133 | }; |
| 6134 | return self.finishAir(inst, result, .{ pl_op.operand, .none, .none }); |
| 6135 | } |
| 6136 | |
| 6137 | fn airTryPtr(self: *Self, inst: Air.Inst.Index) InnerError!void { |
| 6138 | const ty_pl = self.air.instructions.items(.data)[@intFromEnum(inst)].ty_pl; |
| 6139 | const extra = self.air.extraData(Air.TryPtr, ty_pl.payload); |
| 6140 | const body = self.air.extra.items[extra.end..][0..extra.data.body_len]; |
| 6141 | _ = body; |
| 6142 | return self.fail("TODO implement airTryPtr for arm", .{}); |
| 6143 | // return self.finishAir(inst, result, .{ extra.data.ptr, .none, .none }); |
| 6144 | } |
| 6145 | |
| 6146 | fn resolveInst(self: *Self, inst: Air.Inst.Ref) InnerError!MCValue { |
| 6147 | const pt = self.pt; |
| 6148 | const zcu = pt.zcu; |
| 6149 | |
| 6150 | // If the type has no codegen bits, no need to store it. |
| 6151 | const inst_ty = self.typeOf(inst); |
| 6152 | if (!inst_ty.hasRuntimeBitsIgnoreComptime(zcu) and !inst_ty.isError(zcu)) |
| 6153 | return MCValue{ .none = {} }; |
| 6154 | |
| 6155 | const inst_index = inst.toIndex() orelse return self.genTypedValue((try self.air.value(inst, pt)).?); |
| 6156 | |
| 6157 | return self.getResolvedInstValue(inst_index); |
| 6158 | } |
| 6159 | |
| 6160 | fn getResolvedInstValue(self: *Self, inst: Air.Inst.Index) MCValue { |
| 6161 | // Treat each stack item as a "layer" on top of the previous one. |
| 6162 | var i: usize = self.branch_stack.items.len; |
| 6163 | while (true) { |
| 6164 | i -= 1; |
| 6165 | if (self.branch_stack.items[i].inst_table.get(inst)) |mcv| { |
| 6166 | assert(mcv != .dead); |
| 6167 | return mcv; |
| 6168 | } |
| 6169 | } |
| 6170 | } |
| 6171 | |
| 6172 | fn genTypedValue(self: *Self, val: Value) InnerError!MCValue { |
| 6173 | const mcv: MCValue = switch (try codegen.genTypedValue( |
| 6174 | self.bin_file, |
| 6175 | self.pt, |
| 6176 | self.src_loc, |
| 6177 | val, |
| 6178 | self.target, |
| 6179 | )) { |
| 6180 | .mcv => |mcv| switch (mcv) { |
| 6181 | .none => .none, |
| 6182 | .undef => .undef, |
| 6183 | .immediate => |imm| .{ .immediate = imm }, |
| 6184 | .memory => |addr| .{ .memory = addr }, |
| 6185 | .load_got => |sym_index| .{ .linker_load = .{ .type = .got, .sym_index = sym_index } }, |
| 6186 | .load_direct => |sym_index| .{ .linker_load = .{ .type = .direct, .sym_index = sym_index } }, |
| 6187 | .load_symbol, .lea_symbol, .lea_direct => unreachable, // TODO |
| 6188 | }, |
| 6189 | .fail => |msg| return self.failMsg(msg), |
| 6190 | }; |
| 6191 | return mcv; |
| 6192 | } |
| 6193 | |
| 6194 | const CallMCValues = struct { |
| 6195 | args: []MCValue, |
| 6196 | return_value: MCValue, |
| 6197 | stack_byte_count: u32, |
| 6198 | stack_align: u32, |
| 6199 | |
| 6200 | fn deinit(self: *CallMCValues, func: *Self) void { |
| 6201 | func.gpa.free(self.args); |
| 6202 | self.* = undefined; |
| 6203 | } |
| 6204 | }; |
| 6205 | |
| 6206 | /// Caller must call `CallMCValues.deinit`. |
| 6207 | fn resolveCallingConventionValues(self: *Self, fn_ty: Type) !CallMCValues { |
| 6208 | const pt = self.pt; |
| 6209 | const zcu = pt.zcu; |
| 6210 | const ip = &zcu.intern_pool; |
| 6211 | const fn_info = zcu.typeToFunc(fn_ty).?; |
| 6212 | const cc = fn_info.cc; |
| 6213 | var result: CallMCValues = .{ |
| 6214 | .args = try self.gpa.alloc(MCValue, fn_info.param_types.len), |
| 6215 | // These undefined values must be populated before returning from this function. |
| 6216 | .return_value = undefined, |
| 6217 | .stack_byte_count = undefined, |
| 6218 | .stack_align = undefined, |
| 6219 | }; |
| 6220 | errdefer self.gpa.free(result.args); |
| 6221 | |
| 6222 | const ret_ty = fn_ty.fnReturnType(zcu); |
| 6223 | |
| 6224 | switch (cc) { |
| 6225 | .naked => { |
| 6226 | assert(result.args.len == 0); |
| 6227 | result.return_value = .{ .unreach = {} }; |
| 6228 | result.stack_byte_count = 0; |
| 6229 | result.stack_align = 1; |
| 6230 | return result; |
| 6231 | }, |
| 6232 | .aarch64_aapcs, .aarch64_aapcs_darwin, .aarch64_aapcs_win => { |
| 6233 | // ARM64 Procedure Call Standard |
| 6234 | var ncrn: usize = 0; // Next Core Register Number |
| 6235 | var nsaa: u32 = 0; // Next stacked argument address |
| 6236 | |
| 6237 | if (ret_ty.zigTypeTag(zcu) == .noreturn) { |
| 6238 | result.return_value = .{ .unreach = {} }; |
| 6239 | } else if (!ret_ty.hasRuntimeBitsIgnoreComptime(zcu) and !ret_ty.isError(zcu)) { |
| 6240 | result.return_value = .{ .none = {} }; |
| 6241 | } else { |
| 6242 | const ret_ty_size: u32 = @intCast(ret_ty.abiSize(zcu)); |
| 6243 | if (ret_ty_size == 0) { |
| 6244 | assert(ret_ty.isError(zcu)); |
| 6245 | result.return_value = .{ .immediate = 0 }; |
| 6246 | } else if (ret_ty_size <= 8) { |
| 6247 | result.return_value = .{ .register = self.registerAlias(c_abi_int_return_regs[0], ret_ty) }; |
| 6248 | } else { |
| 6249 | return self.fail("TODO support more return types for ARM backend", .{}); |
| 6250 | } |
| 6251 | } |
| 6252 | |
| 6253 | for (fn_info.param_types.get(ip), result.args) |ty, *result_arg| { |
| 6254 | const param_size = @as(u32, @intCast(Type.fromInterned(ty).abiSize(zcu))); |
| 6255 | if (param_size == 0) { |
| 6256 | result_arg.* = .{ .none = {} }; |
| 6257 | continue; |
| 6258 | } |
| 6259 | |
| 6260 | // We round up NCRN only for non-Apple platforms which allow the 16-byte aligned |
| 6261 | // values to spread across odd-numbered registers. |
| 6262 | if (Type.fromInterned(ty).abiAlignment(zcu) == .@"16" and cc != .aarch64_aapcs_darwin) { |
| 6263 | // Round up NCRN to the next even number |
| 6264 | ncrn += ncrn % 2; |
| 6265 | } |
| 6266 | |
| 6267 | if (std.math.divCeil(u32, param_size, 8) catch unreachable <= 8 - ncrn) { |
| 6268 | if (param_size <= 8) { |
| 6269 | result_arg.* = .{ .register = self.registerAlias(c_abi_int_param_regs[ncrn], Type.fromInterned(ty)) }; |
| 6270 | ncrn += 1; |
| 6271 | } else { |
| 6272 | return self.fail("TODO MCValues with multiple registers", .{}); |
| 6273 | } |
| 6274 | } else if (ncrn < 8 and nsaa == 0) { |
| 6275 | return self.fail("TODO MCValues split between registers and stack", .{}); |
| 6276 | } else { |
| 6277 | ncrn = 8; |
| 6278 | // TODO Apple allows the arguments on the stack to be non-8-byte aligned provided |
| 6279 | // that the entire stack space consumed by the arguments is 8-byte aligned. |
| 6280 | if (Type.fromInterned(ty).abiAlignment(zcu) == .@"8") { |
| 6281 | if (nsaa % 8 != 0) { |
| 6282 | nsaa += 8 - (nsaa % 8); |
| 6283 | } |
| 6284 | } |
| 6285 | |
| 6286 | result_arg.* = .{ .stack_argument_offset = nsaa }; |
| 6287 | nsaa += param_size; |
| 6288 | } |
| 6289 | } |
| 6290 | |
| 6291 | result.stack_byte_count = nsaa; |
| 6292 | result.stack_align = 16; |
| 6293 | }, |
| 6294 | .auto => { |
| 6295 | if (ret_ty.zigTypeTag(zcu) == .noreturn) { |
| 6296 | result.return_value = .{ .unreach = {} }; |
| 6297 | } else if (!ret_ty.hasRuntimeBitsIgnoreComptime(zcu) and !ret_ty.isError(zcu)) { |
| 6298 | result.return_value = .{ .none = {} }; |
| 6299 | } else { |
| 6300 | const ret_ty_size = @as(u32, @intCast(ret_ty.abiSize(zcu))); |
| 6301 | if (ret_ty_size == 0) { |
| 6302 | assert(ret_ty.isError(zcu)); |
| 6303 | result.return_value = .{ .immediate = 0 }; |
| 6304 | } else if (ret_ty_size <= 8) { |
| 6305 | result.return_value = .{ .register = self.registerAlias(.x0, ret_ty) }; |
| 6306 | } else { |
| 6307 | // The result is returned by reference, not by |
| 6308 | // value. This means that x0 (or w0 when pointer |
| 6309 | // size is 32 bits) will contain the address of |
| 6310 | // where this function should write the result |
| 6311 | // into. |
| 6312 | result.return_value = .{ .stack_offset = 0 }; |
| 6313 | } |
| 6314 | } |
| 6315 | |
| 6316 | var stack_offset: u32 = 0; |
| 6317 | |
| 6318 | for (fn_info.param_types.get(ip), result.args) |ty, *result_arg| { |
| 6319 | if (Type.fromInterned(ty).abiSize(zcu) > 0) { |
| 6320 | const param_size: u32 = @intCast(Type.fromInterned(ty).abiSize(zcu)); |
| 6321 | const param_alignment = Type.fromInterned(ty).abiAlignment(zcu); |
| 6322 | |
| 6323 | stack_offset = @intCast(param_alignment.forward(stack_offset)); |
| 6324 | result_arg.* = .{ .stack_argument_offset = stack_offset }; |
| 6325 | stack_offset += param_size; |
| 6326 | } else { |
| 6327 | result_arg.* = .{ .none = {} }; |
| 6328 | } |
| 6329 | } |
| 6330 | |
| 6331 | result.stack_byte_count = stack_offset; |
| 6332 | result.stack_align = 16; |
| 6333 | }, |
| 6334 | else => return self.fail("TODO implement function parameters for {} on aarch64", .{cc}), |
| 6335 | } |
| 6336 | |
| 6337 | return result; |
| 6338 | } |
| 6339 | |
| 6340 | /// TODO support scope overrides. Also note this logic is duplicated with `Zcu.wantSafety`. |
| 6341 | fn wantSafety(self: *Self) bool { |
| 6342 | return switch (self.bin_file.comp.root_mod.optimize_mode) { |
| 6343 | .Debug => true, |
| 6344 | .ReleaseSafe => true, |
| 6345 | .ReleaseFast => false, |
| 6346 | .ReleaseSmall => false, |
| 6347 | }; |
| 6348 | } |
| 6349 | |
| 6350 | fn fail(self: *Self, comptime format: []const u8, args: anytype) error{ OutOfMemory, CodegenFail } { |
| 6351 | @branchHint(.cold); |
| 6352 | return self.pt.zcu.codegenFail(self.owner_nav, format, args); |
| 6353 | } |
| 6354 | |
| 6355 | fn failMsg(self: *Self, msg: *ErrorMsg) error{ OutOfMemory, CodegenFail } { |
| 6356 | @branchHint(.cold); |
| 6357 | return self.pt.zcu.codegenFailMsg(self.owner_nav, msg); |
| 6358 | } |
| 6359 | |
| 6360 | fn parseRegName(name: []const u8) ?Register { |
| 6361 | if (@hasDecl(Register, "parseRegName")) { |
| 6362 | return Register.parseRegName(name); |
| 6363 | } |
| 6364 | return std.meta.stringToEnum(Register, name); |
| 6365 | } |
| 6366 | |
| 6367 | fn registerAlias(self: *Self, reg: Register, ty: Type) Register { |
| 6368 | const abi_size = ty.abiSize(self.pt.zcu); |
| 6369 | |
| 6370 | switch (reg.class()) { |
| 6371 | .general_purpose => { |
| 6372 | if (abi_size == 0) { |
| 6373 | unreachable; // should be comptime-known |
| 6374 | } else if (abi_size <= 4) { |
| 6375 | return reg.toW(); |
| 6376 | } else if (abi_size <= 8) { |
| 6377 | return reg.toX(); |
| 6378 | } else unreachable; |
| 6379 | }, |
| 6380 | .stack_pointer => unreachable, // we can't store/load the sp |
| 6381 | .floating_point => { |
| 6382 | return switch (ty.floatBits(self.target)) { |
| 6383 | 16 => reg.toH(), |
| 6384 | 32 => reg.toS(), |
| 6385 | 64 => reg.toD(), |
| 6386 | 128 => reg.toQ(), |
| 6387 | |
| 6388 | 80 => unreachable, // f80 registers don't exist |
| 6389 | else => unreachable, |
| 6390 | }; |
| 6391 | }, |
| 6392 | } |
| 6393 | } |
| 6394 | |
| 6395 | fn typeOf(self: *Self, inst: Air.Inst.Ref) Type { |
| 6396 | return self.air.typeOf(inst, &self.pt.zcu.intern_pool); |
| 6397 | } |
| 6398 | |
| 6399 | fn typeOfIndex(self: *Self, inst: Air.Inst.Index) Type { |
| 6400 | return self.air.typeOfIndex(inst, &self.pt.zcu.intern_pool); |
| 6401 | } |
Andrew Kelley <andrew@ziglang.org> 2025-07-02 14:40:25-07:00
src