[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 70 from proof refine-rename-dir-dentry (previous step)

# links(entries0[str0], cache_dirs) = cache_dirs[entries0[str0]].nlink, cache_dirs[m3] = mkdir(m0 + 1, md5, # links(m3, cache_dirs), m1 + 1, entries0), cache_dirs[m] = mkdir(m2, md4, # links(m, cache_dirs), m5, entries), cache_dirs[entries[str]] = mkdir(m4, md7, # links(entries[str], cache_dirs), m7, ∅), cache_dirs[entries0[str0]] = mkdir(cache_dirs[entries0[str0]].size, md3, cache_dirs[entries0[str0]].nlink, cache_dirs[entries0[str0]].nsubdirs, entries2), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m3, mkdir(m0, md5, # links(m3, cache_dirs), m1, entries0 -- str0)] [m, (m = m3 ⊃ mkdir(m0, md5, # links(m3, cache_dirs), m1, entries0 -- str0);mkdir(m2, md4, # links(m, cache_dirs), m5, entries)) .entries:= (m = m3 ⊃ mkdir(m0, md5, # links(m3, cache_dirs), m1, entries0 -- str0);mkdir(m2, md4, # links(m, cache_dirs), m5, entries)) .entries [str, entries0[str0] ] ], entries[str] ≠ ROOT_INO, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ 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_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), m3 ∈ cache_dirs, m ∈ cache_dirs, entries0[str0] ∈ cache_dirs, entries[str] ∈ cache_dirs, str0 ∈ entries0, str ∈ entries, m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [afs_drop_nlink#(mkdentry(str, entries[str]).ino; dirs, cache_files); old_dent := mkdentry(str0, entries0[str0]); asynced1 := true; if ¬ asynced1 then {dirs[m].size := dirs[m].size + 1; if old_dent.ino ∈ dirs then dirs[m].nsubdirs := dirs[m].nsubdirs + 1}; new_dent := mkdentry(mkdentry(str, entries[str]).name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(m3, md0, true, # links(m3, cache_dirs), m1 + 1, m0 + 1); dirs, cache_files); afs_inode_sync#(mkinode(m, md, true, # links(m, cache_dirs), m5, m2); dirs, cache_files); new_child_inode := mkinode(entries[str], md1, true, # links(entries[str], cache_dirs), m7, m4); if asynced1 then {afs_inode_sync#(new_child_inode; dirs, cache_files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, cache_files[new_child_inode.ino].meta, false, cache_files[new_child_inode.ino].nlink, 0, cache_files[new_child_inode.ino].size) )}; old_parent_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, cache_files[m3].meta, false, cache_files[m3].nlink, 0, cache_files[m3].size) ); new_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, cache_files[m].meta, false, cache_files[m].nlink, 0, cache_files[m].size) ); err := ESUCCESS; asynced := ?; entries1 := entries; if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, cache_icache); icache_set#(new_parent_inode, asynced; err, cache_icache); if mkdentry(str, entries1[str]).dentry? then icache_set#(new_child_inode, asynced; err, cache_icache); dcache_delete#(old_parent_inode.ino, old_dent.name; err, cache_dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, cache_dcache)}] ( icache-cons(cache_icache, dirs, cache_files) ∧ dcache-cons(cache_dcache, dirs, cache_files) ∧ pcache-cons(cache_pcache, dirs, cache_files) ∧ afs-cons(dirs, cache_files) ∧ synced(dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries1[str]); old_dent0 := mkdentry(str0, entries0[str0]); new_parent_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m5, m2); old_parent_inode0 := mkinode(m3, md0, true, # links(m3, cache_dirs), m1 + 1, m0 + 1); new_child_inode0 := mkinode (entries1[str], md1, true, # links(entries1[str], cache_dirs), cache_dirs[entries1[str]].nsubdirs, cache_dirs[entries1[str]].size); old_child_inode0 := mkinode (entries0[str0], md2, true, # links(entries0[str0], cache_dirs), cache_dirs[entries0[str0]].nsubdirs, cache_dirs[entries0[str0]].size); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode (entries0[str0], md2, true, # links(entries0[str0], cache_dirs0), cache_dirs1[entries0[str0]].nsubdirs, cache_dirs2[entries0[str0]].size) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ cache_dirs = dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), m3 = m ∧ mkdentry(str, entries[str]) = mkdentry(str0, entries0[str0])

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [cache_dirs[entries0[str0]], m6, md6, m8, m9, entries3]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: cache_dirs[entries0[str0]], m6, md6, m8, m9, entries3