| (ino = ino1 ⊃ mkdir(m0, md2, # links(ino1, dirs0), m3, entries0 -- str);mkdir(m5, md3, # links(ino, dirs0), m7, entries2)) = mkdir(m, md, m2, m4, entries), dirs0[ino] = mkdir(m5, md3, # links(ino, dirs0), m7, entries2), dirs0[ino1] = mkdir(m0 + 1, md2, # links(ino1, dirs0), m3, entries0), files[entries0[str]] = mkfile(m1, md0, # links(entries0[str], dirs0), content), dirs = dirs0[ino1, mkdir(m0, md2, # links(ino1, dirs0), m3, entries0 -- str)][ino, mkdir(m + 1, md, m2, m4, entries[str0, entries0[str]])], 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, md3), pw(user, md2), px(user, md3), px(user, md2), px-parent(user, q0, ROOT_INO, dirs0, files), px-parent(user, q, ROOT_INO, dirs0, files), str ∈ entries0, ino1 ∈ dirs0, entries0[str] ∈ files, ino ∈ dirs0, ¬ entries0[str] ∈ dirs0, ¬ str0 ∈ entries2, ¬ q + str ' ⊑ q0 + str0 ', ino = ino1 → md3 = md2, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_inode_sync#(mkinode(ino1, md2, true, # links(ino1, dirs0), m3, m0 + 1); dirs, files); afs_inode_sync#(mkinode(ino, md3, true, # links(ino, dirs0), m7, m5); 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)) |
(ino = ino1 ⊃ mkdir(m0, md2, # links(ino1, dirs0), m3, entries0 -- str);mkdir(m5, md3, # links(ino, dirs0), m7, entries2)) = mkdir(m, md, m2, m4, entries), files[entries0[str]] = mkfile(m1, md0, # links(entries0[str], dirs0), content), dirs0[ino1] = mkdir(m0 + 1, md2, # links(ino1, dirs0), m3, entries0), dirs0[ino] = mkdir(m5, md3, # links(ino, dirs0), m7, entries2), dirs = dirs0[ino1, mkdir(m0, md2, # links(ino1, dirs0), m3, entries0 -- str)][ino, mkdir(m + 1, md, m2, m4, entries[str0, entries0[str]])], inode = mkinode(ino1, md2, true, # links(ino1, dirs0), m3, m0 + 1), 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, md2), pw(user, md3), px(user, md2), px(user, md3), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), ino ∈ dirs0, entries0[str] ∈ files, ino1 ∈ dirs0, str ∈ entries0, ino = ino1 → md3 = md2, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO ⊦ [let ino = inode.ino in if ino ∈ files then {files[ino].size := inode.size; files[ino].meta := inode.meta} else if ino ∈ dirs then dirs[ino].meta := inode.meta; afs_inode_sync#(mkinode(ino, md3, true, # links(ino, dirs0), m7, m5); 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)), entries0[str] ∈ dirs0, str0 ∈ entries2, q + str ' ⊑ q0 + str0 '
Used simplifier rules: afs_inode_sync#(INODE; DIRS, FILES) {let INO = INODE.ino in if INO ∈ FILES then {FILES[INO].size := INODE.size; FILES[INO].meta := INODE.meta} else if INO ∈ DIRS then DIRS[INO].meta := INODE.meta };