| # lpt1 = # avol, # lpt0 = # avol, isbuf ↔ false, isbuf1 ↔ true, EB_PAGE_SIZE = # buf1 + # buf % EB_PAGE_SIZE, lpt1[n] = mklp(m3, # buf, lpf, m4), avol[n] = mapped(buf), bleb1 = buffered(n), buf0 = buf1, err = err0, keyset(gch) = gc-heap(lpt1, log0), m = buffered(n).leb, m0 = EB_PAGE_SIZE - lpt1[buffered(n).leb].size % EB_PAGE_SIZE, n0 = # buf1, buffered(n).isbuf?, n < # avol, buffered(n).leb < # lpt1, abs-padding(buf1), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), log0, lpt1), freelist-cons(lpt1, freelist), is-aligned(# buf, 2 * NODE_HEADER_SIZE), log-group-block(log0, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log0), # buf ≤ LEB_SIZE, # buf + # buf1 ≤ LEB_SIZE, EB_PAGE_SIZE ≥ lpt1[buffered(n).leb].size % EB_PAGE_SIZE, ∀ n. (n ≠ 0 → n < n0 → avol[m].mapped? ∧ m < # avol) ∧ ¬(n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE)), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + m0, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb1, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb1)), EB_PAGE_SIZE = 0, buf1 = mkbuf(0), err = ESUCCESS, lpf = LP_FREE, is-aligned(# buf, EB_PAGE_SIZE) |
# lpt0 = # avol, # lpt1 = # avol, isbuf1 ↔ true, isbuf ↔ false, EB_PAGE_SIZE = # buf1 + # buf % EB_PAGE_SIZE, avol[n] = mapped(buf), lpt1[n] = mklp(m3, # buf, lpf, m4), bleb1 = buffered(n), buf0 = buf1, err = err0, keyset(gch) = gc-heap(lpt1, log0), m = buffered(n).leb, m0 = EB_PAGE_SIZE - lpt1[buffered(n).leb].size % EB_PAGE_SIZE, n0 = # buf1, buffered(n).isbuf?, buffered(n).leb < # lpt1, n < # avol, abs-padding(buf1), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), log0, lpt1), freelist-cons(lpt1, freelist), is-aligned(# buf, 2 * NODE_HEADER_SIZE), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), # buf + # buf1 ≤ LEB_SIZE, # buf ≤ LEB_SIZE, EB_PAGE_SIZE ≥ lpt1[buffered(n).leb].size % EB_PAGE_SIZE, ∀ n. (n ≠ 0 → n < n0 → avol[m].mapped? ∧ m < # avol) ∧ ¬(n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE)), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb1, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb1)), EB_PAGE_SIZE = 0, buf1 = mkbuf(0), err = ESUCCESS, lpf = LP_FREE, is-aligned(# buf, EB_PAGE_SIZE)