Searched refs:prev_entry (Results 1 – 5 of 5) sorted by relevance
| /fs/btrfs/ |
| D | extent_map.c | 119 struct extent_map *prev_entry = NULL; in __tree_search() local
124 prev_entry = entry; in __tree_search()
138 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
140 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
147 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
148 while (prev && offset < prev_entry->start) { in __tree_search()
150 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
|
| D | ordered-data.c | 81 struct btrfs_ordered_extent *prev_entry = NULL; in __tree_search() local
86 prev_entry = entry; in __tree_search()
98 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
102 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
104 if (file_offset < entry_end(prev_entry)) in __tree_search()
110 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
112 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
116 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
|
| D | extent_io.c | 204 struct tree_entry *prev_entry = NULL; in __etree_search() local
209 prev_entry = entry; in __etree_search()
221 while (prev && offset > prev_entry->end) { in __etree_search()
223 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
230 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
231 while (prev && offset < prev_entry->start) { in __etree_search()
233 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
|
| /fs/nilfs2/ |
| D | alloc.h | 92 struct nilfs_bh_assoc prev_entry; member
|
| D | alloc.c | 295 &cache->prev_entry, &cache->lock); in nilfs_palloc_get_entry_block()
710 brelse(cache->prev_entry.bh); in nilfs_palloc_clear_cache()
713 cache->prev_entry.bh = NULL; in nilfs_palloc_clear_cache()
|