25 #define GETIDINDEX(id, depth) (((id) >> ((V2_DQTREEDEPTH-(depth)-1)*8)) & 0xff)  argument
347 static int do_insert_tree(struct dquot *dquot, uint *treeblk, int depth)  in do_insert_tree()  argument
373 	newblk = le32_to_cpu(ref[GETIDINDEX(dquot->dq_id, depth)]);  in do_insert_tree()
376 	if (depth == V2_DQTREEDEPTH-1) {  in do_insert_tree()
379 … "VFS: Inserting already present quota entry (block %u).\n", ref[GETIDINDEX(dquot->dq_id, depth)]);  in do_insert_tree()
387 		ret = do_insert_tree(dquot, &newblk, depth+1);  in do_insert_tree()
389 		ref[GETIDINDEX(dquot->dq_id, depth)] = cpu_to_le32(newblk);  in do_insert_tree()
491 static int remove_tree(struct dquot *dquot, uint *blk, int depth)  in remove_tree()  argument
506 	newblk = le32_to_cpu(ref[GETIDINDEX(dquot->dq_id, depth)]);  in remove_tree()
507 	if (depth == V2_DQTREEDEPTH-1) {  in remove_tree()
512 		ret = remove_tree(dquot, &newblk, depth+1);  in remove_tree()
515 		ref[GETIDINDEX(dquot->dq_id, depth)] = cpu_to_le32(0);  in remove_tree()
578 static loff_t find_tree_dqentry(struct dquot *dquot, uint blk, int depth)  in find_tree_dqentry()  argument
592 	blk = le32_to_cpu(ref[GETIDINDEX(dquot->dq_id, depth)]);  in find_tree_dqentry()
595 	if (depth < V2_DQTREEDEPTH-1)  in find_tree_dqentry()
596 		ret = find_tree_dqentry(dquot, blk, depth+1);  in find_tree_dqentry()