| ... | @@ -48,7 +48,7 @@ pub fn obtain(cache: *Cache) Manifest { | ... | @@ -48,7 +48,7 @@ pub fn obtain(cache: *Cache) Manifest { |
| 48 | .cache = cache, | 48 | .cache = cache, |
| 49 | .hash = cache.hash, | 49 | .hash = cache.hash, |
| 50 | .manifest_file = null, | 50 | .manifest_file = null, |
| 51 | .manifest_dirty = false, | 51 | .dirty = false, |
| 52 | }; | 52 | }; |
| 53 | } | 53 | } |
| 54 | | 54 | |
| ... | @@ -274,7 +274,8 @@ pub const Manifest = struct { | ... | @@ -274,7 +274,8 @@ pub const Manifest = struct { |
| 274 | hash: HashHelper, | 274 | hash: HashHelper, |
| 275 | /// When this is null, `Manifest` is in "pre-check" phase. Otherwise it is in "post-check" phase. | 275 | /// When this is null, `Manifest` is in "pre-check" phase. Otherwise it is in "post-check" phase. |
| 276 | manifest_file: ?Io.File, | 276 | manifest_file: ?Io.File, |
| 277 | manifest_dirty: bool, | 277 | /// `finalize` has not been called yet. |
| | 278 | dirty: bool, |
| 278 | /// Set this flag to true before calling `check` in order to indicate that upon a cache hit, the code | 279 | /// Set this flag to true before calling `check` in order to indicate that upon a cache hit, the code |
| 279 | /// using the cache will not modify the files within the cache directory. This allows multiple processes | 280 | /// using the cache will not modify the files within the cache directory. This allows multiple processes |
| 280 | /// to utilize the same cache directory at the same time. | 281 | /// to utilize the same cache directory at the same time. |
| ... | @@ -306,30 +307,6 @@ pub const Manifest = struct { | ... | @@ -306,30 +307,6 @@ pub const Manifest = struct { |
| 306 | all_input_content: std.ArrayList(u8) = .empty, | 307 | all_input_content: std.ArrayList(u8) = .empty, |
| 307 | max_input_content_len: usize = std.math.maxInt(u32), | 308 | max_input_content_len: usize = std.math.maxInt(u32), |
| 308 | | 309 | |
| 309 | /// State that exists only during check. | | |
| 310 | pub const Check = struct { | | |
| 311 | /// Protects `Manifest.diagnostic` from data races. | | |
| 312 | diagnostic_lock: bool = false, | | |
| 313 | status: Status = .hit, | | |
| 314 | | | |
| 315 | pub const Status = enum { hit, miss }; | | |
| 316 | | | |
| 317 | pub const Error = error{ | | |
| 318 | /// Unable to check the cache for a reason that has been recorded into | | |
| 319 | /// the `diagnostic` field. | | |
| 320 | CacheCheckFailed, | | |
| 321 | /// A cache manifest file exists however it could not be parsed. | | |
| 322 | InvalidFormat, | | |
| 323 | } || Allocator.Error || Io.Cancelable; | | |
| 324 | | | |
| 325 | fn fail(c: *Check, m: *Manifest, diagnostic: Diagnostic) error{CacheCheckFailed} { | | |
| 326 | if (!@atomicRmw(bool, &c.diagnostic_lock, .Xchg, true, .monotonic)) { | | |
| 327 | m.diagnostic = diagnostic; | | |
| 328 | } | | |
| 329 | return error.CacheCheckFailed; | | |
| 330 | } | | |
| 331 | }; | | |
| 332 | | | |
| 333 | pub const Files = std.array_hash_map.Custom(File.Offset, void, File.HashContext, false); | 310 | pub const Files = std.array_hash_map.Custom(File.Offset, void, File.HashContext, false); |
| 334 | | 311 | |
| 335 | /// Source files and directories whose prefix and relative path are | 312 | /// Source files and directories whose prefix and relative path are |
| ... | @@ -340,7 +317,9 @@ pub const Manifest = struct { | ... | @@ -340,7 +317,9 @@ pub const Manifest = struct { |
| 340 | /// but the other fields of `File` will be populated depending on the | 317 | /// but the other fields of `File` will be populated depending on the |
| 341 | /// fields of `InputPath`. | 318 | /// fields of `InputPath`. |
| 342 | pub const InputPath = struct { | 319 | pub const InputPath = struct { |
| | 320 | /// Determines whether `check` will keep the handle open or close it. |
| 343 | request_handle: bool, | 321 | request_handle: bool, |
| | 322 | /// Determines whether `handle` is populated. |
| 344 | have_handle: bool, | 323 | have_handle: bool, |
| 345 | /// Determines whether `File.size`, `File.inode`, and `File.mtime` are populated. | 324 | /// Determines whether `File.size`, `File.inode`, and `File.mtime` are populated. |
| 346 | have_stat: bool, | 325 | have_stat: bool, |
| ... | @@ -362,6 +341,13 @@ pub const Manifest = struct { | ... | @@ -362,6 +341,13 @@ pub const Manifest = struct { |
| 362 | off: u32, | 341 | off: u32, |
| 363 | len: u32, | 342 | len: u32, |
| 364 | }, | 343 | }, |
| | 344 | |
| | 345 | pub fn get(this: @This(), all_contents: []const u8) ?[]const u8 { |
| | 346 | return if (this.status.populated()) |
| | 347 | all_contents[this.status.populated.off..][0..this.status.populated.len] |
| | 348 | else |
| | 349 | null; |
| | 350 | } |
| 365 | } align(@alignOf(u32)), | 351 | } align(@alignOf(u32)), |
| 366 | /// `have_handle` determines whether this is populated. | 352 | /// `have_handle` determines whether this is populated. |
| 367 | handle: union { | 353 | handle: union { |
| ... | @@ -369,6 +355,12 @@ pub const Manifest = struct { | ... | @@ -369,6 +355,12 @@ pub const Manifest = struct { |
| 369 | dir: Io.Dir, | 355 | dir: Io.Dir, |
| 370 | }, | 356 | }, |
| 371 | | 357 | |
| | 358 | pub const Handle = union(enum) { |
| | 359 | none, |
| | 360 | file: Io.File, |
| | 361 | dir: Io.Dir, |
| | 362 | }; |
| | 363 | |
| 372 | /// Index into `Manifest.input_paths`. | 364 | /// Index into `Manifest.input_paths`. |
| 373 | pub const Index = enum(u32) { | 365 | pub const Index = enum(u32) { |
| 374 | _, | 366 | _, |
| ... | @@ -387,6 +379,13 @@ pub const Manifest = struct { | ... | @@ -387,6 +379,13 @@ pub const Manifest = struct { |
| 387 | return manifest.all_input_content.items[populated.off..][0..populated.len]; | 379 | return manifest.all_input_content.items[populated.off..][0..populated.len]; |
| 388 | } | 380 | } |
| 389 | }; | 381 | }; |
| | 382 | |
| | 383 | pub fn getHandle(this: @This(), file: *const File) Handle { |
| | 384 | return if (!this.have_handle) .none else switch (file.flags.is_directory) { |
| | 385 | false => .{ .file = this.handle.file }, |
| | 386 | true => .{ .dir = this.handle.dir }, |
| | 387 | }; |
| | 388 | } |
| 390 | }; | 389 | }; |
| 391 | | 390 | |
| 392 | /// The data per tracked input file that is stored in the manifest file. | 391 | /// The data per tracked input file that is stored in the manifest file. |
| ... | @@ -449,6 +448,24 @@ pub const Manifest = struct { | ... | @@ -449,6 +448,24 @@ pub const Manifest = struct { |
| 449 | if (!mem.isAligned(@backingInt(offset), @alignOf(File))) return error.InvalidFormat; | 448 | if (!mem.isAligned(@backingInt(offset), @alignOf(File))) return error.InvalidFormat; |
| 450 | return getConst(offset, contents); | 449 | return getConst(offset, contents); |
| 451 | } | 450 | } |
| | 451 | |
| | 452 | pub fn flagsAndPath(off: File.Offset, contents: []const u8) [:0]const u8 { |
| | 453 | const flags_off = @offsetOf(File, "flags"); |
| | 454 | comptime assert(@offsetOf(File, "path_start") - flags_off == 1); |
| | 455 | const hash_start = @backingInt(off) + flags_off; |
| | 456 | const hash_end = mem.findScalarPos(u8, contents, hash_start, 0).?; |
| | 457 | return contents[hash_start..hash_end]; |
| | 458 | } |
| | 459 | |
| | 460 | pub fn pathFallible(off: File.Offset, contents: []const u8) error{InvalidFormat}![:0]const u8 { |
| | 461 | const path_start = @backingInt(off) + @offsetOf(File, "path_start"); |
| | 462 | const path_end = mem.findScalarPos(u8, contents, path_start, 0) orelse return error.InvalidFormat; |
| | 463 | return contents[path_start..path_end :0]; |
| | 464 | } |
| | 465 | |
| | 466 | pub fn path(off: File.Offset, contents: []const u8) [:0]const u8 { |
| | 467 | return pathFallible(contents, off) catch unreachable; |
| | 468 | } |
| 452 | }; | 469 | }; |
| 453 | | 470 | |
| 454 | /// Intentionally matches if the files are different only by flags other than prefix. | 471 | /// Intentionally matches if the files are different only by flags other than prefix. |
| ... | @@ -457,7 +474,7 @@ pub const Manifest = struct { | ... | @@ -457,7 +474,7 @@ pub const Manifest = struct { |
| 457 | | 474 | |
| 458 | pub fn hash(this: @This(), off: Offset) u32 { | 475 | pub fn hash(this: @This(), off: Offset) u32 { |
| 459 | const file_prefix = off.getConst(this.contents).flags.prefix; | 476 | const file_prefix = off.getConst(this.contents).flags.prefix; |
| 460 | const file_path = filePath(this.contents, off); | 477 | const file_path = off.path(this.contents); |
| 461 | return @truncate(std.hash.Wyhash.hash(file_prefix, file_path)); | 478 | return @truncate(std.hash.Wyhash.hash(file_prefix, file_path)); |
| 462 | } | 479 | } |
| 463 | | 480 | |
| ... | @@ -466,8 +483,8 @@ pub const Manifest = struct { | ... | @@ -466,8 +483,8 @@ pub const Manifest = struct { |
| 466 | const a_prefix = a_off.getConst(this.contents).flags.prefix; | 483 | const a_prefix = a_off.getConst(this.contents).flags.prefix; |
| 467 | const b_prefix = b_off.getConst(this.contents).flags.prefix; | 484 | const b_prefix = b_off.getConst(this.contents).flags.prefix; |
| 468 | if (a_prefix != b_prefix) return false; | 485 | if (a_prefix != b_prefix) return false; |
| 469 | const a_path = filePath(this.contents, a_off); | 486 | const a_path = a_off.path(this.contents); |
| 470 | const b_path = filePath(this.contents, b_off); | 487 | const b_path = b_off.path(this.contents); |
| 471 | return mem.eql(u8, a_path, b_path); | 488 | return mem.eql(u8, a_path, b_path); |
| 472 | } | 489 | } |
| 473 | }; | 490 | }; |
| ... | @@ -480,12 +497,24 @@ pub const Manifest = struct { | ... | @@ -480,12 +497,24 @@ pub const Manifest = struct { |
| 480 | hasher.final(&file.digest); | 497 | hasher.final(&file.digest); |
| 481 | } | 498 | } |
| 482 | | 499 | |
| 483 | fn setStat(file: *File, m: *Manifest, stat: Stat) Io.Cancelable!void { | 500 | fn stat(file: *const File) Stat { |
| 484 | file.size = stat.size; | 501 | return .{ |
| 485 | file.inode = stat.inode; | 502 | .size = file.size, |
| 486 | file.mtime = @intCast(stat.mtime.toNanoseconds()); | 503 | .inode = file.inode, |
| | 504 | .mtime = file.mtime, |
| | 505 | }; |
| | 506 | } |
| | 507 | |
| | 508 | fn setStatUnchecked(file: *File, s: Stat) void { |
| | 509 | file.size = s.size; |
| | 510 | file.inode = s.inode; |
| | 511 | file.mtime = @intCast(s.mtime.toNanoseconds()); |
| | 512 | } |
| | 513 | |
| | 514 | fn setStat(file: *File, m: *Manifest, s: Stat) Io.Cancelable!void { |
| | 515 | setStatUnchecked(file, s); |
| 487 | | 516 | |
| 488 | if (try m.isProblematicTimestamp(stat.mtime)) { | 517 | if (try m.isProblematicTimestamp(s.mtime)) { |
| 489 | // The actual file has an unreliable timestamp; force it to be hashed. | 518 | // The actual file has an unreliable timestamp; force it to be hashed. |
| 490 | file.mtime = 0; | 519 | file.mtime = 0; |
| 491 | file.inode = 0; | 520 | file.inode = 0; |
| ... | @@ -493,14 +522,14 @@ pub const Manifest = struct { | ... | @@ -493,14 +522,14 @@ pub const Manifest = struct { |
| 493 | } | 522 | } |
| 494 | | 523 | |
| 495 | /// Returns true if the stat was changed. Updates the `file` with the new stat value. | 524 | /// Returns true if the stat was changed. Updates the `file` with the new stat value. |
| 496 | fn setStatChanged(file: *File, m: *Manifest, stat: Stat) Io.Cancelable!bool { | 525 | fn setStatChanged(file: *File, m: *Manifest, s: Stat) Io.Cancelable!bool { |
| 497 | if (stat.size == file.size and | 526 | if (s.size == file.size and |
| 498 | stat.mtime.nanoseconds == file.mtime and | 527 | s.mtime.nanoseconds == file.mtime and |
| 499 | stat.inode == file.inode) | 528 | s.inode == file.inode) |
| 500 | { | 529 | { |
| 501 | return false; | 530 | return false; |
| 502 | } else { | 531 | } else { |
| 503 | try setStat(file, m, stat); | 532 | try setStat(file, m, s); |
| 504 | return true; | 533 | return true; |
| 505 | } | 534 | } |
| 506 | } | 535 | } |
| ... | @@ -535,7 +564,7 @@ pub const Manifest = struct { | ... | @@ -535,7 +564,7 @@ pub const Manifest = struct { |
| 535 | const prefix = fo.file_offset.get(contents).flags.prefix; | 564 | const prefix = fo.file_offset.get(contents).flags.prefix; |
| 536 | return .{ | 565 | return .{ |
| 537 | .root_dir = manifest.cache.prefixes()[prefix], | 566 | .root_dir = manifest.cache.prefixes()[prefix], |
| 538 | .sub_path = filePath(contents, fo.file_offset), | 567 | .sub_path = fo.file_offset.path(contents), |
| 539 | }; | 568 | }; |
| 540 | } | 569 | } |
| 541 | }; | 570 | }; |
| ... | @@ -680,6 +709,21 @@ pub const Manifest = struct { | ... | @@ -680,6 +709,21 @@ pub const Manifest = struct { |
| 680 | _ = try addInputPath(m, opt_path orelse return, options); | 709 | _ = try addInputPath(m, opt_path orelse return, options); |
| 681 | } | 710 | } |
| 682 | | 711 | |
| | 712 | pub const CheckResult = union(enum) { |
| | 713 | hit, |
| | 714 | incomplete_manifest, |
| | 715 | path_deleted: File.Offset, |
| | 716 | directory_status_changed: File.Offset, |
| | 717 | metadata_changed: File.Offset, |
| | 718 | contents_changed: File.Offset, |
| | 719 | }; |
| | 720 | |
| | 721 | pub const CheckError = error{ |
| | 722 | /// Unable to check the cache for a reason that has been recorded into |
| | 723 | /// the `diagnostic` field. |
| | 724 | CacheCheckFailed, |
| | 725 | } || Allocator.Error || Io.Cancelable; |
| | 726 | |
| 683 | /// Check the cache to see if the input exists in it. | 727 | /// Check the cache to see if the input exists in it. |
| 684 | /// A hex encoding of its hash is available by calling `final`. | 728 | /// A hex encoding of its hash is available by calling `final`. |
| 685 | /// | 729 | /// |
| ... | @@ -692,13 +736,13 @@ pub const Manifest = struct { | ... | @@ -692,13 +736,13 @@ pub const Manifest = struct { |
| 692 | /// The lock on the manifest file is released when `deinit` is called. As another | 736 | /// The lock on the manifest file is released when `deinit` is called. As another |
| 693 | /// option, one may call `toOwnedLock` to obtain a smaller object which can represent | 737 | /// option, one may call `toOwnedLock` to obtain a smaller object which can represent |
| 694 | /// the lock. `deinit` is safe to call whether or not `toOwnedLock` has been called. | 738 | /// the lock. `deinit` is safe to call whether or not `toOwnedLock` has been called. |
| 695 | pub fn check(man: *Manifest, parent_progress_node: std.Progress.Node) Check.Error!Check.Status { | 739 | pub fn check(man: *Manifest, parent_progress_node: std.Progress.Node) CheckError!CheckResult { |
| 696 | const node = parent_progress_node.start("Reusing Cache Artifacts", 0); | 740 | const node = parent_progress_node.start("Reusing Cache Artifacts", 0); |
| 697 | defer node.end(); | 741 | defer node.end(); |
| 698 | return checkProgressless(man); | 742 | return checkProgressless(man); |
| 699 | } | 743 | } |
| 700 | | 744 | |
| 701 | pub fn checkProgressless(man: *Manifest) Check.Error!Check.Status { | 745 | pub fn checkProgressless(man: *Manifest) CheckError!CheckResult { |
| 702 | assert(man.manifest_file == null); | 746 | assert(man.manifest_file == null); |
| 703 | | 747 | |
| 704 | // This is *not* hashing the contents of the input files. It is the | 748 | // This is *not* hashing the contents of the input files. It is the |
| ... | @@ -798,16 +842,18 @@ pub const Manifest = struct { | ... | @@ -798,16 +842,18 @@ pub const Manifest = struct { |
| 798 | // files, so the caller can call `final`. Otherwise, on a cache miss, `man.hash.hasher` will include the digests | 842 | // files, so the caller can call `final`. Otherwise, on a cache miss, `man.hash.hasher` will include the digests |
| 799 | // of all non-discovered files -- that is, the ones we've already been told about. The rest will be discovered | 843 | // of all non-discovered files -- that is, the ones we've already been told about. The rest will be discovered |
| 800 | // through calls to `addDiscoveredPath` etc, which will update the hasher. After all files are added, the user | 844 | // through calls to `addDiscoveredPath` etc, which will update the hasher. After all files are added, the user |
| 801 | // can use `final`, and will at some point `writeManifest` the file list to disk. | 845 | // can use `final`, and will at some point `finalize` the file list to disk. |
| 802 | | 846 | |
| 803 | man.hash.hasher = hasher_init; | 847 | man.hash.hasher = hasher_init; |
| 804 | man.hash.hasher.update(&input_digest); | 848 | man.hash.hasher.update(&input_digest); |
| 805 | | 849 | |
| 806 | hit: { | 850 | hit: { |
| 807 | digests: { | 851 | const miss_result = miss: { |
| 808 | switch (try man.checkLocked()) { | 852 | const result = try man.checkLocked(); |
| 809 | .hit => break :hit, | 853 | if (result == .hit) { |
| 810 | .miss => if (!try man.upgradeToExclusiveLock()) break :digests, | 854 | break :hit; |
| | 855 | } else if (!try man.upgradeToExclusiveLock()) { |
| | 856 | break :miss result; |
| 811 | } | 857 | } |
| 812 | // We've just had a miss with the shared lock, and upgraded to an exclusive lock. Someone | 858 | // We've just had a miss with the shared lock, and upgraded to an exclusive lock. Someone |
| 813 | // else might have modified the digest, so we need to check again before deciding to miss. | 859 | // else might have modified the digest, so we need to check again before deciding to miss. |
| ... | @@ -816,18 +862,16 @@ pub const Manifest = struct { | ... | @@ -816,18 +862,16 @@ pub const Manifest = struct { |
| 816 | man.hash.hasher = hasher_init; | 862 | man.hash.hasher = hasher_init; |
| 817 | man.hash.hasher.update(&input_digest); | 863 | man.hash.hasher.update(&input_digest); |
| 818 | man.shrinkFilesToInput(); | 864 | man.shrinkFilesToInput(); |
| 819 | switch (try man.checkLocked()) { | 865 | const refreshed_result = try man.checkLocked(); |
| 820 | .hit => break :hit, | 866 | if (refreshed_result == .hit) break :hit; |
| 821 | .miss => break :digests, | 867 | break :miss refreshed_result; |
| 822 | } | 868 | }; |
| 823 | } | | |
| 824 | | 869 | |
| 825 | // Cache miss. `checkLocked` guarantees that all input files have their digests populated | 870 | // Cache miss, but `checkLocked` guarantees that all input files have their digests computed, even on a |
| 826 | // unless it returns an error. | 871 | // cache miss, which is needed because they will be used in the manifest digest. |
| 827 | man.manifest_dirty = true; | 872 | man.dirty = true; |
| 828 | // All input file digests are already populated by `checkLocked`, so we can call `unhit` directly. | | |
| 829 | unhit(man, &input_digest); | 873 | unhit(man, &input_digest); |
| 830 | return .miss; | 874 | return miss_result; |
| 831 | } | 875 | } |
| 832 | | 876 | |
| 833 | if (man.want_shared_lock) { | 877 | if (man.want_shared_lock) { |
| ... | @@ -852,127 +896,454 @@ pub const Manifest = struct { | ... | @@ -852,127 +896,454 @@ pub const Manifest = struct { |
| 852 | | 896 | |
| 853 | /// Assumes that `self.hash.hasher` has been updated only with the original digest and that | 897 | /// Assumes that `self.hash.hasher` has been updated only with the original digest and that |
| 854 | /// `self.files` contains only the original input files. | 898 | /// `self.files` contains only the original input files. |
| 855 | fn checkLocked(m: *Manifest) Check.Error!Check.Status { | 899 | fn checkLocked(m: *Manifest) CheckError!CheckResult { |
| 856 | const gpa = m.cache.gpa; | 900 | const gpa = m.cache.gpa; |
| 857 | const io = m.cache.io; | 901 | const io = m.cache.io; |
| 858 | const manifest_file = m.manifest_file.?; | 902 | const manifest_file = m.manifest_file.?; |
| 859 | | 903 | |
| 860 | const manifest_size = if (manifest_file.stat(io)) |stat| stat.size else |err| switch (err) { | 904 | const manifest_size = if (manifest_file.stat(io)) |stat| stat.size else |err| switch (err) { |
| 861 | error.Canceled => |e| return e, | 905 | error.Canceled => |e| return e, |
| 862 | else => |e| { | 906 | else => |e| return fail(&m.diagnostic, .{ .manifest_stat = e }), |
| 863 | m.diagnostic = .{ .manifest_stat = e }; | | |
| 864 | return error.CacheCheckFailed; | | |
| 865 | }, | | |
| 866 | }; | 907 | }; |
| 867 | | 908 | |
| 868 | // We always want to compute the input file hash digests, even on a cache miss, because they will be | | |
| 869 | // used in the manifest digest. | | |
| 870 | | | |
| 871 | if (manifest_size == 0 or manifest_size < m.contents.items.len) { | 909 | if (manifest_size == 0 or manifest_size < m.contents.items.len) { |
| 872 | // Don't clobber our input files by overwriting contents since it's a cache miss. | 910 | // Manifest file was never finalized. |
| 873 | try m.contents.ensureUnusedCapacity(gpa, 1); | 911 | try m.contents.ensureUnusedCapacity(gpa, 1); |
| 874 | return .miss; | 912 | return .incomplete_manifest; |
| 875 | } | 913 | } |
| 876 | | 914 | |
| 877 | // Already supposedly includes the extra null byte that we have to maintain. | 915 | // We must not clobber existing `Manifest.contents` because it possibly contains prepopulated stat and digest |
| 878 | try m.contents.resize(gpa, manifest_size); | 916 | // information which we must compare with the file system. Since non input files are typically greater in number |
| 879 | | 917 | // than input files, the strategy here is to move the contents to make room for entirety of the manifest |
| | 918 | // contents on disk, and then later truncate the contents array. |
| | 919 | // |
| | 920 | // The file on disk already supposedly includes the extra null byte that we have to maintain. |
| | 921 | const input_contents_len = m.contents.len; |
| | 922 | // After this resize, every return statement needs to modify m.contents length. |
| | 923 | try m.contents.resize(gpa, input_contents_len + manifest_size); |
| | 924 | errdefer m.contents.shrinkRetainingCapacity(input_contents_len); |
| | 925 | @memcpy(m.contents.items[manifest_size..][0..input_contents_len], m.contents.items[0..input_contents_len]); |
| 880 | { | 926 | { |
| 881 | const n = manifest_file.readPositionalAll(io, m.contents.items, 0) catch |err| switch (err) { | 927 | const n = manifest_file.readPositionalAll(io, m.contents.items, 0) catch |err| switch (err) { |
| 882 | error.Canceled => |e| return e, | 928 | error.Canceled => |e| return e, |
| 883 | else => |e| { | 929 | else => |e| return fail(&m.diagnostic, .{ .manifest_read = e }), |
| 884 | m.diagnostic = .{ .manifest_read = e }; | | |
| 885 | return error.CacheCheckFailed; | | |
| 886 | }, | | |
| 887 | }; | 930 | }; |
| 888 | m.contents.shrinkRetainingCapacity(n); | 931 | if (n != manifest_size) return checkLockedMiss(m, input_contents_len, .incomplete_manifest); |
| 889 | } | 932 | } |
| 890 | const contents = m.contents.items; | 933 | const disk_contents = m.contents.items[0..manifest_size]; |
| | 934 | const input_contents = m.contents.items[manifest_size..input_contents_len]; |
| 891 | | 935 | |
| | 936 | // First the input files section, which must match our input files, otherwise it's invalid or incomplete. |
| 892 | var off: usize = 0; | 937 | var off: usize = 0; |
| 893 | var c: Check = .{}; | 938 | for (m.input_paths.items, m.files.keys()[0..m.input_paths.items.len], 0..) |*input_path, file_off, i| { |
| 894 | | 939 | if (@backingInt(file_off) + 1 >= disk_contents.len) |
| 895 | // First the input files section, which must match our input files, otherwise it's invalid format. | 940 | return missInput(m, i, input_contents_len, manifest_size, .incomplete_manifest); |
| 896 | for (m.input_paths.items, m.files.keys()[0..m.input_paths.items.len]) |*input_path, input_file_off| { | 941 | if (!mem.eql(u8, file_off.flagsAndPath(disk_contents), file_off.flagsAndPath(input_contents))) |
| 897 | if (off + 1 >= contents.len) return error.InvalidFormat; | 942 | return missInput(m, i, input_contents_len, manifest_size, .invalid_manifest); |
| 898 | const file_off: File.Offset = @fromBackingInt(@intCast(off)); | 943 | |
| 899 | const file = try file_off.getFallible(contents); | 944 | const result = try checkInputPath(m, file_off, input_path, disk_contents, input_contents); |
| 900 | if (file.flags.prefix >= m.cache.prefixes_len) return error.InvalidFormat; | 945 | if (result != .hit) return missInput(m, i + 1, input_contents_len, manifest_size, result); |
| 901 | const path = try filePathFallible(contents, file_off); | 946 | off = @backingInt(file_off); |
| 902 | if (path.len == 0) return error.InvalidFormat; | | |
| 903 | if (input_file_off != file_off) return error.InvalidFormat; | | |
| 904 | | | |
| 905 | try checkInputFile(m, &c, file_off, path, input_path); | | |
| 906 | | | |
| 907 | off += File.sizeOf(path.len); | | |
| 908 | } | 947 | } |
| 909 | | 948 | |
| 910 | if (c.status == .miss) return .miss; | | |
| 911 | if (m.diagnostic != .none) return error.CacheCheckFailed; | | |
| 912 | | | |
| 913 | // Guess number of files based on manifest contents len to reduce allocations. | 949 | // Guess number of files based on manifest contents len to reduce allocations. |
| 914 | // This is not an upper bound; subsequent insertions may potentially allocate. | 950 | // This is not an upper bound; subsequent insertions may potentially allocate. |
| 915 | try m.files.ensureUnusedCapacityContext(gpa, contents.len / (@sizeOf(File) + 32), .{ | 951 | try m.files.ensureUnusedCapacityContext(gpa, disk_contents.len / (@sizeOf(File) + 32), .{ |
| 916 | .contents = contents, | 952 | .contents = disk_contents, |
| 917 | }); | 953 | }); |
| 918 | | 954 | |
| 919 | // Validate and count discovered files. | 955 | // Validate and check discovered files. |
| 920 | while (off + 1 < contents.len) { | 956 | while (off + 1 < disk_contents.len) { |
| 921 | const file_off: File.Offset = @fromBackingInt(@intCast(off)); | 957 | const file_off: File.Offset = @fromBackingInt(@intCast(off)); |
| 922 | const file = try file_off.getFallible(contents); | 958 | const file = try file_off.getFallible(disk_contents); |
| 923 | if (file.flags.prefix >= m.cache.prefixes_len) return error.InvalidFormat; | 959 | if (file.flags.prefix >= m.cache.prefixes_len) |
| 924 | const path = try filePathFallible(contents, file_off); | 960 | return checkLockedMiss(m, input_contents_len, .invalid_manifest); |
| 925 | if (path.len == 0) return error.InvalidFormat; | 961 | const path = try file_off.pathFallible(disk_contents); |
| 926 | | 962 | if (path.len == 0) return checkLockedMiss(m, input_contents_len, .invalid_manifest); |
| 927 | try m.files.putContext(gpa, file_off, {}, .{ .contents = contents }); | 963 | |
| 928 | switch (try checkFile(m, &c, file_off, filePath(contents, file_off))) { | 964 | try m.files.putContext(gpa, file_off, {}, .{ .contents = disk_contents }); |
| 929 | .hit => {}, | 965 | const result = try checkDiscoveredPath(file_off, file_off.path(disk_contents)); |
| 930 | .miss => return .miss, | 966 | if (result != .hit) return checkLockedMiss(m, input_contents_len, result); |
| 931 | } | | |
| 932 | | 967 | |
| 933 | off += File.sizeOf(path.len); | 968 | off += File.sizeOf(path.len); |
| 934 | } | 969 | } |
| 935 | | 970 | |
| 936 | // Final terminating zero byte to distinguish empty manifest file from | 971 | // Final terminating zero byte to distinguish empty manifest file from |
| 937 | // manifest with zero files. | 972 | // manifest with zero files. |
| 938 | const file_valid = off + 1 == contents.len and contents[off] == 0; | 973 | const file_valid = off + 1 == disk_contents.len and disk_contents[off] == 0; |
| 939 | if (!file_valid) return .miss; | 974 | if (!file_valid) return checkLockedMiss(m, input_contents_len, .incomplete_manifest); |
| 940 | | 975 | |
| 941 | for (m.files.keys()) |file_off| m.hash.hasher.update(&file_off.get(contents).digest); | 976 | for (m.files.keys()) |file_off| m.hash.hasher.update(&file_off.get(disk_contents).digest); |
| 942 | | | |
| 943 | // Don't track the trailing zero byte in contents. | | |
| 944 | m.contents.items.len -= 1; | | |
| 945 | | 977 | |
| | 978 | // Since it's a cache hit, we accept the input file contents from disk and discard the other copy. |
| | 979 | // Furthermore, don't track the trailing zero byte in contents. |
| | 980 | m.contents.shrinkRetainingCapacity(manifest_size - 1); |
| 946 | return .hit; | 981 | return .hit; |
| 947 | } | 982 | } |
| 948 | | 983 | |
| 949 | fn checkInputFile( | 984 | /// Restore input file contents to prepare for cache miss workflow. We want to keep everything prior to `off` to |
| | 985 | /// avoid redundant computation of digest and stat. |
| | 986 | /// |
| | 987 | /// Furthermore, this function is responsible for populating the remaining input file digests and metadata after the |
| | 988 | /// missed one. |
| | 989 | fn missInput( |
| | 990 | m: *Manifest, |
| | 991 | next_file_index: usize, |
| | 992 | input_contents_len: usize, |
| | 993 | manifest_size: usize, |
| | 994 | result: CheckResult, |
| | 995 | ) CheckError!CheckResult { |
| | 996 | const file_offs = m.files.keys(); |
| | 997 | const off = if (file_offs.len - next_file_index == 0) input_contents_len else file_offs[next_file_index]; |
| | 998 | const copy_len = input_contents_len - off; |
| | 999 | @memcpy( |
| | 1000 | m.contents.items[off..][0..copy_len], |
| | 1001 | m.contents.items[manifest_size + off ..][0..copy_len], |
| | 1002 | ); |
| | 1003 | m.contents.shrinkRetainingCapacity(input_contents_len); |
| | 1004 | // And now iterate over remaining input files and populate the missing input file hashes. |
| | 1005 | const contents = m.contents.items; |
| | 1006 | for (file_offs[next_file_index..], m.input_paths.items) |input_file_off, *input_path| { |
| | 1007 | assert(@backingInt(input_file_off) == off); |
| | 1008 | try populateInputPath(m, input_file_off, input_path, contents); |
| | 1009 | } |
| | 1010 | return result; |
| | 1011 | } |
| | 1012 | |
| | 1013 | fn checkLockedMiss(m: *Manifest, input_contents_len: usize, result: CheckResult) CheckResult { |
| | 1014 | m.contents.shrinkRetainingCapacity(input_contents_len); |
| | 1015 | return result; |
| | 1016 | } |
| | 1017 | |
| | 1018 | /// Similar to `checkInputPath` and `checkDiscoveredPath` but does not compare metadata or digest against file |
| | 1019 | /// system. Only ensures that metadata and digest are available. |
| | 1020 | fn populateInputPath( |
| 950 | m: *Manifest, | 1021 | m: *Manifest, |
| 951 | c: *Check, | | |
| 952 | file_off: File.Offset, | 1022 | file_off: File.Offset, |
| 953 | file_path: [:0]const u8, | | |
| 954 | input_path: *InputPath, | 1023 | input_path: *InputPath, |
| 955 | ) CheckFileError!void { | 1024 | contents: []const u8, |
| 956 | if (input_path.have_handle) @panic("TODO"); | 1025 | ) CheckError!void { |
| 957 | if (input_path.have_stat) @panic("TODO"); | 1026 | const cache = m.cache; |
| 958 | if (input_path.contents.status != .unrequested) @panic("TODO"); | 1027 | const io = cache.io; |
| 959 | if (input_path.request_handle) @panic("TODO"); | 1028 | const input_file = file_off.get(contents); |
| 960 | switch (try checkFile(m, c, file_off, file_path)) { | 1029 | const parent_dir = cache.prefixes()[input_file.flags.prefix].handle; |
| 961 | .hit => {}, | 1030 | const file_path = file_off.path(contents); |
| 962 | .miss => c.status = .miss, | 1031 | |
| | 1032 | if (input_path.have_digest) return; |
| | 1033 | |
| | 1034 | const stat_path_ok = input_path.contents.status.populated() or input_file.flags.metadata_only; |
| | 1035 | if (!input_path.have_stat and stat_path_ok) { |
| | 1036 | // Since this is an input file, FileNotFound counts as a failure, not a cache miss. |
| | 1037 | const actual_stat = switch (input_path.getHandle(input_file)) { |
| | 1038 | .none => parent_dir.statFile(io, file_path, .{}) catch |err| switch (err) { |
| | 1039 | error.Canceled => |e| return e, |
| | 1040 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1041 | .file_offset = file_off, |
| | 1042 | .err = e, |
| | 1043 | } }), |
| | 1044 | }, |
| | 1045 | .file => |opened_file| opened_file.stat(io) catch |err| switch (err) { |
| | 1046 | error.Canceled => |e| return e, |
| | 1047 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1048 | .file_offset = file_off, |
| | 1049 | .err = e, |
| | 1050 | } }), |
| | 1051 | }, |
| | 1052 | .dir => |opened_dir| opened_dir.stat(io) catch |err| switch (err) { |
| | 1053 | error.Canceled => |e| return e, |
| | 1054 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1055 | .file_offset = file_off, |
| | 1056 | .err = e, |
| | 1057 | } }), |
| | 1058 | }, |
| | 1059 | }; |
| | 1060 | const actual_is_directory = actual_stat.kind == .directory; |
| | 1061 | if (actual_is_directory != input_file.flags.is_directory) { |
| | 1062 | // Since this is an input file, this is a failure, not a cache miss. |
| | 1063 | return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1064 | .file_offset = file_off, |
| | 1065 | .err = if (actual_is_directory) error.IsDir else error.NotDir, |
| | 1066 | } }); |
| | 1067 | } |
| | 1068 | try input_file.setStat(m, .init(actual_stat)); |
| | 1069 | } |
| | 1070 | |
| | 1071 | if (input_file.flags.metadata_only) { |
| | 1072 | assert(stat_path_ok); |
| | 1073 | input_file.hashFromMetadata(); |
| | 1074 | return; |
| | 1075 | } |
| | 1076 | |
| | 1077 | if (input_path.contents.get()) |file_or_dir_contents| { |
| | 1078 | assert(stat_path_ok); |
| | 1079 | var hasher = hasher_init; |
| | 1080 | hasher.update(file_or_dir_contents); |
| | 1081 | hasher.final(&input_file.digest); |
| | 1082 | return; |
| | 1083 | } |
| | 1084 | |
| | 1085 | if (input_file.flags.is_directory) { |
| | 1086 | const opened_dir = if (input_path.have_handle) |
| | 1087 | input_path.handle.dir |
| | 1088 | else |
| | 1089 | parent_dir.openDir(io, file_path, .{ |
| | 1090 | .iterate = true, |
| | 1091 | .access_sub_paths = false, |
| | 1092 | }) catch |err| switch (err) { |
| | 1093 | error.Canceled => |e| return e, |
| | 1094 | else => |e| return fail(&m.diagnostic, .{ .file_open = .{ |
| | 1095 | .file_offset = file_off, |
| | 1096 | .err = e, |
| | 1097 | } }), |
| | 1098 | }; |
| | 1099 | defer if (!input_path.request_handle) opened_dir.close(io) else { |
| | 1100 | input_path.handle = .{ .dir = opened_dir }; |
| | 1101 | input_path.have_handle = true; |
| | 1102 | }; |
| | 1103 | |
| | 1104 | if (!input_path.have_stat) { |
| | 1105 | assert(!stat_path_ok); |
| | 1106 | const actual_stat = opened_dir.stat(io) catch |err| switch (err) { |
| | 1107 | error.Canceled => |e| return e, |
| | 1108 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1109 | .file_offset = file_off, |
| | 1110 | .err = e, |
| | 1111 | } }), |
| | 1112 | }; |
| | 1113 | try input_file.setStat(m, .init(actual_stat)); |
| | 1114 | } |
| | 1115 | |
| | 1116 | const dir_contents_start = m.all_input_content.items.len; |
| | 1117 | const gpa = cache.gpa; |
| | 1118 | hashDir(gpa, io, opened_dir, &input_file.digest, &m.all_input_content) catch |err| switch (err) { |
| | 1119 | error.Canceled, error.OutOfMemory => |e| return e, |
| | 1120 | else => |e| return fail(&m.diagnostic, .{ .file_read = .{ |
| | 1121 | .file_offset = file_off, |
| | 1122 | .err = e, |
| | 1123 | } }), |
| | 1124 | }; |
| | 1125 | defer if (input_path.contents.status == .requested) { |
| | 1126 | input_path.contents = .{ .populated = .{ |
| | 1127 | .off = @intCast(dir_contents_start), |
| | 1128 | .len = @intCast(m.all_input_content.items.len - dir_contents_start), |
| | 1129 | } }; |
| | 1130 | } else m.all_input_content.shrinkRetainingCapacity(dir_contents_start); |
| | 1131 | } else { |
| | 1132 | const opened_file = if (input_path.have_handle) |
| | 1133 | input_path.handle.file |
| | 1134 | else |
| | 1135 | parent_dir.openFile(io, file_path, .{ .mode = .read_only }) catch |err| switch (err) { |
| | 1136 | error.Canceled => |e| return e, |
| | 1137 | else => |e| return fail(&m.diagnostic, .{ .file_open = .{ |
| | 1138 | .file_offset = file_off, |
| | 1139 | .err = e, |
| | 1140 | } }), |
| | 1141 | }; |
| | 1142 | defer if (!input_path.request_handle) opened_file.close(io) else { |
| | 1143 | input_path.handle = .{ .file = opened_file }; |
| | 1144 | input_path.have_handle = true; |
| | 1145 | }; |
| | 1146 | |
| | 1147 | if (!input_path.have_stat) { |
| | 1148 | assert(!stat_path_ok); |
| | 1149 | const actual_stat = opened_file.stat(io) catch |err| switch (err) { |
| | 1150 | error.Canceled => |e| return e, |
| | 1151 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1152 | .file_offset = file_off, |
| | 1153 | .err = e, |
| | 1154 | } }), |
| | 1155 | }; |
| | 1156 | try input_file.setStat(m, .init(actual_stat)); |
| | 1157 | } |
| | 1158 | |
| | 1159 | hashFile(io, opened_file, &input_file.digest) catch |err| switch (err) { |
| | 1160 | error.Canceled => |e| return e, |
| | 1161 | else => |e| return fail(&m.diagnostic, .{ .file_read = .{ |
| | 1162 | .file_offset = file_off, |
| | 1163 | .err = e, |
| | 1164 | } }), |
| | 1165 | }; |
| | 1166 | |
| | 1167 | if (input_path.contents.status == .requested) @panic("TODO"); |
| 963 | } | 1168 | } |
| 964 | } | 1169 | } |
| 965 | | 1170 | |
| 966 | const CheckFileError = error{ Canceled, CacheCheckFailed }; | 1171 | /// Upon return, disk_contents digest and stat will be populated regardless of whether hit or miss occurs. |
| | 1172 | fn checkInputPath( |
| | 1173 | m: *Manifest, |
| | 1174 | file_off: File.Offset, |
| | 1175 | input_path: *InputPath, |
| | 1176 | disk_contents: []const u8, |
| | 1177 | input_contents: []const u8, |
| | 1178 | ) CheckError!CheckResult { |
| | 1179 | const cache = m.cache; |
| | 1180 | const io = cache.io; |
| | 1181 | const disk_file = file_off.get(disk_contents); |
| | 1182 | const input_file = file_off.get(input_contents); |
| | 1183 | const parent_dir = cache.prefixes()[disk_file.flags.prefix].handle; |
| | 1184 | const file_path = file_off.path(disk_contents); |
| | 1185 | |
| | 1186 | assert(disk_file.flags == input_file.flags); |
| | 1187 | |
| | 1188 | if (input_path.have_digest) { |
| | 1189 | if (mem.eql(u8, &disk_file.digest, &input_file.digest)) |
| | 1190 | return .hit; |
| | 1191 | } |
| | 1192 | |
| | 1193 | if (input_path.have_stat) { |
| | 1194 | const changed = try disk_file.setStatChanged(m, input_file.stat); |
| | 1195 | if (!changed) return .hit; |
| | 1196 | } |
| | 1197 | |
| | 1198 | if (disk_file.flags.metadata_only) { |
| | 1199 | if (!input_path.have_stat) { |
| | 1200 | // Since this is an input file, FileNotFound counts as a failure, not a cache miss. |
| | 1201 | const actual_stat = switch (input_path.getHandle(input_file)) { |
| | 1202 | .none => parent_dir.statFile(io, file_path, .{}) catch |err| switch (err) { |
| | 1203 | error.Canceled => |e| return e, |
| | 1204 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1205 | .file_offset = file_off, |
| | 1206 | .err = e, |
| | 1207 | } }), |
| | 1208 | }, |
| | 1209 | .file => |opened_file| opened_file.stat(io) catch |err| switch (err) { |
| | 1210 | error.Canceled => |e| return e, |
| | 1211 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1212 | .file_offset = file_off, |
| | 1213 | .err = e, |
| | 1214 | } }), |
| | 1215 | }, |
| | 1216 | .dir => |opened_dir| opened_dir.stat(io) catch |err| switch (err) { |
| | 1217 | error.Canceled => |e| return e, |
| | 1218 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1219 | .file_offset = file_off, |
| | 1220 | .err = e, |
| | 1221 | } }), |
| | 1222 | }, |
| | 1223 | }; |
| | 1224 | // In the other case (have_stat=true), this check is redundant since we already asserted the flags are |
| | 1225 | // identical, which contains the prefix. |
| | 1226 | const actual_is_directory = actual_stat.kind == .directory; |
| | 1227 | if (actual_is_directory != disk_file.flags.is_directory) { |
| | 1228 | // Since this is an input file, this is a failure, not a cache miss. |
| | 1229 | return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1230 | .file_offset = file_off, |
| | 1231 | .err = if (actual_is_directory) error.IsDir else error.NotDir, |
| | 1232 | } }); |
| | 1233 | } |
| | 1234 | const stat: Stat = .init(actual_stat); |
| | 1235 | const changed = try disk_file.setStatChanged(m, stat); |
| | 1236 | disk_file.hashFromMetadata(); |
| | 1237 | if (!changed) return .hit; |
| | 1238 | } |
| | 1239 | return .{ .metadata_changed = file_off }; |
| | 1240 | } |
| | 1241 | |
| | 1242 | if (input_path.contents.get()) |file_or_dir_contents| { |
| | 1243 | var hasher = hasher_init; |
| | 1244 | hasher.update(file_or_dir_contents); |
| | 1245 | hasher.final(&disk_file.digest); |
| | 1246 | |
| | 1247 | if (mem.eql(u8, &disk_file.digest, &input_file.digest)) return .hit; |
| | 1248 | return .{ .contents_changed = file_off }; |
| | 1249 | } |
| | 1250 | |
| | 1251 | if (disk_file.flags.is_directory) { |
| | 1252 | const opened_dir = if (input_path.have_handle) |
| | 1253 | input_path.handle.dir |
| | 1254 | else |
| | 1255 | parent_dir.openDir(io, file_path, .{ |
| | 1256 | .iterate = true, |
| | 1257 | .access_sub_paths = false, |
| | 1258 | }) catch |err| switch (err) { |
| | 1259 | error.Canceled => |e| return e, |
| | 1260 | else => |e| return fail(&m.diagnostic, .{ .file_open = .{ |
| | 1261 | .file_offset = file_off, |
| | 1262 | .err = e, |
| | 1263 | } }), |
| | 1264 | }; |
| | 1265 | defer if (!input_path.request_handle) opened_dir.close(io) else { |
| | 1266 | input_path.handle = .{ .dir = opened_dir }; |
| | 1267 | input_path.have_handle = true; |
| | 1268 | }; |
| | 1269 | |
| | 1270 | if (!input_path.have_stat) { |
| | 1271 | const actual_stat = opened_dir.stat(io) catch |err| switch (err) { |
| | 1272 | error.Canceled => |e| return e, |
| | 1273 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1274 | .file_offset = file_off, |
| | 1275 | .err = e, |
| | 1276 | } }), |
| | 1277 | }; |
| | 1278 | if (!try disk_file.setStatChanged(m, .init(actual_stat))) return .hit; |
| | 1279 | } |
| | 1280 | |
| | 1281 | const dir_contents_start = m.all_input_content.items.len; |
| | 1282 | const gpa = cache.gpa; |
| | 1283 | hashDir(gpa, io, opened_dir, &disk_file.digest, &m.all_input_content) catch |err| switch (err) { |
| | 1284 | error.Canceled, error.OutOfMemory => |e| return e, |
| | 1285 | else => |e| return fail(&m.diagnostic, .{ .file_read = .{ |
| | 1286 | .file_offset = file_off, |
| | 1287 | .err = e, |
| | 1288 | } }), |
| | 1289 | }; |
| | 1290 | defer if (input_path.contents.status == .requested) { |
| | 1291 | input_path.contents = .{ .populated = .{ |
| | 1292 | .off = @intCast(dir_contents_start), |
| | 1293 | .len = @intCast(m.all_input_content.items.len - dir_contents_start), |
| | 1294 | } }; |
| | 1295 | } else m.all_input_content.shrinkRetainingCapacity(dir_contents_start); |
| | 1296 | |
| | 1297 | if (mem.eql(u8, &disk_file.digest, &input_file.digest)) return .hit; |
| | 1298 | return .{ .contents_changed = file_off }; |
| | 1299 | } else { |
| | 1300 | const opened_file = if (input_path.have_handle) |
| | 1301 | input_path.handle.file |
| | 1302 | else |
| | 1303 | parent_dir.openFile(io, file_path, .{ .mode = .read_only }) catch |err| switch (err) { |
| | 1304 | error.Canceled => |e| return e, |
| | 1305 | else => |e| return fail(&m.diagnostic, .{ .file_open = .{ |
| | 1306 | .file_offset = file_off, |
| | 1307 | .err = e, |
| | 1308 | } }), |
| | 1309 | }; |
| | 1310 | defer if (!input_path.request_handle) opened_file.close(io) else { |
| | 1311 | input_path.handle = .{ .file = opened_file }; |
| | 1312 | input_path.have_handle = true; |
| | 1313 | }; |
| | 1314 | |
| | 1315 | if (!input_path.have_stat) { |
| | 1316 | const actual_stat = opened_file.stat(io) catch |err| switch (err) { |
| | 1317 | error.Canceled => |e| return e, |
| | 1318 | else => |e| return fail(&m.diagnostic, .{ .file_stat = .{ |
| | 1319 | .file_offset = file_off, |
| | 1320 | .err = e, |
| | 1321 | } }), |
| | 1322 | }; |
| | 1323 | if (!try disk_file.setStatChanged(m, .init(actual_stat))) return .hit; |
| | 1324 | } |
| 967 | | 1325 | |
| 968 | /// Runs concurrently with other `checkFile`. | 1326 | hashFile(io, opened_file, &disk_file.digest) catch |err| switch (err) { |
| 969 | fn checkFile( | 1327 | error.Canceled => |e| return e, |
| | 1328 | else => |e| return fail(&m.diagnostic, .{ .file_read = .{ |
| | 1329 | .file_offset = file_off, |
| | 1330 | .err = e, |
| | 1331 | } }), |
| | 1332 | }; |
| | 1333 | if (input_path.contents.status == .requested) @panic("TODO"); |
| | 1334 | |
| | 1335 | if (mem.eql(u8, &disk_file.digest, &input_file.digest)) return .hit; |
| | 1336 | return .{ .contents_changed = file_off }; |
| | 1337 | } |
| | 1338 | } |
| | 1339 | |
| | 1340 | fn checkDiscoveredPath( |
| 970 | m: *Manifest, | 1341 | m: *Manifest, |
| 971 | c: *Check, | | |
| 972 | file_off: File.Offset, | 1342 | file_off: File.Offset, |
| 973 | file_path: [:0]const u8, | 1343 | file_path: [:0]const u8, |
| 974 | ) CheckFileError!Check.Status { | 1344 | contents: []const u8, |
| 975 | const file = file_off.get(m.contents.items); | 1345 | ) CheckError!CheckResult { |
| | 1346 | const file = file_off.get(contents); |
| 976 | const cache = m.cache; | 1347 | const cache = m.cache; |
| 977 | const gpa = cache.gpa; | 1348 | const gpa = cache.gpa; |
| 978 | const io = cache.io; | 1349 | const io = cache.io; |
| ... | @@ -980,20 +1351,21 @@ pub const Manifest = struct { | ... | @@ -980,20 +1351,21 @@ pub const Manifest = struct { |
| 980 | | 1351 | |
| 981 | if (file.flags.metadata_only) { | 1352 | if (file.flags.metadata_only) { |
| 982 | const actual_stat = parent_dir.statFile(io, file_path, .{}) catch |err| switch (err) { | 1353 | const actual_stat = parent_dir.statFile(io, file_path, .{}) catch |err| switch (err) { |
| 983 | error.FileNotFound => return .miss, | 1354 | error.FileNotFound => return .{ .path_deleted = file_off }, |
| 984 | error.Canceled => |e| return e, | 1355 | error.Canceled => |e| return e, |
| 985 | else => |e| return c.fail(m, .{ .file_stat = .{ | 1356 | else => |e| return fail(m, .{ .file_stat = .{ |
| 986 | .file_offset = file_off, | 1357 | .file_offset = file_off, |
| 987 | .err = e, | 1358 | .err = e, |
| 988 | } }), | 1359 | } }), |
| 989 | }; | 1360 | }; |
| 990 | | 1361 | |
| 991 | const actual_is_directory = actual_stat.kind == .directory; | 1362 | const actual_is_directory = actual_stat.kind == .directory; |
| 992 | if (actual_is_directory != file.flags.is_directory) return .miss; | 1363 | if (actual_is_directory != file.flags.is_directory) return .{ .directory_status_changed = file_off }; |
| 993 | | 1364 | |
| 994 | const changed = try file.setStatChanged(m, .init(actual_stat)); | 1365 | const changed = try file.setStatChanged(m, .init(actual_stat)); |
| 995 | file.hashFromMetadata(); | 1366 | file.hashFromMetadata(); |
| 996 | return if (changed) .miss else .hit; | 1367 | if (changed) return .{ .metadata_changed = file_off }; |
| | 1368 | return .hit; |
| 997 | } | 1369 | } |
| 998 | | 1370 | |
| 999 | if (file.flags.is_directory) { | 1371 | if (file.flags.is_directory) { |
| ... | @@ -1001,9 +1373,10 @@ pub const Manifest = struct { | ... | @@ -1001,9 +1373,10 @@ pub const Manifest = struct { |
| 1001 | .iterate = true, | 1373 | .iterate = true, |
| 1002 | .access_sub_paths = false, | 1374 | .access_sub_paths = false, |
| 1003 | }) catch |err| switch (err) { | 1375 | }) catch |err| switch (err) { |
| 1004 | error.FileNotFound, error.NotDir => return .miss, | 1376 | error.FileNotFound => return .{ .path_deleted = file_off }, |
| | 1377 | error.NotDir => return .{ .directory_status_changed = file_off }, |
| 1005 | error.Canceled => |e| return e, | 1378 | error.Canceled => |e| return e, |
| 1006 | else => |e| return c.fail(m, .{ .file_open = .{ | 1379 | else => |e| return fail(m, .{ .file_open = .{ |
| 1007 | .file_offset = file_off, | 1380 | .file_offset = file_off, |
| 1008 | .err = e, | 1381 | .err = e, |
| 1009 | } }), | 1382 | } }), |
| ... | @@ -1012,32 +1385,33 @@ pub const Manifest = struct { | ... | @@ -1012,32 +1385,33 @@ pub const Manifest = struct { |
| 1012 | | 1385 | |
| 1013 | const actual_stat = opened_dir.stat(io) catch |err| switch (err) { | 1386 | const actual_stat = opened_dir.stat(io) catch |err| switch (err) { |
| 1014 | error.Canceled => |e| return e, | 1387 | error.Canceled => |e| return e, |
| 1015 | else => |e| return c.fail(m, .{ .file_stat = .{ | 1388 | else => |e| return fail(m, .{ .file_stat = .{ |
| 1016 | .file_offset = file_off, | 1389 | .file_offset = file_off, |
| 1017 | .err = e, | 1390 | .err = e, |
| 1018 | } }), | 1391 | } }), |
| 1019 | }; | 1392 | }; |
| 1020 | if (try file.setStatChanged(m, .init(actual_stat))) { | 1393 | if (try file.setStatChanged(m, .init(actual_stat))) { |
| 1021 | const prev_digest: BinDigest = file.digest; | 1394 | const prev_digest: BinDigest = file.digest; |
| 1022 | var contents: std.ArrayList(u8) = .empty; | 1395 | const dir_contents_start = m.all_input_content.items.len; |
| 1023 | defer contents.deinit(gpa); | 1396 | defer m.all_input_content.shrinkRetainingCapacity(dir_contents_start); |
| 1024 | hashDir(gpa, io, opened_dir, &file.digest, &contents) catch |err| switch (err) { | 1397 | hashDir(gpa, io, opened_dir, &file.digest, &m.all_input_contents) catch |err| switch (err) { |
| 1025 | error.Canceled => |e| return e, | 1398 | error.Canceled, error.OutOfMemory => |e| return e, |
| 1026 | else => |e| return c.fail(m, .{ .file_read = .{ | 1399 | else => |e| return fail(m, .{ .file_read = .{ |
| 1027 | .file_offset = file_off, | 1400 | .file_offset = file_off, |
| 1028 | .err = e, | 1401 | .err = e, |
| 1029 | } }), | 1402 | } }), |
| 1030 | }; | 1403 | }; |
| 1031 | | 1404 | |
| 1032 | if (!mem.eql(u8, &file.digest, &prev_digest)) return .miss; | 1405 | if (!mem.eql(u8, &file.digest, &prev_digest)) return .{ .contents_changed = file_off }; |
| 1033 | } | 1406 | } |
| 1034 | return .hit; | 1407 | return .hit; |
| 1035 | } | 1408 | } |
| 1036 | | 1409 | |
| 1037 | const opened_file = parent_dir.openFile(io, file_path, .{ .mode = .read_only }) catch |err| switch (err) { | 1410 | const opened_file = parent_dir.openFile(io, file_path, .{ .mode = .read_only }) catch |err| switch (err) { |
| 1038 | error.FileNotFound, error.IsDir => return .miss, | 1411 | error.FileNotFound => return .{ .path_deleted = file_off }, |
| | 1412 | error.IsDir => return .{ .directory_status_changed = file_off }, |
| 1039 | error.Canceled => |e| return e, | 1413 | error.Canceled => |e| return e, |
| 1040 | else => |e| return c.fail(m, .{ .file_open = .{ | 1414 | else => |e| return fail(m, .{ .file_open = .{ |
| 1041 | .file_offset = file_off, | 1415 | .file_offset = file_off, |
| 1042 | .err = e, | 1416 | .err = e, |
| 1043 | } }), | 1417 | } }), |
| ... | @@ -1046,7 +1420,7 @@ pub const Manifest = struct { | ... | @@ -1046,7 +1420,7 @@ pub const Manifest = struct { |
| 1046 | | 1420 | |
| 1047 | const actual_stat = opened_file.stat(io) catch |err| switch (err) { | 1421 | const actual_stat = opened_file.stat(io) catch |err| switch (err) { |
| 1048 | error.Canceled => |e| return e, | 1422 | error.Canceled => |e| return e, |
| 1049 | else => |e| return c.fail(m, .{ .file_stat = .{ | 1423 | else => |e| return fail(m, .{ .file_stat = .{ |
| 1050 | .file_offset = file_off, | 1424 | .file_offset = file_off, |
| 1051 | .err = e, | 1425 | .err = e, |
| 1052 | } }), | 1426 | } }), |
| ... | @@ -1056,19 +1430,25 @@ pub const Manifest = struct { | ... | @@ -1056,19 +1430,25 @@ pub const Manifest = struct { |
| 1056 | const prev_digest: BinDigest = file.digest; | 1430 | const prev_digest: BinDigest = file.digest; |
| 1057 | hashFile(io, opened_file, &file.digest) catch |err| switch (err) { | 1431 | hashFile(io, opened_file, &file.digest) catch |err| switch (err) { |
| 1058 | error.Canceled => |e| return e, | 1432 | error.Canceled => |e| return e, |
| 1059 | else => |e| return c.fail(m, .{ .file_read = .{ | 1433 | else => |e| return fail(m, .{ .file_read = .{ |
| 1060 | .file_offset = file_off, | 1434 | .file_offset = file_off, |
| 1061 | .err = e, | 1435 | .err = e, |
| 1062 | } }), | 1436 | } }), |
| 1063 | }; | 1437 | }; |
| 1064 | | 1438 | |
| 1065 | if (!mem.eql(u8, &file.digest, &prev_digest)) return .miss; | 1439 | if (!mem.eql(u8, &file.digest, &prev_digest)) return .{ .contents_changed = file_off }; |
| 1066 | } | 1440 | } |
| 1067 | | 1441 | |
| 1068 | return .hit; | 1442 | return .hit; |
| 1069 | } | 1443 | } |
| 1070 | | 1444 | |
| 1071 | /// Reset `man.hash.hasher` to the state it should be in after `check` returns `Check.Status.miss`. | 1445 | fn fail(ptr: *Diagnostic, d: Diagnostic) error{CacheCheckFailed} { |
| | 1446 | assert(ptr.* == .none); |
| | 1447 | ptr.* = d; |
| | 1448 | return error.CacheCheckFailed; |
| | 1449 | } |
| | 1450 | |
| | 1451 | /// Reset `man.hash.hasher` to the state it should be in after `check` returns `CheckResult.miss`. |
| 1072 | /// The hasher contains the original input digest, and all original input file digests (i.e. | 1452 | /// The hasher contains the original input digest, and all original input file digests (i.e. |
| 1073 | /// not including discovered files). | 1453 | /// not including discovered files). |
| 1074 | /// | 1454 | /// |
| ... | @@ -1231,7 +1611,7 @@ pub const Manifest = struct { | ... | @@ -1231,7 +1611,7 @@ pub const Manifest = struct { |
| 1231 | try populateDirectory(m, header, need_stat, handle, options.contents, metadata_only, options.diagnostic); | 1611 | try populateDirectory(m, header, need_stat, handle, options.contents, metadata_only, options.diagnostic); |
| 1232 | } else { | 1612 | } else { |
| 1233 | const dir = cache.prefixes()[prefix].handle; | 1613 | const dir = cache.prefixes()[prefix].handle; |
| 1234 | const sub_path = filePath(m.contents.items, file_offset); | 1614 | const sub_path = file_offset.path(m.contents.items); |
| 1235 | const handle = dir.openDir(io, sub_path, .{ | 1615 | const handle = dir.openDir(io, sub_path, .{ |
| 1236 | .access_sub_paths = false, | 1616 | .access_sub_paths = false, |
| 1237 | .iterate = true, | 1617 | .iterate = true, |
| ... | @@ -1250,7 +1630,7 @@ pub const Manifest = struct { | ... | @@ -1250,7 +1630,7 @@ pub const Manifest = struct { |
| 1250 | try populateFile(m, header, need_stat, handle, options.contents, metadata_only, options.diagnostic); | 1630 | try populateFile(m, header, need_stat, handle, options.contents, metadata_only, options.diagnostic); |
| 1251 | } else { | 1631 | } else { |
| 1252 | const dir = cache.prefixes()[prefix].handle; | 1632 | const dir = cache.prefixes()[prefix].handle; |
| 1253 | const sub_path = filePath(m.contents.items, file_offset); | 1633 | const sub_path = file_offset.path(m.contents.items); |
| 1254 | const handle = dir.openFile(io, sub_path, .{ .mode = .read_only }) catch |err| switch (err) { | 1634 | const handle = dir.openFile(io, sub_path, .{ .mode = .read_only }) catch |err| switch (err) { |
| 1255 | error.Canceled => |e| return e, | 1635 | error.Canceled => |e| return e, |
| 1256 | else => |e| { | 1636 | else => |e| { |
| ... | @@ -1420,18 +1800,18 @@ pub const Manifest = struct { | ... | @@ -1420,18 +1800,18 @@ pub const Manifest = struct { |
| 1420 | | 1800 | |
| 1421 | /// If `want_shared_lock` is true, this function automatically downgrades the | 1801 | /// If `want_shared_lock` is true, this function automatically downgrades the |
| 1422 | /// lock from exclusive to shared. | 1802 | /// lock from exclusive to shared. |
| 1423 | pub fn writeManifest(m: *Manifest) !void { | 1803 | pub fn finalize(m: *Manifest) !void { |
| 1424 | assert(m.have_exclusive_lock); | 1804 | assert(m.have_exclusive_lock); |
| 1425 | const io = m.cache.io; | 1805 | const io = m.cache.io; |
| 1426 | const manifest_file = m.manifest_file.?; | 1806 | const manifest_file = m.manifest_file.?; |
| 1427 | if (m.manifest_dirty) { | 1807 | if (m.dirty) { |
| 1428 | m.contents.appendAssumeCapacity(0); | 1808 | m.contents.appendAssumeCapacity(0); |
| 1429 | defer _ = m.contents.pop().?; | 1809 | defer _ = m.contents.pop().?; |
| 1430 | | 1810 | |
| 1431 | try manifest_file.setLength(io, m.contents.items.len); | 1811 | try manifest_file.setLength(io, m.contents.items.len); |
| 1432 | try manifest_file.writePositionalAll(io, m.contents.items, 0); | 1812 | try manifest_file.writePositionalAll(io, m.contents.items, 0); |
| 1433 | | 1813 | |
| 1434 | m.manifest_dirty = false; | 1814 | m.dirty = false; |
| 1435 | } | 1815 | } |
| 1436 | | 1816 | |
| 1437 | if (m.want_shared_lock) { | 1817 | if (m.want_shared_lock) { |
| ... | @@ -1473,7 +1853,7 @@ pub const Manifest = struct { | ... | @@ -1473,7 +1853,7 @@ pub const Manifest = struct { |
| 1473 | /// Obtain only the data needed to maintain a lock on the manifest file. | 1853 | /// Obtain only the data needed to maintain a lock on the manifest file. |
| 1474 | /// The `Manifest` remains safe to deinit. | 1854 | /// The `Manifest` remains safe to deinit. |
| 1475 | /// | 1855 | /// |
| 1476 | /// Don't forget to call `writeManifest` before this! | 1856 | /// Don't forget to call `finalize` before this! |
| 1477 | pub fn toOwnedLock(self: *Manifest) Lock { | 1857 | pub fn toOwnedLock(self: *Manifest) Lock { |
| 1478 | defer self.manifest_file = null; | 1858 | defer self.manifest_file = null; |
| 1479 | return .{ .manifest_file = self.manifest_file.? }; | 1859 | return .{ .manifest_file = self.manifest_file.? }; |
| ... | @@ -1496,7 +1876,7 @@ pub const Manifest = struct { | ... | @@ -1496,7 +1876,7 @@ pub const Manifest = struct { |
| 1496 | } | 1876 | } |
| 1497 | | 1877 | |
| 1498 | pub fn path(scf: *const SelfContainedFiles, file_offset: File.Offset) [:0]const u8 { | 1878 | pub fn path(scf: *const SelfContainedFiles, file_offset: File.Offset) [:0]const u8 { |
| 1499 | return filePath(scf.contents.items, file_offset); | 1879 | return file_offset.path(scf.contents.items); |
| 1500 | } | 1880 | } |
| 1501 | }; | 1881 | }; |
| 1502 | | 1882 | |
| ... | @@ -1516,7 +1896,7 @@ pub const Manifest = struct { | ... | @@ -1516,7 +1896,7 @@ pub const Manifest = struct { |
| 1516 | /// Releases the manifest file and frees any memory the Manifest was using. | 1896 | /// Releases the manifest file and frees any memory the Manifest was using. |
| 1517 | /// `Manifest.hit` must be called first. | 1897 | /// `Manifest.hit` must be called first. |
| 1518 | /// | 1898 | /// |
| 1519 | /// Don't forget to call `writeManifest` before this! | 1899 | /// Don't forget to call `finalize` before this! |
| 1520 | pub fn deinit(m: *Manifest) void { | 1900 | pub fn deinit(m: *Manifest) void { |
| 1521 | const io = m.cache.io; | 1901 | const io = m.cache.io; |
| 1522 | const gpa = m.cache.gpa; | 1902 | const gpa = m.cache.gpa; |
| ... | @@ -1544,7 +1924,7 @@ pub const Manifest = struct { | ... | @@ -1544,7 +1924,7 @@ pub const Manifest = struct { |
| 1544 | if (files.len > 0) { | 1924 | if (files.len > 0) { |
| 1545 | const contents = man.contents.items; | 1925 | const contents = man.contents.items; |
| 1546 | for (files) |file| { | 1926 | for (files) |file| { |
| 1547 | const file_path = filePath(contents, file); | 1927 | const file_path = file.path(contents); |
| 1548 | try buf.ensureUnusedCapacity(gpa, file_path.len + 2); | 1928 | try buf.ensureUnusedCapacity(gpa, file_path.len + 2); |
| 1549 | buf.appendAssumeCapacity(@as(u8, file.get(contents).flags.prefix) + 1); | 1929 | buf.appendAssumeCapacity(@as(u8, file.get(contents).flags.prefix) + 1); |
| 1550 | buf.appendSliceAssumeCapacity(file_path); | 1930 | buf.appendSliceAssumeCapacity(file_path); |
| ... | @@ -1675,22 +2055,7 @@ pub const Manifest = struct { | ... | @@ -1675,22 +2055,7 @@ pub const Manifest = struct { |
| 1675 | } | 2055 | } |
| 1676 | | 2056 | |
| 1677 | fn hashFlagsAndPath(m: *const Manifest, off: File.Offset, hasher: *Hasher) void { | 2057 | fn hashFlagsAndPath(m: *const Manifest, off: File.Offset, hasher: *Hasher) void { |
| 1678 | const contents = m.contents.items; | 2058 | hasher.update(off.flagsAndPath(m.contents.items)); |
| 1679 | const flags_off = @offsetOf(File, "flags"); | | |
| 1680 | comptime assert(@offsetOf(File, "path_start") - flags_off == 1); | | |
| 1681 | const hash_start = @backingInt(off) + flags_off; | | |
| 1682 | const hash_end = mem.findScalarPos(u8, contents, hash_start, 0).?; | | |
| 1683 | hasher.update(contents[hash_start..hash_end]); | | |
| 1684 | } | | |
| 1685 | | | |
| 1686 | pub fn filePathFallible(contents: []const u8, off: File.Offset) error{InvalidFormat}![:0]const u8 { | | |
| 1687 | const path_start = @backingInt(off) + @offsetOf(File, "path_start"); | | |
| 1688 | const path_end = mem.findScalarPos(u8, contents, path_start, 0) orelse return error.InvalidFormat; | | |
| 1689 | return contents[path_start..path_end :0]; | | |
| 1690 | } | | |
| 1691 | | | |
| 1692 | fn filePath(contents: []const u8, off: File.Offset) [:0]const u8 { | | |
| 1693 | return filePathFallible(contents, off) catch unreachable; | | |
| 1694 | } | 2059 | } |
| 1695 | }; | 2060 | }; |
| 1696 | | 2061 | |
| ... | @@ -1756,7 +2121,7 @@ test "cache file and then recall it" { | ... | @@ -1756,7 +2121,7 @@ test "cache file and then recall it" { |
| 1756 | try testing.expectEqual(.miss, try ch.check(.none)); | 2121 | try testing.expectEqual(.miss, try ch.check(.none)); |
| 1757 | | 2122 | |
| 1758 | digest1 = ch.final(); | 2123 | digest1 = ch.final(); |
| 1759 | try ch.writeManifest(); | 2124 | try ch.finalize(); |
| 1760 | } | 2125 | } |
| 1761 | { | 2126 | { |
| 1762 | var ch = cache.obtain(); | 2127 | var ch = cache.obtain(); |
| ... | @@ -1827,7 +2192,7 @@ test "check that changing a file makes cache fail" { | ... | @@ -1827,7 +2192,7 @@ test "check that changing a file makes cache fail" { |
| 1827 | | 2192 | |
| 1828 | digest1 = man.final(); | 2193 | digest1 = man.final(); |
| 1829 | | 2194 | |
| 1830 | try man.writeManifest(); | 2195 | try man.finalize(); |
| 1831 | } | 2196 | } |
| 1832 | | 2197 | |
| 1833 | try tmp.dir.writeFile(io, .{ .sub_path = temp_file, .data = updated_temp_file_contents }); | 2198 | try tmp.dir.writeFile(io, .{ .sub_path = temp_file, .data = updated_temp_file_contents }); |
| ... | @@ -1847,7 +2212,7 @@ test "check that changing a file makes cache fail" { | ... | @@ -1847,7 +2212,7 @@ test "check that changing a file makes cache fail" { |
| 1847 | | 2212 | |
| 1848 | digest2 = man.final(); | 2213 | digest2 = man.final(); |
| 1849 | | 2214 | |
| 1850 | try man.writeManifest(); | 2215 | try man.finalize(); |
| 1851 | } | 2216 | } |
| 1852 | | 2217 | |
| 1853 | try testing.expect(!mem.eql(u8, digest1[0..], digest2[0..])); | 2218 | try testing.expect(!mem.eql(u8, digest1[0..], digest2[0..])); |
| ... | @@ -1888,7 +2253,7 @@ test "no file inputs" { | ... | @@ -1888,7 +2253,7 @@ test "no file inputs" { |
| 1888 | | 2253 | |
| 1889 | digest1 = man.final(); | 2254 | digest1 = man.final(); |
| 1890 | | 2255 | |
| 1891 | try man.writeManifest(); | 2256 | try man.finalize(); |
| 1892 | } | 2257 | } |
| 1893 | { | 2258 | { |
| 1894 | var man = cache.obtain(); | 2259 | var man = cache.obtain(); |
| ... | @@ -1953,7 +2318,7 @@ test "Manifest with files added after initial hash work" { | ... | @@ -1953,7 +2318,7 @@ test "Manifest with files added after initial hash work" { |
| 1953 | _ = try ch.addDiscoveredPath(.{ .discovered_path = .{ .unresolved = .initCwd(temp_file2) } }); | 2318 | _ = try ch.addDiscoveredPath(.{ .discovered_path = .{ .unresolved = .initCwd(temp_file2) } }); |
| 1954 | | 2319 | |
| 1955 | digest1 = ch.final(); | 2320 | digest1 = ch.final(); |
| 1956 | try ch.writeManifest(); | 2321 | try ch.finalize(); |
| 1957 | } | 2322 | } |
| 1958 | { | 2323 | { |
| 1959 | var ch = cache.obtain(); | 2324 | var ch = cache.obtain(); |
| ... | @@ -1992,7 +2357,7 @@ test "Manifest with files added after initial hash work" { | ... | @@ -1992,7 +2357,7 @@ test "Manifest with files added after initial hash work" { |
| 1992 | | 2357 | |
| 1993 | digest3 = ch.final(); | 2358 | digest3 = ch.final(); |
| 1994 | | 2359 | |
| 1995 | try ch.writeManifest(); | 2360 | try ch.finalize(); |
| 1996 | } | 2361 | } |
| 1997 | | 2362 | |
| 1998 | try testing.expect(!mem.eql(u8, &digest1, &digest3)); | 2363 | try testing.expect(!mem.eql(u8, &digest1, &digest3)); |