[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 34 from proof fsync-dirs (previous step)

files0[m] = mkfile(m0, md0, m1, content), dirs = dirs0, err = ESUCCESS, inode = mkinode(m, md, false, m1, 0, m2), m ∈ files0, m2 ≤ n * VFS_PAGE_SIZE ⊦ [cache_fsync-inode#(; inode, err, dirs, files, icache, asynced1); if err = ESUCCESS then afs_fsync#(inode, false, dirs, files; ; asynced2, err)] (dirs = dirs0)

User applied rule call right

And obtained the following new goals

Proof step 35:
files0[m] = mkfile(m0, md0, m1, content), dirs = dirs0, err = ESUCCESS, inode = mkinode(m, md, false, m1, 0, m2), m ∈ files0, m2 ≤ n * VFS_PAGE_SIZE ⊦ [let ino = inode.ino, asynced0 = ?, asynced = ? in {icache_check_inode#(ino, icache; asynced0, asynced, err); if err = ESUCCESS ∧ asynced0 ∧ asynced then icache_get#(ino, icache; asynced0, inode, err); if err = ESUCCESS ∧ asynced0 ∧ asynced then afs_write_inode#(inode; err, dirs, files; asynced1); if err = ESUCCESS then {asynced := false; icache_set_status#(ino, asynced; err, icache)}}; if err = ESUCCESS then afs_fsync#(inode, false, dirs, files; ; asynced2, err)] (dirs = dirs0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: cache_fsync-inode#(; INODE, ERR, DIRS, FILES, ICACHE, ASYNCED) {let INO = INODE.ino, HIT = ?, DIRTY = ? in {icache_check_inode#(INO, ICACHE; HIT, DIRTY, ERR); if ERR = ESUCCESS ∧ HIT ∧ DIRTY then icache_get#(INO, ICACHE; HIT, INODE, ERR); if ERR = ESUCCESS ∧ HIT ∧ DIRTY then afs_write_inode#(INODE; ERR, DIRS, FILES; ASYNCED); if ERR = ESUCCESS then {DIRTY := false; icache_set_status#(INO, DIRTY; ERR, ICACHE)}} };