Home
last modified time | relevance | path

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

/OK3568_Linux_fs/kernel/include/trace/events/
H A Df2fs.h1536 TP_PROTO(struct inode *inode, unsigned int pgofs, enum extent_type type),
1538 TP_ARGS(inode, pgofs, type),
1543 __field(unsigned int, pgofs)
1550 __entry->pgofs = pgofs;
1556 __entry->pgofs,
1562 TP_PROTO(struct inode *inode, unsigned int pgofs,
1565 TP_ARGS(inode, pgofs, ei),
1572 __field(unsigned int, pgofs)
1581 __entry->pgofs = pgofs;
1590 __entry->pgofs,
[all …]
/OK3568_Linux_fs/kernel/fs/f2fs/
H A Dextent_cache.c539 static bool __lookup_extent_tree(struct inode *inode, pgoff_t pgofs, in __lookup_extent_tree() argument
551 trace_f2fs_lookup_extent_tree_start(inode, pgofs, type); in __lookup_extent_tree()
556 et->largest.fofs <= pgofs && in __lookup_extent_tree()
557 et->largest.fofs + et->largest.len > pgofs) { in __lookup_extent_tree()
565 (struct rb_entry *)et->cached_en, pgofs); in __lookup_extent_tree()
587 trace_f2fs_lookup_read_extent_tree_end(inode, pgofs, ei); in __lookup_extent_tree()
589 trace_f2fs_lookup_age_extent_tree_end(inode, pgofs, ei); in __lookup_extent_tree()
1049 bool f2fs_lookup_read_extent_cache(struct inode *inode, pgoff_t pgofs, in f2fs_lookup_read_extent_cache() argument
1055 return __lookup_extent_tree(inode, pgofs, ei, EX_READ); in f2fs_lookup_read_extent_cache()
1087 bool f2fs_lookup_age_extent_cache(struct inode *inode, pgoff_t pgofs, in f2fs_lookup_age_extent_cache() argument
[all …]
H A Ddata.c1481 pgoff_t pgofs, end_offset, end; in f2fs_map_blocks() local
1496 pgofs = (pgoff_t)map->m_lblk; in f2fs_map_blocks()
1497 end = pgofs + maxblocks; in f2fs_map_blocks()
1499 if (!create && f2fs_lookup_read_extent_cache(inode, pgofs, &ei)) { in f2fs_map_blocks()
1504 map->m_pblk = ei.blk + pgofs - ei.fofs; in f2fs_map_blocks()
1505 map->m_len = min((pgoff_t)maxblocks, ei.fofs + ei.len - pgofs); in f2fs_map_blocks()
1508 *map->m_next_extent = pgofs + map->m_len; in f2fs_map_blocks()
1523 err = f2fs_get_dnode_of_data(&dn, pgofs, mode); in f2fs_map_blocks()
1545 f2fs_get_next_page_offset(&dn, pgofs); in f2fs_map_blocks()
1548 f2fs_get_next_page_offset(&dn, pgofs); in f2fs_map_blocks()
[all …]
H A Dfile.c430 pgoff_t pgofs, end_offset; in f2fs_seek_block() local
452 pgofs = (pgoff_t)(offset >> PAGE_SHIFT); in f2fs_seek_block()
454 for (; data_ofs < isize; data_ofs = (loff_t)pgofs << PAGE_SHIFT) { in f2fs_seek_block()
456 err = f2fs_get_dnode_of_data(&dn, pgofs, LOOKUP_NODE); in f2fs_seek_block()
462 pgofs = f2fs_get_next_page_offset(&dn, pgofs); in f2fs_seek_block()
473 dn.ofs_in_node++, pgofs++, in f2fs_seek_block()
474 data_ofs = (loff_t)pgofs << PAGE_SHIFT) { in f2fs_seek_block()
487 pgofs, whence)) { in f2fs_seek_block()
H A Dnode.c646 pgoff_t f2fs_get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs) in f2fs_get_next_page_offset() argument
657 return pgofs + 1; in f2fs_get_next_page_offset()
676 return ((pgofs - base) / skipped_unit + 1) * skipped_unit + base; in f2fs_get_next_page_offset()
H A Df2fs.h3544 pgoff_t f2fs_get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs);
4126 bool f2fs_lookup_read_extent_cache(struct inode *inode, pgoff_t pgofs,
4136 bool f2fs_lookup_age_extent_cache(struct inode *inode, pgoff_t pgofs,
H A Dsegment.c3301 static int __get_age_segment_type(struct inode *inode, pgoff_t pgofs) in __get_age_segment_type() argument
3306 if (f2fs_lookup_age_extent_cache(inode, pgofs, &ei)) { in __get_age_segment_type()