fs/btrfs/backref.c

117 	 * from the shared data ref, we only have the leaf but we need
499 	 * 2. We are searching for normal backref but bytenr of this leaf
501 	 * 3. The leaf owner is not equal to the root we are searching
503 	 * For these cases, go to the next leaf before we continue.
526 		 * We are searching for normal backref but bytenr of this leaf
528 		 * the leaf owner is not equal to the root we are searching for
1020 	struct extent_buffer *leaf;
1032 	leaf = path->nodes[0];
1035 	item_size = btrfs_item_size(leaf, slot);
1036 	ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
1039 		ret = ctx->check_extent_item(ctx->bytenr, ei, leaf, ctx->user_ctx);
1044 	flags = btrfs_extent_flags(leaf, ei);
1045 	btrfs_item_key_to_cpu(leaf, &found_key, slot);
1055 		*info_level = btrfs_tree_block_level(leaf, info);
1070 		type = btrfs_get_extent_inline_ref_type(leaf, iref,
1075 		offset = btrfs_extent_inline_ref_offset(leaf, iref);
1088 			count = btrfs_shared_data_ref_count(leaf, sdref);
1105 			count = btrfs_extent_data_ref_count(leaf, dref);
1106 			key.objectid = btrfs_extent_data_ref_objectid(leaf,
1109 			key.offset = btrfs_extent_data_ref_offset(leaf, dref);
1117 			root = btrfs_extent_data_ref_root(leaf, dref);
1155 	struct extent_buffer *leaf;
1168 		leaf = path->nodes[0];
1169 		btrfs_item_key_to_cpu(leaf, &key, slot);
1190 			sdref = btrfs_item_ptr(leaf, slot,
1192 			count = btrfs_shared_data_ref_count(leaf, sdref);
1210 			dref = btrfs_item_ptr(leaf, slot,
1212 			count = btrfs_extent_data_ref_count(leaf, dref);
1213 			key.objectid = btrfs_extent_data_ref_objectid(leaf,
1216 			key.offset = btrfs_extent_data_ref_offset(leaf, dref);
1224 			root = btrfs_extent_data_ref_root(leaf, dref);
1270 	 * the root node down to the leaf with the file extent item.
1301 	 * because we have just switched from one leaf to another, and switched
1302 	 * also other nodes above the leaf and below the current level, so mark
1341 	 * the root node down to the leaf with the file extent item.
1358 	 * their sharedness is moved to their children, and if a leaf is COWed,
1480 		struct extent_buffer *leaf;
1484 		leaf = path->nodes[0];
1486 		btrfs_item_key_to_cpu(leaf, &key, slot);
1510 	 * what's the leaf (or leaves), from a fs tree, that has a file extent
1519 	 * tree (going from the root node down to the leaf that has the file
1530 		 * root node down to the leaf that has the file extent item that
1542 		 * leaf as the previous file extent item, we can skip resolving
1544 		 * is the same (same leaf, so same path). We skip as long as the
1545 		 * cached result for the leaf is valid and only if there's only
1902 	 * We may have previously determined that the current leaf is shared.
1905 	 * backrefs. If the leaf is not shared, then we must do backref walking
1955 		 *    item gets moved to another leaf due to a b+tree leaf split
1964 		 * 2) level >= 0, a tree node/leaf: We can have a mix of direct
1965 		 *    and indirect references on a b+tree node/leaf, so we have
1970 		 *    ref) for the same node/leaf.
2058 	const struct extent_buffer *leaf;
2070 		leaf = path->nodes[0];
2072 		if (slot >= btrfs_header_nritems(leaf)) {
2080 			 * leaf, we must move one leaf over.
2091 		btrfs_item_key_to_cpu(leaf, &found_key, slot);
2106 		ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
2507 				    "root %llu references leaf %llu, data list %#llx",
3156 		 * Add the node to leaf node list if no other child block