| apebs[n2] = mkpeb(aehdr, avhdr, buf1, 0, false), buf0 = buf, n = n1, n0 = n2, n1 = align↑(datasize(buf, n1), EB_PAGE_SIZE), avhdr.valid?, aehdr.valid?, n2 < # apebs, ubi-io-inv(apebs), ubi-io-write-data-wl-pre(n0, n, buf0, apebs), n1 ≤ # buf, n1 ≤ LEB_SIZE ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then apebs[n0] := mkpeb(apebs[n0].echdr, apebs[n0].vidhdr, subarray(buf0, 0, n) + mkempbuf(LEB_SIZE - n), n, apebs[n0].bad) else choose buf with # buf ≤ n ∧ is-aligned(# buf, EB_PAGE_SIZE) ∧ ( datasize(buf, # buf) < datasize(buf0, n) ∨ checksum(buf + mkempbuf(n - # buf), datasize(buf0, n)) ≠ checksum(buf0, datasize(buf0, n))) in apebs[n0] := mkpeb(apebs[n0].echdr, apebs[n0].vidhdr, buf + mkempbuf(LEB_SIZE - # buf), # buf, apebs[n0].bad)⟫ ubi-io-inv(apebs), datasize(buf, n1) = 0 |
apebs[n2] = mkpeb(aehdr, avhdr, buf1, 0, false), n1 = align↑(datasize(buf, n1), EB_PAGE_SIZE), datasize(buf, n1) ≠ 0, avhdr.valid?, aehdr.valid?, n2 < # apebs, ubi-io-inv(apebs), n1 ≤ # buf, n1 ≤ LEB_SIZE ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then apebs[n2] := mkpeb(apebs[n2].echdr, apebs[n2].vidhdr, subarray(buf, 0, n1) + mkempbuf(LEB_SIZE - n1), n1, apebs[n2].bad) else choose buf1 with # buf1 ≤ n1 ∧ is-aligned(# buf1, EB_PAGE_SIZE) ∧ ( datasize(buf1, # buf1) < datasize(buf, n1) ∨ checksum(buf1 + mkempbuf(n1 - # buf1), datasize(buf, n1)) ≠ checksum(buf, datasize(buf, n1))) in apebs[n2] := mkpeb(apebs[n2].echdr, apebs[n2].vidhdr, buf1 + mkempbuf(LEB_SIZE - # buf1), # buf1, apebs[n2].bad)⟫ ubi-io-inv(apebs)
Used simplifier rules: ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).bad ↔ boolvar; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).echdr = aehdr; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).vidhdr = avhdr; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).fill = m; (s)%⊦ ubi-io-write-data-wl-pre(n, n1, buf, apebs) ↔ n < # apebs ∧ ¬ apebs[n].bad ∧ apebs[n].echdr.valid? ∧ apebs[n].vidhdr.valid? ∧ n1 = align↑(datasize(buf, n1), EB_PAGE_SIZE) ∧ apebs[n].fill = 0 ∧ n1 ≤ LEB_SIZE ∧ n1 ≤ # buf ∧ datasize(buf, n1) ≠ 0; (s)