@zigc/lib 0.16.0-dev.3070 → 0.16.0-dev.3121

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (77) hide show
  1. package/c/math.zig +125 -22
  2. package/c/stropts.zig +17 -0
  3. package/c.zig +1 -0
  4. package/compiler_rt/cos.zig +141 -52
  5. package/compiler_rt/limb64.zig +266 -0
  6. package/compiler_rt/long_double.zig +37 -0
  7. package/compiler_rt/rem_pio2l.zig +173 -0
  8. package/compiler_rt/sin.zig +140 -55
  9. package/compiler_rt/sincos.zig +279 -72
  10. package/compiler_rt/tan.zig +118 -47
  11. package/compiler_rt/trig.zig +256 -6
  12. package/compiler_rt.zig +2 -0
  13. package/package.json +1 -1
  14. package/std/Build/Module.zig +1 -1
  15. package/std/Build/abi.zig +8 -4
  16. package/std/Io/Dispatch.zig +2 -0
  17. package/std/Io/File.zig +1 -0
  18. package/std/Io/Threaded.zig +2 -0
  19. package/std/Io/Uring.zig +1 -0
  20. package/std/array_list.zig +22 -31
  21. package/std/debug/Info.zig +4 -0
  22. package/std/debug/SelfInfo/Windows.zig +1 -0
  23. package/std/heap/ArenaAllocator.zig +145 -154
  24. package/std/mem/Allocator.zig +4 -5
  25. package/std/mem.zig +48 -0
  26. package/std/testing/Smith.zig +37 -2
  27. package/std/zig/Ast/Render.zig +186 -458
  28. package/std/zig/Ast.zig +0 -4
  29. package/std/zig/AstSmith.zig +2602 -0
  30. package/std/zig/Parse.zig +83 -74
  31. package/std/zig/system.zig +2 -0
  32. package/std/zig/tokenizer.zig +2 -1
  33. package/std/zig.zig +2 -0
  34. package/libc/mingw/math/arm/sincos.S +0 -30
  35. package/libc/mingw/math/arm-common/sincosl.c +0 -13
  36. package/libc/mingw/math/arm64/rint.c +0 -12
  37. package/libc/mingw/math/arm64/rintf.c +0 -12
  38. package/libc/mingw/math/arm64/sincos.S +0 -32
  39. package/libc/mingw/math/frexpf.c +0 -13
  40. package/libc/mingw/math/frexpl.c +0 -71
  41. package/libc/mingw/math/x86/cos.def.h +0 -65
  42. package/libc/mingw/math/x86/cosl.c +0 -46
  43. package/libc/mingw/math/x86/cosl_internal.S +0 -55
  44. package/libc/mingw/math/x86/sin.def.h +0 -65
  45. package/libc/mingw/math/x86/sinl.c +0 -46
  46. package/libc/mingw/math/x86/sinl_internal.S +0 -58
  47. package/libc/mingw/math/x86/tanl.S +0 -62
  48. package/libc/musl/src/legacy/isastream.c +0 -7
  49. package/libc/musl/src/math/__cosl.c +0 -96
  50. package/libc/musl/src/math/__sinl.c +0 -78
  51. package/libc/musl/src/math/__tanl.c +0 -143
  52. package/libc/musl/src/math/aarch64/lrint.c +0 -10
  53. package/libc/musl/src/math/aarch64/lrintf.c +0 -10
  54. package/libc/musl/src/math/aarch64/rintf.c +0 -7
  55. package/libc/musl/src/math/cosl.c +0 -39
  56. package/libc/musl/src/math/fdim.c +0 -10
  57. package/libc/musl/src/math/finite.c +0 -7
  58. package/libc/musl/src/math/finitef.c +0 -7
  59. package/libc/musl/src/math/frexp.c +0 -23
  60. package/libc/musl/src/math/frexpf.c +0 -23
  61. package/libc/musl/src/math/frexpl.c +0 -29
  62. package/libc/musl/src/math/i386/lrint.c +0 -8
  63. package/libc/musl/src/math/i386/lrintf.c +0 -8
  64. package/libc/musl/src/math/i386/rintf.c +0 -7
  65. package/libc/musl/src/math/lrint.c +0 -72
  66. package/libc/musl/src/math/lrintf.c +0 -8
  67. package/libc/musl/src/math/powerpc64/lrint.c +0 -16
  68. package/libc/musl/src/math/powerpc64/lrintf.c +0 -16
  69. package/libc/musl/src/math/rintf.c +0 -30
  70. package/libc/musl/src/math/s390x/rintf.c +0 -15
  71. package/libc/musl/src/math/sincosl.c +0 -60
  72. package/libc/musl/src/math/sinl.c +0 -41
  73. package/libc/musl/src/math/tanl.c +0 -29
  74. package/libc/musl/src/math/x32/lrint.s +0 -5
  75. package/libc/musl/src/math/x32/lrintf.s +0 -5
  76. package/libc/musl/src/math/x86_64/lrint.c +0 -8
  77. package/libc/musl/src/math/x86_64/lrintf.c +0 -8
