Home
last modified time | relevance | path

Searched refs:ino_of_node (Results 1 – 5 of 5) sorted by relevance

/fs/f2fs/
A Drecovery.c236 __func__, ino_of_node(ifolio), name, in recover_dentry()
339 ino_of_node(folio), name, raw->i_inline); in recover_inode()
435 entry = get_fsync_inode(head, ino_of_node(folio)); in find_fsync_dnodes()
454 entry = add_fsync_inode(sbi, head, ino_of_node(folio), in find_fsync_dnodes()
556 ino = ino_of_node(node_folio); in check_index_in_prev_nodes()
671 f2fs_bug_on(sbi, ni.ino != ino_of_node(folio)); in do_recover_data()
815 entry = get_fsync_inode(inode_list, ino_of_node(folio)); in recover_data()
A Dnode.c1000 dn->inode->i_ino, dn->nid, ino_of_node(folio)); in truncate_dnode()
1506 ntype, nid, nid_of_node(folio), ino_of_node(folio), in sanity_check_node_footer()
1655 if (ino_of_node(folio) != ino) in last_fsync_dnode()
1665 if (ino_of_node(folio) != ino) in last_fsync_dnode()
1695 .ino = ino_of_node(folio), in __write_node_folio()
1864 if (ino_of_node(folio) != ino) in f2fs_fsync_node_pages()
1874 if (ino_of_node(folio) != ino) in f2fs_fsync_node_pages()
1970 nid_t ino = ino_of_node(folio); in flush_dirty_inode()
2013 flush_inline_data(sbi, ino_of_node(folio)); in f2fs_flush_inline_data()
2095 flush_inline_data(sbi, ino_of_node(folio)); in f2fs_sync_node_pages()
[all …]
A Dinode.c182 folio->index, ino_of_node(folio), in f2fs_inode_chksum_verify()
284 if (ino_of_node(node_folio) != nid_of_node(node_folio)) { in sanity_check_inode()
287 ino_of_node(node_folio), nid_of_node(node_folio)); in sanity_check_inode()
291 if (ino_of_node(node_folio) == fi->i_xattr_nid) { in sanity_check_inode()
A Dnode.h246 static inline nid_t ino_of_node(const struct folio *node_folio) in ino_of_node() function
A Ddata.c574 if (ino && ino == ino_of_node(target)) in __has_merged_page()

Completed in 19 milliseconds