fs/btrfs/backref.c

132 		if (disk_byte != ctx->bytenr)
443 static int is_shared_data_backref(struct preftrees *preftrees, u64 bytenr)
451 	target.parent = bytenr;
499 	 * 2. We are searching for normal backref but bytenr of this leaf
526 		 * We are searching for normal backref but bytenr of this leaf
933 					       node->bytenr, count, sc,
944 					     ref->parent, node->bytenr, count,
976 					       &key, 0, node->bytenr, count, sc,
987 					     node->bytenr, count, sc,
1009  * add all inline backrefs for bytenr to the list
1039 		ret = ctx->check_extent_item(ctx->bytenr, ei, leaf, ctx->user_ctx);
1081 					     ctx->bytenr, 1, NULL, GFP_NOFS);
1091 					     ctx->bytenr, count, sc, GFP_NOFS);
1097 					       ctx->bytenr, 1, NULL, GFP_NOFS);
1123 						       root, &key, 0, ctx->bytenr,
1142  * add all non-inline backrefs for bytenr to the list
1171 		if (key.objectid != ctx->bytenr)
1183 					     ctx->bytenr, 1, NULL, GFP_NOFS);
1194 					     key.offset, ctx->bytenr, count,
1201 					       NULL, info_level + 1, ctx->bytenr,
1230 						       &key, 0, ctx->bytenr,
1252 					u64 bytenr, int level, bool *is_shared)
1277 	if (entry->bytenr != bytenr)
1322 				       u64 bytenr, int level, bool is_shared)
1351 	entry->bytenr = bytenr;
1373  * refs) for the given bytenr to the refs list, merges duplicates and resolves
1374  * indirect refs to their parent bytenr.
1388 	struct btrfs_root *root = btrfs_extent_root(ctx->fs_info, ctx->bytenr);
1408 	key.objectid = ctx->bytenr;
1451 		head = btrfs_find_delayed_ref_head(delayed_refs, ctx->bytenr);
1487 		if (key.objectid == ctx->bytenr &&
1523 	if (sc && ctx->bytenr == sc->data_bytenr) {
1696  * @ctx->bytenr and @ctx->extent_item_pos. The bytenr of the found leaves are
1746 	const u64 orig_bytenr = ctx->bytenr;
1786 		ctx->bytenr = node->val;
1792 	ctx->bytenr = orig_bytenr;
1837  * @bytenr:      Logical bytenr of the extent we are checking.
1853 int btrfs_is_data_extent_shared(struct btrfs_inode *inode, u64 bytenr,
1869 		.data_bytenr = bytenr,
1880 		if (ctx->prev_extents_cache[i].bytenr == bytenr)
1921 	/* -1 means we are in the bytenr of the data extent. */
1927 		walk_ctx.bytenr = bytenr;
1934 				store_backref_shared_cache(ctx, root, bytenr,
1943 		 * More than one extent buffer (bytenr) may have been added to
1967 		 *    current bytenr) may be shared or not. One example is
1976 			store_backref_shared_cache(ctx, root, bytenr,
1981 		bytenr = node->val;
1987 			cached = lookup_backref_shared_cache(ctx, root, bytenr,
2011 			bytenr = ctx->path_cache_entries[level].bytenr;
2013 			store_backref_shared_cache(ctx, root, bytenr, level, ret);
2018 			ctx->path_cache_entries[i].bytenr = 0;
2028 		ctx->prev_extents_cache[slot].bytenr = shared.data_bytenr;
2426 		    ctx->bytenr);
2496 		ctx->bytenr = leaf_bytenr;
2511 						root_node->val, ctx->bytenr,
2573 	walk_ctx.bytenr = found_key.objectid;
2852 	iter->bytenr = 0;
2860 int btrfs_backref_iter_start(struct btrfs_backref_iter *iter, u64 bytenr)
2863 	struct btrfs_root *extent_root = btrfs_extent_root(fs_info, bytenr);
2869 	key.objectid = bytenr;
2872 	iter->bytenr = bytenr;
2894 	     key.type != BTRFS_METADATA_ITEM_KEY) || key.objectid != bytenr) {
2933 		if (iter->cur_key.objectid != bytenr ||
2961  * Go to the next backref item of current bytenr, can be either inlined or
2967  * Return >0 if there is no extra backref for this bytenr.
3004 	extent_root = btrfs_extent_root(iter->fs_info, iter->bytenr);
3010 	if (iter->cur_key.objectid != iter->bytenr ||
3040 		struct btrfs_backref_cache *cache, u64 bytenr, int level)
3055 	node->bytenr = bytenr;
3217  * Direct tree backref means, the backref item shows its parent bytenr
3222  *		For inlined backref, objectid is the bytenr,
3243 			root = find_reloc_root(cache->fs_info, cur->bytenr);
3325 		ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr);
3334 		 * bytenr), thus only do such check for reloc cache.
3361 	if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) {
3364 			  cur->bytenr, level - 1, root->root_key.objectid,
3376 			       lower->bytenr);
3478 	ret = btrfs_backref_iter_start(iter, cur->bytenr);
3524 		key.objectid = iter->bytenr;
3552 		      exist->bytenr == key.offset))) {
3557 		/* SHARED_BLOCK_REF means key.offset is the parent bytenr */
3566 			 * the tree to get its parent bytenr.
3601 		rb_node = rb_simple_insert(&cache->rb_root, start->bytenr,
3604 			btrfs_backref_panic(cache->fs_info, start->bytenr,
3669 			rb_node = rb_simple_insert(&cache->rb_root, upper->bytenr,
3673 						upper->bytenr, -EEXIST);