| isdir ↔ old_ino = new_ino ∧ new_dent = old_dent, isdir0 ↔ new_dent.dentry?, dirs0[entries[str]] = mkdir(m0, md1, # links(entries[str], dirs0), m3, entries1), dirs0[ino1] = mkdir(m2, md, # links(ino1, dirs0), m5, entries), dirs0[ino] = mkdir(m, md2, # links(ino, dirs0), m1, entries2), dirs = dirs4[new_ino, dirs4[new_ino].nsubdirs:= (dirs4[new_ino].nsubdirs + 1)], 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] ], dirs4 = dirs3[new_ino, dirs3[new_ino].size:= (dirs3[new_ino].size + 1)], err = ESUCCESS, ¬ isdir, ¬ isdir0, new_child_inode = new_dent_inode, new_dent = negdentry(str0), new_dent_inode = mkinode(entries[str], md1, true, # links(entries[str], dirs0), m3, m0), new_ino = new_parent_inode.ino, new_inode = mkinode(ino, md2, true, # links(ino, dirs0), m1, m), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = mkdentry(str, entries[str]), old_dent_inode = mkinode(entries[str], md1, true, # links(entries[str], dirs0), m3, m0), old_ino = old_parent_inode.ino, old_inode = mkinode(ino1, md, true, # links(ino1, dirs0), m5, m2), old_parent_inode = old_inode, old_dent.dentry?, dom of < ino2, afs-cons(dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), ispath(q0, ROOT_INO, ino, dirs0, files), of-cons(of, dirs0, files), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs0, files), pw(user, md), pw(user, md1), pw(user, md2), px(user, md), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), old_dent.ino ∈ dirs2, ino ∈ dirs0, ino1 ∈ dirs0, entries[str] ∈ dirs0, str ∈ entries, old_dent.ino ∈ dirs4, dirs1[old_ino].size ≥ 1, dirs2[old_ino].nsubdirs ≥ 1, ino = ino1 → md2 = md, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO ⊦ [afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if isdir0 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 := ?] (afs-cons(dirs, files) → ⟪skip⟫ of-cons(of, dirs, files)), entries[str] = ROOT_INO, str0 ∈ entries2, q + str ' ⊑ q0 + str0 ', isdir0 ∧ ¬ isdir |
# links(entries[str], dirs0) = dirs0[entries[str]].nlink, # links(ino, dirs0) = dirs0[ino].nlink, # links(ino1, dirs0) = dirs0[ino1].nlink, entries[str] = dirs0[ino1].entries[str], dirs0[entries[str]] = mkdir(dirs0[entries[str]].size, md1, dirs0[entries[str]].nlink, dirs0[entries[str]].nsubdirs, entries1), dirs0[ino1] = mkdir(dirs0[ino1].size, md, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, entries), dirs0[ino] = mkdir(dirs0[ino].size, md2, dirs0[ino].nlink, dirs0[ino].nsubdirs, entries2), dirs = dirs0[ino1, ((dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)).nsubdirs:= (dirs0[ino1].nsubdirs - 1)] [ino, ( ( (ino = ino1 ⊃ ((dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)) .nsubdirs:= (dirs0[ino1].nsubdirs - 1) ;dirs0[ino] ) .entries:= (ino = ino1 ⊃ ((dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)) .nsubdirs:= (dirs0[ino1].nsubdirs - 1) ;dirs0[ino] ) .entries [str0, entries[str] ]) .size:= ( (ino = ino1 ⊃ ((dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)) .nsubdirs:= (dirs0[ino1].nsubdirs - 1) ;dirs0[ino] ) .size + 1)) .nsubdirs:= ( (ino = ino1 ⊃ ((dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)).nsubdirs:= (dirs0[ino1].nsubdirs - 1) ;dirs0[ino] ) .nsubdirs + 1) ], entries[str] ≠ ROOT_INO, dom of < ino2, afs-cons(dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), ispath(q0, ROOT_INO, ino, dirs0, files), of-cons(of, dirs0, files), pw(user, md), pw(user, md1), pw(user, md2), px(user, md), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), str ∈ dirs0[ino1].entries, ino ∈ dirs0, ino1 ∈ dirs0, str ∈ entries, entries[str] ∈ dirs0, 1 ≤ dirs0[ino1].size, 1 ≤ dirs0[ino1].nsubdirs, ¬ str0 ∈ dirs0[ino].entries, ¬ str0 ∈ entries2, ¬ q + str ' ⊑ q0 + str0 ', ino = ino1 → md2 = md, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO ⊦ [afs_inode_sync#(mkinode(ino1, md, true, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, dirs0[ino1].size); dirs, files); afs_inode_sync#(mkinode(ino, md2, true, # links(ino, dirs0), dirs0[ino].nsubdirs, dirs0[ino].size); dirs, files); skip; old_inode := (ino1 ∈ dirs ⊃ mkinode(ino1, dirs[ino1].meta, true, dirs[ino1].nlink, dirs[ino1].nsubdirs, dirs[ino1].size) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); new_inode := (ino ∈ dirs ⊃ mkinode(ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); err := ESUCCESS; asynced := ?] (afs-cons(dirs, files) → ⟪skip⟫ of-cons(of, dirs, files))
Used simplifier rules: ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ mkdentry(str, m) ≠ negdentry(str0); (s)% ⊦ ¬ negdentry(str).dentry?; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ negdentry(str).name = str; (s)% ⊦ (ad.entries:= entries).nsubdirs = ad.nsubdirs; (s)% ⊦ (ad.size:= m).nsubdirs = ad.nsubdirs; (s)% ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (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)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)