Lines Matching +full:lower +full:- +full:case
1 /* SPDX-License-Identifier: GPL-2.0 */
17 #include "disk-io.h"
30 * The value must be non-negative and must not be 0, 1 (which is a common return
39 * continue. Can return BTRFS_ITERATE_EXTENT_INODES_STOP or any other non-zero
90 * Time sequence acquired from btrfs_get_tree_mod_seq(), in case the
94 * commit roots when searching b+trees - this is a special case for
105 * extent is accessible. Can be NULL in case the caller does not care
199 * case we don't have multiple file extent items that point to the same
287 * For metadata with EXTENT_ITEM key (non-skinny) case, the first inline data
290 * This helper determines if that's the case.
295 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY && in btrfs_backref_has_tree_block_info()
296 iter->cur_ptr - iter->item_ptr == sizeof(struct btrfs_extent_item)) in btrfs_backref_has_tree_block_info()
308 * The whole objective of backref_cache is to build a bi-directional map
335 /* List of lower level edges, which link this node to its children */
336 struct list_head lower; member
365 #define LOWER 0 macro
369 * Represent an edge connecting upper and lower backref nodes.
373 * list[LOWER] is linked to btrfs_backref_node::upper of lower level
374 * node, and list[UPPER] is linked to btrfs_backref_node::lower of
430 struct btrfs_backref_node *lower,