26 static int __get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth)  in __get_index()  argument
30 	depth = info->dqi_qtree_depth - depth - 1;  in __get_index()
31 	while (depth--)  in __get_index()
36 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth)  in get_index()  argument
40 	return __get_index(info, id, depth);  in get_index()
330 			  uint *treeblk, int depth)  in do_insert_tree()  argument
355 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in do_insert_tree()
362 	if (depth == info->dqi_qtree_depth - 1) {  in do_insert_tree()
368 						dquot->dq_id, depth)]));  in do_insert_tree()
375 		ret = do_insert_tree(info, dquot, &newblk, depth+1);  in do_insert_tree()
378 		ref[get_index(info, dquot->dq_id, depth)] =  in do_insert_tree()
514 		       uint *blk, int depth)  in remove_tree()  argument
529 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in remove_tree()
535 	if (depth == info->dqi_qtree_depth - 1) {  in remove_tree()
539 		ret = remove_tree(info, dquot, &newblk, depth+1);  in remove_tree()
543 		ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0);  in remove_tree()
616 				struct dquot *dquot, uint blk, int depth)  in find_tree_dqentry()  argument
631 	blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in find_tree_dqentry()
639 	if (depth < info->dqi_qtree_depth - 1)  in find_tree_dqentry()
640 		ret = find_tree_dqentry(info, dquot, blk, depth+1);  in find_tree_dqentry()
729 			unsigned int blk, int depth)  in find_next_id()  argument
741 	for (i = depth; i < info->dqi_qtree_depth - 1; i++)  in find_next_id()
750 	for (i = __get_index(info, *id, depth); i < epb; i++) {  in find_next_id()
761 		if (depth == info->dqi_qtree_depth - 1) {  in find_next_id()
765 		ret = find_next_id(info, id, blk_no, depth + 1);  in find_next_id()