fs/btrfs/qgroup.c

373 				   struct extent_buffer *leaf, int slot,
377 	ASSERT(btrfs_item_size(leaf, slot) >= sizeof(*ptr));
392 	int slot;
431 		slot = path->slots[0];
433 		btrfs_item_key_to_cpu(l, &found_key, slot);
438 			ptr = btrfs_item_ptr(l, slot,
449 				qgroup_read_enable_gen(fs_info, l, slot, ptr);
507 			ptr = btrfs_item_ptr(l, slot,
519 			ptr = btrfs_item_ptr(l, slot,
550 		slot = path->slots[0];
552 		btrfs_item_key_to_cpu(l, &found_key, slot);
848 	int slot;
866 	slot = path->slots[0];
867 	qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
891 	int slot;
912 	slot = path->slots[0];
913 	qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
936 	int slot;
954 	slot = path->slots[0];
955 	ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
1031 	int slot;
1159 		slot = path->slots[0];
1161 		btrfs_item_key_to_cpu(leaf, &found_key, slot);
2113  * interior) is freed, the node above it will have it's slot
2119  * correct slot selected for a later read.
2121  * If we increment the root nodes slot counter past the number of
2127 	int nr, slot;
2137 		slot = path->slots[level];
2138 		if (slot >= nr || level == 0) {
2154 			 * We have a valid slot to walk back down
2570 	 * walk back up the tree (adjusting slot pointers as we go)
3620 	int slot;
3665 	slot = path->slots[0];
3669 	for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
3672 		btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
4588  * @subvol_parent/slot:	pointer to the subtree root in subvolume tree
4589  * @reloc_parent/slot:	pointer to the subtree root in reloc tree
4628 	 * @reloc_parent/slot is still before swap, while @block is going to