[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 201 from proof inv-renam (previous step)

dirs[ino] = mkdir(m1, md1, # links(ino, dirs), m5, entries1), dirs[ino1] = mkdir(m0, md0, # links(ino1, dirs), m3, entries0), dirs[entries0[str]] = mkdir(m, md, # links(entries0[str], dirs), m2, entries), dent = mkdentry(str0, entries1[str0]), err = ESUCCESS, entries0[str] ≠ ROOT_INO, dom of < ino2, afs-cons(dirs, files), ispath(q0, ROOT_INO, ino, dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pw(user, md1), pw(user, md), pw(user, md0), px(user, md0), px(user, md1), px-parent(user, q0, ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries0, entries0[str] ∈ dirs, ino1 ∈ dirs, ino ∈ dirs, str0 ∈ entries1, ¬ q + str ' ⊑ q0 + str0 ', links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟪afs_lookup#(ino, dirs, files, asynced; dent, err); p_inode := mkinode(entries0[str], md, true, # links(entries0[str], dirs), m2, m); isdir := true; if err = ESUCCESS then {afs_iget#(dent.ino, dirs, files, asynced; p_inode, err); if err = ESUCCESS then {isdir := p_inode.directory; if isdir then if p_inode.ino = ROOT_INO then err := EACCESS else if p_inode.size ≠ 0 then err := ENOTEMPTY}}; isdir1 := true; isdir0 := isdir; if isdir1 ∧ ¬ isdir0 then err := ENOTDIR; if ¬ isdir1 ∧ isdir0 then err := EISDIR; 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) ); new_dent := dent; new_dent_inode := p_inode; if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then let dent = new_dent in {old_inode := (ino1 ∈ dirs ⊃ mkinode(ino1, md0, true, # links(ino1, dirs), m3, m0) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); old_dent := mkdentry(str, entries0[str]); old_dent_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent, new_dent, err, dirs, files; asynced); if dent.dentry? then vfs_put_inode#(new_dent_inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 202:
dirs[entries0[str]] = mkdir(m, md, # links(entries0[str], dirs), m2, entries), dirs[ino1] = mkdir(m0, md0, # links(ino1, dirs), m3, entries0), dirs[ino] = mkdir(m1, md1, # links(ino, dirs), m5, entries1), dent = mkdentry(str0, entries1[str0]), err = ESUCCESS, p_ino = ino, dom of < ino2, afs-cons(dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), ispath(q0, ROOT_INO, ino, dirs, files), of-cons(of, dirs, files), pw(user, md0), pw(user, md), pw(user, md1), px(user, md1), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, q0, ROOT_INO, dirs, files), str0 ∈ entries1, ino ∈ dirs, ino1 ∈ dirs, entries0[str] ∈ dirs, str ∈ entries0, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ⟪if pre-lookup(p_ino, dent, dirs, files) then { if dent.name ∈ dirs[p_ino].entries then {dent := mkdentry(dent.name, dirs[p_ino].entries[dent.name]); err := ESUCCESS} else {dent := negdentry(dent.name); err := ENOENT} or fail#(; ; err)} else abort; p_inode := mkinode(entries0[str], md, true, # links(entries0[str], dirs), m2, m); isdir := true; if err = ESUCCESS then {afs_iget#(dent.ino, dirs, files, asynced; p_inode, err); if err = ESUCCESS then {isdir := p_inode.directory; if isdir then if p_inode.ino = ROOT_INO then err := EACCESS else if p_inode.size ≠ 0 then err := ENOTEMPTY}}; isdir1 := true; isdir0 := isdir; if isdir1 ∧ ¬ isdir0 then err := ENOTDIR; if ¬ isdir1 ∧ isdir0 then err := EISDIR; 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) ); new_dent := dent; new_dent_inode := p_inode; if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then let dent = new_dent in {old_inode := (ino1 ∈ dirs ⊃ mkinode(ino1, md0, true, # links(ino1, dirs), m3, m0) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); old_dent := mkdentry(str, entries0[str]); old_dent_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent, new_dent, err, dirs, files; asynced); if dent.dentry? then vfs_put_inode#(new_dent_inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), entries0[str] = ROOT_INO, q + str ' ⊑ q0 + str0 '

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_lookup#(P_INO, DIRS, FILES, ASYNCED; DENT, ERR) {if pre-lookup(P_INO, DENT, DIRS, FILES) then { if DENT.name ∈ DIRS[P_INO].entries then {DENT := mkdentry(DENT.name, DIRS[P_INO].entries[DENT.name]); ERR := ESUCCESS} else {DENT := negdentry(DENT.name); ERR := ENOENT} or fail#(; ; ERR)} else abort };