Commit 4eca75c53b4679e7e31df1505d22a5b618a2d797 | zig

author	Andrew Kelley <andrew@ziglang.org> 2018-06-20 17:33:49-04:00
committer	Andrew Kelley <andrew@ziglang.org> 2018-06-20 17:33:49-04:00
log	4eca75c53b4679e7e31df1505d22a5b618a2d797
tree	1682c01aac310e445a68830545f670d121ac38ea
parent	55193cb13bbc69350474f6a66728319b41149274
parent	85f928f8bff8c033f6ef0104d68b033669cb36e4

Merge branch 'kristate-stdmem-replace-create-with-construct'

16 files changed, 191 insertions(+), 216 deletions(-)

src-self-hosted
std
- atomic
  - queue.zig
  - stack.zig
- build.zig
- debug
  - index.zig
- heap.zig
- io.zig
- linked_list.zig
- mem.zig
- os
  - child_process.zig
  - index.zig
- zig
  - parse.zig
test
- cases
  - null.zig
- tests.zig

src-self-hosted/errmsg.zig+1-1

...	@@ -35,7 +35,7 @@ pub fn createFromParseError(	...	@@ -35,7 +35,7 @@ pub fn createFromParseError(
35	var out_stream = &std.io.BufferOutStream.init(&text_buf).stream;	35	var out_stream = &std.io.BufferOutStream.init(&text_buf).stream;
36	try parse_error.render(&tree.tokens, out_stream);	36	try parse_error.render(&tree.tokens, out_stream);
37		37
38	const msg = try allocator.construct(Msg{	38	const msg = try allocator.create(Msg{
39	.tree = tree,	39	.tree = tree,
40	.path = path,	40	.path = path,
41	.text = text_buf.toOwnedSlice(),	41	.text = text_buf.toOwnedSlice(),

src-self-hosted/main.zig+1-1

...	@@ -707,7 +707,7 @@ const Fmt = struct {	...	@@ -707,7 +707,7 @@ const Fmt = struct {
707		707
708	// file_path must outlive Fmt	708	// file_path must outlive Fmt
709	fn addToQueue(self: *Fmt, file_path: []const u8) !void {	709	fn addToQueue(self: *Fmt, file_path: []const u8) !void {
710	const new_node = try self.seen.allocator.construct(std.LinkedList([]const u8).Node{	710	const new_node = try self.seen.allocator.create(std.LinkedList([]const u8).Node{
711	.prev = undefined,	711	.prev = undefined,
712	.next = undefined,	712	.next = undefined,
713	.data = file_path,	713	.data = file_path,

src-self-hosted/module.zig+21-14

 @@ -110,11 +110,12 @@ pub const Module = struct {
         parent: ?*CliPkg,
         pub fn init(allocator: *mem.Allocator, name: []const u8, path: []const u8, parent: ?*CliPkg) !*CliPkg {
-            var pkg = try allocator.create(CliPkg);
+            var pkg = try allocator.create(CliPkg{
-            pkg.name = name;
+                .name = name,
-            pkg.path = path;
+                .path = path,
-            pkg.children = ArrayList(*CliPkg).init(allocator);
+                .children = ArrayList(*CliPkg).init(allocator),
-            pkg.parent = parent;
+                .parent = parent,
+            });
             return pkg;
         }
 @@ -126,7 +127,16 @@ pub const Module = struct {
         }
     };
-    pub fn create(allocator: *mem.Allocator, name: []const u8, root_src_path: ?[]const u8, target: *const Target, kind: Kind, build_mode: builtin.Mode, zig_lib_dir: []const u8, cache_dir: []const u8) !*Module {
+    pub fn create(
+        allocator: *mem.Allocator,
+        name: []const u8,
+        root_src_path: ?[]const u8,
+        target: *const Target,
+        kind: Kind,
+        build_mode: builtin.Mode,
+        zig_lib_dir: []const u8,
+        cache_dir: []const u8,
+    ) !*Module {
         var name_buffer = try Buffer.init(allocator, name);
         errdefer name_buffer.deinit();
 @@ -139,10 +149,7 @@ pub const Module = struct {
         const builder = c.LLVMCreateBuilderInContext(context) orelse return error.OutOfMemory;
         errdefer c.LLVMDisposeBuilder(builder);
-        const module_ptr = try allocator.create(Module);
+        const module_ptr = try allocator.create(Module{
-        errdefer allocator.destroy(module_ptr);
-        module_ptr.* = Module{
             .allocator = allocator,
             .name = name_buffer,
             .root_src_path = root_src_path,
 @@ -196,7 +203,8 @@ pub const Module = struct {
             .test_filters = [][]const u8{},
             .test_name_prefix = null,
             .emit_file_type = Emit.Binary,
-        };
+        });
+        errdefer allocator.destroy(module_ptr);
         return module_ptr;
     }
 @@ -279,13 +287,12 @@ pub const Module = struct {
             }
         }
-        const link_lib = try self.allocator.create(LinkLib);
+        const link_lib = try self.allocator.create(LinkLib{
-        link_lib.* = LinkLib{
             .name = name,
             .path = null,
             .provided_explicitly = provided_explicitly,
             .symbols = ArrayList([]u8).init(self.allocator),
-        };
+        });
         try self.link_libs_list.append(link_lib);
         if (is_libc) {
             self.libc_link_lib = link_lib;

std/atomic/queue.zig+4-2

 @@ -114,8 +114,10 @@ fn startPuts(ctx: *Context) u8 {
     while (put_count != 0) : (put_count -= 1) {
         std.os.time.sleep(0, 1); // let the os scheduler be our fuzz
         const x = @bitCast(i32, r.random.scalar(u32));
-        const node = ctx.allocator.create(Queue(i32).Node) catch unreachable;
+        const node = ctx.allocator.create(Queue(i32).Node{
-        node.data = x;
+            .next = undefined,
+            .data = x,
+        }) catch unreachable;
         ctx.queue.put(node);
         _ = @atomicRmw(isize, &ctx.put_sum, builtin.AtomicRmwOp.Add, x, AtomicOrder.SeqCst);
     }

std/atomic/stack.zig+4-2

 @@ -117,8 +117,10 @@ fn startPuts(ctx: *Context) u8 {
     while (put_count != 0) : (put_count -= 1) {
         std.os.time.sleep(0, 1); // let the os scheduler be our fuzz
         const x = @bitCast(i32, r.random.scalar(u32));
-        const node = ctx.allocator.create(Stack(i32).Node) catch unreachable;
+        const node = ctx.allocator.create(Stack(i32).Node{
-        node.data = x;
+            .next = undefined,
+            .data = x,
+        }) catch unreachable;
         ctx.stack.push(node);
         _ = @atomicRmw(isize, &ctx.put_sum, builtin.AtomicRmwOp.Add, x, AtomicOrder.SeqCst);
     }

std/build.zig+20-35

 @@ -158,8 +158,7 @@ pub const Builder = struct {
     }
     pub fn addTest(self: *Builder, root_src: []const u8) *TestStep {
-        const test_step = self.allocator.create(TestStep) catch unreachable;
+        const test_step = self.allocator.create(TestStep.init(self, root_src)) catch unreachable;
-        test_step.* = TestStep.init(self, root_src);
         return test_step;
     }
 @@ -191,21 +190,18 @@ pub const Builder = struct {
     }
     pub fn addWriteFile(self: *Builder, file_path: []const u8, data: []const u8) *WriteFileStep {
-        const write_file_step = self.allocator.create(WriteFileStep) catch unreachable;
+        const write_file_step = self.allocator.create(WriteFileStep.init(self, file_path, data)) catch unreachable;
-        write_file_step.* = WriteFileStep.init(self, file_path, data);
         return write_file_step;
     }
     pub fn addLog(self: *Builder, comptime format: []const u8, args: ...) *LogStep {
         const data = self.fmt(format, args);
-        const log_step = self.allocator.create(LogStep) catch unreachable;
+        const log_step = self.allocator.create(LogStep.init(self, data)) catch unreachable;
-        log_step.* = LogStep.init(self, data);
         return log_step;
     }
     pub fn addRemoveDirTree(self: *Builder, dir_path: []const u8) *RemoveDirStep {
-        const remove_dir_step = self.allocator.create(RemoveDirStep) catch unreachable;
+        const remove_dir_step = self.allocator.create(RemoveDirStep.init(self, dir_path)) catch unreachable;
-        remove_dir_step.* = RemoveDirStep.init(self, dir_path);
         return remove_dir_step;
     }
 @@ -404,11 +400,10 @@ pub const Builder = struct {
     }
     pub fn step(self: *Builder, name: []const u8, description: []const u8) *Step {
-        const step_info = self.allocator.create(TopLevelStep) catch unreachable;
+        const step_info = self.allocator.create(TopLevelStep{
-        step_info.* = TopLevelStep{
             .step = Step.initNoOp(name, self.allocator),
             .description = description,
-        };
+        }) catch unreachable;
         self.top_level_steps.append(step_info) catch unreachable;
         return &step_info.step;
     }
 @@ -598,8 +593,7 @@ pub const Builder = struct {
         const full_dest_path = os.path.resolve(self.allocator, self.prefix, dest_rel_path) catch unreachable;
         self.pushInstalledFile(full_dest_path);
-        const install_step = self.allocator.create(InstallFileStep) catch unreachable;
+        const install_step = self.allocator.create(InstallFileStep.init(self, src_path, full_dest_path)) catch unreachable;
-        install_step.* = InstallFileStep.init(self, src_path, full_dest_path);
         return install_step;
     }
 @@ -837,51 +831,43 @@ pub const LibExeObjStep = struct {
     };
     pub fn createSharedLibrary(builder: *Builder, name: []const u8, root_src: ?[]const u8, ver: *const Version) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initExtraArgs(builder, name, root_src, Kind.Lib, false, ver)) catch unreachable;
-        self.* = initExtraArgs(builder, name, root_src, Kind.Lib, false, ver);
         return self;
     }
     pub fn createCSharedLibrary(builder: *Builder, name: []const u8, version: *const Version) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initC(builder, name, Kind.Lib, version, false)) catch unreachable;
-        self.* = initC(builder, name, Kind.Lib, version, false);
         return self;
     }
     pub fn createStaticLibrary(builder: *Builder, name: []const u8, root_src: ?[]const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initExtraArgs(builder, name, root_src, Kind.Lib, true, builder.version(0, 0, 0))) catch unreachable;
-        self.* = initExtraArgs(builder, name, root_src, Kind.Lib, true, builder.version(0, 0, 0));
         return self;
     }
     pub fn createCStaticLibrary(builder: *Builder, name: []const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initC(builder, name, Kind.Lib, builder.version(0, 0, 0), true)) catch unreachable;
-        self.* = initC(builder, name, Kind.Lib, builder.version(0, 0, 0), true);
         return self;
     }
     pub fn createObject(builder: *Builder, name: []const u8, root_src: []const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initExtraArgs(builder, name, root_src, Kind.Obj, false, builder.version(0, 0, 0))) catch unreachable;
-        self.* = initExtraArgs(builder, name, root_src, Kind.Obj, false, builder.version(0, 0, 0));
         return self;
     }
     pub fn createCObject(builder: *Builder, name: []const u8, src: []const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initC(builder, name, Kind.Obj, builder.version(0, 0, 0), false)) catch unreachable;
-        self.* = initC(builder, name, Kind.Obj, builder.version(0, 0, 0), false);
         self.object_src = src;
         return self;
     }
     pub fn createExecutable(builder: *Builder, name: []const u8, root_src: ?[]const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initExtraArgs(builder, name, root_src, Kind.Exe, false, builder.version(0, 0, 0))) catch unreachable;
-        self.* = initExtraArgs(builder, name, root_src, Kind.Exe, false, builder.version(0, 0, 0));
         return self;
     }
     pub fn createCExecutable(builder: *Builder, name: []const u8) *LibExeObjStep {
-        const self = builder.allocator.create(LibExeObjStep) catch unreachable;
+        const self = builder.allocator.create(initC(builder, name, Kind.Exe, builder.version(0, 0, 0), false)) catch unreachable;
-        self.* = initC(builder, name, Kind.Exe, builder.version(0, 0, 0), false);
         return self;
     }
 @@ -1748,14 +1734,14 @@ pub const CommandStep = struct {
     /// ::argv is copied.
     pub fn create(builder: *Builder, cwd: ?[]const u8, env_map: *const BufMap, argv: []const []const u8) *CommandStep {
-        const self = builder.allocator.create(CommandStep) catch unreachable;
+        const self = builder.allocator.create(CommandStep{
-        self.* = CommandStep{
             .builder = builder,
             .step = Step.init(argv[0], builder.allocator, make),
             .argv = builder.allocator.alloc([]u8, argv.len) catch unreachable,
             .cwd = cwd,
             .env_map = env_map,
-        };
+        }) catch unreachable;
         mem.copy([]const u8, self.argv, argv);
         self.step.name = self.argv[0];
         return self;
 @@ -1778,18 +1764,17 @@ const InstallArtifactStep = struct {
     const Self = this;
     pub fn create(builder: *Builder, artifact: *LibExeObjStep) *Self {
-        const self = builder.allocator.create(Self) catch unreachable;
         const dest_dir = switch (artifact.kind) {
             LibExeObjStep.Kind.Obj => unreachable,
             LibExeObjStep.Kind.Exe => builder.exe_dir,
             LibExeObjStep.Kind.Lib => builder.lib_dir,
         };
-        self.* = Self{
+        const self = builder.allocator.create(Self{
             .builder = builder,
             .step = Step.init(builder.fmt("install {}", artifact.step.name), builder.allocator, make),
             .artifact = artifact,
             .dest_file = os.path.join(builder.allocator, dest_dir, artifact.out_filename) catch unreachable,
-        };
+        }) catch unreachable;
         self.step.dependOn(&artifact.step);
         builder.pushInstalledFile(self.dest_file);
         if (self.artifact.kind == LibExeObjStep.Kind.Lib and !self.artifact.static) {

std/debug/index.zig+5-10

 @@ -249,9 +249,7 @@ fn printSourceAtAddress(debug_info: *ElfStackTrace, out_stream: var, address: us
 pub fn openSelfDebugInfo(allocator: *mem.Allocator) !*ElfStackTrace {
     switch (builtin.object_format) {
         builtin.ObjectFormat.elf => {
-            const st = try allocator.create(ElfStackTrace);
+            const st = try allocator.create(ElfStackTrace{
-            errdefer allocator.destroy(st);
-            st.* = ElfStackTrace{
                 .self_exe_file = undefined,
                 .elf = undefined,
                 .debug_info = undefined,
 @@ -261,7 +259,8 @@ pub fn openSelfDebugInfo(allocator: *mem.Allocator) !*ElfStackTrace {
                 .debug_ranges = null,
                 .abbrev_table_list = ArrayList(AbbrevTableHeader).init(allocator),
                 .compile_unit_list = ArrayList(CompileUnit).init(allocator),
-            };
+            });
+            errdefer allocator.destroy(st);
             st.self_exe_file = try os.openSelfExe();
             errdefer st.self_exe_file.close();
 @@ -280,11 +279,8 @@ pub fn openSelfDebugInfo(allocator: *mem.Allocator) !*ElfStackTrace {
             var exe_file = try os.openSelfExe();
             defer exe_file.close();
-            const st = try allocator.create(ElfStackTrace);
+            const st = try allocator.create(ElfStackTrace{ .symbol_table = try macho.loadSymbols(allocator, &io.FileInStream.init(&exe_file)) });
             errdefer allocator.destroy(st);
-            st.* = ElfStackTrace{ .symbol_table = try macho.loadSymbols(allocator, &io.FileInStream.init(&exe_file)) };
             return st;
         },
         builtin.ObjectFormat.coff => {
 @@ -974,8 +970,7 @@ fn scanAllCompileUnits(st: *ElfStackTrace) !void {
         try st.self_exe_file.seekTo(compile_unit_pos);
-        const compile_unit_die = try st.allocator().create(Die);
+        const compile_unit_die = try st.allocator().create(try parseDie(st, abbrev_table, is_64));
-        compile_unit_die.* = try parseDie(st, abbrev_table, is_64);
         if (compile_unit_die.tag_id != DW.TAG_compile_unit) return error.InvalidDebugInfo;

std/heap.zig+1-2

...	@@ -407,8 +407,7 @@ fn testAllocator(allocator: *mem.Allocator) !void {	...	@@ -407,8 +407,7 @@ fn testAllocator(allocator: *mem.Allocator) !void {
407	var slice = try allocator.alloc(*i32, 100);	407	var slice = try allocator.alloc(*i32, 100);
408		408
409	for (slice) \|*item, i\| {	409	for (slice) \|*item, i\| {
410	item.* = try allocator.create(i32);	410	item.* = try allocator.create(@intCast(i32, i));
411	item.. = @intCast(i32, i);
412	}	411	}
413		412
414	for (slice) \|item, i\| {	413	for (slice) \|item, i\| {

std/io.zig+3-5

 @@ -414,14 +414,12 @@ pub const BufferedAtomicFile = struct {
     pub fn create(allocator: *mem.Allocator, dest_path: []const u8) !*BufferedAtomicFile {
         // TODO with well defined copy elision we don't need this allocation
-        var self = try allocator.create(BufferedAtomicFile);
+        var self = try allocator.create(BufferedAtomicFile{
-        errdefer allocator.destroy(self);
-        self.* = BufferedAtomicFile{
             .atomic_file = undefined,
             .file_stream = undefined,
             .buffered_stream = undefined,
-        };
+        });
+        errdefer allocator.destroy(self);
         self.atomic_file = try os.AtomicFile.init(allocator, dest_path, os.default_file_mode);
         errdefer self.atomic_file.deinit();

std/linked_list.zig+1-1

...	@@ -193,7 +193,7 @@ fn BaseLinkedList(comptime T: type, comptime ParentType: type, comptime field_na	...	@@ -193,7 +193,7 @@ fn BaseLinkedList(comptime T: type, comptime ParentType: type, comptime field_na
193	/// A pointer to the new node.	193	/// A pointer to the new node.
194	pub fn allocateNode(list: Self, allocator: Allocator) !*Node {	194	pub fn allocateNode(list: Self, allocator: Allocator) !*Node {
195	comptime assert(!isIntrusive());	195	comptime assert(!isIntrusive());
196	return allocator.create(Node);	196	return allocator.create(Node(undefined));
197	}	197	}
198		198
199	/// Deallocate a node.	199	/// Deallocate a node.

std/mem.zig+3-11

 @@ -31,16 +31,8 @@ pub const Allocator = struct {
     /// Guaranteed: `old_mem.len` is the same as what was returned from `allocFn` or `reallocFn`
     freeFn: fn (self: *Allocator, old_mem: []u8) void,
-    /// Call destroy with the result
+    /// Call `destroy` with the result
-    pub fn create(self: *Allocator, comptime T: type) !*T {
+    pub fn create(self: *Allocator, init: var) Error!*@typeOf(init) {
-        if (@sizeOf(T) == 0) return *{};
-        const slice = try self.alloc(T, 1);
-        return &slice[0];
-    }
-    /// Call destroy with the result
-    /// TODO once #733 is solved, this will replace create
-    pub fn construct(self: *Allocator, init: var) Error!*@typeOf(init) {
         const T = @typeOf(init);
         if (@sizeOf(T) == 0) return &{};
         const slice = try self.alloc(T, 1);
 @@ -49,7 +41,7 @@ pub const Allocator = struct {
         return ptr;
     }
-    /// `ptr` should be the return value of `construct` or `create`
+    /// `ptr` should be the return value of `create`
     pub fn destroy(self: *Allocator, ptr: var) void {
         const non_const_ptr = @intToPtr([*]u8, @ptrToInt(ptr));
         self.freeFn(self, non_const_ptr[0..@sizeOf(@typeOf(ptr).Child)]);

std/os/child_process.zig+3-6

...	@@ -85,10 +85,7 @@ pub const ChildProcess = struct {	...	@@ -85,10 +85,7 @@ pub const ChildProcess = struct {
85	/// First argument in argv is the executable.	85	/// First argument in argv is the executable.
86	/// On success must call deinit.	86	/// On success must call deinit.
87	pub fn init(argv: []const []const u8, allocator: mem.Allocator) !ChildProcess {	87	pub fn init(argv: []const []const u8, allocator: mem.Allocator) !ChildProcess {
88	const child = try allocator.create(ChildProcess);	88	const child = try allocator.create(ChildProcess{
89	errdefer allocator.destroy(child);
90
91	child.* = ChildProcess{
92	.allocator = allocator,	89	.allocator = allocator,
93	.argv = argv,	90	.argv = argv,
94	.pid = undefined,	91	.pid = undefined,
...	@@ -109,8 +106,8 @@ pub const ChildProcess = struct {	...	@@ -109,8 +106,8 @@ pub const ChildProcess = struct {
109	.stdin_behavior = StdIo.Inherit,	106	.stdin_behavior = StdIo.Inherit,
110	.stdout_behavior = StdIo.Inherit,	107	.stdout_behavior = StdIo.Inherit,
111	.stderr_behavior = StdIo.Inherit,	108	.stderr_behavior = StdIo.Inherit,
112	};	109	});
113		110	errdefer allocator.destroy(child);
114	return child;	111	return child;
115	}	112	}
116		113

std/os/index.zig+11-5

 @@ -2468,7 +2468,7 @@ pub const Thread = struct {
     data: Data,
     pub const use_pthreads = is_posix and builtin.link_libc;
-    const Data = if (use_pthreads)
+    pub const Data = if (use_pthreads)
         struct {
             handle: c.pthread_t,
             stack_addr: usize,
 @@ -2582,10 +2582,16 @@ pub fn spawnThread(context: var, comptime startFn: var) SpawnThreadError!*Thread
         const bytes_ptr = windows.HeapAlloc(heap_handle, 0, byte_count) orelse return SpawnThreadError.OutOfMemory;
         errdefer assert(windows.HeapFree(heap_handle, 0, bytes_ptr) != 0);
         const bytes = @ptrCast([*]u8, bytes_ptr)[0..byte_count];
-        const outer_context = std.heap.FixedBufferAllocator.init(bytes).allocator.create(WinThread.OuterContext) catch unreachable;
+        const outer_context = std.heap.FixedBufferAllocator.init(bytes).allocator.create(WinThread.OuterContext{
-        outer_context.inner = context;
+            .thread = Thread{
-        outer_context.thread.data.heap_handle = heap_handle;
+                .data = Thread.Data{
-        outer_context.thread.data.alloc_start = bytes_ptr;
+                    .heap_handle = heap_handle,
+                    .alloc_start = bytes_ptr,
+                    .handle = undefined,
+                },
+            },
+            .inner = context,
+        }) catch unreachable;
         const parameter = if (@sizeOf(Context) == 0) null else @ptrCast(*c_void, &outer_context.inner);
         outer_context.thread.data.handle = windows.CreateThread(null, default_stack_size, WinThread.threadMain, parameter, 0, null) orelse {

std/zig/parse.zig+75-75

...	@@ -17,7 +17,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -17,7 +17,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
17	defer stack.deinit();	17	defer stack.deinit();
18		18
19	const arena = &tree_arena.allocator;	19	const arena = &tree_arena.allocator;
20	const root_node = try arena.construct(ast.Node.Root{	20	const root_node = try arena.create(ast.Node.Root{
21	.base = ast.Node{ .id = ast.Node.Id.Root },	21	.base = ast.Node{ .id = ast.Node.Id.Root },
22	.decls = ast.Node.Root.DeclList.init(arena),	22	.decls = ast.Node.Root.DeclList.init(arena),
23	.doc_comments = null,	23	.doc_comments = null,
...	@@ -65,14 +65,14 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -65,14 +65,14 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
65	Token.Id.Keyword_test => {	65	Token.Id.Keyword_test => {
66	stack.append(State.TopLevel) catch unreachable;	66	stack.append(State.TopLevel) catch unreachable;
67		67
68	const block = try arena.construct(ast.Node.Block{	68	const block = try arena.create(ast.Node.Block{
69	.base = ast.Node{ .id = ast.Node.Id.Block },	69	.base = ast.Node{ .id = ast.Node.Id.Block },
70	.label = null,	70	.label = null,
71	.lbrace = undefined,	71	.lbrace = undefined,
72	.statements = ast.Node.Block.StatementList.init(arena),	72	.statements = ast.Node.Block.StatementList.init(arena),
73	.rbrace = undefined,	73	.rbrace = undefined,
74	});	74	});
75	const test_node = try arena.construct(ast.Node.TestDecl{	75	const test_node = try arena.create(ast.Node.TestDecl{
76	.base = ast.Node{ .id = ast.Node.Id.TestDecl },	76	.base = ast.Node{ .id = ast.Node.Id.TestDecl },
77	.doc_comments = comments,	77	.doc_comments = comments,
78	.test_token = token_index,	78	.test_token = token_index,
...	@@ -109,14 +109,14 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -109,14 +109,14 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
109	continue;	109	continue;
110	},	110	},
111	Token.Id.Keyword_comptime => {	111	Token.Id.Keyword_comptime => {
112	const block = try arena.construct(ast.Node.Block{	112	const block = try arena.create(ast.Node.Block{
113	.base = ast.Node{ .id = ast.Node.Id.Block },	113	.base = ast.Node{ .id = ast.Node.Id.Block },
114	.label = null,	114	.label = null,
115	.lbrace = undefined,	115	.lbrace = undefined,
116	.statements = ast.Node.Block.StatementList.init(arena),	116	.statements = ast.Node.Block.StatementList.init(arena),
117	.rbrace = undefined,	117	.rbrace = undefined,
118	});	118	});
119	const node = try arena.construct(ast.Node.Comptime{	119	const node = try arena.create(ast.Node.Comptime{
120	.base = ast.Node{ .id = ast.Node.Id.Comptime },	120	.base = ast.Node{ .id = ast.Node.Id.Comptime },
121	.comptime_token = token_index,	121	.comptime_token = token_index,
122	.expr = &block.base,	122	.expr = &block.base,
...	@@ -225,7 +225,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -225,7 +225,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
225	return tree;	225	return tree;
226	}	226	}
227		227
228	const node = try arena.construct(ast.Node.Use{	228	const node = try arena.create(ast.Node.Use{
229	.base = ast.Node{ .id = ast.Node.Id.Use },	229	.base = ast.Node{ .id = ast.Node.Id.Use },
230	.use_token = token_index,	230	.use_token = token_index,
231	.visib_token = ctx.visib_token,	231	.visib_token = ctx.visib_token,
...	@@ -266,7 +266,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -266,7 +266,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
266	continue;	266	continue;
267	},	267	},
268	Token.Id.Keyword_fn, Token.Id.Keyword_nakedcc, Token.Id.Keyword_stdcallcc, Token.Id.Keyword_async => {	268	Token.Id.Keyword_fn, Token.Id.Keyword_nakedcc, Token.Id.Keyword_stdcallcc, Token.Id.Keyword_async => {
269	const fn_proto = try arena.construct(ast.Node.FnProto{	269	const fn_proto = try arena.create(ast.Node.FnProto{
270	.base = ast.Node{ .id = ast.Node.Id.FnProto },	270	.base = ast.Node{ .id = ast.Node.Id.FnProto },
271	.doc_comments = ctx.comments,	271	.doc_comments = ctx.comments,
272	.visib_token = ctx.visib_token,	272	.visib_token = ctx.visib_token,
...	@@ -298,7 +298,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -298,7 +298,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
298	continue;	298	continue;
299	},	299	},
300	Token.Id.Keyword_async => {	300	Token.Id.Keyword_async => {
301	const async_node = try arena.construct(ast.Node.AsyncAttribute{	301	const async_node = try arena.create(ast.Node.AsyncAttribute{
302	.base = ast.Node{ .id = ast.Node.Id.AsyncAttribute },	302	.base = ast.Node{ .id = ast.Node.Id.AsyncAttribute },
303	.async_token = token_index,	303	.async_token = token_index,
304	.allocator_type = null,	304	.allocator_type = null,
...	@@ -330,7 +330,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -330,7 +330,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
330	},	330	},
331	State.TopLevelExternOrField => \|ctx\| {	331	State.TopLevelExternOrField => \|ctx\| {
332	if (eatToken(&tok_it, &tree, Token.Id.Identifier)) \|identifier\| {	332	if (eatToken(&tok_it, &tree, Token.Id.Identifier)) \|identifier\| {
333	const node = try arena.construct(ast.Node.StructField{	333	const node = try arena.create(ast.Node.StructField{
334	.base = ast.Node{ .id = ast.Node.Id.StructField },	334	.base = ast.Node{ .id = ast.Node.Id.StructField },
335	.doc_comments = ctx.comments,	335	.doc_comments = ctx.comments,
336	.visib_token = ctx.visib_token,	336	.visib_token = ctx.visib_token,
...	@@ -375,7 +375,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -375,7 +375,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
375	const token = nextToken(&tok_it, &tree);	375	const token = nextToken(&tok_it, &tree);
376	const token_index = token.index;	376	const token_index = token.index;
377	const token_ptr = token.ptr;	377	const token_ptr = token.ptr;
378	const node = try arena.construct(ast.Node.ContainerDecl{	378	const node = try arena.create(ast.Node.ContainerDecl{
379	.base = ast.Node{ .id = ast.Node.Id.ContainerDecl },	379	.base = ast.Node{ .id = ast.Node.Id.ContainerDecl },
380	.layout_token = ctx.layout_token,	380	.layout_token = ctx.layout_token,
381	.kind_token = switch (token_ptr.id) {	381	.kind_token = switch (token_ptr.id) {
...	@@ -448,7 +448,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -448,7 +448,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
448	Token.Id.Identifier => {	448	Token.Id.Identifier => {
449	switch (tree.tokens.at(container_decl.kind_token).id) {	449	switch (tree.tokens.at(container_decl.kind_token).id) {
450	Token.Id.Keyword_struct => {	450	Token.Id.Keyword_struct => {
451	const node = try arena.construct(ast.Node.StructField{	451	const node = try arena.create(ast.Node.StructField{
452	.base = ast.Node{ .id = ast.Node.Id.StructField },	452	.base = ast.Node{ .id = ast.Node.Id.StructField },
453	.doc_comments = comments,	453	.doc_comments = comments,
454	.visib_token = null,	454	.visib_token = null,
...	@@ -464,7 +464,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -464,7 +464,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
464	continue;	464	continue;
465	},	465	},
466	Token.Id.Keyword_union => {	466	Token.Id.Keyword_union => {
467	const node = try arena.construct(ast.Node.UnionTag{	467	const node = try arena.create(ast.Node.UnionTag{
468	.base = ast.Node{ .id = ast.Node.Id.UnionTag },	468	.base = ast.Node{ .id = ast.Node.Id.UnionTag },
469	.name_token = token_index,	469	.name_token = token_index,
470	.type_expr = null,	470	.type_expr = null,
...	@@ -480,7 +480,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -480,7 +480,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
480	continue;	480	continue;
481	},	481	},
482	Token.Id.Keyword_enum => {	482	Token.Id.Keyword_enum => {
483	const node = try arena.construct(ast.Node.EnumTag{	483	const node = try arena.create(ast.Node.EnumTag{
484	.base = ast.Node{ .id = ast.Node.Id.EnumTag },	484	.base = ast.Node{ .id = ast.Node.Id.EnumTag },
485	.name_token = token_index,	485	.name_token = token_index,
486	.value = null,	486	.value = null,
...	@@ -562,7 +562,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -562,7 +562,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
562	},	562	},
563		563
564	State.VarDecl => \|ctx\| {	564	State.VarDecl => \|ctx\| {
565	const var_decl = try arena.construct(ast.Node.VarDecl{	565	const var_decl = try arena.create(ast.Node.VarDecl{
566	.base = ast.Node{ .id = ast.Node.Id.VarDecl },	566	.base = ast.Node{ .id = ast.Node.Id.VarDecl },
567	.doc_comments = ctx.comments,	567	.doc_comments = ctx.comments,
568	.visib_token = ctx.visib_token,	568	.visib_token = ctx.visib_token,
...	@@ -660,7 +660,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -660,7 +660,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
660	const token_ptr = token.ptr;	660	const token_ptr = token.ptr;
661	switch (token_ptr.id) {	661	switch (token_ptr.id) {
662	Token.Id.LBrace => {	662	Token.Id.LBrace => {
663	const block = try arena.construct(ast.Node.Block{	663	const block = try arena.create(ast.Node.Block{
664	.base = ast.Node{ .id = ast.Node.Id.Block },	664	.base = ast.Node{ .id = ast.Node.Id.Block },
665	.label = null,	665	.label = null,
666	.lbrace = token_index,	666	.lbrace = token_index,
...	@@ -712,7 +712,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -712,7 +712,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
712	// TODO: this is a special case. Remove this when #760 is fixed	712	// TODO: this is a special case. Remove this when #760 is fixed
713	if (token_ptr.id == Token.Id.Keyword_error) {	713	if (token_ptr.id == Token.Id.Keyword_error) {
714	if (tok_it.peek().?.id == Token.Id.LBrace) {	714	if (tok_it.peek().?.id == Token.Id.LBrace) {
715	const error_type_node = try arena.construct(ast.Node.ErrorType{	715	const error_type_node = try arena.create(ast.Node.ErrorType{
716	.base = ast.Node{ .id = ast.Node.Id.ErrorType },	716	.base = ast.Node{ .id = ast.Node.Id.ErrorType },
717	.token = token_index,	717	.token = token_index,
718	});	718	});
...	@@ -733,7 +733,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -733,7 +733,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
733	if (eatToken(&tok_it, &tree, Token.Id.RParen)) \|_\| {	733	if (eatToken(&tok_it, &tree, Token.Id.RParen)) \|_\| {
734	continue;	734	continue;
735	}	735	}
736	const param_decl = try arena.construct(ast.Node.ParamDecl{	736	const param_decl = try arena.create(ast.Node.ParamDecl{
737	.base = ast.Node{ .id = ast.Node.Id.ParamDecl },	737	.base = ast.Node{ .id = ast.Node.Id.ParamDecl },
738	.comptime_token = null,	738	.comptime_token = null,
739	.noalias_token = null,	739	.noalias_token = null,
...	@@ -819,7 +819,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -819,7 +819,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
819	const token_ptr = token.ptr;	819	const token_ptr = token.ptr;
820	switch (token_ptr.id) {	820	switch (token_ptr.id) {
821	Token.Id.LBrace => {	821	Token.Id.LBrace => {
822	const block = try arena.construct(ast.Node.Block{	822	const block = try arena.create(ast.Node.Block{
823	.base = ast.Node{ .id = ast.Node.Id.Block },	823	.base = ast.Node{ .id = ast.Node.Id.Block },
824	.label = ctx.label,	824	.label = ctx.label,
825	.lbrace = token_index,	825	.lbrace = token_index,
...	@@ -853,7 +853,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -853,7 +853,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
853	continue;	853	continue;
854	},	854	},
855	Token.Id.Keyword_suspend => {	855	Token.Id.Keyword_suspend => {
856	const node = try arena.construct(ast.Node.Suspend{	856	const node = try arena.create(ast.Node.Suspend{
857	.base = ast.Node{ .id = ast.Node.Id.Suspend },	857	.base = ast.Node{ .id = ast.Node.Id.Suspend },
858	.label = ctx.label,	858	.label = ctx.label,
859	.suspend_token = token_index,	859	.suspend_token = token_index,
...	@@ -925,7 +925,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -925,7 +925,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
925	}	925	}
926	},	926	},
927	State.While => \|ctx\| {	927	State.While => \|ctx\| {
928	const node = try arena.construct(ast.Node.While{	928	const node = try arena.create(ast.Node.While{
929	.base = ast.Node{ .id = ast.Node.Id.While },	929	.base = ast.Node{ .id = ast.Node.Id.While },
930	.label = ctx.label,	930	.label = ctx.label,
931	.inline_token = ctx.inline_token,	931	.inline_token = ctx.inline_token,
...	@@ -954,7 +954,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -954,7 +954,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
954	continue;	954	continue;
955	},	955	},
956	State.For => \|ctx\| {	956	State.For => \|ctx\| {
957	const node = try arena.construct(ast.Node.For{	957	const node = try arena.create(ast.Node.For{
958	.base = ast.Node{ .id = ast.Node.Id.For },	958	.base = ast.Node{ .id = ast.Node.Id.For },
959	.label = ctx.label,	959	.label = ctx.label,
960	.inline_token = ctx.inline_token,	960	.inline_token = ctx.inline_token,
...	@@ -975,7 +975,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -975,7 +975,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
975	},	975	},
976	State.Else => \|dest\| {	976	State.Else => \|dest\| {
977	if (eatToken(&tok_it, &tree, Token.Id.Keyword_else)) \|else_token\| {	977	if (eatToken(&tok_it, &tree, Token.Id.Keyword_else)) \|else_token\| {
978	const node = try arena.construct(ast.Node.Else{	978	const node = try arena.create(ast.Node.Else{
979	.base = ast.Node{ .id = ast.Node.Id.Else },	979	.base = ast.Node{ .id = ast.Node.Id.Else },
980	.else_token = else_token,	980	.else_token = else_token,
981	.payload = null,	981	.payload = null,
...	@@ -1038,7 +1038,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1038,7 +1038,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1038	continue;	1038	continue;
1039	},	1039	},
1040	Token.Id.Keyword_defer, Token.Id.Keyword_errdefer => {	1040	Token.Id.Keyword_defer, Token.Id.Keyword_errdefer => {
1041	const node = try arena.construct(ast.Node.Defer{	1041	const node = try arena.create(ast.Node.Defer{
1042	.base = ast.Node{ .id = ast.Node.Id.Defer },	1042	.base = ast.Node{ .id = ast.Node.Id.Defer },
1043	.defer_token = token_index,	1043	.defer_token = token_index,
1044	.kind = switch (token_ptr.id) {	1044	.kind = switch (token_ptr.id) {
...	@@ -1056,7 +1056,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1056,7 +1056,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1056	continue;	1056	continue;
1057	},	1057	},
1058	Token.Id.LBrace => {	1058	Token.Id.LBrace => {
1059	const inner_block = try arena.construct(ast.Node.Block{	1059	const inner_block = try arena.create(ast.Node.Block{
1060	.base = ast.Node{ .id = ast.Node.Id.Block },	1060	.base = ast.Node{ .id = ast.Node.Id.Block },
1061	.label = null,	1061	.label = null,
1062	.lbrace = token_index,	1062	.lbrace = token_index,
...	@@ -1124,7 +1124,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1124,7 +1124,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1124	continue;	1124	continue;
1125	}	1125	}
1126		1126
1127	const node = try arena.construct(ast.Node.AsmOutput{	1127	const node = try arena.create(ast.Node.AsmOutput{
1128	.base = ast.Node{ .id = ast.Node.Id.AsmOutput },	1128	.base = ast.Node{ .id = ast.Node.Id.AsmOutput },
1129	.lbracket = lbracket_index,	1129	.lbracket = lbracket_index,
1130	.symbolic_name = undefined,	1130	.symbolic_name = undefined,
...	@@ -1178,7 +1178,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1178,7 +1178,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1178	continue;	1178	continue;
1179	}	1179	}
1180		1180
1181	const node = try arena.construct(ast.Node.AsmInput{	1181	const node = try arena.create(ast.Node.AsmInput{
1182	.base = ast.Node{ .id = ast.Node.Id.AsmInput },	1182	.base = ast.Node{ .id = ast.Node.Id.AsmInput },
1183	.lbracket = lbracket_index,	1183	.lbracket = lbracket_index,
1184	.symbolic_name = undefined,	1184	.symbolic_name = undefined,
...	@@ -1243,7 +1243,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1243,7 +1243,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1243	continue;	1243	continue;
1244	}	1244	}
1245		1245
1246	const node = try arena.construct(ast.Node.FieldInitializer{	1246	const node = try arena.create(ast.Node.FieldInitializer{
1247	.base = ast.Node{ .id = ast.Node.Id.FieldInitializer },	1247	.base = ast.Node{ .id = ast.Node.Id.FieldInitializer },
1248	.period_token = undefined,	1248	.period_token = undefined,
1249	.name_token = undefined,	1249	.name_token = undefined,
...	@@ -1332,7 +1332,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1332,7 +1332,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1332	}	1332	}
1333		1333
1334	const comments = try eatDocComments(arena, &tok_it, &tree);	1334	const comments = try eatDocComments(arena, &tok_it, &tree);
1335	const node = try arena.construct(ast.Node.SwitchCase{	1335	const node = try arena.create(ast.Node.SwitchCase{
1336	.base = ast.Node{ .id = ast.Node.Id.SwitchCase },	1336	.base = ast.Node{ .id = ast.Node.Id.SwitchCase },
1337	.items = ast.Node.SwitchCase.ItemList.init(arena),	1337	.items = ast.Node.SwitchCase.ItemList.init(arena),
1338	.payload = null,	1338	.payload = null,
...	@@ -1369,7 +1369,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1369,7 +1369,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1369	const token_index = token.index;	1369	const token_index = token.index;
1370	const token_ptr = token.ptr;	1370	const token_ptr = token.ptr;
1371	if (token_ptr.id == Token.Id.Keyword_else) {	1371	if (token_ptr.id == Token.Id.Keyword_else) {
1372	const else_node = try arena.construct(ast.Node.SwitchElse{	1372	const else_node = try arena.create(ast.Node.SwitchElse{
1373	.base = ast.Node{ .id = ast.Node.Id.SwitchElse },	1373	.base = ast.Node{ .id = ast.Node.Id.SwitchElse },
1374	.token = token_index,	1374	.token = token_index,
1375	});	1375	});
...	@@ -1468,7 +1468,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1468,7 +1468,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1468		1468
1469	State.ExternType => \|ctx\| {	1469	State.ExternType => \|ctx\| {
1470	if (eatToken(&tok_it, &tree, Token.Id.Keyword_fn)) \|fn_token\| {	1470	if (eatToken(&tok_it, &tree, Token.Id.Keyword_fn)) \|fn_token\| {
1471	const fn_proto = try arena.construct(ast.Node.FnProto{	1471	const fn_proto = try arena.create(ast.Node.FnProto{
1472	.base = ast.Node{ .id = ast.Node.Id.FnProto },	1472	.base = ast.Node{ .id = ast.Node.Id.FnProto },
1473	.doc_comments = ctx.comments,	1473	.doc_comments = ctx.comments,
1474	.visib_token = null,	1474	.visib_token = null,
...	@@ -1641,7 +1641,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1641,7 +1641,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1641	continue;	1641	continue;
1642	}	1642	}
1643		1643
1644	const node = try arena.construct(ast.Node.Payload{	1644	const node = try arena.create(ast.Node.Payload{
1645	.base = ast.Node{ .id = ast.Node.Id.Payload },	1645	.base = ast.Node{ .id = ast.Node.Id.Payload },
1646	.lpipe = token_index,	1646	.lpipe = token_index,
1647	.error_symbol = undefined,	1647	.error_symbol = undefined,
...	@@ -1677,7 +1677,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1677,7 +1677,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1677	continue;	1677	continue;
1678	}	1678	}
1679		1679
1680	const node = try arena.construct(ast.Node.PointerPayload{	1680	const node = try arena.create(ast.Node.PointerPayload{
1681	.base = ast.Node{ .id = ast.Node.Id.PointerPayload },	1681	.base = ast.Node{ .id = ast.Node.Id.PointerPayload },
1682	.lpipe = token_index,	1682	.lpipe = token_index,
1683	.ptr_token = null,	1683	.ptr_token = null,
...	@@ -1720,7 +1720,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1720,7 +1720,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1720	continue;	1720	continue;
1721	}	1721	}
1722		1722
1723	const node = try arena.construct(ast.Node.PointerIndexPayload{	1723	const node = try arena.create(ast.Node.PointerIndexPayload{
1724	.base = ast.Node{ .id = ast.Node.Id.PointerIndexPayload },	1724	.base = ast.Node{ .id = ast.Node.Id.PointerIndexPayload },
1725	.lpipe = token_index,	1725	.lpipe = token_index,
1726	.ptr_token = null,	1726	.ptr_token = null,
...	@@ -1754,7 +1754,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1754,7 +1754,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1754	const token_ptr = token.ptr;	1754	const token_ptr = token.ptr;
1755	switch (token_ptr.id) {	1755	switch (token_ptr.id) {
1756	Token.Id.Keyword_return, Token.Id.Keyword_break, Token.Id.Keyword_continue => {	1756	Token.Id.Keyword_return, Token.Id.Keyword_break, Token.Id.Keyword_continue => {
1757	const node = try arena.construct(ast.Node.ControlFlowExpression{	1757	const node = try arena.create(ast.Node.ControlFlowExpression{
1758	.base = ast.Node{ .id = ast.Node.Id.ControlFlowExpression },	1758	.base = ast.Node{ .id = ast.Node.Id.ControlFlowExpression },
1759	.ltoken = token_index,	1759	.ltoken = token_index,
1760	.kind = undefined,	1760	.kind = undefined,
...	@@ -1783,7 +1783,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1783,7 +1783,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1783	continue;	1783	continue;
1784	},	1784	},
1785	Token.Id.Keyword_try, Token.Id.Keyword_cancel, Token.Id.Keyword_resume => {	1785	Token.Id.Keyword_try, Token.Id.Keyword_cancel, Token.Id.Keyword_resume => {
1786	const node = try arena.construct(ast.Node.PrefixOp{	1786	const node = try arena.create(ast.Node.PrefixOp{
1787	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },	1787	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },
1788	.op_token = token_index,	1788	.op_token = token_index,
1789	.op = switch (token_ptr.id) {	1789	.op = switch (token_ptr.id) {
...	@@ -1817,7 +1817,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1817,7 +1817,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1817	const lhs = opt_ctx.get() orelse continue;	1817	const lhs = opt_ctx.get() orelse continue;
1818		1818
1819	if (eatToken(&tok_it, &tree, Token.Id.Ellipsis3)) \|ellipsis3\| {	1819	if (eatToken(&tok_it, &tree, Token.Id.Ellipsis3)) \|ellipsis3\| {
1820	const node = try arena.construct(ast.Node.InfixOp{	1820	const node = try arena.create(ast.Node.InfixOp{
1821	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1821	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1822	.lhs = lhs,	1822	.lhs = lhs,
1823	.op_token = ellipsis3,	1823	.op_token = ellipsis3,
...	@@ -1842,7 +1842,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1842,7 +1842,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1842	const token_index = token.index;	1842	const token_index = token.index;
1843	const token_ptr = token.ptr;	1843	const token_ptr = token.ptr;
1844	if (tokenIdToAssignment(token_ptr.id)) \|ass_id\| {	1844	if (tokenIdToAssignment(token_ptr.id)) \|ass_id\| {
1845	const node = try arena.construct(ast.Node.InfixOp{	1845	const node = try arena.create(ast.Node.InfixOp{
1846	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1846	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1847	.lhs = lhs,	1847	.lhs = lhs,
1848	.op_token = token_index,	1848	.op_token = token_index,
...	@@ -1872,7 +1872,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1872,7 +1872,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1872	const token_index = token.index;	1872	const token_index = token.index;
1873	const token_ptr = token.ptr;	1873	const token_ptr = token.ptr;
1874	if (tokenIdToUnwrapExpr(token_ptr.id)) \|unwrap_id\| {	1874	if (tokenIdToUnwrapExpr(token_ptr.id)) \|unwrap_id\| {
1875	const node = try arena.construct(ast.Node.InfixOp{	1875	const node = try arena.create(ast.Node.InfixOp{
1876	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1876	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1877	.lhs = lhs,	1877	.lhs = lhs,
1878	.op_token = token_index,	1878	.op_token = token_index,
...	@@ -1904,7 +1904,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1904,7 +1904,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1904	const lhs = opt_ctx.get() orelse continue;	1904	const lhs = opt_ctx.get() orelse continue;
1905		1905
1906	if (eatToken(&tok_it, &tree, Token.Id.Keyword_or)) \|or_token\| {	1906	if (eatToken(&tok_it, &tree, Token.Id.Keyword_or)) \|or_token\| {
1907	const node = try arena.construct(ast.Node.InfixOp{	1907	const node = try arena.create(ast.Node.InfixOp{
1908	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1908	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1909	.lhs = lhs,	1909	.lhs = lhs,
1910	.op_token = or_token,	1910	.op_token = or_token,
...	@@ -1928,7 +1928,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1928,7 +1928,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1928	const lhs = opt_ctx.get() orelse continue;	1928	const lhs = opt_ctx.get() orelse continue;
1929		1929
1930	if (eatToken(&tok_it, &tree, Token.Id.Keyword_and)) \|and_token\| {	1930	if (eatToken(&tok_it, &tree, Token.Id.Keyword_and)) \|and_token\| {
1931	const node = try arena.construct(ast.Node.InfixOp{	1931	const node = try arena.create(ast.Node.InfixOp{
1932	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1932	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1933	.lhs = lhs,	1933	.lhs = lhs,
1934	.op_token = and_token,	1934	.op_token = and_token,
...	@@ -1955,7 +1955,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1955,7 +1955,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1955	const token_index = token.index;	1955	const token_index = token.index;
1956	const token_ptr = token.ptr;	1956	const token_ptr = token.ptr;
1957	if (tokenIdToComparison(token_ptr.id)) \|comp_id\| {	1957	if (tokenIdToComparison(token_ptr.id)) \|comp_id\| {
1958	const node = try arena.construct(ast.Node.InfixOp{	1958	const node = try arena.create(ast.Node.InfixOp{
1959	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1959	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1960	.lhs = lhs,	1960	.lhs = lhs,
1961	.op_token = token_index,	1961	.op_token = token_index,
...	@@ -1982,7 +1982,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -1982,7 +1982,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
1982	const lhs = opt_ctx.get() orelse continue;	1982	const lhs = opt_ctx.get() orelse continue;
1983		1983
1984	if (eatToken(&tok_it, &tree, Token.Id.Pipe)) \|pipe\| {	1984	if (eatToken(&tok_it, &tree, Token.Id.Pipe)) \|pipe\| {
1985	const node = try arena.construct(ast.Node.InfixOp{	1985	const node = try arena.create(ast.Node.InfixOp{
1986	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	1986	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
1987	.lhs = lhs,	1987	.lhs = lhs,
1988	.op_token = pipe,	1988	.op_token = pipe,
...	@@ -2006,7 +2006,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2006,7 +2006,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2006	const lhs = opt_ctx.get() orelse continue;	2006	const lhs = opt_ctx.get() orelse continue;
2007		2007
2008	if (eatToken(&tok_it, &tree, Token.Id.Caret)) \|caret\| {	2008	if (eatToken(&tok_it, &tree, Token.Id.Caret)) \|caret\| {
2009	const node = try arena.construct(ast.Node.InfixOp{	2009	const node = try arena.create(ast.Node.InfixOp{
2010	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2010	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2011	.lhs = lhs,	2011	.lhs = lhs,
2012	.op_token = caret,	2012	.op_token = caret,
...	@@ -2030,7 +2030,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2030,7 +2030,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2030	const lhs = opt_ctx.get() orelse continue;	2030	const lhs = opt_ctx.get() orelse continue;
2031		2031
2032	if (eatToken(&tok_it, &tree, Token.Id.Ampersand)) \|ampersand\| {	2032	if (eatToken(&tok_it, &tree, Token.Id.Ampersand)) \|ampersand\| {
2033	const node = try arena.construct(ast.Node.InfixOp{	2033	const node = try arena.create(ast.Node.InfixOp{
2034	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2034	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2035	.lhs = lhs,	2035	.lhs = lhs,
2036	.op_token = ampersand,	2036	.op_token = ampersand,
...	@@ -2057,7 +2057,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2057,7 +2057,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2057	const token_index = token.index;	2057	const token_index = token.index;
2058	const token_ptr = token.ptr;	2058	const token_ptr = token.ptr;
2059	if (tokenIdToBitShift(token_ptr.id)) \|bitshift_id\| {	2059	if (tokenIdToBitShift(token_ptr.id)) \|bitshift_id\| {
2060	const node = try arena.construct(ast.Node.InfixOp{	2060	const node = try arena.create(ast.Node.InfixOp{
2061	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2061	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2062	.lhs = lhs,	2062	.lhs = lhs,
2063	.op_token = token_index,	2063	.op_token = token_index,
...	@@ -2087,7 +2087,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2087,7 +2087,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2087	const token_index = token.index;	2087	const token_index = token.index;
2088	const token_ptr = token.ptr;	2088	const token_ptr = token.ptr;
2089	if (tokenIdToAddition(token_ptr.id)) \|add_id\| {	2089	if (tokenIdToAddition(token_ptr.id)) \|add_id\| {
2090	const node = try arena.construct(ast.Node.InfixOp{	2090	const node = try arena.create(ast.Node.InfixOp{
2091	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2091	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2092	.lhs = lhs,	2092	.lhs = lhs,
2093	.op_token = token_index,	2093	.op_token = token_index,
...	@@ -2117,7 +2117,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2117,7 +2117,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2117	const token_index = token.index;	2117	const token_index = token.index;
2118	const token_ptr = token.ptr;	2118	const token_ptr = token.ptr;
2119	if (tokenIdToMultiply(token_ptr.id)) \|mult_id\| {	2119	if (tokenIdToMultiply(token_ptr.id)) \|mult_id\| {
2120	const node = try arena.construct(ast.Node.InfixOp{	2120	const node = try arena.create(ast.Node.InfixOp{
2121	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2121	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2122	.lhs = lhs,	2122	.lhs = lhs,
2123	.op_token = token_index,	2123	.op_token = token_index,
...	@@ -2145,7 +2145,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2145,7 +2145,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2145	const lhs = opt_ctx.get() orelse continue;	2145	const lhs = opt_ctx.get() orelse continue;
2146		2146
2147	if (tok_it.peek().?.id == Token.Id.Period) {	2147	if (tok_it.peek().?.id == Token.Id.Period) {
2148	const node = try arena.construct(ast.Node.SuffixOp{	2148	const node = try arena.create(ast.Node.SuffixOp{
2149	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2149	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2150	.lhs = lhs,	2150	.lhs = lhs,
2151	.op = ast.Node.SuffixOp.Op{ .StructInitializer = ast.Node.SuffixOp.Op.InitList.init(arena) },	2151	.op = ast.Node.SuffixOp.Op{ .StructInitializer = ast.Node.SuffixOp.Op.InitList.init(arena) },
...	@@ -2164,7 +2164,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2164,7 +2164,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2164	continue;	2164	continue;
2165	}	2165	}
2166		2166
2167	const node = try arena.construct(ast.Node.SuffixOp{	2167	const node = try arena.create(ast.Node.SuffixOp{
2168	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2168	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2169	.lhs = lhs,	2169	.lhs = lhs,
2170	.op = ast.Node.SuffixOp.Op{ .ArrayInitializer = ast.Node.SuffixOp.Op.InitList.init(arena) },	2170	.op = ast.Node.SuffixOp.Op{ .ArrayInitializer = ast.Node.SuffixOp.Op.InitList.init(arena) },
...	@@ -2193,7 +2193,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2193,7 +2193,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2193	const lhs = opt_ctx.get() orelse continue;	2193	const lhs = opt_ctx.get() orelse continue;
2194		2194
2195	if (eatToken(&tok_it, &tree, Token.Id.Bang)) \|bang\| {	2195	if (eatToken(&tok_it, &tree, Token.Id.Bang)) \|bang\| {
2196	const node = try arena.construct(ast.Node.InfixOp{	2196	const node = try arena.create(ast.Node.InfixOp{
2197	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2197	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2198	.lhs = lhs,	2198	.lhs = lhs,
2199	.op_token = bang,	2199	.op_token = bang,
...	@@ -2212,7 +2212,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2212,7 +2212,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2212	const token_index = token.index;	2212	const token_index = token.index;
2213	const token_ptr = token.ptr;	2213	const token_ptr = token.ptr;
2214	if (tokenIdToPrefixOp(token_ptr.id)) \|prefix_id\| {	2214	if (tokenIdToPrefixOp(token_ptr.id)) \|prefix_id\| {
2215	var node = try arena.construct(ast.Node.PrefixOp{	2215	var node = try arena.create(ast.Node.PrefixOp{
2216	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },	2216	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },
2217	.op_token = token_index,	2217	.op_token = token_index,
2218	.op = prefix_id,	2218	.op = prefix_id,
...	@@ -2222,7 +2222,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2222,7 +2222,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2222		2222
2223	// Treat '**' token as two pointer types	2223	// Treat '**' token as two pointer types
2224	if (token_ptr.id == Token.Id.AsteriskAsterisk) {	2224	if (token_ptr.id == Token.Id.AsteriskAsterisk) {
2225	const child = try arena.construct(ast.Node.PrefixOp{	2225	const child = try arena.create(ast.Node.PrefixOp{
2226	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },	2226	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },
2227	.op_token = token_index,	2227	.op_token = token_index,
2228	.op = prefix_id,	2228	.op = prefix_id,
...	@@ -2246,7 +2246,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2246,7 +2246,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2246		2246
2247	State.SuffixOpExpressionBegin => \|opt_ctx\| {	2247	State.SuffixOpExpressionBegin => \|opt_ctx\| {
2248	if (eatToken(&tok_it, &tree, Token.Id.Keyword_async)) \|async_token\| {	2248	if (eatToken(&tok_it, &tree, Token.Id.Keyword_async)) \|async_token\| {
2249	const async_node = try arena.construct(ast.Node.AsyncAttribute{	2249	const async_node = try arena.create(ast.Node.AsyncAttribute{
2250	.base = ast.Node{ .id = ast.Node.Id.AsyncAttribute },	2250	.base = ast.Node{ .id = ast.Node.Id.AsyncAttribute },
2251	.async_token = async_token,	2251	.async_token = async_token,
2252	.allocator_type = null,	2252	.allocator_type = null,
...	@@ -2277,7 +2277,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2277,7 +2277,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2277	const token_ptr = token.ptr;	2277	const token_ptr = token.ptr;
2278	switch (token_ptr.id) {	2278	switch (token_ptr.id) {
2279	Token.Id.LParen => {	2279	Token.Id.LParen => {
2280	const node = try arena.construct(ast.Node.SuffixOp{	2280	const node = try arena.create(ast.Node.SuffixOp{
2281	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2281	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2282	.lhs = lhs,	2282	.lhs = lhs,
2283	.op = ast.Node.SuffixOp.Op{	2283	.op = ast.Node.SuffixOp.Op{
...	@@ -2301,7 +2301,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2301,7 +2301,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2301	continue;	2301	continue;
2302	},	2302	},
2303	Token.Id.LBracket => {	2303	Token.Id.LBracket => {
2304	const node = try arena.construct(ast.Node.SuffixOp{	2304	const node = try arena.create(ast.Node.SuffixOp{
2305	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2305	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2306	.lhs = lhs,	2306	.lhs = lhs,
2307	.op = ast.Node.SuffixOp.Op{ .ArrayAccess = undefined },	2307	.op = ast.Node.SuffixOp.Op{ .ArrayAccess = undefined },
...	@@ -2316,7 +2316,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2316,7 +2316,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2316	},	2316	},
2317	Token.Id.Period => {	2317	Token.Id.Period => {
2318	if (eatToken(&tok_it, &tree, Token.Id.Asterisk)) \|asterisk_token\| {	2318	if (eatToken(&tok_it, &tree, Token.Id.Asterisk)) \|asterisk_token\| {
2319	const node = try arena.construct(ast.Node.SuffixOp{	2319	const node = try arena.create(ast.Node.SuffixOp{
2320	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2320	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2321	.lhs = lhs,	2321	.lhs = lhs,
2322	.op = ast.Node.SuffixOp.Op.Deref,	2322	.op = ast.Node.SuffixOp.Op.Deref,
...	@@ -2327,7 +2327,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2327,7 +2327,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2327	continue;	2327	continue;
2328	}	2328	}
2329	if (eatToken(&tok_it, &tree, Token.Id.QuestionMark)) \|question_token\| {	2329	if (eatToken(&tok_it, &tree, Token.Id.QuestionMark)) \|question_token\| {
2330	const node = try arena.construct(ast.Node.SuffixOp{	2330	const node = try arena.create(ast.Node.SuffixOp{
2331	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },	2331	.base = ast.Node{ .id = ast.Node.Id.SuffixOp },
2332	.lhs = lhs,	2332	.lhs = lhs,
2333	.op = ast.Node.SuffixOp.Op.UnwrapOptional,	2333	.op = ast.Node.SuffixOp.Op.UnwrapOptional,
...	@@ -2337,7 +2337,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2337,7 +2337,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2337	stack.append(State{ .SuffixOpExpressionEnd = opt_ctx.toRequired() }) catch unreachable;	2337	stack.append(State{ .SuffixOpExpressionEnd = opt_ctx.toRequired() }) catch unreachable;
2338	continue;	2338	continue;
2339	}	2339	}
2340	const node = try arena.construct(ast.Node.InfixOp{	2340	const node = try arena.create(ast.Node.InfixOp{
2341	.base = ast.Node{ .id = ast.Node.Id.InfixOp },	2341	.base = ast.Node{ .id = ast.Node.Id.InfixOp },
2342	.lhs = lhs,	2342	.lhs = lhs,
2343	.op_token = token_index,	2343	.op_token = token_index,
...	@@ -2397,7 +2397,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2397,7 +2397,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2397	continue;	2397	continue;
2398	},	2398	},
2399	Token.Id.Keyword_promise => {	2399	Token.Id.Keyword_promise => {
2400	const node = try arena.construct(ast.Node.PromiseType{	2400	const node = try arena.create(ast.Node.PromiseType{
2401	.base = ast.Node{ .id = ast.Node.Id.PromiseType },	2401	.base = ast.Node{ .id = ast.Node.Id.PromiseType },
2402	.promise_token = token.index,	2402	.promise_token = token.index,
2403	.result = null,	2403	.result = null,
...	@@ -2423,7 +2423,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2423,7 +2423,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2423	continue;	2423	continue;
2424	},	2424	},
2425	Token.Id.LParen => {	2425	Token.Id.LParen => {
2426	const node = try arena.construct(ast.Node.GroupedExpression{	2426	const node = try arena.create(ast.Node.GroupedExpression{
2427	.base = ast.Node{ .id = ast.Node.Id.GroupedExpression },	2427	.base = ast.Node{ .id = ast.Node.Id.GroupedExpression },
2428	.lparen = token.index,	2428	.lparen = token.index,
2429	.expr = undefined,	2429	.expr = undefined,
...	@@ -2441,7 +2441,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2441,7 +2441,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2441	continue;	2441	continue;
2442	},	2442	},
2443	Token.Id.Builtin => {	2443	Token.Id.Builtin => {
2444	const node = try arena.construct(ast.Node.BuiltinCall{	2444	const node = try arena.create(ast.Node.BuiltinCall{
2445	.base = ast.Node{ .id = ast.Node.Id.BuiltinCall },	2445	.base = ast.Node{ .id = ast.Node.Id.BuiltinCall },
2446	.builtin_token = token.index,	2446	.builtin_token = token.index,
2447	.params = ast.Node.BuiltinCall.ParamList.init(arena),	2447	.params = ast.Node.BuiltinCall.ParamList.init(arena),
...	@@ -2460,7 +2460,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2460,7 +2460,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2460	continue;	2460	continue;
2461	},	2461	},
2462	Token.Id.LBracket => {	2462	Token.Id.LBracket => {
2463	const node = try arena.construct(ast.Node.PrefixOp{	2463	const node = try arena.create(ast.Node.PrefixOp{
2464	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },	2464	.base = ast.Node{ .id = ast.Node.Id.PrefixOp },
2465	.op_token = token.index,	2465	.op_token = token.index,
2466	.op = undefined,	2466	.op = undefined,
...	@@ -2519,7 +2519,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2519,7 +2519,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2519	continue;	2519	continue;
2520	},	2520	},
2521	Token.Id.Keyword_fn => {	2521	Token.Id.Keyword_fn => {
2522	const fn_proto = try arena.construct(ast.Node.FnProto{	2522	const fn_proto = try arena.create(ast.Node.FnProto{
2523	.base = ast.Node{ .id = ast.Node.Id.FnProto },	2523	.base = ast.Node{ .id = ast.Node.Id.FnProto },
2524	.doc_comments = null,	2524	.doc_comments = null,
2525	.visib_token = null,	2525	.visib_token = null,
...	@@ -2540,7 +2540,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2540,7 +2540,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2540	continue;	2540	continue;
2541	},	2541	},
2542	Token.Id.Keyword_nakedcc, Token.Id.Keyword_stdcallcc => {	2542	Token.Id.Keyword_nakedcc, Token.Id.Keyword_stdcallcc => {
2543	const fn_proto = try arena.construct(ast.Node.FnProto{	2543	const fn_proto = try arena.create(ast.Node.FnProto{
2544	.base = ast.Node{ .id = ast.Node.Id.FnProto },	2544	.base = ast.Node{ .id = ast.Node.Id.FnProto },
2545	.doc_comments = null,	2545	.doc_comments = null,
2546	.visib_token = null,	2546	.visib_token = null,
...	@@ -2567,7 +2567,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2567,7 +2567,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2567	continue;	2567	continue;
2568	},	2568	},
2569	Token.Id.Keyword_asm => {	2569	Token.Id.Keyword_asm => {
2570	const node = try arena.construct(ast.Node.Asm{	2570	const node = try arena.create(ast.Node.Asm{
2571	.base = ast.Node{ .id = ast.Node.Id.Asm },	2571	.base = ast.Node{ .id = ast.Node.Id.Asm },
2572	.asm_token = token.index,	2572	.asm_token = token.index,
2573	.volatile_token = null,	2573	.volatile_token = null,
...	@@ -2629,7 +2629,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2629,7 +2629,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2629	continue;	2629	continue;
2630	}	2630	}
2631		2631
2632	const node = try arena.construct(ast.Node.ErrorSetDecl{	2632	const node = try arena.create(ast.Node.ErrorSetDecl{
2633	.base = ast.Node{ .id = ast.Node.Id.ErrorSetDecl },	2633	.base = ast.Node{ .id = ast.Node.Id.ErrorSetDecl },
2634	.error_token = ctx.error_token,	2634	.error_token = ctx.error_token,
2635	.decls = ast.Node.ErrorSetDecl.DeclList.init(arena),	2635	.decls = ast.Node.ErrorSetDecl.DeclList.init(arena),
...	@@ -2695,7 +2695,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {	...	@@ -2695,7 +2695,7 @@ pub fn parse(allocator: *mem.Allocator, source: []const u8) !ast.Tree {
2695	return tree;	2695	return tree;
2696	}	2696	}
2697		2697
2698	const node = try arena.construct(ast.Node.ErrorTag{	2698	const node = try arena.create(ast.Node.ErrorTag{
2699	.base = ast.Node{ .id = ast.Node.Id.ErrorTag },	2699	.base = ast.Node{ .id = ast.Node.Id.ErrorTag },
2700	.doc_comments = comments,	2700	.doc_comments = comments,
2701	.name_token = ident_token_index,	2701	.name_token = ident_token_index,
...	@@ -3032,7 +3032,7 @@ fn pushDocComment(arena: mem.Allocator, line_comment: TokenIndex, result: ?*as	...	@@ -3032,7 +3032,7 @@ fn pushDocComment(arena: mem.Allocator, line_comment: TokenIndex, result: ?*as
3032	if (result.*) \|comment_node\| {	3032	if (result.*) \|comment_node\| {
3033	break :blk comment_node;	3033	break :blk comment_node;
3034	} else {	3034	} else {
3035	const comment_node = try arena.construct(ast.Node.DocComment{	3035	const comment_node = try arena.create(ast.Node.DocComment{
3036	.base = ast.Node{ .id = ast.Node.Id.DocComment },	3036	.base = ast.Node{ .id = ast.Node.Id.DocComment },
3037	.lines = ast.Node.DocComment.LineList.init(arena),	3037	.lines = ast.Node.DocComment.LineList.init(arena),
3038	});	3038	});
...	@@ -3061,7 +3061,7 @@ fn parseStringLiteral(arena: mem.Allocator, tok_it: ast.Tree.TokenList.Iterato	...	@@ -3061,7 +3061,7 @@ fn parseStringLiteral(arena: mem.Allocator, tok_it: ast.Tree.TokenList.Iterato
3061	return &(try createLiteral(arena, ast.Node.StringLiteral, token_index)).base;	3061	return &(try createLiteral(arena, ast.Node.StringLiteral, token_index)).base;
3062	},	3062	},
3063	Token.Id.MultilineStringLiteralLine => {	3063	Token.Id.MultilineStringLiteralLine => {
3064	const node = try arena.construct(ast.Node.MultilineStringLiteral{	3064	const node = try arena.create(ast.Node.MultilineStringLiteral{
3065	.base = ast.Node{ .id = ast.Node.Id.MultilineStringLiteral },	3065	.base = ast.Node{ .id = ast.Node.Id.MultilineStringLiteral },
3066	.lines = ast.Node.MultilineStringLiteral.LineList.init(arena),	3066	.lines = ast.Node.MultilineStringLiteral.LineList.init(arena),
3067	});	3067	});
...	@@ -3089,7 +3089,7 @@ fn parseStringLiteral(arena: mem.Allocator, tok_it: ast.Tree.TokenList.Iterato	...	@@ -3089,7 +3089,7 @@ fn parseStringLiteral(arena: mem.Allocator, tok_it: ast.Tree.TokenList.Iterato
3089	fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: const OptionalCtx, token_ptr: const Token, token_index: TokenIndex) !bool {	3089	fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: const OptionalCtx, token_ptr: const Token, token_index: TokenIndex) !bool {
3090	switch (token_ptr.id) {	3090	switch (token_ptr.id) {
3091	Token.Id.Keyword_suspend => {	3091	Token.Id.Keyword_suspend => {
3092	const node = try arena.construct(ast.Node.Suspend{	3092	const node = try arena.create(ast.Node.Suspend{
3093	.base = ast.Node{ .id = ast.Node.Id.Suspend },	3093	.base = ast.Node{ .id = ast.Node.Id.Suspend },
3094	.label = null,	3094	.label = null,
3095	.suspend_token = token_index,	3095	.suspend_token = token_index,
...	@@ -3103,7 +3103,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con	...	@@ -3103,7 +3103,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con
3103	return true;	3103	return true;
3104	},	3104	},
3105	Token.Id.Keyword_if => {	3105	Token.Id.Keyword_if => {
3106	const node = try arena.construct(ast.Node.If{	3106	const node = try arena.create(ast.Node.If{
3107	.base = ast.Node{ .id = ast.Node.Id.If },	3107	.base = ast.Node{ .id = ast.Node.Id.If },
3108	.if_token = token_index,	3108	.if_token = token_index,
3109	.condition = undefined,	3109	.condition = undefined,
...	@@ -3144,7 +3144,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con	...	@@ -3144,7 +3144,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con
3144	return true;	3144	return true;
3145	},	3145	},
3146	Token.Id.Keyword_switch => {	3146	Token.Id.Keyword_switch => {
3147	const node = try arena.construct(ast.Node.Switch{	3147	const node = try arena.create(ast.Node.Switch{
3148	.base = ast.Node{ .id = ast.Node.Id.Switch },	3148	.base = ast.Node{ .id = ast.Node.Id.Switch },
3149	.switch_token = token_index,	3149	.switch_token = token_index,
3150	.expr = undefined,	3150	.expr = undefined,
...	@@ -3166,7 +3166,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con	...	@@ -3166,7 +3166,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con
3166	return true;	3166	return true;
3167	},	3167	},
3168	Token.Id.Keyword_comptime => {	3168	Token.Id.Keyword_comptime => {
3169	const node = try arena.construct(ast.Node.Comptime{	3169	const node = try arena.create(ast.Node.Comptime{
3170	.base = ast.Node{ .id = ast.Node.Id.Comptime },	3170	.base = ast.Node{ .id = ast.Node.Id.Comptime },
3171	.comptime_token = token_index,	3171	.comptime_token = token_index,
3172	.expr = undefined,	3172	.expr = undefined,
...	@@ -3178,7 +3178,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con	...	@@ -3178,7 +3178,7 @@ fn parseBlockExpr(stack: std.ArrayList(State), arena: mem.Allocator, ctx: *con
3178	return true;	3178	return true;
3179	},	3179	},
3180	Token.Id.LBrace => {	3180	Token.Id.LBrace => {
3181	const block = try arena.construct(ast.Node.Block{	3181	const block = try arena.create(ast.Node.Block{
3182	.base = ast.Node{ .id = ast.Node.Id.Block },	3182	.base = ast.Node{ .id = ast.Node.Id.Block },
3183	.label = null,	3183	.label = null,
3184	.lbrace = token_index,	3184	.lbrace = token_index,
...	@@ -3318,7 +3318,7 @@ fn tokenIdToPrefixOp(id: @TagType(Token.Id)) ?ast.Node.PrefixOp.Op {	...	@@ -3318,7 +3318,7 @@ fn tokenIdToPrefixOp(id: @TagType(Token.Id)) ?ast.Node.PrefixOp.Op {
3318	}	3318	}
3319		3319
3320	fn createLiteral(arena: mem.Allocator, comptime T: type, token_index: TokenIndex) !T {	3320	fn createLiteral(arena: mem.Allocator, comptime T: type, token_index: TokenIndex) !T {
3321	return arena.construct(T{	3321	return arena.create(T{
3322	.base = ast.Node{ .id = ast.Node.typeToId(T) },	3322	.base = ast.Node{ .id = ast.Node.typeToId(T) },
3323	.token = token_index,	3323	.token = token_index,
3324	});	3324	});

test/cases/null.zig+1-1

...	@@ -146,7 +146,7 @@ test "null with default unwrap" {	...	@@ -146,7 +146,7 @@ test "null with default unwrap" {
146		146
147	test "optional types" {	147	test "optional types" {
148	comptime {	148	comptime {
149	const opt_type_struct = StructWithOptionalType { .t=u8, };	149	const opt_type_struct = StructWithOptionalType{ .t = u8 };
150	assert(opt_type_struct.t != null and opt_type_struct.t.? == u8);	150	assert(opt_type_struct.t != null and opt_type_struct.t.? == u8);
151	}	151	}
152	}	152	}

test/tests.zig+37-45

 @@ -48,13 +48,12 @@ const test_targets = []TestTarget{
 const max_stdout_size = 1 * 1024 * 1024; // 1 MB
 pub fn addCompareOutputTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(CompareOutputContext) catch unreachable;
+    const cases = b.allocator.create(CompareOutputContext{
-    cases.* = CompareOutputContext{
         .b = b,
         .step = b.step("test-compare-output", "Run the compare output tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     compare_output.addCases(cases);
 @@ -62,13 +61,12 @@ pub fn addCompareOutputTests(b: *build.Builder, test_filter: ?[]const u8) *build
 }
 pub fn addRuntimeSafetyTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(CompareOutputContext) catch unreachable;
+    const cases = b.allocator.create(CompareOutputContext{
-    cases.* = CompareOutputContext{
         .b = b,
         .step = b.step("test-runtime-safety", "Run the runtime safety tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     runtime_safety.addCases(cases);
 @@ -76,13 +74,12 @@ pub fn addRuntimeSafetyTests(b: *build.Builder, test_filter: ?[]const u8) *build
 }
 pub fn addCompileErrorTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(CompileErrorContext) catch unreachable;
+    const cases = b.allocator.create(CompileErrorContext{
-    cases.* = CompileErrorContext{
         .b = b,
         .step = b.step("test-compile-errors", "Run the compile error tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     compile_errors.addCases(cases);
 @@ -90,13 +87,12 @@ pub fn addCompileErrorTests(b: *build.Builder, test_filter: ?[]const u8) *build.
 }
 pub fn addBuildExampleTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(BuildExamplesContext) catch unreachable;
+    const cases = b.allocator.create(BuildExamplesContext{
-    cases.* = BuildExamplesContext{
         .b = b,
         .step = b.step("test-build-examples", "Build the examples"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     build_examples.addCases(cases);
 @@ -104,13 +100,12 @@ pub fn addBuildExampleTests(b: *build.Builder, test_filter: ?[]const u8) *build.
 }
 pub fn addAssembleAndLinkTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(CompareOutputContext) catch unreachable;
+    const cases = b.allocator.create(CompareOutputContext{
-    cases.* = CompareOutputContext{
         .b = b,
         .step = b.step("test-asm-link", "Run the assemble and link tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     assemble_and_link.addCases(cases);
 @@ -118,13 +113,12 @@ pub fn addAssembleAndLinkTests(b: *build.Builder, test_filter: ?[]const u8) *bui
 }
 pub fn addTranslateCTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(TranslateCContext) catch unreachable;
+    const cases = b.allocator.create(TranslateCContext{
-    cases.* = TranslateCContext{
         .b = b,
         .step = b.step("test-translate-c", "Run the C transation tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     translate_c.addCases(cases);
 @@ -132,13 +126,12 @@ pub fn addTranslateCTests(b: *build.Builder, test_filter: ?[]const u8) *build.St
 }
 pub fn addGenHTests(b: *build.Builder, test_filter: ?[]const u8) *build.Step {
-    const cases = b.allocator.create(GenHContext) catch unreachable;
+    const cases = b.allocator.create(GenHContext{
-    cases.* = GenHContext{
         .b = b,
         .step = b.step("test-gen-h", "Run the C header file generation tests"),
         .test_index = 0,
         .test_filter = test_filter,
-    };
+    }) catch unreachable;
     gen_h.addCases(cases);
 @@ -240,8 +233,7 @@ pub const CompareOutputContext = struct {
         pub fn create(context: *CompareOutputContext, exe_path: []const u8, name: []const u8, expected_output: []const u8, cli_args: []const []const u8) *RunCompareOutputStep {
             const allocator = context.b.allocator;
-            const ptr = allocator.create(RunCompareOutputStep) catch unreachable;
+            const ptr = allocator.create(RunCompareOutputStep{
-            ptr.* = RunCompareOutputStep{
                 .context = context,
                 .exe_path = exe_path,
                 .name = name,
 @@ -249,7 +241,7 @@ pub const CompareOutputContext = struct {
                 .test_index = context.test_index,
                 .step = build.Step.init("RunCompareOutput", allocator, make),
                 .cli_args = cli_args,
-            };
+            }) catch unreachable;
             context.test_index += 1;
             return ptr;
         }
 @@ -328,14 +320,14 @@ pub const CompareOutputContext = struct {
         pub fn create(context: *CompareOutputContext, exe_path: []const u8, name: []const u8) *RuntimeSafetyRunStep {
             const allocator = context.b.allocator;
-            const ptr = allocator.create(RuntimeSafetyRunStep) catch unreachable;
+            const ptr = allocator.create(RuntimeSafetyRunStep{
-            ptr.* = RuntimeSafetyRunStep{
                 .context = context,
                 .exe_path = exe_path,
                 .name = name,
                 .test_index = context.test_index,
                 .step = build.Step.init("RuntimeSafetyRun", allocator, make),
-            };
+            }) catch unreachable;
             context.test_index += 1;
             return ptr;
         }
 @@ -543,15 +535,15 @@ pub const CompileErrorContext = struct {
         pub fn create(context: *CompileErrorContext, name: []const u8, case: *const TestCase, build_mode: Mode) *CompileCmpOutputStep {
             const allocator = context.b.allocator;
-            const ptr = allocator.create(CompileCmpOutputStep) catch unreachable;
+            const ptr = allocator.create(CompileCmpOutputStep{
-            ptr.* = CompileCmpOutputStep{
                 .step = build.Step.init("CompileCmpOutput", allocator, make),
                 .context = context,
                 .name = name,
                 .test_index = context.test_index,
                 .case = case,
                 .build_mode = build_mode,
-            };
+            }) catch unreachable;
             context.test_index += 1;
             return ptr;
         }
 @@ -662,14 +654,14 @@ pub const CompileErrorContext = struct {
     }
     pub fn create(self: *CompileErrorContext, name: []const u8, source: []const u8, expected_lines: ...) *TestCase {
-        const tc = self.b.allocator.create(TestCase) catch unreachable;
+        const tc = self.b.allocator.create(TestCase{
-        tc.* = TestCase{
             .name = name,
             .sources = ArrayList(TestCase.SourceFile).init(self.b.allocator),
             .expected_errors = ArrayList([]const u8).init(self.b.allocator),
             .link_libc = false,
             .is_exe = false,
-        };
+        }) catch unreachable;
         tc.addSourceFile(".tmp_source.zig", source);
         comptime var arg_i = 0;
         inline while (arg_i < expected_lines.len) : (arg_i += 1) {
 @@ -829,14 +821,14 @@ pub const TranslateCContext = struct {
         pub fn create(context: *TranslateCContext, name: []const u8, case: *const TestCase) *TranslateCCmpOutputStep {
             const allocator = context.b.allocator;
-            const ptr = allocator.create(TranslateCCmpOutputStep) catch unreachable;
+            const ptr = allocator.create(TranslateCCmpOutputStep{
-            ptr.* = TranslateCCmpOutputStep{
                 .step = build.Step.init("ParseCCmpOutput", allocator, make),
                 .context = context,
                 .name = name,
                 .test_index = context.test_index,
                 .case = case,
-            };
+            }) catch unreachable;
             context.test_index += 1;
             return ptr;
         }
 @@ -936,13 +928,13 @@ pub const TranslateCContext = struct {
     }
     pub fn create(self: *TranslateCContext, allow_warnings: bool, filename: []const u8, name: []const u8, source: []const u8, expected_lines: ...) *TestCase {
-        const tc = self.b.allocator.create(TestCase) catch unreachable;
+        const tc = self.b.allocator.create(TestCase{
-        tc.* = TestCase{
             .name = name,
             .sources = ArrayList(TestCase.SourceFile).init(self.b.allocator),
             .expected_lines = ArrayList([]const u8).init(self.b.allocator),
             .allow_warnings = allow_warnings,
-        };
+        }) catch unreachable;
         tc.addSourceFile(filename, source);
         comptime var arg_i = 0;
         inline while (arg_i < expected_lines.len) : (arg_i += 1) {
 @@ -1023,15 +1015,15 @@ pub const GenHContext = struct {
         pub fn create(context: *GenHContext, h_path: []const u8, name: []const u8, case: *const TestCase) *GenHCmpOutputStep {
             const allocator = context.b.allocator;
-            const ptr = allocator.create(GenHCmpOutputStep) catch unreachable;
+            const ptr = allocator.create(GenHCmpOutputStep{
-            ptr.* = GenHCmpOutputStep{
                 .step = build.Step.init("ParseCCmpOutput", allocator, make),
                 .context = context,
                 .h_path = h_path,
                 .name = name,
                 .test_index = context.test_index,
                 .case = case,
-            };
+            }) catch unreachable;
             context.test_index += 1;
             return ptr;
         }
 @@ -1070,12 +1062,12 @@ pub const GenHContext = struct {
     }
     pub fn create(self: *GenHContext, filename: []const u8, name: []const u8, source: []const u8, expected_lines: ...) *TestCase {
-        const tc = self.b.allocator.create(TestCase) catch unreachable;
+        const tc = self.b.allocator.create(TestCase{
-        tc.* = TestCase{
             .name = name,
             .sources = ArrayList(TestCase.SourceFile).init(self.b.allocator),
             .expected_lines = ArrayList([]const u8).init(self.b.allocator),
-        };
+        }) catch unreachable;
         tc.addSourceFile(filename, source);
         comptime var arg_i = 0;
         inline while (arg_i < expected_lines.len) : (arg_i += 1) {