| # links(m3, cache_dirs) = m12, # links(entries[str0], cache_dirs) = m1, # links(m, cache_dirs) = m9, # links(entries1[str], cache_dirs) = m16, asynced0 ↔ old_ino = new_ino ∧ new_dent = old_dent, asynced1 ↔ new_dent.dentry?, cache_dirs[m3] = mkdir(m6, md4, # links(m3, cache_dirs), m11, entries), cache_dirs[m] = mkdir(m4, md7, # links(m, cache_dirs), m7, entries1), cache_dirs[entries1[str]] = mkdir(m2, md6, # links(entries1[str], cache_dirs), m13, ∅), cache_dirs[entries[str0]] = mkdir(m5, md3, # links(entries[str0], cache_dirs), m14, entries2), afs_dirs = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, ¬ asynced0, ¬ asynced1, dirs = dirs3[new_ino, dirs3[new_ino].size:= (dirs3[new_ino].size + 1)], dirs0 = cache_dirs, dirs1 = dirs0[old_ino, dirs0[old_ino].entries:= (dirs0[old_ino].entries -- old_dent.name)], dirs2 = dirs1[old_ino, dirs1[old_ino].size:= (dirs1[old_ino].size - 1)], dirs3 = dirs2[old_ino, dirs2[old_ino].nsubdirs:= (dirs2[old_ino].nsubdirs - 1)] [new_ino, dirs2[old_ino, dirs2[old_ino].nsubdirs:= (dirs2[old_ino].nsubdirs - 1)][new_ino] .entries:= dirs2[old_ino, dirs2[old_ino].nsubdirs:= (dirs2[old_ino].nsubdirs - 1)][new_ino].entries[new_dent.name, old_dent.ino] ], err = err0, files = cache_files, new_child_inode = mkinode(entries1[str], md1, true, # links(entries1[str], cache_dirs), m13, m2), new_dent = mkdentry(str, entries1[str]), new_ino = new_parent_inode.ino, new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m7, m4), old_child_inode = mkinode(entries[str0], md2, true, # links(entries[str0], cache_dirs), m14, m5), old_dent = mkdentry(str0, entries[str0]), old_ino = old_parent_inode.ino, old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m11, m6), old_dent.dentry?, 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), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs0, files), synced(cache_dirs, cache_icache, cache_pcache), old_dent.ino ∈ dirs2, m3 ∈ cache_dirs, m ∈ cache_dirs, entries[str0] ∈ cache_dirs, entries1[str] ∈ cache_dirs, str0 ∈ entries, str ∈ entries1, dirs1[old_ino].size ≥ 1, dirs2[old_ino].nsubdirs ≥ 1, m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if asynced1 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := getinode(new_child_inode.ino, dirs, files)}; old_parent_inode := getinode(old_parent_inode.ino, dirs, files); new_parent_inode := getinode(new_parent_inode.ino, dirs, files); err := ESUCCESS; asynced := ?; if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, cache_icache); icache_set#(new_parent_inode, asynced; err, cache_icache); if mkdentry(str, entries1[str]).dentry? then icache_set#(new_child_inode, asynced; err, cache_icache); dcache_delete#(old_parent_inode.ino, old_dent.name; err, cache_dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, cache_dcache)}] ( icache-cons(cache_icache, dirs, files) ∧ dcache-cons(cache_dcache, dirs, files) ∧ pcache-cons(cache_pcache, dirs, files) ∧ afs-cons(dirs, files) ∧ synced(dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(files, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries1[str]); old_dent0 := mkdentry(str0, entries[str0]); new_parent_inode0 := mkinode(m, md, true, m9, m7, m4); old_parent_inode0 := mkinode(m3, md0, true, m12, m11, m6); new_child_inode0 := mkinode(entries1[str], md1, true, m16, m13, m2); old_child_inode0 := mkinode(entries[str0], md2, true, m1, m14, m5); afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, afs_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ afs_dirs = dirs ∧ afs_files = (files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), entries1[str] = ROOT_INO, old_dent.ino ∈ dirs, asynced1 ∧ ¬ asynced0 |
Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ (ad.entries:= entries).size = ad.size; (s)% ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (s)% ⊦ (ad.size:= m).nsubdirs = ad.nsubdirs; (s)% ⊦ (ad.entries:= entries).nsubdirs = ad.nsubdirs; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkdentry(str, m).dentry?; (s)