Home
last modified time | relevance | path

Searched refs:ofs_of_node (Results 1 – 6 of 6) sorted by relevance

/linux/fs/f2fs/
H A Drecovery.c558 offset = ofs_of_node(node_folio); in check_index_in_prev_nodes()
638 } else if (f2fs_has_xattr_block(ofs_of_node(folio))) { in do_recover_data()
654 start = f2fs_start_bidx_of_node(ofs_of_node(folio), inode); in do_recover_data()
676 if (ofs_of_node(dn.node_folio) != ofs_of_node(folio)) { in do_recover_data()
678 inode->i_ino, ofs_of_node(dn.node_folio), in do_recover_data()
679 ofs_of_node(folio)); in do_recover_data()
766 ofs_of_node(folio), false); in do_recover_data()
H A Dnode.h259 static inline unsigned int ofs_of_node(const struct folio *node_folio) in ofs_of_node() function
356 unsigned int ofs = ofs_of_node(node_folio); in IS_DNODE()
H A Dextent_cache.c952 ei.fofs = f2fs_start_bidx_of_node(ofs_of_node(dn->node_folio), dn->inode) + in __update_extent_cache()
H A Dnode.c1516 if (!f2fs_has_xattr_block(ofs_of_node(folio))) in sanity_check_node_footer()
1533 ofs_of_node(folio), cpver_of_node(folio), in sanity_check_node_footer()
H A Dgc.c1186 *nofs = ofs_of_node(node_folio); in is_alive()
H A Dfile.c720 fofs = f2fs_start_bidx_of_node(ofs_of_node(dn->node_folio), in f2fs_truncate_data_blocks_range()