| m2 + n1 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE + VFS_PAGE_SIZE, (∅)[m0] = mkientry(boolvar1, mkinode(m10, md4, boolvar0, m11, m12, m13)), cache_files[m0] = mkfile(m3, md1, # links(m0, cache_dirs), content1), fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1) = fill((content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], zero, n0, n1), m2 = n0 + m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), m0 ∈ cache_files, m2 / VFS_PAGE_SIZE ∈ content1, m2 ≤ m7, VFS_PAGE_SIZE ≤ # (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ m2 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, n = m2 / VFS_PAGE_SIZE, datakey(m0, m2 / VFS_PAGE_SIZE) ∈ cache_pcache0, m0 ∈ cache_icache, ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] ↔ n ∈ (content1[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0)[datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry(false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1))])) ∧ ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] → (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)][n] = ( (content1[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0)[datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry(false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1))]) )[n ]) |
m2 + n1 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE + VFS_PAGE_SIZE, cache_files[m0] = mkfile(m3, md1, # links(m0, cache_dirs), content1), (∅)[m0] = mkientry(boolvar1, mkinode(m10, md4, boolvar0, m11, m12, m13)), fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1) = fill((content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], zero, n0, n1), m2 = n0 + m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), m2 / VFS_PAGE_SIZE ∈ content1, m0 ∈ cache_files, VFS_PAGE_SIZE ≤ # (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], m2 ≤ m7, cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ m2 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, n = m2 / VFS_PAGE_SIZE, m0 ∈ cache_icache, datakey(m0, m2 / VFS_PAGE_SIZE) ∈ cache_pcache0, ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ content1 ⊕ mkcontent(m0, cache_pcache0) ↔ n ∈ (content1[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0)[datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry(false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1))])) ∧ ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ content1 ⊕ mkcontent(m0, cache_pcache0) → (content1 ⊕ mkcontent(m0, cache_pcache0))[n] = ( (content1[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0)[datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry(false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1))]) )[n ])
Used simplifier rules: ⊦ n ≠ n0 → content[n0, buf][n] = content[n]; (s)% ⊦ n ≠ n0 → (n ∈ content[n0, buf] ↔ n ∈ content); (s)