[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem replay-lpt

persistence_replay_lpt#(LOG, LEBSIZE, WROOTADR, WMAXINO, WLOG, WLPT, WORPHANS, WBUFLEB, AROFS; LPT, WVOL) {let N = 0 in while N < # LPT do {/* (prepost-replay-lpt : invariant N ≤ # LPT` ∧ awbuf-inv(WVOL, WBUFLEB) ∧ WBUFLEB = nobuffer ∧ LPT = replay-lpt(LPT`, LOG, N) ∧ # LPT` = # WVOL` ∧ avol-replay-lpt-unchanged(WVOL`, WVOL, LPT`, LOG) ∧ synced(WVOL) wfbound # LPT - N) */; if LPT[N].flags ≠ LP_FREE ∧ ¬ N ∈ LOG then {if LPT[N].flags = LP_INDEX_NODES then LPT[N].size := LEBSIZE; if LPT[N].ref-size = 0 then {LPT[N].flags := LP_FREE; LPT[N].size := 0; awbuf_unmap#(N, WROOTADR, WMAXINO, WLOG, WLPT, WORPHANS, WBUFLEB, AROFS; WVOL)}}; N := N + 1} }