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()
50 static ssize_t read_blk(struct qtree_mem_dqinfo *info, uint blk, char *buf)  in read_blk()  argument
52 	struct super_block *sb = info->dqi_sb;  in read_blk()
54 	memset(buf, 0, info->dqi_usable_bs);  in read_blk()
55 	return sb->s_op->quota_read(sb, info->dqi_type, buf,  in read_blk()
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
61 	struct super_block *sb = info->dqi_sb;  in write_blk()
64 	ret = sb->s_op->quota_write(sb, info->dqi_type, buf,  in write_blk()
65 	       info->dqi_usable_bs, (loff_t)blk << info->dqi_blocksize_bits);  in write_blk()
66 	if (ret != info->dqi_usable_bs) {  in write_blk()
75 static int get_free_dqblk(struct qtree_mem_dqinfo *info)  in get_free_dqblk()  argument
77 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in get_free_dqblk()
83 	if (info->dqi_free_blk) {  in get_free_dqblk()
84 		blk = info->dqi_free_blk;  in get_free_dqblk()
85 		ret = read_blk(info, blk, buf);  in get_free_dqblk()
88 		info->dqi_free_blk = le32_to_cpu(dh->dqdh_next_free);  in get_free_dqblk()
91 		memset(buf, 0, info->dqi_usable_bs);  in get_free_dqblk()
93 		ret = write_blk(info, info->dqi_blocks, buf);  in get_free_dqblk()
96 		blk = info->dqi_blocks++;  in get_free_dqblk()
98 	mark_info_dirty(info->dqi_sb, info->dqi_type);  in get_free_dqblk()
106 static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk)  in put_free_dqblk()  argument
111 	dh->dqdh_next_free = cpu_to_le32(info->dqi_free_blk);  in put_free_dqblk()
114 	err = write_blk(info, blk, buf);  in put_free_dqblk()
117 	info->dqi_free_blk = blk;  in put_free_dqblk()
118 	mark_info_dirty(info->dqi_sb, info->dqi_type);  in put_free_dqblk()
123 static int remove_free_dqentry(struct qtree_mem_dqinfo *info, char *buf,  in remove_free_dqentry()  argument
126 	char *tmpbuf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in remove_free_dqentry()
135 		err = read_blk(info, nextblk, tmpbuf);  in remove_free_dqentry()
140 		err = write_blk(info, nextblk, tmpbuf);  in remove_free_dqentry()
145 		err = read_blk(info, prevblk, tmpbuf);  in remove_free_dqentry()
150 		err = write_blk(info, prevblk, tmpbuf);  in remove_free_dqentry()
154 		info->dqi_free_entry = nextblk;  in remove_free_dqentry()
155 		mark_info_dirty(info->dqi_sb, info->dqi_type);  in remove_free_dqentry()
160 	if (write_blk(info, blk, buf) < 0)  in remove_free_dqentry()
161 		quota_error(info->dqi_sb, "Can't write block (%u) "  in remove_free_dqentry()
170 static int insert_free_dqentry(struct qtree_mem_dqinfo *info, char *buf,  in insert_free_dqentry()  argument
173 	char *tmpbuf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in insert_free_dqentry()
179 	dh->dqdh_next_free = cpu_to_le32(info->dqi_free_entry);  in insert_free_dqentry()
181 	err = write_blk(info, blk, buf);  in insert_free_dqentry()
184 	if (info->dqi_free_entry) {  in insert_free_dqentry()
185 		err = read_blk(info, info->dqi_free_entry, tmpbuf);  in insert_free_dqentry()
190 		err = write_blk(info, info->dqi_free_entry, tmpbuf);  in insert_free_dqentry()
195 	info->dqi_free_entry = blk;  in insert_free_dqentry()
196 	mark_info_dirty(info->dqi_sb, info->dqi_type);  in insert_free_dqentry()
204 int qtree_entry_unused(struct qtree_mem_dqinfo *info, char *disk)  in qtree_entry_unused()  argument
208 	for (i = 0; i < info->dqi_entry_size; i++)  in qtree_entry_unused()
216 static uint find_free_dqentry(struct qtree_mem_dqinfo *info,  in find_free_dqentry()  argument
221 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in find_free_dqentry()
230 	if (info->dqi_free_entry) {  in find_free_dqentry()
231 		blk = info->dqi_free_entry;  in find_free_dqentry()
232 		*err = read_blk(info, blk, buf);  in find_free_dqentry()
236 		blk = get_free_dqblk(info);  in find_free_dqentry()
242 		memset(buf, 0, info->dqi_usable_bs);  in find_free_dqentry()
245 		info->dqi_free_entry = blk;  in find_free_dqentry()
249 	if (le16_to_cpu(dh->dqdh_entries) + 1 >= qtree_dqstr_in_blk(info)) {  in find_free_dqentry()
250 		*err = remove_free_dqentry(info, buf, blk);  in find_free_dqentry()
260 	for (i = 0; i < qtree_dqstr_in_blk(info); i++) {  in find_free_dqentry()
261 		if (qtree_entry_unused(info, ddquot))  in find_free_dqentry()
263 		ddquot += info->dqi_entry_size;  in find_free_dqentry()
266 	if (i == qtree_dqstr_in_blk(info)) {  in find_free_dqentry()
272 	*err = write_blk(info, blk, buf);  in find_free_dqentry()
278 	dquot->dq_off = ((loff_t)blk << info->dqi_blocksize_bits) +  in find_free_dqentry()
280 			i * info->dqi_entry_size;  in find_free_dqentry()
289 static int do_insert_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot,  in do_insert_tree()  argument
292 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in do_insert_tree()
300 		ret = get_free_dqblk(info);  in do_insert_tree()
304 		memset(buf, 0, info->dqi_usable_bs);  in do_insert_tree()
307 		ret = read_blk(info, *treeblk, buf);  in do_insert_tree()
315 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in do_insert_tree()
318 	if (depth == info->dqi_qtree_depth - 1) {  in do_insert_tree()
323 				    le32_to_cpu(ref[get_index(info,  in do_insert_tree()
329 		newblk = find_free_dqentry(info, dquot, &ret);  in do_insert_tree()
331 		ret = do_insert_tree(info, dquot, &newblk, depth+1);  in do_insert_tree()
334 		ref[get_index(info, dquot->dq_id, depth)] =  in do_insert_tree()
336 		ret = write_blk(info, *treeblk, buf);  in do_insert_tree()
338 		put_free_dqblk(info, buf, *treeblk);  in do_insert_tree()
346 static inline int dq_insert_tree(struct qtree_mem_dqinfo *info,  in dq_insert_tree()  argument
352 	if (info->dqi_blocks <= QT_TREEOFF) {  in dq_insert_tree()
357 	return do_insert_tree(info, dquot, &tmp, 0);  in dq_insert_tree()
364 int qtree_write_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)  in qtree_write_dquot()  argument
369 	char *ddquot = kmalloc(info->dqi_entry_size, GFP_NOFS);  in qtree_write_dquot()
376 		ret = dq_insert_tree(info, dquot);  in qtree_write_dquot()
385 	info->dqi_ops->mem2disk_dqblk(ddquot, dquot);  in qtree_write_dquot()
387 	ret = sb->s_op->quota_write(sb, type, ddquot, info->dqi_entry_size,  in qtree_write_dquot()
389 	if (ret != info->dqi_entry_size) {  in qtree_write_dquot()
404 static int free_dqentry(struct qtree_mem_dqinfo *info, struct dquot *dquot,  in free_dqentry()  argument
408 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in free_dqentry()
413 	if (dquot->dq_off >> info->dqi_blocksize_bits != blk) {  in free_dqentry()
416 			(uint)(dquot->dq_off >> info->dqi_blocksize_bits));  in free_dqentry()
419 	ret = read_blk(info, blk, buf);  in free_dqentry()
428 		ret = remove_free_dqentry(info, buf, blk);  in free_dqentry()
430 			ret = put_free_dqblk(info, buf, blk);  in free_dqentry()
438 		       (dquot->dq_off & ((1 << info->dqi_blocksize_bits) - 1)),  in free_dqentry()
439 		       0, info->dqi_entry_size);  in free_dqentry()
441 		    qtree_dqstr_in_blk(info) - 1) {  in free_dqentry()
443 			ret = insert_free_dqentry(info, buf, blk);  in free_dqentry()
450 			ret = write_blk(info, blk, buf);  in free_dqentry()
465 static int remove_tree(struct qtree_mem_dqinfo *info, struct dquot *dquot,  in remove_tree()  argument
468 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in remove_tree()
475 	ret = read_blk(info, *blk, buf);  in remove_tree()
481 	newblk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in remove_tree()
482 	if (depth == info->dqi_qtree_depth - 1) {  in remove_tree()
483 		ret = free_dqentry(info, dquot, newblk);  in remove_tree()
486 		ret = remove_tree(info, dquot, &newblk, depth+1);  in remove_tree()
490 		ref[get_index(info, dquot->dq_id, depth)] = cpu_to_le32(0);  in remove_tree()
492 		for (i = 0; i < (info->dqi_usable_bs >> 2) && !ref[i]; i++)  in remove_tree()
495 		if (i == (info->dqi_usable_bs >> 2)  in remove_tree()
497 			put_free_dqblk(info, buf, *blk);  in remove_tree()
500 			ret = write_blk(info, *blk, buf);  in remove_tree()
513 int qtree_delete_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)  in qtree_delete_dquot()  argument
519 	return remove_tree(info, dquot, &tmp, 0);  in qtree_delete_dquot()
524 static loff_t find_block_dqentry(struct qtree_mem_dqinfo *info,  in find_block_dqentry()  argument
527 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in find_block_dqentry()
534 	ret = read_blk(info, blk, buf);  in find_block_dqentry()
541 	for (i = 0; i < qtree_dqstr_in_blk(info); i++) {  in find_block_dqentry()
542 		if (info->dqi_ops->is_id(ddquot, dquot))  in find_block_dqentry()
544 		ddquot += info->dqi_entry_size;  in find_block_dqentry()
546 	if (i == qtree_dqstr_in_blk(info)) {  in find_block_dqentry()
553 		ret = ((loff_t)blk << info->dqi_blocksize_bits) + sizeof(struct  in find_block_dqentry()
554 		  qt_disk_dqdbheader) + i * info->dqi_entry_size;  in find_block_dqentry()
562 static loff_t find_tree_dqentry(struct qtree_mem_dqinfo *info,  in find_tree_dqentry()  argument
565 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in find_tree_dqentry()
571 	ret = read_blk(info, blk, buf);  in find_tree_dqentry()
578 	blk = le32_to_cpu(ref[get_index(info, dquot->dq_id, depth)]);  in find_tree_dqentry()
581 	if (depth < info->dqi_qtree_depth - 1)  in find_tree_dqentry()
582 		ret = find_tree_dqentry(info, dquot, blk, depth+1);  in find_tree_dqentry()
584 		ret = find_block_dqentry(info, dquot, blk);  in find_tree_dqentry()
591 static inline loff_t find_dqentry(struct qtree_mem_dqinfo *info,  in find_dqentry()  argument
594 	return find_tree_dqentry(info, dquot, QT_TREEOFF, 0);  in find_dqentry()
597 int qtree_read_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)  in qtree_read_dquot()  argument
614 		offset = find_dqentry(info, dquot);  in qtree_read_dquot()
629 	ddquot = kmalloc(info->dqi_entry_size, GFP_NOFS);  in qtree_read_dquot()
632 	ret = sb->s_op->quota_read(sb, type, ddquot, info->dqi_entry_size,  in qtree_read_dquot()
634 	if (ret != info->dqi_entry_size) {  in qtree_read_dquot()
645 	info->dqi_ops->disk2mem_dqblk(dquot, ddquot);  in qtree_read_dquot()
661 int qtree_release_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)  in qtree_release_dquot()  argument
665 		return qtree_delete_dquot(info, dquot);  in qtree_release_dquot()
670 static int find_next_id(struct qtree_mem_dqinfo *info, qid_t *id,  in find_next_id()  argument
673 	char *buf = kmalloc(info->dqi_usable_bs, GFP_NOFS);  in find_next_id()
676 	unsigned int epb = info->dqi_usable_bs >> 2;  in find_next_id()
683 	for (i = depth; i < info->dqi_qtree_depth - 1; i++)  in find_next_id()
686 	ret = read_blk(info, blk, buf);  in find_next_id()
688 		quota_error(info->dqi_sb,  in find_next_id()
692 	for (i = __get_index(info, *id, depth); i < epb; i++) {  in find_next_id()
697 		if (depth == info->dqi_qtree_depth - 1) {  in find_next_id()
701 		ret = find_next_id(info, id, le32_to_cpu(ref[i]), depth + 1);  in find_next_id()
714 int qtree_get_next_id(struct qtree_mem_dqinfo *info, struct kqid *qid)  in qtree_get_next_id()  argument
719 	ret = find_next_id(info, &id, QT_TREEOFF, 0);  in qtree_get_next_id()