Searched refs:prev_entry (Results 1 – 9 of 9) sorted by relevance
| /fs/btrfs/ |
| A D | ordered-data.c | 71 struct btrfs_ordered_extent *prev_entry = NULL; in __tree_search() local
76 prev_entry = entry; in __tree_search()
88 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
92 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
94 if (file_offset < entry_end(prev_entry)) in __tree_search()
100 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
102 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
106 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
|
| A D | extent_map.c | 146 struct extent_map *prev_entry = NULL; in tree_search() local
153 prev_entry = entry; in tree_search()
164 while (prev && offset >= btrfs_extent_map_end(prev_entry)) { in tree_search()
166 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()
|
| /fs/afs/ |
| A D | dir_edit.c | 466 if (!iter.prev_entry) { in afs_edit_dir_remove()
472 iter.bucket, iter.prev_entry, prev_next, entry, in afs_edit_dir_remove()
478 unsigned int pb = iter.prev_entry / AFS_DIR_SLOTS_PER_BLOCK; in afs_edit_dir_remove()
479 unsigned int ps = iter.prev_entry % AFS_DIR_SLOTS_PER_BLOCK; in afs_edit_dir_remove()
491 iter.bucket, iter.prev_entry, prev_next, entry, in afs_edit_dir_remove()
|
| A D | dir_search.c | 50 iter->prev_entry = 0; /* Hash head is previous */ in afs_dir_reset_iter()
166 iter->prev_entry = entry; in afs_dir_search_bucket()
|
| A D | internal.h | 988 unsigned int prev_entry; member
|
| /fs/nilfs2/ |
| A D | alloc.c | 358 &cache->prev_entry, &cache->lock); in nilfs_palloc_get_entry_block()
374 &cache->prev_entry, &cache->lock); in nilfs_palloc_delete_entry_block()
947 brelse(cache->prev_entry.bh); in nilfs_palloc_clear_cache()
950 cache->prev_entry.bh = NULL; in nilfs_palloc_clear_cache()
|
| A D | alloc.h | 91 struct nilfs_bh_assoc prev_entry; member
|
| /fs/f2fs/ |
| A D | extent_cache.c | 219 struct extent_node **prev_entry, in __lookup_extent_node_ret() argument
231 *prev_entry = NULL; in __lookup_extent_node_ret()
268 *prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
275 *prev_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
|
| A D | segment.c | 1047 struct discard_cmd **prev_entry, in __lookup_discard_cmd_ret() argument
1058 *prev_entry = NULL; in __lookup_discard_cmd_ret()
1088 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1094 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
|
Completed in 31 milliseconds