| # lpt1 = # avol, # lpt0 = # avol, lpt1[n0] = mklp(0, m1, LP_FREE, m2), err = err0, keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, n0 < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), 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, lpt0, log1), synced(avol), istore0 ⊑ istore, pstate = unbuffered → bleb = nobuffer, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore, pstate ≠ unbuffered → bleb = buffered(pstate.lnum), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip or avol[n0] := unmapped; n := n0; freelist := n0 ' + nx0; if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr0, m, avol, lpt0, ns0, pstate = readonly; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; log0 := log1; if err = ESUCCESS then {lpt1[n].flags := LP_GROUP_NODES; log0 := log0 + n '}⟫ ⟨pstate0 := pstate; apersistence_allocate_gnd#(adr0, istore, istore0, gstore0, m, ns0, true; ginval, gstore, log1, pstate; err1)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ log1 = log0 ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err1), err = ESUCCESS, pstate = readonly, dups(log1) |
# lpt0 = # avol, # lpt1 = # avol, lpt1[n0] = mklp(0, m1, LP_FREE, m2), err = err0, keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, n0 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), 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), synced(avol), istore0 ⊑ istore, pstate ≠ unbuffered → bleb = buffered(pstate.lnum), pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate = unbuffered → bleb = nobuffer, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip; n := n0; freelist := n0 ' + nx0; if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr0, m, avol, lpt0, ns0, pstate = readonly; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; log0 := log1; if err = ESUCCESS then {lpt1[n].flags := LP_GROUP_NODES; log0 := log0 + n '}⟫ ⟨pstate0 := pstate; apersistence_allocate_gnd#(adr0, istore, istore0, gstore0, m, ns0, true; ginval, gstore, log1, pstate; err1)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ log1 = log0 ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err1), err = ESUCCESS, pstate = readonly, dups(log1)
# lpt0 = # avol, # lpt1 = # avol, lpt1[n0] = mklp(0, m1, LP_FREE, m2), err = err0, keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, n0 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), 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), synced(avol), istore0 ⊑ istore, pstate ≠ unbuffered → bleb = buffered(pstate.lnum), pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate = unbuffered → bleb = nobuffer, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪avol[n0] := unmapped; n := n0; freelist := n0 ' + nx0; if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr0, m, avol, lpt0, ns0, pstate = readonly; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; log0 := log1; if err = ESUCCESS then {lpt1[n].flags := LP_GROUP_NODES; log0 := log0 + n '}⟫ ⟨pstate0 := pstate; apersistence_allocate_gnd#(adr0, istore, istore0, gstore0, m, ns0, true; ginval, gstore, log1, pstate; err1)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ log1 = log0 ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err1), err = ESUCCESS, pstate = readonly, dups(log1)