| m5 + 1 = fs[ri[inodekey(m0)]].nlink, 0 = fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m)]] = inodenode(key0, md1, true, m1, m2, m3), fs[ri[dentrykey(m, str)]] = dentrynode(key, m0), p_ino = m, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m0) ∈ ri, ri[dentrykey(m, str)] ∈ fs, dentrykey(m, str) ∈ ri, 1 ≤ m3, abs-dirs(fs, ri)[p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- str)][p_ino].size ≥ 1, asynced → boolvar0, m5 = 0 → links(m0, fs, ri) = ∅ ++ dentrykey(m, str), ∀ adr0, adr1, adr2. adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr2 ∈ fs ∨ adr0 = adr1 ∨ adr0 = adr2 ∨ adr1 = adr2, m1 ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), m = 0, m0 = ROOT_INO, m0 = 0, m3 = 0, mkdentry(str, m0).dentry?, fs[ri[inodekey(m0)]].directory |
Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)%⊦ mkdir(m, md, m0, m1, entries).entries:= entries0 = mkdir(m, md, m0, m1, entries0); (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)