Lines Matching refs:info
26 static int __get_index(struct qtree_mem_dqinfo *info, qid_t id, int depth) in __get_index() argument
28 unsigned int epb = info->dqi_usable_bs >> 2; in __get_index()
30 depth = info->dqi_qtree_depth - depth - 1; in __get_index()
36 static int get_index(struct qtree_mem_dqinfo *info, struct kqid qid, int depth) in get_index() argument
40 return __get_index(info, id, depth); in get_index()
44 static int qtree_dqstr_in_blk(struct qtree_mem_dqinfo *info) in qtree_dqstr_in_blk() argument
46 return (info->dqi_usable_bs - sizeof(struct qt_disk_dqdbheader)) in qtree_dqstr_in_blk()
47 / info->dqi_entry_size; in qtree_dqstr_in_blk()
59 static ssize_t read_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in read_blk() argument
61 struct super_block *sb = info->dqi_sb; in read_blk()
63 memset(buf, 0, info->dqi_usable_bs); in read_blk()
64 return sb->s_op->quota_read(sb, info->dqi_type, buf, in read_blk()
65 info->dqi_usable_bs, blk << info->dqi_blocksize_bits); in read_blk()
68 static ssize_t write_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf) in write_blk() argument
70 struct super_block *sb = info->dqi_sb; in write_blk()
73 ret = sb->s_op->quota_write(sb, info->dqi_type, buf, in write_blk()
74 info->dqi_usable_bs, blk << info->dqi_blocksize_bits); in write_blk()
75 if (ret != info->dqi_usable_bs) { in write_blk()
84 static int get_free_dqblk(struct qtree_mem_dqinfo *info) in get_free_dqblk() argument
86 char *buf = getdqbuf(info->dqi_usable_bs); in get_free_dqblk()
92 if (info->dqi_free_blk) { in get_free_dqblk()
93 blk = info->dqi_free_blk; in get_free_dqblk()
94 ret = read_blk(info, blk, buf); in get_free_dqblk()
97 info->dqi_free_blk = le32_to_cpu(dh->dqdh_next_free); in get_free_dqblk()
100 memset(buf, 0, info->dqi_usable_bs); in get_free_dqblk()
102 ret = write_blk(info, info->dqi_blocks, buf); in get_free_dqblk()
105 blk = info->dqi_blocks++; in get_free_dqblk()
107 mark_info_dirty(info->dqi_sb, info->dqi_type); in get_free_dqblk()
115 static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk) in put_free_dqblk() argument
120 dh->dqdh_next_free = cpu_to_le32(info->dqi_free_blk); in put_free_dqblk()
123 err = write_blk(info, blk, buf); in put_free_dqblk()
126 info->dqi_free_blk = blk; in put_free_dqblk()
127 mark_info_dirty(info->dqi_sb, info->dqi_type); in put_free_dqblk()
132 static int remove_free_dqentry(struct qtree_mem_dqinfo *info, char *buf, in remove_free_dqentry() argument
135 char *tmpbuf = getdqbuf(info->dqi_usable_bs); in remove_free_dqentry()
144 err = read_blk(info, nextblk, tmpbuf); in remove_free_dqentry()
149 err = write_blk(info, nextblk, tmpbuf); in remove_free_dqentry()
154 err = read_blk(info, prevblk, tmpbuf); in remove_free_dqentry()
159 err = write_blk(info, prevblk, tmpbuf); in remove_free_dqentry()
163 info->dqi_free_entry = nextblk; in remove_free_dqentry()
164 mark_info_dirty(info->dqi_sb, info->dqi_type); in remove_free_dqentry()
169 if (write_blk(info, blk, buf) < 0) in remove_free_dqentry()
170 quota_error(info->dqi_sb, "Can't write block (%u) " in remove_free_dqentry()
179 static int insert_free_dqentry(struct qtree_mem_dqinfo *info, char *buf, in insert_free_dqentry() argument
182 char *tmpbuf = getdqbuf(info->dqi_usable_bs); in insert_free_dqentry()
188 dh->dqdh_next_free = cpu_to_le32(info->dqi_free_entry); in insert_free_dqentry()
190 err = write_blk(info, blk, buf); in insert_free_dqentry()
193 if (info->dqi_free_entry) { in insert_free_dqentry()
194 err = read_blk(info, info->dqi_free_entry, tmpbuf); in insert_free_dqentry()
199 err = write_blk(info, info->dqi_free_entry, tmpbuf); in insert_free_dqentry()
204 info->dqi_free_entry = blk; in insert_free_dqentry()
205 mark_info_dirty(info->dqi_sb, info->dqi_type); in insert_free_dqentry()
213 int qtree_entry_unused(struct qtree_mem_dqinfo *info, char *disk) in qtree_entry_unused() argument
217 for (i = 0; i < info->dqi_entry_size; i++) in qtree_entry_unused()
225 static uint find_free_dqentry(struct qtree_mem_dqinfo *info, in find_free_dqentry() argument
230 char *buf = getdqbuf(info->dqi_usable_bs); in find_free_dqentry()
239 if (info->dqi_free_entry) { in find_free_dqentry()
240 blk = info->dqi_free_entry; in find_free_dqentry()
241 *err = read_blk(info, blk, buf); in find_free_dqentry()
245 blk = get_free_dqblk(info); in find_free_dqentry()
251 memset(buf, 0, info->dqi_usable_bs); in find_free_dqentry()
254 info->dqi_free_entry = blk; in find_free_dqentry()
258 if (le16_to_cpu(dh->dqdh_entries) + 1 >= qtree_dqstr_in_blk(info)) { in find_free_dqentry()
259 *err = remove_free_dqentry(info, buf, blk); in find_free_dqentry()
269 for (i = 0; i < qtree_dqstr_in_blk(info); i++) { in find_free_dqentry()
270 if (qtree_entry_unused(info, ddquot)) in find_free_dqentry()
272 ddquot += info->dqi_entry_size; in find_free_dqentry()
275 if (i == qtree_dqstr_in_blk(info)) { in find_free_dqentry()
281 *err = write_blk(info, blk, buf); in find_free_dqentry()
287 dquot->dq_off = (blk << info->dqi_blocksize_bits) + in find_free_dqentry()
289 i * info->dqi_entry_size; in find_free_dqentry()
298 static int do_insert_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot, in do_insert_tree() argument
301 char *buf = getdqbuf(info->dqi_usable_bs); in do_insert_tree()
309 ret = get_free_dqblk(info); in do_insert_tree()
313 memset(buf, 0, info->dqi_usable_bs); in do_insert_tree()
316 ret = read_blk(info, *treeblk, buf); in do_insert_tree()
324 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in do_insert_tree()
327 if (depth == info->dqi_qtree_depth - 1) { in do_insert_tree()
332 le32_to_cpu(ref[get_index(info, in do_insert_tree()
338 newblk = find_free_dqentry(info, dquot, &ret); in do_insert_tree()
340 ret = do_insert_tree(info, dquot, &newblk, depth+1); in do_insert_tree()
343 ref[get_index(info, dquot->dq_id, depth)] = in do_insert_tree()
345 ret = write_blk(info, *treeblk, buf); in do_insert_tree()
347 put_free_dqblk(info, buf, *treeblk); in do_insert_tree()
355 static inline int dq_insert_tree(struct qtree_mem_dqinfo *info, in dq_insert_tree() argument
361 if (info->dqi_blocks <= QT_TREEOFF) { in dq_insert_tree()
366 return do_insert_tree(info, dquot, &tmp, 0); in dq_insert_tree()
373 int qtree_write_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_write_dquot() argument
378 char *ddquot = getdqbuf(info->dqi_entry_size); in qtree_write_dquot()
385 ret = dq_insert_tree(info, dquot); in qtree_write_dquot()
394 info->dqi_ops->mem2disk_dqblk(ddquot, dquot); in qtree_write_dquot()
396 ret = sb->s_op->quota_write(sb, type, ddquot, info->dqi_entry_size, in qtree_write_dquot()
398 if (ret != info->dqi_entry_size) { in qtree_write_dquot()
413 static int free_dqentry(struct qtree_mem_dqinfo *info, struct dquot *dquot, in free_dqentry() argument
417 char *buf = getdqbuf(info->dqi_usable_bs); in free_dqentry()
422 if (dquot->dq_off >> info->dqi_blocksize_bits != blk) { in free_dqentry()
425 (uint)(dquot->dq_off >> info->dqi_blocksize_bits)); in free_dqentry()
428 ret = read_blk(info, blk, buf); in free_dqentry()
437 ret = remove_free_dqentry(info, buf, blk); in free_dqentry()
439 ret = put_free_dqblk(info, buf, blk); in free_dqentry()
447 (dquot->dq_off & ((1 << info->dqi_blocksize_bits) - 1)), in free_dqentry()
448 0, info->dqi_entry_size); in free_dqentry()
450 qtree_dqstr_in_blk(info) - 1) { in free_dqentry()
452 ret = insert_free_dqentry(info, buf, blk); in free_dqentry()
459 ret = write_blk(info, blk, buf); in free_dqentry()
474 static int remove_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot, in remove_tree() argument
477 char *buf = getdqbuf(info->dqi_usable_bs); in remove_tree()
484 ret = read_blk(info, *blk, buf); in remove_tree()
490 newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in remove_tree()
491 if (depth == info->dqi_qtree_depth - 1) { in remove_tree()
492 ret = free_dqentry(info, dquot, newblk); in remove_tree()
495 ret = remove_tree(info, dquot, &newblk, depth+1); in remove_tree()
499 ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0); in remove_tree()
501 for (i = 0; i < (info->dqi_usable_bs >> 2) && !ref[i]; i++) in remove_tree()
504 if (i == (info->dqi_usable_bs >> 2) in remove_tree()
506 put_free_dqblk(info, buf, *blk); in remove_tree()
509 ret = write_blk(info, *blk, buf); in remove_tree()
522 int qtree_delete_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_delete_dquot() argument
528 return remove_tree(info, dquot, &tmp, 0); in qtree_delete_dquot()
533 static loff_t find_block_dqentry(struct qtree_mem_dqinfo *info, in find_block_dqentry() argument
536 char *buf = getdqbuf(info->dqi_usable_bs); in find_block_dqentry()
543 ret = read_blk(info, blk, buf); in find_block_dqentry()
550 for (i = 0; i < qtree_dqstr_in_blk(info); i++) { in find_block_dqentry()
551 if (info->dqi_ops->is_id(ddquot, dquot)) in find_block_dqentry()
553 ddquot += info->dqi_entry_size; in find_block_dqentry()
555 if (i == qtree_dqstr_in_blk(info)) { in find_block_dqentry()
562 ret = (blk << info->dqi_blocksize_bits) + sizeof(struct in find_block_dqentry()
563 qt_disk_dqdbheader) + i * info->dqi_entry_size; in find_block_dqentry()
571 static loff_t find_tree_dqentry(struct qtree_mem_dqinfo *info, in find_tree_dqentry() argument
574 char *buf = getdqbuf(info->dqi_usable_bs); in find_tree_dqentry()
580 ret = read_blk(info, blk, buf); in find_tree_dqentry()
587 blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]); in find_tree_dqentry()
590 if (depth < info->dqi_qtree_depth - 1) in find_tree_dqentry()
591 ret = find_tree_dqentry(info, dquot, blk, depth+1); in find_tree_dqentry()
593 ret = find_block_dqentry(info, dquot, blk); in find_tree_dqentry()
600 static inline loff_t find_dqentry(struct qtree_mem_dqinfo *info, in find_dqentry() argument
603 return find_tree_dqentry(info, dquot, QT_TREEOFF, 0); in find_dqentry()
606 int qtree_read_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_read_dquot() argument
623 offset = find_dqentry(info, dquot); in qtree_read_dquot()
638 ddquot = getdqbuf(info->dqi_entry_size); in qtree_read_dquot()
641 ret = sb->s_op->quota_read(sb, type, ddquot, info->dqi_entry_size, in qtree_read_dquot()
643 if (ret != info->dqi_entry_size) { in qtree_read_dquot()
654 info->dqi_ops->disk2mem_dqblk(dquot, ddquot); in qtree_read_dquot()
670 int qtree_release_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot) in qtree_release_dquot() argument
674 return qtree_delete_dquot(info, dquot); in qtree_release_dquot()
679 static int find_next_id(struct qtree_mem_dqinfo *info, qid_t *id, in find_next_id() argument
682 char *buf = getdqbuf(info->dqi_usable_bs); in find_next_id()
685 unsigned int epb = info->dqi_usable_bs >> 2; in find_next_id()
692 for (i = depth; i < info->dqi_qtree_depth - 1; i++) in find_next_id()
695 ret = read_blk(info, blk, buf); in find_next_id()
697 quota_error(info->dqi_sb, in find_next_id()
701 for (i = __get_index(info, *id, depth); i < epb; i++) { in find_next_id()
706 if (depth == info->dqi_qtree_depth - 1) { in find_next_id()
710 ret = find_next_id(info, id, le32_to_cpu(ref[i]), depth + 1); in find_next_id()
723 int qtree_get_next_id(struct qtree_mem_dqinfo *info, struct kqid *qid) in qtree_get_next_id() argument
728 ret = find_next_id(info, &id, QT_TREEOFF, 0); in qtree_get_next_id()