| # links(m3, cache_dirs) = cache_dirs[m3].nlink, # links(m, cache_dirs) = cache_dirs[m].nlink, asynced1 ↔ false, asynced0 ↔ false, cache_files[entries0[str]] = mkfile(m1, md3, # links(entries0[str], cache_dirs), content0), cache_dirs[m] = mkdir(cache_dirs[m].size, md4, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m9, md2, # links(entries0[str], cache_dirs), content), cache_dirs[m3] = mkdir(cache_dirs[m3].size, md5, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, entries0), entries0[str] = cache_dirs[m3].entries[str], dirs = dirs0[old_ino, dirs0[old_ino].size:= (dirs0[old_ino].size - 1)], dirs0 = cache_dirs[old_ino, cache_dirs[old_ino].entries:= (cache_dirs[old_ino].entries -- mkdentry(str, entries0[str]).name)], new_ino = m, old_dent = mkdentry(str, entries0[str]), old_ino = m3, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries0, m ∈ cache_dirs, entries0[str] ∈ cache_files, m3 ∈ cache_dirs, str ∈ cache_dirs[m3].entries, dirs0[old_ino].size ≥ 1, ⌊err0⌋ , m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ (err0 = err ∧ (asynced ↔ asynced2)), old_dent.dentry?, str0 ∈ cache_dirs[m].entries, str0 ∈ entries |
Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ (ad.entries:= entries).size = ad.size; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ mkdentry(str, m).name = str; (s)