| dirs[ino1] = mkdir(# entries, md0, # links(ino1, dirs), m1, entries), root[q].dir?, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), ino1 ∈ dirs, psynced → asynced, ¬ px(user, md0) ∨ ¬ pw(user, md0) ⊦ pre-mkdir(q + str ', md, EACCESS, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then root[q + str '] := dnode(md, ∅); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0) |
⊦ ispath(p, ino, m, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (py(user, p, tree, abs-files(files)) ↔ py(user, p, ino, dirs, files))
dirs[ino1] = mkdir(# entries, md0, # links(ino1, dirs), m1, entries), root.dir?, root[q].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), ino1 ∈ dirs, psynced → asynced, ¬ px(user, md0) ∨ ¬ pw(user, md0) ⊦ ¬ py(user, q, ROOT_INO, dirs, files) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then root[q + str '] := dnode(md, ∅); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0)
Used simplifier rules: py: ⊦ ispath(p, ino, m, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → ( py(user, p, tree, abs-files(files)) ↔ py(user, p, ino, dirs, files));%a: ⊦ (p + p0) + p1 = p + p0 + p1; from specification list[path]% ⊦ parent(p + str ') = p; (s)%⊦ pre-mkdir(p, md, EACCESS, user, root, fs, ofh) ↔ ¬ py(user, parent(p), root, fs); (s)