[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 267 from proof inv-truncate-buff-none-uncached (previous step)

files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), err = ESUCCESS, ino = m0, n = m5, size = m2, afs-cons(dirs, files0[m0, mkfile(m5, md0, # links(m0, dirs), content0 upto min(m5, m2))]), afs-cons(dirs, files0), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache, dirs, files0), synced(dirs, icache, pcache), m0 ∈ files0, asynced2 → synced(files0, icache, pcache) ⊦ ⟪if ∀ key. key ∈ pcache → key.data? then pcache := truncate(ino, min(n, size), pcache) else abort; inode0 := mkinode(m0, md0, false, # links(m0, dirs), 0, m5); ino := m0; files := files0[m0, mkfile(m1, md1, # links(m0, dirs), content0 upto min(m5, m2))]; asynced4 := false; if asynced4 then pcache_set# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode0.size).meta:= inode0.meta;files[m0]).meta, false, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode0.size).meta:= inode0.meta;files[m0]).nlink, 0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode0.size).meta:= inode0.meta;files[m0]).size) ) .ino, m2 / VFS_PAGE_SIZE, none.buf, false ; err, pcache); if ¬ asynced4 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ( icache-cons (icache[m0, mkientry(false, mkinode(m0, md0, false, # links(m0, dirs), 0, m5))], dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode0.size;files[ino]).meta:= inode0.meta]) ∧ dcache-cons(dcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode0.size;files[ino]).meta:= inode0.meta]) ∧ pcache-cons(pcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode0.size;files[ino]).meta:= inode0.meta]) ∧ synced(dirs, icache[m0, mkientry(false, mkinode(m0, md0, false, # links(m0, dirs), 0, m5))], pcache) ∧ ( asynced2 → synced (files[ino, (ino ∈ files ⊃ files[ino].size:= inode0.size;files[ino]).meta:= inode0.meta], icache[m0, mkientry(false, mkinode(m0, md0, false, # links(m0, dirs), 0, m5))], pcache))), datakey(m0, m2 / VFS_PAGE_SIZE) ∈ pcache, m2 ≤ m5 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information