authorgravatar for hixuyuming@gmail.comhixuyuming <hixuyuming@gmail.com> 2026-05-01 17:04:01+08:00
committergravatar for andrew@ziglang.orgAndrew Kelley <andrew@ziglang.org> 2026-10-17 19:29:37+02:00
log093d28dfae39a64ef315c334e70ab3b72a698bb7
tree0ff27fcc70332abcb591d796aa5a6aa6afa573bd
parentd924f83bf3e1a5726d9eca1e9d501aece08107c5

Remove deprecated aliases of ArrayList and update usage sites.

11 files changed, 38 insertions(+), 44 deletions(-)

build.zig+4-4
...@@ -1119,11 +1119,11 @@ fn addCxxKnownPath(...@@ -1119,11 +1119,11 @@ fn addCxxKnownPath(
1119 const arena = b.graph.arena;1119 const arena = b.graph.arena;
11201120
1121 const path_padded = run: {1121 const path_padded = run: {
1122 var args = std.array_list.Managed([]const u8).init(arena);1122 var args: std.ArrayList([]const u8) = .empty;
1123 try args.append(ctx.cxx_compiler);1123 try args.append(arena, ctx.cxx_compiler);
1124 var it = std.mem.tokenizeAny(u8, ctx.cxx_compiler_arg1, &std.ascii.whitespace);1124 var it = std.mem.tokenizeAny(u8, ctx.cxx_compiler_arg1, &std.ascii.whitespace);
1125 while (it.next()) |arg| try args.append(arg);1125 while (it.next()) |arg| try args.append(arena, arg);
1126 try args.append(b.fmt("-print-file-name={s}", .{objname}));1126 try args.append(arena, b.fmt("-print-file-name={s}", .{objname}));
1127 break :run b.run(args.items);1127 break :run b.run(args.items);
1128 };1128 };
1129 var tokenizer = mem.tokenizeAny(u8, path_padded, "\r\n");1129 var tokenizer = mem.tokenizeAny(u8, path_padded, "\r\n");
lib/build-web/fuzz.zig+1-1
...@@ -46,7 +46,7 @@ var coverage = Coverage.init;...@@ -46,7 +46,7 @@ var coverage = Coverage.init;
46/// Index of type `SourceLocationIndex`.46/// Index of type `SourceLocationIndex`.
47var coverage_source_locations: std.ArrayList(Coverage.SourceLocation) = .empty;47var coverage_source_locations: std.ArrayList(Coverage.SourceLocation) = .empty;
48/// Contains the most recent coverage update message, unmodified.48/// Contains the most recent coverage update message, unmodified.
49var recent_coverage_update: std.ArrayListAlignedUnmanaged(u8, .of(u64)) = .empty;49var recent_coverage_update: std.array_list.Aligned(u8, .of(u64)) = .empty;
5050
51fn updateCoverageSources(51fn updateCoverageSources(
52 directories: []const Coverage.String,52 directories: []const Coverage.String,
lib/build-web/main.zig+1-1
...@@ -68,7 +68,7 @@ export fn alloc(n: usize) [*]u8 {...@@ -68,7 +68,7 @@ export fn alloc(n: usize) [*]u8 {
68 return slice.ptr;68 return slice.ptr;
69}69}
7070
71var message_buffer: std.ArrayListAlignedUnmanaged(u8, .of(u64)) = .empty;71var message_buffer: std.array_list.Aligned(u8, .of(u64)) = .empty;
7272
73/// Resizes the message buffer to be the correct length; returns the pointer to73/// Resizes the message buffer to be the correct length; returns the pointer to
74/// the query string.74/// the query string.
lib/compiler/aro/aro/Preprocessor.zig+1-1
...@@ -2699,7 +2699,7 @@ const PragmaLoc = struct { name_tok: TokenWithExpansionLocs, start: Tree.TokenIn...@@ -2699,7 +2699,7 @@ const PragmaLoc = struct { name_tok: TokenWithExpansionLocs, start: Tree.TokenIn
26992699
2700fn addTokensFromExpandBuf(pp: *Preprocessor, tokens: []const TokenWithExpansionLocs, tokenizer_nl: TokenWithExpansionLocs) !void {2700fn addTokensFromExpandBuf(pp: *Preprocessor, tokens: []const TokenWithExpansionLocs, tokenizer_nl: TokenWithExpansionLocs) !void {
2701 const gpa = pp.comp.gpa;2701 const gpa = pp.comp.gpa;
2702 var pragma_locs: std.ArrayListUnmanaged(PragmaLoc) = .empty;2702 var pragma_locs: std.ArrayList(PragmaLoc) = .empty;
2703 defer pragma_locs.deinit(gpa);2703 defer pragma_locs.deinit(gpa);
27042704
2705 try pp.ensureUnusedTokenCapacity(tokens.len);2705 try pp.ensureUnusedTokenCapacity(tokens.len);
lib/compiler/reduce.zig+4-4
...@@ -153,9 +153,9 @@ pub fn main(init: std.process.Init) !void {...@@ -153,9 +153,9 @@ pub fn main(init: std.process.Init) !void {
153 // result, restart the whole process, reparsing the AST and re-generating the list153 // result, restart the whole process, reparsing the AST and re-generating the list
154 // of all possible transformations and shuffling it again.154 // of all possible transformations and shuffling it again.
155155
156 var transformations = std.array_list.Managed(Walk.Transformation).init(gpa);156 var transformations: std.ArrayList(Walk.Transformation) = .empty;
157 defer transformations.deinit();157 defer transformations.deinit(gpa);
158 try Walk.findTransformations(arena, &tree, &transformations);158 try Walk.findTransformations(arena, gpa, &tree, &transformations);
159 sortTransformations(transformations.items, rng.random());159 sortTransformations(transformations.items, rng.random());
160160
161 fresh: while (transformations.items.len > 0) {161 fresh: while (transformations.items.len > 0) {
...@@ -238,7 +238,7 @@ pub fn main(init: std.process.Init) !void {...@@ -238,7 +238,7 @@ pub fn main(init: std.process.Init) !void {
238 tree.deinit(gpa);238 tree.deinit(gpa);
239 tree = new_tree;239 tree = new_tree;
240240
241 try Walk.findTransformations(arena, &tree, &transformations);241 try Walk.findTransformations(arena, gpa, &tree, &transformations);
242 sortTransformations(transformations.items, rng.random());242 sortTransformations(transformations.items, rng.random());
243243
244 continue :fresh;244 continue :fresh;
lib/compiler/reduce/Walk.zig+22-21
...@@ -5,7 +5,7 @@ const assert = std.debug.assert;...@@ -5,7 +5,7 @@ const assert = std.debug.assert;
5const BuiltinFn = std.zig.BuiltinFn;5const BuiltinFn = std.zig.BuiltinFn;
66
7ast: *const Ast,7ast: *const Ast,
8transformations: *std.array_list.Managed(Transformation),8transformations: *std.ArrayList(Transformation),
9unreferenced_globals: std.array_hash_map.String(Ast.Node.Index),9unreferenced_globals: std.array_hash_map.String(Ast.Node.Index),
10in_scope_names: std.array_hash_map.String(u32),10in_scope_names: std.array_hash_map.String(u32),
11replace_names: std.array_hash_map.String(u32),11replace_names: std.array_hash_map.String(u32),
...@@ -53,15 +53,16 @@ pub const Error = error{OutOfMemory};...@@ -53,15 +53,16 @@ pub const Error = error{OutOfMemory};
53/// The result will be priority shuffled.53/// The result will be priority shuffled.
54pub fn findTransformations(54pub fn findTransformations(
55 arena: std.mem.Allocator,55 arena: std.mem.Allocator,
56 gpa: std.mem.Allocator,
56 ast: *const Ast,57 ast: *const Ast,
57 transformations: *std.array_list.Managed(Transformation),58 transformations: *std.ArrayList(Transformation),
58) !void {59) !void {
59 transformations.clearRetainingCapacity();60 transformations.clearRetainingCapacity();
6061
61 var walk: Walk = .{62 var walk: Walk = .{
62 .ast = ast,63 .ast = ast,
63 .transformations = transformations,64 .transformations = transformations,
64 .gpa = transformations.allocator,65 .gpa = gpa,
65 .arena = arena,66 .arena = arena,
66 .unreferenced_globals = .empty,67 .unreferenced_globals = .empty,
67 .in_scope_names = .empty,68 .in_scope_names = .empty,
...@@ -76,7 +77,7 @@ pub fn findTransformations(...@@ -76,7 +77,7 @@ pub fn findTransformations(
76 try walkMembers(&walk, walk.ast.rootDecls());77 try walkMembers(&walk, walk.ast.rootDecls());
7778
78 const unreferenced_globals = walk.unreferenced_globals.values();79 const unreferenced_globals = walk.unreferenced_globals.values();
79 try transformations.ensureUnusedCapacity(unreferenced_globals.len);80 try transformations.ensureUnusedCapacity(gpa, unreferenced_globals.len);
80 for (unreferenced_globals) |node| {81 for (unreferenced_globals) |node| {
81 transformations.appendAssumeCapacity(.{ .delete_node = node });82 transformations.appendAssumeCapacity(.{ .delete_node = node });
82 }83 }
...@@ -148,7 +149,7 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {...@@ -148,7 +149,7 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {
148 try walkExpression(w, fn_proto);149 try walkExpression(w, fn_proto);
149 if (!isFnBodyGutted(ast, body_node)) {150 if (!isFnBodyGutted(ast, body_node)) {
150 w.replace_names.clearRetainingCapacity();151 w.replace_names.clearRetainingCapacity();
151 try w.transformations.append(.{ .gut_function = decl });152 try w.transformations.append(w.gpa, .{ .gut_function = decl });
152 try walkExpression(w, body_node);153 try walkExpression(w, body_node);
153 }154 }
154 },155 },
...@@ -167,7 +168,7 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {...@@ -167,7 +168,7 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {
167 => try walkGlobalVarDecl(w, decl, ast.fullVarDecl(decl).?),168 => try walkGlobalVarDecl(w, decl, ast.fullVarDecl(decl).?),
168169
169 .test_decl => {170 .test_decl => {
170 try w.transformations.append(.{ .delete_node = decl });171 try w.transformations.append(w.gpa, .{ .delete_node = decl });
171 try walkExpression(w, ast.nodeData(decl).opt_token_and_node[1]);172 try walkExpression(w, ast.nodeData(decl).opt_token_and_node[1]);
172 },173 },
173174
...@@ -175,12 +176,12 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {...@@ -175,12 +176,12 @@ fn walkMember(w: *Walk, decl: Ast.Node.Index) Error!void {
175 .container_field_align,176 .container_field_align,
176 .container_field,177 .container_field,
177 => {178 => {
178 try w.transformations.append(.{ .delete_node = decl });179 try w.transformations.append(w.gpa, .{ .delete_node = decl });
179 try walkContainerField(w, ast.fullContainerField(decl).?);180 try walkContainerField(w, ast.fullContainerField(decl).?);
180 },181 },
181182
182 .@"comptime" => {183 .@"comptime" => {
183 try w.transformations.append(.{ .delete_node = decl });184 try w.transformations.append(w.gpa, .{ .delete_node = decl });
184 try walkExpression(w, decl);185 try walkExpression(w, decl);
185 },186 },
186187
...@@ -536,7 +537,7 @@ fn walkGlobalVarDecl(w: *Walk, decl_node: Ast.Node.Index, var_decl: Ast.full.Var...@@ -536,7 +537,7 @@ fn walkGlobalVarDecl(w: *Walk, decl_node: Ast.Node.Index, var_decl: Ast.full.Var
536537
537 if (var_decl.ast.init_node.unwrap()) |init_node| {538 if (var_decl.ast.init_node.unwrap()) |init_node| {
538 if (!isUndefinedIdent(w.ast, init_node)) {539 if (!isUndefinedIdent(w.ast, init_node)) {
539 try w.transformations.append(.{ .replace_with_undef = init_node });540 try w.transformations.append(w.gpa, .{ .replace_with_undef = init_node });
540 }541 }
541 try walkExpression(w, init_node);542 try walkExpression(w, init_node);
542 }543 }
...@@ -563,7 +564,7 @@ fn walkLocalVarDecl(w: *Walk, var_decl: Ast.full.VarDecl) Error!void {...@@ -563,7 +564,7 @@ fn walkLocalVarDecl(w: *Walk, var_decl: Ast.full.VarDecl) Error!void {
563564
564 if (var_decl.ast.init_node.unwrap()) |init_node| {565 if (var_decl.ast.init_node.unwrap()) |init_node| {
565 if (!isUndefinedIdent(w.ast, init_node)) {566 if (!isUndefinedIdent(w.ast, init_node)) {
566 try w.transformations.append(.{ .replace_with_undef = init_node });567 try w.transformations.append(w.gpa, .{ .replace_with_undef = init_node });
567 }568 }
568 try walkExpression(w, init_node);569 try walkExpression(w, init_node);
569 }570 }
...@@ -600,7 +601,7 @@ fn walkBlock(...@@ -600,7 +601,7 @@ fn walkBlock(
600 if (var_decl.ast.init_node != .none and601 if (var_decl.ast.init_node != .none and
601 isUndefinedIdent(w.ast, var_decl.ast.init_node.unwrap().?))602 isUndefinedIdent(w.ast, var_decl.ast.init_node.unwrap().?))
602 {603 {
603 try w.transformations.append(.{ .delete_var_decl = .{604 try w.transformations.append(w.gpa, .{ .delete_var_decl = .{
604 .var_decl_node = stmt,605 .var_decl_node = stmt,
605 .references = .empty,606 .references = .empty,
606 } });607 } });
...@@ -618,7 +619,7 @@ fn walkBlock(...@@ -618,7 +619,7 @@ fn walkBlock(
618 .discard_identifier => {},619 .discard_identifier => {},
619 // definitely try to remove `_ = undefined;` though.620 // definitely try to remove `_ = undefined;` though.
620 .discard_undefined, .trap_call, .other => {621 .discard_undefined, .trap_call, .other => {
621 try w.transformations.append(.{ .delete_node = stmt });622 try w.transformations.append(w.gpa, .{ .delete_node = stmt });
622 },623 },
623 }624 }
624 try walkExpression(w, stmt);625 try walkExpression(w, stmt);
...@@ -720,7 +721,7 @@ fn walkBuiltinCall(...@@ -720,7 +721,7 @@ fn walkBuiltinCall(
720 if (std.mem.endsWith(u8, token_bytes, ".zig\"")) {721 if (std.mem.endsWith(u8, token_bytes, ".zig\"")) {
721 const imported_string = std.zig.string_literal.parseAlloc(w.arena, token_bytes) catch722 const imported_string = std.zig.string_literal.parseAlloc(w.arena, token_bytes) catch
722 unreachable;723 unreachable;
723 try w.transformations.append(.{ .inline_imported_file = .{724 try w.transformations.append(w.gpa, .{ .inline_imported_file = .{
724 .builtin_call_node = call_node,725 .builtin_call_node = call_node,
725 .imported_string = imported_string,726 .imported_string = imported_string,
726 .in_scope_names = try std.array_hash_map.String(void).init(727 .in_scope_names = try std.array_hash_map.String(void).init(
...@@ -792,19 +793,19 @@ fn walkWhile(w: *Walk, node_index: Ast.Node.Index, while_node: Ast.full.While) E...@@ -792,19 +793,19 @@ fn walkWhile(w: *Walk, node_index: Ast.Node.Index, while_node: Ast.full.While) E
792 if (!isTrueIdent(w.ast, while_node.ast.cond_expr) and793 if (!isTrueIdent(w.ast, while_node.ast.cond_expr) and
793 (while_node.ast.else_expr == .none or isEmptyBlock(w.ast, while_node.ast.else_expr.unwrap().?)))794 (while_node.ast.else_expr == .none or isEmptyBlock(w.ast, while_node.ast.else_expr.unwrap().?)))
794 {795 {
795 try w.transformations.ensureUnusedCapacity(1);796 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
796 w.transformations.appendAssumeCapacity(.{ .replace_with_true = while_node.ast.cond_expr });797 w.transformations.appendAssumeCapacity(.{ .replace_with_true = while_node.ast.cond_expr });
797 } else if (!isFalseIdent(w.ast, while_node.ast.cond_expr) and isEmptyBlock(w.ast, while_node.ast.then_expr)) {798 } else if (!isFalseIdent(w.ast, while_node.ast.cond_expr) and isEmptyBlock(w.ast, while_node.ast.then_expr)) {
798 try w.transformations.ensureUnusedCapacity(1);799 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
799 w.transformations.appendAssumeCapacity(.{ .replace_with_false = while_node.ast.cond_expr });800 w.transformations.appendAssumeCapacity(.{ .replace_with_false = while_node.ast.cond_expr });
800 } else if (isTrueIdent(w.ast, while_node.ast.cond_expr)) {801 } else if (isTrueIdent(w.ast, while_node.ast.cond_expr)) {
801 try w.transformations.ensureUnusedCapacity(1);802 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
802 w.transformations.appendAssumeCapacity(.{ .replace_node = .{803 w.transformations.appendAssumeCapacity(.{ .replace_node = .{
803 .to_replace = node_index,804 .to_replace = node_index,
804 .replacement = while_node.ast.then_expr,805 .replacement = while_node.ast.then_expr,
805 } });806 } });
806 } else if (isFalseIdent(w.ast, while_node.ast.cond_expr)) {807 } else if (isFalseIdent(w.ast, while_node.ast.cond_expr)) {
807 try w.transformations.ensureUnusedCapacity(1);808 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
808 w.transformations.appendAssumeCapacity(.{ .replace_node = .{809 w.transformations.appendAssumeCapacity(.{ .replace_node = .{
809 .to_replace = node_index,810 .to_replace = node_index,
810 .replacement = while_node.ast.else_expr.unwrap().?,811 .replacement = while_node.ast.else_expr.unwrap().?,
...@@ -841,19 +842,19 @@ fn walkIf(w: *Walk, node_index: Ast.Node.Index, if_node: Ast.full.If) Error!void...@@ -841,19 +842,19 @@ fn walkIf(w: *Walk, node_index: Ast.Node.Index, if_node: Ast.full.If) Error!void
841 if (!isTrueIdent(w.ast, if_node.ast.cond_expr) and842 if (!isTrueIdent(w.ast, if_node.ast.cond_expr) and
842 (if_node.ast.else_expr == .none or isEmptyBlock(w.ast, if_node.ast.else_expr.unwrap().?)))843 (if_node.ast.else_expr == .none or isEmptyBlock(w.ast, if_node.ast.else_expr.unwrap().?)))
843 {844 {
844 try w.transformations.ensureUnusedCapacity(1);845 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
845 w.transformations.appendAssumeCapacity(.{ .replace_with_true = if_node.ast.cond_expr });846 w.transformations.appendAssumeCapacity(.{ .replace_with_true = if_node.ast.cond_expr });
846 } else if (!isFalseIdent(w.ast, if_node.ast.cond_expr) and isEmptyBlock(w.ast, if_node.ast.then_expr)) {847 } else if (!isFalseIdent(w.ast, if_node.ast.cond_expr) and isEmptyBlock(w.ast, if_node.ast.then_expr)) {
847 try w.transformations.ensureUnusedCapacity(1);848 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
848 w.transformations.appendAssumeCapacity(.{ .replace_with_false = if_node.ast.cond_expr });849 w.transformations.appendAssumeCapacity(.{ .replace_with_false = if_node.ast.cond_expr });
849 } else if (isTrueIdent(w.ast, if_node.ast.cond_expr)) {850 } else if (isTrueIdent(w.ast, if_node.ast.cond_expr)) {
850 try w.transformations.ensureUnusedCapacity(1);851 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
851 w.transformations.appendAssumeCapacity(.{ .replace_node = .{852 w.transformations.appendAssumeCapacity(.{ .replace_node = .{
852 .to_replace = node_index,853 .to_replace = node_index,
853 .replacement = if_node.ast.then_expr,854 .replacement = if_node.ast.then_expr,
854 } });855 } });
855 } else if (isFalseIdent(w.ast, if_node.ast.cond_expr)) {856 } else if (isFalseIdent(w.ast, if_node.ast.cond_expr)) {
856 try w.transformations.ensureUnusedCapacity(1);857 try w.transformations.ensureUnusedCapacity(w.gpa, 1);
857 w.transformations.appendAssumeCapacity(.{ .replace_node = .{858 w.transformations.appendAssumeCapacity(.{ .replace_node = .{
858 .to_replace = node_index,859 .to_replace = node_index,
859 .replacement = if_node.ast.else_expr.unwrap().?,860 .replacement = if_node.ast.else_expr.unwrap().?,
lib/docs/wasm/html_render.zig+1-1
...@@ -32,7 +32,7 @@ pub const Annotation = struct {...@@ -32,7 +32,7 @@ pub const Annotation = struct {
3232
33pub fn fileSourceLineNumbersHtml(33pub fn fileSourceLineNumbersHtml(
34 file_index: Walk.File.Index,34 file_index: Walk.File.Index,
35 out: *std.ArrayListUnmanaged(u8),35 out: *std.ArrayList(u8),
36 root_node: Ast.Node.Index,36 root_node: Ast.Node.Index,
37) !void {37) !void {
38 const ast = file_index.get_ast();38 const ast = file_index.get_ast();
lib/std/crypto/argon2.zig+2-2
...@@ -12,7 +12,7 @@ const mem = std.mem;...@@ -12,7 +12,7 @@ const mem = std.mem;
12const phc_format = pwhash.phc_format;12const phc_format = pwhash.phc_format;
13const pwhash = crypto.pwhash;13const pwhash = crypto.pwhash;
14const Blake2b512 = blake2.Blake2b512;14const Blake2b512 = blake2.Blake2b512;
15const Blocks = std.array_list.AlignedManaged([block_length]u64, .@"16");15const Blocks = std.array_list.Aligned([block_length]u64, .@"16");
16const H0 = [Blake2b512.digest_length + 8]u8;16const H0 = [Blake2b512.digest_length + 8]u8;
1717
18const EncodingError = crypto.errors.EncodingError;18const EncodingError = crypto.errors.EncodingError;
...@@ -504,7 +504,7 @@ pub fn kdf(...@@ -504,7 +504,7 @@ pub fn kdf(
504 const memory = blockCount(params);504 const memory = blockCount(params);
505505
506 var blocks = try Blocks.initCapacity(allocator, memory);506 var blocks = try Blocks.initCapacity(allocator, memory);
507 defer blocks.deinit();507 defer blocks.deinit(allocator);
508508
509 const items = blocks.addManyAsSliceAssumeCapacity(memory);509 const items = blocks.addManyAsSliceAssumeCapacity(memory);
510510
lib/std/std.zig-7
...@@ -54,13 +54,6 @@ pub fn ArrayList(comptime T: type) type {...@@ -54,13 +54,6 @@ pub fn ArrayList(comptime T: type) type {
54}54}
55pub const array_list = @import("array_list.zig");55pub const array_list = @import("array_list.zig");
5656
57/// Deprecated; use `array_list.Aligned`.
58pub const ArrayListAligned = array_list.Aligned;
59/// Deprecated; use `array_list.Aligned`.
60pub const ArrayListAlignedUnmanaged = array_list.Aligned;
61/// Deprecated; use `ArrayList`.
62pub const ArrayListUnmanaged = ArrayList;
63
64pub const array_hash_map = @import("array_hash_map.zig");57pub const array_hash_map = @import("array_hash_map.zig");
65pub const atomic = @import("atomic.zig");58pub const atomic = @import("atomic.zig");
66pub const base64 = @import("base64.zig");59pub const base64 = @import("base64.zig");
src/codegen/spork8/CodeGen.zig+1-1
...@@ -21,7 +21,7 @@ owner_nav: InternPool.Nav.Index,...@@ -21,7 +21,7 @@ owner_nav: InternPool.Nav.Index,
21func_index: InternPool.Index,21func_index: InternPool.Index,
22mir_instructions: std.MultiArrayList(Mir.Inst),22mir_instructions: std.MultiArrayList(Mir.Inst),
23/// Contains extra data for MIR23/// Contains extra data for MIR
24mir_extra: std.ArrayListUnmanaged(u32),24mir_extra: std.ArrayList(u32),
2525
26pub fn legalizeFeatures(_: *const std.Target) *const Air.Legalize.Features {26pub fn legalizeFeatures(_: *const std.Target) *const Air.Legalize.Features {
27 return comptime &.initMany(&.{27 return comptime &.initMany(&.{
src/link/Spork8.zig+1-1
...@@ -24,7 +24,7 @@ base: link.File,...@@ -24,7 +24,7 @@ base: link.File,
24/// All MIR instructions for all Zcu functions.24/// All MIR instructions for all Zcu functions.
25mir_instructions: std.MultiArrayList(Mir.Inst) = .empty,25mir_instructions: std.MultiArrayList(Mir.Inst) = .empty,
26/// Corresponds to `mir_instructions`.26/// Corresponds to `mir_instructions`.
27mir_extra: std.ArrayListUnmanaged(u32) = .empty,27mir_extra: std.ArrayList(u32) = .empty,
28/// When the key is an enum type, this represents a `@tagName` function.28/// When the key is an enum type, this represents a `@tagName` function.
29zcu_funcs: std.array_hash_map.Auto(InternPool.Index, ZcuFunc) = .empty,29zcu_funcs: std.array_hash_map.Auto(InternPool.Index, ZcuFunc) = .empty,
3030