| # links(ino1, dirs) = dirs[ino1].nlink, # links(ino0, dirs) = m2, files[entries0[str]] = mkfile(m0, md3, # links(entries0[str], dirs), content1), dirs[ino0] = mkdir(m, md2, m2, m3, entries1), dirs[ino1] = mkdir(dirs[ino1].size, md0, dirs[ino1].nlink, dirs[ino1].nsubdirs, entries0), files[entries1[str0]] = mkfile(m1, md1, # links(entries1[str0], dirs), content), entries1[str0] = entries[str0], entries0[str] = dirs[ino1].entries[str], dirs[ino0] = mkdir(m, md, m2, m3, entries), err = ESUCCESS, new_dent = mkdentry(str0, entries1[str0]), new_inode = mkinode(ino0, md2, true, m2, m3, m), old_dent = mkdentry(str, entries0[str]), old_dent_inode = mkinode(entries0[str], md3, false, # links(entries0[str], dirs), 0, m0), old_inode = mkinode(ino1, md0, true, dirs[ino1].nlink, dirs[ino1].nsubdirs, dirs[ino1].size), p_inode = mkinode(entries1[str0], md1, false, # links(entries1[str0], dirs), 0, m1), dom of < ino2, afs-cons(dirs, files), ispath(q0, ROOT_INO, ino0, dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pw(user, md0), pw(user, md2), px(user, md2), px(user, md0), px-parent(user, q0, ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), str0 ∈ entries1, entries1[str0] ∈ files, ino1 ∈ dirs, entries0[str] ∈ files, ino0 ∈ dirs, str ∈ entries0, str0 ∈ entries, str ∈ dirs[ino1].entries, ino0 = ino1 → md2 = md0, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_rename#(; old_inode, new_inode, old_dent_inode, p_inode, old_dent, new_dent, err, dirs, files; asynced)] (afs-cons(dirs, files) → ⟪vfs_put_inode#(p_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))), entries1[str0] ∈ dirs, entries0[str] ∈ dirs, q + str ' ⊑ q0 + str0 ' |
# links(ino1, dirs) = dirs[ino1].nlink, entries0[str] = dirs[ino1].entries[str], files[entries[str0]] = mkfile(m1, md1, # links(entries[str0], dirs), content), dirs[ino1] = mkdir(dirs[ino1].size, md0, dirs[ino1].nlink, dirs[ino1].nsubdirs, entries0), dirs[ino0] = mkdir(m, md, # links(ino0, dirs), m3, entries), files[entries0[str]] = mkfile(m0, md3, # links(entries0[str], dirs), content1), err = ESUCCESS, new_dent = mkdentry(str0, entries[str0]), new_inode = mkinode(ino0, md, true, # links(ino0, dirs), m3, m), old_dent = mkdentry(str, entries0[str]), old_dent_inode = mkinode(entries0[str], md3, false, # links(entries0[str], dirs), 0, m0), old_inode = mkinode(ino1, md0, true, dirs[ino1].nlink, dirs[ino1].nsubdirs, dirs[ino1].size), p_inode = mkinode(entries[str0], md1, false, # links(entries[str0], dirs), 0, m1), dom of < ino2, afs-cons(dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), ispath(q0, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pw(user, md), pw(user, md0), px(user, md0), px(user, md), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, q0, ROOT_INO, dirs, files), str ∈ dirs[ino1].entries, str ∈ entries0, ino0 ∈ dirs, entries0[str] ∈ files, ino1 ∈ dirs, entries[str0] ∈ files, str0 ∈ entries, ¬ entries0[str] ∈ dirs, ¬ entries[str0] ∈ dirs, ¬ q + str ' ⊑ q0 + str0 ', ino0 = ino1 → md = md0, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, dirs) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ [afs_rename#(; old_inode, new_inode, old_dent_inode, p_inode, old_dent, new_dent, err, dirs, files; asynced)] (afs-cons(dirs, files) → ⟪vfs_put_inode#(p_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)))
Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)