Lines Matching +full:key +full:- +full:down

1 /* SPDX-License-Identifier: GPL-2.0+ */
37  * Theoretical limit is larger, but we keep this down to a sane
66 #define BTRFS_BACKREF_REV_MASK		(((u64)BTRFS_BACKREF_REV_MAX - 1) << \
82 	/* allowed to be different from the super from here on down */
148 	/* allowed to be different from the btrfs_header from here own down */
222 	struct btrfs_key key;  member
240  * all non-leaf blocks are nodes, they hold only keys and pointers to
244 	struct btrfs_key key;  member
286 	return &p->nodes[0]->leaf.items[p->slots[0]].key;  in btrfs_path_leaf_key()
293 	struct btrfs_key key, *res;  in btrfs_search_tree_key_type()  local
295 	key.objectid = objectid;  in btrfs_search_tree_key_type()
296 	key.type = type;  in btrfs_search_tree_key_type()
297 	key.offset = 0;  in btrfs_search_tree_key_type()
299 	if (btrfs_search_tree(root, &key, path))  in btrfs_search_tree_key_type()
303 	if (btrfs_comp_keys_type(&key, res)) {  in btrfs_search_tree_key_type()
313 	return p->nodes[0]->leaf.items[p->slots[0]].size;  in btrfs_path_item_size()
319 	       + leaf->items[slot].offset;  in btrfs_leaf_data()
324 	return btrfs_leaf_data(&p->nodes[0]->leaf, p->slots[0]);  in btrfs_path_leaf_data()