| # links(entries0[str], dirs0) = 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, 1, content0), root0.dir?, root0[q].dir?, dom of < ino0, abs(root0, ROOT_INO)(dirs0), abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0 -- (q + str '), ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files0 -- entries0[str]), fids-cons(root0, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs1, files0 -- entries0[str]), of-cons(of, dirs0, files0), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), ino1 ∈ dirs0, str ∈ entries0, entries0[str] ∈ files0, ROOT_INO ∈ dirs0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, ∀ ino. ⌜ino⌝ ∈ (root0 -- (q + str ')).fids → ino ∈ files0 ⊦ # links(ino1, dirs0) = 0, entries0 = ∅, ino1 = ROOT_INO, links(ino1, dirs0) = ∅, root0[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs1, ino1 ∈ dirs1, entries0[str] ∈ dirs0, ∃ psynced. (root0 -- (q + str ')).dir? ∧ fids-cons(root0 -- (q + str '), abs-files(files0), abs-of(of)) → abs-files(files0) = abs-files(files0 -- entries0[str]) ∧ (psynced → asynced) |
⊦ ispath(p, ino, m, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → p ∈ tree ∧ (tree[p].dir? ↔ m ∈ dirs)
⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) ∧ m ∈ dirs ∧ dirs[m] = mkdir(m0, md, n0, n1, entries) ∧ str ∈ entries → (entries[str] ∈ dirs ↔ tree[p + str '].dir?)
⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files))
# links(entries0[str], dirs0) = 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, 1, content0), (root0 -- (q + str ')).dir?, root0.dir?, root0[q].dir?, (root0 -- (q + str '))[q].dir?, dom of < ino0, abs(root0, ROOT_INO)(dirs0), abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0 -- (q + str '), ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files0 -- entries0[str]), fids-cons(root0 -- (q + str '), abs-files(files0), abs-of(of)), fids-cons(root0, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs1, files0 -- entries0[str]), of-cons(of, dirs0, files0), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), ino1 ∈ dirs0, str ∈ entries0, entries0[str] ∈ files0, ROOT_INO ∈ dirs0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, ∀ ino. ⌜ino⌝ ∈ (root0 -- (q + str ')).fids → ino ∈ files0 ⊦ # links(ino1, dirs0) = 0, abs-files(files0) = abs-files(files0 -- entries0[str]), entries0 = ∅, ino1 = ROOT_INO, links(ino1, dirs0) = ∅, root0[q + str '].dir?, (root0 -- (q + str '))[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs1, ino1 ∈ dirs1, entries0[str] ∈ dirs0
Used simplifier rules: path-in: ⊦ ispath(p, ino, m, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → p ∈ tree ∧ (tree[p].dir? ↔ m ∈ dirs);%dir-entry: ⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) ∧ m ∈ dirs ∧ dirs[m] = mkdir(m0, md, n0, n1, entries) ∧ str ∈ entries → (entries[str] ∈ dirs ↔ tree[p + str '].dir?);%path-in-eq: ⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files));% ⊦ ispath(p, n, m, dirs, files) → ispath(p, n, dirs, files); (s)