64 	unsigned int level:8;  member
144 	unsigned int level:8;  member
480 	int level = 0;  in update_backref_cache()  local
513 	for (level = 0; level < BTRFS_MAX_LEVEL; level++) {  in update_backref_cache()
514 		list_for_each_entry(node, &cache->pending[level], list) {  in update_backref_cache()
681 					int level, u64 bytenr)  argument
721 	node->level = level;
863 				upper->level = cur->level + 1;
894 		if (btrfs_root_level(&root->root_item) == cur->level) {
905 		level = cur->level + 1;
913 		path2->lowest_level = level;
920 		if (ret > 0 && path2->slots[level] > 0)
921 			path2->slots[level]--;
923 		eb = path2->nodes[level];
924 		WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) !=
929 		for (; level < BTRFS_MAX_LEVEL; level++) {
930 			if (!path2->nodes[level]) {
946 			eb = path2->nodes[level];
957 				upper->level = lower->level + 1;
1125 		if (upper->level > 0) {
1229 	new_node->level = node->level;
1742 		     struct btrfs_path *path, int level)  argument
1747 	btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1776 	int level;  local
1790 	level = btrfs_header_level(eb);
1792 	if (level < lowest_level) {
1812 		level = btrfs_header_level(parent);
1813 		BUG_ON(level < lowest_level);
1815 		ret = btrfs_bin_search(parent, &key, level, &slot);
1826 		if (level <= max_level) {
1827 			eb = path->nodes[level];
1829 							path->slots[level]);
1831 							path->slots[level]);
1838 			ret = level;
1843 		    memcmp_node_keys(parent, slot, path, level)) {
1844 			if (level <= lowest_level) {
1877 		btrfs_node_key_to_cpu(path->nodes[level], &key,
1878 				      path->slots[level]);
1881 		path->lowest_level = level;
1893 		btrfs_set_node_blockptr(path->nodes[level],
1894 					path->slots[level], old_bytenr);
1895 		btrfs_set_node_ptr_generation(path->nodes[level],
1896 					      path->slots[level], old_ptr_gen);
1897 		btrfs_mark_buffer_dirty(path->nodes[level]);
1900 					path->nodes[level]->start,
1901 					src->root_key.objectid, level - 1, 0,
1905 					0, dest->root_key.objectid, level - 1,
1910 					path->nodes[level]->start,
1911 					src->root_key.objectid, level - 1, 0,
1916 					0, dest->root_key.objectid, level - 1,
1922 		ret = level;
1935 		       int *level)  argument
1944 	for (i = 0; i < *level; i++) {
1949 	for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1958 			*level = i;
1972 			 int *level)  argument
1983 	for (i = *level; i > 0; i--) {
1993 			if (i == *level)
1995 			*level = i + 1;
1999 			*level = i;
2088 static int find_next_key(struct btrfs_path *path, int level,  argument
2092 	while (level < BTRFS_MAX_LEVEL) {
2093 		if (!path->nodes[level])
2095 		if (path->slots[level] + 1 <
2096 		    btrfs_header_nritems(path->nodes[level])) {
2097 			btrfs_node_key_to_cpu(path->nodes[level], key,
2098 					      path->slots[level] + 1);
2101 		level++;
2121 	int level;  local
2137 		level = btrfs_root_level(root_item);
2139 		path->nodes[level] = reloc_root->node;
2140 		path->slots[level] = 0;
2144 		level = root_item->drop_level;
2145 		BUG_ON(level == 0);
2146 		path->lowest_level = level;
2154 		btrfs_node_key_to_cpu(path->nodes[level], &next_key,
2155 				      path->slots[level]);
2180 		max_level = level;
2182 		ret = walk_down_reloc_tree(reloc_root, path, &level);
2190 		if (!find_next_key(path, level, &key) &&
2195 					   &next_key, level, max_level);
2203 			level = ret;
2204 			btrfs_node_key_to_cpu(path->nodes[level], &key,
2205 					      path->slots[level]);
2209 		ret = walk_up_reloc_tree(reloc_root, path, &level);
2213 		BUG_ON(level == 0);
2218 		btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2219 			       path->slots[level]);
2220 		root_item->drop_level = level;
2498 		if (!next || next->level <= node->level)
2507 		rc->backref_cache.path[next->level] = next;
2549 		if (!next || next->level <= node->level)
2655 	path->lowest_level = node->level + 1;
2656 	rc->backref_cache.path[node->level] = node;
2667 						       upper->level, &slot);
2685 				upper->eb = path->nodes[upper->level];
2686 				path->nodes[upper->level] = NULL;
2688 				BUG_ON(upper->eb != path->nodes[upper->level]);
2692 			path->locks[upper->level] = 0;
2694 			slot = path->slots[upper->level];
2697 			ret = btrfs_bin_search(upper->eb, key, upper->level,
2742 						node->level, 0, 1);
2786 	int level;  local
2789 	for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2790 		while (!list_empty(&cache->pending[level])) {
2791 			node = list_entry(cache->pending[level].next,
2802 		list_splice_init(&list, &cache->pending[level]);
2818 	if (node->level == 0 ||
2880 	WARN_ON(btrfs_header_level(eb) != block->level);
2881 	if (block->level == 0)
2928 			path->lowest_level = node->level;
2940 	if (ret || node->level == 0 || node->cowonly)
2989 					  block->level, block->bytenr);
3286 	int level = -1;  local
3298 			level = btrfs_tree_block_level(eb, bi);
3300 			level = (int)extent_key->offset;
3314 		level = (int)ref_owner;
3324 	BUG_ON(level == -1);
3333 	block->level = level;
3625 			block->level = 0;
4533 	int level;  local
4548 	level = btrfs_header_level(buf);
4555 		WARN_ON(!first_cow && level == 0);
4557 		node = rc->backref_cache.path[level];
4568 				       &rc->backref_cache.pending[level]);
4575 		if (first_cow && level > 0)
4579 	if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS)