| # lpt0 = # avol, # lpt1 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, isbuf ↔ isbuf1, avol[n] = mapped(buf), lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), gstore[n] = groupblock(gndx1, lax, m0), adr = adr0, ax = ax0, gndx = gndx0, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt1, nx + n '), log = nx + n ', maxino = m, ns = ns0, pstate = journal(n), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore1) = istore1, ginval ∩ elems nx = ∅, n < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore2), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore2), inv(istore1), inv(groupblock(gndx1, lax, m0)), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore, istore1 ⊑ istore2, ⌊err⌋ , m1 + gndx0.flashsize ≤ LEB_SIZE → m1 = # buf, isbuf1 → synced(avol) ⊦ ⟨choose lax, err with (⌊err⌋ ∨ err = ESUCCESS) ∧ ¬ dups(gstore[pstate.lnum].ladrlist + lax) ∧ # lax ≤ # gndx ∧ inv-flashsize(prefixn(# lax, gndx), lax) ∧ (err = ESUCCESS ↔ # lax = # gndx) in {ax := lax.to-adr(pstate.lnum), err0 := err; gstore[pstate.lnum].gndlist := gstore[pstate.lnum].gndlist + prefixn(# lax, gndx); gstore[pstate.lnum].ladrlist := gstore[pstate.lnum].ladrlist + lax; if err0 ≠ ESUCCESS then ax := ?, pstate := readonly}; isbuf := ?⟩ (abs-gstore(avol, lpt1, gstore, ginval) ∧ (isbuf → synced(avol)) ∧ pstate = readonly ∧ ax1 = ax ∧ err = err0), gndx0 = [], dups(nx), n ∈ nx, n ∈ ginval |
# lpt1 = # avol, # lpt0 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, isbuf ↔ isbuf1, gstore[n] = groupblock(gndx1, lax0, m0), lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), avol[n] = mapped(buf), adr = adr0, ax = ax0, gndx = gndx0, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt1, nx + n '), log = nx + n ', maxino = m, ns = ns0, pstate = journal(n), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, ginval < # avol, n < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore2), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx1, lax0, m0)), inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol), m1 + gndx0.flashsize ≤ LEB_SIZE → m1 = # buf ⊦ ∃ lax, err. (⌊err⌋ ∨ err = ESUCCESS → pstate.lnum ∈ gstore ∧ (pstate.index? ∨ pstate.journal?)) ∧ ( (⌊err⌋ ∨ err = ESUCCESS) ∧ ¬ dups(gstore[pstate.lnum].ladrlist + lax) ∧ # lax ≤ # gndx ∧ inv-flashsize(prefixn(# lax, gndx), lax) ∧ (err = ESUCCESS ↔ # lax = # gndx)) ∧ ⟨ax := lax.to-adr(pstate.lnum), err0 := err; gstore[pstate.lnum].gndlist := gstore[pstate.lnum].gndlist + prefixn(# lax, gndx); gstore[pstate.lnum].ladrlist := gstore[pstate.lnum].ladrlist + lax; if err0 ≠ ESUCCESS then ax := ?, pstate := readonly; isbuf := ?⟩ (abs-gstore(avol, lpt1, gstore, ginval) ∧ (isbuf → synced(avol)) ∧ pstate = readonly ∧ ax1 = ax ∧ err1 = err0), gndx0 = [], dups(nx), n ∈ ginval, n ∈ nx