Lines Matching refs:info

25 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth)  in get_index()  argument
27 unsigned int epb = info->dqi_usable_bs >> 2; in get_index()
30 depth = info->dqi_qtree_depth - depth - 1; in get_index()
37 static int qtree_dqstr_in_blk(struct qtree_mem_dqinfo *info) in qtree_dqstr_in_blk() argument
39 return (info->dqi_usable_bs - sizeof(struct qt_disk_dqdbheader)) in qtree_dqstr_in_blk()
40 / info->dqi_entry_size; in qtree_dqstr_in_blk()
52 static ssize_t read_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in read_blk() argument
54 struct super_block *sb = info->dqi_sb; in read_blk()
56 memset(buf, 0, info->dqi_usable_bs); in read_blk()
57 return sb->s_op->quota_read(sb, info->dqi_type, buf, in read_blk()
58 info->dqi_usable_bs, blk << info->dqi_blocksize_bits); in read_blk()
61 static ssize_t write_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in write_blk() argument
63 struct super_block *sb = info->dqi_sb; in write_blk()
66 ret = sb->s_op->quota_write(sb, info->dqi_type, buf, in write_blk()
67 info->dqi_usable_bs, blk << info->dqi_blocksize_bits); in write_blk()
68 if (ret != info->dqi_usable_bs) { in write_blk()
77 static int get_free_dqblk(struct qtree_mem_dqinfo *info) in get_free_dqblk() argument
79 char *buf = getdqbuf(info->dqi_usable_bs); in get_free_dqblk()
85 if (info->dqi_free_blk) { in get_free_dqblk()
86 blk = info->dqi_free_blk; in get_free_dqblk()
87 ret = read_blk(info, blk, buf); in get_free_dqblk()
90 info->dqi_free_blk = le32_to_cpu(dh->dqdh_next_free); in get_free_dqblk()
93 memset(buf, 0, info->dqi_usable_bs); in get_free_dqblk()
95 ret = write_blk(info, info->dqi_blocks, buf); in get_free_dqblk()
98 blk = info->dqi_blocks++; in get_free_dqblk()
100 mark_info_dirty(info->dqi_sb, info->dqi_type); in get_free_dqblk()
108 static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk) in put_free_dqblk() argument
113 dh->dqdh_next_free = cpu_to_le32(info->dqi_free_blk); in put_free_dqblk()
116 err = write_blk(info, blk, buf); in put_free_dqblk()
119 info->dqi_free_blk = blk; in put_free_dqblk()
120 mark_info_dirty(info->dqi_sb, info->dqi_type); in put_free_dqblk()
125 static int remove_free_dqentry(struct qtree_mem_dqinfo *info, char *buf, in remove_free_dqentry() argument
128 char *tmpbuf = getdqbuf(info->dqi_usable_bs); in remove_free_dqentry()
137 err = read_blk(info, nextblk, tmpbuf); in remove_free_dqentry()
142 err = write_blk(info, nextblk, tmpbuf); in remove_free_dqentry()
147 err = read_blk(info, prevblk, tmpbuf); in remove_free_dqentry()
152 err = write_blk(info, prevblk, tmpbuf); in remove_free_dqentry()
156 info->dqi_free_entry = nextblk; in remove_free_dqentry()
157 mark_info_dirty(info->dqi_sb, info->dqi_type); in remove_free_dqentry()
162 if (write_blk(info, blk, buf) < 0) in remove_free_dqentry()
163 quota_error(info->dqi_sb, "Can't write block (%u) " in remove_free_dqentry()
172 static int insert_free_dqentry(struct qtree_mem_dqinfo *info, char *buf, in insert_free_dqentry() argument
175 char *tmpbuf = getdqbuf(info->dqi_usable_bs); in insert_free_dqentry()
181 dh->dqdh_next_free = cpu_to_le32(info->dqi_free_entry); in insert_free_dqentry()
183 err = write_blk(info, blk, buf); in insert_free_dqentry()
186 if (info->dqi_free_entry) { in insert_free_dqentry()
187 err = read_blk(info, info->dqi_free_entry, tmpbuf); in insert_free_dqentry()
192 err = write_blk(info, info->dqi_free_entry, tmpbuf); in insert_free_dqentry()
197 info->dqi_free_entry = blk; in insert_free_dqentry()
198 mark_info_dirty(info->dqi_sb, info->dqi_type); in insert_free_dqentry()
206 int qtree_entry_unused(struct qtree_mem_dqinfo *info, char *disk) in qtree_entry_unused() argument
210 for (i = 0; i < info->dqi_entry_size; i++) in qtree_entry_unused()
218 static uint find_free_dqentry(struct qtree_mem_dqinfo *info, in find_free_dqentry() argument
223 char *buf = getdqbuf(info->dqi_usable_bs); in find_free_dqentry()
232 if (info->dqi_free_entry) { in find_free_dqentry()
233 blk = info->dqi_free_entry; in find_free_dqentry()
234 *err = read_blk(info, blk, buf); in find_free_dqentry()
238 blk = get_free_dqblk(info); in find_free_dqentry()
244 memset(buf, 0, info->dqi_usable_bs); in find_free_dqentry()
247 info->dqi_free_entry = blk; in find_free_dqentry()
251 if (le16_to_cpu(dh->dqdh_entries) + 1 >= qtree_dqstr_in_blk(info)) { in find_free_dqentry()
252 *err = remove_free_dqentry(info, buf, blk); in find_free_dqentry()
262 for (i = 0; i < qtree_dqstr_in_blk(info); i++) { in find_free_dqentry()
263 if (qtree_entry_unused(info, ddquot)) in find_free_dqentry()
265 ddquot += info->dqi_entry_size; in find_free_dqentry()
268 if (i == qtree_dqstr_in_blk(info)) { in find_free_dqentry()
274 *err = write_blk(info, blk, buf); in find_free_dqentry()
280 dquot->dq_off = (blk << info->dqi_blocksize_bits) + in find_free_dqentry()
282 i * info->dqi_entry_size; in find_free_dqentry()
291 static int do_insert_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot, in do_insert_tree() argument
294 char *buf = getdqbuf(info->dqi_usable_bs); in do_insert_tree()
302 ret = get_free_dqblk(info); in do_insert_tree()
306 memset(buf, 0, info->dqi_usable_bs); in do_insert_tree()
309 ret = read_blk(info, *treeblk, buf); in do_insert_tree()
317 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in do_insert_tree()
320 if (depth == info->dqi_qtree_depth - 1) { in do_insert_tree()
325 le32_to_cpu(ref[get_index(info, in do_insert_tree()
331 newblk = find_free_dqentry(info, dquot, &ret); in do_insert_tree()
333 ret = do_insert_tree(info, dquot, &newblk, depth+1); in do_insert_tree()
336 ref[get_index(info, dquot->dq_id, depth)] = in do_insert_tree()
338 ret = write_blk(info, *treeblk, buf); in do_insert_tree()
340 put_free_dqblk(info, buf, *treeblk); in do_insert_tree()
348 static inline int dq_insert_tree(struct qtree_mem_dqinfo *info, in dq_insert_tree() argument
354 if (info->dqi_blocks <= QT_TREEOFF) { in dq_insert_tree()
359 return do_insert_tree(info, dquot, &tmp, 0); in dq_insert_tree()
366 int qtree_write_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_write_dquot() argument
371 char *ddquot = getdqbuf(info->dqi_entry_size); in qtree_write_dquot()
378 ret = dq_insert_tree(info, dquot); in qtree_write_dquot()
387 info->dqi_ops->mem2disk_dqblk(ddquot, dquot); in qtree_write_dquot()
389 ret = sb->s_op->quota_write(sb, type, ddquot, info->dqi_entry_size, in qtree_write_dquot()
391 if (ret != info->dqi_entry_size) { in qtree_write_dquot()
406 static int free_dqentry(struct qtree_mem_dqinfo *info, struct dquot *dquot, in free_dqentry() argument
410 char *buf = getdqbuf(info->dqi_usable_bs); in free_dqentry()
415 if (dquot->dq_off >> info->dqi_blocksize_bits != blk) { in free_dqentry()
418 (uint)(dquot->dq_off >> info->dqi_blocksize_bits)); in free_dqentry()
421 ret = read_blk(info, blk, buf); in free_dqentry()
430 ret = remove_free_dqentry(info, buf, blk); in free_dqentry()
432 ret = put_free_dqblk(info, buf, blk); in free_dqentry()
440 (dquot->dq_off & ((1 << info->dqi_blocksize_bits) - 1)), in free_dqentry()
441 0, info->dqi_entry_size); in free_dqentry()
443 qtree_dqstr_in_blk(info) - 1) { in free_dqentry()
445 ret = insert_free_dqentry(info, buf, blk); in free_dqentry()
452 ret = write_blk(info, blk, buf); in free_dqentry()
467 static int remove_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot, in remove_tree() argument
470 char *buf = getdqbuf(info->dqi_usable_bs); in remove_tree()
477 ret = read_blk(info, *blk, buf); in remove_tree()
483 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in remove_tree()
484 if (depth == info->dqi_qtree_depth - 1) { in remove_tree()
485 ret = free_dqentry(info, dquot, newblk); in remove_tree()
488 ret = remove_tree(info, dquot, &newblk, depth+1); in remove_tree()
492 ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0); in remove_tree()
494 for (i = 0; i < (info->dqi_usable_bs >> 2) && !ref[i]; i++) in remove_tree()
497 if (i == (info->dqi_usable_bs >> 2) in remove_tree()
499 put_free_dqblk(info, buf, *blk); in remove_tree()
502 ret = write_blk(info, *blk, buf); in remove_tree()
515 int qtree_delete_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_delete_dquot() argument
521 return remove_tree(info, dquot, &tmp, 0); in qtree_delete_dquot()
526 static loff_t find_block_dqentry(struct qtree_mem_dqinfo *info, in find_block_dqentry() argument
529 char *buf = getdqbuf(info->dqi_usable_bs); in find_block_dqentry()
536 ret = read_blk(info, blk, buf); in find_block_dqentry()
543 for (i = 0; i < qtree_dqstr_in_blk(info); i++) { in find_block_dqentry()
544 if (info->dqi_ops->is_id(ddquot, dquot)) in find_block_dqentry()
546 ddquot += info->dqi_entry_size; in find_block_dqentry()
548 if (i == qtree_dqstr_in_blk(info)) { in find_block_dqentry()
555 ret = (blk << info->dqi_blocksize_bits) + sizeof(struct in find_block_dqentry()
556 qt_disk_dqdbheader) + i * info->dqi_entry_size; in find_block_dqentry()
564 static loff_t find_tree_dqentry(struct qtree_mem_dqinfo *info, in find_tree_dqentry() argument
567 char *buf = getdqbuf(info->dqi_usable_bs); in find_tree_dqentry()
573 ret = read_blk(info, blk, buf); in find_tree_dqentry()
580 blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in find_tree_dqentry()
583 if (depth < info->dqi_qtree_depth - 1) in find_tree_dqentry()
584 ret = find_tree_dqentry(info, dquot, blk, depth+1); in find_tree_dqentry()
586 ret = find_block_dqentry(info, dquot, blk); in find_tree_dqentry()
593 static inline loff_t find_dqentry(struct qtree_mem_dqinfo *info, in find_dqentry() argument
596 return find_tree_dqentry(info, dquot, QT_TREEOFF, 0); in find_dqentry()
599 int qtree_read_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_read_dquot() argument
616 offset = find_dqentry(info, dquot); in qtree_read_dquot()
631 ddquot = getdqbuf(info->dqi_entry_size); in qtree_read_dquot()
634 ret = sb->s_op->quota_read(sb, type, ddquot, info->dqi_entry_size, in qtree_read_dquot()
636 if (ret != info->dqi_entry_size) { in qtree_read_dquot()
647 info->dqi_ops->disk2mem_dqblk(dquot, ddquot); in qtree_read_dquot()
663 int qtree_release_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_release_dquot() argument
667 return qtree_delete_dquot(info, dquot); in qtree_release_dquot()