40 	u64 bytenr;  member
48 	u64 bytenr;  member
128 	u64 bytenr;  member
142 	u64 bytenr;  member
289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,  in tree_insert()  argument
300 		if (bytenr < entry->bytenr)  in tree_insert()
302 		else if (bytenr > entry->bytenr)  in tree_insert()
313 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)  in tree_search()  argument
321 		if (bytenr < entry->bytenr)  in tree_search()
323 		else if (bytenr > entry->bytenr)  in tree_search()
331 static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr)  in backref_tree_panic()  argument
340 		    "found at offset %llu", bytenr);  in backref_tree_panic()
463 				struct backref_node *node, u64 bytenr)  in update_backref_node()  argument
467 	node->bytenr = bytenr;  in update_backref_node()
468 	rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node);  in update_backref_node()
470 		backref_tree_panic(rb_node, -EEXIST, bytenr);  in update_backref_node()
516 			if (node->bytenr == node->new_bytenr)  in update_backref_cache()
553 					  u64 bytenr)  in find_reloc_root()  argument
560 	rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr);  in find_reloc_root()
681 					int level, u64 bytenr)  argument
720 	node->bytenr = bytenr;
727 	key.objectid = cur->bytenr;
782 			if (key.objectid != cur->bytenr) {
810 		      exist->bytenr == key.offset))) {
843 				root = find_reloc_root(rc, cur->bytenr);
862 				upper->bytenr = key.offset;
897 			       cur->bytenr);
925 			cur->bytenr);
932 				       lower->bytenr);
955 				upper->bytenr = eb->start;
1036 		rb_node = tree_insert(&cache->rb_root, node->bytenr,
1039 			backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1085 			rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1089 						   upper->bytenr);
1228 	new_node->bytenr = dest->node->start;
1249 	rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1252 		backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1285 	node->bytenr = root->node->start;
1290 			      node->bytenr, &node->rb_node);
1295 			    "tree", node->bytenr);
1357 	node->bytenr = new_bytenr;
1359 			      node->bytenr, &node->rb_node);
1362 		backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1565 static int in_block_group(u64 bytenr,  argument
1568 	if (bytenr >= block_group->key.objectid &&
1569 	    bytenr < block_group->key.objectid + block_group->key.offset)
1578 			    u64 bytenr, u64 num_bytes)  argument
1590 	bytenr -= BTRFS_I(reloc_inode)->index_cnt;
1592 				       bytenr, 0);
1635 	u64 bytenr;  local
1664 		bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1666 		if (bytenr == 0)
1668 		if (!in_block_group(bytenr, rc->block_group))
1703 				       bytenr, num_bytes);
1725 		ret = btrfs_free_extent(trans, root, bytenr, num_bytes,
1976 	u64 bytenr;  local
2003 		bytenr = btrfs_node_blockptr(eb, path->slots[i]);
2004 		eb = read_tree_block(root, bytenr, ptr_gen);
2647 	u64 bytenr;  local
2669 				bytenr = btrfs_node_blockptr(upper->eb, slot);
2670 				if (node->eb->start == bytenr)
2702 		bytenr = btrfs_node_blockptr(upper->eb, slot);
2704 			BUG_ON(bytenr != node->bytenr);
2706 			if (node->eb->start == bytenr)
2712 		eb = read_tree_block(root, bytenr, generation);
2808 				 u64 bytenr, u32 blocksize)  argument
2810 	set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1,
2819 	    in_block_group(node->bytenr, rc->block_group)) {
2821 		mark_block_processed(rc, node->bytenr, blocksize);
2858 static int tree_block_processed(u64 bytenr, struct reloc_control *rc)  argument
2862 	if (test_range_bit(&rc->processed_blocks, bytenr,
2863 			   bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL))
2874 	eb = read_tree_block(rc->extent_root, block->bytenr,
2969 			readahead_tree_block(rc->extent_root, block->bytenr);
2989 					  block->level, block->bytenr);
3330 	block->bytenr = extent_key->objectid;
3336 	rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3338 		backref_tree_panic(rb_node, -EEXIST, block->bytenr);
3347 			    u64 bytenr, u32 blocksize,  argument
3356 	if (tree_block_processed(bytenr, rc))
3359 	if (tree_search(blocks, bytenr))
3366 	key.objectid = bytenr;
3386 			if (key.objectid == bytenr &&
3623 			block->bytenr = leaf->start;
3627 			rb_node = tree_insert(blocks, block->bytenr,
3631 						   block->bytenr);
4516 		new_bytenr = ordered->start + (sums->bytenr - disk_bytenr);
4517 		sums->bytenr = new_bytenr;
4558 		BUG_ON(node->bytenr != buf->start &&