@@ -4290,6 +4290,7 @@ fn dirCreateFilePosix(
4290
4290
  .AGAIN => return error.WouldBlock,
4291
4291
  .TXTBSY => return error.FileBusy,
4292
4292
  .NXIO => return error.NoDevice,
4293
+ .ROFS => return error.ReadOnlyFileSystem,
4293
4294
  .ILSEQ => return error.BadPathName,
4294
4295
  else => |err| return posix.unexpectedErrno(err),
4295
4296
  }
@@ -4871,6 +4872,7 @@ fn dirOpenFilePosix(
4871
4872
  .AGAIN => return error.WouldBlock,
4872
4873
  .TXTBSY => return error.FileBusy,
4873
4874
  .NXIO => return error.NoDevice,
4875
+ .ROFS => return error.ReadOnlyFileSystem,
4874
4876
  .ILSEQ => return error.BadPathName,
4875
4877
  else => |err| return posix.unexpectedErrno(err),
4876
4878
  }
package/std/Io/Uring.zig CHANGED
@@ -5673,6 +5673,7 @@ fn openat(
5673
5673
  .AGAIN => return error.WouldBlock,
5674
5674
  .TXTBSY => return error.FileBusy,
5675
5675
  .NXIO => return error.NoDevice,
5676
+ .ROFS => return error.ReadOnlyFileSystem,
5676
5677
  .ILSEQ => return error.BadPathName,
5677
5678
  else => |err| return unexpectedErrno(err),
5678
5679
  }
@@ -857,16 +857,8 @@ pub fn Aligned(comptime T: type, comptime alignment: ?mem.Alignment) type {
857
857
  len: usize,
858
858
  new_items: []const T,
859
859
  ) Allocator.Error!void {
860
- const after_range = start + len;
861
- const range = self.items[start..after_range];
862
- if (range.len < new_items.len) {
863
- const first = new_items[0..range.len];
864
- const rest = new_items[range.len..];
865
- @memcpy(range[0..first.len], first);
866
- try self.insertSlice(gpa, after_range, rest);
867
- } else {
868
- self.replaceRangeAssumeCapacity(start, len, new_items);
869
- }
860
+ try self.ensureTotalCapacity(gpa, try addOrOom(self.items.len - len, new_items.len));
861
+ self.replaceRangeAssumeCapacity(start, len, new_items);
870
862
  }
871
863
 
872
864
  /// Grows or shrinks the list as necessary.
