| # lpt0 = # avol0, # lpt2 = # avol0, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, avol0[n] = unmapped, lpt2[n0] = mklp(0, m5, LP_FREE, m6), gstore[n] = groupblock(gndx, lax, m), lpt2[n] = mklp(m, m0, LP_GROUP_NODES, m1), keyset(gch) = gc-heap(lpt2, nx + n '), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, n < # avol0, n0 < # avol0, ginval < # avol0, abs-istore(avol0, lpt2, istore), abs-leb(unmapped, groupblock(gndx, lax, m), mklp(m, m0, LP_GROUP_NODES, m1)), awbuf-inv(avol0, buffered(n)), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(false, buffered(n), lpt2, avol0), bufs-log-only(buffered(n), nx + n ', lpt2), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt2, n0 ' + nx0), inv(groupblock(gndx, lax, m)), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(nx + n ', lpt2), lpt-free-unref(lpt0), lpt-free-unref(lpt2), lpt-leb-size(lpt0), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt0, nx + n '), synced(avol0), n ∈ gstore, istore0 ⊑ istore ⊦ n = n0, dups(nx), n ∈ nx, n ∈ ginval |
⊦ abs-leb(aleb, gblock, lp) ↔ aleb.mapped? ∧ abs-nodes(aleb.data, gblock.gndlist, gblock.ladrlist, lp.size = LEB_SIZE) ∧ (lp.size ≠ LEB_SIZE → lp.size = # aleb.data)
Used simplifier rules: ⊦ groupblock(gndx, lax, m).gndlist = gndx; (s)% ⊦ groupblock(gndx, lax, m).ladrlist = lax; (s)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ ¬ unmapped.mapped?; (s) Used terms: mklp(m, m0, LP_GROUP_NODES, m1), groupblock(gndx, lax, m), unmapped