336 			  uint *blks, int depth)  in do_insert_tree()  argument
346 	if (!blks[depth]) {  in do_insert_tree()
351 			if (ret == blks[i]) {  in do_insert_tree()
358 		blks[depth] = ret;  in do_insert_tree()
362 		ret = read_blk(info, blks[depth], buf);  in do_insert_tree()
365 				    "block %u", blks[depth]);  in do_insert_tree()
379 			if (newblk == blks[i]) {  in do_insert_tree()
382 					blks[depth],  in do_insert_tree()
388 	blks[depth + 1] = newblk;  in do_insert_tree()
400 		blks[depth + 1] = find_free_dqentry(info, dquot, &ret);  in do_insert_tree()
402 		ret = do_insert_tree(info, dquot, blks, depth + 1);  in do_insert_tree()
406 						cpu_to_le32(blks[depth + 1]);  in do_insert_tree()
407 		ret = write_blk(info, blks[depth], buf);  in do_insert_tree()
409 		put_free_dqblk(info, buf, blks[depth]);  in do_insert_tree()
420 	uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };  in dq_insert_tree()  local
432 	return do_insert_tree(info, dquot, blks, 0);  in dq_insert_tree()
545 		       uint *blks, int depth)  in remove_tree()  argument
555 	ret = read_blk(info, blks[depth], buf);  in remove_tree()
558 			    blks[depth]);  in remove_tree()
568 		if (newblk == blks[i]) {  in remove_tree()
571 				blks[depth],  in remove_tree()
578 		blks[depth + 1] = 0;  in remove_tree()
580 		blks[depth + 1] = newblk;  in remove_tree()
581 		ret = remove_tree(info, dquot, blks, depth + 1);  in remove_tree()
583 	if (ret >= 0 && !blks[depth + 1]) {  in remove_tree()
590 		    && blks[depth] != QT_TREEOFF) {  in remove_tree()
591 			put_free_dqblk(info, buf, blks[depth]);  in remove_tree()
592 			blks[depth] = 0;  in remove_tree()
594 			ret = write_blk(info, blks[depth], buf);  in remove_tree()
598 					    blks[depth]);  in remove_tree()
609 	uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };  in qtree_delete_dquot()  local
617 	return remove_tree(info, dquot, blks, 0);  in qtree_delete_dquot()
661 				struct dquot *dquot, uint *blks, int depth)  in find_tree_dqentry()  argument
671 	ret = read_blk(info, blks[depth], buf);  in find_tree_dqentry()
674 			    blks[depth]);  in find_tree_dqentry()
688 		if (blk == blks[i]) {  in find_tree_dqentry()
691 				blks[depth],  in find_tree_dqentry()
696 	blks[depth + 1] = blk;  in find_tree_dqentry()
698 		ret = find_tree_dqentry(info, dquot, blks, depth + 1);  in find_tree_dqentry()
710 	uint blks[MAX_QTREE_DEPTH] = { QT_TREEOFF };  in find_dqentry()  local
716 	return find_tree_dqentry(info, dquot, blks, 0);  in find_dqentry()