| # links(entries0[str], dirs0) = m1 + 1, files0[entries0[str]] = mkfile(m0, md1, m1 + 1, content), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m3, entries0), dirs = dirs0[m, mkdir(m2, md, # links(m, dirs0), m3, entries0 -- str)], files = files0[entries0[str], mkfile(m0, md1, m1, content)], ino = inode.ino, inode = mkinode(entries0[str], md0, false, # links(entries0[str], dirs0), 0, m6), afs-cons(dirs0[m, mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str)], files0[entries0[str], mkfile(m0, md1, m1, content)]), afs-cons(dirs0, files0), afs-cons(dirs0[m, mkdir(m2, md, # links(m, dirs0), m3, entries0 -- str)], files0[entries0[str], mkfile(m0, md1, m1, content)]), m ∈ dirs0, str ∈ entries0, entries0[str] ∈ files0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ [skip] ( afs-cons(dirs, files) → ⟪p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); c_inode := (entries0[str] ∈ dirs ⊃ mkinode (entries0[str], dirs[entries0[str]].meta, true, dirs[entries0[str]].nlink, dirs[entries0[str]].nsubdirs, dirs[entries0[str]].size) ;mkinode(entries0[str], files[entries0[str]].meta, false, files[entries0[str]].nlink, 0, files[entries0[str]].size) ); err := ESUCCESS; asynced := ?⟫ true), ino ∈ files, ino ∈ dirs |
Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) ∧ str ∈ entries ∧ afs-cons(dirs, files) → (entries[str] ∈ files ↔ ¬ entries[str] ∈ dirs); (ss)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)