| isdir ↔ old_ino = new_ino ∧ new_dent = old_dent, isdir0 ↔ new_dent.dentry?, files[entries1[str]] = mkfile(m0, md3, # links(entries1[str], dirs0), content1), dirs0[ino0] = mkdir(m, md, # links(ino0, dirs0), m3, entries), dirs0[ino1] = mkdir(m2, md2, # links(ino1, dirs0), m5, entries1), files[entries[str0]] = mkfile(m1, md1, # links(entries[str0], dirs0), content), dirs = dirs2[new_ino, dirs2[new_ino].entries:= dirs2[new_ino].entries[new_dent.name, old_dent.ino]], 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)], err = ESUCCESS, ino = new_dent.ino, ¬ isdir, isdir0, new_child_inode = p_inode, new_dent = mkdentry(str0, entries[str0]), new_ino = new_parent_inode.ino, new_inode = mkinode(ino0, md, true, # links(ino0, dirs0), m3, m), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = mkdentry(str, entries1[str]), old_dent_inode = mkinode(entries1[str], md3, false, # links(entries1[str], dirs0), 0, m0), old_ino = old_parent_inode.ino, old_inode = mkinode(ino1, md2, true, # links(ino1, dirs0), m5, m2), old_parent_inode = old_inode, p_inode = mkinode(entries[str0], md1, false, # links(entries[str0], dirs0), 0, m1), new_dent.dentry?, old_dent.dentry?, 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), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, 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), str0 ∈ entries, entries[str0] ∈ files, ino1 ∈ dirs0, entries1[str] ∈ files, ino0 ∈ dirs0, str ∈ entries1, dirs1[old_ino].size ≥ 1, ino0 = ino1 → md = md2, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_drop_nlink#(ino; dirs, files); if ¬ isdir0 then {dirs[new_ino].size := dirs[new_ino].size + 1; if old_dent.ino ∈ dirs then dirs[new_ino].nsubdirs := dirs[new_ino].nsubdirs + 1}; 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 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) → ⟪vfs_put_inode#(new_child_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))), entries[str0] ∈ dirs0, entries1[str] ∈ dirs0, old_dent.ino ∈ dirs2, q + str ' ⊑ q0 + str0 ' |
# 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])
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)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (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).nlink = m0; (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-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)%⊦ valid-wb-inode(inode, dirs, files) ↔ valid-dir-inode(inode, dirs, files) ∨ valid-file-inode(inode, dirs, files); (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)% ⊦ ¬ mkdentry(str, m).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).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (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)