27 static int get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth)  in get_index()  argument
31 	depth = info->dqi_qtree_depth - depth - 1;  in get_index()
32 	while (depth--)  in get_index()
285 			  uint *treeblk, int depth)  in do_insert_tree()  argument
310 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in do_insert_tree()
313 	if (depth == info->dqi_qtree_depth - 1) {  in do_insert_tree()
319 						dquot->dq_id, depth)]));  in do_insert_tree()
326 		ret = do_insert_tree(info, dquot, &newblk, depth+1);  in do_insert_tree()
329 		ref[get_index(info, dquot->dq_id, depth)] =  in do_insert_tree()
453 		       uint *blk, int depth)  in remove_tree()  argument
467 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in remove_tree()
468 	if (depth == info->dqi_qtree_depth - 1) {  in remove_tree()
472 		ret = remove_tree(info, dquot, &newblk, depth+1);  in remove_tree()
476 		ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0);  in remove_tree()
544 				struct dquot *dquot, uint blk, int depth)  in find_tree_dqentry()  argument
558 	blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in find_tree_dqentry()
561 	if (depth < info->dqi_qtree_depth - 1)  in find_tree_dqentry()
562 		ret = find_tree_dqentry(info, dquot, blk, depth+1);  in find_tree_dqentry()