fs/btrfs/tree-log.c

360  * Item overwrite used by replay and tree logging.  eb, slot and key all refer
376 			  struct extent_buffer *eb, int slot,
396 	item_size = btrfs_item_size(eb, slot);
397 	src_ptr = btrfs_item_ptr_offset(eb, slot);
457 			item = btrfs_item_ptr(eb, slot,
478 		item = btrfs_item_ptr(eb, slot, struct btrfs_inode_item);
609 /* replays a single extent in 'eb' at 'slot' with 'key' into the
624 				      struct extent_buffer *eb, int slot,
638 	item = btrfs_item_ptr(eb, slot, struct btrfs_file_extent_item);
881 		ret = overwrite_item(trans, root, path, eb, slot, key);
1343  * eb, slot and key refer to the buffer and key found in the log tree.
1351 				  struct extent_buffer *eb, int slot,
1366 	ref_ptr = btrfs_item_ptr_offset(eb, slot);
1367 	ref_end = ref_ptr + btrfs_item_size(eb, slot);
1471 	ret = unlink_old_inode_refs(trans, root, path, BTRFS_I(inode), eb, slot,
1477 	ret = overwrite_item(trans, root, path, eb, slot, key);
1953 					struct extent_buffer *eb, int slot,
1962 	di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
2065 	/* check the next slot in the tree to see if it is a valid item */
2106 	int slot;
2121 	slot = path->slots[0];
2122 	di = btrfs_item_ptr(eb, slot, struct btrfs_dir_item);
2671 	int slot;
2675 		slot = path->slots[i];
2676 		if (slot + 1 < btrfs_header_nritems(path->nodes[i])) {
3620 			const int slot = start_slot + i;
3622 			btrfs_item_key_to_cpu(src, &ins_keys[i], slot);
3623 			ins_sizes[i] = btrfs_item_size(src, slot);
3670 	const int slot = path->slots[0];
3682 	path->slots[0] = slot;
4037 	 * btrfs_search_slot() left us at one slot beyond the slot with the last
4141 		 * If start slot isn't 0 then we don't need to re-search, we've
4783 	int slot;
4814 		slot = path->slots[0];
4815 		ei = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
4821 			btrfs_item_key_to_cpu(leaf, &key, slot);
4834 		slot = path->slots[0];
4836 		if (slot >= btrfs_header_nritems(leaf)) {
4854 		btrfs_item_key_to_cpu(leaf, &key, slot);
4881 			start_slot = slot;
5077 		int slot = path->slots[0];
5081 		if (slot >= nritems) {
5097 		btrfs_item_key_to_cpu(leaf, &key, slot);
5102 			start_slot = slot;
5264 					 const int slot,
5273 	u32 item_size = btrfs_item_size(eb, slot);
5275 	unsigned long ptr = btrfs_item_ptr_offset(eb, slot);
6193 	int slot = path->slots[0] + 1;
6198 	while (slot < last_slot &&
6202 		btrfs_item_key_to_cpu(leaf, &key, slot);
6208 		slot++;
6214 			       path->slots[0], slot - path->slots[0]);
6754 		int slot = path->slots[0];
6759 		if (slot >= btrfs_header_nritems(leaf)) {
6768 		btrfs_item_key_to_cpu(leaf, &key, slot);
6773 		item_size = btrfs_item_size(leaf, slot);
6774 		ptr = btrfs_item_ptr_offset(leaf, slot);
6862 		int slot;
6896 		slot = path->slots[0];
6897 		if (slot >= btrfs_header_nritems(leaf)) {
6904 			slot = path->slots[0];
6907 		btrfs_item_key_to_cpu(leaf, &found_key, slot);
6987 		int slot = path->slots[0];
6990 		if (slot >= btrfs_header_nritems(leaf)) {
6999 		btrfs_item_key_to_cpu(leaf, &found_key, slot);