@zigc/lib 0.17.0-dev.657 → 0.17.0-dev.690

package/compiler/Maker.zig

@@ -194,7 +194,7 @@ pub fn main(init: process.Init.Minimal) !void {
     var max_rss: u64 = 0;
     var skip_oom_steps = false;
     var test_timeout_ns: ?u64 = null;
-    var color: Color = .auto;
+    var color: Color = .settingFromEnvironment(&graph.environ_map);
     var watch = false;
     var fuzz: ?Fuzz.Mode = null;
     var debounce_interval_ms: u16 = 50;
@@ -533,7 +533,7 @@ pub fn main(init: process.Init.Minimal) !void {
     }
 
     const main_progress_node = std.Progress.start(io, .{
-        .disable_printing = (color == .off),
+        .disable_printing = (graph.stderr_mode.? == .no_color),
     });
     defer main_progress_node.end();
 

package/libc/include/powerpc-linux-gnu/bits/struct_mutex.h

@@ -32,7 +32,7 @@ struct __pthread_mutex_s
   int __kind;
 #if __WORDSIZE == 64
   short __spins;
-  short __unused;
+  short __glibc_reserved;
   __pthread_list_t __list;
 # define __PTHREAD_MUTEX_HAVE_PREV      1
 #else
@@ -59,4 +59,4 @@ struct __pthread_mutex_s
   0, 0, 0, __kind, 0, { { 0, 0 } }
 #endif
 
-#endif
+#endif

package/libc/include/s390x-linux-gnu/bits/fenv.h

@@ -76,7 +76,7 @@ typedef unsigned int fexcept_t; /* size of fpc */
 typedef struct
 {
   fexcept_t __fpc;
-  void *__unused;
+  void *__glibc_reserved;
   /* The field __unused (formerly __ieee_instruction_pointer) is a relict from
      commit "Remove PTRACE_PEEKUSER" (87b9b50f0d4b92248905e95a06a13c513dc45e59)
      and isn't used anymore.  */
@@ -96,4 +96,4 @@ typedef unsigned int femode_t;
 
 /* Default floating-point control modes.  */
 # define FE_DFL_MODE	((const femode_t *) -1L)
-#endif
+#endif

package/libc/include/s390x-linux-gnu/bits/struct_mutex.h

@@ -32,7 +32,7 @@ struct __pthread_mutex_s
   int __kind;
 #if __WORDSIZE == 64
   short __spins;
-  short __unused;
+  short __glibc_reserved;
   __pthread_list_t __list;
 # define __PTHREAD_MUTEX_HAVE_PREV      1
 #else
@@ -59,4 +59,4 @@ struct __pthread_mutex_s
   0, 0, 0, __kind, 0, { { 0, 0 } }
 #endif
 
-#endif
+#endif

package/libc/include/x86-linux-gnu/bits/struct_mutex.h

@@ -32,7 +32,7 @@ struct __pthread_mutex_s
   int __kind;
 #ifdef __x86_64__
   short __spins;
-  short __unused;
+  short __glibc_reserved;
   __pthread_list_t __list;
 # define __PTHREAD_MUTEX_HAVE_PREV      1
 #else
@@ -59,4 +59,4 @@ struct __pthread_mutex_s
   0, 0, 0, __kind, 0, { { 0, 0 } }
 #endif
 
-#endif
+#endif

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@zigc/lib",
-  "version": "0.17.0-dev.657",
+  "version": "0.17.0-dev.690",
   "description": "Zig standard library and libc headers (shared across all platforms)",
   "repository": {
     "type": "git",

package/std/Build/Cache/Path.zig

@@ -178,22 +178,15 @@ pub fn formatEscapeChar(path: Path, writer: *Io.Writer) Io.Writer.Error!void {
 
 pub fn format(self: Path, writer: *Io.Writer) Io.Writer.Error!void {
     if (Io.Dir.path.isAbsolute(self.sub_path)) {
-        try writer.writeAll(self.sub_path);
-        return;
+        return writer.writeAll(self.sub_path);
+    } else if (self.root_dir.path) |p| {
+        var bufs: [3][]const u8 = .{ p, Io.Dir.path.sep_str, self.sub_path };
+        return writer.writeVecAll(bufs[0..if (self.sub_path.len > 0) 3 else 1]);
+    } else if (self.sub_path.len > 0) {
+        return writer.writeAll(self.sub_path);
+    } else {
+        return writer.writeByte('.');
     }
-    if (self.root_dir.path) |p| {
-        try writer.writeAll(p);
-        if (self.sub_path.len > 0) {
-            try writer.writeAll(Io.Dir.path.sep_str);
-            try writer.writeAll(self.sub_path);
-        }
-        return;
-    }
-    if (self.sub_path.len > 0) {
-        try writer.writeAll(self.sub_path);
-        return;
-    }
-    try writer.writeByte('.');
 }
 
 pub fn eql(self: Path, other: Path) bool {

package/std/crypto/aes/aesni.zig

@@ -312,7 +312,7 @@ pub fn BlockVec(comptime blocks_count: comptime_int) type {
         }
 
         /// Apply the bitwise OR operation to the content of two block vectors.
-        pub fn orBlocks(block_vec1: Self, block_vec2: Block) Self {
+        pub fn orBlocks(block_vec1: Self, block_vec2: Self) Self {
             var out: Self = undefined;
             inline for (0..native_words) |i| {
                 out.repr[i] = block_vec1.repr[i] | block_vec2.repr[i];

package/std/crypto/aes/armcrypto.zig

@@ -216,10 +216,10 @@ pub fn BlockVec(comptime blocks_count: comptime_int) type {
         }
 
         /// XOR the block vector with a byte sequence.
-        pub fn xorBytes(block_vec: Self, bytes: *const [blocks_count * 16]u8) [32]u8 {
-            var out: Self = undefined;
+        pub fn xorBytes(block_vec: Self, bytes: *const [blocks_count * 16]u8) [blocks_count * 16]u8 {
+            var out: [blocks_count * 16]u8 = undefined;
             inline for (0..native_words) |i| {
-                out.repr[i] = block_vec.repr[i].xorBytes(bytes[i * native_word_size ..][0..native_word_size]);
+                out[i * native_word_size ..][0..native_word_size].* = block_vec.repr[i].xorBytes(bytes[i * native_word_size ..][0..native_word_size]);
             }
             return out;
         }
@@ -279,7 +279,7 @@ pub fn BlockVec(comptime blocks_count: comptime_int) type {
         }
 
         /// Apply the bitwise OR operation to the content of two block vectors.
-        pub fn orBlocks(block_vec1: Self, block_vec2: Block) Self {
+        pub fn orBlocks(block_vec1: Self, block_vec2: Self) Self {
             var out: Self = undefined;
             inline for (0..native_words) |i| {
                 out.repr[i] = block_vec1.repr[i].orBlocks(block_vec2.repr[i]);

package/std/crypto/aes/soft.zig

@@ -391,10 +391,10 @@ pub fn BlockVec(comptime blocks_count: comptime_int) type {
         }
 
         /// XOR the block vector with a byte sequence.
-        pub fn xorBytes(block_vec: Self, bytes: *const [blocks_count * 16]u8) [32]u8 {
-            var out: Self = undefined;
+        pub fn xorBytes(block_vec: Self, bytes: *const [blocks_count * 16]u8) [blocks_count * 16]u8 {
+            var out: [blocks_count * 16]u8 = undefined;
             for (0..native_words) |i| {
-                out.repr[i] = block_vec.repr[i].xorBytes(bytes[i * native_word_size ..][0..native_word_size]);
+                out[i * native_word_size ..][0..native_word_size].* = block_vec.repr[i].xorBytes(bytes[i * native_word_size ..][0..native_word_size]);
             }
             return out;
         }
@@ -454,7 +454,7 @@ pub fn BlockVec(comptime blocks_count: comptime_int) type {
         }
 
         /// Apply the bitwise OR operation to the content of two block vectors.
-        pub fn orBlocks(block_vec1: Self, block_vec2: Block) Self {
+        pub fn orBlocks(block_vec1: Self, block_vec2: Self) Self {
             var out: Self = undefined;
             for (0..native_words) |i| {
                 out.repr[i] = block_vec1.repr[i].orBlocks(block_vec2.repr[i]);

package/std/crypto/aes.zig

@@ -137,6 +137,18 @@ test "BlockVec invMixColumns" {
     }
 }
 
+test "BlockVec bitwise operations" {
+    const a_bytes: [32]u8 = @splat(0xaa);
+    const b_bytes: [32]u8 = @splat(0xbb);
+    const a = BlockVec(2).fromBytes(&a_bytes);
+    const b = BlockVec(2).fromBytes(&b_bytes);
+
+    try testing.expectEqual(@as([32]u8, @splat(0x11)), a.xorBytes(&b_bytes));
+    try testing.expectEqual(@as([32]u8, @splat(0x11)), a.xorBlocks(b).toBytes());
+    try testing.expectEqual(@as([32]u8, @splat(0xbb)), a.orBlocks(b).toBytes());
+    try testing.expectEqual(@as([32]u8, @splat(0xaa)), a.andBlocks(b).toBytes());
+}
+
 test "expand 256-bit key" {
     const key = [_]u8{
         0x60, 0x3d, 0xeb, 0x10,

package/std/crypto/aes_siv.zig

@@ -226,9 +226,10 @@ fn AesSiv(comptime Aes: anytype) type {
 
         /// Encrypts plaintext with multiple associated data components.
         /// This is the most general form of AES-SIV encryption that accepts
-        /// an arbitrary vector of associated data strings as specified in RFC 5297.
+        /// a vector of up to 126 associated data strings as specified in RFC 5297.
         pub fn encryptWithAdVector(c: []u8, tag: *[tag_length]u8, m: []const u8, ad: []const []const u8, key: [key_length]u8) void {
             debug.assert(c.len == m.len);
+            debug.assert(ad.len <= 126); // AES-SIV supports at most 126 associated data components
 
             // Split key into K1 (for S2V) and K2 (for CTR)
             const k1 = key[0 .. Aes.key_bits / 8];
@@ -260,9 +261,10 @@ fn AesSiv(comptime Aes: anytype) type {
 
         /// Decrypts ciphertext with multiple associated data components.
         /// This is the most general form of AES-SIV decryption that accepts
-        /// an arbitrary vector of associated data strings as specified in RFC 5297.
+        /// a vector of up to 126 associated data strings as specified in RFC 5297.
         pub fn decryptWithAdVector(m: []u8, c: []const u8, tag: [tag_length]u8, ad: []const []const u8, key: [key_length]u8) AuthenticationError!void {
             assert(c.len == m.len);
+            assert(ad.len <= 126); // AES-SIV supports at most 126 associated data components
 
             // Split key into K1 (for S2V) and K2 (for CTR)
             const k1 = key[0 .. Aes.key_bits / 8];

package/std/crypto/codecs/asn1/Oid.zig

@@ -47,7 +47,7 @@ test fromDot {
     }
 }
 
-pub fn toDot(self: Oid, writer: anytype) @TypeOf(writer).Error!void {
+pub fn toDot(self: Oid, writer: *std.Io.Writer) std.Io.Writer.Error!void {
     const encoded = self.encoded;
     const first = @divTrunc(encoded[0], 40);
     const second = encoded[0] - first * 40;
@@ -81,7 +81,7 @@ test toDot {
     for (test_cases) |t| {
         var stream: std.Io.Writer = .fixed(&buf);
         try toDot(Oid{ .encoded = t.encoded }, &stream);
-        try std.testing.expectEqualStrings(t.dot_notation, stream.written());
+        try std.testing.expectEqualStrings(t.dot_notation, stream.buffered());
     }
 }
 

package/std/crypto/codecs/asn1/der/Decoder.zig

@@ -111,21 +111,33 @@ pub fn view(self: Decoder, elem: Element) []const u8 {
 }
 
 fn int(comptime T: type, value: []const u8) error{ NonCanonical, LargeValue }!T {
-    if (@typeInfo(T).int.bits % 8 != 0) @compileError("T must be byte aligned");
-
-    var bytes = value;
-    if (bytes.len >= 2) {
-        if (bytes[0] == 0) {
-            if (@clz(bytes[1]) > 0) return error.NonCanonical;
-            bytes.ptr += 1;
-        }
-        if (bytes[0] == 0xff and @clz(bytes[1]) == 0) return error.NonCanonical;
+    const info = @typeInfo(T).int;
+    if (info.bits % 8 != 0) @compileError("T must be byte aligned");
+
+    if (value.len == 0) return error.NonCanonical;
+    if (value.len >= 2) {
+        if (value[0] == 0x00 and value[1] & 0x80 == 0) return error.NonCanonical;
+        if (value[0] == 0xff and value[1] & 0x80 != 0) return error.NonCanonical;
     }
 
-    if (bytes.len > @sizeOf(T)) return error.LargeValue;
-    if (@sizeOf(T) == 1) return @bitCast(bytes[0]);
+    const had_sign_byte = value.len >= 2 and value[0] == 0x00;
+    const bytes = if (had_sign_byte) value[1..] else value;
+    const der_negative = !had_sign_byte and bytes[0] & 0x80 != 0;
+
+    switch (info.signedness) {
+        .unsigned => {
+            if (der_negative) return error.LargeValue;
+            if (bytes.len > @sizeOf(T)) return error.LargeValue;
+        },
+        .signed => {
+            const max_len: usize = if (had_sign_byte) @sizeOf(T) - 1 else @sizeOf(T);
+            if (bytes.len > max_len) return error.LargeValue;
+        },
+    }
 
-    return std.mem.readVarInt(T, bytes, .big);
+    var buf: [@sizeOf(T)]u8 = @splat(if (der_negative) 0xff else 0);
+    @memcpy(buf[buf.len - bytes.len ..], bytes);
+    return std.mem.readInt(T, &buf, .big);
 }
 
 test int {
@@ -135,7 +147,26 @@ test int {
 
     const big = [_]u8{ 0xef, 0xff };
     try expectError(error.LargeValue, int(u8, &big));
-    try expectEqual(0xefff, int(u16, &big));
+    try expectError(error.LargeValue, int(u16, &big));
+    try expectEqual(@as(i16, -4097), try int(i16, &big));
+
+    try expectEqual(@as(u16, 255), try int(u16, &.{ 0x00, 0xff }));
+    try expectEqual(@as(u16, 0x8000), try int(u16, &.{ 0x00, 0x80, 0x00 }));
+
+    try expectEqual(@as(i8, -1), try int(i8, &.{0xff}));
+    try expectEqual(@as(i16, -1), try int(i16, &.{0xff}));
+    try expectEqual(@as(i16, -128), try int(i16, &.{0x80}));
+    try expectEqual(@as(i16, -129), try int(i16, &.{ 0xff, 0x7f }));
+    try expectEqual(@as(i16, 255), try int(i16, &.{ 0x00, 0xff }));
+    try expectEqual(@as(i32, 0x7fffffff), try int(i32, &.{ 0x7f, 0xff, 0xff, 0xff }));
+
+    try expectError(error.LargeValue, int(i8, &.{ 0x00, 0xff }));
+    try expectError(error.LargeValue, int(i16, &.{ 0x00, 0x80, 0x00 }));
+    try expectError(error.LargeValue, int(i32, &.{ 0x00, 0x80, 0x00, 0x00, 0x00 }));
+
+    try expectError(error.LargeValue, int(u8, &.{0xff}));
+    try expectError(error.LargeValue, int(u16, &.{0x80}));
+    try expectError(error.LargeValue, int(u32, &.{ 0x80, 0x00, 0x00, 0x00 }));
 }
 
 test Decoder {

package/std/crypto/codecs/asn1/der/Encoder.zig

@@ -24,6 +24,7 @@ pub fn any(self: *Encoder, val: anytype) !void {
 fn anyTag(self: *Encoder, tag_: Tag, val: anytype) !void {
     const T = @TypeOf(val);
     if (std.meta.hasFn(T, "encodeDer")) return try val.encodeDer(self);
+    const outer_field_tag = self.field_tag;
     const start = self.buffer.data.len;
     const merged_tag = self.mergedTag(tag_);
 
@@ -42,8 +43,9 @@ fn anyTag(self: *Encoder, tag_: Tag, val: anytype) !void {
                 const is_default = if (f_attrs.@"comptime") false else if (f_attrs.defaultValue(f_type)) |default_val| brk: {
                     break :brk std.mem.eql(u8, std.mem.asBytes(&default_val), std.mem.asBytes(&field_val));
                 } else false;
+                const is_null_optional = if (@typeInfo(f_type) == .optional) field_val == null else false;
 
-                if (!is_default) {
+                if (!is_default and !is_null_optional) {
                     const start2 = self.buffer.data.len;
                     self.field_tag = field_tag;
                     // will merge with self.field_tag.
@@ -58,6 +60,7 @@ fn anyTag(self: *Encoder, tag_: Tag, val: anytype) !void {
                     }
                 }
             }
+            self.field_tag = outer_field_tag;
         },
         .bool => try self.buffer.prependSlice(&[_]u8{if (val) 0xff else 0}),
         .int => try self.int(T, val),
@@ -68,7 +71,7 @@ fn anyTag(self: *Encoder, tag_: Tag, val: anytype) !void {
                 try self.int(e.tag_type, @intFromEnum(val));
             }
         },
-        .optional => if (val) |v| return try self.anyTag(tag_, v),
+        .optional => if (val) |v| return try self.anyTag(tag_, v) else return,
         .null => {},
         else => @compileError("cannot encode type " ++ @typeName(T)),
     }
@@ -80,7 +83,8 @@ fn anyTag(self: *Encoder, tag_: Tag, val: anytype) !void {
 /// Encode a tag.
 pub fn tag(self: *Encoder, tag_: Tag) !void {
     const t = self.mergedTag(tag_);
-    try t.encode(self.writer());
+    var buf: [Tag.max_encoded_len]u8 = undefined;
+    try self.buffer.prependSlice(t.encodeToSlice(&buf));
 }
 
 fn mergedTag(self: *Encoder, tag_: Tag) Tag {
@@ -96,19 +100,14 @@ fn mergedTag(self: *Encoder, tag_: Tag) Tag {
 
 /// Encode a length.
 pub fn length(self: *Encoder, len: usize) !void {
-    const writer_ = self.writer();
-    if (len < 128) {
-        try writer_.writeInt(u8, @intCast(len), .big);
-        return;
-    }
-    inline for ([_]type{ u8, u16, u32 }) |T| {
-        if (len < std.math.maxInt(T)) {
-            try writer_.writeInt(T, @intCast(len), .big);
-            try writer_.writeInt(u8, @sizeOf(T) | 0x80, .big);
-            return;
-        }
-    }
-    return error.InvalidLength;
+    if (len < 128) return self.buffer.prependSlice(&.{@intCast(len)});
+    const len32 = std.math.cast(u32, len) orelse return error.InvalidLength;
+    var buf: [@sizeOf(u32) + 1]u8 = undefined;
+    std.mem.writeInt(u32, buf[1..], len32, .big);
+    var first: usize = 1;
+    while (buf[first] == 0) first += 1;
+    buf[first - 1] = @intCast((buf.len - first) | 0x80);
+    return self.buffer.prependSlice(buf[first - 1 ..]);
 }
 
 /// Encode a tag and length-prefixed bytes.
@@ -118,28 +117,23 @@ pub fn tagBytes(self: *Encoder, tag_: Tag, bytes: []const u8) !void {
     try self.tag(tag_);
 }
 
-/// Warning: This writer writes backwards. `fn print` will NOT work as expected.
-pub fn writer(self: *Encoder) ArrayListReverse.Writer {
-    return self.buffer.writer();
+/// Write raw bytes. The encoder builds its output back-to-front, so chained
+/// calls should be made in reverse of the desired on-wire order.
+pub fn prependBytes(self: *Encoder, bytes: []const u8) !void {
+    return self.buffer.prependSlice(bytes);
 }
 
 fn int(self: *Encoder, comptime T: type, value: T) !void {
-    const big = std.mem.nativeTo(T, value, .big);
-    const big_bytes = std.mem.asBytes(&big);
-
-    const bits_needed = @bitSizeOf(T) - @clz(value);
-    const needs_padding: u1 = if (value == 0)
-        1
-    else if (bits_needed > 8) brk: {
-        const RightShift = @Int(.unsigned, @bitSizeOf(@TypeOf(bits_needed)) - 1);
-        const right_shift: RightShift = @intCast(bits_needed - 9);
-        break :brk if (value >> right_shift == 0x1ff) 1 else 0;
-    } else 0;
-    const bytes_needed = try std.math.divCeil(usize, bits_needed, 8) + needs_padding;
-
-    const writer_ = self.writer();
-    for (0..bytes_needed - needs_padding) |i| try writer_.writeByte(big_bytes[big_bytes.len - i - 1]);
-    if (needs_padding == 1) try writer_.writeByte(0);
+    const info = @typeInfo(T).int;
+    const Unsigned = @Int(.unsigned, info.bits);
+    const pad: u8 = if (info.signedness == .signed and value < 0) 0xff else 0;
+    var buf: [@sizeOf(Unsigned) + 1]u8 = undefined;
+    buf[0] = pad;
+    std.mem.writeInt(Unsigned, buf[1..], @bitCast(value), .big);
+
+    var first: usize = 0;
+    while (first + 1 < buf.len and buf[first] == pad and (buf[first + 1] ^ pad) & 0x80 == 0) first += 1;
+    try self.buffer.prependSlice(buf[first..]);
 }
 
 test int {
@@ -148,15 +142,84 @@ test int {
     defer encoder.deinit();
 
     try encoder.int(u8, 0);
-    try std.testing.expectEqualSlices(u8, &[_]u8{0}, encoder.buffer.data);
+    try std.testing.expectEqualSlices(u8, &.{0}, encoder.buffer.data);
 
     encoder.buffer.clearAndFree();
     try encoder.int(u16, 0x00ff);
-    try std.testing.expectEqualSlices(u8, &[_]u8{0xff}, encoder.buffer.data);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0xff }, encoder.buffer.data);
 
     encoder.buffer.clearAndFree();
     try encoder.int(u32, 0xffff);
-    try std.testing.expectEqualSlices(u8, &[_]u8{ 0, 0xff, 0xff }, encoder.buffer.data);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0xff, 0xff }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u32, 0x01020304);
+    try std.testing.expectEqualSlices(u8, &.{ 0x01, 0x02, 0x03, 0x04 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u8, 127);
+    try std.testing.expectEqualSlices(u8, &.{0x7f}, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u16, 128);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0x80 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u16, 256);
+    try std.testing.expectEqualSlices(u8, &.{ 0x01, 0x00 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u8, 128);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0x80 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u8, 255);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0xff }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(u16, 0x8000);
+    try std.testing.expectEqualSlices(u8, &.{ 0, 0x80, 0 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(i8, -1);
+    try std.testing.expectEqualSlices(u8, &.{0xff}, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(i8, -128);
+    try std.testing.expectEqualSlices(u8, &.{0x80}, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.int(i16, -129);
+    try std.testing.expectEqualSlices(u8, &.{ 0xff, 0x7f }, encoder.buffer.data);
+}
+
+test length {
+    const allocator = std.testing.allocator;
+    var encoder = Encoder.init(allocator);
+    defer encoder.deinit();
+
+    try encoder.length(127);
+    try std.testing.expectEqualSlices(u8, &.{0x7f}, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.length(128);
+    try std.testing.expectEqualSlices(u8, &.{ 0x81, 0x80 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.length(255);
+    try std.testing.expectEqualSlices(u8, &.{ 0x81, 0xff }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.length(256);
+    try std.testing.expectEqualSlices(u8, &.{ 0x82, 0x01, 0x00 }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.length(65535);
+    try std.testing.expectEqualSlices(u8, &.{ 0x82, 0xff, 0xff }, encoder.buffer.data);
+
+    encoder.buffer.clearAndFree();
+    try encoder.length(65536);
+    try std.testing.expectEqualSlices(u8, &.{ 0x83, 0x01, 0x00, 0x00 }, encoder.buffer.data);
 }
 
 const std = @import("std");

package/std/crypto/codecs/asn1/der.zig

@@ -49,6 +49,48 @@ test decode {
     try std.testing.expectEqualDeep(test_case.value, decoded);
 }
 
+test "integer round trip across signed and unsigned boundaries" {
+    const allocator = std.testing.allocator;
+    inline for (.{ u8, u16, u32, i8, i16, i32 }) |T| {
+        const cases = comptime blk: {
+            const min = std.math.minInt(T);
+            const max = std.math.maxInt(T);
+            break :blk [_]T{ 0, 1, max, min, @divTrunc(max, 2), @divTrunc(min, 2) };
+        };
+        for (cases) |value| {
+            const buf = try encode(allocator, value);
+            defer allocator.free(buf);
+            const decoded = try decode(T, buf);
+            try std.testing.expectEqual(value, decoded);
+        }
+    }
+}
+
+test "encode skips null optional fields" {
+    const Value = struct { a: ?u8, b: u8 };
+    const allocator = std.testing.allocator;
+    const actual = try encode(allocator, Value{ .a = null, .b = 5 });
+    defer allocator.free(actual);
+
+    try std.testing.expectEqualSlices(u8, &.{ 0x30, 0x03, 0x02, 0x01, 0x05 }, actual);
+}
+
+test "encode preserves outer sequence tag after implicit field tags" {
+    const Value = struct {
+        a: u8,
+        b: u8,
+
+        pub const asn1_tags = .{
+            .a = asn1.FieldTag.initImplicit(0, .context_specific),
+        };
+    };
+    const allocator = std.testing.allocator;
+    const actual = try encode(allocator, Value{ .a = 1, .b = 2 });
+    defer allocator.free(actual);
+
+    try std.testing.expectEqualSlices(u8, &.{ 0x30, 0x06, 0x80, 0x01, 0x01, 0x02, 0x01, 0x02 }, actual);
+}
+
 test {
     _ = Decoder;
     _ = Encoder;

package/std/crypto/codecs/asn1.zig

@@ -71,16 +71,18 @@ pub const Tag = struct {
 
     pub fn decode(reader: *std.Io.Reader) !Tag {
         const tag1: FirstTag = @bitCast(try reader.takeByte());
-        var number: u14 = tag1.number;
-
-        if (tag1.number == 31) {
-            const tag2: NextTag = @bitCast(try reader.takeByte());
-            number = tag2.number;
-            if (tag2.continues) {
-                const tag3: NextTag = @bitCast(try reader.takeByte());
-                number = (number << 7) + tag3.number;
-                if (tag3.continues) return error.EndOfStream;
-            }
+        var number: std.meta.Tag(Tag.Number) = tag1.number;
+
+        if (tag1.number == high_tag_marker) {
+            number = 0;
+            for (0..max_continuations) |i| {
+                const next: NextTag = @bitCast(try reader.takeByte());
+                if (i == 0 and next.number == 0) return error.InvalidEncoding;
+                number = std.math.shlExact(@TypeOf(number), number, 7) catch return error.InvalidEncoding;
+                number |= next.number;
+                if (!next.continues) break;
+            } else return error.InvalidEncoding;
+            if (number < high_tag_marker) return error.InvalidEncoding;
         }
 
         return Tag{
@@ -90,40 +92,51 @@ pub const Tag = struct {
         };
     }
 
-    pub fn encode(self: Tag, writer: *std.Io.Writer) @TypeOf(writer).Error!void {
-        var tag1 = FirstTag{
+    pub fn encodeToSlice(self: Tag, buf: *[max_encoded_len]u8) []const u8 {
+        const n = @intFromEnum(self.number);
+        var tag1: FirstTag = .{
             .number = undefined,
             .constructed = self.constructed,
             .class = self.class,
         };
 
-        var buffer: [3]u8 = undefined;
-        var writer2: std.Io.Writer = .init(&buffer);
+        if (n < high_tag_marker) {
+            tag1.number = @intCast(n);
+            buf[0] = @bitCast(tag1);
+            return buf[0..1];
+        }
 
-        switch (@intFromEnum(self.number)) {
-            0...std.math.maxInt(u5) => |n| {
-                tag1.number = @intCast(n);
-                writer2.writeByte(@bitCast(tag1)) catch unreachable;
-            },
-            std.math.maxInt(u5) + 1...std.math.maxInt(u7) => |n| {
-                tag1.number = 15;
-                const tag2 = NextTag{ .number = @intCast(n), .continues = false };
-                writer2.writeByte(@bitCast(tag1)) catch unreachable;
-                writer2.writeByte(@bitCast(tag2)) catch unreachable;
-            },
-            else => |n| {
-                tag1.number = 15;
-                const tag2 = NextTag{ .number = @intCast(n >> 7), .continues = true };
-                const tag3 = NextTag{ .number = @truncate(n), .continues = false };
-                writer2.writeByte(@bitCast(tag1)) catch unreachable;
-                writer2.writeByte(@bitCast(tag2)) catch unreachable;
-                writer2.writeByte(@bitCast(tag3)) catch unreachable;
-            },
+        tag1.number = high_tag_marker;
+        buf[0] = @bitCast(tag1);
+
+        const bits_used = @bitSizeOf(@TypeOf(n)) - @clz(n);
+        const len = std.math.divCeil(usize, bits_used, 7) catch unreachable;
+
+        var remaining = n;
+        var i = len;
+        while (i > 0) : (i -= 1) {
+            buf[i] = @bitCast(NextTag{
+                .number = @truncate(remaining),
+                .continues = i != len,
+            });
+            remaining >>= 7;
         }
+        return buf[0 .. 1 + len];
+    }
 
-        _ = try writer.write(writer2.buffered());
+    pub fn encode(self: Tag, writer: *std.Io.Writer) std.Io.Writer.Error!void {
+        var buf: [max_encoded_len]u8 = undefined;
+        try writer.writeAll(self.encodeToSlice(&buf));
     }
 
+    pub const max_encoded_len = 1 + (std.math.divCeil(
+        comptime_int,
+        @bitSizeOf(std.meta.Tag(Tag.Number)),
+        7,
+    ) catch unreachable);
+    const max_continuations = max_encoded_len - 1;
+    const high_tag_marker = std.math.maxInt(u5);
+
     const FirstTag = packed struct(u8) { number: u5, constructed: bool, class: Tag.Class };
     const NextTag = packed struct(u8) { number: u7, continues: bool };
 
@@ -165,6 +178,42 @@ test Tag {
     try std.testing.expectEqual(Tag.init(@enumFromInt(3), true, .context_specific), t);
 }
 
+test "Tag.encode produces the exact bytes from X.690" {
+    const cases = [_]struct { number: u16, expected: []const u8 }{
+        .{ .number = 0, .expected = &.{0x00} },
+        .{ .number = 30, .expected = &.{0x1e} },
+        .{ .number = 31, .expected = &.{ 0x1f, 0x1f } },
+        .{ .number = 127, .expected = &.{ 0x1f, 0x7f } },
+        .{ .number = 128, .expected = &.{ 0x1f, 0x81, 0x00 } },
+        .{ .number = 16383, .expected = &.{ 0x1f, 0xff, 0x7f } },
+        .{ .number = 16384, .expected = &.{ 0x1f, 0x81, 0x80, 0x00 } },
+        .{ .number = 65535, .expected = &.{ 0x1f, 0x83, 0xff, 0x7f } },
+    };
+    for (cases) |c| {
+        const tag = Tag.init(@enumFromInt(c.number), false, .universal);
+        var buf: [Tag.max_encoded_len]u8 = undefined;
+        try std.testing.expectEqualSlices(u8, c.expected, tag.encodeToSlice(&buf));
+    }
+}
+
+test "Tag.encode/decode round trip" {
+    for ([_]u16{ 0, 30, 31, 32, 127, 128, 16383, 16384, 65535 }) |n| {
+        const tag = Tag.init(@enumFromInt(n), false, .universal);
+        var buf: [Tag.max_encoded_len]u8 = undefined;
+        const encoded = tag.encodeToSlice(&buf);
+        var reader: std.Io.Reader = .fixed(encoded);
+        try std.testing.expectEqual(tag, try Tag.decode(&reader));
+        try std.testing.expectEqual(encoded.len, reader.seek);
+    }
+}
+
+test "Tag.decode rejects non-minimal high-tag form" {
+    for ([_][]const u8{ &.{ 0x1f, 0x1e }, &.{ 0x1f, 0x80, 0x01 } }) |bytes| {
+        var reader: std.Io.Reader = .fixed(bytes);
+        try std.testing.expectError(error.InvalidEncoding, Tag.decode(&reader));
+    }
+}
+
 /// A decoded view.
 pub const Element = struct {
     tag: Tag,
@@ -183,13 +232,14 @@ pub const Element = struct {
         }
     };
 
-    pub const DecodeError = error{EndOfStream};
+    pub const DecodeError = error{ EndOfStream, InvalidEncoding };
 
     /// Safely decode a DER/BER/CER element at `index`:
     /// - Ensures length uses shortest form
     /// - Ensures length is within `bytes`
     /// - Ensures length is less than `std.math.maxInt(Index)`
     pub fn decode(bytes: []const u8, index: Index) DecodeError!Element {
+        if (index > bytes.len) return error.EndOfStream;
         var reader: std.Io.Reader = .fixed(bytes[index..]);
 
         const tag = Tag.decode(&reader) catch |err| switch (err) {
@@ -327,13 +377,22 @@ pub const BitString = struct {
     }
 
     pub fn encodeDer(self: BitString, encoder: *der.Encoder) !void {
-        try encoder.writer().writeAll(self.bytes);
-        try encoder.writer().writeByte(self.right_padding);
+        try encoder.prependBytes(self.bytes);
+        try encoder.prependBytes(&.{self.right_padding});
         try encoder.length(self.bytes.len + 1);
         try encoder.tag(asn1_tag);
     }
 };
 
+test BitString {
+    const bs = BitString{ .bytes = &.{ 0x6e, 0x5d, 0xc0 }, .right_padding = 6 };
+    const allocator = std.testing.allocator;
+    const buf = try der.encode(allocator, bs);
+    defer allocator.free(buf);
+    try std.testing.expectEqualSlices(u8, &.{ 0x03, 0x04, 0x06, 0x6e, 0x5d, 0xc0 }, buf);
+    try std.testing.expectEqualDeep(bs, try der.decode(BitString, buf));
+}
+
 pub fn Opaque(comptime tag: Tag) type {
     return struct {
         bytes: []const u8,

package/std/crypto/codecs.zig

@@ -1,3 +1,9 @@
 pub const asn1 = @import("codecs/asn1.zig");
 pub const base64 = @import("codecs/base64_hex_ct.zig").base64;
 pub const hex = @import("codecs/base64_hex_ct.zig").hex;
+
+test {
+    _ = asn1;
+    _ = base64;
+    _ = hex;
+}

package/std/debug/SelfInfo/Elf.zig

@@ -116,7 +116,7 @@ pub const can_unwind: bool = s: {
             .x86,
             .x86_64,
         },
-        // Not supported yet: arm/armeb/thumb/thumbeb, hppa, hppa64, microblaze/microblazeel, xtensa/xtensaeb
+        // Not supported yet: arm/armeb/thumb/thumbeb, hppa, hppa64, microblaze/microblazeel
         .linux => &.{
             .aarch64,
             .aarch64_be,

package/std/debug/SelfInfo/MachO.zig

@@ -93,12 +93,28 @@ pub fn getSymbols(
 pub fn getModuleName(si: *SelfInfo, io: Io, address: usize) Error![]const u8 {
     _ = si;
     _ = io;
-    // This function is marked as deprecated; however, it is significantly more
-    // performant than `dladdr` (since the latter also does a very slow symbol
-    // lookup), so let's use it since it's still available.
-    return std.mem.span(std.c.dyld_image_path_containing_address(
-        @ptrFromInt(address),
-    ) orelse return error.MissingDebugInfo);
+    return getModuleNameInner(address) orelse return error.MissingDebugInfo;
+}
+fn getModuleNameInner(address: usize) ?[]const u8 {
+    switch (builtin.target.os.tag) {
+        .macos => {
+            // This function is marked as deprecated; however, it is significantly more performant
+            // than `dladdr` (since the latter also does a very slow symbol lookup), so let's just
+            // use it for the better performance since it's still available.
+            return std.mem.span(std.c.dyld_image_path_containing_address(
+                @ptrFromInt(address),
+            ) orelse return null);
+        },
+        else => {
+            // On other Darwin systems, the function used above is entirely unavailable, so we have
+            // no choice but to use the slow `dladdr`.
+            var info: std.c.dl_info = undefined;
+            if (std.c.dladdr(@ptrFromInt(address), &info) == 0) {
+                return null;
+            }
+            return std.mem.span(info.fname);
+        },
+    }
 }
 pub fn getModuleSlide(si: *SelfInfo, io: Io, address: usize) Error!usize {
     const gpa = std.debug.getDebugInfoAllocator();
@@ -446,12 +462,25 @@ fn unwindFrameInner(si: *SelfInfo, io: Io, context: *UnwindContext) !usize {
 
 /// Acquires the mutex on success.
 fn findModule(si: *SelfInfo, gpa: Allocator, io: Io, address: usize) Error!*Module {
-    // This function is marked as deprecated; however, it is significantly more
-    // performant than `dladdr` (since the latter also does a very slow symbol
-    // lookup), so let's use it since it's still available.
-    const text_base = std.c._dyld_get_image_header_containing_address(
-        @ptrFromInt(address),
-    ) orelse return error.MissingDebugInfo;
+    const text_base: *anyopaque = switch (builtin.target.os.tag) {
+        .macos => base: {
+            // This function is marked as deprecated; however, it is significantly more performant
+            // than `dladdr` (since the latter also does a very slow symbol lookup), so let's just
+            // use it for the better performance since it's still available.
+            break :base std.c._dyld_get_image_header_containing_address(
+                @ptrFromInt(address),
+            ) orelse return error.MissingDebugInfo;
+        },
+        else => base: {
+            // On other Darwin systems, the function used above is entirely unavailable, so we have
+            // no choice but to use the slow `dladdr`.
+            var info: std.c.dl_info = undefined;
+            if (std.c.dladdr(@ptrFromInt(address), &info) == 0) {
+                return error.MissingDebugInfo;
+            }
+            break :base info.fbase;
+        },
+    };
     try si.mutex.lock(io);
     errdefer si.mutex.unlock(io);
     const gop = try si.modules.getOrPutAdapted(gpa, @intFromPtr(text_base), Module.Adapter{});
@@ -563,9 +592,7 @@ const Module = struct {
 
     fn getFile(module: *Module, gpa: Allocator, io: Io) Error!*MachOFile {
         if (module.file == null) {
-            const path = std.mem.span(
-                std.c.dyld_image_path_containing_address(@ptrFromInt(module.text_base)).?,
-            );
+            const path = getModuleNameInner(module.text_base).?;
             module.file = MachOFile.load(gpa, io, path, builtin.cpu.arch) catch |err| switch (err) {
                 error.InvalidMachO, error.InvalidDwarf => error.InvalidDebugInfo,
                 error.MissingDebugInfo, error.OutOfMemory, error.UnsupportedDebugInfo, error.ReadFailed => |e| e,

package/std/os/linux/xtensa.zig

@@ -115,9 +115,10 @@ pub fn clone() callconv(.naked) u32 {
     //
     // syscall(SYS_clone, flags, stack, ptid, tls, ctid)
     //         a2         a6,    a3,    a4,   a5,  a8
-    asm volatile (
+    if (builtin.abi != .call0) asm volatile (
         \\ entry sp, 16
-        \\
+    );
+    asm volatile (
         \\ movi a8, -16
         \\ and a3, a3, a8
         \\
@@ -128,10 +129,29 @@ pub fn clone() callconv(.naked) u32 {
         \\ mov a8, a6
         \\ mov a6, a4
         \\ mov a4, a8
+    );
+    if (builtin.abi == .call0) asm volatile (
+        \\ l32i a8, sp, 0
+    ) else asm volatile (
         \\ l32i a8, sp, 16
+    );
+    asm volatile (
         \\ movi a2, 116 // SYS_clone
         \\ syscall
+    );
+    if (builtin.abi == .call0) asm volatile (
+        \\ beqz a2, 1f
+        \\ // parent
+        \\ ret
         \\
+        \\ // child
+        \\1:
+        \\ movi a15, 0
+        \\ movi a0, 0
+        \\
+        \\ mov a2, a10
+        \\ callx0 a9
+    ) else asm volatile (
         \\ beqz a2, 1f
         \\ // parent
         \\ retw
@@ -141,8 +161,10 @@ pub fn clone() callconv(.naked) u32 {
         \\ movi a7, 0
         \\ movi a0, 0
         \\
-        \\ mov a2, a10
-        \\ callx0 a9
+        \\ mov a6, a10
+        \\ callx4 a9
+    );
+    asm volatile (
         \\ movi a2, 118 // SYS_exit
         \\ syscall
     );

package/std/pie.zig

@@ -270,9 +270,7 @@ inline fn getDynamicSymbol() [*]const elf.Dyn {
                 // embedded constant. Note that `call0` is a 3-byte instruction, so we need both
                 // `.balign` directives to be safe.
                 \\ .balign 4
-                \\ .begin no-transform
                 \\ call0 1f
-                \\ .end no-transform
                 \\ .balign 4
                 \\ .word _DYNAMIC - .
                 \\1:

package/std/sort/pdq.zig

@@ -47,10 +47,10 @@ pub fn pdqContext(a: usize, b: usize, context: anytype) void {
     const max_limit = std.math.floorPowerOfTwo(usize, b - a) + 1;
 
     // set upper bound on stack memory usage.
-    const Range = struct { a: usize, b: usize, limit: usize };
+    const Range = struct { a: usize, b: usize, limit: usize, leftmost: bool };
     const stack_size = math.log2(math.maxInt(usize) + 1);
     var stack: [stack_size]Range = undefined;
-    var range = Range{ .a = a, .b = b, .limit = max_limit };
+    var range = Range{ .a = a, .b = b, .limit = max_limit, .leftmost = true };
     var top: usize = 0;
 
     while (true) {
@@ -62,7 +62,11 @@ pub fn pdqContext(a: usize, b: usize, context: anytype) void {
 
             // very short slices get sorted using insertion sort.
             if (len <= max_insertion) {
-                break sort.insertionContext(range.a, range.b, context);
+                if (range.leftmost) {
+                    break sort.insertionContext(range.a, range.b, context);
+                } else {
+                    break unguardedInsertionContext(range.a, range.b, context);
+                }
             }
 
             // if too many bad pivot choices were made, simply fall back to heapsort in order to
@@ -115,12 +119,13 @@ pub fn pdqContext(a: usize, b: usize, context: anytype) void {
             const balanced_threshold = len / 8;
             if (left_len < right_len) {
                 was_balanced = left_len >= balanced_threshold;
-                stack[top] = .{ .a = range.a, .b = mid, .limit = range.limit };
+                stack[top] = .{ .a = range.a, .b = mid, .limit = range.limit, .leftmost = range.leftmost };
                 top += 1;
                 range.a = mid + 1;
+                range.leftmost = false;
             } else {
                 was_balanced = right_len >= balanced_threshold;
-                stack[top] = .{ .a = mid + 1, .b = range.b, .limit = range.limit };
+                stack[top] = .{ .a = mid + 1, .b = range.b, .limit = range.limit, .leftmost = false };
                 top += 1;
                 range.b = mid;
             }
@@ -131,6 +136,18 @@ pub fn pdqContext(a: usize, b: usize, context: anytype) void {
     }
 }
 
+/// Insertion sort that assumes `items[a-1]` exists and is <= all elements in `[a, b)`,
+/// allowing the inner loop to skip the bounds check.
+fn unguardedInsertionContext(a: usize, b: usize, context: anytype) void {
+    var i = a + 1;
+    while (i < b) : (i += 1) {
+        var j = i;
+        while (context.lessThan(j, j - 1)) : (j -= 1) {
+            context.swap(j, j - 1);
+        }
+    }
+}
+
 /// partitions `items[a..b]` into elements smaller than `items[pivot]`,
 /// followed by elements greater than or equal to `items[pivot]`.
 ///
@@ -158,17 +175,78 @@ fn partition(a: usize, b: usize, pivot: *usize, context: anytype) bool {
     i += 1;
     j -= 1;
 
-    while (true) {
-        while (i <= j and context.lessThan(i, a)) i += 1;
-        while (i <= j and !context.lessThan(j, a)) j -= 1;
-        if (i > j) break;
+    const block_size = 64;
+    var offsets_l: [block_size]u8 align(std.atomic.cache_line) = undefined;
+    var offsets_r: [block_size]u8 align(std.atomic.cache_line) = undefined;
+
+    var offsets_l_base = i;
+    var offsets_r_base = j;
+    var num_l: usize = 0;
+    var num_r: usize = 0;
+    var start_l: usize = 0;
+    var start_r: usize = 0;
+
+    while (i <= j) {
+        const num_unknown = j + 1 - i;
+        const left_split = if (num_l == 0)
+            @min(block_size, if (num_r == 0) num_unknown / 2 else num_unknown)
+        else
+            0;
+        const right_split = if (num_r == 0)
+            @min(block_size, num_unknown - left_split)
+        else
+            0;
+
+        for (0..left_split) |k| {
+            offsets_l[num_l] = @intCast(k);
+            num_l += @intFromBool(!context.lessThan(i + k, a));
+        }
+        i += left_split;
 
-        context.swap(i, j);
-        i += 1;
-        j -= 1;
+        for (0..right_split) |k| {
+            offsets_r[num_r] = @intCast(k);
+            num_r += @intFromBool(context.lessThan(j - k, a));
+        }
+        j -= right_split;
+
+        const num = @min(num_l, num_r);
+        for (0..num) |m| {
+            context.swap(
+                offsets_l_base + offsets_l[start_l + m],
+                offsets_r_base - offsets_r[start_r + m],
+            );
+        }
+        num_l -= num;
+        num_r -= num;
+        start_l += num;
+        start_r += num;
+
+        if (num_l == 0) {
+            start_l = 0;
+            offsets_l_base = i;
+        }
+        if (num_r == 0) {
+            start_r = 0;
+            offsets_r_base = j;
+        }
     }
 
-    // TODO: Enable the BlockQuicksort optimization
+    if (num_l > 0) {
+        while (num_l > 0) {
+            num_l -= 1;
+            context.swap(offsets_l_base + offsets_l[start_l + num_l], j);
+            j -= 1;
+        }
+        i = j + 1;
+    }
+    if (num_r > 0) {
+        while (num_r > 0) {
+            num_r -= 1;
+            context.swap(offsets_r_base - offsets_r[start_r + num_r], i);
+            i += 1;
+        }
+        j = i - 1;
+    }
 
     context.swap(j, a);
     pivot.* = j;

package/std/start.zig

@@ -487,14 +487,22 @@ fn _start() callconv(.naked) noreturn {
             \\ sub %%sp, 2047, %%sp
             \\ ba,a %[posixCallMainAndExit]
             ,
-            .xtensa, .xtensaeb =>
-            // a0 = LR, a7 = FP, a1 = SP
-            \\ movi a0, 0
-            \\ movi a7, 0
-            \\ mov a2, sp
-            \\ movi a8, -16
-            \\ and sp, sp, a8
-            \\ callx0 %[posixCallMainAndExit]
+            .xtensa, .xtensaeb => if (builtin.abi == .call0)
+                // a0 = LR, a15 = FP, a1 = SP
+                \\ movi a0, 0
+                \\ movi a15, 0
+                \\ mov a2, sp
+                \\ movi a8, -16
+                \\ and sp, sp, a8
+                \\ call0 %[posixCallMainAndExit]
+            else
+                // a0 = LR, a7 = FP, a1 = SP
+                \\ movi a0, 0
+                \\ movi a7, 0
+                \\ mov a6, sp
+                \\ movi a8, -16
+                \\ and sp, sp, a8
+                \\ call4 %[posixCallMainAndExit]
             ,
             else => @compileError("unsupported arch"),
         }

package/std/zon/parse.zig

@@ -1094,6 +1094,7 @@ const Parser = struct {
         name: []const u8,
     ) error{ OutOfMemory, ParseZon } {
         @branchHint(.cold);
+        if (self.diag == null) return error.ParseZon;
         const gpa = self.gpa;
         const token = if (field) |f| b: {
             var buf: [2]Ast.Node.Index = undefined;
@@ -1150,6 +1151,7 @@ const Parser = struct {
         field: usize,
     ) error{ OutOfMemory, ParseZon } {
         @branchHint(.cold);
+        if (self.diag == null) return error.ParseZon;
         const ast_node = node.getAstNode(self.zoir);
         var buf: [2]Ast.Node.Index = undefined;
         const token = if (self.ast.fullStructInit(&buf, ast_node)) |struct_init| b: {
@@ -3540,3 +3542,26 @@ test "std.zon no alloc" {
         try fromZoirNode(Nested, ast, zoir, .root, null, .{}),
     );
 }
+
+test "std.zon errors without diagnostics" {
+    const gpa = std.testing.allocator;
+
+    const Enum = enum {
+        foo,
+        bar,
+        baz,
+    };
+    try std.testing.expectError(error.ParseZon, fromSliceAlloc(Enum, gpa, ".nothing", null, .{}));
+
+    const Struct = struct {
+        name: []const u8,
+    };
+    try std.testing.expectError(error.ParseZon, fromSliceAlloc(Struct, gpa, ".{ .name = \"Alice\", .age = 25 }", null, .{}));
+
+    const Union = union(enum) {
+        x,
+        y: u32,
+    };
+    try std.testing.expectError(error.ParseZon, fromSliceAlloc(Union, gpa, ".a", null, .{}));
+    try std.testing.expectError(error.ParseZon, fromSliceAlloc(Union, gpa, ".{ .b = 8 }", null, .{}));
+}

package/ubsan_rt.zig

@@ -492,10 +492,10 @@ const NonNullReturnData = extern struct {
     attribute_loc: SourceLocation,
 };
 
-fn nonNullReturnAbort(data: *const NonNullReturnData) callconv(.c) noreturn {
-    nonNullReturn(data);
+fn nonNullReturnAbort(data: *const NonNullReturnData, where: *const SourceLocation) callconv(.c) noreturn {
+    nonNullReturn(data, where);
 }
-fn nonNullReturn(_: *const NonNullReturnData) callconv(.c) noreturn {
+fn nonNullReturn(_: *const NonNullReturnData, _: *const SourceLocation) callconv(.c) noreturn {
     panic(@returnAddress(), "null pointer returned from function declared to never return null", .{});
 }