| author | |
| committer | |
| log | c91727108ec70019b0e1940e719bbf795ebf26c8 |
| tree | 0988752b6bca7192d63a5db7923d5fa93d5d9992 |
| parent | 37651eea8944e12df08328012dd3ff151b12c4e7 |
| signature |
18 files changed, 31 insertions(+), 31 deletions(-)
lib/compiler/Maker/Fuzz.zig+1-1| ... | @@ -273,7 +273,7 @@ pub fn serveSourcesTar(fuzz: *Fuzz, req: *std.http.Server.Request) !void { | ... | @@ -273,7 +273,7 @@ pub fn serveSourcesTar(fuzz: *Fuzz, req: *std.http.Server.Request) !void { |
| 273 | defer arena_state.deinit(); | 273 | defer arena_state.deinit(); |
| 274 | const arena = arena_state.allocator(); | 274 | const arena = arena_state.allocator(); |
| 275 | 275 | ||
| 276 | const DedupTable = std.ArrayHashMapUnmanaged(Build.Cache.Path, void, Build.Cache.Path.TableAdapter, false); | 276 | const DedupTable = std.array_hash_map.Custom(Build.Cache.Path, void, Build.Cache.Path.TableAdapter, false); |
| 277 | var dedup_table: DedupTable = .empty; | 277 | var dedup_table: DedupTable = .empty; |
| 278 | defer dedup_table.deinit(gpa); | 278 | defer dedup_table.deinit(gpa); |
| 279 | 279 |
lib/compiler/Maker/Step.zig+1-1| ... | @@ -180,7 +180,7 @@ pub const Inputs = struct { | ... | @@ -180,7 +180,7 @@ pub const Inputs = struct { |
| 180 | .table = .{}, | 180 | .table = .{}, |
| 181 | }; | 181 | }; |
| 182 | 182 | ||
| 183 | pub const Table = std.ArrayHashMapUnmanaged(Path, Files, Path.TableAdapter, false); | 183 | pub const Table = std.array_hash_map.Custom(Path, Files, Path.TableAdapter, false); |
| 184 | /// The special file name "." means any changes inside the directory. | 184 | /// The special file name "." means any changes inside the directory. |
| 185 | pub const Files = std.ArrayList([]const u8); | 185 | pub const Files = std.ArrayList([]const u8); |
| 186 | 186 |
lib/compiler/Maker/Step/Compile.zig+1-1| ... | @@ -121,7 +121,7 @@ fn updateGeneratedFile( | ... | @@ -121,7 +121,7 @@ fn updateGeneratedFile( |
| 121 | /// the root module. The root module is guaranteed to be first. | 121 | /// the root module. The root module is guaranteed to be first. |
| 122 | const ModuleList = std.array_hash_map.Auto(Configuration.Module.Index, Configuration.String); | 122 | const ModuleList = std.array_hash_map.Auto(Configuration.Module.Index, Configuration.String); |
| 123 | /// Keyed on the first key in the module list. | 123 | /// Keyed on the first key in the module list. |
| 124 | pub const ModuleGraph = std.ArrayHashMapUnmanaged(ModuleList, void, ModuleListContext, false); | 124 | pub const ModuleGraph = std.array_hash_map.Custom(ModuleList, void, ModuleListContext, false); |
| 125 | 125 | ||
| 126 | const ModuleListContext = struct { | 126 | const ModuleListContext = struct { |
| 127 | pub fn eql(ctx: @This(), a: ModuleList, b: ModuleList) bool { | 127 | pub fn eql(ctx: @This(), a: ModuleList, b: ModuleList) bool { |
lib/compiler/Maker/Watch.zig+3-3| ... | @@ -27,7 +27,7 @@ pub const have_impl = Os != void; | ... | @@ -27,7 +27,7 @@ pub const have_impl = Os != void; |
| 27 | /// interested in noticing changes to. | 27 | /// interested in noticing changes to. |
| 28 | /// | 28 | /// |
| 29 | /// Value is generation. | 29 | /// Value is generation. |
| 30 | const DirTable = std.ArrayHashMapUnmanaged(Cache.Path, void, Cache.Path.TableAdapter, false); | 30 | const DirTable = std.array_hash_map.Custom(Cache.Path, void, Cache.Path.TableAdapter, false); |
| 31 | 31 | ||
| 32 | /// Special key of "." means any changes in this directory trigger the steps. | 32 | /// Special key of "." means any changes in this directory trigger the steps. |
| 33 | const ReactionSet = std.array_hash_map.String(StepSet); | 33 | const ReactionSet = std.array_hash_map.String(StepSet); |
| ... | @@ -49,7 +49,7 @@ const Os = switch (builtin.os.tag) { | ... | @@ -49,7 +49,7 @@ const Os = switch (builtin.os.tag) { |
| 49 | poll_fds: std.array_hash_map.Auto(MountId, posix.pollfd), | 49 | poll_fds: std.array_hash_map.Auto(MountId, posix.pollfd), |
| 50 | 50 | ||
| 51 | const MountId = i32; | 51 | const MountId = i32; |
| 52 | const HandleTable = std.ArrayHashMapUnmanaged(FileHandle, struct { mount_id: MountId, reaction_set: ReactionSet }, FileHandle.Adapter, false); | 52 | const HandleTable = std.array_hash_map.Custom(FileHandle, struct { mount_id: MountId, reaction_set: ReactionSet }, FileHandle.Adapter, false); |
| 53 | 53 | ||
| 54 | const fan_mask: std.os.linux.fanotify.MarkMask = .{ | 54 | const fan_mask: std.os.linux.fanotify.MarkMask = .{ |
| 55 | .CLOSE_WRITE = true, | 55 | .CLOSE_WRITE = true, |
| ... | @@ -314,7 +314,7 @@ const Os = switch (builtin.os.tag) { | ... | @@ -314,7 +314,7 @@ const Os = switch (builtin.os.tag) { |
| 314 | const windows = std.os.windows; | 314 | const windows = std.os.windows; |
| 315 | 315 | ||
| 316 | /// Keyed differently but indexes correspond 1:1 with `dir_table`. | 316 | /// Keyed differently but indexes correspond 1:1 with `dir_table`. |
| 317 | handle_table: std.ArrayHashMapUnmanaged(*Directory, void, Directory.TableAdapter, false), | 317 | handle_table: std.array_hash_map.Custom(*Directory, void, Directory.TableAdapter, false), |
| 318 | ready_dirs: std.DoublyLinkedList, | 318 | ready_dirs: std.DoublyLinkedList, |
| 319 | 319 | ||
| 320 | const FileId = struct { | 320 | const FileId = struct { |
lib/compiler/resinator/cvtres.zig+3-3| ... | @@ -439,8 +439,8 @@ pub const ResourceDataEntry = extern struct { | ... | @@ -439,8 +439,8 @@ pub const ResourceDataEntry = extern struct { |
| 439 | 439 | ||
| 440 | /// type -> name -> language | 440 | /// type -> name -> language |
| 441 | const ResourceTree = struct { | 441 | const ResourceTree = struct { |
| 442 | type_to_name_map: std.ArrayHashMapUnmanaged(NameOrOrdinal, NameToLanguageMap, NameOrOrdinalHashContext, true), | 442 | type_to_name_map: std.array_hash_map.Custom(NameOrOrdinal, NameToLanguageMap, NameOrOrdinalHashContext, true), |
| 443 | rsrc_string_table: std.ArrayHashMapUnmanaged(NameOrOrdinal, void, NameOrOrdinalHashContext, true), | 443 | rsrc_string_table: std.array_hash_map.Custom(NameOrOrdinal, void, NameOrOrdinalHashContext, true), |
| 444 | deduplicated_data: std.array_hash_map.String(u32), | 444 | deduplicated_data: std.array_hash_map.String(u32), |
| 445 | data_offsets: std.ArrayList(u32), | 445 | data_offsets: std.ArrayList(u32), |
| 446 | rsrc02_len: u32, | 446 | rsrc02_len: u32, |
| ... | @@ -452,7 +452,7 @@ const ResourceTree = struct { | ... | @@ -452,7 +452,7 @@ const ResourceTree = struct { |
| 452 | original_index: usize, | 452 | original_index: usize, |
| 453 | }; | 453 | }; |
| 454 | const LanguageToResourceMap = std.array_hash_map.Auto(Language, RelocatableResource); | 454 | const LanguageToResourceMap = std.array_hash_map.Auto(Language, RelocatableResource); |
| 455 | const NameToLanguageMap = std.ArrayHashMapUnmanaged(NameOrOrdinal, LanguageToResourceMap, NameOrOrdinalHashContext, true); | 455 | const NameToLanguageMap = std.array_hash_map.Custom(NameOrOrdinal, LanguageToResourceMap, NameOrOrdinalHashContext, true); |
| 456 | 456 | ||
| 457 | const NameOrOrdinalHashContext = struct { | 457 | const NameOrOrdinalHashContext = struct { |
| 458 | pub fn hash(self: @This(), v: NameOrOrdinal) u32 { | 458 | pub fn hash(self: @This(), v: NameOrOrdinal) u32 { |
lib/compiler/translate-c/Scope.zig+1-1| ... | @@ -18,7 +18,7 @@ pub const ContainerMemberFns = struct { | ... | @@ -18,7 +18,7 @@ pub const ContainerMemberFns = struct { |
| 18 | container_decl_ptr: *ast.Node, | 18 | container_decl_ptr: *ast.Node, |
| 19 | member_fns: std.ArrayList(*ast.Payload.Func) = .empty, | 19 | member_fns: std.ArrayList(*ast.Payload.Func) = .empty, |
| 20 | }; | 20 | }; |
| 21 | pub const ContainerMemberFnsHashMap = std.ArrayHashMapUnmanaged( | 21 | pub const ContainerMemberFnsHashMap = std.array_hash_map.Custom( |
| 22 | aro.QualType, | 22 | aro.QualType, |
| 23 | ContainerMemberFns, | 23 | ContainerMemberFns, |
| 24 | struct { | 24 | struct { |
lib/fuzzer.zig+3-3| ... | @@ -340,7 +340,7 @@ const Fuzzer = struct { | ... | @@ -340,7 +340,7 @@ const Fuzzer = struct { |
| 340 | quality_buf: []Input.Best, | 340 | quality_buf: []Input.Best, |
| 341 | input_buf: []Input.Best.Map, | 341 | input_buf: []Input.Best.Map, |
| 342 | }, | 342 | }, |
| 343 | seen_uids: std.ArrayHashMapUnmanaged(Uid, struct { | 343 | seen_uids: std.array_hash_map.Custom(Uid, struct { |
| 344 | slices: union { | 344 | slices: union { |
| 345 | ints: std.ArrayList([]u64), | 345 | ints: std.ArrayList([]u64), |
| 346 | bytes: std.ArrayList(Input.Data.Bytes), | 346 | bytes: std.ArrayList(Input.Data.Bytes), |
| ... | @@ -505,7 +505,7 @@ const Fuzzer = struct { | ... | @@ -505,7 +505,7 @@ const Fuzzer = struct { |
| 505 | } | 505 | } |
| 506 | }; | 506 | }; |
| 507 | 507 | ||
| 508 | pub const UidSlices = std.ArrayHashMapUnmanaged(Uid, struct { | 508 | pub const UidSlices = std.array_hash_map.Custom(Uid, struct { |
| 509 | base: u32, | 509 | base: u32, |
| 510 | len: u32, | 510 | len: u32, |
| 511 | }, Uid.hashmap_ctx, false); | 511 | }, Uid.hashmap_ctx, false); |
| ... | @@ -584,7 +584,7 @@ const Fuzzer = struct { | ... | @@ -584,7 +584,7 @@ const Fuzzer = struct { |
| 584 | }; | 584 | }; |
| 585 | 585 | ||
| 586 | pub const Builder = struct { | 586 | pub const Builder = struct { |
| 587 | uid_slices: std.ArrayHashMapUnmanaged(Uid, union { | 587 | uid_slices: std.array_hash_map.Custom(Uid, union { |
| 588 | ints: std.MultiArrayList(struct { | 588 | ints: std.MultiArrayList(struct { |
| 589 | value: u64, | 589 | value: u64, |
| 590 | order_i: u32, | 590 | order_i: u32, |
lib/std/Build/Cache.zig+1-1| ... | @@ -351,7 +351,7 @@ pub const Manifest = struct { | ... | @@ -351,7 +351,7 @@ pub const Manifest = struct { |
| 351 | }; | 351 | }; |
| 352 | }; | 352 | }; |
| 353 | 353 | ||
| 354 | pub const Files = std.ArrayHashMapUnmanaged(File, void, FilesContext, false); | 354 | pub const Files = std.array_hash_map.Custom(File, void, FilesContext, false); |
| 355 | 355 | ||
| 356 | pub const FilesContext = struct { | 356 | pub const FilesContext = struct { |
| 357 | pub fn hash(fc: FilesContext, file: File) u32 { | 357 | pub fn hash(fc: FilesContext, file: File) u32 { |
lib/std/debug/Coverage.zig+2-2| ... | @@ -15,13 +15,13 @@ const assert = std.debug.assert; | ... | @@ -15,13 +15,13 @@ const assert = std.debug.assert; |
| 15 | /// String memory references the memory-mapped debug information. | 15 | /// String memory references the memory-mapped debug information. |
| 16 | /// | 16 | /// |
| 17 | /// Protected by `mutex`. | 17 | /// Protected by `mutex`. |
| 18 | directories: std.ArrayHashMapUnmanaged(String, void, String.MapContext, false), | 18 | directories: std.array_hash_map.Custom(String, void, String.MapContext, false), |
| 19 | /// Provides a globally-scoped integer index for files. | 19 | /// Provides a globally-scoped integer index for files. |
| 20 | /// | 20 | /// |
| 21 | /// String memory references the memory-mapped debug information. | 21 | /// String memory references the memory-mapped debug information. |
| 22 | /// | 22 | /// |
| 23 | /// Protected by `mutex`. | 23 | /// Protected by `mutex`. |
| 24 | files: std.ArrayHashMapUnmanaged(File, void, File.MapContext, false), | 24 | files: std.array_hash_map.Custom(File, void, File.MapContext, false), |
| 25 | string_bytes: std.ArrayList(u8), | 25 | string_bytes: std.ArrayList(u8), |
| 26 | /// Protects the other fields. | 26 | /// Protects the other fields. |
| 27 | mutex: Io.Mutex, | 27 | mutex: Io.Mutex, |
lib/std/debug/MachOFile.zig+2-2| ... | @@ -305,7 +305,7 @@ const OFile = struct { | ... | @@ -305,7 +305,7 @@ const OFile = struct { |
| 305 | symtab_raw: []align(1) const macho.nlist_64, | 305 | symtab_raw: []align(1) const macho.nlist_64, |
| 306 | /// All named symbols in `symtab_raw`. Stored `u32` key is the index into `symtab_raw`. Accessed | 306 | /// All named symbols in `symtab_raw`. Stored `u32` key is the index into `symtab_raw`. Accessed |
| 307 | /// through `SymbolAdapter`, so that the symbol name is used as the logical key. | 307 | /// through `SymbolAdapter`, so that the symbol name is used as the logical key. |
| 308 | symbols_by_name: std.ArrayHashMapUnmanaged(u32, void, void, true), | 308 | symbols_by_name: std.array_hash_map.Custom(u32, void, void, true), |
| 309 | 309 | ||
| 310 | const SymbolAdapter = struct { | 310 | const SymbolAdapter = struct { |
| 311 | strtab: []const u8, | 311 | strtab: []const u8, |
| ... | @@ -476,7 +476,7 @@ fn loadOFile(gpa: Allocator, io: Io, o_file_name: []const u8) !OFile { | ... | @@ -476,7 +476,7 @@ fn loadOFile(gpa: Allocator, io: Io, o_file_name: []const u8) !OFile { |
| 476 | const symtab_raw: []align(1) const macho.nlist_64 = @ptrCast(mapped_ofile[symtab_cmd.symoff..][0..n_sym_bytes]); | 476 | const symtab_raw: []align(1) const macho.nlist_64 = @ptrCast(mapped_ofile[symtab_cmd.symoff..][0..n_sym_bytes]); |
| 477 | 477 | ||
| 478 | // TODO handle tentative (common) symbols | 478 | // TODO handle tentative (common) symbols |
| 479 | var symbols_by_name: std.ArrayHashMapUnmanaged(u32, void, void, true) = .empty; | 479 | var symbols_by_name: std.array_hash_map.Custom(u32, void, void, true) = .empty; |
| 480 | defer symbols_by_name.deinit(gpa); | 480 | defer symbols_by_name.deinit(gpa); |
| 481 | try symbols_by_name.ensureUnusedCapacity(gpa, @intCast(symtab_raw.len)); | 481 | try symbols_by_name.ensureUnusedCapacity(gpa, @intCast(symtab_raw.len)); |
| 482 | for (symtab_raw, 0..) |sym_raw, sym_index| { | 482 | for (symtab_raw, 0..) |sym_raw, sym_index| { |
lib/std/debug/SelfInfo/MachO.zig+1-1| ... | @@ -1,6 +1,6 @@ | ... | @@ -1,6 +1,6 @@ |
| 1 | mutex: Io.Mutex, | 1 | mutex: Io.Mutex, |
| 2 | /// Accessed through `Module.Adapter`. | 2 | /// Accessed through `Module.Adapter`. |
| 3 | modules: std.ArrayHashMapUnmanaged(Module, void, Module.Context, false), | 3 | modules: std.array_hash_map.Custom(Module, void, Module.Context, false), |
| 4 | 4 | ||
| 5 | pub const init: SelfInfo = .{ | 5 | pub const init: SelfInfo = .{ |
| 6 | .mutex = .init, | 6 | .mutex = .init, |
lib/std/process/Environ.zig+1-1| ... | @@ -101,7 +101,7 @@ pub const Map = struct { | ... | @@ -101,7 +101,7 @@ pub const Map = struct { |
| 101 | array_hash_map: ArrayHashMap, | 101 | array_hash_map: ArrayHashMap, |
| 102 | allocator: Allocator, | 102 | allocator: Allocator, |
| 103 | 103 | ||
| 104 | const ArrayHashMap = std.ArrayHashMapUnmanaged([]const u8, []const u8, EnvNameHashContext, false); | 104 | const ArrayHashMap = std.array_hash_map.Custom([]const u8, []const u8, EnvNameHashContext, false); |
| 105 | 105 | ||
| 106 | pub const Size = usize; | 106 | pub const Size = usize; |
| 107 | 107 |
src/Compilation.zig+1-1| ... | @@ -4360,7 +4360,7 @@ pub fn addModuleErrorMsg( | ... | @@ -4360,7 +4360,7 @@ pub fn addModuleErrorMsg( |
| 4360 | 4360 | ||
| 4361 | // De-duplicate error notes. The main use case in mind for this is | 4361 | // De-duplicate error notes. The main use case in mind for this is |
| 4362 | // too many "note: called from here" notes when eval branch quota is reached. | 4362 | // too many "note: called from here" notes when eval branch quota is reached. |
| 4363 | var notes: std.ArrayHashMapUnmanaged(ErrorBundle.ErrorMessage, void, ErrorNoteHashContext, true) = .empty; | 4363 | var notes: std.array_hash_map.Custom(ErrorBundle.ErrorMessage, void, ErrorNoteHashContext, true) = .empty; |
| 4364 | defer notes.deinit(gpa); | 4364 | defer notes.deinit(gpa); |
| 4365 | 4365 | ||
| 4366 | var last_note_loc: ?std.zig.Loc = null; | 4366 | var last_note_loc: ?std.zig.Loc = null; |
src/InternPool.zig+1-1| ... | @@ -1587,7 +1587,7 @@ fn getIndexMask(ip: *const InternPool, comptime BackingInt: type) u32 { | ... | @@ -1587,7 +1587,7 @@ fn getIndexMask(ip: *const InternPool, comptime BackingInt: type) u32 { |
| 1587 | return @as(u32, std.math.maxInt(BackingInt)) >> ip.tid_width; | 1587 | return @as(u32, std.math.maxInt(BackingInt)) >> ip.tid_width; |
| 1588 | } | 1588 | } |
| 1589 | 1589 | ||
| 1590 | const FieldMap = std.ArrayHashMapUnmanaged(void, void, std.array_hash_map.AutoContext(void), false); | 1590 | const FieldMap = std.array_hash_map.Custom(void, void, std.array_hash_map.AutoContext(void), false); |
| 1591 | 1591 | ||
| 1592 | /// An index into `maps` which might be `none`. | 1592 | /// An index into `maps` which might be `none`. |
| 1593 | pub const OptionalMapIndex = enum(u32) { | 1593 | pub const OptionalMapIndex = enum(u32) { |
src/Package/Fetch.zig+1-1| ... | @@ -164,7 +164,7 @@ pub const JobQueue = struct { | ... | @@ -164,7 +164,7 @@ pub const JobQueue = struct { |
| 164 | }; | 164 | }; |
| 165 | pub const Table = std.array_hash_map.Auto(Package.Hash, *Fetch); | 165 | pub const Table = std.array_hash_map.Auto(Package.Hash, *Fetch); |
| 166 | pub const UnlazySet = std.array_hash_map.Auto(Package.Hash, void); | 166 | pub const UnlazySet = std.array_hash_map.Auto(Package.Hash, void); |
| 167 | pub const ForkSet = std.ArrayHashMapUnmanaged(Fork, void, Fork.Context, false); | 167 | pub const ForkSet = std.array_hash_map.Custom(Fork, void, Fork.Context, false); |
| 168 | 168 | ||
| 169 | pub const Fork = struct { | 169 | pub const Fork = struct { |
| 170 | path: Cache.Path, | 170 | path: Cache.Path, |
src/Zcu.zig+4-4| ... | @@ -125,7 +125,7 @@ module_roots: std.array_hash_map.Auto(*Package.Module, File.Index.Optional) = .e | ... | @@ -125,7 +125,7 @@ module_roots: std.array_hash_map.Auto(*Package.Module, File.Index.Optional) = .e |
| 125 | /// | 125 | /// |
| 126 | /// Not serialized. This state is reconstructed during the first call to | 126 | /// Not serialized. This state is reconstructed during the first call to |
| 127 | /// `Compilation.update` of the process for a given `Compilation`. | 127 | /// `Compilation.update` of the process for a given `Compilation`. |
| 128 | import_table: std.ArrayHashMapUnmanaged( | 128 | import_table: std.array_hash_map.Custom( |
| 129 | File.Index, | 129 | File.Index, |
| 130 | void, | 130 | void, |
| 131 | struct { | 131 | struct { |
| ... | @@ -162,7 +162,7 @@ multi_module_err: ?struct { | ... | @@ -162,7 +162,7 @@ multi_module_err: ?struct { |
| 162 | /// on the `Compilation.Path` of the `EmbedFile`. | 162 | /// on the `Compilation.Path` of the `EmbedFile`. |
| 163 | /// | 163 | /// |
| 164 | /// This table owns all of the `*EmbedFile` memory, which is allocated into gpa. | 164 | /// This table owns all of the `*EmbedFile` memory, which is allocated into gpa. |
| 165 | embed_table: std.ArrayHashMapUnmanaged( | 165 | embed_table: std.array_hash_map.Custom( |
| 166 | *EmbedFile, | 166 | *EmbedFile, |
| 167 | void, | 167 | void, |
| 168 | struct { | 168 | struct { |
| ... | @@ -840,9 +840,9 @@ pub const Namespace = struct { | ... | @@ -840,9 +840,9 @@ pub const Namespace = struct { |
| 840 | /// Will be a struct, enum, union, or opaque. | 840 | /// Will be a struct, enum, union, or opaque. |
| 841 | owner_type: InternPool.Index, | 841 | owner_type: InternPool.Index, |
| 842 | /// Members of the namespace which are marked `pub`. | 842 | /// Members of the namespace which are marked `pub`. |
| 843 | pub_decls: std.ArrayHashMapUnmanaged(InternPool.Nav.Index, void, NavNameContext, true) = .empty, | 843 | pub_decls: std.array_hash_map.Custom(InternPool.Nav.Index, void, NavNameContext, true) = .empty, |
| 844 | /// Members of the namespace which are *not* marked `pub`. | 844 | /// Members of the namespace which are *not* marked `pub`. |
| 845 | priv_decls: std.ArrayHashMapUnmanaged(InternPool.Nav.Index, void, NavNameContext, true) = .empty, | 845 | priv_decls: std.array_hash_map.Custom(InternPool.Nav.Index, void, NavNameContext, true) = .empty, |
| 846 | /// All `comptime` declarations in this namespace. We store these purely so that incremental | 846 | /// All `comptime` declarations in this namespace. We store these purely so that incremental |
| 847 | /// compilation can re-use the existing `ComptimeUnit`s when a namespace changes. | 847 | /// compilation can re-use the existing `ComptimeUnit`s when a namespace changes. |
| 848 | comptime_decls: std.ArrayList(InternPool.ComptimeUnit.Id) = .empty, | 848 | comptime_decls: std.ArrayList(InternPool.ComptimeUnit.Id) = .empty, |
src/codegen/spirv/Module.zig+3-3| ... | @@ -58,8 +58,8 @@ cache: struct { | ... | @@ -58,8 +58,8 @@ cache: struct { |
| 58 | float_types: std.AutoHashMapUnmanaged(std.lang.Type.Float, Id) = .empty, | 58 | float_types: std.AutoHashMapUnmanaged(std.lang.Type.Float, Id) = .empty, |
| 59 | vector_types: std.AutoHashMapUnmanaged(struct { Id, u32 }, Id) = .empty, | 59 | vector_types: std.AutoHashMapUnmanaged(struct { Id, u32 }, Id) = .empty, |
| 60 | array_types: std.AutoHashMapUnmanaged(struct { Id, Id }, Id) = .empty, | 60 | array_types: std.AutoHashMapUnmanaged(struct { Id, Id }, Id) = .empty, |
| 61 | struct_types: std.ArrayHashMapUnmanaged(StructType, Id, StructType.HashContext, true) = .empty, | 61 | struct_types: std.array_hash_map.Custom(StructType, Id, StructType.HashContext, true) = .empty, |
| 62 | fn_types: std.ArrayHashMapUnmanaged(FnType, Id, FnType.HashContext, true) = .empty, | 62 | fn_types: std.array_hash_map.Custom(FnType, Id, FnType.HashContext, true) = .empty, |
| 63 | 63 | ||
| 64 | capabilities: std.AutoHashMapUnmanaged(spec.Capability, void) = .empty, | 64 | capabilities: std.AutoHashMapUnmanaged(spec.Capability, void) = .empty, |
| 65 | extensions: std.StringHashMapUnmanaged(void) = .empty, | 65 | extensions: std.StringHashMapUnmanaged(void) = .empty, |
| ... | @@ -69,7 +69,7 @@ cache: struct { | ... | @@ -69,7 +69,7 @@ cache: struct { |
| 69 | strings: std.array_hash_map.String(Id) = .empty, | 69 | strings: std.array_hash_map.String(Id) = .empty, |
| 70 | 70 | ||
| 71 | bool_const: [2]?Id = .{ null, null }, | 71 | bool_const: [2]?Id = .{ null, null }, |
| 72 | constants: std.ArrayHashMapUnmanaged(Constant, Id, Constant.HashContext, true) = .empty, | 72 | constants: std.array_hash_map.Custom(Constant, Id, Constant.HashContext, true) = .empty, |
| 73 | 73 | ||
| 74 | spirv_types: std.AutoHashMapUnmanaged(InternPool.Index, Id) = .empty, | 74 | spirv_types: std.AutoHashMapUnmanaged(InternPool.Index, Id) = .empty, |
| 75 | } = .{}, | 75 | } = .{}, |
src/link/SpirV/lower_invocation_globals.zig+1-1| ... | @@ -342,7 +342,7 @@ const ModuleBuilder = struct { | ... | @@ -342,7 +342,7 @@ const ModuleBuilder = struct { |
| 342 | entry_point_new_id_base: u32, | 342 | entry_point_new_id_base: u32, |
| 343 | /// A set of all function types in the new program. SPIR-V mandates that these are unique, | 343 | /// A set of all function types in the new program. SPIR-V mandates that these are unique, |
| 344 | /// and until a general type deduplication pass is programmed, we just handle it here via this. | 344 | /// and until a general type deduplication pass is programmed, we just handle it here via this. |
| 345 | function_types: std.ArrayHashMapUnmanaged(FunctionType, ResultId, FunctionType.Context, true) = .empty, | 345 | function_types: std.array_hash_map.Custom(FunctionType, ResultId, FunctionType.Context, true) = .empty, |
| 346 | /// Maps functions to new information required for creating the module | 346 | /// Maps functions to new information required for creating the module |
| 347 | function_new_info: std.array_hash_map.Auto(ResultId, FunctionNewInfo) = .empty, | 347 | function_new_info: std.array_hash_map.Auto(ResultId, FunctionNewInfo) = .empty, |
| 348 | /// Offset of the functions section in the new binary. | 348 | /// Offset of the functions section in the new binary. |