[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 43 from proof eq-io-truncate (previous step)

# buf-opt.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n1 + m2 % VFS_PAGE_SIZE, files1[m, mkfile(n0, md, m1, content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n1)] upto m2)] = files0, files1[m] = mkfile(m0, md0, m1, content0), dirs = dirs1, inode = mkinode(m, md, false, m1, 0, m2), pageno = 0, pageno0 = 0, some(fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n1)) = buf-opt0, m2 % VFS_PAGE_SIZE ≠ 0, buf-opt.some?, m ∈ files1, m2 ≤ n0 ⊦ ⟨afs_truncate_internal#(n0, m2 / VFS_PAGE_SIZE; inode, buf-opt, pageno0, pageno, boolvar, err, dirs, files1; asynced)⟩ ( buf-opt = buf-opt0 ∧ inode = (m ∈ dirs1 ⊃ mkinode(m, dirs1[m].meta, true, dirs1[m].nlink, dirs1[m].nsubdirs, dirs1[m].size) ;mkinode(m, files0[m].meta, false, files0[m].nlink, 0, files0[m].size) ) ∧ boolvar ∧ err = ESUCCESS ∧ dirs = dirs1 ∧ files1 = files0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 44:
# buf-opt.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n1 + m2 % VFS_PAGE_SIZE, files1[m] = mkfile(m0, md0, m1, content0), files1[m, mkfile(n0, md, m1, content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n1)] upto m2)] = files0, dirs = dirs1, files = files1, inode = mkinode(m, md, false, m1, 0, m2), n = n0, pageno = 0, pageno0 = 0, pageno1 = m2 / VFS_PAGE_SIZE, some(fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n1)) = buf-opt0, buf-opt.some?, m ∈ files1, m2 ≤ n0 ⊦ ⟨ let ino = inode.ino, content = files[inode.ino].content, buf = ? in {pageno0 := inode.size % VFS_PAGE_SIZE, pageno := min(n, inode.size); boolvar := inode.size ≤ n ∧ pageno0 ≠ 0 ∧ (pageno1 ∈ content ∨ buf-opt.some?); if boolvar then {if buf-opt.some? then buf := buf-opt.buf else buf := files[ino].content[pageno1]; buf := fill(buf, zero, pageno0, VFS_PAGE_SIZE - pageno0); content[pageno1] := buf; buf-opt := some(buf)}; files[ino].content := content upto pageno; 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 := ?⟩ ( buf-opt = buf-opt0 ∧ inode = (m ∈ dirs1 ⊃ mkinode(m, dirs1[m].meta, true, dirs1[m].nlink, dirs1[m].nsubdirs, dirs1[m].size) ;mkinode(m, files0[m].meta, false, files0[m].nlink, 0, files0[m].size) ) ∧ boolvar ∧ err = ESUCCESS ∧ dirs = dirs1 ∧ files = files0), m2 % VFS_PAGE_SIZE = 0, VFS_PAGE_SIZE = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_truncate_internal# (N, PAGENO ; INODE, PBUF-OPT, OFFSET, SIZE, MODIFIED, ERR, DIRS, FILES ; ASYNCED ) { let INO = INODE.ino, CONTENT = FILES[INODE.ino].content, PBUF = ? in {OFFSET := INODE.size % VFS_PAGE_SIZE, SIZE := min(N, INODE.size); MODIFIED := INODE.size ≤ N ∧ OFFSET ≠ 0 ∧ (PAGENO ∈ CONTENT ∨ PBUF-OPT.some?); if MODIFIED then {if PBUF-OPT.some? then PBUF := PBUF-OPT.buf else PBUF := FILES[INO].content[PAGENO]; PBUF := fill(PBUF, zero, OFFSET, VFS_PAGE_SIZE - OFFSET); CONTENT[PAGENO] := PBUF; PBUF-OPT := some(PBUF)}; FILES[INO].content := CONTENT upto SIZE; 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 := ? };% ⊦ VFS_PAGE_SIZE ≠ 0; (s)