| # links(entries1[str], dirs0) = files[entries1[str]].nlink, # links(ino0, dirs0) = dirs0[ino0].nlink, # links(ino1, dirs0) = dirs0[ino1].nlink, # links(entries[str0], dirs0) = files[entries[str0]].nlink, entries1[str] = dirs0[ino1].entries[str], entries[str0] = dirs0[ino0].entries[str0], files[entries1[str]] = mkfile(m0, md3, files[entries1[str]].nlink, content1), dirs0[ino0] = mkdir(dirs0[ino0].size, md, dirs0[ino0].nlink, dirs0[ino0].nsubdirs, entries), dirs0[ino1] = mkdir(dirs0[ino1].size, md2, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, entries1), files[entries[str0]] = mkfile(m1, md1, files[entries[str0]].nlink, content), dirs = dirs0[ino1, (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)] [ino0, (ino0 = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1);dirs0[ino0]) .entries:= (ino0 = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1);dirs0[ino0]).entries [str0, entries1[str] ] ], dirs0[ino1].size ≠ 0, dom of < ino2, afs-cons(dirs0, files), ispath(q0, ROOT_INO, ino0, dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs0, files), pw(user, md2), pw(user, md), px(user, md), px(user, md2), px-parent(user, q0, ROOT_INO, dirs0, files), px-parent(user, q, ROOT_INO, dirs0, files), str ∈ dirs0[ino1].entries, str0 ∈ dirs0[ino0].entries, str0 ∈ entries, entries[str0] ∈ files, ino1 ∈ dirs0, entries1[str] ∈ files, ino0 ∈ dirs0, str ∈ entries1, 1 ≤ dirs0[ino1].size, ¬ entries[str0] ∈ dirs0, ¬ entries1[str] ∈ dirs0, ¬ q + str ' ⊑ q0 + str0 ', ino0 = ino1 → md = md2, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_drop_nlink#(mkdentry(str0, entries[str0]).ino; dirs, files); old_dent := mkdentry(str, entries1[str]); isdir0 := true; if ¬ isdir0 then {dirs[ino0].size := dirs[ino0].size + 1; if old_dent.ino ∈ dirs then dirs[ino0].nsubdirs := dirs[ino0].nsubdirs + 1}; new_dent := mkdentry(mkdentry(str0, entries[str0]).name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(ino1, md2, true, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, dirs0[ino1].size); dirs, files); afs_inode_sync#(mkinode(ino0, md, true, # links(ino0, dirs0), dirs0[ino0].nsubdirs, dirs0[ino0].size); dirs, files); new_child_inode := mkinode(entries[str0], md1, false, # links(entries[str0], dirs0), 0, m1); if isdir0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, files[new_child_inode.ino].meta, false, files[new_child_inode.ino].nlink, 0, files[new_child_inode.ino].size) )}; 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 := (ino0 ∈ dirs ⊃ mkinode(ino0, dirs[ino0].meta, true, dirs[ino0].nlink, dirs[ino0].nsubdirs, dirs[ino0].size) ;mkinode(ino0, files[ino0].meta, false, files[ino0].nlink, 0, files[ino0].size) ); err := ESUCCESS; asynced := ?] (afs-cons(dirs, files) → ⟪vfs_put_inode#(new_child_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))), ino1 = ino0 ∧ mkdentry(str0, entries[str0]) = mkdentry(str, entries1[str]) |
# links(entries[str0], dirs0) = files[entries[str0]].nlink, # links(ino1, dirs0) = dirs0[ino1].nlink, # links(ino0, dirs0) = dirs0[ino0].nlink, # links(entries1[str], dirs0) = files[entries1[str]].nlink, dirs0[ino1].size = m + 1, files[entries[str0]] = mkfile(m1, md1, files[entries[str0]].nlink, content), dirs0[ino1] = mkdir(dirs0[ino1].size, md2, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, entries1), dirs0[ino0] = mkdir(dirs0[ino0].size, md, dirs0[ino0].nlink, dirs0[ino0].nsubdirs, entries), files[entries1[str]] = mkfile(m0, md3, files[entries1[str]].nlink, content1), entries[str0] = dirs0[ino0].entries[str0], entries1[str] = dirs0[ino1].entries[str], dirs = dirs0[ino1, (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= m] [ino0, (ino0 = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= m;dirs0[ino0]) .entries:= (ino0 = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= m;dirs0[ino0]).entries[str0, entries1[str]] ], dom of < ino2, afs-cons(dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), ispath(q0, ROOT_INO, ino0, dirs0, files), of-cons(of, dirs0, files), pw(user, md), pw(user, md2), px(user, md2), px(user, md), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), str ∈ entries1, ino0 ∈ dirs0, entries1[str] ∈ files, ino1 ∈ dirs0, entries[str0] ∈ files, str0 ∈ entries, str0 ∈ dirs0[ino0].entries, str ∈ dirs0[ino1].entries, 1 ≤ dirs0[ino1].size, ino0 = ino1 → md = md2, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ [afs_drop_nlink#(mkdentry(str0, entries[str0]).ino; dirs, files); old_dent := mkdentry(str, entries1[str]); isdir0 := true; if ¬ isdir0 then {dirs[ino0].size := dirs[ino0].size + 1; if old_dent.ino ∈ dirs then dirs[ino0].nsubdirs := dirs[ino0].nsubdirs + 1}; new_dent := mkdentry(mkdentry(str0, entries[str0]).name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(ino1, md2, true, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, dirs0[ino1].size); dirs, files); afs_inode_sync#(mkinode(ino0, md, true, # links(ino0, dirs0), dirs0[ino0].nsubdirs, dirs0[ino0].size); dirs, files); new_child_inode := mkinode(entries[str0], md1, false, # links(entries[str0], dirs0), 0, m1); if isdir0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, files[new_child_inode.ino].meta, false, files[new_child_inode.ino].nlink, 0, files[new_child_inode.ino].size) )}; 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 := (ino0 ∈ dirs ⊃ mkinode(ino0, dirs[ino0].meta, true, dirs[ino0].nlink, dirs[ino0].nsubdirs, dirs[ino0].size) ;mkinode(ino0, files[ino0].meta, false, files[ino0].nlink, 0, files[ino0].size) ); err := ESUCCESS; asynced := ?] (afs-cons(dirs, files) → ⟪vfs_put_inode#(new_child_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))), dirs0[ino1].size = 0, entries[str0] ∈ dirs0, entries1[str] ∈ dirs0, q + str ' ⊑ q0 + str0 ', ino1 = ino0 ∧ mkdentry(str0, entries[str0]) = mkdentry(str, entries1[str])
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: dirs0[ino1].size, m