| # links(entries1[str0], dirs0) = m8 + 1, (ino0 = ino1 ⊃ mkdir(m, md3, # links(ino1, dirs0), m4, entries0 -- str);mkdir(m0, md2, # links(ino0, dirs0), m5, entries1)) = mkdir(m3, md, m6, m7, entries), files0[entries0[str]] = mkfile(m1, md1, # links(entries0[str], dirs0), content), dirs0[ino0] = mkdir(m0, md2, # links(ino0, dirs0), m5, entries1), dirs0[ino1] = mkdir(m + 1, md3, # links(ino1, dirs0), m4, entries0), files0[entries1[str0]] = mkfile(m2, md0, m8 + 1, content0), dirs = dirs1[ino, dirs1[ino].meta:= inode.meta], dirs1 = dirs0 [ino1, (ino1 = ino0 ⊃ mkdir(m3, md, m6, m7, entries[str0, entries0[str]]);mkdir(m, md3, # links(ino1, dirs0), m4, entries0 -- str)).meta:= md3 ] [ino0, (ino0 = ino1 ⊃ mkdir(m3, md3, m6, m7, entries[str0, entries0[str]]);mkdir(m3, md, m6, m7, entries[str0, entries0[str]])).meta:= md2 ], files = files0[entries1[str0], mkfile(m2, md0, m8, content0)], ino = inode.ino, inode = mkinode(entries1[str0], md0, false, # links(entries1[str0], dirs0), 0, m2), dom of < ino2, afs-cons(dirs0, files0), ispath(q0, ROOT_INO, ino0, dirs0, files0), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), pw(user, md3), pw(user, md2), px(user, md2), px(user, md3), px-parent(user, q0, ROOT_INO, dirs0, files0), px-parent(user, q, ROOT_INO, dirs0, files0), ino0 ∈ dirs0, str0 ∈ entries1, ino1 ∈ dirs0, entries1[str0] ∈ files0, entries0[str] ∈ files0, str ∈ entries0, ino ∈ dirs1, ino0 = ino1 → md2 = md3, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [new_child_inode := (entries1[str0] ∈ dirs ⊃ mkinode(entries1[str0], dirs[entries1[str0]].meta, true, dirs[entries1[str0]].nlink, dirs[entries1[str0]].nsubdirs, dirs[entries1[str0]].size) ;mkinode(entries1[str0], files[entries1[str0]].meta, false, files[entries1[str0]].nlink, 0, files[entries1[str0]].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))), entries0[str] ∈ dirs0, entries1[str0] ∈ dirs0, ino ∈ files, q + str ' ⊑ q0 + str0 ', ino1 = ino0 ∧ mkdentry(str0, entries1[str0]) = mkdentry(str, entries0[str]) |
Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)