| # links(m, dirs0) = m2, # links(m0, dirs0) = dirs0[m0].nlink, # links(entries1[str], dirs0) = dirs0[entries1[str]].nlink, dirs0[m] = mkdir(0, md4, m2, m3, entries1), dirs0[m0] = mkdir(dirs0[m0].size, md2, dirs0[m0].nlink, dirs0[m0].nsubdirs, entries), dirs0[entries1[str]] = mkdir(dirs0[entries1[str]].size, md3, dirs0[entries1[str]].nlink, dirs0[entries1[str]].nsubdirs, entries0), entries1[str] = entries2[str], dirs0[m] = mkdir(m1, md, m2, m3, entries2), m1 = 0, afs-cons(dirs0, files), str ∈ entries1, entries1[str] ∈ dirs0, m ∈ dirs0, m0 ∈ dirs0, str ∈ entries2, m0 = m → md1 = md0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ str0 ∈ entries, str0 ∈ dirs0[m0].entries |
# links(entries2[str], dirs0) = dirs0[entries2[str]].nlink, # links(m0, dirs0) = dirs0[m0].nlink, dirs0[entries2[str]] = mkdir(dirs0[entries2[str]].size, md3, dirs0[entries2[str]].nlink, dirs0[entries2[str]].nsubdirs, entries0), dirs0[m0] = mkdir(dirs0[m0].size, md2, dirs0[m0].nlink, dirs0[m0].nsubdirs, entries), dirs0[m] = mkdir(0, md, # links(m, dirs0), m3, entries2), afs-cons(dirs0, files), m0 ∈ dirs0, m ∈ dirs0, entries2[str] ∈ dirs0, str ∈ entries2, m0 = m → md1 = md0, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ str0 ∈ dirs0[m0].entries, str0 ∈ entries
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)%afs-cons-dir-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) → # links(ino, dirs) = n; (forward) from specification afs-base