@@ -874,26 +866,20 @@ pub fn Aligned(comptime T: type, comptime alignment: ?mem.Alignment) type {
874
866
  /// Never invalidates element pointers.
875
867
  ///
876
868
  /// Asserts the capacity is enough for additional items.
877
- pub fn replaceRangeAssumeCapacity(self: *Self, start: usize, len: usize, new_items: []const T) void {
878
- const after_range = start + len;
879
- const range = self.items[start..after_range];
880
-
881
- if (range.len == new_items.len)
882
- @memcpy(range[0..new_items.len], new_items)
883
- else if (range.len < new_items.len) {
884
- const first = new_items[0..range.len];
885
- const rest = new_items[range.len..];
886
- @memcpy(range[0..first.len], first);
887
- const dst = self.addManyAtAssumeCapacity(after_range, rest.len);
888
- @memcpy(dst, rest);
889
- } else {
890
- const extra = range.len - new_items.len;
891
- @memcpy(range[0..new_items.len], new_items);
892
- const src = self.items[after_range..];
893
- @memmove(self.items[after_range - extra ..][0..src.len], src);
894
- @memset(self.items[self.items.len - extra ..], undefined);
895
- self.items.len -= extra;
896
- }
869
+ pub fn replaceRangeAssumeCapacity(
870
+ self: *Self,
871
+ start: usize,
872
+ len: usize,
873
+ new_items: []const T,
874
+ ) void {
875
+ std.debug.assert(self.capacity - self.items.len >= new_items.len -| len);
876
+
877
+ const tail = self.items[start + len ..];
878
+ const vacated = self.items[self.items.len - (len -| new_items.len) ..];
879
+ self.items.len = self.items.len - len + new_items.len;
880
+ @memmove(self.items[start + new_items.len ..], tail);
881
+ @memcpy(self.items[start..][0..new_items.len], new_items);
882
+ @memset(vacated, undefined);
897
883
  }
898
884
 
899
885
  /// Grows or shrinks the list as necessary.
@@ -902,7 +888,12 @@ pub fn Aligned(comptime T: type, comptime alignment: ?mem.Alignment) type {
902
888
  ///
903
889
  /// If the unused capacity is insufficient for additional items,
904
890
  /// returns `error.OutOfMemory`.
905
- pub fn replaceRangeBounded(self: *Self, start: usize, len: usize, new_items: []const T) error{OutOfMemory}!void {
891
+ pub fn replaceRangeBounded(
892
+ self: *Self,
893
+ start: usize,
894
+ len: usize,
895
+ new_items: []const T,
896
+ ) error{OutOfMemory}!void {
906
897
  if (self.capacity - self.items.len < new_items.len -| len) return error.OutOfMemory;
907
898
  return replaceRangeAssumeCapacity(self, start, len, new_items);
908
899
  }
@@ -99,6 +99,10 @@ pub fn resolveAddresses(
99
99
  // due to split debug information. For now, we'll just resolve the addreses one by one.
100
100
  for (sorted_pc_addrs, output) |pc_addr, *src_loc| {
101
101
  const dwarf, const dwarf_pc_addr = mf.getDwarfForAddress(gpa, io, pc_addr) catch |err| switch (err) {
102
+ error.MissingDebugInfo => {
103
+ src_loc.* = .invalid;
104
+ continue;
105
+ },
102
106
  error.InvalidMachO, error.InvalidDwarf => return error.InvalidDebugInfo,
103
107
  else => |e| return e,
104
108
  };
@@ -360,6 +360,7 @@ const Module = struct {
360
360
  error.SystemFdQuotaExceeded,
361
361
  error.FileLocksUnsupported,
362
362
  error.FileBusy,
363
+ error.ReadOnlyFileSystem,
363
364
  => return error.ReadFailed,
364
365
  };
365
366
  errdefer coff_file.close(io);
@@ -358,14 +358,16 @@ fn alloc(ctx: *anyopaque, n: usize, alignment: Alignment, ret_addr: usize) ?[*]u
358
358
  const end_index = @atomicRmw(usize, &node.end_index, .Add, alignable, .acquire); // acquire any memory that may have been freed
359
359
  const aligned_index = alignedIndex(buf.ptr, end_index, alignment);
360
360
  assert(end_index + alignable >= aligned_index + n);
361
- _ = @cmpxchgStrong(
362
- usize,
363
- &node.end_index,
364
- end_index + alignable,
365
- aligned_index + n,
366
- .monotonic, // no need to release alignment padding; there's no one accessing it!
367
- .monotonic,
368
- );
361
+ if (end_index + alignable != aligned_index + n) {
362
+ _ = @cmpxchgStrong(
363
+ usize,
364
+ &node.end_index,
365
+ end_index + alignable,
366
+ aligned_index + n,
367
+ .monotonic, // no need to release alignment padding; there's no one accessing it!
368
+ .monotonic,
369
+ );
370
+ }
369
371
 
370
372
  if (aligned_index + n > buf.len) break :first_node .{ node, buf.len };
371
373
  return buf[aligned_index..][0..n].ptr;
@@ -682,45 +684,40 @@ test "reset while retaining a buffer" {
682
684
  try std.testing.expectEqual(2, arena_allocator.queryCapacity());
683
685
  }
684
686
 
685
- test "fuzz" {
687
+ test "fuzz multi threaded" {
686
688
  @disableInstrumentation();
687
689
  if (@import("builtin").single_threaded) return error.SkipZigTest;
688
690
 
689
691
  const gpa = std.heap.smp_allocator;
690
692
 
693
+ var io_instance: std.Io.Threaded = .init(gpa, .{});
694
+ defer io_instance.deinit();
695
+
691
696
  var arena_state: ArenaAllocator.State = .init;
692
697
  // No need to deinit arena_state, all allocations are in `sample_buffer`!
693
698
 
694
- const control_buffer = try gpa.alloc(u8, 64 << 10 << 10);
699
+ const buffer_size = FuzzContext.max_alloc_count * FuzzContext.max_alloc_size;
700
+
701
+ const control_buffer = try gpa.alloc(u8, buffer_size);
695
702
  defer gpa.free(control_buffer);
696
703
  var control_instance: std.heap.FixedBufferAllocator = .init(control_buffer);
697
704
 
698
- const sample_buffer = try gpa.alloc(u8, 64 << 10 << 10);
705
+ const sample_buffer = try gpa.alloc(u8, buffer_size);
699
706
  defer gpa.free(sample_buffer);
700
707
  var sample_instance: FuzzAllocator = .init(sample_buffer);
701
708
 
702
- var allocs: FuzzContext.Allocs = try .initCapacity(gpa, FuzzContext.max_alloc_count);
703
- defer allocs.deinit(gpa);
704
-
705
709
  try std.testing.fuzz(FuzzContext.Init{
706
- .gpa = gpa,
707
- .allocs = &allocs,
710
+ .threaded_instance = &io_instance,
708
711
  .arena_state = &arena_state,
709
712
  .control_instance = &control_instance,
710
713
  .sample_instance = &sample_instance,
711
- }, fuzzArenaAllocator, .{});
714
+ }, fuzzMultiThreaded, .{});
712
715
  }
713
716
 
714
- fn fuzzArenaAllocator(fuzz_init: FuzzContext.Init, smith: *std.testing.Smith) anyerror!void {
717
+ fn fuzzMultiThreaded(fuzz_init: FuzzContext.Init, smith: *std.testing.Smith) anyerror!void {
715
718
  @disableInstrumentation();
716
719
  const testing = std.testing;
717
-
718
- // We use a 'fresh' `Threaded` instance every time to reset threadlocals to
719
- // their default values.
720
-
721
- var io_instance: std.Io.Threaded = .init(fuzz_init.gpa, .{});
722
- defer io_instance.deinit();
723
- const io = io_instance.io();
720
+ const io = fuzz_init.threaded_instance.io();
724
721
 
725
722
  fuzz_init.sample_instance.prepareFailures(smith);
726
723
 
@@ -731,59 +728,57 @@ fn fuzzArenaAllocator(fuzz_init: FuzzContext.Init, smith: *std.testing.Smith) an
731
728
  defer fuzz_init.arena_state.* = arena_instance.state;
732
729
 
733
730
  var ctx: FuzzContext = .init(
734
- io,
735
731
  control_allocator,
736
732
  arena_instance.allocator(),
737
- fuzz_init.allocs,
738
733
  );
739
734
  defer ctx.deinit();
740
735
 
741
- ctx.rwl.lockUncancelable(io);
742
-
743
736
  var group: std.Io.Group = .init;
744
737
  defer group.cancel(io);
745
738
 
739
+ var n_allocs: usize = 0;
746
740
  var n_actions: usize = 0;
747
741
  while (!smith.eosWeightedSimple(99, 1) and n_actions < FuzzContext.max_action_count) {
748
742
  errdefer comptime unreachable;
749
743
 
750
- const ActionTag = @typeInfo(FuzzContext.Action).@"union".tag_type.?;
751
- const weights: []const testing.Smith.Weight = weights: {
752
- if (ctx.allocs.len == ctx.allocs.capacity)
753
- break :weights &.{
754
- .value(ActionTag, .resize, 1),
755
- .value(ActionTag, .remap, 1),
756
- .value(ActionTag, .free, 1),
757
- };
758
- break :weights testing.Smith.baselineWeights(ActionTag) ++
759
- .{testing.Smith.Weight.value(ActionTag, .alloc, 2)};
760
- };
761
- const action: FuzzContext.Action = switch (smith.valueWeighted(ActionTag, weights)) {
762
- .alloc => action: {
763
- const alloc_index = ctx.allocs.addOneBounded() catch continue;
764
- ctx.allocs.items(.len)[alloc_index] = .free;
765
- break :action .{ .alloc = .{
766
- .len = nextLen(smith),
767
- .alignment = smith.valueRangeAtMost(
744
+ const weights: []const testing.Smith.Weight = if (n_allocs == FuzzContext.max_alloc_count)
745
+ &.{
746
+ .value(FuzzContext.Action, .resize, 1),
747
+ .value(FuzzContext.Action, .remap, 1),
748
+ .value(FuzzContext.Action, .free, 1),
749
+ }
750
+ else
751
+ &.{
752
+ .value(FuzzContext.Action, .resize, 1),
753
+ .value(FuzzContext.Action, .remap, 1),
754
+ .value(FuzzContext.Action, .free, 1),
755
+ .value(FuzzContext.Action, .alloc, 3),
756
+ };
757
+ switch (smith.valueWeighted(FuzzContext.Action, weights)) {
758
+ .alloc => {
759
+ const alloc_index = n_allocs;
760
+ n_allocs += 1;
761
+ ctx.allocs[alloc_index].common.len = .free;
762
+ group.concurrent(io, FuzzContext.doOneAlloc, .{
763
+ &ctx,
764
+ nextLen(smith),
765
+ smith.valueRangeAtMost(
768
766
  Alignment,
769
767
  .@"1",
770
768
  .fromByteUnits(2 * std.heap.page_size_max),
771
769
  ),
772
- .index = alloc_index,
773
- } };
770
+ @enumFromInt(alloc_index),
771
+ }) catch unreachable;
774
772
  },
775
- .resize => .{ .resize = .{ .new_len = nextLen(smith) } },
776
- .remap => .{ .remap = .{ .new_len = nextLen(smith) } },
777
- .free => .free,
778
- };
779
- group.concurrent(io, FuzzContext.doOneAction, .{ &ctx, action }) catch break;
773
+ .resize => group.concurrent(io, FuzzContext.doOneResize, .{ &ctx, nextLen(smith) }) catch unreachable,
774
+ .remap => group.concurrent(io, FuzzContext.doOneRemap, .{ &ctx, nextLen(smith) }) catch unreachable,
775
+ .free => group.concurrent(io, FuzzContext.doOneFree, .{&ctx}) catch unreachable,
776
+ }
780
777
  n_actions += 1;
781
778
  }
782
779
 
783
- ctx.rwl.unlock(io);
784
-
785
780
  try group.await(io);
786
- try ctx.check();
781
+ try ctx.check(n_allocs);
787
782
 
788
783
  // This also covers the `deinit` logic since `free_all` uses it internally.
789
784
 
@@ -806,73 +801,71 @@ fn fuzzArenaAllocator(fuzz_init: FuzzContext.Init, smith: *std.testing.Smith) an
806
801
  }
807
802
 
808
803
  fuzz_init.control_instance.reset();
809
- fuzz_init.allocs.clearRetainingCapacity();
810
- }
811
- fn nextLen(smith: *std.testing.Smith) usize {
812
- @disableInstrumentation();
813
- return usizeRange(smith, 1, 16 << 10 << 10);
814
804
  }
815
- fn usizeRange(smith: *std.testing.Smith, at_least: usize, at_most: usize) usize {
805
+ fn nextLen(smith: *std.testing.Smith) @typeInfo(FuzzContext.Alloc.Len).@"enum".tag_type {
816
806
  @disableInstrumentation();
817
- const Int = @Int(.unsigned, @min(64, @bitSizeOf(usize)));
818
- return smith.valueRangeAtMost(Int, @intCast(at_least), @intCast(at_most));
807
+ const BackingInt = @typeInfo(FuzzContext.Alloc.Len).@"enum".tag_type;
808
+ return smith.valueRangeAtMost(BackingInt, 1, FuzzContext.max_alloc_size);
819
809
  }
820
810
 
821
811
  const FuzzContext = struct {
822
- io: std.Io,
823
- rwl: std.Io.RwLock,
824
-
825
812
  control_allocator: Allocator,
826
813
  sample_allocator: Allocator,
827
814
 
828
- allocs: *Allocs,
815
+ last_alloc_index: Alloc.Index,
816
+ allocs: [max_alloc_count]Alloc,
829
817
 
830
- const max_alloc_count = 4096;
818
+ const max_alloc_count = 64;
831
819
  const max_action_count = 2 * max_alloc_count;
832
820
 
833
- const Allocs = std.MultiArrayList(struct {
821
+ const max_alloc_size = 16 << 10;
822
+
823
+ const Alloc = struct {
834
824
  control_ptr: [*]u8,
835
825
  sample_ptr: [*]u8,
836
- len: Len,
837
- alignment: Alignment,
838
- });
826
+ common: packed struct(usize) {
827
+ len: Len,
828
+ alignment: Alignment,
829
+ _: @Int(.unsigned, padding_bits) = 0,
830
+ },
831
+
832
+ const Len = enum(@Int(.unsigned, len_bits)) {
833
+ free = (1 << len_bits) - 1,
834
+ _,
835
+ };
836
+ const len_bits = @min(64, @bitSizeOf(usize)) - @bitSizeOf(Alignment);
837
+ const padding_bits = @bitSizeOf(usize) - (len_bits + @bitSizeOf(Alignment));
839
838
 
840
- const Len = enum(usize) {
841
- free = std.math.maxInt(usize),
842
- _,
839
+ const Index = enum(usize) {
840
+ none = std.math.maxInt(usize),
841
+ _,
842
+ };
843
843
  };
844
844
 
845
- const Action = union(enum(u8)) {
846
- alloc: struct { len: usize, alignment: Alignment, index: usize },
847
- resize: struct { new_len: usize },
848
- remap: struct { new_len: usize },
845
+ const Action = enum {
846
+ alloc,
847
+ resize,
848
+ remap,
849
849
  free,
850
850
  };
851
851
 
852
- threadlocal var tls_next: u8 = 0;
853
- threadlocal var tls_last_index: ?usize = null;
854
-
855
852
  const Init = struct {
856
- gpa: Allocator,
857
- allocs: *FuzzContext.Allocs,
853
+ threaded_instance: *std.Io.Threaded,
858
854
  arena_state: *ArenaAllocator.State,
859
855
  control_instance: *std.heap.FixedBufferAllocator,
860
856
  sample_instance: *FuzzAllocator,
861
857
  };
862
858
 
863
859
  fn init(
864
- io: std.Io,
865
860
  control_allocator: Allocator,
866
861
  sample_allocator: Allocator,
867
- allocs: *Allocs,
868
862
  ) FuzzContext {
869
863
  @disableInstrumentation();
870
864
  return .{
871
- .io = io,
872
- .rwl = .init,
873
865
  .control_allocator = control_allocator,
874
866
  .sample_allocator = sample_allocator,
875
- .allocs = allocs,
867
+ .last_alloc_index = .none,
868
+ .allocs = undefined,
876
869
  };
877
870
  }
878
871
 
@@ -881,35 +874,22 @@ const FuzzContext = struct {
881
874
  ctx.* = undefined;
882
875
  }
883
876
 
884
- fn check(ctx: *const FuzzContext) !void {
877
+ fn check(ctx: *const FuzzContext, n_allocs: usize) !void {
885
878
  @disableInstrumentation();
886
- for (0..ctx.allocs.len) |index| {
887
- const len: usize = switch (ctx.allocs.items(.len)[index]) {
879
+ for (ctx.allocs[0..n_allocs]) |allocation| {
880
+ const len: usize = switch (allocation.common.len) {
888
881
  .free => continue,
889
882
  _ => |len| @intFromEnum(len),
890
883
  };
891
- const control = ctx.allocs.items(.control_ptr)[index][0..len];
892
- const sample = ctx.allocs.items(.sample_ptr)[index][0..len];
884
+ const control = allocation.control_ptr[0..len];
885
+ const sample = allocation.sample_ptr[0..len];
893
886
  try std.testing.expectEqualSlices(u8, control, sample);
894
887
  }
895
888
  }
896
889
 
897
- fn doOneAction(ctx: *FuzzContext, action: Action) std.Io.Cancelable!void {
890
+ fn doOneAlloc(ctx: *FuzzContext, len: usize, alignment: Alignment, index: Alloc.Index) void {
898
891
  @disableInstrumentation();
899
- ctx.rwl.lockSharedUncancelable(ctx.io);
900
- defer ctx.rwl.unlockShared(ctx.io);
901
-
902
- switch (action) {
903
- .alloc => |act| ctx.doOneAlloc(act.len, act.alignment, act.index),
904
- .resize => |act| ctx.doOneResize(act.new_len),
905
- .remap => |act| ctx.doOneRemap(act.new_len),
906
- .free => ctx.doOneFree(),
907
- }
908
- }
909
-
910
- fn doOneAlloc(ctx: *FuzzContext, len: usize, alignment: Alignment, index: usize) void {
911
- @disableInstrumentation();
912
- assert(ctx.allocs.items(.len)[index] == .free);
892
+ assert(ctx.allocs[@intFromEnum(index)].common.len == .free);
913
893
 
914
894
  const control_ptr = ctx.control_allocator.rawAlloc(len, alignment, @returnAddress()) orelse
915
895
  return;
@@ -918,38 +898,42 @@ const FuzzContext = struct {
918
898
  return;
919
899
  };
920
900
 
921
- ctx.allocs.set(index, .{
901
+ ctx.allocs[@intFromEnum(index)] = .{
922
902
  .control_ptr = control_ptr,
923
903
  .sample_ptr = sample_ptr,
924
- .len = @enumFromInt(len),
925
- .alignment = alignment,
926
- });
927
-
928
- for (control_ptr[0..len], sample_ptr[0..len]) |*control, *sample| {
929
- control.* = tls_next;
930
- sample.* = tls_next;
931
- tls_next +%= 1;
904
+ .common = .{
905
+ .len = @enumFromInt(len),
906
+ .alignment = alignment,
907
+ },
908
+ };
909
+
910
+ for (control_ptr[0..len], sample_ptr[0..len], 0..) |*control, *sample, i| {
911
+ control.* = @truncate(i);
912
+ sample.* = @truncate(i);
932
913
  }
933
914
 
934
- tls_last_index = index;
915
+ @atomicStore(Alloc.Index, &ctx.last_alloc_index, index, .release);
935
916
  }
936
917
  fn doOneResize(ctx: *FuzzContext, new_len: usize) void {
937
918
  @disableInstrumentation();
938
- const index = tls_last_index orelse return;
939
- const len = ctx.allocs.items(.len)[index];
940
- assert(len != .free);
941
- const memory = ctx.allocs.items(.sample_ptr)[index][0..@intFromEnum(len)];
942
- const alignment = ctx.allocs.items(.alignment)[index];
943
919
 
944
- assert(alignment.check(@intFromPtr(ctx.allocs.items(.control_ptr)[index])));
945
- assert(alignment.check(@intFromPtr(ctx.allocs.items(.sample_ptr)[index])));
920
+ const index = @atomicRmw(Alloc.Index, &ctx.last_alloc_index, .Xchg, .none, .acquire);
921
+ if (index == .none) return;
922
+
923
+ const allocation = &ctx.allocs[@intFromEnum(index)];
924
+ assert(allocation.common.len != .free);
925
+ const memory = allocation.sample_ptr[0..@intFromEnum(allocation.common.len)];
926
+ const alignment = allocation.common.alignment;
927
+
928
+ assert(alignment.check(@intFromPtr(allocation.control_ptr)));
929
+ assert(alignment.check(@intFromPtr(allocation.sample_ptr)));
946
930
 
947
931
  // Since `resize` is fallible, we have to ensure that `control_allocator`
948
932
  // is always successful by reserving the memory we need beforehand.
949
933
  const new_control_ptr = ctx.control_allocator.rawAlloc(new_len, alignment, @returnAddress()) orelse
950
934
  return;
951
935
  if (ctx.sample_allocator.rawResize(memory, alignment, new_len, @returnAddress())) {
952
- const old_control = ctx.allocs.items(.control_ptr)[index][0..memory.len];
936
+ const old_control = allocation.control_ptr[0..memory.len];
953
937
  const overlap = @min(memory.len, new_len);
954
938
  @memcpy(new_control_ptr[0..overlap], old_control[0..overlap]);
955
939
  ctx.control_allocator.rawFree(old_control, alignment, @returnAddress());
@@ -958,23 +942,27 @@ const FuzzContext = struct {
958
942
  return;
959
943
  }
960
944
 
961
- ctx.allocs.set(index, .{
945
+ ctx.allocs[@intFromEnum(index)] = .{
962
946
  .control_ptr = new_control_ptr,
963
947
  .sample_ptr = memory.ptr,
964
- .len = @enumFromInt(new_len),
965
- .alignment = alignment,
966
- });
948
+ .common = .{
949
+ .len = @enumFromInt(new_len),
950
+ .alignment = alignment,
951
+ },
952
+ };
967
953
 
968
954
  if (new_len > memory.len) {
969
955
  for (
970
- ctx.allocs.items(.control_ptr)[index][memory.len..new_len],
971
- ctx.allocs.items(.sample_ptr)[index][memory.len..new_len],
972
- ) |*control, *sample| {
973
- control.* = tls_next;
974
- sample.* = tls_next;
975
- tls_next +%= 1;
956
+ allocation.control_ptr[memory.len..new_len],
957
+ allocation.sample_ptr[memory.len..new_len],
958
+ 0..,
959
+ ) |*control, *sample, i| {
960
+ control.* = @truncate(i);
961
+ sample.* = @truncate(i);
976
962
  }
977
963
  }
964
+
965
+ @atomicStore(Alloc.Index, &ctx.last_alloc_index, index, .release);
978
966
  }
979
967
  fn doOneRemap(ctx: *FuzzContext, new_len: usize) void {
980
968
  @disableInstrumentation();
@@ -982,26 +970,29 @@ const FuzzContext = struct {
982
970
  }
983
971
  fn doOneFree(ctx: *FuzzContext) void {
984
972
  @disableInstrumentation();
985
- const index = tls_last_index orelse return;
986
- const len = ctx.allocs.items(.len)[index];
987
- assert(len != .free);
988
- const memory = ctx.allocs.items(.sample_ptr)[index][0..@intFromEnum(len)];
989
- const alignment = ctx.allocs.items(.alignment)[index];
990
973
 
991
- assert(alignment.check(@intFromPtr(ctx.allocs.items(.control_ptr)[index])));
992
- assert(alignment.check(@intFromPtr(ctx.allocs.items(.sample_ptr)[index])));
974
+ const index = @atomicRmw(Alloc.Index, &ctx.last_alloc_index, .Xchg, .none, .acquire);
975
+ if (index == .none) return;
993
976
 
994
- ctx.control_allocator.rawFree(ctx.allocs.items(.control_ptr)[index][0..memory.len], alignment, @returnAddress());
995
- ctx.sample_allocator.rawFree(ctx.allocs.items(.sample_ptr)[index][0..memory.len], alignment, @returnAddress());
977
+ const allocation = &ctx.allocs[@intFromEnum(index)];
978
+ assert(allocation.common.len != .free);
979
+ const len: usize = @intFromEnum(allocation.common.len);
980
+ const alignment = allocation.common.alignment;
996
981
 
997
- ctx.allocs.set(index, .{
982
+ assert(alignment.check(@intFromPtr(allocation.control_ptr)));
983
+ assert(alignment.check(@intFromPtr(allocation.sample_ptr)));
984
+
985
+ ctx.control_allocator.rawFree(allocation.control_ptr[0..len], alignment, @returnAddress());
986
+ ctx.sample_allocator.rawFree(allocation.sample_ptr[0..len], alignment, @returnAddress());
987
+
988
+ ctx.allocs[@intFromEnum(index)] = .{
998
989
  .control_ptr = undefined,
999
990
  .sample_ptr = undefined,
1000
- .len = .free,
1001
- .alignment = undefined,
1002
- });
1003
-
1004
- tls_last_index = null;
991
+ .common = .{
992
+ .len = .free,
993
+ .alignment = .@"1",
994
+ },
995
+ };
1005
996
  }
1006
997
  };
1007
998
 
@@ -322,7 +322,7 @@ pub fn resize(self: Allocator, allocation: anytype, new_len: usize) bool {
322
322
  if (allocation.len == 0) {
323
323
  return false;
324
324
  }
325
- const old_memory = mem.sliceAsBytes(allocation);
325
+ const old_memory: []u8 = @ptrCast(@constCast(mem.absorbSentinel(allocation)));
326
326
  // I would like to use saturating multiplication here, but LLVM cannot lower it
327
327
  // on WebAssembly: https://github.com/ziglang/zig/issues/9660
328
328
  //const new_len_bytes = new_len *| @sizeOf(T);
@@ -368,7 +368,7 @@ pub fn remap(self: Allocator, allocation: anytype, new_len: usize) ?@TypeOf(allo
368
368
  new_memory.len = new_len;
369
369
  return new_memory;
370
370
  }
371
- const old_memory = mem.sliceAsBytes(allocation);
371
+ const old_memory: []u8 = @ptrCast(@constCast(mem.absorbSentinel(allocation)));
372
372
  // I would like to use saturating multiplication here, but LLVM cannot lower it
373
373
  // on WebAssembly: https://github.com/ziglang/zig/issues/9660
374
374
  //const new_len_bytes = new_len *| @sizeOf(T);
@@ -420,7 +420,7 @@ pub fn reallocAdvanced(
420
420
  return ptr;
421
421
  }
422
422
 
423
- const old_byte_slice = mem.sliceAsBytes(old_mem);
423
+ const old_byte_slice: []u8 = @ptrCast(@constCast(mem.absorbSentinel(old_mem)));
424
424
  const byte_count = math.mul(usize, @sizeOf(T), new_n) catch return error.OutOfMemory;
425
425
  // Note: can't set shrunk memory to undefined as memory shouldn't be modified on realloc failure
426
426
  if (self.rawRemap(old_byte_slice, .fromByteUnits(slice_info.alignment orelse @alignOf(T)), byte_count, return_address)) |p| {
@@ -443,8 +443,7 @@ pub fn reallocAdvanced(
443
443
  pub fn free(self: Allocator, memory: anytype) void {
444
444
  const slice_info = @typeInfo(@TypeOf(memory)).pointer;
445
445
  comptime assert(slice_info.size == .slice);
446
- const mem_with_sent = memory[0 .. memory.len + @intFromBool(slice_info.sentinel() != null)];
447
- const bytes: []u8 = @ptrCast(@constCast(mem_with_sent));
446
+ const bytes: []u8 = @ptrCast(@constCast(mem.absorbSentinel(memory)));
448
447
  if (bytes.len == 0) return;
449
448
  @memset(bytes, undefined);
450
449
  self.rawFree(bytes, .fromByteUnits(slice_info.alignment orelse @alignOf(slice_info.child)), @returnAddress());