[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 12 from proof inv-truncate (previous step)

files[m] = mkfile(m1, md1, # links(m, dirs), content0), inode = mkinode(m, md, false, # links(m, dirs), 0, m2), old_ino = 0, old_ino0 = 0, afs-cons(dirs, files), m ∈ files, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪afs_truncate_internal#(n, m2 / VFS_PAGE_SIZE; inode, buf-opt, old_ino0, old_ino, asynced0, err, dirs, files; asynced)⟫ afs-cons(dirs, files)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 13:
files[m] = mkfile(m1, md1, # links(m, dirs), content0), inode = mkinode(m, md, false, # links(m, dirs), 0, m2), old_ino = 0, old_ino0 = 0, pageno = m2 / VFS_PAGE_SIZE, afs-cons(dirs, files), m ∈ files, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪ let ino = inode.ino, content = files[inode.ino].content, buf = ? in {old_ino0 := inode.size % VFS_PAGE_SIZE, old_ino := min(n, inode.size); asynced0 := inode.size ≤ n ∧ old_ino0 ≠ 0 ∧ (pageno ∈ content ∨ buf-opt.some?); if asynced0 then {if buf-opt.some? then buf := buf-opt.buf else buf := files[ino].content[pageno]; buf := fill(buf, zero, old_ino0, VFS_PAGE_SIZE - old_ino0); content[pageno] := buf; buf-opt := some(buf)}; files[ino].content := content upto old_ino; let new_inode = inode in {new_inode.size := n; afs_inode_sync#(new_inode; dirs, files)}; inode := getinode(inode.ino, dirs, files); err := ESUCCESS} or fail#(; ; err); asynced := ?⟫ afs-cons(dirs, files), VFS_PAGE_SIZE = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: truncate-internal: ⊦ ;% ⊦ VFS_PAGE_SIZE ≠ 0; (s)