56 static ssize_t read_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf)  in read_blk()  argument
62 	       info->dqi_usable_bs, (loff_t)blk << info->dqi_blocksize_bits);  in read_blk()
65 static ssize_t write_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf)  in write_blk()  argument
71 	       info->dqi_usable_bs, (loff_t)blk << info->dqi_blocksize_bits);  in write_blk()
119 	int ret, blk;  in get_free_dqblk()  local
124 		blk = info->dqi_free_blk;  in get_free_dqblk()
125 		ret = read_blk(info, blk, buf);  in get_free_dqblk()
139 		blk = info->dqi_blocks++;  in get_free_dqblk()
142 	ret = blk;  in get_free_dqblk()
149 static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk)  in put_free_dqblk()  argument
157 	err = write_blk(info, blk, buf);  in put_free_dqblk()
160 	info->dqi_free_blk = blk;  in put_free_dqblk()
167 			       uint blk)  in remove_free_dqentry()  argument
203 	if (write_blk(info, blk, buf) < 0)  in remove_free_dqentry()
205 			    "with free entries", blk);  in remove_free_dqentry()
214 			       uint blk)  in insert_free_dqentry()  argument
224 	err = write_blk(info, blk, buf);  in insert_free_dqentry()
232 							cpu_to_le32(blk);  in insert_free_dqentry()
238 	info->dqi_free_entry = blk;  in insert_free_dqentry()
262 	uint blk, i;  in find_free_dqentry()  local
274 		blk = info->dqi_free_entry;  in find_free_dqentry()
275 		*err = read_blk(info, blk, buf);  in find_free_dqentry()
282 		blk = get_free_dqblk(info);  in find_free_dqentry()
283 		if ((int)blk < 0) {  in find_free_dqentry()
284 			*err = blk;  in find_free_dqentry()
291 		info->dqi_free_entry = blk;  in find_free_dqentry()
296 		*err = remove_free_dqentry(info, buf, blk);  in find_free_dqentry()
299 				    "from entry free list", blk);  in find_free_dqentry()
318 	*err = write_blk(info, blk, buf);  in find_free_dqentry()
321 			    blk);  in find_free_dqentry()
324 	dquot->dq_off = ((loff_t)blk << info->dqi_blocksize_bits) +  in find_free_dqentry()
328 	return blk;  in find_free_dqentry()
480 			uint blk)  in free_dqentry()  argument
488 	if (dquot->dq_off >> info->dqi_blocksize_bits != blk) {  in free_dqentry()
490 			"other block (%u) than it should (%u)", blk,  in free_dqentry()
495 	ret = read_blk(info, blk, buf);  in free_dqentry()
498 			    blk);  in free_dqentry()
507 		ret = remove_free_dqentry(info, buf, blk);  in free_dqentry()
509 			ret = put_free_dqblk(info, buf, blk);  in free_dqentry()
512 				    "(%u) to free list", blk);  in free_dqentry()
522 			ret = insert_free_dqentry(info, buf, blk);  in free_dqentry()
525 				    "data block (%u) to free entry list", blk);  in free_dqentry()
529 			ret = write_blk(info, blk, buf);  in free_dqentry()
532 					    "data block %u", blk);  in free_dqentry()
623 				 struct dquot *dquot, uint blk)  in find_block_dqentry()  argument
632 	ret = read_blk(info, blk, buf);  in find_block_dqentry()
635 			    "block %u", blk);  in find_block_dqentry()
651 		ret = ((loff_t)blk << info->dqi_blocksize_bits) + sizeof(struct  in find_block_dqentry()
666 	uint blk;  in find_tree_dqentry()  local
678 	blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in find_tree_dqentry()
679 	if (!blk)	/* No reference? */  in find_tree_dqentry()
681 	ret = do_check_range(dquot->dq_sb, "block", blk, QT_TREEOFF,  in find_tree_dqentry()
688 		if (blk == blks[i]) {  in find_tree_dqentry()
696 	blks[depth + 1] = blk;  in find_tree_dqentry()
700 		ret = find_block_dqentry(info, dquot, blk);  in find_tree_dqentry()
793 			unsigned int blk, int depth)  in find_next_id()  argument
808 	ret = read_blk(info, blk, buf);  in find_next_id()
811 			    "Can't read quota tree block %u", blk);  in find_next_id()