| author | |
| committer | |
| log | ec54ceee6d34a61734ac6759ffdbd75248a2f3d7 |
| tree | 21f600733435a9f63674c131b3d1df421b0618a7 |
| parent | f5a31cb0d693ef3c07da7f446c95999cef34488b |
| parent | cfbc3537ef0b3a73d5b8fdd358cf3bb831935861 |
| signature |
25 files changed, 162 insertions(+), 207 deletions(-)
src/arch/x86_64/CodeGen.zig+140-109| ... | ... | @@ -1738,14 +1738,22 @@ fn airUnwrapErrErr(self: *Self, inst: Air.Inst.Index) !void { |
| 1738 | 1738 | return self.finishAir(inst, .dead, .{ ty_op.operand, .none, .none }); |
| 1739 | 1739 | } |
| 1740 | 1740 | const err_union_ty = self.air.typeOf(ty_op.operand); |
| 1741 | const err_ty = err_union_ty.errorUnionSet(); | |
| 1741 | 1742 | const payload_ty = err_union_ty.errorUnionPayload(); |
| 1742 | 1743 | const operand = try self.resolveInst(ty_op.operand); |
| 1744 | operand.freezeIfRegister(&self.register_manager); | |
| 1745 | defer operand.unfreezeIfRegister(&self.register_manager); | |
| 1746 | ||
| 1743 | 1747 | const result: MCValue = result: { |
| 1744 | 1748 | if (!payload_ty.hasRuntimeBits()) break :result operand; |
| 1745 | 1749 | switch (operand) { |
| 1746 | 1750 | .stack_offset => |off| { |
| 1747 | 1751 | break :result MCValue{ .stack_offset = off }; |
| 1748 | 1752 | }, |
| 1753 | .register => { | |
| 1754 | // TODO reuse operand | |
| 1755 | break :result try self.copyToRegisterWithInstTracking(inst, err_ty, operand); | |
| 1756 | }, | |
| 1749 | 1757 | else => return self.fail("TODO implement unwrap_err_err for {}", .{operand}), |
| 1750 | 1758 | } |
| 1751 | 1759 | }; |
| ... | ... | @@ -1763,13 +1771,25 @@ fn airUnwrapErrPayload(self: *Self, inst: Air.Inst.Index) !void { |
| 1763 | 1771 | if (!payload_ty.hasRuntimeBits()) break :result MCValue.none; |
| 1764 | 1772 | |
| 1765 | 1773 | const operand = try self.resolveInst(ty_op.operand); |
| 1774 | operand.freezeIfRegister(&self.register_manager); | |
| 1775 | defer operand.unfreezeIfRegister(&self.register_manager); | |
| 1776 | ||
| 1766 | 1777 | const err_ty = err_union_ty.errorUnionSet(); |
| 1767 | const err_abi_size = @intCast(u32, err_ty.abiSize(self.target.*)); | |
| 1768 | 1778 | switch (operand) { |
| 1769 | 1779 | .stack_offset => |off| { |
| 1780 | const err_abi_size = @intCast(u32, err_ty.abiSize(self.target.*)); | |
| 1770 | 1781 | const offset = off - @intCast(i32, err_abi_size); |
| 1771 | 1782 | break :result MCValue{ .stack_offset = offset }; |
| 1772 | 1783 | }, |
| 1784 | .register => { | |
| 1785 | // TODO reuse operand | |
| 1786 | const shift = @intCast(u6, err_ty.bitSize(self.target.*)); | |
| 1787 | const result = try self.copyToRegisterWithInstTracking(inst, err_union_ty, operand); | |
| 1788 | try self.shiftRegister(result.register.to64(), shift); | |
| 1789 | break :result MCValue{ | |
| 1790 | .register = registerAlias(result.register, @intCast(u32, payload_ty.abiSize(self.target.*))), | |
| 1791 | }; | |
| 1792 | }, | |
| 1773 | 1793 | else => return self.fail("TODO implement unwrap_err_payload for {}", .{operand}), |
| 1774 | 1794 | } |
| 1775 | 1795 | }; |
| ... | ... | @@ -2013,42 +2033,44 @@ fn airArrayElemVal(self: *Self, inst: Air.Inst.Index) !void { |
| 2013 | 2033 | self.register_manager.freezeRegs(&.{offset_reg}); |
| 2014 | 2034 | defer self.register_manager.unfreezeRegs(&.{offset_reg}); |
| 2015 | 2035 | |
| 2016 | const addr_reg = blk: { | |
| 2017 | const off = inner: { | |
| 2018 | switch (array) { | |
| 2019 | .register => { | |
| 2020 | const off = @intCast(i32, try self.allocMem( | |
| 2021 | inst, | |
| 2022 | @intCast(u32, array_ty.abiSize(self.target.*)), | |
| 2023 | array_ty.abiAlignment(self.target.*), | |
| 2024 | )); | |
| 2025 | try self.genSetStack(array_ty, off, array, .{}); | |
| 2026 | break :inner off; | |
| 2027 | }, | |
| 2028 | .stack_offset => |off| { | |
| 2029 | break :inner off; | |
| 2030 | }, | |
| 2031 | .memory, | |
| 2032 | .got_load, | |
| 2033 | .direct_load, | |
| 2034 | => { | |
| 2035 | break :blk try self.loadMemPtrIntoRegister(Type.usize, array); | |
| 2036 | }, | |
| 2037 | else => return self.fail("TODO implement array_elem_val when array is {}", .{array}), | |
| 2038 | } | |
| 2039 | }; | |
| 2040 | const addr_reg = try self.register_manager.allocReg(null); | |
| 2041 | // lea reg, [rbp] | |
| 2042 | _ = try self.addInst(.{ | |
| 2043 | .tag = .lea, | |
| 2044 | .ops = (Mir.Ops{ | |
| 2045 | .reg1 = addr_reg.to64(), | |
| 2046 | .reg2 = .rbp, | |
| 2047 | }).encode(), | |
| 2048 | .data = .{ .imm = @bitCast(u32, -off) }, | |
| 2049 | }); | |
| 2050 | break :blk addr_reg.to64(); | |
| 2051 | }; | |
| 2036 | const addr_reg = try self.register_manager.allocReg(null); | |
| 2037 | switch (array) { | |
| 2038 | .register => { | |
| 2039 | const off = @intCast(i32, try self.allocMem( | |
| 2040 | inst, | |
| 2041 | @intCast(u32, array_ty.abiSize(self.target.*)), | |
| 2042 | array_ty.abiAlignment(self.target.*), | |
| 2043 | )); | |
| 2044 | try self.genSetStack(array_ty, off, array, .{}); | |
| 2045 | // lea reg, [rbp] | |
| 2046 | _ = try self.addInst(.{ | |
| 2047 | .tag = .lea, | |
| 2048 | .ops = (Mir.Ops{ | |
| 2049 | .reg1 = addr_reg.to64(), | |
| 2050 | .reg2 = .rbp, | |
| 2051 | }).encode(), | |
| 2052 | .data = .{ .imm = @bitCast(u32, -off) }, | |
| 2053 | }); | |
| 2054 | }, | |
| 2055 | .stack_offset => |off| { | |
| 2056 | // lea reg, [rbp] | |
| 2057 | _ = try self.addInst(.{ | |
| 2058 | .tag = .lea, | |
| 2059 | .ops = (Mir.Ops{ | |
| 2060 | .reg1 = addr_reg.to64(), | |
| 2061 | .reg2 = .rbp, | |
| 2062 | }).encode(), | |
| 2063 | .data = .{ .imm = @bitCast(u32, -off) }, | |
| 2064 | }); | |
| 2065 | }, | |
| 2066 | .memory, | |
| 2067 | .got_load, | |
| 2068 | .direct_load, | |
| 2069 | => { | |
| 2070 | try self.loadMemPtrIntoRegister(addr_reg, Type.usize, array); | |
| 2071 | }, | |
| 2072 | else => return self.fail("TODO implement array_elem_val when array is {}", .{array}), | |
| 2073 | } | |
| 2052 | 2074 | |
| 2053 | 2075 | // TODO we could allocate register here, but need to expect addr register and potentially |
| 2054 | 2076 | // offset register. |
| ... | ... | @@ -2148,11 +2170,11 @@ fn airGetUnionTag(self: *Self, inst: Air.Inst.Index) !void { |
| 2148 | 2170 | defer operand.unfreezeIfRegister(&self.register_manager); |
| 2149 | 2171 | |
| 2150 | 2172 | const tag_abi_size = tag_ty.abiSize(self.target.*); |
| 2151 | const offset: i32 = if (layout.tag_align < layout.payload_align) @intCast(i32, layout.payload_size) else 0; | |
| 2152 | 2173 | const dst_mcv: MCValue = blk: { |
| 2153 | 2174 | switch (operand) { |
| 2154 | 2175 | .stack_offset => |off| { |
| 2155 | 2176 | if (tag_abi_size <= 8) { |
| 2177 | const offset: i32 = if (layout.tag_align < layout.payload_align) @intCast(i32, layout.payload_size) else 0; | |
| 2156 | 2178 | break :blk try self.copyToRegisterWithInstTracking(inst, tag_ty, .{ |
| 2157 | 2179 | .stack_offset = off - offset, |
| 2158 | 2180 | }); |
| ... | ... | @@ -2160,6 +2182,17 @@ fn airGetUnionTag(self: *Self, inst: Air.Inst.Index) !void { |
| 2160 | 2182 | |
| 2161 | 2183 | return self.fail("TODO implement get_union_tag for ABI larger than 8 bytes and operand {}", .{operand}); |
| 2162 | 2184 | }, |
| 2185 | .register => { | |
| 2186 | const shift: u6 = if (layout.tag_align < layout.payload_align) | |
| 2187 | @intCast(u6, layout.payload_size * 8) | |
| 2188 | else | |
| 2189 | 0; | |
| 2190 | const result = try self.copyToRegisterWithInstTracking(inst, union_ty, operand); | |
| 2191 | try self.shiftRegister(result.register.to64(), shift); | |
| 2192 | break :blk MCValue{ | |
| 2193 | .register = registerAlias(result.register, @intCast(u32, layout.tag_size)), | |
| 2194 | }; | |
| 2195 | }, | |
| 2163 | 2196 | else => return self.fail("TODO implement get_union_tag for {}", .{operand}), |
| 2164 | 2197 | } |
| 2165 | 2198 | }; |
| ... | ... | @@ -2354,7 +2387,7 @@ fn airLoad(self: *Self, inst: Air.Inst.Index) !void { |
| 2354 | 2387 | return self.finishAir(inst, result, .{ ty_op.operand, .none, .none }); |
| 2355 | 2388 | } |
| 2356 | 2389 | |
| 2357 | fn loadMemPtrIntoRegister(self: *Self, ptr_ty: Type, ptr: MCValue) InnerError!Register { | |
| 2390 | fn loadMemPtrIntoRegister(self: *Self, reg: Register, ptr_ty: Type, ptr: MCValue) InnerError!void { | |
| 2358 | 2391 | switch (ptr) { |
| 2359 | 2392 | .got_load, |
| 2360 | 2393 | .direct_load, |
| ... | ... | @@ -2364,11 +2397,10 @@ fn loadMemPtrIntoRegister(self: *Self, ptr_ty: Type, ptr: MCValue) InnerError!Re |
| 2364 | 2397 | .direct_load => 0b01, |
| 2365 | 2398 | else => unreachable, |
| 2366 | 2399 | }; |
| 2367 | const reg = try self.register_manager.allocReg(null); | |
| 2368 | 2400 | _ = try self.addInst(.{ |
| 2369 | 2401 | .tag = .lea_pie, |
| 2370 | 2402 | .ops = (Mir.Ops{ |
| 2371 | .reg1 = reg.to64(), | |
| 2403 | .reg1 = registerAlias(reg, @intCast(u32, ptr_ty.abiSize(self.target.*))), | |
| 2372 | 2404 | .flags = flags, |
| 2373 | 2405 | }).encode(), |
| 2374 | 2406 | .data = .{ |
| ... | ... | @@ -2378,13 +2410,11 @@ fn loadMemPtrIntoRegister(self: *Self, ptr_ty: Type, ptr: MCValue) InnerError!Re |
| 2378 | 2410 | }, |
| 2379 | 2411 | }, |
| 2380 | 2412 | }); |
| 2381 | return reg.to64(); | |
| 2382 | 2413 | }, |
| 2383 | 2414 | .memory => |addr| { |
| 2384 | 2415 | // TODO: in case the address fits in an imm32 we can use [ds:imm32] |
| 2385 | 2416 | // instead of wasting an instruction copying the address to a register |
| 2386 | const reg = try self.copyToTmpRegister(ptr_ty, .{ .immediate = addr }); | |
| 2387 | return reg.to64(); | |
| 2417 | try self.genSetReg(ptr_ty, reg, .{ .immediate = addr }); | |
| 2388 | 2418 | }, |
| 2389 | 2419 | else => unreachable, |
| 2390 | 2420 | } |
| ... | ... | @@ -2484,7 +2514,11 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2484 | 2514 | .data = .{ .imm = 0 }, |
| 2485 | 2515 | }); |
| 2486 | 2516 | }, |
| 2487 | .stack_offset => { | |
| 2517 | .got_load, | |
| 2518 | .direct_load, | |
| 2519 | .memory, | |
| 2520 | .stack_offset, | |
| 2521 | => { | |
| 2488 | 2522 | if (abi_size <= 8) { |
| 2489 | 2523 | const tmp_reg = try self.copyToTmpRegister(value_ty, value); |
| 2490 | 2524 | return self.store(ptr, .{ .register = tmp_reg }, ptr_ty, value_ty); |
| ... | ... | @@ -2507,7 +2541,8 @@ fn store(self: *Self, ptr: MCValue, value: MCValue, ptr_ty: Type, value_ty: Type |
| 2507 | 2541 | value.freezeIfRegister(&self.register_manager); |
| 2508 | 2542 | defer value.unfreezeIfRegister(&self.register_manager); |
| 2509 | 2543 | |
| 2510 | const addr_reg = try self.loadMemPtrIntoRegister(ptr_ty, ptr); | |
| 2544 | const addr_reg = try self.register_manager.allocReg(null); | |
| 2545 | try self.loadMemPtrIntoRegister(addr_reg, ptr_ty, ptr); | |
| 2511 | 2546 | |
| 2512 | 2547 | // to get the actual address of the value we want to modify we have to go through the GOT |
| 2513 | 2548 | // mov reg, [reg] |
| ... | ... | @@ -2686,27 +2721,8 @@ fn airStructFieldVal(self: *Self, inst: Air.Inst.Index) !void { |
| 2686 | 2721 | }; |
| 2687 | 2722 | |
| 2688 | 2723 | // Shift by struct_field_offset. |
| 2689 | const shift_amount = @intCast(u8, struct_field_offset * 8); | |
| 2690 | if (shift_amount > 0) { | |
| 2691 | if (shift_amount == 1) { | |
| 2692 | _ = try self.addInst(.{ | |
| 2693 | .tag = .shr, | |
| 2694 | .ops = (Mir.Ops{ | |
| 2695 | .reg1 = dst_mcv.register, | |
| 2696 | }).encode(), | |
| 2697 | .data = undefined, | |
| 2698 | }); | |
| 2699 | } else { | |
| 2700 | _ = try self.addInst(.{ | |
| 2701 | .tag = .shr, | |
| 2702 | .ops = (Mir.Ops{ | |
| 2703 | .reg1 = dst_mcv.register, | |
| 2704 | .flags = 0b10, | |
| 2705 | }).encode(), | |
| 2706 | .data = .{ .imm = shift_amount }, | |
| 2707 | }); | |
| 2708 | } | |
| 2709 | } | |
| 2724 | const shift = @intCast(u8, struct_field_offset * 8); | |
| 2725 | try self.shiftRegister(dst_mcv.register, shift); | |
| 2710 | 2726 | |
| 2711 | 2727 | // Mask with reg.size() - struct_field_size |
| 2712 | 2728 | const mask_shift = @intCast(u6, (64 - struct_field_ty.bitSize(self.target.*))); |
| ... | ... | @@ -3167,11 +3183,13 @@ fn airCall(self: *Self, inst: Air.Inst.Index) !void { |
| 3167 | 3183 | const ret_abi_align = @intCast(u32, ret_ty.abiAlignment(self.target.*)); |
| 3168 | 3184 | const stack_offset = @intCast(i32, try self.allocMem(inst, ret_abi_size, ret_abi_align)); |
| 3169 | 3185 | |
| 3170 | try self.register_manager.getReg(.rdi, inst); | |
| 3186 | try self.register_manager.getReg(.rdi, null); | |
| 3187 | self.register_manager.freezeRegs(&.{.rdi}); | |
| 3171 | 3188 | try self.genSetReg(Type.usize, .rdi, .{ .ptr_stack_offset = stack_offset }); |
| 3172 | 3189 | |
| 3173 | 3190 | info.return_value.stack_offset = stack_offset; |
| 3174 | 3191 | } |
| 3192 | defer if (info.return_value == .stack_offset) self.register_manager.unfreezeRegs(&.{.rdi}); | |
| 3175 | 3193 | |
| 3176 | 3194 | for (args) |arg, arg_i| { |
| 3177 | 3195 | const mc_arg = info.args[arg_i]; |
| ... | ... | @@ -4676,43 +4694,38 @@ fn genInlineMemcpy(self: *Self, stack_offset: i32, ty: Type, val: MCValue, opts: |
| 4676 | 4694 | if (opts.dest_stack_base) |reg| self.register_manager.freezeRegs(&.{reg}); |
| 4677 | 4695 | defer if (opts.dest_stack_base) |reg| self.register_manager.unfreezeRegs(&.{reg}); |
| 4678 | 4696 | |
| 4679 | const addr_reg: Register = blk: { | |
| 4680 | switch (val) { | |
| 4681 | .memory, | |
| 4682 | .direct_load, | |
| 4683 | .got_load, | |
| 4684 | => { | |
| 4685 | break :blk try self.loadMemPtrIntoRegister(Type.usize, val); | |
| 4686 | }, | |
| 4687 | .ptr_stack_offset, .stack_offset => |off| { | |
| 4688 | const addr_reg = (try self.register_manager.allocReg(null)).to64(); | |
| 4689 | _ = try self.addInst(.{ | |
| 4690 | .tag = .lea, | |
| 4691 | .ops = (Mir.Ops{ | |
| 4692 | .reg1 = addr_reg, | |
| 4693 | .reg2 = opts.source_stack_base orelse .rbp, | |
| 4694 | }).encode(), | |
| 4695 | .data = .{ .imm = @bitCast(u32, -off) }, | |
| 4696 | }); | |
| 4697 | break :blk addr_reg; | |
| 4698 | }, | |
| 4699 | .register => |reg| { | |
| 4700 | const addr_reg = try self.register_manager.allocReg(null); | |
| 4701 | _ = try self.addInst(.{ | |
| 4702 | .tag = .mov, | |
| 4703 | .ops = (Mir.Ops{ | |
| 4704 | .reg1 = registerAlias(addr_reg, @divExact(reg.size(), 8)), | |
| 4705 | .reg2 = reg, | |
| 4706 | }).encode(), | |
| 4707 | .data = undefined, | |
| 4708 | }); | |
| 4709 | break :blk addr_reg.to64(); | |
| 4710 | }, | |
| 4711 | else => { | |
| 4712 | return self.fail("TODO implement memcpy for setting stack from {}", .{val}); | |
| 4713 | }, | |
| 4714 | } | |
| 4715 | }; | |
| 4697 | const addr_reg = try self.register_manager.allocReg(null); | |
| 4698 | switch (val) { | |
| 4699 | .memory, | |
| 4700 | .direct_load, | |
| 4701 | .got_load, | |
| 4702 | => { | |
| 4703 | try self.loadMemPtrIntoRegister(addr_reg, Type.usize, val); | |
| 4704 | }, | |
| 4705 | .ptr_stack_offset, .stack_offset => |off| { | |
| 4706 | _ = try self.addInst(.{ | |
| 4707 | .tag = .lea, | |
| 4708 | .ops = (Mir.Ops{ | |
| 4709 | .reg1 = addr_reg.to64(), | |
| 4710 | .reg2 = opts.source_stack_base orelse .rbp, | |
| 4711 | }).encode(), | |
| 4712 | .data = .{ .imm = @bitCast(u32, -off) }, | |
| 4713 | }); | |
| 4714 | }, | |
| 4715 | .register => |reg| { | |
| 4716 | _ = try self.addInst(.{ | |
| 4717 | .tag = .mov, | |
| 4718 | .ops = (Mir.Ops{ | |
| 4719 | .reg1 = registerAlias(addr_reg, @divExact(reg.size(), 8)), | |
| 4720 | .reg2 = reg, | |
| 4721 | }).encode(), | |
| 4722 | .data = undefined, | |
| 4723 | }); | |
| 4724 | }, | |
| 4725 | else => { | |
| 4726 | return self.fail("TODO implement memcpy for setting stack from {}", .{val}); | |
| 4727 | }, | |
| 4728 | } | |
| 4716 | 4729 | |
| 4717 | 4730 | self.register_manager.freezeRegs(&.{addr_reg}); |
| 4718 | 4731 | defer self.register_manager.unfreezeRegs(&.{addr_reg}); |
| ... | ... | @@ -4826,10 +4839,6 @@ fn genInlineMemset( |
| 4826 | 4839 | try self.register_manager.getReg(.rax, null); |
| 4827 | 4840 | |
| 4828 | 4841 | const abi_size = ty.abiSize(self.target.*); |
| 4829 | if (stack_offset > 128) { | |
| 4830 | return self.fail("TODO inline memset with large stack offset", .{}); | |
| 4831 | } | |
| 4832 | ||
| 4833 | 4842 | const negative_offset = @bitCast(u32, -stack_offset); |
| 4834 | 4843 | |
| 4835 | 4844 | // We are actually counting `abi_size` bytes; however, we reuse the index register |
| ... | ... | @@ -5768,3 +5777,25 @@ fn registerAlias(reg: Register, size_bytes: u32) Register { |
| 5768 | 5777 | unreachable; // TODO handle floating-point registers |
| 5769 | 5778 | } |
| 5770 | 5779 | } |
| 5780 | ||
| 5781 | fn shiftRegister(self: *Self, reg: Register, shift: u8) !void { | |
| 5782 | if (shift == 0) return; | |
| 5783 | if (shift == 1) { | |
| 5784 | _ = try self.addInst(.{ | |
| 5785 | .tag = .shr, | |
| 5786 | .ops = (Mir.Ops{ | |
| 5787 | .reg1 = reg, | |
| 5788 | }).encode(), | |
| 5789 | .data = undefined, | |
| 5790 | }); | |
| 5791 | } else { | |
| 5792 | _ = try self.addInst(.{ | |
| 5793 | .tag = .shr, | |
| 5794 | .ops = (Mir.Ops{ | |
| 5795 | .reg1 = reg, | |
| 5796 | .flags = 0b10, | |
| 5797 | }).encode(), | |
| 5798 | .data = .{ .imm = shift }, | |
| 5799 | }); | |
| 5800 | } | |
| 5801 | } |
src/codegen.zig+18-27| ... | ... | @@ -553,31 +553,21 @@ pub fn generateSymbol( |
| 553 | 553 | const target = bin_file.options.target; |
| 554 | 554 | const abi_align = typed_value.ty.abiAlignment(target); |
| 555 | 555 | |
| 556 | { | |
| 557 | const error_val = if (!is_payload) typed_value.val else Value.initTag(.zero); | |
| 558 | const begin = code.items.len; | |
| 559 | switch (try generateSymbol(bin_file, parent_atom_index, src_loc, .{ | |
| 560 | .ty = error_ty, | |
| 561 | .val = error_val, | |
| 562 | }, code, debug_output)) { | |
| 563 | .appended => {}, | |
| 564 | .externally_managed => |external_slice| { | |
| 565 | code.appendSliceAssumeCapacity(external_slice); | |
| 566 | }, | |
| 567 | .fail => |em| return Result{ .fail = em }, | |
| 568 | } | |
| 569 | const unpadded_end = code.items.len - begin; | |
| 570 | const padded_end = mem.alignForwardGeneric(u64, unpadded_end, abi_align); | |
| 571 | const padding = try math.cast(usize, padded_end - unpadded_end); | |
| 572 | ||
| 573 | if (padding > 0) { | |
| 574 | try code.writer().writeByteNTimes(0, padding); | |
| 575 | } | |
| 556 | const error_val = if (!is_payload) typed_value.val else Value.initTag(.zero); | |
| 557 | const begin = code.items.len; | |
| 558 | switch (try generateSymbol(bin_file, parent_atom_index, src_loc, .{ | |
| 559 | .ty = error_ty, | |
| 560 | .val = error_val, | |
| 561 | }, code, debug_output)) { | |
| 562 | .appended => {}, | |
| 563 | .externally_managed => |external_slice| { | |
| 564 | code.appendSliceAssumeCapacity(external_slice); | |
| 565 | }, | |
| 566 | .fail => |em| return Result{ .fail = em }, | |
| 576 | 567 | } |
| 577 | 568 | |
| 578 | 569 | if (payload_ty.hasRuntimeBits()) { |
| 579 | 570 | const payload_val = if (typed_value.val.castTag(.eu_payload)) |val| val.data else Value.initTag(.undef); |
| 580 | const begin = code.items.len; | |
| 581 | 571 | switch (try generateSymbol(bin_file, parent_atom_index, src_loc, .{ |
| 582 | 572 | .ty = payload_ty, |
| 583 | 573 | .val = payload_val, |
| ... | ... | @@ -588,13 +578,14 @@ pub fn generateSymbol( |
| 588 | 578 | }, |
| 589 | 579 | .fail => |em| return Result{ .fail = em }, |
| 590 | 580 | } |
| 591 | const unpadded_end = code.items.len - begin; | |
| 592 | const padded_end = mem.alignForwardGeneric(u64, unpadded_end, abi_align); | |
| 593 | const padding = try math.cast(usize, padded_end - unpadded_end); | |
| 581 | } | |
| 594 | 582 | |
| 595 | if (padding > 0) { | |
| 596 | try code.writer().writeByteNTimes(0, padding); | |
| 597 | } | |
| 583 | const unpadded_end = code.items.len - begin; | |
| 584 | const padded_end = mem.alignForwardGeneric(u64, unpadded_end, abi_align); | |
| 585 | const padding = try math.cast(usize, padded_end - unpadded_end); | |
| 586 | ||
| 587 | if (padding > 0) { | |
| 588 | try code.writer().writeByteNTimes(0, padding); | |
| 598 | 589 | } |
| 599 | 590 | |
| 600 | 591 | return Result{ .appended = {} }; |
test/behavior/align.zig+3-2| ... | ... | @@ -131,7 +131,7 @@ fn testBytesAlign(b: u8) !void { |
| 131 | 131 | test "@alignCast slices" { |
| 132 | 132 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 133 | 133 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 134 | if (builtin.zig_backend == .stage2_x86_64 or builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 134 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 135 | 135 | |
| 136 | 136 | var array align(4) = [_]u32{ 1, 1 }; |
| 137 | 137 | const slice = array[0..]; |
| ... | ... | @@ -147,7 +147,8 @@ fn sliceExpects4(slice: []align(4) u32) void { |
| 147 | 147 | |
| 148 | 148 | test "return error union with 128-bit integer" { |
| 149 | 149 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 150 | if (builtin.zig_backend == .stage2_x86_64 or builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 150 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 151 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 151 | 152 | |
| 152 | 153 | try expect(3 == try give()); |
| 153 | 154 | } |
test/behavior/alignof.zig-2| ... | ... | @@ -14,7 +14,6 @@ test "@alignOf(T) before referencing T" { |
| 14 | 14 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 15 | 15 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 16 | 16 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 17 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 18 | 17 | comptime try expect(@alignOf(Foo) != maxInt(usize)); |
| 19 | 18 | if (native_arch == .x86_64) { |
| 20 | 19 | comptime try expect(@alignOf(Foo) == 4); |
| ... | ... | @@ -23,7 +22,6 @@ test "@alignOf(T) before referencing T" { |
| 23 | 22 | |
| 24 | 23 | test "comparison of @alignOf(T) against zero" { |
| 25 | 24 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 26 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 27 | 25 | { |
| 28 | 26 | const T = struct { x: u32 }; |
| 29 | 27 | try expect(!(@alignOf(T) == 0)); |
test/behavior/array.zig-1| ... | ... | @@ -349,7 +349,6 @@ test "array literal as argument to function" { |
| 349 | 349 | test "double nested array to const slice cast in array literal" { |
| 350 | 350 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 351 | 351 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 352 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 353 | 352 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 354 | 353 | |
| 355 | 354 | const S = struct { |
test/behavior/basic.zig-2| ... | ... | @@ -287,7 +287,6 @@ fn fB() []const u8 { |
| 287 | 287 | test "call function pointer in struct" { |
| 288 | 288 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 289 | 289 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 290 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 291 | 290 | if (builtin.zig_backend == .stage1) return error.SkipZigTest; |
| 292 | 291 | |
| 293 | 292 | try expect(mem.eql(u8, f3(true), "a")); |
| ... | ... | @@ -814,7 +813,6 @@ test "if expression type coercion" { |
| 814 | 813 | } |
| 815 | 814 | |
| 816 | 815 | test "discarding the result of various expressions" { |
| 817 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 818 | 816 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; // TODO |
| 819 | 817 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 820 | 818 |
test/behavior/bitcast.zig-3| ... | ... | @@ -167,7 +167,6 @@ test "@bitCast packed structs at runtime and comptime" { |
| 167 | 167 | test "@bitCast extern structs at runtime and comptime" { |
| 168 | 168 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; |
| 169 | 169 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 170 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 171 | 170 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 172 | 171 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 173 | 172 | |
| ... | ... | @@ -241,7 +240,6 @@ test "implicit cast to error union by returning" { |
| 241 | 240 | test "bitcast packed struct literal to byte" { |
| 242 | 241 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; |
| 243 | 242 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 244 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 245 | 243 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 246 | 244 | |
| 247 | 245 | const Foo = packed struct { |
| ... | ... | @@ -254,7 +252,6 @@ test "bitcast packed struct literal to byte" { |
| 254 | 252 | test "comptime bitcast used in expression has the correct type" { |
| 255 | 253 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; |
| 256 | 254 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 257 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 258 | 255 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 259 | 256 | |
| 260 | 257 | const Foo = packed struct { |
test/behavior/bitreverse.zig-1| ... | ... | @@ -6,7 +6,6 @@ const minInt = std.math.minInt; |
| 6 | 6 | test "@bitReverse large exotic integer" { |
| 7 | 7 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; |
| 8 | 8 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 9 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 10 | 9 | // Currently failing on stage1 for big-endian targets |
| 11 | 10 | if (builtin.zig_backend == .stage1) return error.SkipZigTest; |
| 12 | 11 |
test/behavior/bugs/1381.zig-1| ... | ... | @@ -14,7 +14,6 @@ const A = union(enum) { |
| 14 | 14 | test "union that needs padding bytes inside an array" { |
| 15 | 15 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 16 | 16 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 17 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 18 | 17 | var as = [_]A{ |
| 19 | 18 | A{ .B = B{ .D = 1 } }, |
| 20 | 19 | A{ .B = B{ .D = 1 } }, |
test/behavior/bugs/1735.zig-1| ... | ... | @@ -45,7 +45,6 @@ test "initialization" { |
| 45 | 45 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 46 | 46 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 47 | 47 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 48 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 49 | 48 | var t = a.init(); |
| 50 | 49 | try std.testing.expect(t.foo.len == 0); |
| 51 | 50 | } |
test/behavior/bugs/4954.zig-1| ... | ... | @@ -5,7 +5,6 @@ fn f(buf: []u8) void { |
| 5 | 5 | } |
| 6 | 6 | |
| 7 | 7 | test "crash" { |
| 8 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 9 | 8 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 10 | 9 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 11 | 10 |
test/behavior/cast.zig+1-20| ... | ... | @@ -223,7 +223,7 @@ test "@intToEnum passed a comptime_int to an enum with one item" { |
| 223 | 223 | } |
| 224 | 224 | |
| 225 | 225 | test "@intCast to u0 and use the result" { |
| 226 | if (builtin.zig_backend == .stage2_x86_64 or builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 226 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; | |
| 227 | 227 | |
| 228 | 228 | const S = struct { |
| 229 | 229 | fn doTheTest(zero: u1, one: u1, bigzero: i32) !void { |
| ... | ... | @@ -324,7 +324,6 @@ test "cast from ?[*]T to ??[*]T" { |
| 324 | 324 | test "peer type unsigned int to signed" { |
| 325 | 325 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 326 | 326 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 327 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 328 | 327 | |
| 329 | 328 | var w: u31 = 5; |
| 330 | 329 | var x: u8 = 7; |
| ... | ... | @@ -401,7 +400,6 @@ test "implicitly cast from [0]T to anyerror![]T" { |
| 401 | 400 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 402 | 401 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 403 | 402 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 404 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 405 | 403 | |
| 406 | 404 | try testCastZeroArrayToErrSliceMut(); |
| 407 | 405 | comptime try testCastZeroArrayToErrSliceMut(); |
| ... | ... | @@ -419,7 +417,6 @@ test "peer type resolution: [0]u8, []const u8, and anyerror![]u8" { |
| 419 | 417 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 420 | 418 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 421 | 419 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 422 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 423 | 420 | |
| 424 | 421 | const S = struct { |
| 425 | 422 | fn doTheTest() anyerror!void { |
| ... | ... | @@ -475,7 +472,6 @@ fn testCastConstArrayRefToConstSlice() !void { |
| 475 | 472 | test "peer type resolution: error and [N]T" { |
| 476 | 473 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 477 | 474 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 478 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 479 | 475 | |
| 480 | 476 | try expect(mem.eql(u8, try testPeerErrorAndArray(0), "OK")); |
| 481 | 477 | comptime try expect(mem.eql(u8, try testPeerErrorAndArray(0), "OK")); |
| ... | ... | @@ -790,7 +786,6 @@ test "peer cast *[0]T to []const T" { |
| 790 | 786 | test "peer cast *[N]T to [*]T" { |
| 791 | 787 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 792 | 788 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 793 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 794 | 789 | |
| 795 | 790 | var array = [4:99]i32{ 1, 2, 3, 4 }; |
| 796 | 791 | var dest: [*]i32 = undefined; |
| ... | ... | @@ -844,7 +839,6 @@ test "peer cast [N:x]T to [N]T" { |
| 844 | 839 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 845 | 840 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 846 | 841 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 847 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 848 | 842 | |
| 849 | 843 | const S = struct { |
| 850 | 844 | fn doTheTest() !void { |
| ... | ... | @@ -861,7 +855,6 @@ test "peer cast *[N:x]T to *[N]T" { |
| 861 | 855 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 862 | 856 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 863 | 857 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 864 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 865 | 858 | |
| 866 | 859 | const S = struct { |
| 867 | 860 | fn doTheTest() !void { |
| ... | ... | @@ -915,7 +908,6 @@ test "peer type resolution implicit cast to return type" { |
| 915 | 908 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 916 | 909 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; // TODO |
| 917 | 910 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 918 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 919 | 911 | |
| 920 | 912 | const S = struct { |
| 921 | 913 | fn doTheTest() !void { |
| ... | ... | @@ -1030,7 +1022,6 @@ test "pointer reinterpret const float to int" { |
| 1030 | 1022 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1031 | 1023 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 1032 | 1024 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1033 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1034 | 1025 | |
| 1035 | 1026 | // The hex representation is 0x3fe3333333333303. |
| 1036 | 1027 | const float: f64 = 5.99999999999994648725e-01; |
| ... | ... | @@ -1116,7 +1107,6 @@ test "peer type resolution: [0]u8 and []const u8" { |
| 1116 | 1107 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1117 | 1108 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 1118 | 1109 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1119 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1120 | 1110 | |
| 1121 | 1111 | try expect(peerTypeEmptyArrayAndSlice(true, "hi").len == 0); |
| 1122 | 1112 | try expect(peerTypeEmptyArrayAndSlice(false, "hi").len == 1); |
| ... | ... | @@ -1204,7 +1194,6 @@ test "implicit cast *[0]T to E![]const u8" { |
| 1204 | 1194 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1205 | 1195 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 1206 | 1196 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1207 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1208 | 1197 | |
| 1209 | 1198 | var x = @as(anyerror![]const u8, &[0]u8{}); |
| 1210 | 1199 | try expect((x catch unreachable).len == 0); |
| ... | ... | @@ -1212,14 +1201,11 @@ test "implicit cast *[0]T to E![]const u8" { |
| 1212 | 1201 | |
| 1213 | 1202 | var global_array: [4]u8 = undefined; |
| 1214 | 1203 | test "cast from array reference to fn: comptime fn ptr" { |
| 1215 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1216 | ||
| 1217 | 1204 | const f = @ptrCast(*const fn () callconv(.C) void, &global_array); |
| 1218 | 1205 | try expect(@ptrToInt(f) == @ptrToInt(&global_array)); |
| 1219 | 1206 | } |
| 1220 | 1207 | test "cast from array reference to fn: runtime fn ptr" { |
| 1221 | 1208 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 1222 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1223 | 1209 | |
| 1224 | 1210 | var f = @ptrCast(*const fn () callconv(.C) void, &global_array); |
| 1225 | 1211 | try expect(@ptrToInt(f) == @ptrToInt(&global_array)); |
| ... | ... | @@ -1243,8 +1229,6 @@ test "*const [N]null u8 to ?[]const u8" { |
| 1243 | 1229 | } |
| 1244 | 1230 | |
| 1245 | 1231 | test "cast between [*c]T and ?[*:0]T on fn parameter" { |
| 1246 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1247 | ||
| 1248 | 1232 | const S = struct { |
| 1249 | 1233 | const Handler = ?fn ([*c]const u8) callconv(.C) void; |
| 1250 | 1234 | fn addCallback(handler: Handler) void { |
| ... | ... | @@ -1276,7 +1260,6 @@ test "assignment to optional pointer result loc" { |
| 1276 | 1260 | test "cast between *[N]void and []void" { |
| 1277 | 1261 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1278 | 1262 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1279 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1280 | 1263 | |
| 1281 | 1264 | var a: [4]void = undefined; |
| 1282 | 1265 | var b: []void = &a; |
| ... | ... | @@ -1286,7 +1269,6 @@ test "cast between *[N]void and []void" { |
| 1286 | 1269 | test "peer resolve arrays of different size to const slice" { |
| 1287 | 1270 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1288 | 1271 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1289 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1290 | 1272 | |
| 1291 | 1273 | try expect(mem.eql(u8, boolToStr(true), "true")); |
| 1292 | 1274 | try expect(mem.eql(u8, boolToStr(false), "false")); |
| ... | ... | @@ -1357,7 +1339,6 @@ test "peer type resolution: unreachable, null, slice" { |
| 1357 | 1339 | test "cast i8 fn call peers to i32 result" { |
| 1358 | 1340 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 1359 | 1341 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 1360 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 1361 | 1342 | |
| 1362 | 1343 | const S = struct { |
| 1363 | 1344 | fn doTheTest() !void { |
test/behavior/defer.zig-1| ... | ... | @@ -95,7 +95,6 @@ fn runSomeErrorDefers(x: bool) !bool { |
| 95 | 95 | } |
| 96 | 96 | |
| 97 | 97 | test "mixing normal and error defers" { |
| 98 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 99 | 98 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; // TODO |
| 100 | 99 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 101 | 100 |
test/behavior/enum.zig-6| ... | ... | @@ -616,7 +616,6 @@ fn testEnumWithSpecifiedTagValues(x: MultipleChoice) !void { |
| 616 | 616 | } |
| 617 | 617 | |
| 618 | 618 | test "enum with specified tag values" { |
| 619 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 620 | 619 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 621 | 620 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 622 | 621 | |
| ... | ... | @@ -625,7 +624,6 @@ test "enum with specified tag values" { |
| 625 | 624 | } |
| 626 | 625 | |
| 627 | 626 | test "non-exhaustive enum" { |
| 628 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 629 | 627 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 630 | 628 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 631 | 629 | |
| ... | ... | @@ -691,7 +689,6 @@ test "empty non-exhaustive enum" { |
| 691 | 689 | } |
| 692 | 690 | |
| 693 | 691 | test "single field non-exhaustive enum" { |
| 694 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 695 | 692 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 696 | 693 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 697 | 694 | |
| ... | ... | @@ -760,7 +757,6 @@ test "cast integer literal to enum" { |
| 760 | 757 | } |
| 761 | 758 | |
| 762 | 759 | test "enum with specified and unspecified tag values" { |
| 763 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 764 | 760 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 765 | 761 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 766 | 762 | |
| ... | ... | @@ -942,7 +938,6 @@ test "enum value allocation" { |
| 942 | 938 | } |
| 943 | 939 | |
| 944 | 940 | test "enum literal casting to tagged union" { |
| 945 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 946 | 941 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 947 | 942 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 948 | 943 | |
| ... | ... | @@ -968,7 +963,6 @@ test "enum literal casting to tagged union" { |
| 968 | 963 | const Bar = enum { A, B, C, D }; |
| 969 | 964 | |
| 970 | 965 | test "enum literal casting to error union with payload enum" { |
| 971 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 972 | 966 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 973 | 967 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 974 | 968 |
test/behavior/error.zig-9| ... | ... | @@ -23,7 +23,6 @@ fn shouldBeNotEqual(a: anyerror, b: anyerror) void { |
| 23 | 23 | } |
| 24 | 24 | |
| 25 | 25 | test "error binary operator" { |
| 26 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 27 | 26 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 28 | 27 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 29 | 28 | |
| ... | ... | @@ -58,7 +57,6 @@ pub fn baz() anyerror!i32 { |
| 58 | 57 | } |
| 59 | 58 | |
| 60 | 59 | test "error wrapping" { |
| 61 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 62 | 60 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 63 | 61 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 64 | 62 | |
| ... | ... | @@ -66,7 +64,6 @@ test "error wrapping" { |
| 66 | 64 | } |
| 67 | 65 | |
| 68 | 66 | test "unwrap simple value from error" { |
| 69 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 70 | 67 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 71 | 68 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 72 | 69 | |
| ... | ... | @@ -78,7 +75,6 @@ fn unwrapSimpleValueFromErrorDo() anyerror!isize { |
| 78 | 75 | } |
| 79 | 76 | |
| 80 | 77 | test "error return in assignment" { |
| 81 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 82 | 78 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 83 | 79 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 84 | 80 | |
| ... | ... | @@ -103,7 +99,6 @@ test "syntax: optional operator in front of error union operator" { |
| 103 | 99 | } |
| 104 | 100 | |
| 105 | 101 | test "widen cast integer payload of error union function call" { |
| 106 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 107 | 102 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 108 | 103 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 109 | 104 | |
| ... | ... | @@ -121,7 +116,6 @@ test "widen cast integer payload of error union function call" { |
| 121 | 116 | } |
| 122 | 117 | |
| 123 | 118 | test "debug info for optional error set" { |
| 124 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 125 | 119 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 126 | 120 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 127 | 121 | |
| ... | ... | @@ -173,7 +167,6 @@ fn bar2() (error{}!void) {} |
| 173 | 167 | test "error union type " { |
| 174 | 168 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 175 | 169 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 176 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 177 | 170 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; // TODO |
| 178 | 171 | |
| 179 | 172 | try testErrorUnionType(); |
| ... | ... | @@ -191,7 +184,6 @@ fn testErrorUnionType() !void { |
| 191 | 184 | test "error set type" { |
| 192 | 185 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 193 | 186 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 194 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 195 | 187 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; // TODO |
| 196 | 188 | |
| 197 | 189 | try testErrorSetType(); |
| ... | ... | @@ -312,7 +304,6 @@ test "error: Infer error set from literals" { |
| 312 | 304 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 313 | 305 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; // TODO |
| 314 | 306 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 315 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 316 | 307 | if (builtin.zig_backend == .stage2_wasm) return error.SkipZigTest; // TODO |
| 317 | 308 | |
| 318 | 309 | _ = nullLiteral("n") catch |err| handleErrors(err); |
test/behavior/fn.zig-1| ... | ... | @@ -216,7 +216,6 @@ fn addPointCoords(pt: Point) i32 { |
| 216 | 216 | } |
| 217 | 217 | |
| 218 | 218 | test "pass by non-copying value through var arg" { |
| 219 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 220 | 219 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 221 | 220 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 222 | 221 |
test/behavior/if.zig-1| ... | ... | @@ -48,7 +48,6 @@ var global_with_val: anyerror!u32 = 0; |
| 48 | 48 | var global_with_err: anyerror!u32 = error.SomeError; |
| 49 | 49 | |
| 50 | 50 | test "unwrap mutable global var" { |
| 51 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 52 | 51 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 53 | 52 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 54 | 53 |
test/behavior/ir_block_deps.zig-1| ... | ... | @@ -20,7 +20,6 @@ fn getErrInt() anyerror!i32 { |
| 20 | 20 | test "ir block deps" { |
| 21 | 21 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 22 | 22 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 23 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 24 | 23 | |
| 25 | 24 | try expect((foo(1) catch unreachable) == 0); |
| 26 | 25 | try expect((foo(2) catch unreachable) == 0); |
test/behavior/namespace_depends_on_compile_var.zig-1| ... | ... | @@ -4,7 +4,6 @@ const expect = std.testing.expect; |
| 4 | 4 | |
| 5 | 5 | test "namespace depends on compile var" { |
| 6 | 6 | if (builtin.zig_backend == .stage2_c) return error.SkipZigTest; |
| 7 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 8 | 7 | if (some_namespace.a_bool) { |
| 9 | 8 | try expect(some_namespace.a_bool); |
| 10 | 9 | } else { |
test/behavior/optional.zig-3| ... | ... | @@ -28,7 +28,6 @@ pub const EmptyStruct = struct {}; |
| 28 | 28 | test "optional pointer to size zero struct" { |
| 29 | 29 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 30 | 30 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 31 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 32 | 31 | |
| 33 | 32 | var e = EmptyStruct{}; |
| 34 | 33 | var o: ?*EmptyStruct = &e; |
| ... | ... | @@ -37,7 +36,6 @@ test "optional pointer to size zero struct" { |
| 37 | 36 | |
| 38 | 37 | test "equality compare optional pointers" { |
| 39 | 38 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 40 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 41 | 39 | |
| 42 | 40 | try testNullPtrsEql(); |
| 43 | 41 | comptime try testNullPtrsEql(); |
| ... | ... | @@ -152,7 +150,6 @@ fn test_cmp_optional_non_optional() !void { |
| 152 | 150 | test "unwrap function call with optional pointer return value" { |
| 153 | 151 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 154 | 152 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 155 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 156 | 153 | |
| 157 | 154 | const S = struct { |
| 158 | 155 | fn entry() !void { |
test/behavior/struct.zig-1| ... | ... | @@ -247,7 +247,6 @@ test "usingnamespace within struct scope" { |
| 247 | 247 | |
| 248 | 248 | test "struct field init with catch" { |
| 249 | 249 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 250 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 251 | 250 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 252 | 251 | |
| 253 | 252 | const S = struct { |
test/behavior/try.zig-1| ... | ... | @@ -3,7 +3,6 @@ const builtin = @import("builtin"); |
| 3 | 3 | const expect = std.testing.expect; |
| 4 | 4 | |
| 5 | 5 | test "try on error union" { |
| 6 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 7 | 6 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 8 | 7 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 9 | 8 |
test/behavior/underscore.zig-1| ... | ... | @@ -7,7 +7,6 @@ test "ignore lval with underscore" { |
| 7 | 7 | } |
| 8 | 8 | |
| 9 | 9 | test "ignore lval with underscore (while loop)" { |
| 10 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 11 | 10 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 12 | 11 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 13 | 12 |
test/behavior/union.zig-7| ... | ... | @@ -272,7 +272,6 @@ const TheUnion = union(TheTag) { |
| 272 | 272 | C: i32, |
| 273 | 273 | }; |
| 274 | 274 | test "cast union to tag type of union" { |
| 275 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 276 | 275 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 277 | 276 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 278 | 277 | |
| ... | ... | @@ -292,7 +291,6 @@ test "union field access gives the enum values" { |
| 292 | 291 | } |
| 293 | 292 | |
| 294 | 293 | test "cast tag type of union to union" { |
| 295 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 296 | 294 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 297 | 295 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 298 | 296 | |
| ... | ... | @@ -307,7 +305,6 @@ const Value2 = union(Letter2) { |
| 307 | 305 | }; |
| 308 | 306 | |
| 309 | 307 | test "implicit cast union to its tag type" { |
| 310 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 311 | 308 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 312 | 309 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 313 | 310 | |
| ... | ... | @@ -401,7 +398,6 @@ test "tagged union with no payloads" { |
| 401 | 398 | } |
| 402 | 399 | |
| 403 | 400 | test "union with only 1 field casted to its enum type" { |
| 404 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 405 | 401 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 406 | 402 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 407 | 403 | |
| ... | ... | @@ -471,7 +467,6 @@ test "initialize global array of union" { |
| 471 | 467 | } |
| 472 | 468 | |
| 473 | 469 | test "update the tag value for zero-sized unions" { |
| 474 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 475 | 470 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 476 | 471 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 477 | 472 | |
| ... | ... | @@ -707,7 +702,6 @@ test "union with only 1 field casted to its enum type which has enum value speci |
| 707 | 702 | } |
| 708 | 703 | |
| 709 | 704 | test "@enumToInt works on unions" { |
| 710 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 711 | 705 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 712 | 706 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; // TODO |
| 713 | 707 | |
| ... | ... | @@ -841,7 +835,6 @@ test "@unionInit can modify a union type" { |
| 841 | 835 | } |
| 842 | 836 | |
| 843 | 837 | test "@unionInit can modify a pointer value" { |
| 844 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; // TODO | |
| 845 | 838 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; // TODO |
| 846 | 839 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; // TODO |
| 847 | 840 |
test/behavior/while.zig-4| ... | ... | @@ -175,7 +175,6 @@ test "while with optional as condition with else" { |
| 175 | 175 | } |
| 176 | 176 | |
| 177 | 177 | test "while with error union condition" { |
| 178 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 179 | 178 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 180 | 179 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 181 | 180 | |
| ... | ... | @@ -248,7 +247,6 @@ fn returnTrue() bool { |
| 248 | 247 | } |
| 249 | 248 | |
| 250 | 249 | test "return with implicit cast from while loop" { |
| 251 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 252 | 250 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 253 | 251 | |
| 254 | 252 | returnWithImplicitCastFromWhileLoopTest() catch unreachable; |
| ... | ... | @@ -260,7 +258,6 @@ fn returnWithImplicitCastFromWhileLoopTest() anyerror!void { |
| 260 | 258 | } |
| 261 | 259 | |
| 262 | 260 | test "while on error union with else result follow else prong" { |
| 263 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 264 | 261 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 265 | 262 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 266 | 263 | |
| ... | ... | @@ -271,7 +268,6 @@ test "while on error union with else result follow else prong" { |
| 271 | 268 | } |
| 272 | 269 | |
| 273 | 270 | test "while on error union with else result follow break prong" { |
| 274 | if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest; | |
| 275 | 271 | if (builtin.zig_backend == .stage2_arm) return error.SkipZigTest; |
| 276 | 272 | if (builtin.zig_backend == .stage2_aarch64) return error.SkipZigTest; |
| 277 | 273 |