[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 commit

btree_commit#(MAXINO0, RT; OS0, ADRT, ZH, ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED; ERR) {if dom remove-refsize0(GSTORE) ∩ GINVAL = ∅ ∧ PSTATE = unbuffered ∧ ADRT = ROOTADR then {ERR := ESUCCESS; let ADR = ADRT, DONE = false in {if RT ≠ null ∧ ZH[RT].dirty then {apersistence_allocate_ind#(ROOTADR, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSYNCED; ISTORE, PSTATE; ERR); if ERR = ESUCCESS then btree_commit_rec#(RT, ROOTADR, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS; ADR, ERR, ZH, ISTORE, PSTATE, PSYNCED); if ERR = ESUCCESS then {DONE := true; apersistence_sync#(ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS; PSTATE, PSYNCED; ERR)}}; if ERR = ESUCCESS then apersistence_commit#(ADR, MAXINO0, PSYNCED; OS0, ISTORE, GINVAL, GSTORE, ROOTADR, ISTORE0, GSTORE0, NL, MAXINO, OS; PSTATE, ERR); if ERR = ESUCCESS then ADRT := ADR else if DONE then {ZH[RT].dirty := true; let SIZE = 0 in {apersistence_get_iblock_refsize# (ADR.lnum, ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED; ; SIZE); apersistence_set_iblock_refsize# (ADR.lnum, SIZE - ADR.size, ROOTADR, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED; ISTORE)}}}} else abort }