Home
last modified time | relevance | path

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

/fs/btrfs/
Dextent_map.c153 struct extent_map *prev_entry = NULL; in __tree_search() local
158 prev_entry = entry; in __tree_search()
170 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
172 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
179 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
180 while (prev && offset < prev_entry->start) { in __tree_search()
182 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
Dordered-data.c74 struct btrfs_ordered_extent *prev_entry = NULL; in __tree_search() local
79 prev_entry = entry; in __tree_search()
91 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
95 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
97 if (file_offset < entry_end(prev_entry)) in __tree_search()
103 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
105 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
109 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
Dextent_io.c391 struct tree_entry *prev_entry = NULL; in __etree_search() local
396 prev_entry = entry; in __etree_search()
413 while (prev && offset > prev_entry->end) { in __etree_search()
415 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
422 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
423 while (prev && offset < prev_entry->start) { in __etree_search()
425 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
/fs/nilfs2/
Dalloc.c321 &cache->prev_entry, &cache->lock); in nilfs_palloc_get_entry_block()
335 &cache->prev_entry, &cache->lock); in nilfs_palloc_delete_entry_block()
851 brelse(cache->prev_entry.bh); in nilfs_palloc_clear_cache()
854 cache->prev_entry.bh = NULL; in nilfs_palloc_clear_cache()
Dalloc.h89 struct nilfs_bh_assoc prev_entry; member
/fs/f2fs/
Dextent_cache.c98 struct rb_entry **prev_entry, in f2fs_lookup_rb_tree_ret() argument
110 *prev_entry = NULL; in f2fs_lookup_rb_tree_ret()
151 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
158 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
Df2fs.h3556 struct rb_entry **prev_entry, struct rb_entry **next_entry,