[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 339 from proof refine-link (previous step)

fs[ri[dentrykey(ino1, str)]].ino = fs[ri[dentrykey(ino2, str)]].ino, fs[ri[inodekey(fs[ri[dentrykey(ino2, str)]].ino)]] = inodenode(key1, md2, false, m3, 0, m5), fs[ri[dentrykey(ino0, str)]] = dentrynode(key, fs[ri[dentrykey(ino2, str)]].ino), fs[ri[inodekey(m)]] = inodenode(key0, md1, true, m0, m1, m2), c_inode = p_inode1, dirs = abs-dirs(fs, ri), err = err1, files = abs-files(fs, ri), new_dent = old_dent0, old_dent = mkdentry(str, fs[ri[dentrykey(ino2, str)]].ino), old_dent0 = negdentry(str0), p_inode = p_inode0, p_inode0 = mkinode(m, md, true, m0, m1, m2), p_inode1 = mkinode(fs[ri[dentrykey(ino2, str)]].ino, md0, false, m3, 0, m6), fs[ri[dentrykey(ino2, str)]].dentry?, fs[ri[inodekey(ino2)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(ino0)]].directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ri[dentrykey(ino2, str)] ∈ fs, dentrykey(ino0, str) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, dentrykey(ino2, str) ∈ ri, inodekey(ino1) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(ino0) ∈ ri, ri[inodekey(fs[ri[dentrykey(ino2, str)]].ino)] ∈ fs, inodekey(fs[ri[dentrykey(ino2, str)]].ino) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, inodekey(ino2) ∈ ri, ⌊err0⌋ , asynced → boolvar0, m3 ≠ 0 ∨ fs[ri[dentrykey(ino2, str)]].ino = ROOT_INO, fs[ri[inodekey(ino2)]].nlink ≠ 0 ∨ ino2 = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, m0 ≠ 0 ∨ m = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, links(fs[ri[dentrykey(ino2, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino2, str)]].ino = ROOT_INO ⊦ ⟨if pre-link(p_inode, c_inode, old_dent, new_dent, dirs, files) then { let p_ino = p_inode.ino in {dirs[p_ino].entries[new_dent.name] := old_dent.ino; dirs[p_ino].size := dirs[p_ino].size + 1; let ino = old_dent.ino in afs_inc_nlink#(ino; dirs, files); new_dent := mkdentry(new_dent.name, old_dent.ino); afs_inode_sync#(p_inode; dirs, files); afs_inode_sync#(c_inode; dirs, files); p_inode := getinode(p_inode.ino, dirs, files); c_inode := getinode(old_dent.ino, dirs, files); err := ESUCCESS} or fail#(; ; err); asynced := ?} else abort⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, m0, m1, m2) = p_inode ∧ mkinode(fs[ri[dentrykey(ino2, str)]].ino, md0, false, m3, 0, m6) = c_inode ∧ negdentry(str0) = new_dent ∧ err0 = err), fs[ri[dentrykey(ino2, str)]].ino = 0, m = 0, dentrykey(m, str0) ∈ ri, m3 = 0 ∧ fs[ri[dentrykey(ino2, str)]].ino ≠ ROOT_INO, m0 = 0 ∧ m ≠ ROOT_INO, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information