| isdir ↔ old_ino = new_ino ∧ new_dent = old_dent, isdir0 ↔ new_dent.dentry?, dirs0[ino] = mkdir(m0, md1, # links(ino, dirs0), m2, entries1), dirs0[ino1] = mkdir(m1, md, # links(ino1, dirs0), m4, entries), files[entries[str]] = mkfile(m, md2, # links(entries[str], dirs0), content0), dirs = dirs3[new_ino, dirs3[new_ino].size:= (dirs3[new_ino].size + 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[new_ino, dirs2[new_ino].entries:= dirs2[new_ino].entries[new_dent.name, old_dent.ino]], err = ESUCCESS, ¬ isdir, ¬ isdir0, new_child_inode = new_dent_inode, new_dent = negdentry(str0), new_dent_inode = mkinode(entries[str], md2, false, # links(entries[str], dirs0), 0, m), new_ino = new_parent_inode.ino, new_inode = mkinode(ino, md1, true, # links(ino, dirs0), m2, m0), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = mkdentry(str, entries[str]), old_dent_inode = mkinode(entries[str], md2, false, # links(entries[str], dirs0), 0, m), old_ino = old_parent_inode.ino, old_inode = mkinode(ino1, md, true, # links(ino1, dirs0), m4, m1), old_parent_inode = old_inode, old_dent.dentry?, dom of < ino2, afs-cons(dirs0, files), ispath(q0, ROOT_INO, ino, dirs0, files), ispath(q, ROOT_INO, ino1, 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, md1), pw(user, md), px(user, md1), px(user, md), px-parent(user, q0, ROOT_INO, dirs0, files), px-parent(user, q, ROOT_INO, dirs0, files), str ∈ entries, ino1 ∈ dirs0, entries[str] ∈ files, ino ∈ dirs0, dirs1[old_ino].size ≥ 1, ino = ino1 → md1 = md, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = 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)), old_dent.ino ∈ dirs, entries[str] ∈ dirs0, str0 ∈ entries1, old_dent.ino ∈ dirs2, q + str ' ⊑ q0 + str0 ', isdir0 ∧ ¬ isdir |
# links(entries[str], dirs0) = files[entries[str]].nlink, # links(ino, dirs0) = dirs0[ino].nlink, # links(ino1, dirs0) = dirs0[ino1].nlink, entries[str] = dirs0[ino1].entries[str], dirs0[ino] = mkdir(dirs0[ino].size, md1, dirs0[ino].nlink, dirs0[ino].nsubdirs, entries1), dirs0[ino1] = mkdir(dirs0[ino1].size, md, dirs0[ino1].nlink, dirs0[ino1].nsubdirs, entries), files[entries[str]] = mkfile(m, md2, files[entries[str]].nlink, content0), dirs = dirs0[ino1, (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1)] [ino, ( (ino = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1);dirs0[ino]) .entries:= (ino = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1);dirs0[ino]).entries [str0, entries[str] ]) .size:= ((ino = ino1 ⊃ (dirs0[ino1].entries:= (dirs0[ino1].entries -- str)).size:= (dirs0[ino1].size - 1);dirs0[ino]).size + 1) ], dirs0[ino1].size ≠ 0, dom of < ino2, afs-cons(dirs0, files), ispath(q0, ROOT_INO, ino, dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs0, files), pw(user, md1), pw(user, md), px(user, md1), px(user, md), px-parent(user, q0, ROOT_INO, dirs0, files), px-parent(user, q, ROOT_INO, dirs0, files), str ∈ dirs0[ino1].entries, str ∈ entries, ino1 ∈ dirs0, entries[str] ∈ files, ino ∈ dirs0, 1 ≤ dirs0[ino1].size, ¬ str0 ∈ entries1, ¬ entries[str] ∈ dirs0, ¬ str0 ∈ dirs0[ino].entries, ¬ q + str ' ⊑ q0 + str0 ', ino = ino1 → md1 = md, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = 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, md1, 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: afs-cons-file-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n, content) → # links(ino, dirs) = n; (forward) from specification afs-base%afs-cons-dir-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) → # links(ino, dirs) = n; (forward) from specification afs-base%not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat%⊦ getinode(ino, dirs, files) = (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) ); (s)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)%⊦ valid-file-inode(inode, dirs, files) ↔ valid-file-ino(inode.ino, dirs, files) ∧ inode.nlink = files[inode.ino].nlink ∧ inode.nsubdirs = 0 ∧ ¬ inode.directory; (s)%⊦ valid-wb-inode(inode, dirs, files) ↔ valid-dir-inode(inode, dirs, files) ∨ valid-file-inode(inode, dirs, files); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)%⊦ valid-dir-inode(inode, dirs, files) ↔ valid-dir-ino(inode.ino, dirs, files) ∧ inode.nlink = dirs[inode.ino].nlink ∧ inode.size = dirs[inode.ino].size ∧ inode.nsubdirs = dirs[inode.ino].nsubdirs ∧ inode.directory; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)% ⊦ negdentry(str).negdentry?; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)%⊦ valid-negdentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ ¬ dent.name ∈ dirs[ino].entries ∧ dent.negdentry?; (s)%⊦ pre-rename (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) ↔ ( valid-negdentry(new_parent_inode.ino, new_dent, dirs, files) ∨ valid-dentry(new_parent_inode.ino, new_dent, dirs, files) ∧ valid-wb-inode(new_child_inode, dirs, files) ∧ new_child_inode.ino = new_dent.ino ∧ ( valid-file-ino(new_dent.ino, dirs, files) ↔ valid-file-ino(old_dent.ino, dirs, files)) ∧ ( valid-dir-ino(new_dent.ino, dirs, files) → new_dent.ino ≠ ROOT_INO ∧ dir-empty(new_dent.ino, dirs, files))) ∧ valid-dentry(old_parent_inode.ino, old_dent, dirs, files) ∧ valid-dir-inode(old_parent_inode, dirs, files) ∧ valid-dir-inode(new_parent_inode, dirs, files) ∧ ( new_parent_inode.ino = old_parent_inode.ino → new_parent_inode.meta = old_parent_inode.meta) ∧ valid-wb-inode(old_child_inode, dirs, files) ∧ old_child_inode.ino = old_dent.ino; (s)% ⊦ 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)% ⊦ 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)