| # lpt0 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, avol[m1] = mapped(buf0), lpt1[m1] = mklp(m4, # buf0, LP_INDEX_NODES, m2), istore[m1] = indexblock(indx, lax, m4), keyset(gch) = gc-heap(lpt1, log1), pstate = index(m1), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, m1 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore2, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol, buffered(m1)), awbuf-inv(avol[m1, mapped(buf0 + buf1)], buffered(m1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m1), lpt1, avol), bufs-log-only(buffered(m1), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore1), freelist-cons(lpt1, freelist), inv(indexblock(indx, lax, m4)), inv(gstore2 \ ginval), inv(gstore1), inv(istore), inv(istore0), log-group-block(log1, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), lpt-ram-flash(lpt1[m1, mklp(m4, # buf0 + # buf1, LP_INDEX_NODES, m2)], lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, ¬ dups(log1), isbuf1 → synced(avol) ⊦ ∃ m, err. (¬ @(pstate.lnum, m, # buf1) ∈ istore ∧ err = ESUCCESS ∨ ⌊err⌋ ) ∧ ⟨adr := @(pstate.lnum, m, # buf1), err0 := err; if err0 = ESUCCESS then {istore[pstate.lnum].indlist := istore[pstate.lnum].indlist + ind '; istore[pstate.lnum].ladrlist := istore[pstate.lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-istore (avol[pstate.lnum, mapped(avol[pstate.lnum].data + buf1)], lpt1 [pstate.lnum, mklp(lpt1[pstate.lnum].ref-size, lpt1[pstate.lnum].size + # buf1, lpt1[pstate.lnum].flags, lpt1[pstate.lnum].gcheapidx) ], istore) ∧ (isbuf1 → is-aligned(# avol[pstate.lnum].data + # buf1, EB_PAGE_SIZE)) ∧ pstate ≠ unbuffered ∧ pstate ≠ readonly ∧ m1 = pstate.lnum ∧ @(pstate.lnum, lpt1[pstate.lnum].size, # buf1) = adr ∧ ESUCCESS = err0) |
# lpt1 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt0 = # avol, istore[m1] = indexblock(indx, lax, m4), lpt1[m1] = mklp(m4, # buf0, LP_INDEX_NODES, m2), avol[m1] = mapped(buf0), keyset(gch) = gc-heap(lpt1, log1), pstate = index(m1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore1) = gstore1, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, ginval < # avol, m1 < # avol, abs-gstore(avol, lpt1, gstore2, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol[m1, mapped(buf0 + buf1)], buffered(m1)), awbuf-inv(avol, buffered(m1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m1), lpt1, avol), bufs-log-only(buffered(m1), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore1), freelist-cons(lpt1, freelist), inv(istore0), inv(istore), inv(gstore1), inv(gstore2 \ ginval), inv(indexblock(indx, lax, m4)), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1[m1, mklp(m4, # buf0 + # buf1, LP_INDEX_NODES, m2)], lpt0, log1), lpt-ram-flash(lpt1, lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, isbuf1 → synced(avol) ⊦ (¬ @(pstate.lnum, # buf0, # buf1) ∈ istore ∧ ESUCCESS = ESUCCESS ∨ ⌊ESUCCESS⌋ ) ∧ ⟨adr := @(pstate.lnum, # buf0, # buf1), err0 := ESUCCESS; if err0 = ESUCCESS then {istore[pstate.lnum].indlist := istore[pstate.lnum].indlist + ind '; istore[pstate.lnum].ladrlist := istore[pstate.lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-istore (avol[pstate.lnum, mapped(avol[pstate.lnum].data + buf1)], lpt1 [pstate.lnum, mklp(lpt1[pstate.lnum].ref-size, lpt1[pstate.lnum].size + # buf1, lpt1[pstate.lnum].flags, lpt1[pstate.lnum].gcheapidx) ], istore) ∧ (isbuf1 → is-aligned(# avol[pstate.lnum].data + # buf1, EB_PAGE_SIZE)) ∧ pstate ≠ unbuffered ∧ pstate ≠ readonly ∧ m1 = pstate.lnum ∧ @(pstate.lnum, lpt1[pstate.lnum].size, # buf1) = adr ∧ ESUCCESS = err0), dups(log1)
Used terms: # buf0, ESUCCESS