fs/btrfs/qgroup.c

2107 static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
2113 	if (root_level == 0)
2116 	while (level <= root_level) {
2127 			if (level != root_level) {
2147 	eb = path->nodes[root_level];
2148 	if (path->slots[root_level] >= btrfs_header_nritems(eb))
2176  * @root_level = 1
2203 				    int dst_level, int root_level,
2210 	int cur_level = root_level;
2213 	BUG_ON(dst_level > root_level);
2215 	if (btrfs_header_level(src_eb) != root_level)
2231 	src_path->nodes[root_level] = src_eb;
2232 	src_path->slots[root_level] = dst_path->slots[root_level];
2233 	src_path->locks[root_level] = 0;
2319  * @root_level = 1
2329 					   int cur_level, int root_level,
2340 	    root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
2341 	    root_level < cur_level) {
2343 			"%s: bad levels, cur_level=%d root_level=%d",
2344 			__func__, cur_level, root_level);
2354 		 * dst_path->nodes[root_level] must be initialized before
2357 		if (cur_level == root_level) {
2359 	"%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2360 				__func__, root_level, root_level, cur_level);
2392 				       root_level, trace_leaf);
2408 					dst_path, cur_level - 1, root_level,
2494 			       u64 root_gen, int root_level)
2503 	ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL);
2521 	if (root_level >= drop_subptree_thres) {
2530 			.level = root_level
2538 	if (root_level == 0) {
2557 	path->nodes[root_level] = root_eb;
2558 	path->slots[root_level] = 0;
2559 	path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
2561 	level = root_level;
2600 			ret = adjust_slots_upwards(path, root_level);