| #((links(entries[str], dirs0) -- mklink(m8, str)) ++ mklink(m, str0)) = # links(entries[str], dirs0), (m19 = m ⊃ mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]);mkdir(m18, md8, # links(m19, dirs0), m20, entries5)) = mkdir(m15, md7, 0, m17, entries4), dcache0[dentrykey(m19, str1)] = mkdentry(str1, entries5[str1]), dirs0[m] = mkdir(m1, md4, # links(m, dirs0), m14, entries1), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), dirs0[m19] = mkdir(m18, md8, # links(m19, dirs0), m20, entries5), afs-cons (dirs0[m8, mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)] [m, mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ], files), afs-cons(dirs0, files), synced(dirs0, icache0, pcache), str1 ∈ entries5, m19 ∈ dirs0, dentrykey(m19, str1) ∈ dcache0, m8 ∈ dirs0, entries[str] ∈ files, str ∈ entries, m ∈ dirs0, asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO, entries5[str1] ∈ dirs0 ∨ entries5[str1] ∈ files ⊦ # links(m, dirs0) = 0, # links(m19, dirs0) = 0, dentrykey(m19, str1) = dentrykey(m8, str), dentrykey(m19, str1) = dentrykey(m, str0), links(m, dirs0) = ∅, links(m19, dirs0) = ∅, m = ROOT_INO, m = m8, m19 = m8, m19 = ROOT_INO, str0 ∈ entries1, entries[str] ∈ dirs0 |
Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws) Used formulas: m19 = m