| # links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, files -- ino = files1, files[ino].nlink = 0, ESUCCESS = ESUCCESS, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs = dirs1, err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), fs = fs0, ino = inode.ino, inode = getinode(entries0[str], dirs1, files), root0[q].dir?, root0.dir?, (root0 -- (q + str ')).dir?, dom of < ino0, abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0, ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files1), fids-cons(root0, abs-files(files0), abs-of(of)), fids-cons(root0 -- (q + str '), fs0, abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files1), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, ino1 ∈ dirs0, entries0[str] ∈ files0, ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ entries0 = ∅, fs0 = abs-files(files1), root0[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs1, entries0[str] ∈ dirs0, ino ∈ dirs |
⊦ ⌜n⌝ ∈ tree.fids ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) → n ∈ files
# entries0 = m0 + 1, # links(entries0[str], dirs0) = 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, 1, content0), root0[q].dir?, root0.dir?, (root0 -- (q + str ')).dir?, dom of < ino0, abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0, ROOT_INO)(dirs0), afs-cons(dirs1, files0 -- entries0[str]), afs-cons(dirs0, files0), fids-cons(root0, abs-files(files0), abs-of(of)), fids-cons(root0 -- (q + str '), abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files0 -- entries0[str]), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, ino1 ∈ dirs0, entries0[str] ∈ files0, ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ abs-files(files0) = abs-files(files0 -- entries0[str]), entries0 = ∅, root0[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs1, entries0[str] ∈ dirs0
Used simplifier rules: fid-file: ⊦ ⌜n⌝ ∈ tree.fids ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) → n ∈ files;%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%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%ino ∈ files ⊦ files[ino, af] -- ino = files -- ino; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) ∧ str ∈ entries ∧ afs-cons(dirs, files) → (entries[str] ∈ files ↔ ¬ entries[str] ∈ dirs); (ss)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)%⊦ 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)