Home
last modified time | relevance | path

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

/linux-4.19.296/include/trace/events/
Df2fs.h1446 TP_PROTO(struct inode *inode, unsigned int pgofs),
1448 TP_ARGS(inode, pgofs),
1453 __field(unsigned int, pgofs)
1459 __entry->pgofs = pgofs;
1464 __entry->pgofs)
1469 TP_PROTO(struct inode *inode, unsigned int pgofs,
1472 TP_ARGS(inode, pgofs, ei),
1479 __field(unsigned int, pgofs)
1488 __entry->pgofs = pgofs;
1497 __entry->pgofs,
[all …]
/linux-4.19.296/fs/f2fs/
Dextent_cache.c370 static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, in f2fs_lookup_extent_tree() argument
381 trace_f2fs_lookup_extent_tree_start(inode, pgofs); in f2fs_lookup_extent_tree()
385 if (et->largest.fofs <= pgofs && in f2fs_lookup_extent_tree()
386 et->largest.fofs + et->largest.len > pgofs) { in f2fs_lookup_extent_tree()
394 (struct rb_entry *)et->cached_en, pgofs); in f2fs_lookup_extent_tree()
415 trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); in f2fs_lookup_extent_tree()
767 bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, in f2fs_lookup_extent_cache() argument
773 return f2fs_lookup_extent_tree(inode, pgofs, ei); in f2fs_lookup_extent_cache()
Ddata.c1014 pgoff_t pgofs, end_offset, end; in f2fs_map_blocks() local
1029 pgofs = (pgoff_t)map->m_lblk; in f2fs_map_blocks()
1030 end = pgofs + maxblocks; in f2fs_map_blocks()
1032 if (!create && f2fs_lookup_extent_cache(inode, pgofs, &ei)) { in f2fs_map_blocks()
1033 map->m_pblk = ei.blk + pgofs - ei.fofs; in f2fs_map_blocks()
1034 map->m_len = min((pgoff_t)maxblocks, ei.fofs + ei.len - pgofs); in f2fs_map_blocks()
1037 *map->m_next_extent = pgofs + map->m_len; in f2fs_map_blocks()
1047 err = f2fs_get_dnode_of_data(&dn, pgofs, mode); in f2fs_map_blocks()
1055 f2fs_get_next_page_offset(&dn, pgofs); in f2fs_map_blocks()
1058 f2fs_get_next_page_offset(&dn, pgofs); in f2fs_map_blocks()
[all …]
Dfile.c338 pgoff_t pgofs, int whence) in __get_first_dirty_index() argument
347 nr_pages = find_get_pages_tag(mapping, &pgofs, PAGECACHE_TAG_DIRTY, in __get_first_dirty_index()
351 pgofs = page->index; in __get_first_dirty_index()
353 return pgofs; in __get_first_dirty_index()
357 pgoff_t dirty, pgoff_t pgofs, int whence) in __found_offset() argument
361 if ((blkaddr == NEW_ADDR && dirty == pgofs) || in __found_offset()
378 pgoff_t pgofs, end_offset, dirty; in f2fs_seek_block() local
396 pgofs = (pgoff_t)(offset >> PAGE_SHIFT); in f2fs_seek_block()
398 dirty = __get_first_dirty_index(inode->i_mapping, pgofs, whence); in f2fs_seek_block()
400 for (; data_ofs < isize; data_ofs = (loff_t)pgofs << PAGE_SHIFT) { in f2fs_seek_block()
[all …]
Dnode.c601 pgoff_t f2fs_get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs) in f2fs_get_next_page_offset() argument
612 return pgofs + 1; in f2fs_get_next_page_offset()
629 return ((pgofs - base) / skipped_unit + 1) * skipped_unit + base; in f2fs_get_next_page_offset()
Df2fs.h2902 pgoff_t f2fs_get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs);
3367 bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs,