Lines Matching refs:blk
50 static ssize_t read_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in read_blk() argument
56 info->dqi_usable_bs, (loff_t)blk << info->dqi_blocksize_bits); in read_blk()
59 static ssize_t write_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in write_blk() argument
65 info->dqi_usable_bs, (loff_t)blk << info->dqi_blocksize_bits); in write_blk()
113 int ret, blk; in get_free_dqblk() local
118 blk = info->dqi_free_blk; in get_free_dqblk()
119 ret = read_blk(info, blk, buf); in get_free_dqblk()
133 blk = info->dqi_blocks++; in get_free_dqblk()
136 ret = blk; in get_free_dqblk()
143 static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk) in put_free_dqblk() argument
151 err = write_blk(info, blk, buf); in put_free_dqblk()
154 info->dqi_free_blk = blk; in put_free_dqblk()
161 uint blk) in remove_free_dqentry() argument
197 if (write_blk(info, blk, buf) < 0) in remove_free_dqentry()
199 "with free entries", blk); in remove_free_dqentry()
208 uint blk) in insert_free_dqentry() argument
218 err = write_blk(info, blk, buf); in insert_free_dqentry()
226 cpu_to_le32(blk); in insert_free_dqentry()
232 info->dqi_free_entry = blk; in insert_free_dqentry()
256 uint blk, i; in find_free_dqentry() local
268 blk = info->dqi_free_entry; in find_free_dqentry()
269 *err = read_blk(info, blk, buf); in find_free_dqentry()
276 blk = get_free_dqblk(info); in find_free_dqentry()
277 if ((int)blk < 0) { in find_free_dqentry()
278 *err = blk; in find_free_dqentry()
285 info->dqi_free_entry = blk; in find_free_dqentry()
290 *err = remove_free_dqentry(info, buf, blk); in find_free_dqentry()
293 "from entry free list", blk); in find_free_dqentry()
312 *err = write_blk(info, blk, buf); in find_free_dqentry()
315 blk); in find_free_dqentry()
318 dquot->dq_off = ((loff_t)blk << info->dqi_blocksize_bits) + in find_free_dqentry()
322 return blk; in find_free_dqentry()
449 uint blk) in free_dqentry() argument
457 if (dquot->dq_off >> info->dqi_blocksize_bits != blk) { in free_dqentry()
459 "other block (%u) than it should (%u)", blk, in free_dqentry()
464 ret = read_blk(info, blk, buf); in free_dqentry()
467 blk); in free_dqentry()
476 ret = remove_free_dqentry(info, buf, blk); in free_dqentry()
478 ret = put_free_dqblk(info, buf, blk); in free_dqentry()
481 "(%u) to free list", blk); in free_dqentry()
491 ret = insert_free_dqentry(info, buf, blk); in free_dqentry()
494 "data block (%u) to free entry list", blk); in free_dqentry()
498 ret = write_blk(info, blk, buf); in free_dqentry()
501 "data block %u", blk); in free_dqentry()
514 uint *blk, int depth) in remove_tree() argument
523 ret = read_blk(info, *blk, buf); in remove_tree()
526 *blk); in remove_tree()
549 && *blk != QT_TREEOFF) { in remove_tree()
550 put_free_dqblk(info, buf, *blk); in remove_tree()
551 *blk = 0; in remove_tree()
553 ret = write_blk(info, *blk, buf); in remove_tree()
557 *blk); in remove_tree()
578 struct dquot *dquot, uint blk) in find_block_dqentry() argument
587 ret = read_blk(info, blk, buf); in find_block_dqentry()
590 "block %u", blk); in find_block_dqentry()
606 ret = ((loff_t)blk << info->dqi_blocksize_bits) + sizeof(struct in find_block_dqentry()
616 struct dquot *dquot, uint blk, int depth) in find_tree_dqentry() argument
624 ret = read_blk(info, blk, buf); in find_tree_dqentry()
627 blk); in find_tree_dqentry()
631 blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in find_tree_dqentry()
632 if (!blk) /* No reference? */ in find_tree_dqentry()
634 ret = do_check_range(dquot->dq_sb, "block", blk, QT_TREEOFF, in find_tree_dqentry()
640 ret = find_tree_dqentry(info, dquot, blk, depth+1); in find_tree_dqentry()
642 ret = find_block_dqentry(info, dquot, blk); in find_tree_dqentry()
729 unsigned int blk, int depth) in find_next_id() argument
744 ret = read_blk(info, blk, buf); in find_next_id()
747 "Can't read quota tree block %u", blk); in find_next_id()