const std = @import("std"); const builtin = @import("builtin"); const mem = std.mem; const math = std.math; const assert = std.debug.assert; const codegen = @import("../../codegen.zig"); const Air = @import("../../Air.zig"); const Mir = @import("Mir.zig"); const Emit = @import("Emit.zig"); const Liveness = @import("../../Liveness.zig"); const Type = @import("../../type.zig").Type; const Value = @import("../../value.zig").Value; const TypedValue = @import("../../TypedValue.zig"); const link = @import("../../link.zig"); const Module = @import("../../Module.zig"); const Compilation = @import("../../Compilation.zig"); const ErrorMsg = Module.ErrorMsg; const Target = std.Target; const Allocator = mem.Allocator; const trace = @import("../../tracy.zig").trace; const DW = std.dwarf; const leb128 = std.leb; const log = std.log.scoped(.codegen); const build_options = @import("build_options"); const CodeGenError = codegen.CodeGenError; const Result = codegen.Result; const DebugInfoOutput = codegen.DebugInfoOutput; const bits = @import("bits.zig"); const abi = @import("abi.zig"); const errUnionPayloadOffset = codegen.errUnionPayloadOffset; const errUnionErrorOffset = codegen.errUnionErrorOffset; const RegisterManager = abi.RegisterManager; const RegisterLock = RegisterManager.RegisterLock; const Register = bits.Register; const Instruction = bits.Instruction; const Condition = bits.Instruction.Condition; const callee_preserved_regs = abi.callee_preserved_regs; const c_abi_int_param_regs = abi.c_abi_int_param_regs; const c_abi_int_return_regs = abi.c_abi_int_return_regs; const gp = abi.RegisterClass.gp; const InnerError = CodeGenError || error{OutOfRegisters}; gpa: Allocator, air: Air, liveness: Liveness, bin_file: *link.File, debug_output: DebugInfoOutput, target: *const std.Target, mod_fn: *const Module.Fn, err_msg: ?*ErrorMsg, args: []MCValue, ret_mcv: MCValue, fn_type: Type, arg_index: u32, src_loc: Module.SrcLoc, stack_align: u32, /// MIR Instructions mir_instructions: std.MultiArrayList(Mir.Inst) = .{}, /// MIR extra data mir_extra: std.ArrayListUnmanaged(u32) = .{}, /// Byte offset within the source file of the ending curly. end_di_line: u32, end_di_column: u32, /// The value is an offset into the `Function` `code` from the beginning. /// To perform the reloc, write 32-bit signed little-endian integer /// which is a relative jump, based on the address following the reloc. exitlude_jump_relocs: std.ArrayListUnmanaged(usize) = .{}, /// We postpone the creation of debug info for function args and locals /// until after all Mir instructions have been generated. Only then we /// will know saved_regs_stack_space which is necessary in order to /// calculate the right stack offsest with respect to the `.fp` register. dbg_info_relocs: std.ArrayListUnmanaged(DbgInfoReloc) = .{}, /// Whenever there is a runtime branch, we push a Branch onto this stack, /// and pop it off when the runtime branch joins. This provides an "overlay" /// of the table of mappings from instructions to `MCValue` from within the branch. /// This way we can modify the `MCValue` for an instruction in different ways /// within different branches. Special consideration is needed when a branch /// joins with its parent, to make sure all instructions have the same MCValue /// across each runtime branch upon joining. branch_stack: *std.ArrayList(Branch), // Key is the block instruction blocks: std.AutoHashMapUnmanaged(Air.Inst.Index, BlockData) = .{}, register_manager: RegisterManager = .{}, /// Maps offset to what is stored there. stack: std.AutoHashMapUnmanaged(u32, StackAllocation) = .{}, /// Tracks the current instruction allocated to the compare flags compare_flags_inst: ?Air.Inst.Index = null, /// Offset from the stack base, representing the end of the stack frame. max_end_stack: u32 = 0, /// Represents the current end stack offset. If there is no existing slot /// to place a new stack allocation, it goes here, and then bumps `max_end_stack`. next_stack_offset: u32 = 0, saved_regs_stack_space: u32 = 0, /// Debug field, used to find bugs in the compiler. air_bookkeeping: @TypeOf(air_bookkeeping_init) = air_bookkeeping_init, const air_bookkeeping_init = if (std.debug.runtime_safety) @as(usize, 0) else {}; const MCValue = union(enum) { /// No runtime bits. `void` types, empty structs, u0, enums with 1 /// tag, etc. /// /// TODO Look into deleting this tag and using `dead` instead, /// since every use of MCValue.none should be instead looking at /// the type and noticing it is 0 bits. none, /// Control flow will not allow this value to be observed. unreach, /// No more references to this value remain. dead, /// The value is undefined. undef, /// A pointer-sized integer that fits in a register. /// /// If the type is a pointer, this is the pointer address in /// virtual address space. immediate: u64, /// The value is in a target-specific register. register: Register, /// The value is a tuple { wrapped: u32, overflow: u1 } where /// wrapped is stored in the register and the overflow bit is /// stored in the C (signed) or V (unsigned) flag of the CPSR. /// /// This MCValue is only generated by a add_with_overflow or /// sub_with_overflow instruction operating on 32- or 64-bit values. register_with_overflow: struct { reg: Register, flag: bits.Instruction.Condition }, /// The value is in memory at a hard-coded address. /// /// If the type is a pointer, it means the pointer address is at /// this memory location. memory: u64, /// The value is in memory but requires a linker relocation fixup. linker_load: codegen.LinkerLoad, /// The value is one of the stack variables. /// /// If the type is a pointer, it means the pointer address is in /// the stack at this offset. stack_offset: u32, /// The value is a pointer to one of the stack variables (payload /// is stack offset). ptr_stack_offset: u32, /// The value resides in the N, Z, C, V flags. The value is 1 (if /// the type is u1) or true (if the type in bool) iff the /// specified condition is true. compare_flags: Condition, /// The value is a function argument passed via the stack. stack_argument_offset: u32, }; const DbgInfoReloc = struct { tag: Air.Inst.Tag, ty: Type, name: [:0]const u8, mcv: MCValue, fn genDbgInfo(reloc: DbgInfoReloc, function: Self) !void { switch (reloc.tag) { .arg => try reloc.genArgDbgInfo(function), .dbg_var_ptr, .dbg_var_val, => try reloc.genVarDbgInfo(function), else => unreachable, } } fn genArgDbgInfo(reloc: DbgInfoReloc, function: Self) error{OutOfMemory}!void { switch (function.debug_output) { .dwarf => |dw| { const loc: link.File.Dwarf.DeclState.DbgInfoLoc = switch (reloc.mcv) { .register => |reg| .{ .register = reg.dwarfLocOp() }, .stack_offset, .stack_argument_offset, => |offset| blk: { const adjusted_offset = switch (reloc.mcv) { .stack_offset => -@intCast(i32, offset), .stack_argument_offset => @intCast(i32, function.saved_regs_stack_space + offset), else => unreachable, }; break :blk .{ .stack = .{ .fp_register = Register.x29.dwarfLocOpDeref(), .offset = adjusted_offset, } }; }, else => unreachable, // not a possible argument }; try dw.genArgDbgInfo(reloc.name, reloc.ty, function.mod_fn.owner_decl, loc); }, .plan9 => {}, .none => {}, } } fn genVarDbgInfo(reloc: DbgInfoReloc, function: Self) !void { const is_ptr = switch (reloc.tag) { .dbg_var_ptr => true, .dbg_var_val => false, else => unreachable, }; switch (function.debug_output) { .dwarf => |dw| { const loc: link.File.Dwarf.DeclState.DbgInfoLoc = switch (reloc.mcv) { .register => |reg| .{ .register = reg.dwarfLocOp() }, .ptr_stack_offset, .stack_offset, .stack_argument_offset, => |offset| blk: { const adjusted_offset = switch (reloc.mcv) { .ptr_stack_offset, .stack_offset, => -@intCast(i32, offset), .stack_argument_offset => @intCast(i32, function.saved_regs_stack_space + offset), else => unreachable, }; break :blk .{ .stack = .{ .fp_register = Register.x29.dwarfLocOpDeref(), .offset = adjusted_offset, }, }; }, .memory => |address| .{ .memory = address }, .linker_load => |linker_load| .{ .linker_load = linker_load }, .immediate => |x| .{ .immediate = x }, .undef => .undef, .none => .none, else => blk: { log.debug("TODO generate debug info for {}", .{reloc.mcv}); break :blk .nop; }, }; try dw.genVarDbgInfo(reloc.name, reloc.ty, function.mod_fn.owner_decl, is_ptr, loc); }, .plan9 => {}, .none => {}, } } }; const Branch = struct { inst_table: std.AutoArrayHashMapUnmanaged(Air.Inst.Index, MCValue) = .{}, fn deinit(self: *Branch, gpa: Allocator) void { self.inst_table.deinit(gpa); self.* = undefined; } }; const StackAllocation = struct { inst: Air.Inst.Index, /// TODO do we need size? should be determined by inst.ty.abiSize() size: u32, }; const BlockData = struct { relocs: std.ArrayListUnmanaged(Mir.Inst.Index), /// The first break instruction encounters `null` here and chooses a /// machine code value for the block result, populating this field. /// Following break instructions encounter that value and use it for /// the location to store their block results. mcv: MCValue, }; const BigTomb = struct { function: *Self, inst: Air.Inst.Index, lbt: Liveness.BigTomb, fn feed(bt: *BigTomb, op_ref: Air.Inst.Ref) void { const dies = bt.lbt.feed(); const op_index = Air.refToIndex(op_ref) orelse return; if (!dies) return; bt.function.processDeath(op_index); } fn finishAir(bt: *BigTomb, result: MCValue) void { const is_used = !bt.function.liveness.isUnused(bt.inst); if (is_used) { log.debug("%{d} => {}", .{ bt.inst, result }); const branch = &bt.function.branch_stack.items[bt.function.branch_stack.items.len - 1]; branch.inst_table.putAssumeCapacityNoClobber(bt.inst, result); switch (result) { .register => |reg| { // In some cases (such as bitcast), an operand // may be the same MCValue as the result. If // that operand died and was a register, it // was freed by processDeath. We have to // "re-allocate" the register. if (bt.function.register_manager.isRegFree(reg)) { bt.function.register_manager.getRegAssumeFree(reg, bt.inst); } }, .register_with_overflow => |rwo| { if (bt.function.register_manager.isRegFree(rwo.reg)) { bt.function.register_manager.getRegAssumeFree(rwo.reg, bt.inst); } bt.function.compare_flags_inst = bt.inst; }, .compare_flags => |_| { bt.function.compare_flags_inst = bt.inst; }, else => {}, } } bt.function.finishAirBookkeeping(); } }; const Self = @This(); pub fn generate( bin_file: *link.File, src_loc: Module.SrcLoc, module_fn: *Module.Fn, air: Air, liveness: Liveness, code: *std.ArrayList(u8), debug_output: DebugInfoOutput, ) CodeGenError!Result { if (build_options.skip_non_native and builtin.cpu.arch != bin_file.options.target.cpu.arch) { @panic("Attempted to compile for architecture that was disabled by build configuration"); } const mod = bin_file.options.module.?; const fn_owner_decl = mod.declPtr(module_fn.owner_decl); assert(fn_owner_decl.has_tv); const fn_type = fn_owner_decl.ty; var branch_stack = std.ArrayList(Branch).init(bin_file.allocator); defer { assert(branch_stack.items.len == 1); branch_stack.items[0].deinit(bin_file.allocator); branch_stack.deinit(); } try branch_stack.append(.{}); var function = Self{ .gpa = bin_file.allocator, .air = air, .liveness = liveness, .debug_output = debug_output, .target = &bin_file.options.target, .bin_file = bin_file, .mod_fn = module_fn, .err_msg = null, .args = undefined, // populated after `resolveCallingConventionValues` .ret_mcv = undefined, // populated after `resolveCallingConventionValues` .fn_type = fn_type, .arg_index = 0, .branch_stack = &branch_stack, .src_loc = src_loc, .stack_align = undefined, .end_di_line = module_fn.rbrace_line, .end_di_column = module_fn.rbrace_column, }; defer function.stack.deinit(bin_file.allocator); defer function.blocks.deinit(bin_file.allocator); defer function.exitlude_jump_relocs.deinit(bin_file.allocator); defer function.dbg_info_relocs.deinit(bin_file.allocator); var call_info = function.resolveCallingConventionValues(fn_type) catch |err| switch (err) { error.CodegenFail => return Result{ .fail = function.err_msg.? }, error.OutOfRegisters => return Result{ .fail = try ErrorMsg.create(bin_file.allocator, src_loc, "CodeGen ran out of registers. This is a bug in the Zig compiler.", .{}), }, else => |e| return e, }; defer call_info.deinit(&function); function.args = call_info.args; function.ret_mcv = call_info.return_value; function.stack_align = call_info.stack_align; function.max_end_stack = call_info.stack_byte_count; function.gen() catch |err| switch (err) { error.CodegenFail => return Result{ .fail = function.err_msg.? }, error.OutOfRegisters => return Result{ .fail = try ErrorMsg.create(bin_file.allocator, src_loc, "CodeGen ran out of registers. This is a bug in the Zig compiler.", .{}), }, else => |e| return e, }; for (function.dbg_info_relocs.items) |reloc| { try reloc.genDbgInfo(function); } var mir = Mir{ .instructions = function.mir_instructions.toOwnedSlice(), .extra = try function.mir_extra.toOwnedSlice(bin_file.allocator), }; defer mir.deinit(bin_file.allocator); var emit = Emit{ .mir = mir, .bin_file = bin_file, .debug_output = debug_output, .target = &bin_file.options.target, .src_loc = src_loc, .code = code, .prev_di_pc = 0, .prev_di_line = module_fn.lbrace_line, .prev_di_column = module_fn.lbrace_column, .stack_size = function.max_end_stack, .saved_regs_stack_space = function.saved_regs_stack_space, }; defer emit.deinit(); emit.emitMir() catch |err| switch (err) { error.EmitFail => return Result{ .fail = emit.err_msg.? }, else => |e| return e, }; if (function.err_msg) |em| { return Result{ .fail = em }; } else { return Result.ok; } } fn addInst(self: *Self, inst: Mir.Inst) error{OutOfMemory}!Mir.Inst.Index { const gpa = self.gpa; try self.mir_instructions.ensureUnusedCapacity(gpa, 1); const result_index = @intCast(Air.Inst.Index, self.mir_instructions.len); self.mir_instructions.appendAssumeCapacity(inst); return result_index; } fn addNop(self: *Self) error{OutOfMemory}!Mir.Inst.Index { return try self.addInst(.{ .tag = .nop, .data = .{ .nop = {} }, }); } pub fn addExtra(self: *Self, extra: anytype) Allocator.Error!u32 { const fields = std.meta.fields(@TypeOf(extra)); try self.mir_extra.ensureUnusedCapacity(self.gpa, fields.len); return self.addExtraAssumeCapacity(extra); } pub fn addExtraAssumeCapacity(self: *Self, extra: anytype) u32 { const fields = std.meta.fields(@TypeOf(extra)); const result = @intCast(u32, self.mir_extra.items.len); inline for (fields) |field| { self.mir_extra.appendAssumeCapacity(switch (field.type) { u32 => @field(extra, field.name), i32 => @bitCast(u32, @field(extra, field.name)), else => @compileError("bad field type"), }); } return result; } fn gen(self: *Self) !void { const cc = self.fn_type.fnCallingConvention(); if (cc != .Naked) { // stp fp, lr, [sp, #-16]! _ = try self.addInst(.{ .tag = .stp, .data = .{ .load_store_register_pair = .{ .rt = .x29, .rt2 = .x30, .rn = .sp, .offset = Instruction.LoadStorePairOffset.pre_index(-16), } }, }); // const backpatch_save_registers = try self.addNop(); // mov fp, sp _ = try self.addInst(.{ .tag = .mov_to_from_sp, .data = .{ .rr = .{ .rd = .x29, .rn = .sp } }, }); // sub sp, sp, #reloc const backpatch_reloc = try self.addNop(); if (self.ret_mcv == .stack_offset) { // The address of where to store the return value is in x0 // (or w0 when pointer size is 32 bits). As this register // might get overwritten along the way, save the address // to the stack. const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes = @divExact(ptr_bits, 8); const ret_ptr_reg = self.registerAlias(.x0, Type.usize); const stack_offset = try self.allocMem(ptr_bytes, ptr_bytes, null); try self.genSetStack(Type.usize, stack_offset, MCValue{ .register = ret_ptr_reg }); self.ret_mcv = MCValue{ .stack_offset = stack_offset }; } for (self.args, 0..) |*arg, arg_index| { // Copy register arguments to the stack switch (arg.*) { .register => |reg| { // The first AIR instructions of the main body are guaranteed // to be the functions arguments const inst = self.air.getMainBody()[arg_index]; assert(self.air.instructions.items(.tag)[inst] == .arg); const ty = self.air.typeOfIndex(inst); const abi_size = @intCast(u32, ty.abiSize(self.target.*)); const abi_align = ty.abiAlignment(self.target.*); const stack_offset = try self.allocMem(abi_size, abi_align, inst); try self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); arg.* = MCValue{ .stack_offset = stack_offset }; }, else => {}, } } _ = try self.addInst(.{ .tag = .dbg_prologue_end, .data = .{ .nop = {} }, }); try self.genBody(self.air.getMainBody()); // Backpatch push callee saved regs var saved_regs: u32 = 0; self.saved_regs_stack_space = 16; inline for (callee_preserved_regs) |reg| { if (self.register_manager.isRegAllocated(reg)) { saved_regs |= @as(u32, 1) << @intCast(u5, reg.id()); self.saved_regs_stack_space += 8; } } // Emit.mirPopPushRegs automatically adds extra empty space so // that sp is always aligned to 16 if (!std.mem.isAlignedGeneric(u32, self.saved_regs_stack_space, 16)) { self.saved_regs_stack_space += 8; } assert(std.mem.isAlignedGeneric(u32, self.saved_regs_stack_space, 16)); self.mir_instructions.set(backpatch_save_registers, .{ .tag = .push_regs, .data = .{ .reg_list = saved_regs }, }); // Backpatch stack offset const total_stack_size = self.max_end_stack + self.saved_regs_stack_space; const aligned_total_stack_end = mem.alignForwardGeneric(u32, total_stack_size, self.stack_align); const stack_size = aligned_total_stack_end - self.saved_regs_stack_space; self.max_end_stack = stack_size; if (math.cast(u12, stack_size)) |size| { self.mir_instructions.set(backpatch_reloc, .{ .tag = .sub_immediate, .data = .{ .rr_imm12_sh = .{ .rd = .sp, .rn = .sp, .imm12 = size } }, }); } else { return self.failSymbol("TODO AArch64: allow larger stacks", .{}); } _ = try self.addInst(.{ .tag = .dbg_epilogue_begin, .data = .{ .nop = {} }, }); // exitlude jumps if (self.exitlude_jump_relocs.items.len > 0 and self.exitlude_jump_relocs.items[self.exitlude_jump_relocs.items.len - 1] == self.mir_instructions.len - 2) { // If the last Mir instruction (apart from the // dbg_epilogue_begin) is the last exitlude jump // relocation (which would just jump one instruction // further), it can be safely removed self.mir_instructions.orderedRemove(self.exitlude_jump_relocs.pop()); } for (self.exitlude_jump_relocs.items) |jmp_reloc| { self.mir_instructions.set(jmp_reloc, .{ .tag = .b, .data = .{ .inst = @intCast(u32, self.mir_instructions.len) }, }); } // add sp, sp, #stack_size _ = try self.addInst(.{ .tag = .add_immediate, .data = .{ .rr_imm12_sh = .{ .rd = .sp, .rn = .sp, .imm12 = @intCast(u12, stack_size) } }, }); // _ = try self.addInst(.{ .tag = .pop_regs, .data = .{ .reg_list = saved_regs }, }); // ldp fp, lr, [sp], #16 _ = try self.addInst(.{ .tag = .ldp, .data = .{ .load_store_register_pair = .{ .rt = .x29, .rt2 = .x30, .rn = .sp, .offset = Instruction.LoadStorePairOffset.post_index(16), } }, }); // ret lr _ = try self.addInst(.{ .tag = .ret, .data = .{ .reg = .x30 }, }); } else { _ = try self.addInst(.{ .tag = .dbg_prologue_end, .data = .{ .nop = {} }, }); try self.genBody(self.air.getMainBody()); _ = try self.addInst(.{ .tag = .dbg_epilogue_begin, .data = .{ .nop = {} }, }); } // Drop them off at the rbrace. _ = try self.addInst(.{ .tag = .dbg_line, .data = .{ .dbg_line_column = .{ .line = self.end_di_line, .column = self.end_di_column, } }, }); } fn genBody(self: *Self, body: []const Air.Inst.Index) InnerError!void { const air_tags = self.air.instructions.items(.tag); for (body) |inst| { const old_air_bookkeeping = self.air_bookkeeping; try self.ensureProcessDeathCapacity(Liveness.bpi); switch (air_tags[inst]) { // zig fmt: off .add => try self.airBinOp(inst, .add), .addwrap => try self.airBinOp(inst, .addwrap), .sub => try self.airBinOp(inst, .sub), .subwrap => try self.airBinOp(inst, .subwrap), .mul => try self.airBinOp(inst, .mul), .mulwrap => try self.airBinOp(inst, .mulwrap), .shl => try self.airBinOp(inst, .shl), .shl_exact => try self.airBinOp(inst, .shl_exact), .bool_and => try self.airBinOp(inst, .bool_and), .bool_or => try self.airBinOp(inst, .bool_or), .bit_and => try self.airBinOp(inst, .bit_and), .bit_or => try self.airBinOp(inst, .bit_or), .xor => try self.airBinOp(inst, .xor), .shr => try self.airBinOp(inst, .shr), .shr_exact => try self.airBinOp(inst, .shr_exact), .div_float => try self.airBinOp(inst, .div_float), .div_trunc => try self.airBinOp(inst, .div_trunc), .div_floor => try self.airBinOp(inst, .div_floor), .div_exact => try self.airBinOp(inst, .div_exact), .rem => try self.airBinOp(inst, .rem), .mod => try self.airBinOp(inst, .mod), .ptr_add => try self.airPtrArithmetic(inst, .ptr_add), .ptr_sub => try self.airPtrArithmetic(inst, .ptr_sub), .min => try self.airMinMax(inst), .max => try self.airMinMax(inst), .add_sat => try self.airAddSat(inst), .sub_sat => try self.airSubSat(inst), .mul_sat => try self.airMulSat(inst), .shl_sat => try self.airShlSat(inst), .slice => try self.airSlice(inst), .sqrt, .sin, .cos, .tan, .exp, .exp2, .log, .log2, .log10, .fabs, .floor, .ceil, .round, .trunc_float, .neg, => try self.airUnaryMath(inst), .add_with_overflow => try self.airOverflow(inst), .sub_with_overflow => try self.airOverflow(inst), .mul_with_overflow => try self.airMulWithOverflow(inst), .shl_with_overflow => try self.airShlWithOverflow(inst), .cmp_lt => try self.airCmp(inst, .lt), .cmp_lte => try self.airCmp(inst, .lte), .cmp_eq => try self.airCmp(inst, .eq), .cmp_gte => try self.airCmp(inst, .gte), .cmp_gt => try self.airCmp(inst, .gt), .cmp_neq => try self.airCmp(inst, .neq), .cmp_vector => try self.airCmpVector(inst), .cmp_lt_errors_len => try self.airCmpLtErrorsLen(inst), .alloc => try self.airAlloc(inst), .ret_ptr => try self.airRetPtr(inst), .arg => try self.airArg(inst), .assembly => try self.airAsm(inst), .bitcast => try self.airBitCast(inst), .block => try self.airBlock(inst), .br => try self.airBr(inst), .trap => try self.airTrap(), .breakpoint => try self.airBreakpoint(), .ret_addr => try self.airRetAddr(inst), .frame_addr => try self.airFrameAddress(inst), .fence => try self.airFence(), .cond_br => try self.airCondBr(inst), .dbg_stmt => try self.airDbgStmt(inst), .fptrunc => try self.airFptrunc(inst), .fpext => try self.airFpext(inst), .intcast => try self.airIntCast(inst), .trunc => try self.airTrunc(inst), .bool_to_int => try self.airBoolToInt(inst), .is_non_null => try self.airIsNonNull(inst), .is_non_null_ptr => try self.airIsNonNullPtr(inst), .is_null => try self.airIsNull(inst), .is_null_ptr => try self.airIsNullPtr(inst), .is_non_err => try self.airIsNonErr(inst), .is_non_err_ptr => try self.airIsNonErrPtr(inst), .is_err => try self.airIsErr(inst), .is_err_ptr => try self.airIsErrPtr(inst), .load => try self.airLoad(inst), .loop => try self.airLoop(inst), .not => try self.airNot(inst), .ptrtoint => try self.airPtrToInt(inst), .ret => try self.airRet(inst), .ret_load => try self.airRetLoad(inst), .store => try self.airStore(inst), .struct_field_ptr=> try self.airStructFieldPtr(inst), .struct_field_val=> try self.airStructFieldVal(inst), .array_to_slice => try self.airArrayToSlice(inst), .int_to_float => try self.airIntToFloat(inst), .float_to_int => try self.airFloatToInt(inst), .cmpxchg_strong => try self.airCmpxchg(inst), .cmpxchg_weak => try self.airCmpxchg(inst), .atomic_rmw => try self.airAtomicRmw(inst), .atomic_load => try self.airAtomicLoad(inst), .memcpy => try self.airMemcpy(inst), .memset => try self.airMemset(inst), .set_union_tag => try self.airSetUnionTag(inst), .get_union_tag => try self.airGetUnionTag(inst), .clz => try self.airClz(inst), .ctz => try self.airCtz(inst), .popcount => try self.airPopcount(inst), .byte_swap => try self.airByteSwap(inst), .bit_reverse => try self.airBitReverse(inst), .tag_name => try self.airTagName(inst), .error_name => try self.airErrorName(inst), .splat => try self.airSplat(inst), .select => try self.airSelect(inst), .shuffle => try self.airShuffle(inst), .reduce => try self.airReduce(inst), .aggregate_init => try self.airAggregateInit(inst), .union_init => try self.airUnionInit(inst), .prefetch => try self.airPrefetch(inst), .mul_add => try self.airMulAdd(inst), .addrspace_cast => return self.fail("TODO implement addrspace_cast", .{}), .@"try" => try self.airTry(inst), .try_ptr => try self.airTryPtr(inst), .dbg_var_ptr, .dbg_var_val, => try self.airDbgVar(inst), .dbg_inline_begin, .dbg_inline_end, => try self.airDbgInline(inst), .dbg_block_begin, .dbg_block_end, => try self.airDbgBlock(inst), .call => try self.airCall(inst, .auto), .call_always_tail => try self.airCall(inst, .always_tail), .call_never_tail => try self.airCall(inst, .never_tail), .call_never_inline => try self.airCall(inst, .never_inline), .atomic_store_unordered => try self.airAtomicStore(inst, .Unordered), .atomic_store_monotonic => try self.airAtomicStore(inst, .Monotonic), .atomic_store_release => try self.airAtomicStore(inst, .Release), .atomic_store_seq_cst => try self.airAtomicStore(inst, .SeqCst), .struct_field_ptr_index_0 => try self.airStructFieldPtrIndex(inst, 0), .struct_field_ptr_index_1 => try self.airStructFieldPtrIndex(inst, 1), .struct_field_ptr_index_2 => try self.airStructFieldPtrIndex(inst, 2), .struct_field_ptr_index_3 => try self.airStructFieldPtrIndex(inst, 3), .field_parent_ptr => try self.airFieldParentPtr(inst), .switch_br => try self.airSwitch(inst), .slice_ptr => try self.airSlicePtr(inst), .slice_len => try self.airSliceLen(inst), .ptr_slice_len_ptr => try self.airPtrSliceLenPtr(inst), .ptr_slice_ptr_ptr => try self.airPtrSlicePtrPtr(inst), .array_elem_val => try self.airArrayElemVal(inst), .slice_elem_val => try self.airSliceElemVal(inst), .slice_elem_ptr => try self.airSliceElemPtr(inst), .ptr_elem_val => try self.airPtrElemVal(inst), .ptr_elem_ptr => try self.airPtrElemPtr(inst), .constant => unreachable, // excluded from function bodies .const_ty => unreachable, // excluded from function bodies .unreach => self.finishAirBookkeeping(), .optional_payload => try self.airOptionalPayload(inst), .optional_payload_ptr => try self.airOptionalPayloadPtr(inst), .optional_payload_ptr_set => try self.airOptionalPayloadPtrSet(inst), .unwrap_errunion_err => try self.airUnwrapErrErr(inst), .unwrap_errunion_payload => try self.airUnwrapErrPayload(inst), .unwrap_errunion_err_ptr => try self.airUnwrapErrErrPtr(inst), .unwrap_errunion_payload_ptr=> try self.airUnwrapErrPayloadPtr(inst), .errunion_payload_ptr_set => try self.airErrUnionPayloadPtrSet(inst), .err_return_trace => try self.airErrReturnTrace(inst), .set_err_return_trace => try self.airSetErrReturnTrace(inst), .save_err_return_trace_index=> try self.airSaveErrReturnTraceIndex(inst), .wrap_optional => try self.airWrapOptional(inst), .wrap_errunion_payload => try self.airWrapErrUnionPayload(inst), .wrap_errunion_err => try self.airWrapErrUnionErr(inst), .add_optimized, .addwrap_optimized, .sub_optimized, .subwrap_optimized, .mul_optimized, .mulwrap_optimized, .div_float_optimized, .div_trunc_optimized, .div_floor_optimized, .div_exact_optimized, .rem_optimized, .mod_optimized, .neg_optimized, .cmp_lt_optimized, .cmp_lte_optimized, .cmp_eq_optimized, .cmp_gte_optimized, .cmp_gt_optimized, .cmp_neq_optimized, .cmp_vector_optimized, .reduce_optimized, .float_to_int_optimized, => return self.fail("TODO implement optimized float mode", .{}), .is_named_enum_value => return self.fail("TODO implement is_named_enum_value", .{}), .error_set_has_value => return self.fail("TODO implement error_set_has_value", .{}), .vector_store_elem => return self.fail("TODO implement vector_store_elem", .{}), .c_va_arg => return self.fail("TODO implement c_va_arg", .{}), .c_va_copy => return self.fail("TODO implement c_va_copy", .{}), .c_va_end => return self.fail("TODO implement c_va_end", .{}), .c_va_start => return self.fail("TODO implement c_va_start", .{}), .wasm_memory_size => unreachable, .wasm_memory_grow => unreachable, .work_item_id => unreachable, .work_group_size => unreachable, .work_group_id => unreachable, // zig fmt: on } assert(!self.register_manager.lockedRegsExist()); if (std.debug.runtime_safety) { if (self.air_bookkeeping < old_air_bookkeeping + 1) { 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[inst] }); } } } } /// Asserts there is already capacity to insert into top branch inst_table. fn processDeath(self: *Self, inst: Air.Inst.Index) void { const air_tags = self.air.instructions.items(.tag); if (air_tags[inst] == .constant) return; // Constants are immortal. // When editing this function, note that the logic must synchronize with `reuseOperand`. const prev_value = self.getResolvedInstValue(inst); const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; branch.inst_table.putAssumeCapacity(inst, .dead); switch (prev_value) { .register => |reg| { self.register_manager.freeReg(reg); }, .register_with_overflow => |rwo| { self.register_manager.freeReg(rwo.reg); self.compare_flags_inst = null; }, .compare_flags => { self.compare_flags_inst = null; }, else => {}, // TODO process stack allocation death } } /// Called when there are no operands, and the instruction is always unreferenced. fn finishAirBookkeeping(self: *Self) void { if (std.debug.runtime_safety) { self.air_bookkeeping += 1; } } fn finishAir(self: *Self, inst: Air.Inst.Index, result: MCValue, operands: [Liveness.bpi - 1]Air.Inst.Ref) void { var tomb_bits = self.liveness.getTombBits(inst); for (operands) |op| { const dies = @truncate(u1, tomb_bits) != 0; tomb_bits >>= 1; if (!dies) continue; const op_int = @enumToInt(op); if (op_int < Air.Inst.Ref.typed_value_map.len) continue; const op_index = @intCast(Air.Inst.Index, op_int - Air.Inst.Ref.typed_value_map.len); self.processDeath(op_index); } const is_used = @truncate(u1, tomb_bits) == 0; if (is_used) { log.debug("%{d} => {}", .{ inst, result }); const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; branch.inst_table.putAssumeCapacityNoClobber(inst, result); switch (result) { .register => |reg| { // In some cases (such as bitcast), an operand // may be the same MCValue as the result. If // that operand died and was a register, it // was freed by processDeath. We have to // "re-allocate" the register. if (self.register_manager.isRegFree(reg)) { self.register_manager.getRegAssumeFree(reg, inst); } }, .register_with_overflow => |rwo| { if (self.register_manager.isRegFree(rwo.reg)) { self.register_manager.getRegAssumeFree(rwo.reg, inst); } self.compare_flags_inst = inst; }, .compare_flags => |_| { self.compare_flags_inst = inst; }, else => {}, } } self.finishAirBookkeeping(); } fn ensureProcessDeathCapacity(self: *Self, additional_count: usize) !void { const table = &self.branch_stack.items[self.branch_stack.items.len - 1].inst_table; try table.ensureUnusedCapacity(self.gpa, additional_count); } fn allocMem( self: *Self, abi_size: u32, abi_align: u32, maybe_inst: ?Air.Inst.Index, ) !u32 { assert(abi_size > 0); assert(abi_align > 0); // In order to efficiently load and store stack items that fit // into registers, we bump up the alignment to the next power of // two. const adjusted_align = if (abi_size > 8) abi_align else std.math.ceilPowerOfTwoAssert(u32, abi_size); // TODO find a free slot instead of always appending const offset = mem.alignForwardGeneric(u32, self.next_stack_offset, adjusted_align) + abi_size; self.next_stack_offset = offset; self.max_end_stack = @max(self.max_end_stack, self.next_stack_offset); if (maybe_inst) |inst| { try self.stack.putNoClobber(self.gpa, offset, .{ .inst = inst, .size = abi_size, }); } return offset; } /// Use a pointer instruction as the basis for allocating stack memory. fn allocMemPtr(self: *Self, inst: Air.Inst.Index) !u32 { const elem_ty = self.air.typeOfIndex(inst).elemType(); if (!elem_ty.hasRuntimeBits()) { // return the stack offset 0. Stack offset 0 will be where all // zero-sized stack allocations live as non-zero-sized // allocations will always have an offset > 0. return @as(u32, 0); } const abi_size = math.cast(u32, elem_ty.abiSize(self.target.*)) orelse { const mod = self.bin_file.options.module.?; return self.fail("type '{}' too big to fit into stack frame", .{elem_ty.fmt(mod)}); }; // TODO swap this for inst.ty.ptrAlign const abi_align = elem_ty.abiAlignment(self.target.*); return self.allocMem(abi_size, abi_align, inst); } fn allocRegOrMem(self: *Self, elem_ty: Type, reg_ok: bool, maybe_inst: ?Air.Inst.Index) !MCValue { const abi_size = math.cast(u32, elem_ty.abiSize(self.target.*)) orelse { const mod = self.bin_file.options.module.?; return self.fail("type '{}' too big to fit into stack frame", .{elem_ty.fmt(mod)}); }; const abi_align = elem_ty.abiAlignment(self.target.*); if (reg_ok) { // Make sure the type can fit in a register before we try to allocate one. if (abi_size <= 8) { if (self.register_manager.tryAllocReg(maybe_inst, gp)) |reg| { return MCValue{ .register = self.registerAlias(reg, elem_ty) }; } } } const stack_offset = try self.allocMem(abi_size, abi_align, maybe_inst); return MCValue{ .stack_offset = stack_offset }; } pub fn spillInstruction(self: *Self, reg: Register, inst: Air.Inst.Index) !void { const stack_mcv = try self.allocRegOrMem(self.air.typeOfIndex(inst), false, inst); log.debug("spilling {d} to stack mcv {any}", .{ inst, stack_mcv }); const reg_mcv = self.getResolvedInstValue(inst); switch (reg_mcv) { .register => |r| assert(reg.id() == r.id()), .register_with_overflow => |rwo| assert(rwo.reg.id() == reg.id()), else => unreachable, // not a register } const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; try branch.inst_table.put(self.gpa, inst, stack_mcv); try self.genSetStack(self.air.typeOfIndex(inst), stack_mcv.stack_offset, reg_mcv); } /// Save the current instruction stored in the compare flags if /// occupied fn spillCompareFlagsIfOccupied(self: *Self) !void { if (self.compare_flags_inst) |inst_to_save| { const ty = self.air.typeOfIndex(inst_to_save); const mcv = self.getResolvedInstValue(inst_to_save); const new_mcv = switch (mcv) { .compare_flags => try self.allocRegOrMem(ty, true, inst_to_save), .register_with_overflow => try self.allocRegOrMem(ty, false, inst_to_save), else => unreachable, // mcv doesn't occupy the compare flags }; try self.setRegOrMem(self.air.typeOfIndex(inst_to_save), new_mcv, mcv); log.debug("spilling {d} to mcv {any}", .{ inst_to_save, new_mcv }); const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; try branch.inst_table.put(self.gpa, inst_to_save, new_mcv); self.compare_flags_inst = null; // TODO consolidate with register manager and spillInstruction // this call should really belong in the register manager! switch (mcv) { .register_with_overflow => |rwo| self.register_manager.freeReg(rwo.reg), else => {}, } } } /// Copies a value to a register without tracking the register. The register is not considered /// allocated. A second call to `copyToTmpRegister` may return the same register. /// This can have a side effect of spilling instructions to the stack to free up a register. fn copyToTmpRegister(self: *Self, ty: Type, mcv: MCValue) !Register { const raw_reg = try self.register_manager.allocReg(null, gp); const reg = self.registerAlias(raw_reg, ty); try self.genSetReg(ty, reg, mcv); return reg; } /// Allocates a new register and copies `mcv` into it. /// `reg_owner` is the instruction that gets associated with the register in the register table. /// This can have a side effect of spilling instructions to the stack to free up a register. fn copyToNewRegister(self: *Self, reg_owner: Air.Inst.Index, mcv: MCValue) !MCValue { const raw_reg = try self.register_manager.allocReg(reg_owner, gp); const ty = self.air.typeOfIndex(reg_owner); const reg = self.registerAlias(raw_reg, ty); try self.genSetReg(self.air.typeOfIndex(reg_owner), reg, mcv); return MCValue{ .register = reg }; } fn airAlloc(self: *Self, inst: Air.Inst.Index) !void { const stack_offset = try self.allocMemPtr(inst); return self.finishAir(inst, .{ .ptr_stack_offset = stack_offset }, .{ .none, .none, .none }); } fn airRetPtr(self: *Self, inst: Air.Inst.Index) !void { const result: MCValue = switch (self.ret_mcv) { .none, .register => .{ .ptr_stack_offset = try self.allocMemPtr(inst) }, .stack_offset => blk: { // self.ret_mcv is an address to where this function // should store its result into const ret_ty = self.fn_type.fnReturnType(); var ptr_ty_payload: Type.Payload.ElemType = .{ .base = .{ .tag = .single_mut_pointer }, .data = ret_ty, }; const ptr_ty = Type.initPayload(&ptr_ty_payload.base); // addr_reg will contain the address of where to store the // result into const addr_reg = try self.copyToTmpRegister(ptr_ty, self.ret_mcv); break :blk .{ .register = addr_reg }; }, else => unreachable, // invalid return result }; return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airFptrunc(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFptrunc for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airFpext(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFpext for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airIntCast(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; if (self.liveness.isUnused(inst)) return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); const operand = ty_op.operand; const operand_mcv = try self.resolveInst(operand); const operand_ty = self.air.typeOf(operand); const operand_info = operand_ty.intInfo(self.target.*); const dest_ty = self.air.typeOfIndex(inst); const dest_info = dest_ty.intInfo(self.target.*); const result: MCValue = result: { const operand_lock: ?RegisterLock = switch (operand_mcv) { .register => |reg| self.register_manager.lockRegAssumeUnused(reg), else => null, }; defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); const truncated: MCValue = switch (operand_mcv) { .register => |r| MCValue{ .register = self.registerAlias(r, dest_ty) }, else => operand_mcv, }; if (dest_info.bits > operand_info.bits) { const dest_mcv = try self.allocRegOrMem(dest_ty, true, inst); try self.setRegOrMem(self.air.typeOfIndex(inst), dest_mcv, truncated); break :result dest_mcv; } else { if (self.reuseOperand(inst, operand, 0, truncated)) { break :result truncated; } else { const dest_mcv = try self.allocRegOrMem(dest_ty, true, inst); try self.setRegOrMem(self.air.typeOfIndex(inst), dest_mcv, truncated); break :result dest_mcv; } } }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn truncRegister( self: *Self, operand_reg: Register, dest_reg: Register, int_signedness: std.builtin.Signedness, int_bits: u16, ) !void { switch (int_bits) { 1...31, 33...63 => { _ = try self.addInst(.{ .tag = switch (int_signedness) { .signed => .sbfx, .unsigned => .ubfx, }, .data = .{ .rr_lsb_width = .{ .rd = dest_reg, .rn = operand_reg, .lsb = 0, .width = @intCast(u6, int_bits), } }, }); }, 32, 64 => { _ = try self.addInst(.{ .tag = .mov_register, .data = .{ .rr = .{ .rd = if (int_bits == 32) dest_reg.toW() else dest_reg.toX(), .rn = if (int_bits == 32) operand_reg.toW() else operand_reg.toX(), } }, }); }, else => unreachable, } } fn trunc( self: *Self, maybe_inst: ?Air.Inst.Index, operand: MCValue, operand_ty: Type, dest_ty: Type, ) !MCValue { const info_a = operand_ty.intInfo(self.target.*); const info_b = dest_ty.intInfo(self.target.*); if (info_b.bits <= 64) { const operand_reg = switch (operand) { .register => |r| r, else => operand_reg: { if (info_a.bits <= 64) { const raw_reg = try self.copyToTmpRegister(operand_ty, operand); break :operand_reg self.registerAlias(raw_reg, operand_ty); } else { return self.fail("TODO load least significant word into register", .{}); } }, }; const lock = self.register_manager.lockReg(operand_reg); defer if (lock) |reg| self.register_manager.unlockReg(reg); const dest_reg = if (maybe_inst) |inst| blk: { const ty_op = self.air.instructions.items(.data)[inst].ty_op; if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { break :blk self.registerAlias(operand_reg, dest_ty); } else { const raw_reg = try self.register_manager.allocReg(inst, gp); break :blk self.registerAlias(raw_reg, dest_ty); } } else blk: { const raw_reg = try self.register_manager.allocReg(null, gp); break :blk self.registerAlias(raw_reg, dest_ty); }; try self.truncRegister(operand_reg, dest_reg, info_b.signedness, info_b.bits); return MCValue{ .register = dest_reg }; } else { return self.fail("TODO: truncate to ints > 64 bits", .{}); } } fn airTrunc(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const operand = try self.resolveInst(ty_op.operand); const operand_ty = self.air.typeOf(ty_op.operand); const dest_ty = self.air.typeOfIndex(inst); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else blk: { break :blk try self.trunc(inst, operand, operand_ty, dest_ty); }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airBoolToInt(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const operand = try self.resolveInst(un_op); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else operand; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airNot(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand = try self.resolveInst(ty_op.operand); const operand_ty = self.air.typeOf(ty_op.operand); switch (operand) { .dead => unreachable, .unreach => unreachable, .compare_flags => |cond| break :result MCValue{ .compare_flags = cond.negate() }, else => { switch (operand_ty.zigTypeTag()) { .Bool => { // TODO convert this to mvn + and const op_reg = switch (operand) { .register => |r| r, else => try self.copyToTmpRegister(operand_ty, operand), }; const reg_lock = self.register_manager.lockRegAssumeUnused(op_reg); defer self.register_manager.unlockReg(reg_lock); const dest_reg = blk: { if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { break :blk op_reg; } const raw_reg = try self.register_manager.allocReg(null, gp); break :blk self.registerAlias(raw_reg, operand_ty); }; _ = try self.addInst(.{ .tag = .eor_immediate, .data = .{ .rr_bitmask = .{ .rd = dest_reg, .rn = op_reg, .imms = 0b000000, .immr = 0b000000, .n = 0b0, } }, }); break :result MCValue{ .register = dest_reg }; }, .Vector => return self.fail("TODO bitwise not for vectors", .{}), .Int => { const int_info = operand_ty.intInfo(self.target.*); if (int_info.bits <= 64) { const op_reg = switch (operand) { .register => |r| r, else => try self.copyToTmpRegister(operand_ty, operand), }; const reg_lock = self.register_manager.lockRegAssumeUnused(op_reg); defer self.register_manager.unlockReg(reg_lock); const dest_reg = blk: { if (operand == .register and self.reuseOperand(inst, ty_op.operand, 0, operand)) { break :blk op_reg; } const raw_reg = try self.register_manager.allocReg(null, gp); break :blk self.registerAlias(raw_reg, operand_ty); }; _ = try self.addInst(.{ .tag = .mvn, .data = .{ .rr_imm6_logical_shift = .{ .rd = dest_reg, .rm = op_reg, .imm6 = 0, .shift = .lsl, } }, }); try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); break :result MCValue{ .register = dest_reg }; } else { return self.fail("TODO AArch64 not on integers > u64/i64", .{}); } }, else => unreachable, } }, } }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn minMax( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) !MCValue { switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO ARM min/max on floats", .{}), .Vector => return self.fail("TODO ARM min/max on vectors", .{}), .Int => { const mod = self.bin_file.options.module.?; assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; var dest_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, }; try self.allocRegs( &read_args, &write_args, if (maybe_inst) |inst| .{ .corresponding_inst = inst, .operand_mapping = &.{ 0, 1 }, } else null, ); // lhs == reg should have been checked by airMinMax assert(lhs_reg != rhs_reg); // see note above _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = lhs_reg, .rm = rhs_reg, .imm6 = 0, .shift = .lsl, } }, }); const cond_choose_lhs: Condition = switch (tag) { .max => switch (int_info.signedness) { .signed => Condition.gt, .unsigned => Condition.hi, }, .min => switch (int_info.signedness) { .signed => Condition.lt, .unsigned => Condition.cc, }, else => unreachable, }; _ = try self.addInst(.{ .tag = .csel, .data = .{ .rrr_cond = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, .cond = cond_choose_lhs, } }, }); return MCValue{ .register = dest_reg }; } else { return self.fail("TODO ARM min/max on integers > u32/i32", .{}); } }, else => unreachable, } } fn airMinMax(self: *Self, inst: Air.Inst.Index) !void { const tag = self.air.instructions.items(.tag)[inst]; const bin_op = self.air.instructions.items(.data)[inst].bin_op; const lhs_ty = self.air.typeOf(bin_op.lhs); const rhs_ty = self.air.typeOf(bin_op.rhs); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; const lhs = try self.resolveInst(bin_op.lhs); if (bin_op.lhs == bin_op.rhs) break :result lhs; break :result try self.minMax(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst); }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airSlice(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const bin_op = self.air.extraData(Air.Bin, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const ptr = try self.resolveInst(bin_op.lhs); const ptr_ty = self.air.typeOf(bin_op.lhs); const len = try self.resolveInst(bin_op.rhs); const len_ty = self.air.typeOf(bin_op.rhs); const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes = @divExact(ptr_bits, 8); const stack_offset = try self.allocMem(ptr_bytes * 2, ptr_bytes * 2, inst); try self.genSetStack(ptr_ty, stack_offset, ptr); try self.genSetStack(len_ty, stack_offset - ptr_bytes, len); break :result MCValue{ .stack_offset = stack_offset }; }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } /// An argument to a Mir instruction which is read (and possibly also /// written to) by the respective instruction const ReadArg = struct { ty: Type, bind: Bind, class: RegisterManager.RegisterBitSet, reg: *Register, const Bind = union(enum) { inst: Air.Inst.Ref, mcv: MCValue, fn resolveToMcv(bind: Bind, function: *Self) InnerError!MCValue { return switch (bind) { .inst => |inst| try function.resolveInst(inst), .mcv => |mcv| mcv, }; } fn resolveToImmediate(bind: Bind, function: *Self) InnerError!?u64 { switch (bind) { .inst => |inst| { // TODO resolve independently of inst_table const mcv = try function.resolveInst(inst); switch (mcv) { .immediate => |imm| return imm, else => return null, } }, .mcv => |mcv| { switch (mcv) { .immediate => |imm| return imm, else => return null, } }, } } }; }; /// An argument to a Mir instruction which is written to (but not read /// from) by the respective instruction const WriteArg = struct { ty: Type, bind: Bind, class: RegisterManager.RegisterBitSet, reg: *Register, const Bind = union(enum) { reg: Register, none: void, }; }; /// Holds all data necessary for enabling the potential reuse of /// operand registers as destinations const ReuseMetadata = struct { corresponding_inst: Air.Inst.Index, /// Maps every element index of read_args to the corresponding /// index in the Air instruction /// /// When the order of read_args corresponds exactly to the order /// of the inputs of the Air instruction, this would be e.g. /// &.{ 0, 1 }. However, when the order is not the same or some /// inputs to the Air instruction are omitted (e.g. when they can /// be represented as immediates to the Mir instruction), /// operand_mapping should reflect that fact. operand_mapping: []const Liveness.OperandInt, }; /// Allocate a set of registers for use as arguments for a Mir /// instruction /// /// If the Mir instruction these registers are allocated for /// corresponds exactly to a single Air instruction, populate /// reuse_metadata in order to enable potential reuse of an operand as /// the destination (provided that that operand dies in this /// instruction). /// /// Reusing an operand register as destination is the only time two /// arguments may share the same register. In all other cases, /// allocRegs guarantees that a register will never be allocated to /// more than one argument. /// /// Furthermore, allocReg guarantees that all arguments which are /// already bound to registers before calling allocRegs will not /// change their register binding. This is done by locking these /// registers. fn allocRegs( self: *Self, read_args: []const ReadArg, write_args: []const WriteArg, reuse_metadata: ?ReuseMetadata, ) InnerError!void { // Air instructions have exactly one output assert(!(reuse_metadata != null and write_args.len != 1)); // see note above // The operand mapping is a 1:1 mapping of read args to their // corresponding operand index in the Air instruction assert(!(reuse_metadata != null and reuse_metadata.?.operand_mapping.len != read_args.len)); // see note above const locks = try self.gpa.alloc(?RegisterLock, read_args.len + write_args.len); defer self.gpa.free(locks); const read_locks = locks[0..read_args.len]; const write_locks = locks[read_args.len..]; std.mem.set(?RegisterLock, locks, null); defer for (locks) |lock| { if (lock) |locked_reg| self.register_manager.unlockReg(locked_reg); }; // When we reuse a read_arg as a destination, the corresponding // MCValue of the read_arg will be set to .dead. In that case, we // skip allocating this read_arg. var reused_read_arg: ?usize = null; // Lock all args which are already allocated to registers for (read_args, 0..) |arg, i| { const mcv = try arg.bind.resolveToMcv(self); if (mcv == .register) { read_locks[i] = self.register_manager.lockReg(mcv.register); } } for (write_args, 0..) |arg, i| { if (arg.bind == .reg) { write_locks[i] = self.register_manager.lockReg(arg.bind.reg); } } // Allocate registers for all args which aren't allocated to // registers yet for (read_args, 0..) |arg, i| { const mcv = try arg.bind.resolveToMcv(self); if (mcv == .register) { const raw_reg = mcv.register; arg.reg.* = self.registerAlias(raw_reg, arg.ty); } else { const track_inst: ?Air.Inst.Index = switch (arg.bind) { .inst => |inst| Air.refToIndex(inst).?, else => null, }; const raw_reg = try self.register_manager.allocReg(track_inst, gp); arg.reg.* = self.registerAlias(raw_reg, arg.ty); read_locks[i] = self.register_manager.lockRegAssumeUnused(arg.reg.*); } } if (reuse_metadata != null) { const inst = reuse_metadata.?.corresponding_inst; const operand_mapping = reuse_metadata.?.operand_mapping; const arg = write_args[0]; if (arg.bind == .reg) { const raw_reg = arg.bind.reg; arg.reg.* = self.registerAlias(raw_reg, arg.ty); } else { reuse_operand: for (read_args, 0..) |read_arg, i| { if (read_arg.bind == .inst) { const operand = read_arg.bind.inst; const mcv = try self.resolveInst(operand); if (mcv == .register and std.meta.eql(arg.class, read_arg.class) and self.reuseOperand(inst, operand, operand_mapping[i], mcv)) { const raw_reg = mcv.register; arg.reg.* = self.registerAlias(raw_reg, arg.ty); write_locks[0] = null; reused_read_arg = i; break :reuse_operand; } } } else { const raw_reg = try self.register_manager.allocReg(inst, arg.class); arg.reg.* = self.registerAlias(raw_reg, arg.ty); write_locks[0] = self.register_manager.lockReg(arg.reg.*); } } } else { for (write_args, 0..) |arg, i| { if (arg.bind == .reg) { const raw_reg = arg.bind.reg; arg.reg.* = self.registerAlias(raw_reg, arg.ty); } else { const raw_reg = try self.register_manager.allocReg(null, arg.class); arg.reg.* = self.registerAlias(raw_reg, arg.ty); write_locks[i] = self.register_manager.lockReg(arg.reg.*); } } } // For all read_args which need to be moved from non-register to // register, perform the move for (read_args, 0..) |arg, i| { if (reused_read_arg) |j| { // Check whether this read_arg was reused if (i == j) continue; } const mcv = try arg.bind.resolveToMcv(self); if (mcv != .register) { if (arg.bind == .inst) { const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; const inst = Air.refToIndex(arg.bind.inst).?; // Overwrite the MCValue associated with this inst branch.inst_table.putAssumeCapacity(inst, .{ .register = arg.reg.* }); // If the previous MCValue occupied some space we track, we // need to make sure it is marked as free now. switch (mcv) { .compare_flags => { assert(self.compare_flags_inst.? == inst); self.compare_flags_inst = null; }, .register => |prev_reg| { assert(!self.register_manager.isRegFree(prev_reg)); self.register_manager.freeReg(prev_reg); }, else => {}, } } try self.genSetReg(arg.ty, arg.reg.*, mcv); } } } /// Wrapper around allocRegs and addInst tailored for specific Mir /// instructions which are binary operations acting on two registers /// /// Returns the destination register fn binOpRegister( self: *Self, mir_tag: Mir.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) !MCValue { var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; var dest_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, }; try self.allocRegs( &read_args, &write_args, if (maybe_inst) |inst| .{ .corresponding_inst = inst, .operand_mapping = &.{ 0, 1 }, } else null, ); const mir_data: Mir.Inst.Data = switch (mir_tag) { .add_shifted_register, .adds_shifted_register, .sub_shifted_register, .subs_shifted_register, => .{ .rrr_imm6_shift = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, .imm6 = 0, .shift = .lsl, } }, .mul, .lsl_register, .asr_register, .lsr_register, .sdiv, .udiv, => .{ .rrr = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, } }, .smull, .umull, => .{ .rrr = .{ .rd = dest_reg.toX(), .rn = lhs_reg, .rm = rhs_reg, } }, .and_shifted_register, .orr_shifted_register, .eor_shifted_register, => .{ .rrr_imm6_logical_shift = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, .imm6 = 0, .shift = .lsl, } }, else => unreachable, }; _ = try self.addInst(.{ .tag = mir_tag, .data = mir_data, }); return MCValue{ .register = dest_reg }; } /// Wrapper around allocRegs and addInst tailored for specific Mir /// instructions which are binary operations acting on a register and /// an immediate /// /// Returns the destination register fn binOpImmediate( self: *Self, mir_tag: Mir.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_immediate: u64, lhs_ty: Type, lhs_and_rhs_swapped: bool, maybe_inst: ?Air.Inst.Index, ) !MCValue { var lhs_reg: Register = undefined; var dest_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, }; const operand_mapping: []const Liveness.OperandInt = if (lhs_and_rhs_swapped) &.{1} else &.{0}; try self.allocRegs( &read_args, &write_args, if (maybe_inst) |inst| .{ .corresponding_inst = inst, .operand_mapping = operand_mapping, } else null, ); const mir_data: Mir.Inst.Data = switch (mir_tag) { .add_immediate, .adds_immediate, .sub_immediate, .subs_immediate, => .{ .rr_imm12_sh = .{ .rd = dest_reg, .rn = lhs_reg, .imm12 = @intCast(u12, rhs_immediate), } }, .lsl_immediate, .asr_immediate, .lsr_immediate, => .{ .rr_shift = .{ .rd = dest_reg, .rn = lhs_reg, .shift = @intCast(u6, rhs_immediate), } }, else => unreachable, }; _ = try self.addInst(.{ .tag = mir_tag, .data = mir_data, }); return MCValue{ .register = dest_reg }; } fn addSub( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO binary operations on floats", .{}), .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { const lhs_immediate = try lhs_bind.resolveToImmediate(self); const rhs_immediate = try rhs_bind.resolveToImmediate(self); // Only say yes if the operation is // commutative, i.e. we can swap both of the // operands const lhs_immediate_ok = switch (tag) { .add => if (lhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, .sub => false, else => unreachable, }; const rhs_immediate_ok = switch (tag) { .add, .sub, => if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, else => unreachable, }; const mir_tag_register: Mir.Inst.Tag = switch (tag) { .add => .add_shifted_register, .sub => .sub_shifted_register, else => unreachable, }; const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { .add => .add_immediate, .sub => .sub_immediate, else => unreachable, }; if (rhs_immediate_ok) { return try self.binOpImmediate(mir_tag_immediate, lhs_bind, rhs_immediate.?, lhs_ty, false, maybe_inst); } else if (lhs_immediate_ok) { // swap lhs and rhs return try self.binOpImmediate(mir_tag_immediate, rhs_bind, lhs_immediate.?, rhs_ty, true, maybe_inst); } else { return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); } } else { return self.fail("TODO binary operations on int with bits > 64", .{}); } }, else => unreachable, } } fn mul( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { // TODO add optimisations for multiplication // with immediates, for example a * 2 can be // lowered to a << 1 return try self.binOpRegister(.mul, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); } else { return self.fail("TODO binary operations on int with bits > 64", .{}); } }, else => unreachable, } } fn divFloat( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { _ = lhs_bind; _ = rhs_bind; _ = rhs_ty; _ = maybe_inst; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO div_float", .{}), .Vector => return self.fail("TODO div_float on vectors", .{}), else => unreachable, } } fn divTrunc( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO div on floats", .{}), .Vector => return self.fail("TODO div on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { switch (int_info.signedness) { .signed => { // TODO optimize integer division by constants return try self.binOpRegister(.sdiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, .unsigned => { // TODO optimize integer division by constants return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, } } else { return self.fail("TODO integer division for ints with bits > 64", .{}); } }, else => unreachable, } } fn divFloor( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO div on floats", .{}), .Vector => return self.fail("TODO div on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { switch (int_info.signedness) { .signed => { return self.fail("TODO div_floor on signed integers", .{}); }, .unsigned => { // TODO optimize integer division by constants return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, } } else { return self.fail("TODO integer division for ints with bits > 64", .{}); } }, else => unreachable, } } fn divExact( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO div on floats", .{}), .Vector => return self.fail("TODO div on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { switch (int_info.signedness) { .signed => { // TODO optimize integer division by constants return try self.binOpRegister(.sdiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, .unsigned => { // TODO optimize integer division by constants return try self.binOpRegister(.udiv, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, } } else { return self.fail("TODO integer division for ints with bits > 64", .{}); } }, else => unreachable, } } fn rem( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { _ = maybe_inst; const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO rem/mod on floats", .{}), .Vector => return self.fail("TODO rem/mod on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; var quotient_reg: Register = undefined; var remainder_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = "ient_reg }, .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &remainder_reg }, }; try self.allocRegs( &read_args, &write_args, null, ); _ = try self.addInst(.{ .tag = switch (int_info.signedness) { .signed => .sdiv, .unsigned => .udiv, }, .data = .{ .rrr = .{ .rd = quotient_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); _ = try self.addInst(.{ .tag = .msub, .data = .{ .rrrr = .{ .rd = remainder_reg, .rn = quotient_reg, .rm = rhs_reg, .ra = lhs_reg, } }, }); return MCValue{ .register = remainder_reg }; } else { return self.fail("TODO rem/mod for integers with bits > 64", .{}); } }, else => unreachable, } } fn modulo( self: *Self, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { _ = lhs_bind; _ = rhs_bind; _ = rhs_ty; _ = maybe_inst; switch (lhs_ty.zigTypeTag()) { .Float => return self.fail("TODO mod on floats", .{}), .Vector => return self.fail("TODO mod on vectors", .{}), .Int => return self.fail("TODO mod on ints", .{}), else => unreachable, } } fn wrappingArithmetic( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { // Generate an add/sub/mul const result: MCValue = switch (tag) { .addwrap => try self.addSub(.add, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), .subwrap => try self.addSub(.sub, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), .mulwrap => try self.mul(lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), else => unreachable, }; // Truncate if necessary const result_reg = result.register; try self.truncRegister(result_reg, result_reg, int_info.signedness, int_info.bits); return result; } else { return self.fail("TODO binary operations on integers > u64/i64", .{}); } }, else => unreachable, } } fn bitwise( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { const mod = self.bin_file.options.module.?; switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { // TODO implement bitwise operations with immediates const mir_tag: Mir.Inst.Tag = switch (tag) { .bit_and => .and_shifted_register, .bit_or => .orr_shifted_register, .xor => .eor_shifted_register, else => unreachable, }; return try self.binOpRegister(mir_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); } else { return self.fail("TODO binary operations on int with bits > 64", .{}); } }, else => unreachable, } } fn shiftExact( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { _ = rhs_ty; switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { const rhs_immediate = try rhs_bind.resolveToImmediate(self); const mir_tag_register: Mir.Inst.Tag = switch (tag) { .shl_exact => .lsl_register, .shr_exact => switch (int_info.signedness) { .signed => Mir.Inst.Tag.asr_register, .unsigned => Mir.Inst.Tag.lsr_register, }, else => unreachable, }; const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { .shl_exact => .lsl_immediate, .shr_exact => switch (int_info.signedness) { .signed => Mir.Inst.Tag.asr_immediate, .unsigned => Mir.Inst.Tag.lsr_immediate, }, else => unreachable, }; if (rhs_immediate) |imm| { return try self.binOpImmediate(mir_tag_immediate, lhs_bind, imm, lhs_ty, false, maybe_inst); } else { // We intentionally pass lhs_ty here in order to // prevent using the 32-bit register alias when // lhs_ty is > 32 bits. return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, lhs_ty, maybe_inst); } } else { return self.fail("TODO binary operations on int with bits > 64", .{}); } }, else => unreachable, } } fn shiftNormal( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO binary operations on vectors", .{}), .Int => { const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { // Generate a shl_exact/shr_exact const result: MCValue = switch (tag) { .shl => try self.shiftExact(.shl_exact, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), .shr => try self.shiftExact(.shr_exact, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst), else => unreachable, }; // Truncate if necessary switch (tag) { .shr => return result, .shl => { const result_reg = result.register; try self.truncRegister(result_reg, result_reg, int_info.signedness, int_info.bits); return result; }, else => unreachable, } } else { return self.fail("TODO binary operations on integers > u64/i64", .{}); } }, else => unreachable, } } fn booleanOp( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { switch (lhs_ty.zigTypeTag()) { .Bool => { assert((try lhs_bind.resolveToImmediate(self)) == null); // should have been handled by Sema assert((try rhs_bind.resolveToImmediate(self)) == null); // should have been handled by Sema const mir_tag_register: Mir.Inst.Tag = switch (tag) { .bool_and => .and_shifted_register, .bool_or => .orr_shifted_register, else => unreachable, }; return try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, maybe_inst); }, else => unreachable, } } fn ptrArithmetic( self: *Self, tag: Air.Inst.Tag, lhs_bind: ReadArg.Bind, rhs_bind: ReadArg.Bind, lhs_ty: Type, rhs_ty: Type, maybe_inst: ?Air.Inst.Index, ) InnerError!MCValue { switch (lhs_ty.zigTypeTag()) { .Pointer => { const mod = self.bin_file.options.module.?; assert(rhs_ty.eql(Type.usize, mod)); const ptr_ty = lhs_ty; const elem_ty = switch (ptr_ty.ptrSize()) { .One => ptr_ty.childType().childType(), // ptr to array, so get array element type else => ptr_ty.childType(), }; const elem_size = elem_ty.abiSize(self.target.*); const base_tag: Air.Inst.Tag = switch (tag) { .ptr_add => .add, .ptr_sub => .sub, else => unreachable, }; if (elem_size == 1) { return try self.addSub(base_tag, lhs_bind, rhs_bind, Type.usize, Type.usize, maybe_inst); } else { // convert the offset into a byte offset by // multiplying it with elem_size const imm_bind = ReadArg.Bind{ .mcv = .{ .immediate = elem_size } }; const offset = try self.mul(rhs_bind, imm_bind, Type.usize, Type.usize, null); const offset_bind = ReadArg.Bind{ .mcv = offset }; const addr = try self.addSub(base_tag, lhs_bind, offset_bind, Type.usize, Type.usize, null); return addr; } }, else => unreachable, } } fn airBinOp(self: *Self, inst: Air.Inst.Index, tag: Air.Inst.Tag) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const lhs_ty = self.air.typeOf(bin_op.lhs); const rhs_ty = self.air.typeOf(bin_op.rhs); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; break :result switch (tag) { .add => try self.addSub(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .sub => try self.addSub(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .mul => try self.mul(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .div_float => try self.divFloat(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .div_trunc => try self.divTrunc(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .div_floor => try self.divFloor(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .div_exact => try self.divExact(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .rem => try self.rem(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .mod => try self.modulo(lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .addwrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .subwrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .mulwrap => try self.wrappingArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .bit_and => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .bit_or => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .xor => try self.bitwise(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .shl_exact => try self.shiftExact(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .shr_exact => try self.shiftExact(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .shl => try self.shiftNormal(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .shr => try self.shiftNormal(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .bool_and => try self.booleanOp(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), .bool_or => try self.booleanOp(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst), else => unreachable, }; }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airPtrArithmetic(self: *Self, inst: Air.Inst.Index, tag: Air.Inst.Tag) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const bin_op = self.air.extraData(Air.Bin, ty_pl.payload).data; const lhs_ty = self.air.typeOf(bin_op.lhs); const rhs_ty = self.air.typeOf(bin_op.rhs); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const lhs_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; break :result try self.ptrArithmetic(tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, inst); }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airAddSat(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement add_sat for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airSubSat(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement sub_sat for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airMulSat(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement mul_sat for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airOverflow(self: *Self, inst: Air.Inst.Index) !void { const tag = self.air.instructions.items(.tag)[inst]; const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; const lhs_ty = self.air.typeOf(extra.lhs); const rhs_ty = self.air.typeOf(extra.rhs); const tuple_ty = self.air.typeOfIndex(inst); const tuple_size = @intCast(u32, tuple_ty.abiSize(self.target.*)); const tuple_align = tuple_ty.abiAlignment(self.target.*); const overflow_bit_offset = @intCast(u32, tuple_ty.structFieldOffset(1, self.target.*)); switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO implement add_with_overflow/sub_with_overflow for vectors", .{}), .Int => { const mod = self.bin_file.options.module.?; assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); switch (int_info.bits) { 1...31, 33...63 => { const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); try self.spillCompareFlagsIfOccupied(); self.compare_flags_inst = null; const base_tag: Air.Inst.Tag = switch (tag) { .add_with_overflow => .add, .sub_with_overflow => .sub, else => unreachable, }; const dest = try self.addSub(base_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); const dest_reg = dest.register; const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); defer self.register_manager.unlockReg(dest_reg_lock); const raw_truncated_reg = try self.register_manager.allocReg(null, gp); const truncated_reg = self.registerAlias(raw_truncated_reg, lhs_ty); const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); defer self.register_manager.unlockReg(truncated_reg_lock); // sbfx/ubfx truncated, dest, #0, #bits try self.truncRegister(dest_reg, truncated_reg, int_info.signedness, int_info.bits); // cmp dest, truncated _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = dest_reg, .rm = truncated_reg, .imm6 = 0, .shift = .lsl, } }, }); try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); try self.genSetStack(Type.initTag(.u1), stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); break :result MCValue{ .stack_offset = stack_offset }; }, 32, 64 => { const lhs_immediate = try lhs_bind.resolveToImmediate(self); const rhs_immediate = try rhs_bind.resolveToImmediate(self); // Only say yes if the operation is // commutative, i.e. we can swap both of the // operands const lhs_immediate_ok = switch (tag) { .add_with_overflow => if (lhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, .sub_with_overflow => false, else => unreachable, }; const rhs_immediate_ok = switch (tag) { .add_with_overflow, .sub_with_overflow, => if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false, else => unreachable, }; const mir_tag_register: Mir.Inst.Tag = switch (tag) { .add_with_overflow => .adds_shifted_register, .sub_with_overflow => .subs_shifted_register, else => unreachable, }; const mir_tag_immediate: Mir.Inst.Tag = switch (tag) { .add_with_overflow => .adds_immediate, .sub_with_overflow => .subs_immediate, else => unreachable, }; try self.spillCompareFlagsIfOccupied(); self.compare_flags_inst = inst; const dest = blk: { if (rhs_immediate_ok) { break :blk try self.binOpImmediate(mir_tag_immediate, lhs_bind, rhs_immediate.?, lhs_ty, false, null); } else if (lhs_immediate_ok) { // swap lhs and rhs break :blk try self.binOpImmediate(mir_tag_immediate, rhs_bind, lhs_immediate.?, rhs_ty, true, null); } else { break :blk try self.binOpRegister(mir_tag_register, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); } }; const flag: bits.Instruction.Condition = switch (int_info.signedness) { .unsigned => switch (tag) { .add_with_overflow => bits.Instruction.Condition.cs, .sub_with_overflow => bits.Instruction.Condition.cc, else => unreachable, }, .signed => .vs, }; break :result MCValue{ .register_with_overflow = .{ .reg = dest.register, .flag = flag, } }; }, else => return self.fail("TODO overflow operations on integers > u32/i32", .{}), } }, else => unreachable, } }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); } fn airMulWithOverflow(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; if (self.liveness.isUnused(inst)) return self.finishAir(inst, .dead, .{ extra.lhs, extra.rhs, .none }); const result: MCValue = result: { const mod = self.bin_file.options.module.?; const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; const lhs_ty = self.air.typeOf(extra.lhs); const rhs_ty = self.air.typeOf(extra.rhs); const tuple_ty = self.air.typeOfIndex(inst); const tuple_size = @intCast(u32, tuple_ty.abiSize(self.target.*)); const tuple_align = tuple_ty.abiAlignment(self.target.*); const overflow_bit_offset = @intCast(u32, tuple_ty.structFieldOffset(1, self.target.*)); switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO implement mul_with_overflow for vectors", .{}), .Int => { assert(lhs_ty.eql(rhs_ty, mod)); const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 32) { const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); try self.spillCompareFlagsIfOccupied(); const base_tag: Mir.Inst.Tag = switch (int_info.signedness) { .signed => .smull, .unsigned => .umull, }; const dest = try self.binOpRegister(base_tag, lhs_bind, rhs_bind, lhs_ty, rhs_ty, null); const dest_reg = dest.register; const dest_reg_lock = self.register_manager.lockRegAssumeUnused(dest_reg); defer self.register_manager.unlockReg(dest_reg_lock); const truncated_reg = try self.register_manager.allocReg(null, gp); const truncated_reg_lock = self.register_manager.lockRegAssumeUnused(truncated_reg); defer self.register_manager.unlockReg(truncated_reg_lock); try self.truncRegister( dest_reg.toW(), truncated_reg.toW(), int_info.signedness, int_info.bits, ); switch (int_info.signedness) { .signed => { _ = try self.addInst(.{ .tag = .cmp_extended_register, .data = .{ .rr_extend_shift = .{ .rn = dest_reg.toX(), .rm = truncated_reg.toW(), .ext_type = .sxtw, .imm3 = 0, } }, }); }, .unsigned => { _ = try self.addInst(.{ .tag = .cmp_extended_register, .data = .{ .rr_extend_shift = .{ .rn = dest_reg.toX(), .rm = truncated_reg.toW(), .ext_type = .uxtw, .imm3 = 0, } }, }); }, } try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); try self.genSetStack(Type.initTag(.u1), stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); break :result MCValue{ .stack_offset = stack_offset }; } else if (int_info.bits <= 64) { const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); try self.spillCompareFlagsIfOccupied(); var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; var dest_reg: Register = undefined; var dest_high_reg: Register = undefined; var truncated_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_high_reg }, .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &truncated_reg }, }; try self.allocRegs( &read_args, &write_args, null, ); switch (int_info.signedness) { .signed => { // mul dest, lhs, rhs _ = try self.addInst(.{ .tag = .mul, .data = .{ .rrr = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); // smulh dest_high, lhs, rhs _ = try self.addInst(.{ .tag = .smulh, .data = .{ .rrr = .{ .rd = dest_high_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); // cmp dest_high, dest, asr #63 _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = dest_high_reg, .rm = dest_reg, .imm6 = 63, .shift = .asr, } }, }); const shift: u6 = @intCast(u6, @as(u7, 64) - @intCast(u7, int_info.bits)); if (shift > 0) { // lsl dest_high, dest, #shift _ = try self.addInst(.{ .tag = .lsl_immediate, .data = .{ .rr_shift = .{ .rd = dest_high_reg, .rn = dest_reg, .shift = shift, } }, }); // cmp dest, dest_high, #shift _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = dest_reg, .rm = dest_high_reg, .imm6 = shift, .shift = .asr, } }, }); } }, .unsigned => { // umulh dest_high, lhs, rhs _ = try self.addInst(.{ .tag = .umulh, .data = .{ .rrr = .{ .rd = dest_high_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); // mul dest, lhs, rhs _ = try self.addInst(.{ .tag = .mul, .data = .{ .rrr = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); _ = try self.addInst(.{ .tag = .cmp_immediate, .data = .{ .r_imm12_sh = .{ .rn = dest_high_reg, .imm12 = 0, } }, }); if (int_info.bits < 64) { // lsr dest_high, dest, #shift _ = try self.addInst(.{ .tag = .lsr_immediate, .data = .{ .rr_shift = .{ .rd = dest_high_reg, .rn = dest_reg, .shift = @intCast(u6, int_info.bits), } }, }); _ = try self.addInst(.{ .tag = .cmp_immediate, .data = .{ .r_imm12_sh = .{ .rn = dest_high_reg, .imm12 = 0, } }, }); } }, } try self.truncRegister(dest_reg, truncated_reg, int_info.signedness, int_info.bits); try self.genSetStack(lhs_ty, stack_offset, .{ .register = truncated_reg }); try self.genSetStack(Type.initTag(.u1), stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); break :result MCValue{ .stack_offset = stack_offset }; } else return self.fail("TODO implement mul_with_overflow for integers > u64/i64", .{}); }, else => unreachable, } }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); } fn airShlWithOverflow(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; if (self.liveness.isUnused(inst)) return self.finishAir(inst, .dead, .{ extra.lhs, extra.rhs, .none }); const result: MCValue = result: { const lhs_bind: ReadArg.Bind = .{ .inst = extra.lhs }; const rhs_bind: ReadArg.Bind = .{ .inst = extra.rhs }; const lhs_ty = self.air.typeOf(extra.lhs); const rhs_ty = self.air.typeOf(extra.rhs); const tuple_ty = self.air.typeOfIndex(inst); const tuple_size = @intCast(u32, tuple_ty.abiSize(self.target.*)); const tuple_align = tuple_ty.abiAlignment(self.target.*); const overflow_bit_offset = @intCast(u32, tuple_ty.structFieldOffset(1, self.target.*)); switch (lhs_ty.zigTypeTag()) { .Vector => return self.fail("TODO implement shl_with_overflow for vectors", .{}), .Int => { const int_info = lhs_ty.intInfo(self.target.*); if (int_info.bits <= 64) { const stack_offset = try self.allocMem(tuple_size, tuple_align, inst); try self.spillCompareFlagsIfOccupied(); var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; var dest_reg: Register = undefined; var reconstructed_reg: Register = undefined; const rhs_immediate = try rhs_bind.resolveToImmediate(self); if (rhs_immediate) |imm| { const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &reconstructed_reg }, }; try self.allocRegs( &read_args, &write_args, null, ); // lsl dest, lhs, rhs _ = try self.addInst(.{ .tag = .lsl_immediate, .data = .{ .rr_shift = .{ .rd = dest_reg, .rn = lhs_reg, .shift = @intCast(u6, imm), } }, }); try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); // asr/lsr reconstructed, dest, rhs _ = try self.addInst(.{ .tag = switch (int_info.signedness) { .signed => Mir.Inst.Tag.asr_immediate, .unsigned => Mir.Inst.Tag.lsr_immediate, }, .data = .{ .rr_shift = .{ .rd = reconstructed_reg, .rn = dest_reg, .shift = @intCast(u6, imm), } }, }); } else { const read_args = [_]ReadArg{ .{ .ty = lhs_ty, .bind = lhs_bind, .class = gp, .reg = &lhs_reg }, .{ .ty = rhs_ty, .bind = rhs_bind, .class = gp, .reg = &rhs_reg }, }; const write_args = [_]WriteArg{ .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &dest_reg }, .{ .ty = lhs_ty, .bind = .none, .class = gp, .reg = &reconstructed_reg }, }; try self.allocRegs( &read_args, &write_args, null, ); // lsl dest, lhs, rhs _ = try self.addInst(.{ .tag = .lsl_register, .data = .{ .rrr = .{ .rd = dest_reg, .rn = lhs_reg, .rm = rhs_reg, } }, }); try self.truncRegister(dest_reg, dest_reg, int_info.signedness, int_info.bits); // asr/lsr reconstructed, dest, rhs _ = try self.addInst(.{ .tag = switch (int_info.signedness) { .signed => Mir.Inst.Tag.asr_register, .unsigned => Mir.Inst.Tag.lsr_register, }, .data = .{ .rrr = .{ .rd = reconstructed_reg, .rn = dest_reg, .rm = rhs_reg, } }, }); } // cmp lhs, reconstructed _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = lhs_reg, .rm = reconstructed_reg, .imm6 = 0, .shift = .lsl, } }, }); try self.genSetStack(lhs_ty, stack_offset, .{ .register = dest_reg }); try self.genSetStack(Type.initTag(.u1), stack_offset - overflow_bit_offset, .{ .compare_flags = .ne }); break :result MCValue{ .stack_offset = stack_offset }; } else { return self.fail("TODO ARM overflow operations on integers > u32/i32", .{}); } }, else => unreachable, } }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); } fn airShlSat(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement shl_sat for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airOptionalPayload(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const optional_ty = self.air.typeOf(ty_op.operand); const mcv = try self.resolveInst(ty_op.operand); break :result try self.optionalPayload(inst, mcv, optional_ty); }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn optionalPayload(self: *Self, inst: Air.Inst.Index, mcv: MCValue, optional_ty: Type) !MCValue { var opt_buf: Type.Payload.ElemType = undefined; const payload_ty = optional_ty.optionalChild(&opt_buf); if (!payload_ty.hasRuntimeBits()) return MCValue.none; if (optional_ty.isPtrLikeOptional()) { // TODO should we reuse the operand here? const raw_reg = try self.register_manager.allocReg(inst, gp); const reg = self.registerAlias(raw_reg, payload_ty); try self.genSetReg(payload_ty, reg, mcv); return MCValue{ .register = reg }; } switch (mcv) { .register => { // TODO should we reuse the operand here? const raw_reg = try self.register_manager.allocReg(inst, gp); const dest_reg = raw_reg.toX(); try self.genSetReg(payload_ty, dest_reg, mcv); return MCValue{ .register = self.registerAlias(dest_reg, payload_ty) }; }, .stack_argument_offset, .stack_offset, .memory => return mcv, else => unreachable, // invalid MCValue for an error union } } fn airOptionalPayloadPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .optional_payload_ptr for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airOptionalPayloadPtrSet(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .optional_payload_ptr_set for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } /// Given an error union, returns the error fn errUnionErr( self: *Self, error_union_bind: ReadArg.Bind, error_union_ty: Type, maybe_inst: ?Air.Inst.Index, ) !MCValue { const err_ty = error_union_ty.errorUnionSet(); const payload_ty = error_union_ty.errorUnionPayload(); if (err_ty.errorSetIsEmpty()) { return MCValue{ .immediate = 0 }; } if (!payload_ty.hasRuntimeBitsIgnoreComptime()) { return try error_union_bind.resolveToMcv(self); } const err_offset = @intCast(u32, errUnionErrorOffset(payload_ty, self.target.*)); switch (try error_union_bind.resolveToMcv(self)) { .register => { var operand_reg: Register = undefined; var dest_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = error_union_ty, .bind = error_union_bind, .class = gp, .reg = &operand_reg }, }; const write_args = [_]WriteArg{ .{ .ty = err_ty, .bind = .none, .class = gp, .reg = &dest_reg }, }; try self.allocRegs( &read_args, &write_args, if (maybe_inst) |inst| .{ .corresponding_inst = inst, .operand_mapping = &.{0}, } else null, ); const err_bit_offset = err_offset * 8; const err_bit_size = @intCast(u32, err_ty.abiSize(self.target.*)) * 8; _ = try self.addInst(.{ .tag = .ubfx, // errors are unsigned integers .data = .{ .rr_lsb_width = .{ // Set both registers to the X variant to get the full width .rd = dest_reg.toX(), .rn = operand_reg.toX(), .lsb = @intCast(u6, err_bit_offset), .width = @intCast(u7, err_bit_size), }, }, }); return MCValue{ .register = dest_reg }; }, .stack_argument_offset => |off| { return MCValue{ .stack_argument_offset = off + err_offset }; }, .stack_offset => |off| { return MCValue{ .stack_offset = off - err_offset }; }, .memory => |addr| { return MCValue{ .memory = addr + err_offset }; }, else => unreachable, // invalid MCValue for an error union } } fn airUnwrapErrErr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_bind: ReadArg.Bind = .{ .inst = ty_op.operand }; const error_union_ty = self.air.typeOf(ty_op.operand); break :result try self.errUnionErr(error_union_bind, error_union_ty, inst); }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } /// Given an error union, returns the payload fn errUnionPayload( self: *Self, error_union_bind: ReadArg.Bind, error_union_ty: Type, maybe_inst: ?Air.Inst.Index, ) !MCValue { const err_ty = error_union_ty.errorUnionSet(); const payload_ty = error_union_ty.errorUnionPayload(); if (err_ty.errorSetIsEmpty()) { return try error_union_bind.resolveToMcv(self); } if (!payload_ty.hasRuntimeBitsIgnoreComptime()) { return MCValue.none; } const payload_offset = @intCast(u32, errUnionPayloadOffset(payload_ty, self.target.*)); switch (try error_union_bind.resolveToMcv(self)) { .register => { var operand_reg: Register = undefined; var dest_reg: Register = undefined; const read_args = [_]ReadArg{ .{ .ty = error_union_ty, .bind = error_union_bind, .class = gp, .reg = &operand_reg }, }; const write_args = [_]WriteArg{ .{ .ty = err_ty, .bind = .none, .class = gp, .reg = &dest_reg }, }; try self.allocRegs( &read_args, &write_args, if (maybe_inst) |inst| .{ .corresponding_inst = inst, .operand_mapping = &.{0}, } else null, ); const payload_bit_offset = payload_offset * 8; const payload_bit_size = @intCast(u32, payload_ty.abiSize(self.target.*)) * 8; _ = try self.addInst(.{ .tag = if (payload_ty.isSignedInt()) Mir.Inst.Tag.sbfx else .ubfx, .data = .{ .rr_lsb_width = .{ // Set both registers to the X variant to get the full width .rd = dest_reg.toX(), .rn = operand_reg.toX(), .lsb = @intCast(u5, payload_bit_offset), .width = @intCast(u6, payload_bit_size), }, }, }); return MCValue{ .register = dest_reg }; }, .stack_argument_offset => |off| { return MCValue{ .stack_argument_offset = off + payload_offset }; }, .stack_offset => |off| { return MCValue{ .stack_offset = off - payload_offset }; }, .memory => |addr| { return MCValue{ .memory = addr + payload_offset }; }, else => unreachable, // invalid MCValue for an error union } } fn airUnwrapErrPayload(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_bind: ReadArg.Bind = .{ .inst = ty_op.operand }; const error_union_ty = self.air.typeOf(ty_op.operand); break :result try self.errUnionPayload(error_union_bind, error_union_ty, inst); }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } // *(E!T) -> E fn airUnwrapErrErrPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; 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}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } // *(E!T) -> *T fn airUnwrapErrPayloadPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; 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}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airErrUnionPayloadPtrSet(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement .errunion_payload_ptr_set for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airErrReturnTrace(self: *Self, inst: Air.Inst.Index) !void { const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airErrReturnTrace for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airSetErrReturnTrace(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airSetErrReturnTrace for {}", .{self.target.cpu.arch}); } fn airSaveErrReturnTraceIndex(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airSaveErrReturnTraceIndex for {}", .{self.target.cpu.arch}); } fn airWrapOptional(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; if (self.liveness.isUnused(inst)) { return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); } const result: MCValue = result: { const payload_ty = self.air.typeOf(ty_op.operand); if (!payload_ty.hasRuntimeBits()) { break :result MCValue{ .immediate = 1 }; } const optional_ty = self.air.typeOfIndex(inst); const operand = try self.resolveInst(ty_op.operand); const operand_lock: ?RegisterLock = switch (operand) { .register => |reg| self.register_manager.lockRegAssumeUnused(reg), else => null, }; defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); if (optional_ty.isPtrLikeOptional()) { // TODO should we check if we can reuse the operand? const raw_reg = try self.register_manager.allocReg(inst, gp); const reg = self.registerAlias(raw_reg, payload_ty); try self.genSetReg(payload_ty, raw_reg, operand); break :result MCValue{ .register = reg }; } const optional_abi_size = @intCast(u32, optional_ty.abiSize(self.target.*)); const optional_abi_align = optional_ty.abiAlignment(self.target.*); const offset = @intCast(u32, payload_ty.abiSize(self.target.*)); const stack_offset = try self.allocMem(optional_abi_size, optional_abi_align, inst); try self.genSetStack(payload_ty, stack_offset, operand); try self.genSetStack(Type.bool, stack_offset - offset, .{ .immediate = 1 }); break :result MCValue{ .stack_offset = stack_offset }; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } /// T to E!T fn airWrapErrUnionPayload(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_ty = self.air.getRefType(ty_op.ty); const error_ty = error_union_ty.errorUnionSet(); const payload_ty = error_union_ty.errorUnionPayload(); const operand = try self.resolveInst(ty_op.operand); if (!payload_ty.hasRuntimeBitsIgnoreComptime()) break :result operand; const abi_size = @intCast(u32, error_union_ty.abiSize(self.target.*)); const abi_align = error_union_ty.abiAlignment(self.target.*); const stack_offset = try self.allocMem(abi_size, abi_align, inst); const payload_off = errUnionPayloadOffset(payload_ty, self.target.*); const err_off = errUnionErrorOffset(payload_ty, self.target.*); try self.genSetStack(payload_ty, stack_offset - @intCast(u32, payload_off), operand); try self.genSetStack(error_ty, stack_offset - @intCast(u32, err_off), .{ .immediate = 0 }); break :result MCValue{ .stack_offset = stack_offset }; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } /// E to E!T fn airWrapErrUnionErr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_ty = self.air.getRefType(ty_op.ty); const error_ty = error_union_ty.errorUnionSet(); const payload_ty = error_union_ty.errorUnionPayload(); const operand = try self.resolveInst(ty_op.operand); if (!payload_ty.hasRuntimeBitsIgnoreComptime()) break :result operand; const abi_size = @intCast(u32, error_union_ty.abiSize(self.target.*)); const abi_align = error_union_ty.abiAlignment(self.target.*); const stack_offset = try self.allocMem(abi_size, abi_align, inst); const payload_off = errUnionPayloadOffset(payload_ty, self.target.*); const err_off = errUnionErrorOffset(payload_ty, self.target.*); try self.genSetStack(error_ty, stack_offset - @intCast(u32, err_off), operand); try self.genSetStack(payload_ty, stack_offset - @intCast(u32, payload_off), .undef); break :result MCValue{ .stack_offset = stack_offset }; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn slicePtr(mcv: MCValue) MCValue { switch (mcv) { .dead, .unreach, .none => unreachable, .register => unreachable, // a slice doesn't fit in one register .stack_argument_offset => |off| { return MCValue{ .stack_argument_offset = off }; }, .stack_offset => |off| { return MCValue{ .stack_offset = off }; }, .memory => |addr| { return MCValue{ .memory = addr }; }, else => unreachable, // invalid MCValue for a slice } } fn airSlicePtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const mcv = try self.resolveInst(ty_op.operand); break :result slicePtr(mcv); }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airSliceLen(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes = @divExact(ptr_bits, 8); const mcv = try self.resolveInst(ty_op.operand); switch (mcv) { .dead, .unreach, .none => unreachable, .register => unreachable, // a slice doesn't fit in one register .stack_argument_offset => |off| { break :result MCValue{ .stack_argument_offset = off + ptr_bytes }; }, .stack_offset => |off| { break :result MCValue{ .stack_offset = off - ptr_bytes }; }, .memory => |addr| { break :result MCValue{ .memory = addr + ptr_bytes }; }, else => return self.fail("TODO implement slice_len for {}", .{mcv}), } }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airPtrSliceLenPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes = @divExact(ptr_bits, 8); const mcv = try self.resolveInst(ty_op.operand); switch (mcv) { .dead, .unreach, .none => unreachable, .ptr_stack_offset => |off| { break :result MCValue{ .ptr_stack_offset = off - ptr_bytes }; }, else => return self.fail("TODO implement ptr_slice_len_ptr for {}", .{mcv}), } }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airPtrSlicePtrPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const mcv = try self.resolveInst(ty_op.operand); switch (mcv) { .dead, .unreach, .none => unreachable, .ptr_stack_offset => |off| { break :result MCValue{ .ptr_stack_offset = off }; }, else => return self.fail("TODO implement ptr_slice_len_ptr for {}", .{mcv}), } }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airSliceElemVal(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const slice_ty = self.air.typeOf(bin_op.lhs); const result: MCValue = if (!slice_ty.isVolatilePtr() and self.liveness.isUnused(inst)) .dead else result: { var buf: Type.SlicePtrFieldTypeBuffer = undefined; const ptr_ty = slice_ty.slicePtrFieldType(&buf); const slice_mcv = try self.resolveInst(bin_op.lhs); const base_mcv = slicePtr(slice_mcv); const base_bind: ReadArg.Bind = .{ .mcv = base_mcv }; const index_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; break :result try self.ptrElemVal(base_bind, index_bind, ptr_ty, inst); }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn ptrElemVal( self: *Self, ptr_bind: ReadArg.Bind, index_bind: ReadArg.Bind, ptr_ty: Type, maybe_inst: ?Air.Inst.Index, ) !MCValue { const elem_ty = ptr_ty.childType(); const elem_size = @intCast(u32, elem_ty.abiSize(self.target.*)); // TODO optimize for elem_sizes of 1, 2, 4, 8 switch (elem_size) { else => { const addr = try self.ptrArithmetic(.ptr_add, ptr_bind, index_bind, ptr_ty, Type.usize, null); const dest = try self.allocRegOrMem(elem_ty, true, maybe_inst); try self.load(dest, addr, ptr_ty); return dest; }, } } fn airSliceElemPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const slice_mcv = try self.resolveInst(extra.lhs); const base_mcv = slicePtr(slice_mcv); const base_bind: ReadArg.Bind = .{ .mcv = base_mcv }; const index_bind: ReadArg.Bind = .{ .inst = extra.rhs }; const slice_ty = self.air.typeOf(extra.lhs); const index_ty = self.air.typeOf(extra.rhs); const addr = try self.ptrArithmetic(.ptr_add, base_bind, index_bind, slice_ty, index_ty, null); break :result addr; }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); } fn airArrayElemVal(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement array_elem_val for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airPtrElemVal(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const ptr_ty = self.air.typeOf(bin_op.lhs); const result: MCValue = if (!ptr_ty.isVolatilePtr() and self.liveness.isUnused(inst)) .dead else result: { const base_bind: ReadArg.Bind = .{ .inst = bin_op.lhs }; const index_bind: ReadArg.Bind = .{ .inst = bin_op.rhs }; break :result try self.ptrElemVal(base_bind, index_bind, ptr_ty, inst); }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airPtrElemPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Bin, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const ptr_bind: ReadArg.Bind = .{ .inst = extra.lhs }; const index_bind: ReadArg.Bind = .{ .inst = extra.rhs }; const ptr_ty = self.air.typeOf(extra.lhs); const index_ty = self.air.typeOf(extra.rhs); const addr = try self.ptrArithmetic(.ptr_add, ptr_bind, index_bind, ptr_ty, index_ty, null); break :result addr; }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, .none }); } fn airSetUnionTag(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; _ = bin_op; return self.fail("TODO implement airSetUnionTag for {}", .{self.target.cpu.arch}); } fn airGetUnionTag(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airGetUnionTag for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airClz(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airClz for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airCtz(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airCtz for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airPopcount(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airPopcount for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airByteSwap(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airByteSwap for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airBitReverse(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airBitReverse for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airUnaryMath(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airUnaryMath for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn reuseOperand( self: *Self, inst: Air.Inst.Index, operand: Air.Inst.Ref, op_index: Liveness.OperandInt, mcv: MCValue, ) bool { if (!self.liveness.operandDies(inst, op_index)) return false; switch (mcv) { .register => |reg| { // If it's in the registers table, need to associate the register with the // new instruction. if (RegisterManager.indexOfRegIntoTracked(reg)) |index| { if (!self.register_manager.isRegFree(reg)) { self.register_manager.registers[index] = inst; } } log.debug("%{d} => {} (reused)", .{ inst, reg }); }, .stack_offset => |off| { log.debug("%{d} => stack offset {d} (reused)", .{ inst, off }); }, else => return false, } // Prevent the operand deaths processing code from deallocating it. self.liveness.clearOperandDeath(inst, op_index); // That makes us responsible for doing the rest of the stuff that processDeath would have done. const branch = &self.branch_stack.items[self.branch_stack.items.len - 1]; branch.inst_table.putAssumeCapacity(Air.refToIndex(operand).?, .dead); return true; } fn load(self: *Self, dst_mcv: MCValue, ptr: MCValue, ptr_ty: Type) InnerError!void { const elem_ty = ptr_ty.elemType(); const elem_size = elem_ty.abiSize(self.target.*); switch (ptr) { .none => unreachable, .undef => unreachable, .unreach => unreachable, .dead => unreachable, .compare_flags, .register_with_overflow, => unreachable, // cannot hold an address .immediate => |imm| try self.setRegOrMem(elem_ty, dst_mcv, .{ .memory = imm }), .ptr_stack_offset => |off| try self.setRegOrMem(elem_ty, dst_mcv, .{ .stack_offset = off }), .register => |addr_reg| { const addr_reg_lock = self.register_manager.lockReg(addr_reg); defer if (addr_reg_lock) |reg| self.register_manager.unlockReg(reg); switch (dst_mcv) { .dead => unreachable, .undef => unreachable, .compare_flags => unreachable, .register => |dst_reg| { try self.genLdrRegister(dst_reg, addr_reg, elem_ty); }, .stack_offset => |off| { if (elem_size <= 8) { const raw_tmp_reg = try self.register_manager.allocReg(null, gp); const tmp_reg = self.registerAlias(raw_tmp_reg, elem_ty); const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); defer self.register_manager.unlockReg(tmp_reg_lock); try self.load(.{ .register = tmp_reg }, ptr, ptr_ty); try self.genSetStack(elem_ty, off, MCValue{ .register = tmp_reg }); } else { // TODO optimize the register allocation const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); defer for (regs_locks) |reg| { self.register_manager.unlockReg(reg); }; const src_reg = addr_reg; const dst_reg = regs[0]; const len_reg = regs[1]; const count_reg = regs[2]; const tmp_reg = regs[3]; // sub dst_reg, fp, #off try self.genSetReg(ptr_ty, dst_reg, .{ .ptr_stack_offset = off }); // mov len, #elem_size try self.genSetReg(Type.usize, len_reg, .{ .immediate = elem_size }); // memcpy(src, dst, len) try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); } }, else => return self.fail("TODO load from register into {}", .{dst_mcv}), } }, .memory, .stack_offset, .stack_argument_offset, .linker_load, => { const addr_reg = try self.copyToTmpRegister(ptr_ty, ptr); try self.load(dst_mcv, .{ .register = addr_reg }, ptr_ty); }, } } fn genInlineMemcpy( self: *Self, src: Register, dst: Register, len: Register, count: Register, tmp: Register, ) !void { // movz count, #0 _ = try self.addInst(.{ .tag = .movz, .data = .{ .r_imm16_sh = .{ .rd = count, .imm16 = 0, } }, }); // loop: // cmp count, len _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = count, .rm = len, .imm6 = 0, .shift = .lsl, } }, }); // bge end _ = try self.addInst(.{ .tag = .b_cond, .data = .{ .inst_cond = .{ .inst = @intCast(u32, self.mir_instructions.len + 5), .cond = .ge, } }, }); // ldrb tmp, [src, count] _ = try self.addInst(.{ .tag = .ldrb_register, .data = .{ .load_store_register_register = .{ .rt = tmp, .rn = src, .offset = Instruction.LoadStoreOffset.reg(count).register, } }, }); // strb tmp, [dest, count] _ = try self.addInst(.{ .tag = .strb_register, .data = .{ .load_store_register_register = .{ .rt = tmp, .rn = dst, .offset = Instruction.LoadStoreOffset.reg(count).register, } }, }); // add count, count, #1 _ = try self.addInst(.{ .tag = .add_immediate, .data = .{ .rr_imm12_sh = .{ .rd = count, .rn = count, .imm12 = 1, } }, }); // b loop _ = try self.addInst(.{ .tag = .b, .data = .{ .inst = @intCast(u32, self.mir_instructions.len - 5) }, }); // end: } fn genInlineMemset( self: *Self, dst: MCValue, val: MCValue, len: MCValue, ) !void { const dst_reg = switch (dst) { .register => |r| r, else => try self.copyToTmpRegister(Type.initTag(.manyptr_u8), dst), }; const dst_reg_lock = self.register_manager.lockReg(dst_reg); defer if (dst_reg_lock) |lock| self.register_manager.unlockReg(lock); const val_reg = switch (val) { .register => |r| r, else => try self.copyToTmpRegister(Type.initTag(.u8), val), }; const val_reg_lock = self.register_manager.lockReg(val_reg); defer if (val_reg_lock) |lock| self.register_manager.unlockReg(lock); const len_reg = switch (len) { .register => |r| r, else => try self.copyToTmpRegister(Type.usize, len), }; const len_reg_lock = self.register_manager.lockReg(len_reg); defer if (len_reg_lock) |lock| self.register_manager.unlockReg(lock); const count_reg = try self.register_manager.allocReg(null, gp); try self.genInlineMemsetCode(dst_reg, val_reg, len_reg, count_reg); } fn genInlineMemsetCode( self: *Self, dst: Register, val: Register, len: Register, count: Register, ) !void { // mov count, #0 _ = try self.addInst(.{ .tag = .movz, .data = .{ .r_imm16_sh = .{ .rd = count, .imm16 = 0, } }, }); // loop: // cmp count, len _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = count, .rm = len, .imm6 = 0, .shift = .lsl, } }, }); // bge end _ = try self.addInst(.{ .tag = .b_cond, .data = .{ .inst_cond = .{ .inst = @intCast(u32, self.mir_instructions.len + 4), .cond = .ge, } }, }); // strb val, [src, count] _ = try self.addInst(.{ .tag = .strb_register, .data = .{ .load_store_register_register = .{ .rt = val, .rn = dst, .offset = Instruction.LoadStoreOffset.reg(count).register, } }, }); // add count, count, #1 _ = try self.addInst(.{ .tag = .add_immediate, .data = .{ .rr_imm12_sh = .{ .rd = count, .rn = count, .imm12 = 1, } }, }); // b loop _ = try self.addInst(.{ .tag = .b, .data = .{ .inst = @intCast(u32, self.mir_instructions.len - 4) }, }); // end: } fn airLoad(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const elem_ty = self.air.typeOfIndex(inst); const elem_size = elem_ty.abiSize(self.target.*); const result: MCValue = result: { if (!elem_ty.hasRuntimeBits()) break :result MCValue.none; const ptr = try self.resolveInst(ty_op.operand); const is_volatile = self.air.typeOf(ty_op.operand).isVolatilePtr(); if (self.liveness.isUnused(inst) and !is_volatile) break :result MCValue.dead; const dst_mcv: MCValue = blk: { if (elem_size <= 8 and self.reuseOperand(inst, ty_op.operand, 0, ptr)) { // The MCValue that holds the pointer can be re-used as the value. break :blk switch (ptr) { .register => |reg| MCValue{ .register = self.registerAlias(reg, elem_ty) }, else => ptr, }; } else { break :blk try self.allocRegOrMem(elem_ty, true, inst); } }; try self.load(dst_mcv, ptr, self.air.typeOf(ty_op.operand)); break :result dst_mcv; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn genLdrRegister(self: *Self, value_reg: Register, addr_reg: Register, ty: Type) !void { const abi_size = ty.abiSize(self.target.*); const tag: Mir.Inst.Tag = switch (abi_size) { 1 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsb_immediate else .ldrb_immediate, 2 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsh_immediate else .ldrh_immediate, 4 => .ldr_immediate, 8 => .ldr_immediate, 3, 5, 6, 7 => return self.fail("TODO: genLdrRegister for more abi_sizes", .{}), else => unreachable, }; _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_register_immediate = .{ .rt = value_reg, .rn = addr_reg, .offset = Instruction.LoadStoreOffset.none.immediate, } }, }); } fn genStrRegister(self: *Self, value_reg: Register, addr_reg: Register, ty: Type) !void { const abi_size = ty.abiSize(self.target.*); const tag: Mir.Inst.Tag = switch (abi_size) { 1 => .strb_immediate, 2 => .strh_immediate, 4, 8 => .str_immediate, 3, 5, 6, 7 => return self.fail("TODO: genStrRegister for more abi_sizes", .{}), else => unreachable, }; _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_register_immediate = .{ .rt = value_reg, .rn = addr_reg, .offset = Instruction.LoadStoreOffset.none.immediate, } }, }); } fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type) InnerError!void { log.debug("store: storing {} to {}", .{ value, ptr }); const abi_size = value_ty.abiSize(self.target.*); switch (ptr) { .none => unreachable, .undef => unreachable, .unreach => unreachable, .dead => unreachable, .compare_flags, .register_with_overflow, => unreachable, // cannot hold an address .immediate => |imm| { try self.setRegOrMem(value_ty, .{ .memory = imm }, value); }, .ptr_stack_offset => |off| { try self.genSetStack(value_ty, off, value); }, .register => |addr_reg| { const addr_reg_lock = self.register_manager.lockReg(addr_reg); defer if (addr_reg_lock) |reg| self.register_manager.unlockReg(reg); switch (value) { .dead => unreachable, .undef => { try self.genSetReg(value_ty, addr_reg, value); }, .register => |value_reg| { log.debug("store: register {} to {}", .{ value_reg, addr_reg }); try self.genStrRegister(value_reg, addr_reg, value_ty); }, else => { if (abi_size <= 8) { const raw_tmp_reg = try self.register_manager.allocReg(null, gp); const tmp_reg = self.registerAlias(raw_tmp_reg, value_ty); const tmp_reg_lock = self.register_manager.lockRegAssumeUnused(tmp_reg); defer self.register_manager.unlockReg(tmp_reg_lock); try self.genSetReg(value_ty, tmp_reg, value); try self.store(ptr, .{ .register = tmp_reg }, ptr_ty, value_ty); } else { const regs = try self.register_manager.allocRegs(4, .{ null, null, null, null }, gp); const regs_locks = self.register_manager.lockRegsAssumeUnused(4, regs); defer for (regs_locks) |reg| { self.register_manager.unlockReg(reg); }; const src_reg = regs[0]; const dst_reg = addr_reg; const len_reg = regs[1]; const count_reg = regs[2]; const tmp_reg = regs[3]; switch (value) { .stack_offset => |off| { // sub src_reg, fp, #off try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); }, .stack_argument_offset => |off| { _ = try self.addInst(.{ .tag = .ldr_ptr_stack_argument, .data = .{ .load_store_stack = .{ .rt = src_reg, .offset = off, } }, }); }, .memory => |addr| try self.genSetReg(Type.usize, src_reg, .{ .immediate = @intCast(u32, addr) }), .linker_load => |load_struct| { const tag: Mir.Inst.Tag = switch (load_struct.type) { .got => .load_memory_ptr_got, .direct => .load_memory_ptr_direct, .import => unreachable, }; const atom_index = switch (self.bin_file.tag) { .macho => blk: { const macho_file = self.bin_file.cast(link.File.MachO).?; const atom = try macho_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk macho_file.getAtom(atom).getSymbolIndex().?; }, .coff => blk: { const coff_file = self.bin_file.cast(link.File.Coff).?; const atom = try coff_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk coff_file.getAtom(atom).getSymbolIndex().?; }, else => unreachable, // unsupported target format }; _ = try self.addInst(.{ .tag = tag, .data = .{ .payload = try self.addExtra(Mir.LoadMemoryPie{ .register = @enumToInt(src_reg), .atom_index = atom_index, .sym_index = load_struct.sym_index, }), }, }); }, else => return self.fail("TODO store {} to register", .{value}), } // mov len, #abi_size try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); // memcpy(src, dst, len) try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); } }, } }, .memory, .stack_offset, .stack_argument_offset, .linker_load, => { const addr_reg = try self.copyToTmpRegister(ptr_ty, ptr); try self.store(.{ .register = addr_reg }, value, ptr_ty, value_ty); }, } } fn airStore(self: *Self, inst: Air.Inst.Index) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const ptr = try self.resolveInst(bin_op.lhs); const value = try self.resolveInst(bin_op.rhs); const ptr_ty = self.air.typeOf(bin_op.lhs); const value_ty = self.air.typeOf(bin_op.rhs); try self.store(ptr, value, ptr_ty, value_ty); return self.finishAir(inst, .dead, .{ bin_op.lhs, bin_op.rhs, .none }); } fn airStructFieldPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.StructField, ty_pl.payload).data; const result = try self.structFieldPtr(inst, extra.struct_operand, extra.field_index); return self.finishAir(inst, result, .{ extra.struct_operand, .none, .none }); } fn airStructFieldPtrIndex(self: *Self, inst: Air.Inst.Index, index: u8) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result = try self.structFieldPtr(inst, ty_op.operand, index); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn structFieldPtr(self: *Self, inst: Air.Inst.Index, operand: Air.Inst.Ref, index: u32) !MCValue { return if (self.liveness.isUnused(inst)) .dead else result: { const mcv = try self.resolveInst(operand); const ptr_ty = self.air.typeOf(operand); const struct_ty = ptr_ty.childType(); const struct_field_offset = @intCast(u32, struct_ty.structFieldOffset(index, self.target.*)); switch (mcv) { .ptr_stack_offset => |off| { break :result MCValue{ .ptr_stack_offset = off - struct_field_offset }; }, else => { const lhs_bind: ReadArg.Bind = .{ .mcv = mcv }; const rhs_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = struct_field_offset } }; break :result try self.addSub(.add, lhs_bind, rhs_bind, Type.usize, Type.usize, null); }, } }; } fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.StructField, ty_pl.payload).data; const operand = extra.struct_operand; const index = extra.field_index; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const mcv = try self.resolveInst(operand); const struct_ty = self.air.typeOf(operand); const struct_field_ty = struct_ty.structFieldType(index); const struct_field_offset = @intCast(u32, struct_ty.structFieldOffset(index, self.target.*)); switch (mcv) { .dead, .unreach => unreachable, .stack_argument_offset => |off| { break :result MCValue{ .stack_argument_offset = off + struct_field_offset }; }, .stack_offset => |off| { break :result MCValue{ .stack_offset = off - struct_field_offset }; }, .memory => |addr| { break :result MCValue{ .memory = addr + struct_field_offset }; }, .register_with_overflow => |rwo| { const reg_lock = self.register_manager.lockRegAssumeUnused(rwo.reg); defer self.register_manager.unlockReg(reg_lock); const field: MCValue = switch (index) { // get wrapped value: return register 0 => MCValue{ .register = rwo.reg }, // get overflow bit: return C or V flag 1 => MCValue{ .compare_flags = rwo.flag }, else => unreachable, }; if (self.reuseOperand(inst, operand, 0, field)) { break :result field; } else { // Copy to new register const raw_dest_reg = try self.register_manager.allocReg(null, gp); const dest_reg = self.registerAlias(raw_dest_reg, struct_field_ty); try self.genSetReg(struct_field_ty, dest_reg, field); break :result MCValue{ .register = dest_reg }; } }, else => return self.fail("TODO implement codegen struct_field_val for {}", .{mcv}), } }; return self.finishAir(inst, result, .{ extra.struct_operand, .none, .none }); } fn airFieldParentPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.FieldParentPtr, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const field_ptr = try self.resolveInst(extra.field_ptr); const struct_ty = self.air.getRefType(ty_pl.ty).childType(); const struct_field_offset = @intCast(u32, struct_ty.structFieldOffset(extra.field_index, self.target.*)); switch (field_ptr) { .ptr_stack_offset => |off| { break :result MCValue{ .ptr_stack_offset = off + struct_field_offset }; }, else => { const lhs_bind: ReadArg.Bind = .{ .mcv = field_ptr }; const rhs_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = struct_field_offset } }; break :result try self.addSub(.sub, lhs_bind, rhs_bind, Type.usize, Type.usize, null); }, } }; return self.finishAir(inst, result, .{ extra.field_ptr, .none, .none }); } fn airArg(self: *Self, inst: Air.Inst.Index) !void { // skip zero-bit arguments as they don't have a corresponding arg instruction var arg_index = self.arg_index; while (self.args[arg_index] == .none) arg_index += 1; self.arg_index = arg_index + 1; const ty = self.air.typeOfIndex(inst); const tag = self.air.instructions.items(.tag)[inst]; const src_index = self.air.instructions.items(.data)[inst].arg.src_index; const name = self.mod_fn.getParamName(self.bin_file.options.module.?, src_index); try self.dbg_info_relocs.append(self.gpa, .{ .tag = tag, .ty = ty, .name = name, .mcv = self.args[arg_index], }); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else self.args[arg_index]; return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airTrap(self: *Self) !void { _ = try self.addInst(.{ .tag = .brk, .data = .{ .imm16 = 0x0001 }, }); return self.finishAirBookkeeping(); } fn airBreakpoint(self: *Self) !void { _ = try self.addInst(.{ .tag = .brk, .data = .{ .imm16 = 0xf000 }, }); return self.finishAirBookkeeping(); } fn airRetAddr(self: *Self, inst: Air.Inst.Index) !void { const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airRetAddr for aarch64", .{}); return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airFrameAddress(self: *Self, inst: Air.Inst.Index) !void { const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFrameAddress for aarch64", .{}); return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airFence(self: *Self) !void { return self.fail("TODO implement fence() for {}", .{self.target.cpu.arch}); //return self.finishAirBookkeeping(); } fn airCall(self: *Self, inst: Air.Inst.Index, modifier: std.builtin.CallModifier) !void { if (modifier == .always_tail) return self.fail("TODO implement tail calls for aarch64", .{}); const pl_op = self.air.instructions.items(.data)[inst].pl_op; const callee = pl_op.operand; const extra = self.air.extraData(Air.Call, pl_op.payload); const args = @ptrCast([]const Air.Inst.Ref, self.air.extra[extra.end..][0..extra.data.args_len]); const ty = self.air.typeOf(callee); const fn_ty = switch (ty.zigTypeTag()) { .Fn => ty, .Pointer => ty.childType(), else => unreachable, }; var info = try self.resolveCallingConventionValues(fn_ty); defer info.deinit(self); // According to the Procedure Call Standard for the ARM // Architecture, compare flags are not preserved across // calls. Therefore, if some value is currently stored there, we // need to save it. // // TODO once caller-saved registers are implemented, save them // here too, but crucially *after* we save the compare flags as // saving compare flags may require a new caller-saved register try self.spillCompareFlagsIfOccupied(); if (info.return_value == .stack_offset) { log.debug("airCall: return by reference", .{}); const ret_ty = fn_ty.fnReturnType(); const ret_abi_size = @intCast(u32, ret_ty.abiSize(self.target.*)); const ret_abi_align = @intCast(u32, ret_ty.abiAlignment(self.target.*)); const stack_offset = try self.allocMem(ret_abi_size, ret_abi_align, inst); const ret_ptr_reg = self.registerAlias(.x0, Type.usize); var ptr_ty_payload: Type.Payload.ElemType = .{ .base = .{ .tag = .single_mut_pointer }, .data = ret_ty, }; const ptr_ty = Type.initPayload(&ptr_ty_payload.base); try self.register_manager.getReg(ret_ptr_reg, null); try self.genSetReg(ptr_ty, ret_ptr_reg, .{ .ptr_stack_offset = stack_offset }); info.return_value = .{ .stack_offset = stack_offset }; } // Make space for the arguments passed via the stack self.max_end_stack += info.stack_byte_count; for (info.args, 0..) |mc_arg, arg_i| { const arg = args[arg_i]; const arg_ty = self.air.typeOf(arg); const arg_mcv = try self.resolveInst(args[arg_i]); switch (mc_arg) { .none => continue, .register => |reg| { try self.register_manager.getReg(reg, null); try self.genSetReg(arg_ty, reg, arg_mcv); }, .stack_offset => unreachable, .stack_argument_offset => |offset| try self.genSetStackArgument( arg_ty, offset, arg_mcv, ), else => unreachable, } } // Due to incremental compilation, how function calls are generated depends // on linking. const mod = self.bin_file.options.module.?; if (self.air.value(callee)) |func_value| { if (func_value.castTag(.function)) |func_payload| { const func = func_payload.data; if (self.bin_file.cast(link.File.Elf)) |elf_file| { const atom_index = try elf_file.getOrCreateAtomForDecl(func.owner_decl); const atom = elf_file.getAtom(atom_index); const got_addr = @intCast(u32, atom.getOffsetTableAddress(elf_file)); try self.genSetReg(Type.initTag(.usize), .x30, .{ .memory = got_addr }); } else if (self.bin_file.cast(link.File.MachO)) |macho_file| { const atom = try macho_file.getOrCreateAtomForDecl(func.owner_decl); const sym_index = macho_file.getAtom(atom).getSymbolIndex().?; try self.genSetReg(Type.initTag(.u64), .x30, .{ .linker_load = .{ .type = .got, .sym_index = sym_index, }, }); } else if (self.bin_file.cast(link.File.Coff)) |coff_file| { const atom = try coff_file.getOrCreateAtomForDecl(func.owner_decl); const sym_index = coff_file.getAtom(atom).getSymbolIndex().?; try self.genSetReg(Type.initTag(.u64), .x30, .{ .linker_load = .{ .type = .got, .sym_index = sym_index, }, }); } else if (self.bin_file.cast(link.File.Plan9)) |p9| { const decl_block_index = try p9.seeDecl(func.owner_decl); const decl_block = p9.getDeclBlock(decl_block_index); const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes: u64 = @divExact(ptr_bits, 8); const got_addr = p9.bases.data; const got_index = decl_block.got_index.?; const fn_got_addr = got_addr + got_index * ptr_bytes; try self.genSetReg(Type.initTag(.usize), .x30, .{ .memory = fn_got_addr }); } else unreachable; _ = try self.addInst(.{ .tag = .blr, .data = .{ .reg = .x30 }, }); } else if (func_value.castTag(.extern_fn)) |func_payload| { const extern_fn = func_payload.data; const decl_name = mem.sliceTo(mod.declPtr(extern_fn.owner_decl).name, 0); const lib_name = mem.sliceTo(extern_fn.lib_name, 0); if (self.bin_file.cast(link.File.MachO)) |macho_file| { const sym_index = try macho_file.getGlobalSymbol(decl_name, lib_name); const atom = try macho_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); const atom_index = macho_file.getAtom(atom).getSymbolIndex().?; _ = try self.addInst(.{ .tag = .call_extern, .data = .{ .relocation = .{ .atom_index = atom_index, .sym_index = sym_index, }, }, }); } else if (self.bin_file.cast(link.File.Coff)) |coff_file| { const sym_index = try coff_file.getGlobalSymbol(decl_name, lib_name); try self.genSetReg(Type.initTag(.u64), .x30, .{ .linker_load = .{ .type = .import, .sym_index = sym_index, }, }); _ = try self.addInst(.{ .tag = .blr, .data = .{ .reg = .x30 }, }); } else { return self.fail("TODO implement calling extern functions", .{}); } } else { return self.fail("TODO implement calling bitcasted functions", .{}); } } else { assert(ty.zigTypeTag() == .Pointer); const mcv = try self.resolveInst(callee); try self.genSetReg(ty, .x30, mcv); _ = try self.addInst(.{ .tag = .blr, .data = .{ .reg = .x30 }, }); } const result: MCValue = result: { switch (info.return_value) { .register => |reg| { if (RegisterManager.indexOfReg(&callee_preserved_regs, reg) == null) { // Save function return value in a callee saved register break :result try self.copyToNewRegister(inst, info.return_value); } }, else => {}, } break :result info.return_value; }; if (args.len + 1 <= Liveness.bpi - 1) { var buf = [1]Air.Inst.Ref{.none} ** (Liveness.bpi - 1); buf[0] = callee; std.mem.copy(Air.Inst.Ref, buf[1..], args); return self.finishAir(inst, result, buf); } var bt = try self.iterateBigTomb(inst, 1 + args.len); bt.feed(callee); for (args) |arg| { bt.feed(arg); } return bt.finishAir(result); } fn airRet(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const operand = try self.resolveInst(un_op); const ret_ty = self.fn_type.fnReturnType(); switch (self.ret_mcv) { .none => {}, .immediate => { assert(ret_ty.isError()); }, .register => |reg| { // Return result by value try self.genSetReg(ret_ty, reg, operand); }, .stack_offset => { // Return result by reference // // self.ret_mcv is an address to where this function // should store its result into var ptr_ty_payload: Type.Payload.ElemType = .{ .base = .{ .tag = .single_mut_pointer }, .data = ret_ty, }; const ptr_ty = Type.initPayload(&ptr_ty_payload.base); try self.store(self.ret_mcv, operand, ptr_ty, ret_ty); }, else => unreachable, } // Just add space for an instruction, patch this later try self.exitlude_jump_relocs.append(self.gpa, try self.addNop()); return self.finishAir(inst, .dead, .{ un_op, .none, .none }); } fn airRetLoad(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const ptr = try self.resolveInst(un_op); const ptr_ty = self.air.typeOf(un_op); const ret_ty = self.fn_type.fnReturnType(); switch (self.ret_mcv) { .none => {}, .register => { // Return result by value try self.load(self.ret_mcv, ptr, ptr_ty); }, .stack_offset => { // Return result by reference // // self.ret_mcv is an address to where this function // should store its result into // // If the operand is a ret_ptr instruction, we are done // here. Else we need to load the result from the location // pointed to by the operand and store it to the result // location. const op_inst = Air.refToIndex(un_op).?; if (self.air.instructions.items(.tag)[op_inst] != .ret_ptr) { const abi_size = @intCast(u32, ret_ty.abiSize(self.target.*)); const abi_align = ret_ty.abiAlignment(self.target.*); const offset = try self.allocMem(abi_size, abi_align, null); const tmp_mcv = MCValue{ .stack_offset = offset }; try self.load(tmp_mcv, ptr, ptr_ty); try self.store(self.ret_mcv, tmp_mcv, ptr_ty, ret_ty); } }, else => unreachable, // invalid return result } try self.exitlude_jump_relocs.append(self.gpa, try self.addNop()); return self.finishAir(inst, .dead, .{ un_op, .none, .none }); } fn airCmp(self: *Self, inst: Air.Inst.Index, op: math.CompareOperator) !void { const bin_op = self.air.instructions.items(.data)[inst].bin_op; const lhs_ty = self.air.typeOf(bin_op.lhs); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else blk: { break :blk try self.cmp(.{ .inst = bin_op.lhs }, .{ .inst = bin_op.rhs }, lhs_ty, op); }; return self.finishAir(inst, result, .{ bin_op.lhs, bin_op.rhs, .none }); } fn cmp( self: *Self, lhs: ReadArg.Bind, rhs: ReadArg.Bind, lhs_ty: Type, op: math.CompareOperator, ) !MCValue { var int_buffer: Type.Payload.Bits = undefined; const int_ty = switch (lhs_ty.zigTypeTag()) { .Optional => blk: { var opt_buffer: Type.Payload.ElemType = undefined; const payload_ty = lhs_ty.optionalChild(&opt_buffer); if (!payload_ty.hasRuntimeBitsIgnoreComptime()) { break :blk Type.initTag(.u1); } else if (lhs_ty.isPtrLikeOptional()) { break :blk Type.usize; } else { return self.fail("TODO ARM cmp non-pointer optionals", .{}); } }, .Float => return self.fail("TODO ARM cmp floats", .{}), .Enum => lhs_ty.intTagType(&int_buffer), .Int => lhs_ty, .Bool => Type.initTag(.u1), .Pointer => Type.usize, .ErrorSet => Type.initTag(.u16), else => unreachable, }; const int_info = int_ty.intInfo(self.target.*); if (int_info.bits <= 64) { try self.spillCompareFlagsIfOccupied(); var lhs_reg: Register = undefined; var rhs_reg: Register = undefined; const rhs_immediate = try rhs.resolveToImmediate(self); const rhs_immediate_ok = if (rhs_immediate) |imm| imm <= std.math.maxInt(u12) else false; if (rhs_immediate_ok) { const read_args = [_]ReadArg{ .{ .ty = int_ty, .bind = lhs, .class = gp, .reg = &lhs_reg }, }; try self.allocRegs( &read_args, &.{}, null, // we won't be able to reuse a register as there are no write_regs ); _ = try self.addInst(.{ .tag = .cmp_immediate, .data = .{ .r_imm12_sh = .{ .rn = lhs_reg, .imm12 = @intCast(u12, rhs_immediate.?), } }, }); } else { const read_args = [_]ReadArg{ .{ .ty = int_ty, .bind = lhs, .class = gp, .reg = &lhs_reg }, .{ .ty = int_ty, .bind = rhs, .class = gp, .reg = &rhs_reg }, }; try self.allocRegs( &read_args, &.{}, null, // we won't be able to reuse a register as there are no write_regs ); _ = try self.addInst(.{ .tag = .cmp_shifted_register, .data = .{ .rr_imm6_shift = .{ .rn = lhs_reg, .rm = rhs_reg, .imm6 = 0, .shift = .lsl, } }, }); } return switch (int_info.signedness) { .signed => MCValue{ .compare_flags = Condition.fromCompareOperatorSigned(op) }, .unsigned => MCValue{ .compare_flags = Condition.fromCompareOperatorUnsigned(op) }, }; } else { return self.fail("TODO AArch64 cmp for ints > 64 bits", .{}); } } fn airCmpVector(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airCmpVector for {}", .{self.target.cpu.arch}); } fn airCmpLtErrorsLen(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const operand = try self.resolveInst(un_op); _ = operand; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airCmpLtErrorsLen for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airDbgStmt(self: *Self, inst: Air.Inst.Index) !void { const dbg_stmt = self.air.instructions.items(.data)[inst].dbg_stmt; _ = try self.addInst(.{ .tag = .dbg_line, .data = .{ .dbg_line_column = .{ .line = dbg_stmt.line, .column = dbg_stmt.column, } }, }); return self.finishAirBookkeeping(); } fn airDbgInline(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const function = self.air.values[ty_pl.payload].castTag(.function).?.data; // TODO emit debug info for function change _ = function; return self.finishAir(inst, .dead, .{ .none, .none, .none }); } fn airDbgBlock(self: *Self, inst: Air.Inst.Index) !void { // TODO emit debug info lexical block return self.finishAir(inst, .dead, .{ .none, .none, .none }); } fn airDbgVar(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const operand = pl_op.operand; const tag = self.air.instructions.items(.tag)[inst]; const ty = self.air.typeOf(operand); const mcv = try self.resolveInst(operand); const name = self.air.nullTerminatedString(pl_op.payload); log.debug("airDbgVar: %{d}: {}, {}", .{ inst, ty.fmtDebug(), mcv }); try self.dbg_info_relocs.append(self.gpa, .{ .tag = tag, .ty = ty, .name = name, .mcv = mcv, }); return self.finishAir(inst, .dead, .{ operand, .none, .none }); } fn condBr(self: *Self, condition: MCValue) !Mir.Inst.Index { switch (condition) { .compare_flags => |cond| return try self.addInst(.{ .tag = .b_cond, .data = .{ .inst_cond = .{ .inst = undefined, // populated later through performReloc // Here we map to the opposite condition because the jump is to the false branch. .cond = cond.negate(), }, }, }), else => { const reg = switch (condition) { .register => |r| r, else => try self.copyToTmpRegister(Type.bool, condition), }; return try self.addInst(.{ .tag = .cbz, .data = .{ .r_inst = .{ .rt = reg, .inst = undefined, // populated later through performReloc }, }, }); }, } } fn airCondBr(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const cond = try self.resolveInst(pl_op.operand); const extra = self.air.extraData(Air.CondBr, pl_op.payload); const then_body = self.air.extra[extra.end..][0..extra.data.then_body_len]; const else_body = self.air.extra[extra.end + then_body.len ..][0..extra.data.else_body_len]; const liveness_condbr = self.liveness.getCondBr(inst); const reloc = try self.condBr(cond); // If the condition dies here in this condbr instruction, process // that death now instead of later as this has an effect on // whether it needs to be spilled in the branches if (self.liveness.operandDies(inst, 0)) { const op_int = @enumToInt(pl_op.operand); if (op_int >= Air.Inst.Ref.typed_value_map.len) { const op_index = @intCast(Air.Inst.Index, op_int - Air.Inst.Ref.typed_value_map.len); self.processDeath(op_index); } } // Capture the state of register and stack allocation state so that we can revert to it. const parent_next_stack_offset = self.next_stack_offset; const parent_free_registers = self.register_manager.free_registers; var parent_stack = try self.stack.clone(self.gpa); defer parent_stack.deinit(self.gpa); const parent_registers = self.register_manager.registers; const parent_compare_flags_inst = self.compare_flags_inst; try self.branch_stack.append(.{}); errdefer { _ = self.branch_stack.pop(); } try self.ensureProcessDeathCapacity(liveness_condbr.then_deaths.len); for (liveness_condbr.then_deaths) |operand| { self.processDeath(operand); } try self.genBody(then_body); // Revert to the previous register and stack allocation state. var saved_then_branch = self.branch_stack.pop(); defer saved_then_branch.deinit(self.gpa); self.register_manager.registers = parent_registers; self.compare_flags_inst = parent_compare_flags_inst; self.stack.deinit(self.gpa); self.stack = parent_stack; parent_stack = .{}; self.next_stack_offset = parent_next_stack_offset; self.register_manager.free_registers = parent_free_registers; try self.performReloc(reloc); const else_branch = self.branch_stack.addOneAssumeCapacity(); else_branch.* = .{}; try self.ensureProcessDeathCapacity(liveness_condbr.else_deaths.len); for (liveness_condbr.else_deaths) |operand| { self.processDeath(operand); } try self.genBody(else_body); // At this point, each branch will possibly have conflicting values for where // each instruction is stored. They agree, however, on which instructions are alive/dead. // We use the first ("then") branch as canonical, and here emit // instructions into the second ("else") branch to make it conform. // We continue respect the data structure semantic guarantees of the else_branch so // that we can use all the code emitting abstractions. This is why at the bottom we // assert that parent_branch.free_registers equals the saved_then_branch.free_registers // rather than assigning it. const parent_branch = &self.branch_stack.items[self.branch_stack.items.len - 2]; try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, else_branch.inst_table.count()); const else_slice = else_branch.inst_table.entries.slice(); const else_keys = else_slice.items(.key); const else_values = else_slice.items(.value); for (else_keys, 0..) |else_key, else_idx| { const else_value = else_values[else_idx]; const canon_mcv = if (saved_then_branch.inst_table.fetchSwapRemove(else_key)) |then_entry| blk: { // The instruction's MCValue is overridden in both branches. parent_branch.inst_table.putAssumeCapacity(else_key, then_entry.value); if (else_value == .dead) { assert(then_entry.value == .dead); continue; } break :blk then_entry.value; } else blk: { if (else_value == .dead) continue; // The instruction is only overridden in the else branch. var i: usize = self.branch_stack.items.len - 1; while (true) { i -= 1; // If this overflows, the question is: why wasn't the instruction marked dead? if (self.branch_stack.items[i].inst_table.get(else_key)) |mcv| { assert(mcv != .dead); break :blk mcv; } } }; log.debug("consolidating else_entry {d} {}=>{}", .{ else_key, else_value, canon_mcv }); // TODO make sure the destination stack offset / register does not already have something // going on there. try self.setRegOrMem(self.air.typeOfIndex(else_key), canon_mcv, else_value); // TODO track the new register / stack allocation } try parent_branch.inst_table.ensureUnusedCapacity(self.gpa, saved_then_branch.inst_table.count()); const then_slice = saved_then_branch.inst_table.entries.slice(); const then_keys = then_slice.items(.key); const then_values = then_slice.items(.value); for (then_keys, 0..) |then_key, then_idx| { const then_value = then_values[then_idx]; // We already deleted the items from this table that matched the else_branch. // So these are all instructions that are only overridden in the then branch. parent_branch.inst_table.putAssumeCapacity(then_key, then_value); if (then_value == .dead) continue; const parent_mcv = blk: { var i: usize = self.branch_stack.items.len - 1; while (true) { i -= 1; if (self.branch_stack.items[i].inst_table.get(then_key)) |mcv| { assert(mcv != .dead); break :blk mcv; } } }; log.debug("consolidating then_entry {d} {}=>{}", .{ then_key, parent_mcv, then_value }); // TODO make sure the destination stack offset / register does not already have something // going on there. try self.setRegOrMem(self.air.typeOfIndex(then_key), parent_mcv, then_value); // TODO track the new register / stack allocation } { var item = self.branch_stack.pop(); item.deinit(self.gpa); } // We already took care of pl_op.operand earlier, so we're going // to pass .none here return self.finishAir(inst, .unreach, .{ .none, .none, .none }); } fn isNull(self: *Self, operand_bind: ReadArg.Bind, operand_ty: Type) !MCValue { const sentinel: struct { ty: Type, bind: ReadArg.Bind } = if (!operand_ty.isPtrLikeOptional()) blk: { var buf: Type.Payload.ElemType = undefined; const payload_ty = operand_ty.optionalChild(&buf); if (!payload_ty.hasRuntimeBitsIgnoreComptime()) break :blk .{ .ty = operand_ty, .bind = operand_bind }; const offset = @intCast(u32, payload_ty.abiSize(self.target.*)); const operand_mcv = try operand_bind.resolveToMcv(self); const new_mcv: MCValue = switch (operand_mcv) { .register => |source_reg| new: { // TODO should we reuse the operand here? const raw_reg = try self.register_manager.allocReg(null, gp); const dest_reg = raw_reg.toX(); const shift = @intCast(u6, offset * 8); if (shift == 0) { try self.genSetReg(payload_ty, dest_reg, operand_mcv); } else { _ = try self.addInst(.{ .tag = if (payload_ty.isSignedInt()) Mir.Inst.Tag.asr_immediate else Mir.Inst.Tag.lsr_immediate, .data = .{ .rr_shift = .{ .rd = dest_reg, .rn = source_reg.toX(), .shift = shift, } }, }); } break :new .{ .register = self.registerAlias(dest_reg, payload_ty) }; }, .stack_argument_offset => |off| .{ .stack_argument_offset = off + offset }, .stack_offset => |off| .{ .stack_offset = off - offset }, .memory => |addr| .{ .memory = addr + offset }, else => unreachable, // invalid MCValue for an optional }; break :blk .{ .ty = Type.bool, .bind = .{ .mcv = new_mcv } }; } else .{ .ty = operand_ty, .bind = operand_bind }; const imm_bind: ReadArg.Bind = .{ .mcv = .{ .immediate = 0 } }; return self.cmp(sentinel.bind, imm_bind, sentinel.ty, .eq); } fn isNonNull(self: *Self, operand_bind: ReadArg.Bind, operand_ty: Type) !MCValue { const is_null_res = try self.isNull(operand_bind, operand_ty); assert(is_null_res.compare_flags == .eq); return MCValue{ .compare_flags = is_null_res.compare_flags.negate() }; } fn isErr( self: *Self, error_union_bind: ReadArg.Bind, error_union_ty: Type, ) !MCValue { const error_type = error_union_ty.errorUnionSet(); if (error_type.errorSetIsEmpty()) { return MCValue{ .immediate = 0 }; // always false } const error_mcv = try self.errUnionErr(error_union_bind, error_union_ty, null); return try self.cmp(.{ .mcv = error_mcv }, .{ .mcv = .{ .immediate = 0 } }, error_type, .gt); } fn isNonErr( self: *Self, error_union_bind: ReadArg.Bind, error_union_ty: Type, ) !MCValue { const is_err_result = try self.isErr(error_union_bind, error_union_ty); switch (is_err_result) { .compare_flags => |cond| { assert(cond == .hi); return MCValue{ .compare_flags = cond.negate() }; }, .immediate => |imm| { assert(imm == 0); return MCValue{ .immediate = 1 }; }, else => unreachable, } } fn airIsNull(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand = try self.resolveInst(un_op); const operand_ty = self.air.typeOf(un_op); break :result try self.isNull(.{ .mcv = operand }, operand_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsNullPtr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand_ptr = try self.resolveInst(un_op); const ptr_ty = self.air.typeOf(un_op); const elem_ty = ptr_ty.elemType(); const operand = try self.allocRegOrMem(elem_ty, true, null); try self.load(operand, operand_ptr, ptr_ty); break :result try self.isNull(.{ .mcv = operand }, elem_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsNonNull(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand = try self.resolveInst(un_op); const operand_ty = self.air.typeOf(un_op); break :result try self.isNonNull(.{ .mcv = operand }, operand_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsNonNullPtr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand_ptr = try self.resolveInst(un_op); const ptr_ty = self.air.typeOf(un_op); const elem_ty = ptr_ty.elemType(); const operand = try self.allocRegOrMem(elem_ty, true, null); try self.load(operand, operand_ptr, ptr_ty); break :result try self.isNonNull(.{ .mcv = operand }, elem_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsErr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_bind: ReadArg.Bind = .{ .inst = un_op }; const error_union_ty = self.air.typeOf(un_op); break :result try self.isErr(error_union_bind, error_union_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsErrPtr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand_ptr = try self.resolveInst(un_op); const ptr_ty = self.air.typeOf(un_op); const elem_ty = ptr_ty.elemType(); const operand = try self.allocRegOrMem(elem_ty, true, null); try self.load(operand, operand_ptr, ptr_ty); break :result try self.isErr(.{ .mcv = operand }, elem_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsNonErr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const error_union_bind: ReadArg.Bind = .{ .inst = un_op }; const error_union_ty = self.air.typeOf(un_op); break :result try self.isNonErr(error_union_bind, error_union_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airIsNonErrPtr(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const operand_ptr = try self.resolveInst(un_op); const ptr_ty = self.air.typeOf(un_op); const elem_ty = ptr_ty.elemType(); const operand = try self.allocRegOrMem(elem_ty, true, null); try self.load(operand, operand_ptr, ptr_ty); break :result try self.isNonErr(.{ .mcv = operand }, elem_ty); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airLoop(self: *Self, inst: Air.Inst.Index) !void { // A loop is a setup to be able to jump back to the beginning. const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const loop = self.air.extraData(Air.Block, ty_pl.payload); const body = self.air.extra[loop.end..][0..loop.data.body_len]; const liveness_loop = self.liveness.getLoop(inst); const start_index = @intCast(u32, self.mir_instructions.len); try self.genBody(body); try self.jump(start_index); try self.ensureProcessDeathCapacity(liveness_loop.deaths.len); for (liveness_loop.deaths) |operand| { self.processDeath(operand); } return self.finishAirBookkeeping(); } /// Send control flow to `inst`. fn jump(self: *Self, inst: Mir.Inst.Index) !void { _ = try self.addInst(.{ .tag = .b, .data = .{ .inst = inst }, }); } fn airBlock(self: *Self, inst: Air.Inst.Index) !void { try self.blocks.putNoClobber(self.gpa, inst, .{ // A block is a setup to be able to jump to the end. .relocs = .{}, // It also acts as a receptacle for break operands. // Here we use `MCValue.none` to represent a null value so that the first // break instruction will choose a MCValue for the block result and overwrite // this field. Following break instructions will use that MCValue to put their // block results. .mcv = MCValue{ .none = {} }, }); defer self.blocks.getPtr(inst).?.relocs.deinit(self.gpa); const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Block, ty_pl.payload); const body = self.air.extra[extra.end..][0..extra.data.body_len]; try self.genBody(body); // relocations for `br` instructions const relocs = &self.blocks.getPtr(inst).?.relocs; if (relocs.items.len > 0 and relocs.items[relocs.items.len - 1] == self.mir_instructions.len - 1) { // If the last Mir instruction is the last relocation (which // would just jump one instruction further), it can be safely // removed self.mir_instructions.orderedRemove(relocs.pop()); } for (relocs.items) |reloc| { try self.performReloc(reloc); } const result = self.blocks.getPtr(inst).?.mcv; return self.finishAir(inst, result, .{ .none, .none, .none }); } fn airSwitch(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const condition_ty = self.air.typeOf(pl_op.operand); const switch_br = self.air.extraData(Air.SwitchBr, pl_op.payload); const liveness = try self.liveness.getSwitchBr( self.gpa, inst, switch_br.data.cases_len + 1, ); defer self.gpa.free(liveness.deaths); var extra_index: usize = switch_br.end; var case_i: u32 = 0; while (case_i < switch_br.data.cases_len) : (case_i += 1) { const case = self.air.extraData(Air.SwitchBr.Case, extra_index); const items = @ptrCast([]const Air.Inst.Ref, self.air.extra[case.end..][0..case.data.items_len]); assert(items.len > 0); const case_body = self.air.extra[case.end + items.len ..][0..case.data.body_len]; extra_index = case.end + items.len + case_body.len; // For every item, we compare it to condition and branch into // the prong if they are equal. After we compared to all // items, we branch into the next prong (or if no other prongs // exist out of the switch statement). // // cmp condition, item1 // beq prong // cmp condition, item2 // beq prong // cmp condition, item3 // beq prong // b out // prong: ... // ... // out: ... const branch_into_prong_relocs = try self.gpa.alloc(u32, items.len); defer self.gpa.free(branch_into_prong_relocs); for (items, 0..) |item, idx| { const cmp_result = try self.cmp(.{ .inst = pl_op.operand }, .{ .inst = item }, condition_ty, .neq); branch_into_prong_relocs[idx] = try self.condBr(cmp_result); } const branch_away_from_prong_reloc = try self.addInst(.{ .tag = .b, .data = .{ .inst = undefined }, // populated later through performReloc }); for (branch_into_prong_relocs) |reloc| { try self.performReloc(reloc); } // Capture the state of register and stack allocation state so that we can revert to it. const parent_next_stack_offset = self.next_stack_offset; const parent_free_registers = self.register_manager.free_registers; const parent_compare_flags_inst = self.compare_flags_inst; var parent_stack = try self.stack.clone(self.gpa); defer parent_stack.deinit(self.gpa); const parent_registers = self.register_manager.registers; try self.branch_stack.append(.{}); errdefer { _ = self.branch_stack.pop(); } try self.ensureProcessDeathCapacity(liveness.deaths[case_i].len); for (liveness.deaths[case_i]) |operand| { self.processDeath(operand); } try self.genBody(case_body); // Revert to the previous register and stack allocation state. var saved_case_branch = self.branch_stack.pop(); defer saved_case_branch.deinit(self.gpa); self.register_manager.registers = parent_registers; self.compare_flags_inst = parent_compare_flags_inst; self.stack.deinit(self.gpa); self.stack = parent_stack; parent_stack = .{}; self.next_stack_offset = parent_next_stack_offset; self.register_manager.free_registers = parent_free_registers; try self.performReloc(branch_away_from_prong_reloc); } if (switch_br.data.else_body_len > 0) { const else_body = self.air.extra[extra_index..][0..switch_br.data.else_body_len]; // Capture the state of register and stack allocation state so that we can revert to it. const parent_next_stack_offset = self.next_stack_offset; const parent_free_registers = self.register_manager.free_registers; const parent_compare_flags_inst = self.compare_flags_inst; var parent_stack = try self.stack.clone(self.gpa); defer parent_stack.deinit(self.gpa); const parent_registers = self.register_manager.registers; try self.branch_stack.append(.{}); errdefer { _ = self.branch_stack.pop(); } const else_deaths = liveness.deaths.len - 1; try self.ensureProcessDeathCapacity(liveness.deaths[else_deaths].len); for (liveness.deaths[else_deaths]) |operand| { self.processDeath(operand); } try self.genBody(else_body); // Revert to the previous register and stack allocation state. var saved_case_branch = self.branch_stack.pop(); defer saved_case_branch.deinit(self.gpa); self.register_manager.registers = parent_registers; self.compare_flags_inst = parent_compare_flags_inst; self.stack.deinit(self.gpa); self.stack = parent_stack; parent_stack = .{}; self.next_stack_offset = parent_next_stack_offset; self.register_manager.free_registers = parent_free_registers; // TODO consolidate returned MCValues between prongs and else branch like we do // in airCondBr. } return self.finishAir(inst, .unreach, .{ pl_op.operand, .none, .none }); } fn performReloc(self: *Self, inst: Mir.Inst.Index) !void { const tag = self.mir_instructions.items(.tag)[inst]; switch (tag) { .cbz => self.mir_instructions.items(.data)[inst].r_inst.inst = @intCast(Mir.Inst.Index, self.mir_instructions.len), .b_cond => self.mir_instructions.items(.data)[inst].inst_cond.inst = @intCast(Mir.Inst.Index, self.mir_instructions.len), .b => self.mir_instructions.items(.data)[inst].inst = @intCast(Mir.Inst.Index, self.mir_instructions.len), else => unreachable, } } fn airBr(self: *Self, inst: Air.Inst.Index) !void { const branch = self.air.instructions.items(.data)[inst].br; try self.br(branch.block_inst, branch.operand); return self.finishAir(inst, .dead, .{ branch.operand, .none, .none }); } fn br(self: *Self, block: Air.Inst.Index, operand: Air.Inst.Ref) !void { const block_data = self.blocks.getPtr(block).?; if (self.air.typeOf(operand).hasRuntimeBits()) { const operand_mcv = try self.resolveInst(operand); const block_mcv = block_data.mcv; if (block_mcv == .none) { block_data.mcv = switch (operand_mcv) { .none, .dead, .unreach => unreachable, .register, .stack_offset, .memory => operand_mcv, .immediate, .stack_argument_offset, .compare_flags => blk: { const new_mcv = try self.allocRegOrMem(self.air.typeOfIndex(block), true, block); try self.setRegOrMem(self.air.typeOfIndex(block), new_mcv, operand_mcv); break :blk new_mcv; }, else => return self.fail("TODO implement block_data.mcv = operand_mcv for {}", .{operand_mcv}), }; } else { try self.setRegOrMem(self.air.typeOfIndex(block), block_mcv, operand_mcv); } } return self.brVoid(block); } fn brVoid(self: *Self, block: Air.Inst.Index) !void { const block_data = self.blocks.getPtr(block).?; // Emit a jump with a relocation. It will be patched up after the block ends. try block_data.relocs.ensureUnusedCapacity(self.gpa, 1); block_data.relocs.appendAssumeCapacity(try self.addInst(.{ .tag = .b, .data = .{ .inst = undefined }, // populated later through performReloc })); } fn airAsm(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Asm, ty_pl.payload); const is_volatile = @truncate(u1, extra.data.flags >> 31) != 0; const clobbers_len = @truncate(u31, extra.data.flags); var extra_i: usize = extra.end; const outputs = @ptrCast([]const Air.Inst.Ref, self.air.extra[extra_i..][0..extra.data.outputs_len]); extra_i += outputs.len; const inputs = @ptrCast([]const Air.Inst.Ref, self.air.extra[extra_i..][0..extra.data.inputs_len]); extra_i += inputs.len; const dead = !is_volatile and self.liveness.isUnused(inst); const result: MCValue = if (dead) .dead else result: { if (outputs.len > 1) { return self.fail("TODO implement codegen for asm with more than 1 output", .{}); } const output_constraint: ?[]const u8 = for (outputs) |output| { if (output != .none) { return self.fail("TODO implement codegen for non-expr asm", .{}); } const extra_bytes = std.mem.sliceAsBytes(self.air.extra[extra_i..]); const constraint = std.mem.sliceTo(std.mem.sliceAsBytes(self.air.extra[extra_i..]), 0); const name = std.mem.sliceTo(extra_bytes[constraint.len + 1 ..], 0); // This equation accounts for the fact that even if we have exactly 4 bytes // for the string, we still use the next u32 for the null terminator. extra_i += (constraint.len + name.len + (2 + 3)) / 4; break constraint; } else null; for (inputs) |input| { const input_bytes = std.mem.sliceAsBytes(self.air.extra[extra_i..]); const constraint = std.mem.sliceTo(input_bytes, 0); const name = std.mem.sliceTo(input_bytes[constraint.len + 1 ..], 0); // This equation accounts for the fact that even if we have exactly 4 bytes // for the string, we still use the next u32 for the null terminator. extra_i += (constraint.len + name.len + (2 + 3)) / 4; if (constraint.len < 3 or constraint[0] != '{' or constraint[constraint.len - 1] != '}') { return self.fail("unrecognized asm input constraint: '{s}'", .{constraint}); } const reg_name = constraint[1 .. constraint.len - 1]; const reg = parseRegName(reg_name) orelse return self.fail("unrecognized register: '{s}'", .{reg_name}); const arg_mcv = try self.resolveInst(input); try self.register_manager.getReg(reg, null); try self.genSetReg(self.air.typeOf(input), reg, arg_mcv); } { var clobber_i: u32 = 0; while (clobber_i < clobbers_len) : (clobber_i += 1) { const clobber = std.mem.sliceTo(std.mem.sliceAsBytes(self.air.extra[extra_i..]), 0); // This equation accounts for the fact that even if we have exactly 4 bytes // for the string, we still use the next u32 for the null terminator. extra_i += clobber.len / 4 + 1; // TODO honor these } } const asm_source = std.mem.sliceAsBytes(self.air.extra[extra_i..])[0..extra.data.source_len]; if (mem.eql(u8, asm_source, "svc #0")) { _ = try self.addInst(.{ .tag = .svc, .data = .{ .imm16 = 0x0 }, }); } else if (mem.eql(u8, asm_source, "svc #0x80")) { _ = try self.addInst(.{ .tag = .svc, .data = .{ .imm16 = 0x80 }, }); } else { return self.fail("TODO implement support for more aarch64 assembly instructions", .{}); } if (output_constraint) |output| { if (output.len < 4 or output[0] != '=' or output[1] != '{' or output[output.len - 1] != '}') { return self.fail("unrecognized asm output constraint: '{s}'", .{output}); } const reg_name = output[2 .. output.len - 1]; const reg = parseRegName(reg_name) orelse return self.fail("unrecognized register: '{s}'", .{reg_name}); break :result MCValue{ .register = reg }; } else { break :result MCValue{ .none = {} }; } }; simple: { var buf = [1]Air.Inst.Ref{.none} ** (Liveness.bpi - 1); var buf_index: usize = 0; for (outputs) |output| { if (output == .none) continue; if (buf_index >= buf.len) break :simple; buf[buf_index] = output; buf_index += 1; } if (buf_index + inputs.len > buf.len) break :simple; std.mem.copy(Air.Inst.Ref, buf[buf_index..], inputs); return self.finishAir(inst, result, buf); } var bt = try self.iterateBigTomb(inst, outputs.len + inputs.len); for (outputs) |output| { if (output == .none) continue; bt.feed(output); } for (inputs) |input| { bt.feed(input); } return bt.finishAir(result); } fn iterateBigTomb(self: *Self, inst: Air.Inst.Index, operand_count: usize) !BigTomb { try self.ensureProcessDeathCapacity(operand_count + 1); return BigTomb{ .function = self, .inst = inst, .lbt = self.liveness.iterateBigTomb(inst), }; } /// Sets the value without any modifications to register allocation metadata or stack allocation metadata. fn setRegOrMem(self: *Self, ty: Type, loc: MCValue, val: MCValue) !void { switch (loc) { .none => return, .register => |reg| return self.genSetReg(ty, reg, val), .stack_offset => |off| return self.genSetStack(ty, off, val), .memory => { return self.fail("TODO implement setRegOrMem for memory", .{}); }, else => unreachable, } } fn genSetStack(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { const abi_size = @intCast(u32, ty.abiSize(self.target.*)); switch (mcv) { .dead => unreachable, .unreach, .none => return, // Nothing to do. .undef => { if (!self.wantSafety()) return; // The already existing value will do just fine. // TODO Upgrade this to a memset call when we have that available. switch (abi_size) { 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), else => try self.genInlineMemset( .{ .ptr_stack_offset = stack_offset }, .{ .immediate = 0xaa }, .{ .immediate = abi_size }, ), } }, .compare_flags, .immediate, .ptr_stack_offset, => { const reg = try self.copyToTmpRegister(ty, mcv); return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); }, .register => |reg| { switch (abi_size) { 1, 2, 4, 8 => { assert(std.mem.isAlignedGeneric(u32, stack_offset, abi_size)); const tag: Mir.Inst.Tag = switch (abi_size) { 1 => .strb_stack, 2 => .strh_stack, 4, 8 => .str_stack, else => unreachable, // unexpected abi size }; const rt = self.registerAlias(reg, ty); _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_stack = .{ .rt = rt, .offset = stack_offset, } }, }); }, else => return self.fail("TODO implement storing other types abi_size={}", .{abi_size}), } }, .register_with_overflow => |rwo| { const reg_lock = self.register_manager.lockReg(rwo.reg); defer if (reg_lock) |locked_reg| self.register_manager.unlockReg(locked_reg); const wrapped_ty = ty.structFieldType(0); try self.genSetStack(wrapped_ty, stack_offset, .{ .register = rwo.reg }); const overflow_bit_ty = ty.structFieldType(1); const overflow_bit_offset = @intCast(u32, ty.structFieldOffset(1, self.target.*)); const raw_cond_reg = try self.register_manager.allocReg(null, gp); const cond_reg = self.registerAlias(raw_cond_reg, overflow_bit_ty); _ = try self.addInst(.{ .tag = .cset, .data = .{ .r_cond = .{ .rd = cond_reg, .cond = rwo.flag, } }, }); try self.genSetStack(overflow_bit_ty, stack_offset - overflow_bit_offset, .{ .register = cond_reg, }); }, .linker_load, .memory, .stack_argument_offset, .stack_offset, => { switch (mcv) { .stack_offset => |off| { if (stack_offset == off) return; // Copy stack variable to itself; nothing to do. }, else => {}, } if (abi_size <= 8) { const reg = try self.copyToTmpRegister(ty, mcv); return self.genSetStack(ty, stack_offset, MCValue{ .register = reg }); } else { var ptr_ty_payload: Type.Payload.ElemType = .{ .base = .{ .tag = .single_mut_pointer }, .data = ty, }; const ptr_ty = Type.initPayload(&ptr_ty_payload.base); // TODO call extern memcpy const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); const regs_locks = self.register_manager.lockRegsAssumeUnused(5, regs); defer for (regs_locks) |reg| { self.register_manager.unlockReg(reg); }; const src_reg = regs[0]; const dst_reg = regs[1]; const len_reg = regs[2]; const count_reg = regs[3]; const tmp_reg = regs[4]; switch (mcv) { .stack_offset => |off| { // sub src_reg, fp, #off try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); }, .stack_argument_offset => |off| { _ = try self.addInst(.{ .tag = .ldr_ptr_stack_argument, .data = .{ .load_store_stack = .{ .rt = src_reg, .offset = off, } }, }); }, .memory => |addr| try self.genSetReg(Type.usize, src_reg, .{ .immediate = addr }), .linker_load => |load_struct| { const tag: Mir.Inst.Tag = switch (load_struct.type) { .got => .load_memory_ptr_got, .direct => .load_memory_ptr_direct, .import => unreachable, }; const atom_index = switch (self.bin_file.tag) { .macho => blk: { const macho_file = self.bin_file.cast(link.File.MachO).?; const atom = try macho_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk macho_file.getAtom(atom).getSymbolIndex().?; }, .coff => blk: { const coff_file = self.bin_file.cast(link.File.Coff).?; const atom = try coff_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk coff_file.getAtom(atom).getSymbolIndex().?; }, else => unreachable, // unsupported target format }; _ = try self.addInst(.{ .tag = tag, .data = .{ .payload = try self.addExtra(Mir.LoadMemoryPie{ .register = @enumToInt(src_reg), .atom_index = atom_index, .sym_index = load_struct.sym_index, }), }, }); }, else => unreachable, } // sub dst_reg, fp, #stack_offset try self.genSetReg(ptr_ty, dst_reg, .{ .ptr_stack_offset = stack_offset }); // mov len, #abi_size try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); // memcpy(src, dst, len) try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); } }, } } fn genSetReg(self: *Self, ty: Type, reg: Register, mcv: MCValue) InnerError!void { switch (mcv) { .dead => unreachable, .unreach, .none => return, // Nothing to do. .undef => { if (!self.wantSafety()) return; // The already existing value will do just fine. // Write the debug undefined value. switch (reg.size()) { 32 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaa }), 64 => return self.genSetReg(ty, reg, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), else => unreachable, // unexpected register size } }, .ptr_stack_offset => |off| { _ = try self.addInst(.{ .tag = .ldr_ptr_stack, .data = .{ .load_store_stack = .{ .rt = reg, .offset = @intCast(u32, off), } }, }); }, .compare_flags => |condition| { _ = try self.addInst(.{ .tag = .cset, .data = .{ .r_cond = .{ .rd = reg, .cond = condition, } }, }); }, .immediate => |x| { _ = try self.addInst(.{ .tag = .movz, .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(u16, x) } }, }); if (x & 0x0000_0000_ffff_0000 != 0) { _ = try self.addInst(.{ .tag = .movk, .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(u16, x >> 16), .hw = 1 } }, }); } if (reg.size() == 64) { if (x & 0x0000_ffff_0000_0000 != 0) { _ = try self.addInst(.{ .tag = .movk, .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(u16, x >> 32), .hw = 2 } }, }); } if (x & 0xffff_0000_0000_0000 != 0) { _ = try self.addInst(.{ .tag = .movk, .data = .{ .r_imm16_sh = .{ .rd = reg, .imm16 = @truncate(u16, x >> 48), .hw = 3 } }, }); } } }, .register => |src_reg| { assert(src_reg.size() == reg.size()); // If the registers are the same, nothing to do. if (src_reg.id() == reg.id()) return; // mov reg, src_reg _ = try self.addInst(.{ .tag = .mov_register, .data = .{ .rr = .{ .rd = reg, .rn = src_reg } }, }); }, .register_with_overflow => unreachable, // doesn't fit into a register .linker_load => |load_struct| { const tag: Mir.Inst.Tag = switch (load_struct.type) { .got => .load_memory_got, .direct => .load_memory_direct, .import => .load_memory_import, }; const atom_index = switch (self.bin_file.tag) { .macho => blk: { const macho_file = self.bin_file.cast(link.File.MachO).?; const atom = try macho_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk macho_file.getAtom(atom).getSymbolIndex().?; }, .coff => blk: { const coff_file = self.bin_file.cast(link.File.Coff).?; const atom = try coff_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk coff_file.getAtom(atom).getSymbolIndex().?; }, else => unreachable, // unsupported target format }; _ = try self.addInst(.{ .tag = tag, .data = .{ .payload = try self.addExtra(Mir.LoadMemoryPie{ .register = @enumToInt(reg), .atom_index = atom_index, .sym_index = load_struct.sym_index, }), }, }); }, .memory => |addr| { // The value is in memory at a hard-coded address. // If the type is a pointer, it means the pointer address is at this memory location. try self.genSetReg(ty, reg.toX(), .{ .immediate = addr }); try self.genLdrRegister(reg, reg.toX(), ty); }, .stack_offset => |off| { const abi_size = ty.abiSize(self.target.*); switch (abi_size) { 1, 2, 4, 8 => { const tag: Mir.Inst.Tag = switch (abi_size) { 1 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsb_stack else .ldrb_stack, 2 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsh_stack else .ldrh_stack, 4, 8 => .ldr_stack, else => unreachable, // unexpected abi size }; _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_stack = .{ .rt = reg, .offset = @intCast(u32, off), } }, }); }, 3, 5, 6, 7 => return self.fail("TODO implement genSetReg types size {}", .{abi_size}), else => unreachable, } }, .stack_argument_offset => |off| { const abi_size = ty.abiSize(self.target.*); switch (abi_size) { 1, 2, 4, 8 => { const tag: Mir.Inst.Tag = switch (abi_size) { 1 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsb_stack_argument else .ldrb_stack_argument, 2 => if (ty.isSignedInt()) Mir.Inst.Tag.ldrsh_stack_argument else .ldrh_stack_argument, 4, 8 => .ldr_stack_argument, else => unreachable, // unexpected abi size }; _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_stack = .{ .rt = reg, .offset = @intCast(u32, off), } }, }); }, 3, 5, 6, 7 => return self.fail("TODO implement genSetReg types size {}", .{abi_size}), else => unreachable, } }, } } fn genSetStackArgument(self: *Self, ty: Type, stack_offset: u32, mcv: MCValue) InnerError!void { const abi_size = @intCast(u32, ty.abiSize(self.target.*)); switch (mcv) { .dead => unreachable, .none, .unreach => return, .undef => { if (!self.wantSafety()) return; // The already existing value will do just fine. // TODO Upgrade this to a memset call when we have that available. switch (ty.abiSize(self.target.*)) { 1 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaa }), 2 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaa }), 4 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaa }), 8 => return self.genSetStack(ty, stack_offset, .{ .immediate = 0xaaaaaaaaaaaaaaaa }), else => return self.fail("TODO implement memset", .{}), } }, .register => |reg| { switch (abi_size) { 1, 2, 4, 8 => { const tag: Mir.Inst.Tag = switch (abi_size) { 1 => .strb_immediate, 2 => .strh_immediate, 4, 8 => .str_immediate, else => unreachable, // unexpected abi size }; const rt = self.registerAlias(reg, ty); const offset = switch (abi_size) { 1 => blk: { if (math.cast(u12, stack_offset)) |imm| { break :blk Instruction.LoadStoreOffset.imm(imm); } else { return self.fail("TODO genSetStackArgument byte with larger offset", .{}); } }, 2 => blk: { assert(std.mem.isAlignedGeneric(u32, stack_offset, 2)); // misaligned stack entry if (math.cast(u12, @divExact(stack_offset, 2))) |imm| { break :blk Instruction.LoadStoreOffset.imm(imm); } else { return self.fail("TODO getSetStackArgument halfword with larger offset", .{}); } }, 4, 8 => blk: { const alignment = abi_size; assert(std.mem.isAlignedGeneric(u32, stack_offset, alignment)); // misaligned stack entry if (math.cast(u12, @divExact(stack_offset, alignment))) |imm| { break :blk Instruction.LoadStoreOffset.imm(imm); } else { return self.fail("TODO genSetStackArgument with larger offset", .{}); } }, else => unreachable, }; _ = try self.addInst(.{ .tag = tag, .data = .{ .load_store_register_immediate = .{ .rt = rt, .rn = .sp, .offset = offset.immediate, } }, }); }, else => return self.fail("TODO genSetStackArgument other types abi_size={}", .{abi_size}), } }, .register_with_overflow => { return self.fail("TODO implement genSetStackArgument {}", .{mcv}); }, .linker_load, .memory, .stack_argument_offset, .stack_offset, => { if (abi_size <= 4) { const reg = try self.copyToTmpRegister(ty, mcv); return self.genSetStackArgument(ty, stack_offset, MCValue{ .register = reg }); } else { var ptr_ty_payload: Type.Payload.ElemType = .{ .base = .{ .tag = .single_mut_pointer }, .data = ty, }; const ptr_ty = Type.initPayload(&ptr_ty_payload.base); // TODO call extern memcpy const regs = try self.register_manager.allocRegs(5, .{ null, null, null, null, null }, gp); const regs_locks = self.register_manager.lockRegsAssumeUnused(5, regs); defer for (regs_locks) |reg| { self.register_manager.unlockReg(reg); }; const src_reg = regs[0]; const dst_reg = regs[1]; const len_reg = regs[2]; const count_reg = regs[3]; const tmp_reg = regs[4]; switch (mcv) { .stack_offset => |off| { // sub src_reg, fp, #off try self.genSetReg(ptr_ty, src_reg, .{ .ptr_stack_offset = off }); }, .stack_argument_offset => |off| { _ = try self.addInst(.{ .tag = .ldr_ptr_stack_argument, .data = .{ .load_store_stack = .{ .rt = src_reg, .offset = off, } }, }); }, .memory => |addr| try self.genSetReg(ptr_ty, src_reg, .{ .immediate = @intCast(u32, addr) }), .linker_load => |load_struct| { const tag: Mir.Inst.Tag = switch (load_struct.type) { .got => .load_memory_ptr_got, .direct => .load_memory_ptr_direct, .import => unreachable, }; const atom_index = switch (self.bin_file.tag) { .macho => blk: { const macho_file = self.bin_file.cast(link.File.MachO).?; const atom = try macho_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk macho_file.getAtom(atom).getSymbolIndex().?; }, .coff => blk: { const coff_file = self.bin_file.cast(link.File.Coff).?; const atom = try coff_file.getOrCreateAtomForDecl(self.mod_fn.owner_decl); break :blk coff_file.getAtom(atom).getSymbolIndex().?; }, else => unreachable, // unsupported target format }; _ = try self.addInst(.{ .tag = tag, .data = .{ .payload = try self.addExtra(Mir.LoadMemoryPie{ .register = @enumToInt(src_reg), .atom_index = atom_index, .sym_index = load_struct.sym_index, }), }, }); }, else => unreachable, } // add dst_reg, sp, #stack_offset _ = try self.addInst(.{ .tag = .add_immediate, .data = .{ .rr_imm12_sh = .{ .rd = dst_reg, .rn = .sp, .imm12 = math.cast(u12, stack_offset) orelse { return self.fail("TODO load: set reg to stack offset with all possible offsets", .{}); }, } }, }); // mov len, #abi_size try self.genSetReg(Type.usize, len_reg, .{ .immediate = abi_size }); // memcpy(src, dst, len) try self.genInlineMemcpy(src_reg, dst_reg, len_reg, count_reg, tmp_reg); } }, .compare_flags, .immediate, .ptr_stack_offset, => { const reg = try self.copyToTmpRegister(ty, mcv); return self.genSetStackArgument(ty, stack_offset, MCValue{ .register = reg }); }, } } fn airPtrToInt(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const result = try self.resolveInst(un_op); return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airBitCast(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result = if (self.liveness.isUnused(inst)) .dead else result: { const operand = try self.resolveInst(ty_op.operand); if (self.reuseOperand(inst, ty_op.operand, 0, operand)) break :result operand; const operand_lock = switch (operand) { .register => |reg| self.register_manager.lockReg(reg), .register_with_overflow => |rwo| self.register_manager.lockReg(rwo.reg), else => null, }; defer if (operand_lock) |lock| self.register_manager.unlockReg(lock); const dest_ty = self.air.typeOfIndex(inst); const dest = try self.allocRegOrMem(dest_ty, true, inst); try self.setRegOrMem(dest_ty, dest, operand); break :result dest; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airArrayToSlice(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else result: { const ptr_ty = self.air.typeOf(ty_op.operand); const ptr = try self.resolveInst(ty_op.operand); const array_ty = ptr_ty.childType(); const array_len = @intCast(u32, array_ty.arrayLen()); const ptr_bits = self.target.cpu.arch.ptrBitWidth(); const ptr_bytes = @divExact(ptr_bits, 8); const stack_offset = try self.allocMem(ptr_bytes * 2, ptr_bytes * 2, inst); try self.genSetStack(ptr_ty, stack_offset, ptr); try self.genSetStack(Type.initTag(.usize), stack_offset - ptr_bytes, .{ .immediate = array_len }); break :result MCValue{ .stack_offset = stack_offset }; }; return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airIntToFloat(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airIntToFloat for {}", .{ self.target.cpu.arch, }); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airFloatToInt(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airFloatToInt for {}", .{ self.target.cpu.arch, }); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airCmpxchg(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Block, ty_pl.payload); _ = extra; return self.fail("TODO implement airCmpxchg for {}", .{ self.target.cpu.arch, }); } fn airAtomicRmw(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airCmpxchg for {}", .{self.target.cpu.arch}); } fn airAtomicLoad(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airAtomicLoad for {}", .{self.target.cpu.arch}); } fn airAtomicStore(self: *Self, inst: Air.Inst.Index, order: std.builtin.AtomicOrder) !void { _ = inst; _ = order; return self.fail("TODO implement airAtomicStore for {}", .{self.target.cpu.arch}); } fn airMemset(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airMemset for {}", .{self.target.cpu.arch}); } fn airMemcpy(self: *Self, inst: Air.Inst.Index) !void { _ = inst; return self.fail("TODO implement airMemcpy for {}", .{self.target.cpu.arch}); } fn airTagName(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const operand = try self.resolveInst(un_op); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { _ = operand; return self.fail("TODO implement airTagName for aarch64", .{}); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airErrorName(self: *Self, inst: Air.Inst.Index) !void { const un_op = self.air.instructions.items(.data)[inst].un_op; const operand = try self.resolveInst(un_op); const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { _ = operand; return self.fail("TODO implement airErrorName for aarch64", .{}); }; return self.finishAir(inst, result, .{ un_op, .none, .none }); } fn airSplat(self: *Self, inst: Air.Inst.Index) !void { const ty_op = self.air.instructions.items(.data)[inst].ty_op; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airSplat for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); } fn airSelect(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const extra = self.air.extraData(Air.Bin, pl_op.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airSelect for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ pl_op.operand, extra.lhs, extra.rhs }); } fn airShuffle(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.Shuffle, ty_pl.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airShuffle for {}", .{self.target.cpu.arch}); return self.finishAir(inst, result, .{ extra.a, extra.b, .none }); } fn airReduce(self: *Self, inst: Air.Inst.Index) !void { const reduce = self.air.instructions.items(.data)[inst].reduce; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else return self.fail("TODO implement airReduce for aarch64", .{}); return self.finishAir(inst, result, .{ reduce.operand, .none, .none }); } fn airAggregateInit(self: *Self, inst: Air.Inst.Index) !void { const vector_ty = self.air.typeOfIndex(inst); const len = vector_ty.vectorLen(); const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const elements = @ptrCast([]const Air.Inst.Ref, self.air.extra[ty_pl.payload..][0..len]); const result: MCValue = res: { if (self.liveness.isUnused(inst)) break :res MCValue.dead; return self.fail("TODO implement airAggregateInit for {}", .{self.target.cpu.arch}); }; if (elements.len <= Liveness.bpi - 1) { var buf = [1]Air.Inst.Ref{.none} ** (Liveness.bpi - 1); std.mem.copy(Air.Inst.Ref, &buf, elements); return self.finishAir(inst, result, buf); } var bt = try self.iterateBigTomb(inst, elements.len); for (elements) |elem| { bt.feed(elem); } return bt.finishAir(result); } fn airUnionInit(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.UnionInit, ty_pl.payload).data; _ = extra; return self.fail("TODO implement airUnionInit for aarch64", .{}); } fn airPrefetch(self: *Self, inst: Air.Inst.Index) !void { const prefetch = self.air.instructions.items(.data)[inst].prefetch; return self.finishAir(inst, MCValue.dead, .{ prefetch.ptr, .none, .none }); } fn airMulAdd(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const extra = self.air.extraData(Air.Bin, pl_op.payload).data; const result: MCValue = if (self.liveness.isUnused(inst)) .dead else { return self.fail("TODO implement airMulAdd for aarch64", .{}); }; return self.finishAir(inst, result, .{ extra.lhs, extra.rhs, pl_op.operand }); } fn airTry(self: *Self, inst: Air.Inst.Index) !void { const pl_op = self.air.instructions.items(.data)[inst].pl_op; const extra = self.air.extraData(Air.Try, pl_op.payload); const body = self.air.extra[extra.end..][0..extra.data.body_len]; const result: MCValue = result: { const error_union_bind: ReadArg.Bind = .{ .inst = pl_op.operand }; const error_union_ty = self.air.typeOf(pl_op.operand); const error_union_size = @intCast(u32, error_union_ty.abiSize(self.target.*)); const error_union_align = error_union_ty.abiAlignment(self.target.*); // The error union will die in the body. However, we need the // error union after the body in order to extract the payload // of the error union, so we create a copy of it const error_union_copy = try self.allocMem(error_union_size, error_union_align, null); try self.genSetStack(error_union_ty, error_union_copy, try error_union_bind.resolveToMcv(self)); const is_err_result = try self.isErr(error_union_bind, error_union_ty); const reloc = try self.condBr(is_err_result); try self.genBody(body); try self.performReloc(reloc); break :result try self.errUnionPayload(.{ .mcv = .{ .stack_offset = error_union_copy } }, error_union_ty, null); }; return self.finishAir(inst, result, .{ pl_op.operand, .none, .none }); } fn airTryPtr(self: *Self, inst: Air.Inst.Index) !void { const ty_pl = self.air.instructions.items(.data)[inst].ty_pl; const extra = self.air.extraData(Air.TryPtr, ty_pl.payload); const body = self.air.extra[extra.end..][0..extra.data.body_len]; _ = body; return self.fail("TODO implement airTryPtr for arm", .{}); // return self.finishAir(inst, result, .{ extra.data.ptr, .none, .none }); } fn resolveInst(self: *Self, inst: Air.Inst.Ref) InnerError!MCValue { // First section of indexes correspond to a set number of constant values. const ref_int = @enumToInt(inst); if (ref_int < Air.Inst.Ref.typed_value_map.len) { const tv = Air.Inst.Ref.typed_value_map[ref_int]; if (!tv.ty.hasRuntimeBitsIgnoreComptime() and !tv.ty.isError()) { return MCValue{ .none = {} }; } return self.genTypedValue(tv); } // If the type has no codegen bits, no need to store it. const inst_ty = self.air.typeOf(inst); if (!inst_ty.hasRuntimeBitsIgnoreComptime() and !inst_ty.isError()) return MCValue{ .none = {} }; const inst_index = @intCast(Air.Inst.Index, ref_int - Air.Inst.Ref.typed_value_map.len); switch (self.air.instructions.items(.tag)[inst_index]) { .constant => { // Constants have static lifetimes, so they are always memoized in the outer most table. const branch = &self.branch_stack.items[0]; const gop = try branch.inst_table.getOrPut(self.gpa, inst_index); if (!gop.found_existing) { const ty_pl = self.air.instructions.items(.data)[inst_index].ty_pl; gop.value_ptr.* = try self.genTypedValue(.{ .ty = inst_ty, .val = self.air.values[ty_pl.payload], }); } return gop.value_ptr.*; }, .const_ty => unreachable, else => return self.getResolvedInstValue(inst_index), } } fn getResolvedInstValue(self: *Self, inst: Air.Inst.Index) MCValue { // Treat each stack item as a "layer" on top of the previous one. var i: usize = self.branch_stack.items.len; while (true) { i -= 1; if (self.branch_stack.items[i].inst_table.get(inst)) |mcv| { assert(mcv != .dead); return mcv; } } } fn genTypedValue(self: *Self, arg_tv: TypedValue) InnerError!MCValue { const mcv: MCValue = switch (try codegen.genTypedValue( self.bin_file, self.src_loc, arg_tv, self.mod_fn.owner_decl, )) { .mcv => |mcv| switch (mcv) { .none => .none, .undef => .undef, .immediate => |imm| .{ .immediate = imm }, .memory => |addr| .{ .memory = addr }, .load_got => |sym_index| .{ .linker_load = .{ .type = .got, .sym_index = sym_index } }, .load_direct => |sym_index| .{ .linker_load = .{ .type = .direct, .sym_index = sym_index } }, .load_tlv => unreachable, // TODO }, .fail => |msg| { self.err_msg = msg; return error.CodegenFail; }, }; return mcv; } const CallMCValues = struct { args: []MCValue, return_value: MCValue, stack_byte_count: u32, stack_align: u32, fn deinit(self: *CallMCValues, func: *Self) void { func.gpa.free(self.args); self.* = undefined; } }; /// Caller must call `CallMCValues.deinit`. fn resolveCallingConventionValues(self: *Self, fn_ty: Type) !CallMCValues { const cc = fn_ty.fnCallingConvention(); const param_types = try self.gpa.alloc(Type, fn_ty.fnParamLen()); defer self.gpa.free(param_types); fn_ty.fnParamTypes(param_types); var result: CallMCValues = .{ .args = try self.gpa.alloc(MCValue, param_types.len), // These undefined values must be populated before returning from this function. .return_value = undefined, .stack_byte_count = undefined, .stack_align = undefined, }; errdefer self.gpa.free(result.args); const ret_ty = fn_ty.fnReturnType(); switch (cc) { .Naked => { assert(result.args.len == 0); result.return_value = .{ .unreach = {} }; result.stack_byte_count = 0; result.stack_align = 1; return result; }, .C => { // ARM64 Procedure Call Standard var ncrn: usize = 0; // Next Core Register Number var nsaa: u32 = 0; // Next stacked argument address if (ret_ty.zigTypeTag() == .NoReturn) { result.return_value = .{ .unreach = {} }; } else if (!ret_ty.hasRuntimeBitsIgnoreComptime() and !ret_ty.isError()) { result.return_value = .{ .none = {} }; } else { const ret_ty_size = @intCast(u32, ret_ty.abiSize(self.target.*)); if (ret_ty_size == 0) { assert(ret_ty.isError()); result.return_value = .{ .immediate = 0 }; } else if (ret_ty_size <= 8) { result.return_value = .{ .register = self.registerAlias(c_abi_int_return_regs[0], ret_ty) }; } else { return self.fail("TODO support more return types for ARM backend", .{}); } } for (param_types, 0..) |ty, i| { const param_size = @intCast(u32, ty.abiSize(self.target.*)); if (param_size == 0) { result.args[i] = .{ .none = {} }; continue; } // We round up NCRN only for non-Apple platforms which allow the 16-byte aligned // values to spread across odd-numbered registers. if (ty.abiAlignment(self.target.*) == 16 and !self.target.isDarwin()) { // Round up NCRN to the next even number ncrn += ncrn % 2; } if (std.math.divCeil(u32, param_size, 8) catch unreachable <= 8 - ncrn) { if (param_size <= 8) { result.args[i] = .{ .register = self.registerAlias(c_abi_int_param_regs[ncrn], ty) }; ncrn += 1; } else { return self.fail("TODO MCValues with multiple registers", .{}); } } else if (ncrn < 8 and nsaa == 0) { return self.fail("TODO MCValues split between registers and stack", .{}); } else { ncrn = 8; // TODO Apple allows the arguments on the stack to be non-8-byte aligned provided // that the entire stack space consumed by the arguments is 8-byte aligned. if (ty.abiAlignment(self.target.*) == 8) { if (nsaa % 8 != 0) { nsaa += 8 - (nsaa % 8); } } result.args[i] = .{ .stack_argument_offset = nsaa }; nsaa += param_size; } } result.stack_byte_count = nsaa; result.stack_align = 16; }, .Unspecified => { if (ret_ty.zigTypeTag() == .NoReturn) { result.return_value = .{ .unreach = {} }; } else if (!ret_ty.hasRuntimeBitsIgnoreComptime() and !ret_ty.isError()) { result.return_value = .{ .none = {} }; } else { const ret_ty_size = @intCast(u32, ret_ty.abiSize(self.target.*)); if (ret_ty_size == 0) { assert(ret_ty.isError()); result.return_value = .{ .immediate = 0 }; } else if (ret_ty_size <= 8) { result.return_value = .{ .register = self.registerAlias(.x0, ret_ty) }; } else { // The result is returned by reference, not by // value. This means that x0 (or w0 when pointer // size is 32 bits) will contain the address of // where this function should write the result // into. result.return_value = .{ .stack_offset = 0 }; } } var stack_offset: u32 = 0; for (param_types, 0..) |ty, i| { if (ty.abiSize(self.target.*) > 0) { const param_size = @intCast(u32, ty.abiSize(self.target.*)); const param_alignment = ty.abiAlignment(self.target.*); stack_offset = std.mem.alignForwardGeneric(u32, stack_offset, param_alignment); result.args[i] = .{ .stack_argument_offset = stack_offset }; stack_offset += param_size; } else { result.args[i] = .{ .none = {} }; } } result.stack_byte_count = stack_offset; result.stack_align = 16; }, else => return self.fail("TODO implement function parameters for {} on aarch64", .{cc}), } return result; } /// TODO support scope overrides. Also note this logic is duplicated with `Module.wantSafety`. fn wantSafety(self: *Self) bool { return switch (self.bin_file.options.optimize_mode) { .Debug => true, .ReleaseSafe => true, .ReleaseFast => false, .ReleaseSmall => false, }; } fn fail(self: *Self, comptime format: []const u8, args: anytype) InnerError { @setCold(true); assert(self.err_msg == null); self.err_msg = try ErrorMsg.create(self.bin_file.allocator, self.src_loc, format, args); return error.CodegenFail; } fn failSymbol(self: *Self, comptime format: []const u8, args: anytype) InnerError { @setCold(true); assert(self.err_msg == null); self.err_msg = try ErrorMsg.create(self.bin_file.allocator, self.src_loc, format, args); return error.CodegenFail; } fn parseRegName(name: []const u8) ?Register { if (@hasDecl(Register, "parseRegName")) { return Register.parseRegName(name); } return std.meta.stringToEnum(Register, name); } fn registerAlias(self: *Self, reg: Register, ty: Type) Register { const abi_size = ty.abiSize(self.target.*); switch (reg.class()) { .general_purpose => { if (abi_size == 0) { unreachable; // should be comptime-known } else if (abi_size <= 4) { return reg.toW(); } else if (abi_size <= 8) { return reg.toX(); } else unreachable; }, .stack_pointer => unreachable, // we can't store/load the sp .floating_point => { return switch (ty.floatBits(self.target.*)) { 16 => reg.toH(), 32 => reg.toS(), 64 => reg.toD(), 128 => reg.toQ(), 80 => unreachable, // f80 registers don't exist else => unreachable, }; }, } }