Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2011 STRATO. All rights reserved.
4 */
5
6#include <linux/sched.h>
7#include <linux/pagemap.h>
8#include <linux/writeback.h>
9#include <linux/blkdev.h>
10#include <linux/rbtree.h>
11#include <linux/slab.h>
12#include <linux/workqueue.h>
13#include <linux/btrfs.h>
14#include <linux/sched/mm.h>
15
16#include "ctree.h"
17#include "transaction.h"
18#include "disk-io.h"
19#include "locking.h"
20#include "ulist.h"
21#include "backref.h"
22#include "extent_io.h"
23#include "qgroup.h"
24#include "block-group.h"
25#include "sysfs.h"
26#include "tree-mod-log.h"
27#include "fs.h"
28#include "accessors.h"
29#include "extent-tree.h"
30#include "root-tree.h"
31#include "tree-checker.h"
32
33/*
34 * Helpers to access qgroup reservation
35 *
36 * Callers should ensure the lock context and type are valid
37 */
38
39static u64 qgroup_rsv_total(const struct btrfs_qgroup *qgroup)
40{
41 u64 ret = 0;
42 int i;
43
44 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
45 ret += qgroup->rsv.values[i];
46
47 return ret;
48}
49
50#ifdef CONFIG_BTRFS_DEBUG
51static const char *qgroup_rsv_type_str(enum btrfs_qgroup_rsv_type type)
52{
53 if (type == BTRFS_QGROUP_RSV_DATA)
54 return "data";
55 if (type == BTRFS_QGROUP_RSV_META_PERTRANS)
56 return "meta_pertrans";
57 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
58 return "meta_prealloc";
59 return NULL;
60}
61#endif
62
63static void qgroup_rsv_add(struct btrfs_fs_info *fs_info,
64 struct btrfs_qgroup *qgroup, u64 num_bytes,
65 enum btrfs_qgroup_rsv_type type)
66{
67 trace_qgroup_update_reserve(fs_info, qgroup, num_bytes, type);
68 qgroup->rsv.values[type] += num_bytes;
69}
70
71static void qgroup_rsv_release(struct btrfs_fs_info *fs_info,
72 struct btrfs_qgroup *qgroup, u64 num_bytes,
73 enum btrfs_qgroup_rsv_type type)
74{
75 trace_qgroup_update_reserve(fs_info, qgroup, -(s64)num_bytes, type);
76 if (qgroup->rsv.values[type] >= num_bytes) {
77 qgroup->rsv.values[type] -= num_bytes;
78 return;
79 }
80#ifdef CONFIG_BTRFS_DEBUG
81 WARN_RATELIMIT(1,
82 "qgroup %llu %s reserved space underflow, have %llu to free %llu",
83 qgroup->qgroupid, qgroup_rsv_type_str(type),
84 qgroup->rsv.values[type], num_bytes);
85#endif
86 qgroup->rsv.values[type] = 0;
87}
88
89static void qgroup_rsv_add_by_qgroup(struct btrfs_fs_info *fs_info,
90 struct btrfs_qgroup *dest,
91 struct btrfs_qgroup *src)
92{
93 int i;
94
95 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
96 qgroup_rsv_add(fs_info, dest, src->rsv.values[i], i);
97}
98
99static void qgroup_rsv_release_by_qgroup(struct btrfs_fs_info *fs_info,
100 struct btrfs_qgroup *dest,
101 struct btrfs_qgroup *src)
102{
103 int i;
104
105 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
106 qgroup_rsv_release(fs_info, dest, src->rsv.values[i], i);
107}
108
109static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq,
110 int mod)
111{
112 if (qg->old_refcnt < seq)
113 qg->old_refcnt = seq;
114 qg->old_refcnt += mod;
115}
116
117static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq,
118 int mod)
119{
120 if (qg->new_refcnt < seq)
121 qg->new_refcnt = seq;
122 qg->new_refcnt += mod;
123}
124
125static inline u64 btrfs_qgroup_get_old_refcnt(struct btrfs_qgroup *qg, u64 seq)
126{
127 if (qg->old_refcnt < seq)
128 return 0;
129 return qg->old_refcnt - seq;
130}
131
132static inline u64 btrfs_qgroup_get_new_refcnt(struct btrfs_qgroup *qg, u64 seq)
133{
134 if (qg->new_refcnt < seq)
135 return 0;
136 return qg->new_refcnt - seq;
137}
138
139/*
140 * glue structure to represent the relations between qgroups.
141 */
142struct btrfs_qgroup_list {
143 struct list_head next_group;
144 struct list_head next_member;
145 struct btrfs_qgroup *group;
146 struct btrfs_qgroup *member;
147};
148
149static inline u64 qgroup_to_aux(struct btrfs_qgroup *qg)
150{
151 return (u64)(uintptr_t)qg;
152}
153
154static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n)
155{
156 return (struct btrfs_qgroup *)(uintptr_t)n->aux;
157}
158
159static int
160qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
161 int init_flags);
162static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
163
164/* must be called with qgroup_ioctl_lock held */
165static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info,
166 u64 qgroupid)
167{
168 struct rb_node *n = fs_info->qgroup_tree.rb_node;
169 struct btrfs_qgroup *qgroup;
170
171 while (n) {
172 qgroup = rb_entry(n, struct btrfs_qgroup, node);
173 if (qgroup->qgroupid < qgroupid)
174 n = n->rb_left;
175 else if (qgroup->qgroupid > qgroupid)
176 n = n->rb_right;
177 else
178 return qgroup;
179 }
180 return NULL;
181}
182
183/* must be called with qgroup_lock held */
184static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
185 u64 qgroupid)
186{
187 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
188 struct rb_node *parent = NULL;
189 struct btrfs_qgroup *qgroup;
190
191 while (*p) {
192 parent = *p;
193 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
194
195 if (qgroup->qgroupid < qgroupid)
196 p = &(*p)->rb_left;
197 else if (qgroup->qgroupid > qgroupid)
198 p = &(*p)->rb_right;
199 else
200 return qgroup;
201 }
202
203 qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC);
204 if (!qgroup)
205 return ERR_PTR(-ENOMEM);
206
207 qgroup->qgroupid = qgroupid;
208 INIT_LIST_HEAD(&qgroup->groups);
209 INIT_LIST_HEAD(&qgroup->members);
210 INIT_LIST_HEAD(&qgroup->dirty);
211
212 rb_link_node(&qgroup->node, parent, p);
213 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
214
215 return qgroup;
216}
217
218static void __del_qgroup_rb(struct btrfs_fs_info *fs_info,
219 struct btrfs_qgroup *qgroup)
220{
221 struct btrfs_qgroup_list *list;
222
223 list_del(&qgroup->dirty);
224 while (!list_empty(&qgroup->groups)) {
225 list = list_first_entry(&qgroup->groups,
226 struct btrfs_qgroup_list, next_group);
227 list_del(&list->next_group);
228 list_del(&list->next_member);
229 kfree(list);
230 }
231
232 while (!list_empty(&qgroup->members)) {
233 list = list_first_entry(&qgroup->members,
234 struct btrfs_qgroup_list, next_member);
235 list_del(&list->next_group);
236 list_del(&list->next_member);
237 kfree(list);
238 }
239}
240
241/* must be called with qgroup_lock held */
242static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
243{
244 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
245
246 if (!qgroup)
247 return -ENOENT;
248
249 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
250 __del_qgroup_rb(fs_info, qgroup);
251 return 0;
252}
253
254/*
255 * Add relation specified by two qgroups.
256 *
257 * Must be called with qgroup_lock held.
258 *
259 * Return: 0 on success
260 * -ENOENT if one of the qgroups is NULL
261 * <0 other errors
262 */
263static int __add_relation_rb(struct btrfs_qgroup *member, struct btrfs_qgroup *parent)
264{
265 struct btrfs_qgroup_list *list;
266
267 if (!member || !parent)
268 return -ENOENT;
269
270 list = kzalloc(sizeof(*list), GFP_ATOMIC);
271 if (!list)
272 return -ENOMEM;
273
274 list->group = parent;
275 list->member = member;
276 list_add_tail(&list->next_group, &member->groups);
277 list_add_tail(&list->next_member, &parent->members);
278
279 return 0;
280}
281
282/*
283 * Add relation specified by two qgroup ids.
284 *
285 * Must be called with qgroup_lock held.
286 *
287 * Return: 0 on success
288 * -ENOENT if one of the ids does not exist
289 * <0 other errors
290 */
291static int add_relation_rb(struct btrfs_fs_info *fs_info, u64 memberid, u64 parentid)
292{
293 struct btrfs_qgroup *member;
294 struct btrfs_qgroup *parent;
295
296 member = find_qgroup_rb(fs_info, memberid);
297 parent = find_qgroup_rb(fs_info, parentid);
298
299 return __add_relation_rb(member, parent);
300}
301
302/* Must be called with qgroup_lock held */
303static int del_relation_rb(struct btrfs_fs_info *fs_info,
304 u64 memberid, u64 parentid)
305{
306 struct btrfs_qgroup *member;
307 struct btrfs_qgroup *parent;
308 struct btrfs_qgroup_list *list;
309
310 member = find_qgroup_rb(fs_info, memberid);
311 parent = find_qgroup_rb(fs_info, parentid);
312 if (!member || !parent)
313 return -ENOENT;
314
315 list_for_each_entry(list, &member->groups, next_group) {
316 if (list->group == parent) {
317 list_del(&list->next_group);
318 list_del(&list->next_member);
319 kfree(list);
320 return 0;
321 }
322 }
323 return -ENOENT;
324}
325
326#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
327int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
328 u64 rfer, u64 excl)
329{
330 struct btrfs_qgroup *qgroup;
331
332 qgroup = find_qgroup_rb(fs_info, qgroupid);
333 if (!qgroup)
334 return -EINVAL;
335 if (qgroup->rfer != rfer || qgroup->excl != excl)
336 return -EINVAL;
337 return 0;
338}
339#endif
340
341static void qgroup_mark_inconsistent(struct btrfs_fs_info *fs_info)
342{
343 fs_info->qgroup_flags |= (BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT |
344 BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
345 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
346}
347
348/*
349 * The full config is read in one go, only called from open_ctree()
350 * It doesn't use any locking, as at this point we're still single-threaded
351 */
352int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
353{
354 struct btrfs_key key;
355 struct btrfs_key found_key;
356 struct btrfs_root *quota_root = fs_info->quota_root;
357 struct btrfs_path *path = NULL;
358 struct extent_buffer *l;
359 int slot;
360 int ret = 0;
361 u64 flags = 0;
362 u64 rescan_progress = 0;
363
364 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
365 return 0;
366
367 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
368 if (!fs_info->qgroup_ulist) {
369 ret = -ENOMEM;
370 goto out;
371 }
372
373 path = btrfs_alloc_path();
374 if (!path) {
375 ret = -ENOMEM;
376 goto out;
377 }
378
379 ret = btrfs_sysfs_add_qgroups(fs_info);
380 if (ret < 0)
381 goto out;
382 /* default this to quota off, in case no status key is found */
383 fs_info->qgroup_flags = 0;
384
385 /*
386 * pass 1: read status, all qgroup infos and limits
387 */
388 key.objectid = 0;
389 key.type = 0;
390 key.offset = 0;
391 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
392 if (ret)
393 goto out;
394
395 while (1) {
396 struct btrfs_qgroup *qgroup;
397
398 slot = path->slots[0];
399 l = path->nodes[0];
400 btrfs_item_key_to_cpu(l, &found_key, slot);
401
402 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
403 struct btrfs_qgroup_status_item *ptr;
404
405 ptr = btrfs_item_ptr(l, slot,
406 struct btrfs_qgroup_status_item);
407
408 if (btrfs_qgroup_status_version(l, ptr) !=
409 BTRFS_QGROUP_STATUS_VERSION) {
410 btrfs_err(fs_info,
411 "old qgroup version, quota disabled");
412 goto out;
413 }
414 if (btrfs_qgroup_status_generation(l, ptr) !=
415 fs_info->generation) {
416 qgroup_mark_inconsistent(fs_info);
417 btrfs_err(fs_info,
418 "qgroup generation mismatch, marked as inconsistent");
419 }
420 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l,
421 ptr);
422 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
423 goto next1;
424 }
425
426 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
427 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
428 goto next1;
429
430 qgroup = find_qgroup_rb(fs_info, found_key.offset);
431 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
432 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
433 btrfs_err(fs_info, "inconsistent qgroup config");
434 qgroup_mark_inconsistent(fs_info);
435 }
436 if (!qgroup) {
437 qgroup = add_qgroup_rb(fs_info, found_key.offset);
438 if (IS_ERR(qgroup)) {
439 ret = PTR_ERR(qgroup);
440 goto out;
441 }
442 }
443 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
444 if (ret < 0)
445 goto out;
446
447 switch (found_key.type) {
448 case BTRFS_QGROUP_INFO_KEY: {
449 struct btrfs_qgroup_info_item *ptr;
450
451 ptr = btrfs_item_ptr(l, slot,
452 struct btrfs_qgroup_info_item);
453 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
454 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
455 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
456 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
457 /* generation currently unused */
458 break;
459 }
460 case BTRFS_QGROUP_LIMIT_KEY: {
461 struct btrfs_qgroup_limit_item *ptr;
462
463 ptr = btrfs_item_ptr(l, slot,
464 struct btrfs_qgroup_limit_item);
465 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
466 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
467 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
468 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
469 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
470 break;
471 }
472 }
473next1:
474 ret = btrfs_next_item(quota_root, path);
475 if (ret < 0)
476 goto out;
477 if (ret)
478 break;
479 }
480 btrfs_release_path(path);
481
482 /*
483 * pass 2: read all qgroup relations
484 */
485 key.objectid = 0;
486 key.type = BTRFS_QGROUP_RELATION_KEY;
487 key.offset = 0;
488 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
489 if (ret)
490 goto out;
491 while (1) {
492 slot = path->slots[0];
493 l = path->nodes[0];
494 btrfs_item_key_to_cpu(l, &found_key, slot);
495
496 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
497 goto next2;
498
499 if (found_key.objectid > found_key.offset) {
500 /* parent <- member, not needed to build config */
501 /* FIXME should we omit the key completely? */
502 goto next2;
503 }
504
505 ret = add_relation_rb(fs_info, found_key.objectid,
506 found_key.offset);
507 if (ret == -ENOENT) {
508 btrfs_warn(fs_info,
509 "orphan qgroup relation 0x%llx->0x%llx",
510 found_key.objectid, found_key.offset);
511 ret = 0; /* ignore the error */
512 }
513 if (ret)
514 goto out;
515next2:
516 ret = btrfs_next_item(quota_root, path);
517 if (ret < 0)
518 goto out;
519 if (ret)
520 break;
521 }
522out:
523 btrfs_free_path(path);
524 fs_info->qgroup_flags |= flags;
525 if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
526 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
527 else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN &&
528 ret >= 0)
529 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
530
531 if (ret < 0) {
532 ulist_free(fs_info->qgroup_ulist);
533 fs_info->qgroup_ulist = NULL;
534 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
535 btrfs_sysfs_del_qgroups(fs_info);
536 }
537
538 return ret < 0 ? ret : 0;
539}
540
541/*
542 * Called in close_ctree() when quota is still enabled. This verifies we don't
543 * leak some reserved space.
544 *
545 * Return false if no reserved space is left.
546 * Return true if some reserved space is leaked.
547 */
548bool btrfs_check_quota_leak(struct btrfs_fs_info *fs_info)
549{
550 struct rb_node *node;
551 bool ret = false;
552
553 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
554 return ret;
555 /*
556 * Since we're unmounting, there is no race and no need to grab qgroup
557 * lock. And here we don't go post-order to provide a more user
558 * friendly sorted result.
559 */
560 for (node = rb_first(&fs_info->qgroup_tree); node; node = rb_next(node)) {
561 struct btrfs_qgroup *qgroup;
562 int i;
563
564 qgroup = rb_entry(node, struct btrfs_qgroup, node);
565 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++) {
566 if (qgroup->rsv.values[i]) {
567 ret = true;
568 btrfs_warn(fs_info,
569 "qgroup %hu/%llu has unreleased space, type %d rsv %llu",
570 btrfs_qgroup_level(qgroup->qgroupid),
571 btrfs_qgroup_subvolid(qgroup->qgroupid),
572 i, qgroup->rsv.values[i]);
573 }
574 }
575 }
576 return ret;
577}
578
579/*
580 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
581 * first two are in single-threaded paths.And for the third one, we have set
582 * quota_root to be null with qgroup_lock held before, so it is safe to clean
583 * up the in-memory structures without qgroup_lock held.
584 */
585void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
586{
587 struct rb_node *n;
588 struct btrfs_qgroup *qgroup;
589
590 while ((n = rb_first(&fs_info->qgroup_tree))) {
591 qgroup = rb_entry(n, struct btrfs_qgroup, node);
592 rb_erase(n, &fs_info->qgroup_tree);
593 __del_qgroup_rb(fs_info, qgroup);
594 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
595 kfree(qgroup);
596 }
597 /*
598 * We call btrfs_free_qgroup_config() when unmounting
599 * filesystem and disabling quota, so we set qgroup_ulist
600 * to be null here to avoid double free.
601 */
602 ulist_free(fs_info->qgroup_ulist);
603 fs_info->qgroup_ulist = NULL;
604 btrfs_sysfs_del_qgroups(fs_info);
605}
606
607static int add_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
608 u64 dst)
609{
610 int ret;
611 struct btrfs_root *quota_root = trans->fs_info->quota_root;
612 struct btrfs_path *path;
613 struct btrfs_key key;
614
615 path = btrfs_alloc_path();
616 if (!path)
617 return -ENOMEM;
618
619 key.objectid = src;
620 key.type = BTRFS_QGROUP_RELATION_KEY;
621 key.offset = dst;
622
623 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
624
625 btrfs_mark_buffer_dirty(path->nodes[0]);
626
627 btrfs_free_path(path);
628 return ret;
629}
630
631static int del_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
632 u64 dst)
633{
634 int ret;
635 struct btrfs_root *quota_root = trans->fs_info->quota_root;
636 struct btrfs_path *path;
637 struct btrfs_key key;
638
639 path = btrfs_alloc_path();
640 if (!path)
641 return -ENOMEM;
642
643 key.objectid = src;
644 key.type = BTRFS_QGROUP_RELATION_KEY;
645 key.offset = dst;
646
647 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
648 if (ret < 0)
649 goto out;
650
651 if (ret > 0) {
652 ret = -ENOENT;
653 goto out;
654 }
655
656 ret = btrfs_del_item(trans, quota_root, path);
657out:
658 btrfs_free_path(path);
659 return ret;
660}
661
662static int add_qgroup_item(struct btrfs_trans_handle *trans,
663 struct btrfs_root *quota_root, u64 qgroupid)
664{
665 int ret;
666 struct btrfs_path *path;
667 struct btrfs_qgroup_info_item *qgroup_info;
668 struct btrfs_qgroup_limit_item *qgroup_limit;
669 struct extent_buffer *leaf;
670 struct btrfs_key key;
671
672 if (btrfs_is_testing(quota_root->fs_info))
673 return 0;
674
675 path = btrfs_alloc_path();
676 if (!path)
677 return -ENOMEM;
678
679 key.objectid = 0;
680 key.type = BTRFS_QGROUP_INFO_KEY;
681 key.offset = qgroupid;
682
683 /*
684 * Avoid a transaction abort by catching -EEXIST here. In that
685 * case, we proceed by re-initializing the existing structure
686 * on disk.
687 */
688
689 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
690 sizeof(*qgroup_info));
691 if (ret && ret != -EEXIST)
692 goto out;
693
694 leaf = path->nodes[0];
695 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
696 struct btrfs_qgroup_info_item);
697 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
698 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
699 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
700 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
701 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
702
703 btrfs_mark_buffer_dirty(leaf);
704
705 btrfs_release_path(path);
706
707 key.type = BTRFS_QGROUP_LIMIT_KEY;
708 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
709 sizeof(*qgroup_limit));
710 if (ret && ret != -EEXIST)
711 goto out;
712
713 leaf = path->nodes[0];
714 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
715 struct btrfs_qgroup_limit_item);
716 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
717 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
718 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
719 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
720 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
721
722 btrfs_mark_buffer_dirty(leaf);
723
724 ret = 0;
725out:
726 btrfs_free_path(path);
727 return ret;
728}
729
730static int del_qgroup_item(struct btrfs_trans_handle *trans, u64 qgroupid)
731{
732 int ret;
733 struct btrfs_root *quota_root = trans->fs_info->quota_root;
734 struct btrfs_path *path;
735 struct btrfs_key key;
736
737 path = btrfs_alloc_path();
738 if (!path)
739 return -ENOMEM;
740
741 key.objectid = 0;
742 key.type = BTRFS_QGROUP_INFO_KEY;
743 key.offset = qgroupid;
744 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
745 if (ret < 0)
746 goto out;
747
748 if (ret > 0) {
749 ret = -ENOENT;
750 goto out;
751 }
752
753 ret = btrfs_del_item(trans, quota_root, path);
754 if (ret)
755 goto out;
756
757 btrfs_release_path(path);
758
759 key.type = BTRFS_QGROUP_LIMIT_KEY;
760 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
761 if (ret < 0)
762 goto out;
763
764 if (ret > 0) {
765 ret = -ENOENT;
766 goto out;
767 }
768
769 ret = btrfs_del_item(trans, quota_root, path);
770
771out:
772 btrfs_free_path(path);
773 return ret;
774}
775
776static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
777 struct btrfs_qgroup *qgroup)
778{
779 struct btrfs_root *quota_root = trans->fs_info->quota_root;
780 struct btrfs_path *path;
781 struct btrfs_key key;
782 struct extent_buffer *l;
783 struct btrfs_qgroup_limit_item *qgroup_limit;
784 int ret;
785 int slot;
786
787 key.objectid = 0;
788 key.type = BTRFS_QGROUP_LIMIT_KEY;
789 key.offset = qgroup->qgroupid;
790
791 path = btrfs_alloc_path();
792 if (!path)
793 return -ENOMEM;
794
795 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
796 if (ret > 0)
797 ret = -ENOENT;
798
799 if (ret)
800 goto out;
801
802 l = path->nodes[0];
803 slot = path->slots[0];
804 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
805 btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags);
806 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer);
807 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl);
808 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer);
809 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl);
810
811 btrfs_mark_buffer_dirty(l);
812
813out:
814 btrfs_free_path(path);
815 return ret;
816}
817
818static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
819 struct btrfs_qgroup *qgroup)
820{
821 struct btrfs_fs_info *fs_info = trans->fs_info;
822 struct btrfs_root *quota_root = fs_info->quota_root;
823 struct btrfs_path *path;
824 struct btrfs_key key;
825 struct extent_buffer *l;
826 struct btrfs_qgroup_info_item *qgroup_info;
827 int ret;
828 int slot;
829
830 if (btrfs_is_testing(fs_info))
831 return 0;
832
833 key.objectid = 0;
834 key.type = BTRFS_QGROUP_INFO_KEY;
835 key.offset = qgroup->qgroupid;
836
837 path = btrfs_alloc_path();
838 if (!path)
839 return -ENOMEM;
840
841 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
842 if (ret > 0)
843 ret = -ENOENT;
844
845 if (ret)
846 goto out;
847
848 l = path->nodes[0];
849 slot = path->slots[0];
850 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
851 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
852 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
853 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
854 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
855 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
856
857 btrfs_mark_buffer_dirty(l);
858
859out:
860 btrfs_free_path(path);
861 return ret;
862}
863
864static int update_qgroup_status_item(struct btrfs_trans_handle *trans)
865{
866 struct btrfs_fs_info *fs_info = trans->fs_info;
867 struct btrfs_root *quota_root = fs_info->quota_root;
868 struct btrfs_path *path;
869 struct btrfs_key key;
870 struct extent_buffer *l;
871 struct btrfs_qgroup_status_item *ptr;
872 int ret;
873 int slot;
874
875 key.objectid = 0;
876 key.type = BTRFS_QGROUP_STATUS_KEY;
877 key.offset = 0;
878
879 path = btrfs_alloc_path();
880 if (!path)
881 return -ENOMEM;
882
883 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
884 if (ret > 0)
885 ret = -ENOENT;
886
887 if (ret)
888 goto out;
889
890 l = path->nodes[0];
891 slot = path->slots[0];
892 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
893 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags &
894 BTRFS_QGROUP_STATUS_FLAGS_MASK);
895 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
896 btrfs_set_qgroup_status_rescan(l, ptr,
897 fs_info->qgroup_rescan_progress.objectid);
898
899 btrfs_mark_buffer_dirty(l);
900
901out:
902 btrfs_free_path(path);
903 return ret;
904}
905
906/*
907 * called with qgroup_lock held
908 */
909static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
910 struct btrfs_root *root)
911{
912 struct btrfs_path *path;
913 struct btrfs_key key;
914 struct extent_buffer *leaf = NULL;
915 int ret;
916 int nr = 0;
917
918 path = btrfs_alloc_path();
919 if (!path)
920 return -ENOMEM;
921
922 key.objectid = 0;
923 key.offset = 0;
924 key.type = 0;
925
926 while (1) {
927 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
928 if (ret < 0)
929 goto out;
930 leaf = path->nodes[0];
931 nr = btrfs_header_nritems(leaf);
932 if (!nr)
933 break;
934 /*
935 * delete the leaf one by one
936 * since the whole tree is going
937 * to be deleted.
938 */
939 path->slots[0] = 0;
940 ret = btrfs_del_items(trans, root, path, 0, nr);
941 if (ret)
942 goto out;
943
944 btrfs_release_path(path);
945 }
946 ret = 0;
947out:
948 btrfs_free_path(path);
949 return ret;
950}
951
952int btrfs_quota_enable(struct btrfs_fs_info *fs_info)
953{
954 struct btrfs_root *quota_root;
955 struct btrfs_root *tree_root = fs_info->tree_root;
956 struct btrfs_path *path = NULL;
957 struct btrfs_qgroup_status_item *ptr;
958 struct extent_buffer *leaf;
959 struct btrfs_key key;
960 struct btrfs_key found_key;
961 struct btrfs_qgroup *qgroup = NULL;
962 struct btrfs_trans_handle *trans = NULL;
963 struct ulist *ulist = NULL;
964 int ret = 0;
965 int slot;
966
967 /*
968 * We need to have subvol_sem write locked, to prevent races between
969 * concurrent tasks trying to enable quotas, because we will unlock
970 * and relock qgroup_ioctl_lock before setting fs_info->quota_root
971 * and before setting BTRFS_FS_QUOTA_ENABLED.
972 */
973 lockdep_assert_held_write(&fs_info->subvol_sem);
974
975 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) {
976 btrfs_err(fs_info,
977 "qgroups are currently unsupported in extent tree v2");
978 return -EINVAL;
979 }
980
981 mutex_lock(&fs_info->qgroup_ioctl_lock);
982 if (fs_info->quota_root)
983 goto out;
984
985 ulist = ulist_alloc(GFP_KERNEL);
986 if (!ulist) {
987 ret = -ENOMEM;
988 goto out;
989 }
990
991 ret = btrfs_sysfs_add_qgroups(fs_info);
992 if (ret < 0)
993 goto out;
994
995 /*
996 * Unlock qgroup_ioctl_lock before starting the transaction. This is to
997 * avoid lock acquisition inversion problems (reported by lockdep) between
998 * qgroup_ioctl_lock and the vfs freeze semaphores, acquired when we
999 * start a transaction.
1000 * After we started the transaction lock qgroup_ioctl_lock again and
1001 * check if someone else created the quota root in the meanwhile. If so,
1002 * just return success and release the transaction handle.
1003 *
1004 * Also we don't need to worry about someone else calling
1005 * btrfs_sysfs_add_qgroups() after we unlock and getting an error because
1006 * that function returns 0 (success) when the sysfs entries already exist.
1007 */
1008 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1009
1010 /*
1011 * 1 for quota root item
1012 * 1 for BTRFS_QGROUP_STATUS item
1013 *
1014 * Yet we also need 2*n items for a QGROUP_INFO/QGROUP_LIMIT items
1015 * per subvolume. However those are not currently reserved since it
1016 * would be a lot of overkill.
1017 */
1018 trans = btrfs_start_transaction(tree_root, 2);
1019
1020 mutex_lock(&fs_info->qgroup_ioctl_lock);
1021 if (IS_ERR(trans)) {
1022 ret = PTR_ERR(trans);
1023 trans = NULL;
1024 goto out;
1025 }
1026
1027 if (fs_info->quota_root)
1028 goto out;
1029
1030 fs_info->qgroup_ulist = ulist;
1031 ulist = NULL;
1032
1033 /*
1034 * initially create the quota tree
1035 */
1036 quota_root = btrfs_create_tree(trans, BTRFS_QUOTA_TREE_OBJECTID);
1037 if (IS_ERR(quota_root)) {
1038 ret = PTR_ERR(quota_root);
1039 btrfs_abort_transaction(trans, ret);
1040 goto out;
1041 }
1042
1043 path = btrfs_alloc_path();
1044 if (!path) {
1045 ret = -ENOMEM;
1046 btrfs_abort_transaction(trans, ret);
1047 goto out_free_root;
1048 }
1049
1050 key.objectid = 0;
1051 key.type = BTRFS_QGROUP_STATUS_KEY;
1052 key.offset = 0;
1053
1054 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
1055 sizeof(*ptr));
1056 if (ret) {
1057 btrfs_abort_transaction(trans, ret);
1058 goto out_free_path;
1059 }
1060
1061 leaf = path->nodes[0];
1062 ptr = btrfs_item_ptr(leaf, path->slots[0],
1063 struct btrfs_qgroup_status_item);
1064 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
1065 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
1066 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON |
1067 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1068 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags &
1069 BTRFS_QGROUP_STATUS_FLAGS_MASK);
1070 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
1071
1072 btrfs_mark_buffer_dirty(leaf);
1073
1074 key.objectid = 0;
1075 key.type = BTRFS_ROOT_REF_KEY;
1076 key.offset = 0;
1077
1078 btrfs_release_path(path);
1079 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
1080 if (ret > 0)
1081 goto out_add_root;
1082 if (ret < 0) {
1083 btrfs_abort_transaction(trans, ret);
1084 goto out_free_path;
1085 }
1086
1087 while (1) {
1088 slot = path->slots[0];
1089 leaf = path->nodes[0];
1090 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1091
1092 if (found_key.type == BTRFS_ROOT_REF_KEY) {
1093
1094 /* Release locks on tree_root before we access quota_root */
1095 btrfs_release_path(path);
1096
1097 ret = add_qgroup_item(trans, quota_root,
1098 found_key.offset);
1099 if (ret) {
1100 btrfs_abort_transaction(trans, ret);
1101 goto out_free_path;
1102 }
1103
1104 qgroup = add_qgroup_rb(fs_info, found_key.offset);
1105 if (IS_ERR(qgroup)) {
1106 ret = PTR_ERR(qgroup);
1107 btrfs_abort_transaction(trans, ret);
1108 goto out_free_path;
1109 }
1110 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1111 if (ret < 0) {
1112 btrfs_abort_transaction(trans, ret);
1113 goto out_free_path;
1114 }
1115 ret = btrfs_search_slot_for_read(tree_root, &found_key,
1116 path, 1, 0);
1117 if (ret < 0) {
1118 btrfs_abort_transaction(trans, ret);
1119 goto out_free_path;
1120 }
1121 if (ret > 0) {
1122 /*
1123 * Shouldn't happen, but in case it does we
1124 * don't need to do the btrfs_next_item, just
1125 * continue.
1126 */
1127 continue;
1128 }
1129 }
1130 ret = btrfs_next_item(tree_root, path);
1131 if (ret < 0) {
1132 btrfs_abort_transaction(trans, ret);
1133 goto out_free_path;
1134 }
1135 if (ret)
1136 break;
1137 }
1138
1139out_add_root:
1140 btrfs_release_path(path);
1141 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
1142 if (ret) {
1143 btrfs_abort_transaction(trans, ret);
1144 goto out_free_path;
1145 }
1146
1147 qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID);
1148 if (IS_ERR(qgroup)) {
1149 ret = PTR_ERR(qgroup);
1150 btrfs_abort_transaction(trans, ret);
1151 goto out_free_path;
1152 }
1153 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1154 if (ret < 0) {
1155 btrfs_abort_transaction(trans, ret);
1156 goto out_free_path;
1157 }
1158
1159 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1160 /*
1161 * Commit the transaction while not holding qgroup_ioctl_lock, to avoid
1162 * a deadlock with tasks concurrently doing other qgroup operations, such
1163 * adding/removing qgroups or adding/deleting qgroup relations for example,
1164 * because all qgroup operations first start or join a transaction and then
1165 * lock the qgroup_ioctl_lock mutex.
1166 * We are safe from a concurrent task trying to enable quotas, by calling
1167 * this function, since we are serialized by fs_info->subvol_sem.
1168 */
1169 ret = btrfs_commit_transaction(trans);
1170 trans = NULL;
1171 mutex_lock(&fs_info->qgroup_ioctl_lock);
1172 if (ret)
1173 goto out_free_path;
1174
1175 /*
1176 * Set quota enabled flag after committing the transaction, to avoid
1177 * deadlocks on fs_info->qgroup_ioctl_lock with concurrent snapshot
1178 * creation.
1179 */
1180 spin_lock(&fs_info->qgroup_lock);
1181 fs_info->quota_root = quota_root;
1182 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1183 spin_unlock(&fs_info->qgroup_lock);
1184
1185 ret = qgroup_rescan_init(fs_info, 0, 1);
1186 if (!ret) {
1187 qgroup_rescan_zero_tracking(fs_info);
1188 fs_info->qgroup_rescan_running = true;
1189 btrfs_queue_work(fs_info->qgroup_rescan_workers,
1190 &fs_info->qgroup_rescan_work);
1191 } else {
1192 /*
1193 * We have set both BTRFS_FS_QUOTA_ENABLED and
1194 * BTRFS_QGROUP_STATUS_FLAG_ON, so we can only fail with
1195 * -EINPROGRESS. That can happen because someone started the
1196 * rescan worker by calling quota rescan ioctl before we
1197 * attempted to initialize the rescan worker. Failure due to
1198 * quotas disabled in the meanwhile is not possible, because
1199 * we are holding a write lock on fs_info->subvol_sem, which
1200 * is also acquired when disabling quotas.
1201 * Ignore such error, and any other error would need to undo
1202 * everything we did in the transaction we just committed.
1203 */
1204 ASSERT(ret == -EINPROGRESS);
1205 ret = 0;
1206 }
1207
1208out_free_path:
1209 btrfs_free_path(path);
1210out_free_root:
1211 if (ret)
1212 btrfs_put_root(quota_root);
1213out:
1214 if (ret) {
1215 ulist_free(fs_info->qgroup_ulist);
1216 fs_info->qgroup_ulist = NULL;
1217 btrfs_sysfs_del_qgroups(fs_info);
1218 }
1219 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1220 if (ret && trans)
1221 btrfs_end_transaction(trans);
1222 else if (trans)
1223 ret = btrfs_end_transaction(trans);
1224 ulist_free(ulist);
1225 return ret;
1226}
1227
1228int btrfs_quota_disable(struct btrfs_fs_info *fs_info)
1229{
1230 struct btrfs_root *quota_root;
1231 struct btrfs_trans_handle *trans = NULL;
1232 int ret = 0;
1233
1234 /*
1235 * We need to have subvol_sem write locked, to prevent races between
1236 * concurrent tasks trying to disable quotas, because we will unlock
1237 * and relock qgroup_ioctl_lock across BTRFS_FS_QUOTA_ENABLED changes.
1238 */
1239 lockdep_assert_held_write(&fs_info->subvol_sem);
1240
1241 mutex_lock(&fs_info->qgroup_ioctl_lock);
1242 if (!fs_info->quota_root)
1243 goto out;
1244
1245 /*
1246 * Unlock the qgroup_ioctl_lock mutex before waiting for the rescan worker to
1247 * complete. Otherwise we can deadlock because btrfs_remove_qgroup() needs
1248 * to lock that mutex while holding a transaction handle and the rescan
1249 * worker needs to commit a transaction.
1250 */
1251 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1252
1253 /*
1254 * Request qgroup rescan worker to complete and wait for it. This wait
1255 * must be done before transaction start for quota disable since it may
1256 * deadlock with transaction by the qgroup rescan worker.
1257 */
1258 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1259 btrfs_qgroup_wait_for_completion(fs_info, false);
1260
1261 /*
1262 * 1 For the root item
1263 *
1264 * We should also reserve enough items for the quota tree deletion in
1265 * btrfs_clean_quota_tree but this is not done.
1266 *
1267 * Also, we must always start a transaction without holding the mutex
1268 * qgroup_ioctl_lock, see btrfs_quota_enable().
1269 */
1270 trans = btrfs_start_transaction(fs_info->tree_root, 1);
1271
1272 mutex_lock(&fs_info->qgroup_ioctl_lock);
1273 if (IS_ERR(trans)) {
1274 ret = PTR_ERR(trans);
1275 trans = NULL;
1276 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1277 goto out;
1278 }
1279
1280 if (!fs_info->quota_root)
1281 goto out;
1282
1283 spin_lock(&fs_info->qgroup_lock);
1284 quota_root = fs_info->quota_root;
1285 fs_info->quota_root = NULL;
1286 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
1287 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL;
1288 spin_unlock(&fs_info->qgroup_lock);
1289
1290 btrfs_free_qgroup_config(fs_info);
1291
1292 ret = btrfs_clean_quota_tree(trans, quota_root);
1293 if (ret) {
1294 btrfs_abort_transaction(trans, ret);
1295 goto out;
1296 }
1297
1298 ret = btrfs_del_root(trans, "a_root->root_key);
1299 if (ret) {
1300 btrfs_abort_transaction(trans, ret);
1301 goto out;
1302 }
1303
1304 list_del("a_root->dirty_list);
1305
1306 btrfs_tree_lock(quota_root->node);
1307 btrfs_clean_tree_block(quota_root->node);
1308 btrfs_tree_unlock(quota_root->node);
1309 btrfs_free_tree_block(trans, btrfs_root_id(quota_root),
1310 quota_root->node, 0, 1);
1311
1312 btrfs_put_root(quota_root);
1313
1314out:
1315 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1316 if (ret && trans)
1317 btrfs_end_transaction(trans);
1318 else if (trans)
1319 ret = btrfs_end_transaction(trans);
1320
1321 return ret;
1322}
1323
1324static void qgroup_dirty(struct btrfs_fs_info *fs_info,
1325 struct btrfs_qgroup *qgroup)
1326{
1327 if (list_empty(&qgroup->dirty))
1328 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1329}
1330
1331/*
1332 * The easy accounting, we're updating qgroup relationship whose child qgroup
1333 * only has exclusive extents.
1334 *
1335 * In this case, all exclusive extents will also be exclusive for parent, so
1336 * excl/rfer just get added/removed.
1337 *
1338 * So is qgroup reservation space, which should also be added/removed to
1339 * parent.
1340 * Or when child tries to release reservation space, parent will underflow its
1341 * reservation (for relationship adding case).
1342 *
1343 * Caller should hold fs_info->qgroup_lock.
1344 */
1345static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info,
1346 struct ulist *tmp, u64 ref_root,
1347 struct btrfs_qgroup *src, int sign)
1348{
1349 struct btrfs_qgroup *qgroup;
1350 struct btrfs_qgroup_list *glist;
1351 struct ulist_node *unode;
1352 struct ulist_iterator uiter;
1353 u64 num_bytes = src->excl;
1354 int ret = 0;
1355
1356 qgroup = find_qgroup_rb(fs_info, ref_root);
1357 if (!qgroup)
1358 goto out;
1359
1360 qgroup->rfer += sign * num_bytes;
1361 qgroup->rfer_cmpr += sign * num_bytes;
1362
1363 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1364 qgroup->excl += sign * num_bytes;
1365 qgroup->excl_cmpr += sign * num_bytes;
1366
1367 if (sign > 0)
1368 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1369 else
1370 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1371
1372 qgroup_dirty(fs_info, qgroup);
1373
1374 /* Get all of the parent groups that contain this qgroup */
1375 list_for_each_entry(glist, &qgroup->groups, next_group) {
1376 ret = ulist_add(tmp, glist->group->qgroupid,
1377 qgroup_to_aux(glist->group), GFP_ATOMIC);
1378 if (ret < 0)
1379 goto out;
1380 }
1381
1382 /* Iterate all of the parents and adjust their reference counts */
1383 ULIST_ITER_INIT(&uiter);
1384 while ((unode = ulist_next(tmp, &uiter))) {
1385 qgroup = unode_aux_to_qgroup(unode);
1386 qgroup->rfer += sign * num_bytes;
1387 qgroup->rfer_cmpr += sign * num_bytes;
1388 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1389 qgroup->excl += sign * num_bytes;
1390 if (sign > 0)
1391 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1392 else
1393 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1394 qgroup->excl_cmpr += sign * num_bytes;
1395 qgroup_dirty(fs_info, qgroup);
1396
1397 /* Add any parents of the parents */
1398 list_for_each_entry(glist, &qgroup->groups, next_group) {
1399 ret = ulist_add(tmp, glist->group->qgroupid,
1400 qgroup_to_aux(glist->group), GFP_ATOMIC);
1401 if (ret < 0)
1402 goto out;
1403 }
1404 }
1405 ret = 0;
1406out:
1407 return ret;
1408}
1409
1410
1411/*
1412 * Quick path for updating qgroup with only excl refs.
1413 *
1414 * In that case, just update all parent will be enough.
1415 * Or we needs to do a full rescan.
1416 * Caller should also hold fs_info->qgroup_lock.
1417 *
1418 * Return 0 for quick update, return >0 for need to full rescan
1419 * and mark INCONSISTENT flag.
1420 * Return < 0 for other error.
1421 */
1422static int quick_update_accounting(struct btrfs_fs_info *fs_info,
1423 struct ulist *tmp, u64 src, u64 dst,
1424 int sign)
1425{
1426 struct btrfs_qgroup *qgroup;
1427 int ret = 1;
1428 int err = 0;
1429
1430 qgroup = find_qgroup_rb(fs_info, src);
1431 if (!qgroup)
1432 goto out;
1433 if (qgroup->excl == qgroup->rfer) {
1434 ret = 0;
1435 err = __qgroup_excl_accounting(fs_info, tmp, dst,
1436 qgroup, sign);
1437 if (err < 0) {
1438 ret = err;
1439 goto out;
1440 }
1441 }
1442out:
1443 if (ret)
1444 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1445 return ret;
1446}
1447
1448int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1449 u64 dst)
1450{
1451 struct btrfs_fs_info *fs_info = trans->fs_info;
1452 struct btrfs_qgroup *parent;
1453 struct btrfs_qgroup *member;
1454 struct btrfs_qgroup_list *list;
1455 struct ulist *tmp;
1456 unsigned int nofs_flag;
1457 int ret = 0;
1458
1459 /* Check the level of src and dst first */
1460 if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst))
1461 return -EINVAL;
1462
1463 /* We hold a transaction handle open, must do a NOFS allocation. */
1464 nofs_flag = memalloc_nofs_save();
1465 tmp = ulist_alloc(GFP_KERNEL);
1466 memalloc_nofs_restore(nofs_flag);
1467 if (!tmp)
1468 return -ENOMEM;
1469
1470 mutex_lock(&fs_info->qgroup_ioctl_lock);
1471 if (!fs_info->quota_root) {
1472 ret = -ENOTCONN;
1473 goto out;
1474 }
1475 member = find_qgroup_rb(fs_info, src);
1476 parent = find_qgroup_rb(fs_info, dst);
1477 if (!member || !parent) {
1478 ret = -EINVAL;
1479 goto out;
1480 }
1481
1482 /* check if such qgroup relation exist firstly */
1483 list_for_each_entry(list, &member->groups, next_group) {
1484 if (list->group == parent) {
1485 ret = -EEXIST;
1486 goto out;
1487 }
1488 }
1489
1490 ret = add_qgroup_relation_item(trans, src, dst);
1491 if (ret)
1492 goto out;
1493
1494 ret = add_qgroup_relation_item(trans, dst, src);
1495 if (ret) {
1496 del_qgroup_relation_item(trans, src, dst);
1497 goto out;
1498 }
1499
1500 spin_lock(&fs_info->qgroup_lock);
1501 ret = __add_relation_rb(member, parent);
1502 if (ret < 0) {
1503 spin_unlock(&fs_info->qgroup_lock);
1504 goto out;
1505 }
1506 ret = quick_update_accounting(fs_info, tmp, src, dst, 1);
1507 spin_unlock(&fs_info->qgroup_lock);
1508out:
1509 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1510 ulist_free(tmp);
1511 return ret;
1512}
1513
1514static int __del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1515 u64 dst)
1516{
1517 struct btrfs_fs_info *fs_info = trans->fs_info;
1518 struct btrfs_qgroup *parent;
1519 struct btrfs_qgroup *member;
1520 struct btrfs_qgroup_list *list;
1521 struct ulist *tmp;
1522 bool found = false;
1523 unsigned int nofs_flag;
1524 int ret = 0;
1525 int ret2;
1526
1527 /* We hold a transaction handle open, must do a NOFS allocation. */
1528 nofs_flag = memalloc_nofs_save();
1529 tmp = ulist_alloc(GFP_KERNEL);
1530 memalloc_nofs_restore(nofs_flag);
1531 if (!tmp)
1532 return -ENOMEM;
1533
1534 if (!fs_info->quota_root) {
1535 ret = -ENOTCONN;
1536 goto out;
1537 }
1538
1539 member = find_qgroup_rb(fs_info, src);
1540 parent = find_qgroup_rb(fs_info, dst);
1541 /*
1542 * The parent/member pair doesn't exist, then try to delete the dead
1543 * relation items only.
1544 */
1545 if (!member || !parent)
1546 goto delete_item;
1547
1548 /* check if such qgroup relation exist firstly */
1549 list_for_each_entry(list, &member->groups, next_group) {
1550 if (list->group == parent) {
1551 found = true;
1552 break;
1553 }
1554 }
1555
1556delete_item:
1557 ret = del_qgroup_relation_item(trans, src, dst);
1558 if (ret < 0 && ret != -ENOENT)
1559 goto out;
1560 ret2 = del_qgroup_relation_item(trans, dst, src);
1561 if (ret2 < 0 && ret2 != -ENOENT)
1562 goto out;
1563
1564 /* At least one deletion succeeded, return 0 */
1565 if (!ret || !ret2)
1566 ret = 0;
1567
1568 if (found) {
1569 spin_lock(&fs_info->qgroup_lock);
1570 del_relation_rb(fs_info, src, dst);
1571 ret = quick_update_accounting(fs_info, tmp, src, dst, -1);
1572 spin_unlock(&fs_info->qgroup_lock);
1573 }
1574out:
1575 ulist_free(tmp);
1576 return ret;
1577}
1578
1579int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1580 u64 dst)
1581{
1582 struct btrfs_fs_info *fs_info = trans->fs_info;
1583 int ret = 0;
1584
1585 mutex_lock(&fs_info->qgroup_ioctl_lock);
1586 ret = __del_qgroup_relation(trans, src, dst);
1587 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1588
1589 return ret;
1590}
1591
1592int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1593{
1594 struct btrfs_fs_info *fs_info = trans->fs_info;
1595 struct btrfs_root *quota_root;
1596 struct btrfs_qgroup *qgroup;
1597 int ret = 0;
1598
1599 mutex_lock(&fs_info->qgroup_ioctl_lock);
1600 if (!fs_info->quota_root) {
1601 ret = -ENOTCONN;
1602 goto out;
1603 }
1604 quota_root = fs_info->quota_root;
1605 qgroup = find_qgroup_rb(fs_info, qgroupid);
1606 if (qgroup) {
1607 ret = -EEXIST;
1608 goto out;
1609 }
1610
1611 ret = add_qgroup_item(trans, quota_root, qgroupid);
1612 if (ret)
1613 goto out;
1614
1615 spin_lock(&fs_info->qgroup_lock);
1616 qgroup = add_qgroup_rb(fs_info, qgroupid);
1617 spin_unlock(&fs_info->qgroup_lock);
1618
1619 if (IS_ERR(qgroup)) {
1620 ret = PTR_ERR(qgroup);
1621 goto out;
1622 }
1623 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1624out:
1625 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1626 return ret;
1627}
1628
1629int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1630{
1631 struct btrfs_fs_info *fs_info = trans->fs_info;
1632 struct btrfs_qgroup *qgroup;
1633 struct btrfs_qgroup_list *list;
1634 int ret = 0;
1635
1636 mutex_lock(&fs_info->qgroup_ioctl_lock);
1637 if (!fs_info->quota_root) {
1638 ret = -ENOTCONN;
1639 goto out;
1640 }
1641
1642 qgroup = find_qgroup_rb(fs_info, qgroupid);
1643 if (!qgroup) {
1644 ret = -ENOENT;
1645 goto out;
1646 }
1647
1648 /* Check if there are no children of this qgroup */
1649 if (!list_empty(&qgroup->members)) {
1650 ret = -EBUSY;
1651 goto out;
1652 }
1653
1654 ret = del_qgroup_item(trans, qgroupid);
1655 if (ret && ret != -ENOENT)
1656 goto out;
1657
1658 while (!list_empty(&qgroup->groups)) {
1659 list = list_first_entry(&qgroup->groups,
1660 struct btrfs_qgroup_list, next_group);
1661 ret = __del_qgroup_relation(trans, qgroupid,
1662 list->group->qgroupid);
1663 if (ret)
1664 goto out;
1665 }
1666
1667 spin_lock(&fs_info->qgroup_lock);
1668 del_qgroup_rb(fs_info, qgroupid);
1669 spin_unlock(&fs_info->qgroup_lock);
1670
1671 /*
1672 * Remove the qgroup from sysfs now without holding the qgroup_lock
1673 * spinlock, since the sysfs_remove_group() function needs to take
1674 * the mutex kernfs_mutex through kernfs_remove_by_name_ns().
1675 */
1676 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
1677 kfree(qgroup);
1678out:
1679 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1680 return ret;
1681}
1682
1683int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
1684 struct btrfs_qgroup_limit *limit)
1685{
1686 struct btrfs_fs_info *fs_info = trans->fs_info;
1687 struct btrfs_qgroup *qgroup;
1688 int ret = 0;
1689 /* Sometimes we would want to clear the limit on this qgroup.
1690 * To meet this requirement, we treat the -1 as a special value
1691 * which tell kernel to clear the limit on this qgroup.
1692 */
1693 const u64 CLEAR_VALUE = -1;
1694
1695 mutex_lock(&fs_info->qgroup_ioctl_lock);
1696 if (!fs_info->quota_root) {
1697 ret = -ENOTCONN;
1698 goto out;
1699 }
1700
1701 qgroup = find_qgroup_rb(fs_info, qgroupid);
1702 if (!qgroup) {
1703 ret = -ENOENT;
1704 goto out;
1705 }
1706
1707 spin_lock(&fs_info->qgroup_lock);
1708 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) {
1709 if (limit->max_rfer == CLEAR_VALUE) {
1710 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1711 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1712 qgroup->max_rfer = 0;
1713 } else {
1714 qgroup->max_rfer = limit->max_rfer;
1715 }
1716 }
1717 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
1718 if (limit->max_excl == CLEAR_VALUE) {
1719 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1720 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1721 qgroup->max_excl = 0;
1722 } else {
1723 qgroup->max_excl = limit->max_excl;
1724 }
1725 }
1726 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) {
1727 if (limit->rsv_rfer == CLEAR_VALUE) {
1728 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1729 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1730 qgroup->rsv_rfer = 0;
1731 } else {
1732 qgroup->rsv_rfer = limit->rsv_rfer;
1733 }
1734 }
1735 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) {
1736 if (limit->rsv_excl == CLEAR_VALUE) {
1737 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1738 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1739 qgroup->rsv_excl = 0;
1740 } else {
1741 qgroup->rsv_excl = limit->rsv_excl;
1742 }
1743 }
1744 qgroup->lim_flags |= limit->flags;
1745
1746 spin_unlock(&fs_info->qgroup_lock);
1747
1748 ret = update_qgroup_limit_item(trans, qgroup);
1749 if (ret) {
1750 qgroup_mark_inconsistent(fs_info);
1751 btrfs_info(fs_info, "unable to update quota limit for %llu",
1752 qgroupid);
1753 }
1754
1755out:
1756 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1757 return ret;
1758}
1759
1760int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info,
1761 struct btrfs_delayed_ref_root *delayed_refs,
1762 struct btrfs_qgroup_extent_record *record)
1763{
1764 struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node;
1765 struct rb_node *parent_node = NULL;
1766 struct btrfs_qgroup_extent_record *entry;
1767 u64 bytenr = record->bytenr;
1768
1769 lockdep_assert_held(&delayed_refs->lock);
1770 trace_btrfs_qgroup_trace_extent(fs_info, record);
1771
1772 while (*p) {
1773 parent_node = *p;
1774 entry = rb_entry(parent_node, struct btrfs_qgroup_extent_record,
1775 node);
1776 if (bytenr < entry->bytenr) {
1777 p = &(*p)->rb_left;
1778 } else if (bytenr > entry->bytenr) {
1779 p = &(*p)->rb_right;
1780 } else {
1781 if (record->data_rsv && !entry->data_rsv) {
1782 entry->data_rsv = record->data_rsv;
1783 entry->data_rsv_refroot =
1784 record->data_rsv_refroot;
1785 }
1786 return 1;
1787 }
1788 }
1789
1790 rb_link_node(&record->node, parent_node, p);
1791 rb_insert_color(&record->node, &delayed_refs->dirty_extent_root);
1792 return 0;
1793}
1794
1795int btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle *trans,
1796 struct btrfs_qgroup_extent_record *qrecord)
1797{
1798 struct btrfs_backref_walk_ctx ctx = { 0 };
1799 int ret;
1800
1801 /*
1802 * We are always called in a context where we are already holding a
1803 * transaction handle. Often we are called when adding a data delayed
1804 * reference from btrfs_truncate_inode_items() (truncating or unlinking),
1805 * in which case we will be holding a write lock on extent buffer from a
1806 * subvolume tree. In this case we can't allow btrfs_find_all_roots() to
1807 * acquire fs_info->commit_root_sem, because that is a higher level lock
1808 * that must be acquired before locking any extent buffers.
1809 *
1810 * So we want btrfs_find_all_roots() to not acquire the commit_root_sem
1811 * but we can't pass it a non-NULL transaction handle, because otherwise
1812 * it would not use commit roots and would lock extent buffers, causing
1813 * a deadlock if it ends up trying to read lock the same extent buffer
1814 * that was previously write locked at btrfs_truncate_inode_items().
1815 *
1816 * So pass a NULL transaction handle to btrfs_find_all_roots() and
1817 * explicitly tell it to not acquire the commit_root_sem - if we are
1818 * holding a transaction handle we don't need its protection.
1819 */
1820 ASSERT(trans != NULL);
1821
1822 if (trans->fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
1823 return 0;
1824
1825 ctx.bytenr = qrecord->bytenr;
1826 ctx.fs_info = trans->fs_info;
1827
1828 ret = btrfs_find_all_roots(&ctx, true);
1829 if (ret < 0) {
1830 qgroup_mark_inconsistent(trans->fs_info);
1831 btrfs_warn(trans->fs_info,
1832"error accounting new delayed refs extent (err code: %d), quota inconsistent",
1833 ret);
1834 return 0;
1835 }
1836
1837 /*
1838 * Here we don't need to get the lock of
1839 * trans->transaction->delayed_refs, since inserted qrecord won't
1840 * be deleted, only qrecord->node may be modified (new qrecord insert)
1841 *
1842 * So modifying qrecord->old_roots is safe here
1843 */
1844 qrecord->old_roots = ctx.roots;
1845 return 0;
1846}
1847
1848int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
1849 u64 num_bytes)
1850{
1851 struct btrfs_fs_info *fs_info = trans->fs_info;
1852 struct btrfs_qgroup_extent_record *record;
1853 struct btrfs_delayed_ref_root *delayed_refs;
1854 int ret;
1855
1856 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)
1857 || bytenr == 0 || num_bytes == 0)
1858 return 0;
1859 record = kzalloc(sizeof(*record), GFP_NOFS);
1860 if (!record)
1861 return -ENOMEM;
1862
1863 delayed_refs = &trans->transaction->delayed_refs;
1864 record->bytenr = bytenr;
1865 record->num_bytes = num_bytes;
1866 record->old_roots = NULL;
1867
1868 spin_lock(&delayed_refs->lock);
1869 ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record);
1870 spin_unlock(&delayed_refs->lock);
1871 if (ret > 0) {
1872 kfree(record);
1873 return 0;
1874 }
1875 return btrfs_qgroup_trace_extent_post(trans, record);
1876}
1877
1878int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
1879 struct extent_buffer *eb)
1880{
1881 struct btrfs_fs_info *fs_info = trans->fs_info;
1882 int nr = btrfs_header_nritems(eb);
1883 int i, extent_type, ret;
1884 struct btrfs_key key;
1885 struct btrfs_file_extent_item *fi;
1886 u64 bytenr, num_bytes;
1887
1888 /* We can be called directly from walk_up_proc() */
1889 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1890 return 0;
1891
1892 for (i = 0; i < nr; i++) {
1893 btrfs_item_key_to_cpu(eb, &key, i);
1894
1895 if (key.type != BTRFS_EXTENT_DATA_KEY)
1896 continue;
1897
1898 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
1899 /* filter out non qgroup-accountable extents */
1900 extent_type = btrfs_file_extent_type(eb, fi);
1901
1902 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1903 continue;
1904
1905 bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1906 if (!bytenr)
1907 continue;
1908
1909 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1910
1911 ret = btrfs_qgroup_trace_extent(trans, bytenr, num_bytes);
1912 if (ret)
1913 return ret;
1914 }
1915 cond_resched();
1916 return 0;
1917}
1918
1919/*
1920 * Walk up the tree from the bottom, freeing leaves and any interior
1921 * nodes which have had all slots visited. If a node (leaf or
1922 * interior) is freed, the node above it will have it's slot
1923 * incremented. The root node will never be freed.
1924 *
1925 * At the end of this function, we should have a path which has all
1926 * slots incremented to the next position for a search. If we need to
1927 * read a new node it will be NULL and the node above it will have the
1928 * correct slot selected for a later read.
1929 *
1930 * If we increment the root nodes slot counter past the number of
1931 * elements, 1 is returned to signal completion of the search.
1932 */
1933static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
1934{
1935 int level = 0;
1936 int nr, slot;
1937 struct extent_buffer *eb;
1938
1939 if (root_level == 0)
1940 return 1;
1941
1942 while (level <= root_level) {
1943 eb = path->nodes[level];
1944 nr = btrfs_header_nritems(eb);
1945 path->slots[level]++;
1946 slot = path->slots[level];
1947 if (slot >= nr || level == 0) {
1948 /*
1949 * Don't free the root - we will detect this
1950 * condition after our loop and return a
1951 * positive value for caller to stop walking the tree.
1952 */
1953 if (level != root_level) {
1954 btrfs_tree_unlock_rw(eb, path->locks[level]);
1955 path->locks[level] = 0;
1956
1957 free_extent_buffer(eb);
1958 path->nodes[level] = NULL;
1959 path->slots[level] = 0;
1960 }
1961 } else {
1962 /*
1963 * We have a valid slot to walk back down
1964 * from. Stop here so caller can process these
1965 * new nodes.
1966 */
1967 break;
1968 }
1969
1970 level++;
1971 }
1972
1973 eb = path->nodes[root_level];
1974 if (path->slots[root_level] >= btrfs_header_nritems(eb))
1975 return 1;
1976
1977 return 0;
1978}
1979
1980/*
1981 * Helper function to trace a subtree tree block swap.
1982 *
1983 * The swap will happen in highest tree block, but there may be a lot of
1984 * tree blocks involved.
1985 *
1986 * For example:
1987 * OO = Old tree blocks
1988 * NN = New tree blocks allocated during balance
1989 *
1990 * File tree (257) Reloc tree for 257
1991 * L2 OO NN
1992 * / \ / \
1993 * L1 OO OO (a) OO NN (a)
1994 * / \ / \ / \ / \
1995 * L0 OO OO OO OO OO OO NN NN
1996 * (b) (c) (b) (c)
1997 *
1998 * When calling qgroup_trace_extent_swap(), we will pass:
1999 * @src_eb = OO(a)
2000 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
2001 * @dst_level = 0
2002 * @root_level = 1
2003 *
2004 * In that case, qgroup_trace_extent_swap() will search from OO(a) to
2005 * reach OO(c), then mark both OO(c) and NN(c) as qgroup dirty.
2006 *
2007 * The main work of qgroup_trace_extent_swap() can be split into 3 parts:
2008 *
2009 * 1) Tree search from @src_eb
2010 * It should acts as a simplified btrfs_search_slot().
2011 * The key for search can be extracted from @dst_path->nodes[dst_level]
2012 * (first key).
2013 *
2014 * 2) Mark the final tree blocks in @src_path and @dst_path qgroup dirty
2015 * NOTE: In above case, OO(a) and NN(a) won't be marked qgroup dirty.
2016 * They should be marked during previous (@dst_level = 1) iteration.
2017 *
2018 * 3) Mark file extents in leaves dirty
2019 * We don't have good way to pick out new file extents only.
2020 * So we still follow the old method by scanning all file extents in
2021 * the leave.
2022 *
2023 * This function can free us from keeping two paths, thus later we only need
2024 * to care about how to iterate all new tree blocks in reloc tree.
2025 */
2026static int qgroup_trace_extent_swap(struct btrfs_trans_handle* trans,
2027 struct extent_buffer *src_eb,
2028 struct btrfs_path *dst_path,
2029 int dst_level, int root_level,
2030 bool trace_leaf)
2031{
2032 struct btrfs_key key;
2033 struct btrfs_path *src_path;
2034 struct btrfs_fs_info *fs_info = trans->fs_info;
2035 u32 nodesize = fs_info->nodesize;
2036 int cur_level = root_level;
2037 int ret;
2038
2039 BUG_ON(dst_level > root_level);
2040 /* Level mismatch */
2041 if (btrfs_header_level(src_eb) != root_level)
2042 return -EINVAL;
2043
2044 src_path = btrfs_alloc_path();
2045 if (!src_path) {
2046 ret = -ENOMEM;
2047 goto out;
2048 }
2049
2050 if (dst_level)
2051 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2052 else
2053 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2054
2055 /* For src_path */
2056 atomic_inc(&src_eb->refs);
2057 src_path->nodes[root_level] = src_eb;
2058 src_path->slots[root_level] = dst_path->slots[root_level];
2059 src_path->locks[root_level] = 0;
2060
2061 /* A simplified version of btrfs_search_slot() */
2062 while (cur_level >= dst_level) {
2063 struct btrfs_key src_key;
2064 struct btrfs_key dst_key;
2065
2066 if (src_path->nodes[cur_level] == NULL) {
2067 struct extent_buffer *eb;
2068 int parent_slot;
2069
2070 eb = src_path->nodes[cur_level + 1];
2071 parent_slot = src_path->slots[cur_level + 1];
2072
2073 eb = btrfs_read_node_slot(eb, parent_slot);
2074 if (IS_ERR(eb)) {
2075 ret = PTR_ERR(eb);
2076 goto out;
2077 }
2078
2079 src_path->nodes[cur_level] = eb;
2080
2081 btrfs_tree_read_lock(eb);
2082 src_path->locks[cur_level] = BTRFS_READ_LOCK;
2083 }
2084
2085 src_path->slots[cur_level] = dst_path->slots[cur_level];
2086 if (cur_level) {
2087 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
2088 &dst_key, dst_path->slots[cur_level]);
2089 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
2090 &src_key, src_path->slots[cur_level]);
2091 } else {
2092 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
2093 &dst_key, dst_path->slots[cur_level]);
2094 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
2095 &src_key, src_path->slots[cur_level]);
2096 }
2097 /* Content mismatch, something went wrong */
2098 if (btrfs_comp_cpu_keys(&dst_key, &src_key)) {
2099 ret = -ENOENT;
2100 goto out;
2101 }
2102 cur_level--;
2103 }
2104
2105 /*
2106 * Now both @dst_path and @src_path have been populated, record the tree
2107 * blocks for qgroup accounting.
2108 */
2109 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
2110 nodesize);
2111 if (ret < 0)
2112 goto out;
2113 ret = btrfs_qgroup_trace_extent(trans, dst_path->nodes[dst_level]->start,
2114 nodesize);
2115 if (ret < 0)
2116 goto out;
2117
2118 /* Record leaf file extents */
2119 if (dst_level == 0 && trace_leaf) {
2120 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
2121 if (ret < 0)
2122 goto out;
2123 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
2124 }
2125out:
2126 btrfs_free_path(src_path);
2127 return ret;
2128}
2129
2130/*
2131 * Helper function to do recursive generation-aware depth-first search, to
2132 * locate all new tree blocks in a subtree of reloc tree.
2133 *
2134 * E.g. (OO = Old tree blocks, NN = New tree blocks, whose gen == last_snapshot)
2135 * reloc tree
2136 * L2 NN (a)
2137 * / \
2138 * L1 OO NN (b)
2139 * / \ / \
2140 * L0 OO OO OO NN
2141 * (c) (d)
2142 * If we pass:
2143 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
2144 * @cur_level = 1
2145 * @root_level = 1
2146 *
2147 * We will iterate through tree blocks NN(b), NN(d) and info qgroup to trace
2148 * above tree blocks along with their counter parts in file tree.
2149 * While during search, old tree blocks OO(c) will be skipped as tree block swap
2150 * won't affect OO(c).
2151 */
2152static int qgroup_trace_new_subtree_blocks(struct btrfs_trans_handle* trans,
2153 struct extent_buffer *src_eb,
2154 struct btrfs_path *dst_path,
2155 int cur_level, int root_level,
2156 u64 last_snapshot, bool trace_leaf)
2157{
2158 struct btrfs_fs_info *fs_info = trans->fs_info;
2159 struct extent_buffer *eb;
2160 bool need_cleanup = false;
2161 int ret = 0;
2162 int i;
2163
2164 /* Level sanity check */
2165 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 ||
2166 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
2167 root_level < cur_level) {
2168 btrfs_err_rl(fs_info,
2169 "%s: bad levels, cur_level=%d root_level=%d",
2170 __func__, cur_level, root_level);
2171 return -EUCLEAN;
2172 }
2173
2174 /* Read the tree block if needed */
2175 if (dst_path->nodes[cur_level] == NULL) {
2176 int parent_slot;
2177 u64 child_gen;
2178
2179 /*
2180 * dst_path->nodes[root_level] must be initialized before
2181 * calling this function.
2182 */
2183 if (cur_level == root_level) {
2184 btrfs_err_rl(fs_info,
2185 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2186 __func__, root_level, root_level, cur_level);
2187 return -EUCLEAN;
2188 }
2189
2190 /*
2191 * We need to get child blockptr/gen from parent before we can
2192 * read it.
2193 */
2194 eb = dst_path->nodes[cur_level + 1];
2195 parent_slot = dst_path->slots[cur_level + 1];
2196 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
2197
2198 /* This node is old, no need to trace */
2199 if (child_gen < last_snapshot)
2200 goto out;
2201
2202 eb = btrfs_read_node_slot(eb, parent_slot);
2203 if (IS_ERR(eb)) {
2204 ret = PTR_ERR(eb);
2205 goto out;
2206 }
2207
2208 dst_path->nodes[cur_level] = eb;
2209 dst_path->slots[cur_level] = 0;
2210
2211 btrfs_tree_read_lock(eb);
2212 dst_path->locks[cur_level] = BTRFS_READ_LOCK;
2213 need_cleanup = true;
2214 }
2215
2216 /* Now record this tree block and its counter part for qgroups */
2217 ret = qgroup_trace_extent_swap(trans, src_eb, dst_path, cur_level,
2218 root_level, trace_leaf);
2219 if (ret < 0)
2220 goto cleanup;
2221
2222 eb = dst_path->nodes[cur_level];
2223
2224 if (cur_level > 0) {
2225 /* Iterate all child tree blocks */
2226 for (i = 0; i < btrfs_header_nritems(eb); i++) {
2227 /* Skip old tree blocks as they won't be swapped */
2228 if (btrfs_node_ptr_generation(eb, i) < last_snapshot)
2229 continue;
2230 dst_path->slots[cur_level] = i;
2231
2232 /* Recursive call (at most 7 times) */
2233 ret = qgroup_trace_new_subtree_blocks(trans, src_eb,
2234 dst_path, cur_level - 1, root_level,
2235 last_snapshot, trace_leaf);
2236 if (ret < 0)
2237 goto cleanup;
2238 }
2239 }
2240
2241cleanup:
2242 if (need_cleanup) {
2243 /* Clean up */
2244 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2245 dst_path->locks[cur_level]);
2246 free_extent_buffer(dst_path->nodes[cur_level]);
2247 dst_path->nodes[cur_level] = NULL;
2248 dst_path->slots[cur_level] = 0;
2249 dst_path->locks[cur_level] = 0;
2250 }
2251out:
2252 return ret;
2253}
2254
2255static int qgroup_trace_subtree_swap(struct btrfs_trans_handle *trans,
2256 struct extent_buffer *src_eb,
2257 struct extent_buffer *dst_eb,
2258 u64 last_snapshot, bool trace_leaf)
2259{
2260 struct btrfs_fs_info *fs_info = trans->fs_info;
2261 struct btrfs_path *dst_path = NULL;
2262 int level;
2263 int ret;
2264
2265 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2266 return 0;
2267
2268 /* Wrong parameter order */
2269 if (btrfs_header_generation(src_eb) > btrfs_header_generation(dst_eb)) {
2270 btrfs_err_rl(fs_info,
2271 "%s: bad parameter order, src_gen=%llu dst_gen=%llu", __func__,
2272 btrfs_header_generation(src_eb),
2273 btrfs_header_generation(dst_eb));
2274 return -EUCLEAN;
2275 }
2276
2277 if (!extent_buffer_uptodate(src_eb) || !extent_buffer_uptodate(dst_eb)) {
2278 ret = -EIO;
2279 goto out;
2280 }
2281
2282 level = btrfs_header_level(dst_eb);
2283 dst_path = btrfs_alloc_path();
2284 if (!dst_path) {
2285 ret = -ENOMEM;
2286 goto out;
2287 }
2288 /* For dst_path */
2289 atomic_inc(&dst_eb->refs);
2290 dst_path->nodes[level] = dst_eb;
2291 dst_path->slots[level] = 0;
2292 dst_path->locks[level] = 0;
2293
2294 /* Do the generation aware breadth-first search */
2295 ret = qgroup_trace_new_subtree_blocks(trans, src_eb, dst_path, level,
2296 level, last_snapshot, trace_leaf);
2297 if (ret < 0)
2298 goto out;
2299 ret = 0;
2300
2301out:
2302 btrfs_free_path(dst_path);
2303 if (ret < 0)
2304 qgroup_mark_inconsistent(fs_info);
2305 return ret;
2306}
2307
2308int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
2309 struct extent_buffer *root_eb,
2310 u64 root_gen, int root_level)
2311{
2312 struct btrfs_fs_info *fs_info = trans->fs_info;
2313 int ret = 0;
2314 int level;
2315 u8 drop_subptree_thres;
2316 struct extent_buffer *eb = root_eb;
2317 struct btrfs_path *path = NULL;
2318
2319 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL);
2320 BUG_ON(root_eb == NULL);
2321
2322 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2323 return 0;
2324
2325 spin_lock(&fs_info->qgroup_lock);
2326 drop_subptree_thres = fs_info->qgroup_drop_subtree_thres;
2327 spin_unlock(&fs_info->qgroup_lock);
2328
2329 /*
2330 * This function only gets called for snapshot drop, if we hit a high
2331 * node here, it means we are going to change ownership for quite a lot
2332 * of extents, which will greatly slow down btrfs_commit_transaction().
2333 *
2334 * So here if we find a high tree here, we just skip the accounting and
2335 * mark qgroup inconsistent.
2336 */
2337 if (root_level >= drop_subptree_thres) {
2338 qgroup_mark_inconsistent(fs_info);
2339 return 0;
2340 }
2341
2342 if (!extent_buffer_uptodate(root_eb)) {
2343 struct btrfs_tree_parent_check check = {
2344 .has_first_key = false,
2345 .transid = root_gen,
2346 .level = root_level
2347 };
2348
2349 ret = btrfs_read_extent_buffer(root_eb, &check);
2350 if (ret)
2351 goto out;
2352 }
2353
2354 if (root_level == 0) {
2355 ret = btrfs_qgroup_trace_leaf_items(trans, root_eb);
2356 goto out;
2357 }
2358
2359 path = btrfs_alloc_path();
2360 if (!path)
2361 return -ENOMEM;
2362
2363 /*
2364 * Walk down the tree. Missing extent blocks are filled in as
2365 * we go. Metadata is accounted every time we read a new
2366 * extent block.
2367 *
2368 * When we reach a leaf, we account for file extent items in it,
2369 * walk back up the tree (adjusting slot pointers as we go)
2370 * and restart the search process.
2371 */
2372 atomic_inc(&root_eb->refs); /* For path */
2373 path->nodes[root_level] = root_eb;
2374 path->slots[root_level] = 0;
2375 path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
2376walk_down:
2377 level = root_level;
2378 while (level >= 0) {
2379 if (path->nodes[level] == NULL) {
2380 int parent_slot;
2381 u64 child_bytenr;
2382
2383 /*
2384 * We need to get child blockptr from parent before we
2385 * can read it.
2386 */
2387 eb = path->nodes[level + 1];
2388 parent_slot = path->slots[level + 1];
2389 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
2390
2391 eb = btrfs_read_node_slot(eb, parent_slot);
2392 if (IS_ERR(eb)) {
2393 ret = PTR_ERR(eb);
2394 goto out;
2395 }
2396
2397 path->nodes[level] = eb;
2398 path->slots[level] = 0;
2399
2400 btrfs_tree_read_lock(eb);
2401 path->locks[level] = BTRFS_READ_LOCK;
2402
2403 ret = btrfs_qgroup_trace_extent(trans, child_bytenr,
2404 fs_info->nodesize);
2405 if (ret)
2406 goto out;
2407 }
2408
2409 if (level == 0) {
2410 ret = btrfs_qgroup_trace_leaf_items(trans,
2411 path->nodes[level]);
2412 if (ret)
2413 goto out;
2414
2415 /* Nonzero return here means we completed our search */
2416 ret = adjust_slots_upwards(path, root_level);
2417 if (ret)
2418 break;
2419
2420 /* Restart search with new slots */
2421 goto walk_down;
2422 }
2423
2424 level--;
2425 }
2426
2427 ret = 0;
2428out:
2429 btrfs_free_path(path);
2430
2431 return ret;
2432}
2433
2434#define UPDATE_NEW 0
2435#define UPDATE_OLD 1
2436/*
2437 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2438 */
2439static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
2440 struct ulist *roots, struct ulist *tmp,
2441 struct ulist *qgroups, u64 seq, int update_old)
2442{
2443 struct ulist_node *unode;
2444 struct ulist_iterator uiter;
2445 struct ulist_node *tmp_unode;
2446 struct ulist_iterator tmp_uiter;
2447 struct btrfs_qgroup *qg;
2448 int ret = 0;
2449
2450 if (!roots)
2451 return 0;
2452 ULIST_ITER_INIT(&uiter);
2453 while ((unode = ulist_next(roots, &uiter))) {
2454 qg = find_qgroup_rb(fs_info, unode->val);
2455 if (!qg)
2456 continue;
2457
2458 ulist_reinit(tmp);
2459 ret = ulist_add(qgroups, qg->qgroupid, qgroup_to_aux(qg),
2460 GFP_ATOMIC);
2461 if (ret < 0)
2462 return ret;
2463 ret = ulist_add(tmp, qg->qgroupid, qgroup_to_aux(qg), GFP_ATOMIC);
2464 if (ret < 0)
2465 return ret;
2466 ULIST_ITER_INIT(&tmp_uiter);
2467 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) {
2468 struct btrfs_qgroup_list *glist;
2469
2470 qg = unode_aux_to_qgroup(tmp_unode);
2471 if (update_old)
2472 btrfs_qgroup_update_old_refcnt(qg, seq, 1);
2473 else
2474 btrfs_qgroup_update_new_refcnt(qg, seq, 1);
2475 list_for_each_entry(glist, &qg->groups, next_group) {
2476 ret = ulist_add(qgroups, glist->group->qgroupid,
2477 qgroup_to_aux(glist->group),
2478 GFP_ATOMIC);
2479 if (ret < 0)
2480 return ret;
2481 ret = ulist_add(tmp, glist->group->qgroupid,
2482 qgroup_to_aux(glist->group),
2483 GFP_ATOMIC);
2484 if (ret < 0)
2485 return ret;
2486 }
2487 }
2488 }
2489 return 0;
2490}
2491
2492/*
2493 * Update qgroup rfer/excl counters.
2494 * Rfer update is easy, codes can explain themselves.
2495 *
2496 * Excl update is tricky, the update is split into 2 parts.
2497 * Part 1: Possible exclusive <-> sharing detect:
2498 * | A | !A |
2499 * -------------------------------------
2500 * B | * | - |
2501 * -------------------------------------
2502 * !B | + | ** |
2503 * -------------------------------------
2504 *
2505 * Conditions:
2506 * A: cur_old_roots < nr_old_roots (not exclusive before)
2507 * !A: cur_old_roots == nr_old_roots (possible exclusive before)
2508 * B: cur_new_roots < nr_new_roots (not exclusive now)
2509 * !B: cur_new_roots == nr_new_roots (possible exclusive now)
2510 *
2511 * Results:
2512 * +: Possible sharing -> exclusive -: Possible exclusive -> sharing
2513 * *: Definitely not changed. **: Possible unchanged.
2514 *
2515 * For !A and !B condition, the exception is cur_old/new_roots == 0 case.
2516 *
2517 * To make the logic clear, we first use condition A and B to split
2518 * combination into 4 results.
2519 *
2520 * Then, for result "+" and "-", check old/new_roots == 0 case, as in them
2521 * only on variant maybe 0.
2522 *
2523 * Lastly, check result **, since there are 2 variants maybe 0, split them
2524 * again(2x2).
2525 * But this time we don't need to consider other things, the codes and logic
2526 * is easy to understand now.
2527 */
2528static int qgroup_update_counters(struct btrfs_fs_info *fs_info,
2529 struct ulist *qgroups,
2530 u64 nr_old_roots,
2531 u64 nr_new_roots,
2532 u64 num_bytes, u64 seq)
2533{
2534 struct ulist_node *unode;
2535 struct ulist_iterator uiter;
2536 struct btrfs_qgroup *qg;
2537 u64 cur_new_count, cur_old_count;
2538
2539 ULIST_ITER_INIT(&uiter);
2540 while ((unode = ulist_next(qgroups, &uiter))) {
2541 bool dirty = false;
2542
2543 qg = unode_aux_to_qgroup(unode);
2544 cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq);
2545 cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq);
2546
2547 trace_qgroup_update_counters(fs_info, qg, cur_old_count,
2548 cur_new_count);
2549
2550 /* Rfer update part */
2551 if (cur_old_count == 0 && cur_new_count > 0) {
2552 qg->rfer += num_bytes;
2553 qg->rfer_cmpr += num_bytes;
2554 dirty = true;
2555 }
2556 if (cur_old_count > 0 && cur_new_count == 0) {
2557 qg->rfer -= num_bytes;
2558 qg->rfer_cmpr -= num_bytes;
2559 dirty = true;
2560 }
2561
2562 /* Excl update part */
2563 /* Exclusive/none -> shared case */
2564 if (cur_old_count == nr_old_roots &&
2565 cur_new_count < nr_new_roots) {
2566 /* Exclusive -> shared */
2567 if (cur_old_count != 0) {
2568 qg->excl -= num_bytes;
2569 qg->excl_cmpr -= num_bytes;
2570 dirty = true;
2571 }
2572 }
2573
2574 /* Shared -> exclusive/none case */
2575 if (cur_old_count < nr_old_roots &&
2576 cur_new_count == nr_new_roots) {
2577 /* Shared->exclusive */
2578 if (cur_new_count != 0) {
2579 qg->excl += num_bytes;
2580 qg->excl_cmpr += num_bytes;
2581 dirty = true;
2582 }
2583 }
2584
2585 /* Exclusive/none -> exclusive/none case */
2586 if (cur_old_count == nr_old_roots &&
2587 cur_new_count == nr_new_roots) {
2588 if (cur_old_count == 0) {
2589 /* None -> exclusive/none */
2590
2591 if (cur_new_count != 0) {
2592 /* None -> exclusive */
2593 qg->excl += num_bytes;
2594 qg->excl_cmpr += num_bytes;
2595 dirty = true;
2596 }
2597 /* None -> none, nothing changed */
2598 } else {
2599 /* Exclusive -> exclusive/none */
2600
2601 if (cur_new_count == 0) {
2602 /* Exclusive -> none */
2603 qg->excl -= num_bytes;
2604 qg->excl_cmpr -= num_bytes;
2605 dirty = true;
2606 }
2607 /* Exclusive -> exclusive, nothing changed */
2608 }
2609 }
2610
2611 if (dirty)
2612 qgroup_dirty(fs_info, qg);
2613 }
2614 return 0;
2615}
2616
2617/*
2618 * Check if the @roots potentially is a list of fs tree roots
2619 *
2620 * Return 0 for definitely not a fs/subvol tree roots ulist
2621 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2622 * one as well)
2623 */
2624static int maybe_fs_roots(struct ulist *roots)
2625{
2626 struct ulist_node *unode;
2627 struct ulist_iterator uiter;
2628
2629 /* Empty one, still possible for fs roots */
2630 if (!roots || roots->nnodes == 0)
2631 return 1;
2632
2633 ULIST_ITER_INIT(&uiter);
2634 unode = ulist_next(roots, &uiter);
2635 if (!unode)
2636 return 1;
2637
2638 /*
2639 * If it contains fs tree roots, then it must belong to fs/subvol
2640 * trees.
2641 * If it contains a non-fs tree, it won't be shared with fs/subvol trees.
2642 */
2643 return is_fstree(unode->val);
2644}
2645
2646int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
2647 u64 num_bytes, struct ulist *old_roots,
2648 struct ulist *new_roots)
2649{
2650 struct btrfs_fs_info *fs_info = trans->fs_info;
2651 struct ulist *qgroups = NULL;
2652 struct ulist *tmp = NULL;
2653 u64 seq;
2654 u64 nr_new_roots = 0;
2655 u64 nr_old_roots = 0;
2656 int ret = 0;
2657
2658 /*
2659 * If quotas get disabled meanwhile, the resources need to be freed and
2660 * we can't just exit here.
2661 */
2662 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
2663 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
2664 goto out_free;
2665
2666 if (new_roots) {
2667 if (!maybe_fs_roots(new_roots))
2668 goto out_free;
2669 nr_new_roots = new_roots->nnodes;
2670 }
2671 if (old_roots) {
2672 if (!maybe_fs_roots(old_roots))
2673 goto out_free;
2674 nr_old_roots = old_roots->nnodes;
2675 }
2676
2677 /* Quick exit, either not fs tree roots, or won't affect any qgroup */
2678 if (nr_old_roots == 0 && nr_new_roots == 0)
2679 goto out_free;
2680
2681 BUG_ON(!fs_info->quota_root);
2682
2683 trace_btrfs_qgroup_account_extent(fs_info, trans->transid, bytenr,
2684 num_bytes, nr_old_roots, nr_new_roots);
2685
2686 qgroups = ulist_alloc(GFP_NOFS);
2687 if (!qgroups) {
2688 ret = -ENOMEM;
2689 goto out_free;
2690 }
2691 tmp = ulist_alloc(GFP_NOFS);
2692 if (!tmp) {
2693 ret = -ENOMEM;
2694 goto out_free;
2695 }
2696
2697 mutex_lock(&fs_info->qgroup_rescan_lock);
2698 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
2699 if (fs_info->qgroup_rescan_progress.objectid <= bytenr) {
2700 mutex_unlock(&fs_info->qgroup_rescan_lock);
2701 ret = 0;
2702 goto out_free;
2703 }
2704 }
2705 mutex_unlock(&fs_info->qgroup_rescan_lock);
2706
2707 spin_lock(&fs_info->qgroup_lock);
2708 seq = fs_info->qgroup_seq;
2709
2710 /* Update old refcnts using old_roots */
2711 ret = qgroup_update_refcnt(fs_info, old_roots, tmp, qgroups, seq,
2712 UPDATE_OLD);
2713 if (ret < 0)
2714 goto out;
2715
2716 /* Update new refcnts using new_roots */
2717 ret = qgroup_update_refcnt(fs_info, new_roots, tmp, qgroups, seq,
2718 UPDATE_NEW);
2719 if (ret < 0)
2720 goto out;
2721
2722 qgroup_update_counters(fs_info, qgroups, nr_old_roots, nr_new_roots,
2723 num_bytes, seq);
2724
2725 /*
2726 * Bump qgroup_seq to avoid seq overlap
2727 */
2728 fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1;
2729out:
2730 spin_unlock(&fs_info->qgroup_lock);
2731out_free:
2732 ulist_free(tmp);
2733 ulist_free(qgroups);
2734 ulist_free(old_roots);
2735 ulist_free(new_roots);
2736 return ret;
2737}
2738
2739int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans)
2740{
2741 struct btrfs_fs_info *fs_info = trans->fs_info;
2742 struct btrfs_qgroup_extent_record *record;
2743 struct btrfs_delayed_ref_root *delayed_refs;
2744 struct ulist *new_roots = NULL;
2745 struct rb_node *node;
2746 u64 num_dirty_extents = 0;
2747 u64 qgroup_to_skip;
2748 int ret = 0;
2749
2750 delayed_refs = &trans->transaction->delayed_refs;
2751 qgroup_to_skip = delayed_refs->qgroup_to_skip;
2752 while ((node = rb_first(&delayed_refs->dirty_extent_root))) {
2753 record = rb_entry(node, struct btrfs_qgroup_extent_record,
2754 node);
2755
2756 num_dirty_extents++;
2757 trace_btrfs_qgroup_account_extents(fs_info, record);
2758
2759 if (!ret && !(fs_info->qgroup_flags &
2760 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)) {
2761 struct btrfs_backref_walk_ctx ctx = { 0 };
2762
2763 ctx.bytenr = record->bytenr;
2764 ctx.fs_info = fs_info;
2765
2766 /*
2767 * Old roots should be searched when inserting qgroup
2768 * extent record.
2769 *
2770 * But for INCONSISTENT (NO_ACCOUNTING) -> rescan case,
2771 * we may have some record inserted during
2772 * NO_ACCOUNTING (thus no old_roots populated), but
2773 * later we start rescan, which clears NO_ACCOUNTING,
2774 * leaving some inserted records without old_roots
2775 * populated.
2776 *
2777 * Those cases are rare and should not cause too much
2778 * time spent during commit_transaction().
2779 */
2780 if (!record->old_roots) {
2781 /* Search commit root to find old_roots */
2782 ret = btrfs_find_all_roots(&ctx, false);
2783 if (ret < 0)
2784 goto cleanup;
2785 record->old_roots = ctx.roots;
2786 ctx.roots = NULL;
2787 }
2788
2789 /* Free the reserved data space */
2790 btrfs_qgroup_free_refroot(fs_info,
2791 record->data_rsv_refroot,
2792 record->data_rsv,
2793 BTRFS_QGROUP_RSV_DATA);
2794 /*
2795 * Use BTRFS_SEQ_LAST as time_seq to do special search,
2796 * which doesn't lock tree or delayed_refs and search
2797 * current root. It's safe inside commit_transaction().
2798 */
2799 ctx.trans = trans;
2800 ctx.time_seq = BTRFS_SEQ_LAST;
2801 ret = btrfs_find_all_roots(&ctx, false);
2802 if (ret < 0)
2803 goto cleanup;
2804 new_roots = ctx.roots;
2805 if (qgroup_to_skip) {
2806 ulist_del(new_roots, qgroup_to_skip, 0);
2807 ulist_del(record->old_roots, qgroup_to_skip,
2808 0);
2809 }
2810 ret = btrfs_qgroup_account_extent(trans, record->bytenr,
2811 record->num_bytes,
2812 record->old_roots,
2813 new_roots);
2814 record->old_roots = NULL;
2815 new_roots = NULL;
2816 }
2817cleanup:
2818 ulist_free(record->old_roots);
2819 ulist_free(new_roots);
2820 new_roots = NULL;
2821 rb_erase(node, &delayed_refs->dirty_extent_root);
2822 kfree(record);
2823
2824 }
2825 trace_qgroup_num_dirty_extents(fs_info, trans->transid,
2826 num_dirty_extents);
2827 return ret;
2828}
2829
2830/*
2831 * called from commit_transaction. Writes all changed qgroups to disk.
2832 */
2833int btrfs_run_qgroups(struct btrfs_trans_handle *trans)
2834{
2835 struct btrfs_fs_info *fs_info = trans->fs_info;
2836 int ret = 0;
2837
2838 if (!fs_info->quota_root)
2839 return ret;
2840
2841 spin_lock(&fs_info->qgroup_lock);
2842 while (!list_empty(&fs_info->dirty_qgroups)) {
2843 struct btrfs_qgroup *qgroup;
2844 qgroup = list_first_entry(&fs_info->dirty_qgroups,
2845 struct btrfs_qgroup, dirty);
2846 list_del_init(&qgroup->dirty);
2847 spin_unlock(&fs_info->qgroup_lock);
2848 ret = update_qgroup_info_item(trans, qgroup);
2849 if (ret)
2850 qgroup_mark_inconsistent(fs_info);
2851 ret = update_qgroup_limit_item(trans, qgroup);
2852 if (ret)
2853 qgroup_mark_inconsistent(fs_info);
2854 spin_lock(&fs_info->qgroup_lock);
2855 }
2856 if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2857 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
2858 else
2859 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
2860 spin_unlock(&fs_info->qgroup_lock);
2861
2862 ret = update_qgroup_status_item(trans);
2863 if (ret)
2864 qgroup_mark_inconsistent(fs_info);
2865
2866 return ret;
2867}
2868
2869/*
2870 * Copy the accounting information between qgroups. This is necessary
2871 * when a snapshot or a subvolume is created. Throwing an error will
2872 * cause a transaction abort so we take extra care here to only error
2873 * when a readonly fs is a reasonable outcome.
2874 */
2875int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
2876 u64 objectid, struct btrfs_qgroup_inherit *inherit)
2877{
2878 int ret = 0;
2879 int i;
2880 u64 *i_qgroups;
2881 bool committing = false;
2882 struct btrfs_fs_info *fs_info = trans->fs_info;
2883 struct btrfs_root *quota_root;
2884 struct btrfs_qgroup *srcgroup;
2885 struct btrfs_qgroup *dstgroup;
2886 bool need_rescan = false;
2887 u32 level_size = 0;
2888 u64 nums;
2889
2890 /*
2891 * There are only two callers of this function.
2892 *
2893 * One in create_subvol() in the ioctl context, which needs to hold
2894 * the qgroup_ioctl_lock.
2895 *
2896 * The other one in create_pending_snapshot() where no other qgroup
2897 * code can modify the fs as they all need to either start a new trans
2898 * or hold a trans handler, thus we don't need to hold
2899 * qgroup_ioctl_lock.
2900 * This would avoid long and complex lock chain and make lockdep happy.
2901 */
2902 spin_lock(&fs_info->trans_lock);
2903 if (trans->transaction->state == TRANS_STATE_COMMIT_DOING)
2904 committing = true;
2905 spin_unlock(&fs_info->trans_lock);
2906
2907 if (!committing)
2908 mutex_lock(&fs_info->qgroup_ioctl_lock);
2909 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2910 goto out;
2911
2912 quota_root = fs_info->quota_root;
2913 if (!quota_root) {
2914 ret = -EINVAL;
2915 goto out;
2916 }
2917
2918 if (inherit) {
2919 i_qgroups = (u64 *)(inherit + 1);
2920 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
2921 2 * inherit->num_excl_copies;
2922 for (i = 0; i < nums; ++i) {
2923 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
2924
2925 /*
2926 * Zero out invalid groups so we can ignore
2927 * them later.
2928 */
2929 if (!srcgroup ||
2930 ((srcgroup->qgroupid >> 48) <= (objectid >> 48)))
2931 *i_qgroups = 0ULL;
2932
2933 ++i_qgroups;
2934 }
2935 }
2936
2937 /*
2938 * create a tracking group for the subvol itself
2939 */
2940 ret = add_qgroup_item(trans, quota_root, objectid);
2941 if (ret)
2942 goto out;
2943
2944 /*
2945 * add qgroup to all inherited groups
2946 */
2947 if (inherit) {
2948 i_qgroups = (u64 *)(inherit + 1);
2949 for (i = 0; i < inherit->num_qgroups; ++i, ++i_qgroups) {
2950 if (*i_qgroups == 0)
2951 continue;
2952 ret = add_qgroup_relation_item(trans, objectid,
2953 *i_qgroups);
2954 if (ret && ret != -EEXIST)
2955 goto out;
2956 ret = add_qgroup_relation_item(trans, *i_qgroups,
2957 objectid);
2958 if (ret && ret != -EEXIST)
2959 goto out;
2960 }
2961 ret = 0;
2962 }
2963
2964
2965 spin_lock(&fs_info->qgroup_lock);
2966
2967 dstgroup = add_qgroup_rb(fs_info, objectid);
2968 if (IS_ERR(dstgroup)) {
2969 ret = PTR_ERR(dstgroup);
2970 goto unlock;
2971 }
2972
2973 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
2974 dstgroup->lim_flags = inherit->lim.flags;
2975 dstgroup->max_rfer = inherit->lim.max_rfer;
2976 dstgroup->max_excl = inherit->lim.max_excl;
2977 dstgroup->rsv_rfer = inherit->lim.rsv_rfer;
2978 dstgroup->rsv_excl = inherit->lim.rsv_excl;
2979
2980 qgroup_dirty(fs_info, dstgroup);
2981 }
2982
2983 if (srcid) {
2984 srcgroup = find_qgroup_rb(fs_info, srcid);
2985 if (!srcgroup)
2986 goto unlock;
2987
2988 /*
2989 * We call inherit after we clone the root in order to make sure
2990 * our counts don't go crazy, so at this point the only
2991 * difference between the two roots should be the root node.
2992 */
2993 level_size = fs_info->nodesize;
2994 dstgroup->rfer = srcgroup->rfer;
2995 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
2996 dstgroup->excl = level_size;
2997 dstgroup->excl_cmpr = level_size;
2998 srcgroup->excl = level_size;
2999 srcgroup->excl_cmpr = level_size;
3000
3001 /* inherit the limit info */
3002 dstgroup->lim_flags = srcgroup->lim_flags;
3003 dstgroup->max_rfer = srcgroup->max_rfer;
3004 dstgroup->max_excl = srcgroup->max_excl;
3005 dstgroup->rsv_rfer = srcgroup->rsv_rfer;
3006 dstgroup->rsv_excl = srcgroup->rsv_excl;
3007
3008 qgroup_dirty(fs_info, dstgroup);
3009 qgroup_dirty(fs_info, srcgroup);
3010 }
3011
3012 if (!inherit)
3013 goto unlock;
3014
3015 i_qgroups = (u64 *)(inherit + 1);
3016 for (i = 0; i < inherit->num_qgroups; ++i) {
3017 if (*i_qgroups) {
3018 ret = add_relation_rb(fs_info, objectid, *i_qgroups);
3019 if (ret)
3020 goto unlock;
3021 }
3022 ++i_qgroups;
3023
3024 /*
3025 * If we're doing a snapshot, and adding the snapshot to a new
3026 * qgroup, the numbers are guaranteed to be incorrect.
3027 */
3028 if (srcid)
3029 need_rescan = true;
3030 }
3031
3032 for (i = 0; i < inherit->num_ref_copies; ++i, i_qgroups += 2) {
3033 struct btrfs_qgroup *src;
3034 struct btrfs_qgroup *dst;
3035
3036 if (!i_qgroups[0] || !i_qgroups[1])
3037 continue;
3038
3039 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3040 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3041
3042 if (!src || !dst) {
3043 ret = -EINVAL;
3044 goto unlock;
3045 }
3046
3047 dst->rfer = src->rfer - level_size;
3048 dst->rfer_cmpr = src->rfer_cmpr - level_size;
3049
3050 /* Manually tweaking numbers certainly needs a rescan */
3051 need_rescan = true;
3052 }
3053 for (i = 0; i < inherit->num_excl_copies; ++i, i_qgroups += 2) {
3054 struct btrfs_qgroup *src;
3055 struct btrfs_qgroup *dst;
3056
3057 if (!i_qgroups[0] || !i_qgroups[1])
3058 continue;
3059
3060 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3061 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3062
3063 if (!src || !dst) {
3064 ret = -EINVAL;
3065 goto unlock;
3066 }
3067
3068 dst->excl = src->excl + level_size;
3069 dst->excl_cmpr = src->excl_cmpr + level_size;
3070 need_rescan = true;
3071 }
3072
3073unlock:
3074 spin_unlock(&fs_info->qgroup_lock);
3075 if (!ret)
3076 ret = btrfs_sysfs_add_one_qgroup(fs_info, dstgroup);
3077out:
3078 if (!committing)
3079 mutex_unlock(&fs_info->qgroup_ioctl_lock);
3080 if (need_rescan)
3081 qgroup_mark_inconsistent(fs_info);
3082 return ret;
3083}
3084
3085static bool qgroup_check_limits(const struct btrfs_qgroup *qg, u64 num_bytes)
3086{
3087 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
3088 qgroup_rsv_total(qg) + (s64)qg->rfer + num_bytes > qg->max_rfer)
3089 return false;
3090
3091 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
3092 qgroup_rsv_total(qg) + (s64)qg->excl + num_bytes > qg->max_excl)
3093 return false;
3094
3095 return true;
3096}
3097
3098static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce,
3099 enum btrfs_qgroup_rsv_type type)
3100{
3101 struct btrfs_qgroup *qgroup;
3102 struct btrfs_fs_info *fs_info = root->fs_info;
3103 u64 ref_root = root->root_key.objectid;
3104 int ret = 0;
3105 struct ulist_node *unode;
3106 struct ulist_iterator uiter;
3107
3108 if (!is_fstree(ref_root))
3109 return 0;
3110
3111 if (num_bytes == 0)
3112 return 0;
3113
3114 if (test_bit(BTRFS_FS_QUOTA_OVERRIDE, &fs_info->flags) &&
3115 capable(CAP_SYS_RESOURCE))
3116 enforce = false;
3117
3118 spin_lock(&fs_info->qgroup_lock);
3119 if (!fs_info->quota_root)
3120 goto out;
3121
3122 qgroup = find_qgroup_rb(fs_info, ref_root);
3123 if (!qgroup)
3124 goto out;
3125
3126 /*
3127 * in a first step, we check all affected qgroups if any limits would
3128 * be exceeded
3129 */
3130 ulist_reinit(fs_info->qgroup_ulist);
3131 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3132 qgroup_to_aux(qgroup), GFP_ATOMIC);
3133 if (ret < 0)
3134 goto out;
3135 ULIST_ITER_INIT(&uiter);
3136 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3137 struct btrfs_qgroup *qg;
3138 struct btrfs_qgroup_list *glist;
3139
3140 qg = unode_aux_to_qgroup(unode);
3141
3142 if (enforce && !qgroup_check_limits(qg, num_bytes)) {
3143 ret = -EDQUOT;
3144 goto out;
3145 }
3146
3147 list_for_each_entry(glist, &qg->groups, next_group) {
3148 ret = ulist_add(fs_info->qgroup_ulist,
3149 glist->group->qgroupid,
3150 qgroup_to_aux(glist->group), GFP_ATOMIC);
3151 if (ret < 0)
3152 goto out;
3153 }
3154 }
3155 ret = 0;
3156 /*
3157 * no limits exceeded, now record the reservation into all qgroups
3158 */
3159 ULIST_ITER_INIT(&uiter);
3160 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3161 struct btrfs_qgroup *qg;
3162
3163 qg = unode_aux_to_qgroup(unode);
3164
3165 qgroup_rsv_add(fs_info, qg, num_bytes, type);
3166 }
3167
3168out:
3169 spin_unlock(&fs_info->qgroup_lock);
3170 return ret;
3171}
3172
3173/*
3174 * Free @num_bytes of reserved space with @type for qgroup. (Normally level 0
3175 * qgroup).
3176 *
3177 * Will handle all higher level qgroup too.
3178 *
3179 * NOTE: If @num_bytes is (u64)-1, this means to free all bytes of this qgroup.
3180 * This special case is only used for META_PERTRANS type.
3181 */
3182void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
3183 u64 ref_root, u64 num_bytes,
3184 enum btrfs_qgroup_rsv_type type)
3185{
3186 struct btrfs_qgroup *qgroup;
3187 struct ulist_node *unode;
3188 struct ulist_iterator uiter;
3189 int ret = 0;
3190
3191 if (!is_fstree(ref_root))
3192 return;
3193
3194 if (num_bytes == 0)
3195 return;
3196
3197 if (num_bytes == (u64)-1 && type != BTRFS_QGROUP_RSV_META_PERTRANS) {
3198 WARN(1, "%s: Invalid type to free", __func__);
3199 return;
3200 }
3201 spin_lock(&fs_info->qgroup_lock);
3202
3203 if (!fs_info->quota_root)
3204 goto out;
3205
3206 qgroup = find_qgroup_rb(fs_info, ref_root);
3207 if (!qgroup)
3208 goto out;
3209
3210 if (num_bytes == (u64)-1)
3211 /*
3212 * We're freeing all pertrans rsv, get reserved value from
3213 * level 0 qgroup as real num_bytes to free.
3214 */
3215 num_bytes = qgroup->rsv.values[type];
3216
3217 ulist_reinit(fs_info->qgroup_ulist);
3218 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3219 qgroup_to_aux(qgroup), GFP_ATOMIC);
3220 if (ret < 0)
3221 goto out;
3222 ULIST_ITER_INIT(&uiter);
3223 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3224 struct btrfs_qgroup *qg;
3225 struct btrfs_qgroup_list *glist;
3226
3227 qg = unode_aux_to_qgroup(unode);
3228
3229 qgroup_rsv_release(fs_info, qg, num_bytes, type);
3230
3231 list_for_each_entry(glist, &qg->groups, next_group) {
3232 ret = ulist_add(fs_info->qgroup_ulist,
3233 glist->group->qgroupid,
3234 qgroup_to_aux(glist->group), GFP_ATOMIC);
3235 if (ret < 0)
3236 goto out;
3237 }
3238 }
3239
3240out:
3241 spin_unlock(&fs_info->qgroup_lock);
3242}
3243
3244/*
3245 * Check if the leaf is the last leaf. Which means all node pointers
3246 * are at their last position.
3247 */
3248static bool is_last_leaf(struct btrfs_path *path)
3249{
3250 int i;
3251
3252 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3253 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3254 return false;
3255 }
3256 return true;
3257}
3258
3259/*
3260 * returns < 0 on error, 0 when more leafs are to be scanned.
3261 * returns 1 when done.
3262 */
3263static int qgroup_rescan_leaf(struct btrfs_trans_handle *trans,
3264 struct btrfs_path *path)
3265{
3266 struct btrfs_fs_info *fs_info = trans->fs_info;
3267 struct btrfs_root *extent_root;
3268 struct btrfs_key found;
3269 struct extent_buffer *scratch_leaf = NULL;
3270 u64 num_bytes;
3271 bool done;
3272 int slot;
3273 int ret;
3274
3275 mutex_lock(&fs_info->qgroup_rescan_lock);
3276 extent_root = btrfs_extent_root(fs_info,
3277 fs_info->qgroup_rescan_progress.objectid);
3278 ret = btrfs_search_slot_for_read(extent_root,
3279 &fs_info->qgroup_rescan_progress,
3280 path, 1, 0);
3281
3282 btrfs_debug(fs_info,
3283 "current progress key (%llu %u %llu), search_slot ret %d",
3284 fs_info->qgroup_rescan_progress.objectid,
3285 fs_info->qgroup_rescan_progress.type,
3286 fs_info->qgroup_rescan_progress.offset, ret);
3287
3288 if (ret) {
3289 /*
3290 * The rescan is about to end, we will not be scanning any
3291 * further blocks. We cannot unset the RESCAN flag here, because
3292 * we want to commit the transaction if everything went well.
3293 * To make the live accounting work in this phase, we set our
3294 * scan progress pointer such that every real extent objectid
3295 * will be smaller.
3296 */
3297 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3298 btrfs_release_path(path);
3299 mutex_unlock(&fs_info->qgroup_rescan_lock);
3300 return ret;
3301 }
3302 done = is_last_leaf(path);
3303
3304 btrfs_item_key_to_cpu(path->nodes[0], &found,
3305 btrfs_header_nritems(path->nodes[0]) - 1);
3306 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
3307
3308 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);
3309 if (!scratch_leaf) {
3310 ret = -ENOMEM;
3311 mutex_unlock(&fs_info->qgroup_rescan_lock);
3312 goto out;
3313 }
3314 slot = path->slots[0];
3315 btrfs_release_path(path);
3316 mutex_unlock(&fs_info->qgroup_rescan_lock);
3317
3318 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
3319 struct btrfs_backref_walk_ctx ctx = { 0 };
3320
3321 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
3322 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
3323 found.type != BTRFS_METADATA_ITEM_KEY)
3324 continue;
3325 if (found.type == BTRFS_METADATA_ITEM_KEY)
3326 num_bytes = fs_info->nodesize;
3327 else
3328 num_bytes = found.offset;
3329
3330 ctx.bytenr = found.objectid;
3331 ctx.fs_info = fs_info;
3332
3333 ret = btrfs_find_all_roots(&ctx, false);
3334 if (ret < 0)
3335 goto out;
3336 /* For rescan, just pass old_roots as NULL */
3337 ret = btrfs_qgroup_account_extent(trans, found.objectid,
3338 num_bytes, NULL, ctx.roots);
3339 if (ret < 0)
3340 goto out;
3341 }
3342out:
3343 if (scratch_leaf)
3344 free_extent_buffer(scratch_leaf);
3345
3346 if (done && !ret) {
3347 ret = 1;
3348 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3349 }
3350 return ret;
3351}
3352
3353static bool rescan_should_stop(struct btrfs_fs_info *fs_info)
3354{
3355 return btrfs_fs_closing(fs_info) ||
3356 test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state) ||
3357 !test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3358 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN;
3359}
3360
3361static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
3362{
3363 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
3364 qgroup_rescan_work);
3365 struct btrfs_path *path;
3366 struct btrfs_trans_handle *trans = NULL;
3367 int err = -ENOMEM;
3368 int ret = 0;
3369 bool stopped = false;
3370 bool did_leaf_rescans = false;
3371
3372 path = btrfs_alloc_path();
3373 if (!path)
3374 goto out;
3375 /*
3376 * Rescan should only search for commit root, and any later difference
3377 * should be recorded by qgroup
3378 */
3379 path->search_commit_root = 1;
3380 path->skip_locking = 1;
3381
3382 err = 0;
3383 while (!err && !(stopped = rescan_should_stop(fs_info))) {
3384 trans = btrfs_start_transaction(fs_info->fs_root, 0);
3385 if (IS_ERR(trans)) {
3386 err = PTR_ERR(trans);
3387 break;
3388 }
3389
3390 err = qgroup_rescan_leaf(trans, path);
3391 did_leaf_rescans = true;
3392
3393 if (err > 0)
3394 btrfs_commit_transaction(trans);
3395 else
3396 btrfs_end_transaction(trans);
3397 }
3398
3399out:
3400 btrfs_free_path(path);
3401
3402 mutex_lock(&fs_info->qgroup_rescan_lock);
3403 if (err > 0 &&
3404 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
3405 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3406 } else if (err < 0 || stopped) {
3407 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3408 }
3409 mutex_unlock(&fs_info->qgroup_rescan_lock);
3410
3411 /*
3412 * Only update status, since the previous part has already updated the
3413 * qgroup info, and only if we did any actual work. This also prevents
3414 * race with a concurrent quota disable, which has already set
3415 * fs_info->quota_root to NULL and cleared BTRFS_FS_QUOTA_ENABLED at
3416 * btrfs_quota_disable().
3417 */
3418 if (did_leaf_rescans) {
3419 trans = btrfs_start_transaction(fs_info->quota_root, 1);
3420 if (IS_ERR(trans)) {
3421 err = PTR_ERR(trans);
3422 trans = NULL;
3423 btrfs_err(fs_info,
3424 "fail to start transaction for status update: %d",
3425 err);
3426 }
3427 } else {
3428 trans = NULL;
3429 }
3430
3431 mutex_lock(&fs_info->qgroup_rescan_lock);
3432 if (!stopped ||
3433 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN)
3434 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3435 if (trans) {
3436 ret = update_qgroup_status_item(trans);
3437 if (ret < 0) {
3438 err = ret;
3439 btrfs_err(fs_info, "fail to update qgroup status: %d",
3440 err);
3441 }
3442 }
3443 fs_info->qgroup_rescan_running = false;
3444 fs_info->qgroup_flags &= ~BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN;
3445 complete_all(&fs_info->qgroup_rescan_completion);
3446 mutex_unlock(&fs_info->qgroup_rescan_lock);
3447
3448 if (!trans)
3449 return;
3450
3451 btrfs_end_transaction(trans);
3452
3453 if (stopped) {
3454 btrfs_info(fs_info, "qgroup scan paused");
3455 } else if (fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN) {
3456 btrfs_info(fs_info, "qgroup scan cancelled");
3457 } else if (err >= 0) {
3458 btrfs_info(fs_info, "qgroup scan completed%s",
3459 err > 0 ? " (inconsistency flag cleared)" : "");
3460 } else {
3461 btrfs_err(fs_info, "qgroup scan failed with %d", err);
3462 }
3463}
3464
3465/*
3466 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
3467 * memory required for the rescan context.
3468 */
3469static int
3470qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
3471 int init_flags)
3472{
3473 int ret = 0;
3474
3475 if (!init_flags) {
3476 /* we're resuming qgroup rescan at mount time */
3477 if (!(fs_info->qgroup_flags &
3478 BTRFS_QGROUP_STATUS_FLAG_RESCAN)) {
3479 btrfs_warn(fs_info,
3480 "qgroup rescan init failed, qgroup rescan is not queued");
3481 ret = -EINVAL;
3482 } else if (!(fs_info->qgroup_flags &
3483 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3484 btrfs_warn(fs_info,
3485 "qgroup rescan init failed, qgroup is not enabled");
3486 ret = -EINVAL;
3487 }
3488
3489 if (ret)
3490 return ret;
3491 }
3492
3493 mutex_lock(&fs_info->qgroup_rescan_lock);
3494
3495 if (init_flags) {
3496 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3497 btrfs_warn(fs_info,
3498 "qgroup rescan is already in progress");
3499 ret = -EINPROGRESS;
3500 } else if (!(fs_info->qgroup_flags &
3501 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3502 btrfs_warn(fs_info,
3503 "qgroup rescan init failed, qgroup is not enabled");
3504 ret = -EINVAL;
3505 } else if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) {
3506 /* Quota disable is in progress */
3507 ret = -EBUSY;
3508 }
3509
3510 if (ret) {
3511 mutex_unlock(&fs_info->qgroup_rescan_lock);
3512 return ret;
3513 }
3514 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3515 }
3516
3517 memset(&fs_info->qgroup_rescan_progress, 0,
3518 sizeof(fs_info->qgroup_rescan_progress));
3519 fs_info->qgroup_flags &= ~(BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
3520 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
3521 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
3522 init_completion(&fs_info->qgroup_rescan_completion);
3523 mutex_unlock(&fs_info->qgroup_rescan_lock);
3524
3525 btrfs_init_work(&fs_info->qgroup_rescan_work,
3526 btrfs_qgroup_rescan_worker, NULL, NULL);
3527 return 0;
3528}
3529
3530static void
3531qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
3532{
3533 struct rb_node *n;
3534 struct btrfs_qgroup *qgroup;
3535
3536 spin_lock(&fs_info->qgroup_lock);
3537 /* clear all current qgroup tracking information */
3538 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
3539 qgroup = rb_entry(n, struct btrfs_qgroup, node);
3540 qgroup->rfer = 0;
3541 qgroup->rfer_cmpr = 0;
3542 qgroup->excl = 0;
3543 qgroup->excl_cmpr = 0;
3544 qgroup_dirty(fs_info, qgroup);
3545 }
3546 spin_unlock(&fs_info->qgroup_lock);
3547}
3548
3549int
3550btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
3551{
3552 int ret = 0;
3553 struct btrfs_trans_handle *trans;
3554
3555 ret = qgroup_rescan_init(fs_info, 0, 1);
3556 if (ret)
3557 return ret;
3558
3559 /*
3560 * We have set the rescan_progress to 0, which means no more
3561 * delayed refs will be accounted by btrfs_qgroup_account_ref.
3562 * However, btrfs_qgroup_account_ref may be right after its call
3563 * to btrfs_find_all_roots, in which case it would still do the
3564 * accounting.
3565 * To solve this, we're committing the transaction, which will
3566 * ensure we run all delayed refs and only after that, we are
3567 * going to clear all tracking information for a clean start.
3568 */
3569
3570 trans = btrfs_join_transaction(fs_info->fs_root);
3571 if (IS_ERR(trans)) {
3572 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3573 return PTR_ERR(trans);
3574 }
3575 ret = btrfs_commit_transaction(trans);
3576 if (ret) {
3577 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3578 return ret;
3579 }
3580
3581 qgroup_rescan_zero_tracking(fs_info);
3582
3583 mutex_lock(&fs_info->qgroup_rescan_lock);
3584 fs_info->qgroup_rescan_running = true;
3585 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3586 &fs_info->qgroup_rescan_work);
3587 mutex_unlock(&fs_info->qgroup_rescan_lock);
3588
3589 return 0;
3590}
3591
3592int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
3593 bool interruptible)
3594{
3595 int running;
3596 int ret = 0;
3597
3598 mutex_lock(&fs_info->qgroup_rescan_lock);
3599 running = fs_info->qgroup_rescan_running;
3600 mutex_unlock(&fs_info->qgroup_rescan_lock);
3601
3602 if (!running)
3603 return 0;
3604
3605 if (interruptible)
3606 ret = wait_for_completion_interruptible(
3607 &fs_info->qgroup_rescan_completion);
3608 else
3609 wait_for_completion(&fs_info->qgroup_rescan_completion);
3610
3611 return ret;
3612}
3613
3614/*
3615 * this is only called from open_ctree where we're still single threaded, thus
3616 * locking is omitted here.
3617 */
3618void
3619btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
3620{
3621 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3622 mutex_lock(&fs_info->qgroup_rescan_lock);
3623 fs_info->qgroup_rescan_running = true;
3624 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3625 &fs_info->qgroup_rescan_work);
3626 mutex_unlock(&fs_info->qgroup_rescan_lock);
3627 }
3628}
3629
3630#define rbtree_iterate_from_safe(node, next, start) \
3631 for (node = start; node && ({ next = rb_next(node); 1;}); node = next)
3632
3633static int qgroup_unreserve_range(struct btrfs_inode *inode,
3634 struct extent_changeset *reserved, u64 start,
3635 u64 len)
3636{
3637 struct rb_node *node;
3638 struct rb_node *next;
3639 struct ulist_node *entry;
3640 int ret = 0;
3641
3642 node = reserved->range_changed.root.rb_node;
3643 if (!node)
3644 return 0;
3645 while (node) {
3646 entry = rb_entry(node, struct ulist_node, rb_node);
3647 if (entry->val < start)
3648 node = node->rb_right;
3649 else
3650 node = node->rb_left;
3651 }
3652
3653 if (entry->val > start && rb_prev(&entry->rb_node))
3654 entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,
3655 rb_node);
3656
3657 rbtree_iterate_from_safe(node, next, &entry->rb_node) {
3658 u64 entry_start;
3659 u64 entry_end;
3660 u64 entry_len;
3661 int clear_ret;
3662
3663 entry = rb_entry(node, struct ulist_node, rb_node);
3664 entry_start = entry->val;
3665 entry_end = entry->aux;
3666 entry_len = entry_end - entry_start + 1;
3667
3668 if (entry_start >= start + len)
3669 break;
3670 if (entry_start + entry_len <= start)
3671 continue;
3672 /*
3673 * Now the entry is in [start, start + len), revert the
3674 * EXTENT_QGROUP_RESERVED bit.
3675 */
3676 clear_ret = clear_extent_bits(&inode->io_tree, entry_start,
3677 entry_end, EXTENT_QGROUP_RESERVED);
3678 if (!ret && clear_ret < 0)
3679 ret = clear_ret;
3680
3681 ulist_del(&reserved->range_changed, entry->val, entry->aux);
3682 if (likely(reserved->bytes_changed >= entry_len)) {
3683 reserved->bytes_changed -= entry_len;
3684 } else {
3685 WARN_ON(1);
3686 reserved->bytes_changed = 0;
3687 }
3688 }
3689
3690 return ret;
3691}
3692
3693/*
3694 * Try to free some space for qgroup.
3695 *
3696 * For qgroup, there are only 3 ways to free qgroup space:
3697 * - Flush nodatacow write
3698 * Any nodatacow write will free its reserved data space at run_delalloc_range().
3699 * In theory, we should only flush nodatacow inodes, but it's not yet
3700 * possible, so we need to flush the whole root.
3701 *
3702 * - Wait for ordered extents
3703 * When ordered extents are finished, their reserved metadata is finally
3704 * converted to per_trans status, which can be freed by later commit
3705 * transaction.
3706 *
3707 * - Commit transaction
3708 * This would free the meta_per_trans space.
3709 * In theory this shouldn't provide much space, but any more qgroup space
3710 * is needed.
3711 */
3712static int try_flush_qgroup(struct btrfs_root *root)
3713{
3714 struct btrfs_trans_handle *trans;
3715 int ret;
3716
3717 /* Can't hold an open transaction or we run the risk of deadlocking. */
3718 ASSERT(current->journal_info == NULL);
3719 if (WARN_ON(current->journal_info))
3720 return 0;
3721
3722 /*
3723 * We don't want to run flush again and again, so if there is a running
3724 * one, we won't try to start a new flush, but exit directly.
3725 */
3726 if (test_and_set_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state)) {
3727 wait_event(root->qgroup_flush_wait,
3728 !test_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state));
3729 return 0;
3730 }
3731
3732 ret = btrfs_start_delalloc_snapshot(root, true);
3733 if (ret < 0)
3734 goto out;
3735 btrfs_wait_ordered_extents(root, U64_MAX, 0, (u64)-1);
3736
3737 trans = btrfs_join_transaction(root);
3738 if (IS_ERR(trans)) {
3739 ret = PTR_ERR(trans);
3740 goto out;
3741 }
3742
3743 ret = btrfs_commit_transaction(trans);
3744out:
3745 clear_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state);
3746 wake_up(&root->qgroup_flush_wait);
3747 return ret;
3748}
3749
3750static int qgroup_reserve_data(struct btrfs_inode *inode,
3751 struct extent_changeset **reserved_ret, u64 start,
3752 u64 len)
3753{
3754 struct btrfs_root *root = inode->root;
3755 struct extent_changeset *reserved;
3756 bool new_reserved = false;
3757 u64 orig_reserved;
3758 u64 to_reserve;
3759 int ret;
3760
3761 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &root->fs_info->flags) ||
3762 !is_fstree(root->root_key.objectid) || len == 0)
3763 return 0;
3764
3765 /* @reserved parameter is mandatory for qgroup */
3766 if (WARN_ON(!reserved_ret))
3767 return -EINVAL;
3768 if (!*reserved_ret) {
3769 new_reserved = true;
3770 *reserved_ret = extent_changeset_alloc();
3771 if (!*reserved_ret)
3772 return -ENOMEM;
3773 }
3774 reserved = *reserved_ret;
3775 /* Record already reserved space */
3776 orig_reserved = reserved->bytes_changed;
3777 ret = set_record_extent_bits(&inode->io_tree, start,
3778 start + len -1, EXTENT_QGROUP_RESERVED, reserved);
3779
3780 /* Newly reserved space */
3781 to_reserve = reserved->bytes_changed - orig_reserved;
3782 trace_btrfs_qgroup_reserve_data(&inode->vfs_inode, start, len,
3783 to_reserve, QGROUP_RESERVE);
3784 if (ret < 0)
3785 goto out;
3786 ret = qgroup_reserve(root, to_reserve, true, BTRFS_QGROUP_RSV_DATA);
3787 if (ret < 0)
3788 goto cleanup;
3789
3790 return ret;
3791
3792cleanup:
3793 qgroup_unreserve_range(inode, reserved, start, len);
3794out:
3795 if (new_reserved) {
3796 extent_changeset_free(reserved);
3797 *reserved_ret = NULL;
3798 }
3799 return ret;
3800}
3801
3802/*
3803 * Reserve qgroup space for range [start, start + len).
3804 *
3805 * This function will either reserve space from related qgroups or do nothing
3806 * if the range is already reserved.
3807 *
3808 * Return 0 for successful reservation
3809 * Return <0 for error (including -EQUOT)
3810 *
3811 * NOTE: This function may sleep for memory allocation, dirty page flushing and
3812 * commit transaction. So caller should not hold any dirty page locked.
3813 */
3814int btrfs_qgroup_reserve_data(struct btrfs_inode *inode,
3815 struct extent_changeset **reserved_ret, u64 start,
3816 u64 len)
3817{
3818 int ret;
3819
3820 ret = qgroup_reserve_data(inode, reserved_ret, start, len);
3821 if (ret <= 0 && ret != -EDQUOT)
3822 return ret;
3823
3824 ret = try_flush_qgroup(inode->root);
3825 if (ret < 0)
3826 return ret;
3827 return qgroup_reserve_data(inode, reserved_ret, start, len);
3828}
3829
3830/* Free ranges specified by @reserved, normally in error path */
3831static int qgroup_free_reserved_data(struct btrfs_inode *inode,
3832 struct extent_changeset *reserved, u64 start, u64 len)
3833{
3834 struct btrfs_root *root = inode->root;
3835 struct ulist_node *unode;
3836 struct ulist_iterator uiter;
3837 struct extent_changeset changeset;
3838 int freed = 0;
3839 int ret;
3840
3841 extent_changeset_init(&changeset);
3842 len = round_up(start + len, root->fs_info->sectorsize);
3843 start = round_down(start, root->fs_info->sectorsize);
3844
3845 ULIST_ITER_INIT(&uiter);
3846 while ((unode = ulist_next(&reserved->range_changed, &uiter))) {
3847 u64 range_start = unode->val;
3848 /* unode->aux is the inclusive end */
3849 u64 range_len = unode->aux - range_start + 1;
3850 u64 free_start;
3851 u64 free_len;
3852
3853 extent_changeset_release(&changeset);
3854
3855 /* Only free range in range [start, start + len) */
3856 if (range_start >= start + len ||
3857 range_start + range_len <= start)
3858 continue;
3859 free_start = max(range_start, start);
3860 free_len = min(start + len, range_start + range_len) -
3861 free_start;
3862 /*
3863 * TODO: To also modify reserved->ranges_reserved to reflect
3864 * the modification.
3865 *
3866 * However as long as we free qgroup reserved according to
3867 * EXTENT_QGROUP_RESERVED, we won't double free.
3868 * So not need to rush.
3869 */
3870 ret = clear_record_extent_bits(&inode->io_tree, free_start,
3871 free_start + free_len - 1,
3872 EXTENT_QGROUP_RESERVED, &changeset);
3873 if (ret < 0)
3874 goto out;
3875 freed += changeset.bytes_changed;
3876 }
3877 btrfs_qgroup_free_refroot(root->fs_info, root->root_key.objectid, freed,
3878 BTRFS_QGROUP_RSV_DATA);
3879 ret = freed;
3880out:
3881 extent_changeset_release(&changeset);
3882 return ret;
3883}
3884
3885static int __btrfs_qgroup_release_data(struct btrfs_inode *inode,
3886 struct extent_changeset *reserved, u64 start, u64 len,
3887 int free)
3888{
3889 struct extent_changeset changeset;
3890 int trace_op = QGROUP_RELEASE;
3891 int ret;
3892
3893 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &inode->root->fs_info->flags))
3894 return 0;
3895
3896 /* In release case, we shouldn't have @reserved */
3897 WARN_ON(!free && reserved);
3898 if (free && reserved)
3899 return qgroup_free_reserved_data(inode, reserved, start, len);
3900 extent_changeset_init(&changeset);
3901 ret = clear_record_extent_bits(&inode->io_tree, start, start + len -1,
3902 EXTENT_QGROUP_RESERVED, &changeset);
3903 if (ret < 0)
3904 goto out;
3905
3906 if (free)
3907 trace_op = QGROUP_FREE;
3908 trace_btrfs_qgroup_release_data(&inode->vfs_inode, start, len,
3909 changeset.bytes_changed, trace_op);
3910 if (free)
3911 btrfs_qgroup_free_refroot(inode->root->fs_info,
3912 inode->root->root_key.objectid,
3913 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
3914 ret = changeset.bytes_changed;
3915out:
3916 extent_changeset_release(&changeset);
3917 return ret;
3918}
3919
3920/*
3921 * Free a reserved space range from io_tree and related qgroups
3922 *
3923 * Should be called when a range of pages get invalidated before reaching disk.
3924 * Or for error cleanup case.
3925 * if @reserved is given, only reserved range in [@start, @start + @len) will
3926 * be freed.
3927 *
3928 * For data written to disk, use btrfs_qgroup_release_data().
3929 *
3930 * NOTE: This function may sleep for memory allocation.
3931 */
3932int btrfs_qgroup_free_data(struct btrfs_inode *inode,
3933 struct extent_changeset *reserved, u64 start, u64 len)
3934{
3935 return __btrfs_qgroup_release_data(inode, reserved, start, len, 1);
3936}
3937
3938/*
3939 * Release a reserved space range from io_tree only.
3940 *
3941 * Should be called when a range of pages get written to disk and corresponding
3942 * FILE_EXTENT is inserted into corresponding root.
3943 *
3944 * Since new qgroup accounting framework will only update qgroup numbers at
3945 * commit_transaction() time, its reserved space shouldn't be freed from
3946 * related qgroups.
3947 *
3948 * But we should release the range from io_tree, to allow further write to be
3949 * COWed.
3950 *
3951 * NOTE: This function may sleep for memory allocation.
3952 */
3953int btrfs_qgroup_release_data(struct btrfs_inode *inode, u64 start, u64 len)
3954{
3955 return __btrfs_qgroup_release_data(inode, NULL, start, len, 0);
3956}
3957
3958static void add_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3959 enum btrfs_qgroup_rsv_type type)
3960{
3961 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3962 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3963 return;
3964 if (num_bytes == 0)
3965 return;
3966
3967 spin_lock(&root->qgroup_meta_rsv_lock);
3968 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
3969 root->qgroup_meta_rsv_prealloc += num_bytes;
3970 else
3971 root->qgroup_meta_rsv_pertrans += num_bytes;
3972 spin_unlock(&root->qgroup_meta_rsv_lock);
3973}
3974
3975static int sub_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3976 enum btrfs_qgroup_rsv_type type)
3977{
3978 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3979 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3980 return 0;
3981 if (num_bytes == 0)
3982 return 0;
3983
3984 spin_lock(&root->qgroup_meta_rsv_lock);
3985 if (type == BTRFS_QGROUP_RSV_META_PREALLOC) {
3986 num_bytes = min_t(u64, root->qgroup_meta_rsv_prealloc,
3987 num_bytes);
3988 root->qgroup_meta_rsv_prealloc -= num_bytes;
3989 } else {
3990 num_bytes = min_t(u64, root->qgroup_meta_rsv_pertrans,
3991 num_bytes);
3992 root->qgroup_meta_rsv_pertrans -= num_bytes;
3993 }
3994 spin_unlock(&root->qgroup_meta_rsv_lock);
3995 return num_bytes;
3996}
3997
3998int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
3999 enum btrfs_qgroup_rsv_type type, bool enforce)
4000{
4001 struct btrfs_fs_info *fs_info = root->fs_info;
4002 int ret;
4003
4004 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4005 !is_fstree(root->root_key.objectid) || num_bytes == 0)
4006 return 0;
4007
4008 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
4009 trace_qgroup_meta_reserve(root, (s64)num_bytes, type);
4010 ret = qgroup_reserve(root, num_bytes, enforce, type);
4011 if (ret < 0)
4012 return ret;
4013 /*
4014 * Record what we have reserved into root.
4015 *
4016 * To avoid quota disabled->enabled underflow.
4017 * In that case, we may try to free space we haven't reserved
4018 * (since quota was disabled), so record what we reserved into root.
4019 * And ensure later release won't underflow this number.
4020 */
4021 add_root_meta_rsv(root, num_bytes, type);
4022 return ret;
4023}
4024
4025int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
4026 enum btrfs_qgroup_rsv_type type, bool enforce,
4027 bool noflush)
4028{
4029 int ret;
4030
4031 ret = btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
4032 if ((ret <= 0 && ret != -EDQUOT) || noflush)
4033 return ret;
4034
4035 ret = try_flush_qgroup(root);
4036 if (ret < 0)
4037 return ret;
4038 return btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
4039}
4040
4041void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root)
4042{
4043 struct btrfs_fs_info *fs_info = root->fs_info;
4044
4045 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4046 !is_fstree(root->root_key.objectid))
4047 return;
4048
4049 /* TODO: Update trace point to handle such free */
4050 trace_qgroup_meta_free_all_pertrans(root);
4051 /* Special value -1 means to free all reserved space */
4052 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid, (u64)-1,
4053 BTRFS_QGROUP_RSV_META_PERTRANS);
4054}
4055
4056void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
4057 enum btrfs_qgroup_rsv_type type)
4058{
4059 struct btrfs_fs_info *fs_info = root->fs_info;
4060
4061 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4062 !is_fstree(root->root_key.objectid))
4063 return;
4064
4065 /*
4066 * reservation for META_PREALLOC can happen before quota is enabled,
4067 * which can lead to underflow.
4068 * Here ensure we will only free what we really have reserved.
4069 */
4070 num_bytes = sub_root_meta_rsv(root, num_bytes, type);
4071 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
4072 trace_qgroup_meta_reserve(root, -(s64)num_bytes, type);
4073 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid,
4074 num_bytes, type);
4075}
4076
4077static void qgroup_convert_meta(struct btrfs_fs_info *fs_info, u64 ref_root,
4078 int num_bytes)
4079{
4080 struct btrfs_qgroup *qgroup;
4081 struct ulist_node *unode;
4082 struct ulist_iterator uiter;
4083 int ret = 0;
4084
4085 if (num_bytes == 0)
4086 return;
4087 if (!fs_info->quota_root)
4088 return;
4089
4090 spin_lock(&fs_info->qgroup_lock);
4091 qgroup = find_qgroup_rb(fs_info, ref_root);
4092 if (!qgroup)
4093 goto out;
4094 ulist_reinit(fs_info->qgroup_ulist);
4095 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
4096 qgroup_to_aux(qgroup), GFP_ATOMIC);
4097 if (ret < 0)
4098 goto out;
4099 ULIST_ITER_INIT(&uiter);
4100 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
4101 struct btrfs_qgroup *qg;
4102 struct btrfs_qgroup_list *glist;
4103
4104 qg = unode_aux_to_qgroup(unode);
4105
4106 qgroup_rsv_release(fs_info, qg, num_bytes,
4107 BTRFS_QGROUP_RSV_META_PREALLOC);
4108 qgroup_rsv_add(fs_info, qg, num_bytes,
4109 BTRFS_QGROUP_RSV_META_PERTRANS);
4110 list_for_each_entry(glist, &qg->groups, next_group) {
4111 ret = ulist_add(fs_info->qgroup_ulist,
4112 glist->group->qgroupid,
4113 qgroup_to_aux(glist->group), GFP_ATOMIC);
4114 if (ret < 0)
4115 goto out;
4116 }
4117 }
4118out:
4119 spin_unlock(&fs_info->qgroup_lock);
4120}
4121
4122void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes)
4123{
4124 struct btrfs_fs_info *fs_info = root->fs_info;
4125
4126 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4127 !is_fstree(root->root_key.objectid))
4128 return;
4129 /* Same as btrfs_qgroup_free_meta_prealloc() */
4130 num_bytes = sub_root_meta_rsv(root, num_bytes,
4131 BTRFS_QGROUP_RSV_META_PREALLOC);
4132 trace_qgroup_meta_convert(root, num_bytes);
4133 qgroup_convert_meta(fs_info, root->root_key.objectid, num_bytes);
4134}
4135
4136/*
4137 * Check qgroup reserved space leaking, normally at destroy inode
4138 * time
4139 */
4140void btrfs_qgroup_check_reserved_leak(struct btrfs_inode *inode)
4141{
4142 struct extent_changeset changeset;
4143 struct ulist_node *unode;
4144 struct ulist_iterator iter;
4145 int ret;
4146
4147 extent_changeset_init(&changeset);
4148 ret = clear_record_extent_bits(&inode->io_tree, 0, (u64)-1,
4149 EXTENT_QGROUP_RESERVED, &changeset);
4150
4151 WARN_ON(ret < 0);
4152 if (WARN_ON(changeset.bytes_changed)) {
4153 ULIST_ITER_INIT(&iter);
4154 while ((unode = ulist_next(&changeset.range_changed, &iter))) {
4155 btrfs_warn(inode->root->fs_info,
4156 "leaking qgroup reserved space, ino: %llu, start: %llu, end: %llu",
4157 btrfs_ino(inode), unode->val, unode->aux);
4158 }
4159 btrfs_qgroup_free_refroot(inode->root->fs_info,
4160 inode->root->root_key.objectid,
4161 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
4162
4163 }
4164 extent_changeset_release(&changeset);
4165}
4166
4167void btrfs_qgroup_init_swapped_blocks(
4168 struct btrfs_qgroup_swapped_blocks *swapped_blocks)
4169{
4170 int i;
4171
4172 spin_lock_init(&swapped_blocks->lock);
4173 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
4174 swapped_blocks->blocks[i] = RB_ROOT;
4175 swapped_blocks->swapped = false;
4176}
4177
4178/*
4179 * Delete all swapped blocks record of @root.
4180 * Every record here means we skipped a full subtree scan for qgroup.
4181 *
4182 * Gets called when committing one transaction.
4183 */
4184void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root)
4185{
4186 struct btrfs_qgroup_swapped_blocks *swapped_blocks;
4187 int i;
4188
4189 swapped_blocks = &root->swapped_blocks;
4190
4191 spin_lock(&swapped_blocks->lock);
4192 if (!swapped_blocks->swapped)
4193 goto out;
4194 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4195 struct rb_root *cur_root = &swapped_blocks->blocks[i];
4196 struct btrfs_qgroup_swapped_block *entry;
4197 struct btrfs_qgroup_swapped_block *next;
4198
4199 rbtree_postorder_for_each_entry_safe(entry, next, cur_root,
4200 node)
4201 kfree(entry);
4202 swapped_blocks->blocks[i] = RB_ROOT;
4203 }
4204 swapped_blocks->swapped = false;
4205out:
4206 spin_unlock(&swapped_blocks->lock);
4207}
4208
4209/*
4210 * Add subtree roots record into @subvol_root.
4211 *
4212 * @subvol_root: tree root of the subvolume tree get swapped
4213 * @bg: block group under balance
4214 * @subvol_parent/slot: pointer to the subtree root in subvolume tree
4215 * @reloc_parent/slot: pointer to the subtree root in reloc tree
4216 * BOTH POINTERS ARE BEFORE TREE SWAP
4217 * @last_snapshot: last snapshot generation of the subvolume tree
4218 */
4219int btrfs_qgroup_add_swapped_blocks(struct btrfs_trans_handle *trans,
4220 struct btrfs_root *subvol_root,
4221 struct btrfs_block_group *bg,
4222 struct extent_buffer *subvol_parent, int subvol_slot,
4223 struct extent_buffer *reloc_parent, int reloc_slot,
4224 u64 last_snapshot)
4225{
4226 struct btrfs_fs_info *fs_info = subvol_root->fs_info;
4227 struct btrfs_qgroup_swapped_blocks *blocks = &subvol_root->swapped_blocks;
4228 struct btrfs_qgroup_swapped_block *block;
4229 struct rb_node **cur;
4230 struct rb_node *parent = NULL;
4231 int level = btrfs_header_level(subvol_parent) - 1;
4232 int ret = 0;
4233
4234 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
4235 return 0;
4236
4237 if (btrfs_node_ptr_generation(subvol_parent, subvol_slot) >
4238 btrfs_node_ptr_generation(reloc_parent, reloc_slot)) {
4239 btrfs_err_rl(fs_info,
4240 "%s: bad parameter order, subvol_gen=%llu reloc_gen=%llu",
4241 __func__,
4242 btrfs_node_ptr_generation(subvol_parent, subvol_slot),
4243 btrfs_node_ptr_generation(reloc_parent, reloc_slot));
4244 return -EUCLEAN;
4245 }
4246
4247 block = kmalloc(sizeof(*block), GFP_NOFS);
4248 if (!block) {
4249 ret = -ENOMEM;
4250 goto out;
4251 }
4252
4253 /*
4254 * @reloc_parent/slot is still before swap, while @block is going to
4255 * record the bytenr after swap, so we do the swap here.
4256 */
4257 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot);
4258 block->subvol_generation = btrfs_node_ptr_generation(reloc_parent,
4259 reloc_slot);
4260 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot);
4261 block->reloc_generation = btrfs_node_ptr_generation(subvol_parent,
4262 subvol_slot);
4263 block->last_snapshot = last_snapshot;
4264 block->level = level;
4265
4266 /*
4267 * If we have bg == NULL, we're called from btrfs_recover_relocation(),
4268 * no one else can modify tree blocks thus we qgroup will not change
4269 * no matter the value of trace_leaf.
4270 */
4271 if (bg && bg->flags & BTRFS_BLOCK_GROUP_DATA)
4272 block->trace_leaf = true;
4273 else
4274 block->trace_leaf = false;
4275 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot);
4276
4277 /* Insert @block into @blocks */
4278 spin_lock(&blocks->lock);
4279 cur = &blocks->blocks[level].rb_node;
4280 while (*cur) {
4281 struct btrfs_qgroup_swapped_block *entry;
4282
4283 parent = *cur;
4284 entry = rb_entry(parent, struct btrfs_qgroup_swapped_block,
4285 node);
4286
4287 if (entry->subvol_bytenr < block->subvol_bytenr) {
4288 cur = &(*cur)->rb_left;
4289 } else if (entry->subvol_bytenr > block->subvol_bytenr) {
4290 cur = &(*cur)->rb_right;
4291 } else {
4292 if (entry->subvol_generation !=
4293 block->subvol_generation ||
4294 entry->reloc_bytenr != block->reloc_bytenr ||
4295 entry->reloc_generation !=
4296 block->reloc_generation) {
4297 /*
4298 * Duplicated but mismatch entry found.
4299 * Shouldn't happen.
4300 *
4301 * Marking qgroup inconsistent should be enough
4302 * for end users.
4303 */
4304 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
4305 ret = -EEXIST;
4306 }
4307 kfree(block);
4308 goto out_unlock;
4309 }
4310 }
4311 rb_link_node(&block->node, parent, cur);
4312 rb_insert_color(&block->node, &blocks->blocks[level]);
4313 blocks->swapped = true;
4314out_unlock:
4315 spin_unlock(&blocks->lock);
4316out:
4317 if (ret < 0)
4318 qgroup_mark_inconsistent(fs_info);
4319 return ret;
4320}
4321
4322/*
4323 * Check if the tree block is a subtree root, and if so do the needed
4324 * delayed subtree trace for qgroup.
4325 *
4326 * This is called during btrfs_cow_block().
4327 */
4328int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
4329 struct btrfs_root *root,
4330 struct extent_buffer *subvol_eb)
4331{
4332 struct btrfs_fs_info *fs_info = root->fs_info;
4333 struct btrfs_tree_parent_check check = { 0 };
4334 struct btrfs_qgroup_swapped_blocks *blocks = &root->swapped_blocks;
4335 struct btrfs_qgroup_swapped_block *block;
4336 struct extent_buffer *reloc_eb = NULL;
4337 struct rb_node *node;
4338 bool found = false;
4339 bool swapped = false;
4340 int level = btrfs_header_level(subvol_eb);
4341 int ret = 0;
4342 int i;
4343
4344 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
4345 return 0;
4346 if (!is_fstree(root->root_key.objectid) || !root->reloc_root)
4347 return 0;
4348
4349 spin_lock(&blocks->lock);
4350 if (!blocks->swapped) {
4351 spin_unlock(&blocks->lock);
4352 return 0;
4353 }
4354 node = blocks->blocks[level].rb_node;
4355
4356 while (node) {
4357 block = rb_entry(node, struct btrfs_qgroup_swapped_block, node);
4358 if (block->subvol_bytenr < subvol_eb->start) {
4359 node = node->rb_left;
4360 } else if (block->subvol_bytenr > subvol_eb->start) {
4361 node = node->rb_right;
4362 } else {
4363 found = true;
4364 break;
4365 }
4366 }
4367 if (!found) {
4368 spin_unlock(&blocks->lock);
4369 goto out;
4370 }
4371 /* Found one, remove it from @blocks first and update blocks->swapped */
4372 rb_erase(&block->node, &blocks->blocks[level]);
4373 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4374 if (RB_EMPTY_ROOT(&blocks->blocks[i])) {
4375 swapped = true;
4376 break;
4377 }
4378 }
4379 blocks->swapped = swapped;
4380 spin_unlock(&blocks->lock);
4381
4382 check.level = block->level;
4383 check.transid = block->reloc_generation;
4384 check.has_first_key = true;
4385 memcpy(&check.first_key, &block->first_key, sizeof(check.first_key));
4386
4387 /* Read out reloc subtree root */
4388 reloc_eb = read_tree_block(fs_info, block->reloc_bytenr, &check);
4389 if (IS_ERR(reloc_eb)) {
4390 ret = PTR_ERR(reloc_eb);
4391 reloc_eb = NULL;
4392 goto free_out;
4393 }
4394 if (!extent_buffer_uptodate(reloc_eb)) {
4395 ret = -EIO;
4396 goto free_out;
4397 }
4398
4399 ret = qgroup_trace_subtree_swap(trans, reloc_eb, subvol_eb,
4400 block->last_snapshot, block->trace_leaf);
4401free_out:
4402 kfree(block);
4403 free_extent_buffer(reloc_eb);
4404out:
4405 if (ret < 0) {
4406 btrfs_err_rl(fs_info,
4407 "failed to account subtree at bytenr %llu: %d",
4408 subvol_eb->start, ret);
4409 qgroup_mark_inconsistent(fs_info);
4410 }
4411 return ret;
4412}
4413
4414void btrfs_qgroup_destroy_extent_records(struct btrfs_transaction *trans)
4415{
4416 struct btrfs_qgroup_extent_record *entry;
4417 struct btrfs_qgroup_extent_record *next;
4418 struct rb_root *root;
4419
4420 root = &trans->delayed_refs.dirty_extent_root;
4421 rbtree_postorder_for_each_entry_safe(entry, next, root, node) {
4422 ulist_free(entry->old_roots);
4423 kfree(entry);
4424 }
4425}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2011 STRATO. All rights reserved.
4 */
5
6#include <linux/sched.h>
7#include <linux/pagemap.h>
8#include <linux/writeback.h>
9#include <linux/blkdev.h>
10#include <linux/rbtree.h>
11#include <linux/slab.h>
12#include <linux/workqueue.h>
13#include <linux/btrfs.h>
14#include <linux/sched/mm.h>
15
16#include "ctree.h"
17#include "transaction.h"
18#include "disk-io.h"
19#include "locking.h"
20#include "ulist.h"
21#include "backref.h"
22#include "extent_io.h"
23#include "qgroup.h"
24#include "block-group.h"
25#include "sysfs.h"
26#include "tree-mod-log.h"
27#include "fs.h"
28#include "accessors.h"
29#include "extent-tree.h"
30#include "root-tree.h"
31#include "tree-checker.h"
32
33enum btrfs_qgroup_mode btrfs_qgroup_mode(const struct btrfs_fs_info *fs_info)
34{
35 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
36 return BTRFS_QGROUP_MODE_DISABLED;
37 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_SIMPLE_MODE)
38 return BTRFS_QGROUP_MODE_SIMPLE;
39 return BTRFS_QGROUP_MODE_FULL;
40}
41
42bool btrfs_qgroup_enabled(const struct btrfs_fs_info *fs_info)
43{
44 return btrfs_qgroup_mode(fs_info) != BTRFS_QGROUP_MODE_DISABLED;
45}
46
47bool btrfs_qgroup_full_accounting(const struct btrfs_fs_info *fs_info)
48{
49 return btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_FULL;
50}
51
52/*
53 * Helpers to access qgroup reservation
54 *
55 * Callers should ensure the lock context and type are valid
56 */
57
58static u64 qgroup_rsv_total(const struct btrfs_qgroup *qgroup)
59{
60 u64 ret = 0;
61 int i;
62
63 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
64 ret += qgroup->rsv.values[i];
65
66 return ret;
67}
68
69#ifdef CONFIG_BTRFS_DEBUG
70static const char *qgroup_rsv_type_str(enum btrfs_qgroup_rsv_type type)
71{
72 if (type == BTRFS_QGROUP_RSV_DATA)
73 return "data";
74 if (type == BTRFS_QGROUP_RSV_META_PERTRANS)
75 return "meta_pertrans";
76 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
77 return "meta_prealloc";
78 return NULL;
79}
80#endif
81
82static void qgroup_rsv_add(struct btrfs_fs_info *fs_info,
83 struct btrfs_qgroup *qgroup, u64 num_bytes,
84 enum btrfs_qgroup_rsv_type type)
85{
86 trace_qgroup_update_reserve(fs_info, qgroup, num_bytes, type);
87 qgroup->rsv.values[type] += num_bytes;
88}
89
90static void qgroup_rsv_release(struct btrfs_fs_info *fs_info,
91 struct btrfs_qgroup *qgroup, u64 num_bytes,
92 enum btrfs_qgroup_rsv_type type)
93{
94 trace_qgroup_update_reserve(fs_info, qgroup, -(s64)num_bytes, type);
95 if (qgroup->rsv.values[type] >= num_bytes) {
96 qgroup->rsv.values[type] -= num_bytes;
97 return;
98 }
99#ifdef CONFIG_BTRFS_DEBUG
100 WARN_RATELIMIT(1,
101 "qgroup %llu %s reserved space underflow, have %llu to free %llu",
102 qgroup->qgroupid, qgroup_rsv_type_str(type),
103 qgroup->rsv.values[type], num_bytes);
104#endif
105 qgroup->rsv.values[type] = 0;
106}
107
108static void qgroup_rsv_add_by_qgroup(struct btrfs_fs_info *fs_info,
109 struct btrfs_qgroup *dest,
110 const struct btrfs_qgroup *src)
111{
112 int i;
113
114 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
115 qgroup_rsv_add(fs_info, dest, src->rsv.values[i], i);
116}
117
118static void qgroup_rsv_release_by_qgroup(struct btrfs_fs_info *fs_info,
119 struct btrfs_qgroup *dest,
120 const struct btrfs_qgroup *src)
121{
122 int i;
123
124 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
125 qgroup_rsv_release(fs_info, dest, src->rsv.values[i], i);
126}
127
128static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq,
129 int mod)
130{
131 if (qg->old_refcnt < seq)
132 qg->old_refcnt = seq;
133 qg->old_refcnt += mod;
134}
135
136static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq,
137 int mod)
138{
139 if (qg->new_refcnt < seq)
140 qg->new_refcnt = seq;
141 qg->new_refcnt += mod;
142}
143
144static inline u64 btrfs_qgroup_get_old_refcnt(const struct btrfs_qgroup *qg, u64 seq)
145{
146 if (qg->old_refcnt < seq)
147 return 0;
148 return qg->old_refcnt - seq;
149}
150
151static inline u64 btrfs_qgroup_get_new_refcnt(const struct btrfs_qgroup *qg, u64 seq)
152{
153 if (qg->new_refcnt < seq)
154 return 0;
155 return qg->new_refcnt - seq;
156}
157
158static int
159qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
160 int init_flags);
161static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
162
163/* must be called with qgroup_ioctl_lock held */
164static struct btrfs_qgroup *find_qgroup_rb(const struct btrfs_fs_info *fs_info,
165 u64 qgroupid)
166{
167 struct rb_node *n = fs_info->qgroup_tree.rb_node;
168 struct btrfs_qgroup *qgroup;
169
170 while (n) {
171 qgroup = rb_entry(n, struct btrfs_qgroup, node);
172 if (qgroup->qgroupid < qgroupid)
173 n = n->rb_left;
174 else if (qgroup->qgroupid > qgroupid)
175 n = n->rb_right;
176 else
177 return qgroup;
178 }
179 return NULL;
180}
181
182/*
183 * Add qgroup to the filesystem's qgroup tree.
184 *
185 * Must be called with qgroup_lock held and @prealloc preallocated.
186 *
187 * The control on the lifespan of @prealloc would be transferred to this
188 * function, thus caller should no longer touch @prealloc.
189 */
190static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
191 struct btrfs_qgroup *prealloc,
192 u64 qgroupid)
193{
194 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
195 struct rb_node *parent = NULL;
196 struct btrfs_qgroup *qgroup;
197
198 /* Caller must have pre-allocated @prealloc. */
199 ASSERT(prealloc);
200
201 while (*p) {
202 parent = *p;
203 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
204
205 if (qgroup->qgroupid < qgroupid) {
206 p = &(*p)->rb_left;
207 } else if (qgroup->qgroupid > qgroupid) {
208 p = &(*p)->rb_right;
209 } else {
210 kfree(prealloc);
211 return qgroup;
212 }
213 }
214
215 qgroup = prealloc;
216 qgroup->qgroupid = qgroupid;
217 INIT_LIST_HEAD(&qgroup->groups);
218 INIT_LIST_HEAD(&qgroup->members);
219 INIT_LIST_HEAD(&qgroup->dirty);
220 INIT_LIST_HEAD(&qgroup->iterator);
221 INIT_LIST_HEAD(&qgroup->nested_iterator);
222
223 rb_link_node(&qgroup->node, parent, p);
224 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
225
226 return qgroup;
227}
228
229static void __del_qgroup_rb(struct btrfs_qgroup *qgroup)
230{
231 struct btrfs_qgroup_list *list;
232
233 list_del(&qgroup->dirty);
234 while (!list_empty(&qgroup->groups)) {
235 list = list_first_entry(&qgroup->groups,
236 struct btrfs_qgroup_list, next_group);
237 list_del(&list->next_group);
238 list_del(&list->next_member);
239 kfree(list);
240 }
241
242 while (!list_empty(&qgroup->members)) {
243 list = list_first_entry(&qgroup->members,
244 struct btrfs_qgroup_list, next_member);
245 list_del(&list->next_group);
246 list_del(&list->next_member);
247 kfree(list);
248 }
249}
250
251/* must be called with qgroup_lock held */
252static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
253{
254 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
255
256 if (!qgroup)
257 return -ENOENT;
258
259 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
260 __del_qgroup_rb(qgroup);
261 return 0;
262}
263
264/*
265 * Add relation specified by two qgroups.
266 *
267 * Must be called with qgroup_lock held, the ownership of @prealloc is
268 * transferred to this function and caller should not touch it anymore.
269 *
270 * Return: 0 on success
271 * -ENOENT if one of the qgroups is NULL
272 * <0 other errors
273 */
274static int __add_relation_rb(struct btrfs_qgroup_list *prealloc,
275 struct btrfs_qgroup *member,
276 struct btrfs_qgroup *parent)
277{
278 if (!member || !parent) {
279 kfree(prealloc);
280 return -ENOENT;
281 }
282
283 prealloc->group = parent;
284 prealloc->member = member;
285 list_add_tail(&prealloc->next_group, &member->groups);
286 list_add_tail(&prealloc->next_member, &parent->members);
287
288 return 0;
289}
290
291/*
292 * Add relation specified by two qgroup ids.
293 *
294 * Must be called with qgroup_lock held.
295 *
296 * Return: 0 on success
297 * -ENOENT if one of the ids does not exist
298 * <0 other errors
299 */
300static int add_relation_rb(struct btrfs_fs_info *fs_info,
301 struct btrfs_qgroup_list *prealloc,
302 u64 memberid, u64 parentid)
303{
304 struct btrfs_qgroup *member;
305 struct btrfs_qgroup *parent;
306
307 member = find_qgroup_rb(fs_info, memberid);
308 parent = find_qgroup_rb(fs_info, parentid);
309
310 return __add_relation_rb(prealloc, member, parent);
311}
312
313/* Must be called with qgroup_lock held */
314static int del_relation_rb(struct btrfs_fs_info *fs_info,
315 u64 memberid, u64 parentid)
316{
317 struct btrfs_qgroup *member;
318 struct btrfs_qgroup *parent;
319 struct btrfs_qgroup_list *list;
320
321 member = find_qgroup_rb(fs_info, memberid);
322 parent = find_qgroup_rb(fs_info, parentid);
323 if (!member || !parent)
324 return -ENOENT;
325
326 list_for_each_entry(list, &member->groups, next_group) {
327 if (list->group == parent) {
328 list_del(&list->next_group);
329 list_del(&list->next_member);
330 kfree(list);
331 return 0;
332 }
333 }
334 return -ENOENT;
335}
336
337#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
338int btrfs_verify_qgroup_counts(const struct btrfs_fs_info *fs_info, u64 qgroupid,
339 u64 rfer, u64 excl)
340{
341 struct btrfs_qgroup *qgroup;
342
343 qgroup = find_qgroup_rb(fs_info, qgroupid);
344 if (!qgroup)
345 return -EINVAL;
346 if (qgroup->rfer != rfer || qgroup->excl != excl)
347 return -EINVAL;
348 return 0;
349}
350#endif
351
352static void qgroup_mark_inconsistent(struct btrfs_fs_info *fs_info)
353{
354 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE)
355 return;
356 fs_info->qgroup_flags |= (BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT |
357 BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
358 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
359}
360
361static void qgroup_read_enable_gen(struct btrfs_fs_info *fs_info,
362 struct extent_buffer *leaf, int slot,
363 struct btrfs_qgroup_status_item *ptr)
364{
365 ASSERT(btrfs_fs_incompat(fs_info, SIMPLE_QUOTA));
366 ASSERT(btrfs_item_size(leaf, slot) >= sizeof(*ptr));
367 fs_info->qgroup_enable_gen = btrfs_qgroup_status_enable_gen(leaf, ptr);
368}
369
370/*
371 * The full config is read in one go, only called from open_ctree()
372 * It doesn't use any locking, as at this point we're still single-threaded
373 */
374int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
375{
376 struct btrfs_key key;
377 struct btrfs_key found_key;
378 struct btrfs_root *quota_root = fs_info->quota_root;
379 struct btrfs_path *path = NULL;
380 struct extent_buffer *l;
381 int slot;
382 int ret = 0;
383 u64 flags = 0;
384 u64 rescan_progress = 0;
385
386 if (!fs_info->quota_root)
387 return 0;
388
389 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
390 if (!fs_info->qgroup_ulist) {
391 ret = -ENOMEM;
392 goto out;
393 }
394
395 path = btrfs_alloc_path();
396 if (!path) {
397 ret = -ENOMEM;
398 goto out;
399 }
400
401 ret = btrfs_sysfs_add_qgroups(fs_info);
402 if (ret < 0)
403 goto out;
404 /* default this to quota off, in case no status key is found */
405 fs_info->qgroup_flags = 0;
406
407 /*
408 * pass 1: read status, all qgroup infos and limits
409 */
410 key.objectid = 0;
411 key.type = 0;
412 key.offset = 0;
413 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
414 if (ret)
415 goto out;
416
417 while (1) {
418 struct btrfs_qgroup *qgroup;
419
420 slot = path->slots[0];
421 l = path->nodes[0];
422 btrfs_item_key_to_cpu(l, &found_key, slot);
423
424 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
425 struct btrfs_qgroup_status_item *ptr;
426
427 ptr = btrfs_item_ptr(l, slot,
428 struct btrfs_qgroup_status_item);
429
430 if (btrfs_qgroup_status_version(l, ptr) !=
431 BTRFS_QGROUP_STATUS_VERSION) {
432 btrfs_err(fs_info,
433 "old qgroup version, quota disabled");
434 goto out;
435 }
436 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l, ptr);
437 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_SIMPLE_MODE) {
438 qgroup_read_enable_gen(fs_info, l, slot, ptr);
439 } else if (btrfs_qgroup_status_generation(l, ptr) != fs_info->generation) {
440 qgroup_mark_inconsistent(fs_info);
441 btrfs_err(fs_info,
442 "qgroup generation mismatch, marked as inconsistent");
443 }
444 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
445 goto next1;
446 }
447
448 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
449 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
450 goto next1;
451
452 qgroup = find_qgroup_rb(fs_info, found_key.offset);
453 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
454 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
455 btrfs_err(fs_info, "inconsistent qgroup config");
456 qgroup_mark_inconsistent(fs_info);
457 }
458 if (!qgroup) {
459 struct btrfs_qgroup *prealloc;
460 struct btrfs_root *tree_root = fs_info->tree_root;
461
462 prealloc = kzalloc(sizeof(*prealloc), GFP_KERNEL);
463 if (!prealloc) {
464 ret = -ENOMEM;
465 goto out;
466 }
467 qgroup = add_qgroup_rb(fs_info, prealloc, found_key.offset);
468 /*
469 * If a qgroup exists for a subvolume ID, it is possible
470 * that subvolume has been deleted, in which case
471 * reusing that ID would lead to incorrect accounting.
472 *
473 * Ensure that we skip any such subvol ids.
474 *
475 * We don't need to lock because this is only called
476 * during mount before we start doing things like creating
477 * subvolumes.
478 */
479 if (is_fstree(qgroup->qgroupid) &&
480 qgroup->qgroupid > tree_root->free_objectid)
481 /*
482 * Don't need to check against BTRFS_LAST_FREE_OBJECTID,
483 * as it will get checked on the next call to
484 * btrfs_get_free_objectid.
485 */
486 tree_root->free_objectid = qgroup->qgroupid + 1;
487 }
488 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
489 if (ret < 0)
490 goto out;
491
492 switch (found_key.type) {
493 case BTRFS_QGROUP_INFO_KEY: {
494 struct btrfs_qgroup_info_item *ptr;
495
496 ptr = btrfs_item_ptr(l, slot,
497 struct btrfs_qgroup_info_item);
498 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
499 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
500 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
501 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
502 /* generation currently unused */
503 break;
504 }
505 case BTRFS_QGROUP_LIMIT_KEY: {
506 struct btrfs_qgroup_limit_item *ptr;
507
508 ptr = btrfs_item_ptr(l, slot,
509 struct btrfs_qgroup_limit_item);
510 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
511 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
512 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
513 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
514 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
515 break;
516 }
517 }
518next1:
519 ret = btrfs_next_item(quota_root, path);
520 if (ret < 0)
521 goto out;
522 if (ret)
523 break;
524 }
525 btrfs_release_path(path);
526
527 /*
528 * pass 2: read all qgroup relations
529 */
530 key.objectid = 0;
531 key.type = BTRFS_QGROUP_RELATION_KEY;
532 key.offset = 0;
533 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
534 if (ret)
535 goto out;
536 while (1) {
537 struct btrfs_qgroup_list *list = NULL;
538
539 slot = path->slots[0];
540 l = path->nodes[0];
541 btrfs_item_key_to_cpu(l, &found_key, slot);
542
543 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
544 goto next2;
545
546 if (found_key.objectid > found_key.offset) {
547 /* parent <- member, not needed to build config */
548 /* FIXME should we omit the key completely? */
549 goto next2;
550 }
551
552 list = kzalloc(sizeof(*list), GFP_KERNEL);
553 if (!list) {
554 ret = -ENOMEM;
555 goto out;
556 }
557 ret = add_relation_rb(fs_info, list, found_key.objectid,
558 found_key.offset);
559 list = NULL;
560 if (ret == -ENOENT) {
561 btrfs_warn(fs_info,
562 "orphan qgroup relation 0x%llx->0x%llx",
563 found_key.objectid, found_key.offset);
564 ret = 0; /* ignore the error */
565 }
566 if (ret)
567 goto out;
568next2:
569 ret = btrfs_next_item(quota_root, path);
570 if (ret < 0)
571 goto out;
572 if (ret)
573 break;
574 }
575out:
576 btrfs_free_path(path);
577 fs_info->qgroup_flags |= flags;
578 if (ret >= 0) {
579 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON)
580 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
581 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
582 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
583 } else {
584 ulist_free(fs_info->qgroup_ulist);
585 fs_info->qgroup_ulist = NULL;
586 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
587 btrfs_sysfs_del_qgroups(fs_info);
588 }
589
590 return ret < 0 ? ret : 0;
591}
592
593/*
594 * Called in close_ctree() when quota is still enabled. This verifies we don't
595 * leak some reserved space.
596 *
597 * Return false if no reserved space is left.
598 * Return true if some reserved space is leaked.
599 */
600bool btrfs_check_quota_leak(const struct btrfs_fs_info *fs_info)
601{
602 struct rb_node *node;
603 bool ret = false;
604
605 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED)
606 return ret;
607 /*
608 * Since we're unmounting, there is no race and no need to grab qgroup
609 * lock. And here we don't go post-order to provide a more user
610 * friendly sorted result.
611 */
612 for (node = rb_first(&fs_info->qgroup_tree); node; node = rb_next(node)) {
613 struct btrfs_qgroup *qgroup;
614 int i;
615
616 qgroup = rb_entry(node, struct btrfs_qgroup, node);
617 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++) {
618 if (qgroup->rsv.values[i]) {
619 ret = true;
620 btrfs_warn(fs_info,
621 "qgroup %hu/%llu has unreleased space, type %d rsv %llu",
622 btrfs_qgroup_level(qgroup->qgroupid),
623 btrfs_qgroup_subvolid(qgroup->qgroupid),
624 i, qgroup->rsv.values[i]);
625 }
626 }
627 }
628 return ret;
629}
630
631/*
632 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
633 * first two are in single-threaded paths.And for the third one, we have set
634 * quota_root to be null with qgroup_lock held before, so it is safe to clean
635 * up the in-memory structures without qgroup_lock held.
636 */
637void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
638{
639 struct rb_node *n;
640 struct btrfs_qgroup *qgroup;
641
642 while ((n = rb_first(&fs_info->qgroup_tree))) {
643 qgroup = rb_entry(n, struct btrfs_qgroup, node);
644 rb_erase(n, &fs_info->qgroup_tree);
645 __del_qgroup_rb(qgroup);
646 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
647 kfree(qgroup);
648 }
649 /*
650 * We call btrfs_free_qgroup_config() when unmounting
651 * filesystem and disabling quota, so we set qgroup_ulist
652 * to be null here to avoid double free.
653 */
654 ulist_free(fs_info->qgroup_ulist);
655 fs_info->qgroup_ulist = NULL;
656 btrfs_sysfs_del_qgroups(fs_info);
657}
658
659static int add_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
660 u64 dst)
661{
662 int ret;
663 struct btrfs_root *quota_root = trans->fs_info->quota_root;
664 struct btrfs_path *path;
665 struct btrfs_key key;
666
667 path = btrfs_alloc_path();
668 if (!path)
669 return -ENOMEM;
670
671 key.objectid = src;
672 key.type = BTRFS_QGROUP_RELATION_KEY;
673 key.offset = dst;
674
675 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
676
677 btrfs_mark_buffer_dirty(trans, path->nodes[0]);
678
679 btrfs_free_path(path);
680 return ret;
681}
682
683static int del_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
684 u64 dst)
685{
686 int ret;
687 struct btrfs_root *quota_root = trans->fs_info->quota_root;
688 struct btrfs_path *path;
689 struct btrfs_key key;
690
691 path = btrfs_alloc_path();
692 if (!path)
693 return -ENOMEM;
694
695 key.objectid = src;
696 key.type = BTRFS_QGROUP_RELATION_KEY;
697 key.offset = dst;
698
699 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
700 if (ret < 0)
701 goto out;
702
703 if (ret > 0) {
704 ret = -ENOENT;
705 goto out;
706 }
707
708 ret = btrfs_del_item(trans, quota_root, path);
709out:
710 btrfs_free_path(path);
711 return ret;
712}
713
714static int add_qgroup_item(struct btrfs_trans_handle *trans,
715 struct btrfs_root *quota_root, u64 qgroupid)
716{
717 int ret;
718 struct btrfs_path *path;
719 struct btrfs_qgroup_info_item *qgroup_info;
720 struct btrfs_qgroup_limit_item *qgroup_limit;
721 struct extent_buffer *leaf;
722 struct btrfs_key key;
723
724 if (btrfs_is_testing(quota_root->fs_info))
725 return 0;
726
727 path = btrfs_alloc_path();
728 if (!path)
729 return -ENOMEM;
730
731 key.objectid = 0;
732 key.type = BTRFS_QGROUP_INFO_KEY;
733 key.offset = qgroupid;
734
735 /*
736 * Avoid a transaction abort by catching -EEXIST here. In that
737 * case, we proceed by re-initializing the existing structure
738 * on disk.
739 */
740
741 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
742 sizeof(*qgroup_info));
743 if (ret && ret != -EEXIST)
744 goto out;
745
746 leaf = path->nodes[0];
747 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
748 struct btrfs_qgroup_info_item);
749 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
750 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
751 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
752 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
753 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
754
755 btrfs_mark_buffer_dirty(trans, leaf);
756
757 btrfs_release_path(path);
758
759 key.type = BTRFS_QGROUP_LIMIT_KEY;
760 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
761 sizeof(*qgroup_limit));
762 if (ret && ret != -EEXIST)
763 goto out;
764
765 leaf = path->nodes[0];
766 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
767 struct btrfs_qgroup_limit_item);
768 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
769 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
770 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
771 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
772 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
773
774 btrfs_mark_buffer_dirty(trans, leaf);
775
776 ret = 0;
777out:
778 btrfs_free_path(path);
779 return ret;
780}
781
782static int del_qgroup_item(struct btrfs_trans_handle *trans, u64 qgroupid)
783{
784 int ret;
785 struct btrfs_root *quota_root = trans->fs_info->quota_root;
786 struct btrfs_path *path;
787 struct btrfs_key key;
788
789 path = btrfs_alloc_path();
790 if (!path)
791 return -ENOMEM;
792
793 key.objectid = 0;
794 key.type = BTRFS_QGROUP_INFO_KEY;
795 key.offset = qgroupid;
796 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
797 if (ret < 0)
798 goto out;
799
800 if (ret > 0) {
801 ret = -ENOENT;
802 goto out;
803 }
804
805 ret = btrfs_del_item(trans, quota_root, path);
806 if (ret)
807 goto out;
808
809 btrfs_release_path(path);
810
811 key.type = BTRFS_QGROUP_LIMIT_KEY;
812 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
813 if (ret < 0)
814 goto out;
815
816 if (ret > 0) {
817 ret = -ENOENT;
818 goto out;
819 }
820
821 ret = btrfs_del_item(trans, quota_root, path);
822
823out:
824 btrfs_free_path(path);
825 return ret;
826}
827
828static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
829 struct btrfs_qgroup *qgroup)
830{
831 struct btrfs_root *quota_root = trans->fs_info->quota_root;
832 struct btrfs_path *path;
833 struct btrfs_key key;
834 struct extent_buffer *l;
835 struct btrfs_qgroup_limit_item *qgroup_limit;
836 int ret;
837 int slot;
838
839 key.objectid = 0;
840 key.type = BTRFS_QGROUP_LIMIT_KEY;
841 key.offset = qgroup->qgroupid;
842
843 path = btrfs_alloc_path();
844 if (!path)
845 return -ENOMEM;
846
847 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
848 if (ret > 0)
849 ret = -ENOENT;
850
851 if (ret)
852 goto out;
853
854 l = path->nodes[0];
855 slot = path->slots[0];
856 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
857 btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags);
858 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer);
859 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl);
860 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer);
861 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl);
862
863 btrfs_mark_buffer_dirty(trans, l);
864
865out:
866 btrfs_free_path(path);
867 return ret;
868}
869
870static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
871 struct btrfs_qgroup *qgroup)
872{
873 struct btrfs_fs_info *fs_info = trans->fs_info;
874 struct btrfs_root *quota_root = fs_info->quota_root;
875 struct btrfs_path *path;
876 struct btrfs_key key;
877 struct extent_buffer *l;
878 struct btrfs_qgroup_info_item *qgroup_info;
879 int ret;
880 int slot;
881
882 if (btrfs_is_testing(fs_info))
883 return 0;
884
885 key.objectid = 0;
886 key.type = BTRFS_QGROUP_INFO_KEY;
887 key.offset = qgroup->qgroupid;
888
889 path = btrfs_alloc_path();
890 if (!path)
891 return -ENOMEM;
892
893 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
894 if (ret > 0)
895 ret = -ENOENT;
896
897 if (ret)
898 goto out;
899
900 l = path->nodes[0];
901 slot = path->slots[0];
902 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
903 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
904 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
905 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
906 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
907 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
908
909 btrfs_mark_buffer_dirty(trans, l);
910
911out:
912 btrfs_free_path(path);
913 return ret;
914}
915
916static int update_qgroup_status_item(struct btrfs_trans_handle *trans)
917{
918 struct btrfs_fs_info *fs_info = trans->fs_info;
919 struct btrfs_root *quota_root = fs_info->quota_root;
920 struct btrfs_path *path;
921 struct btrfs_key key;
922 struct extent_buffer *l;
923 struct btrfs_qgroup_status_item *ptr;
924 int ret;
925 int slot;
926
927 key.objectid = 0;
928 key.type = BTRFS_QGROUP_STATUS_KEY;
929 key.offset = 0;
930
931 path = btrfs_alloc_path();
932 if (!path)
933 return -ENOMEM;
934
935 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
936 if (ret > 0)
937 ret = -ENOENT;
938
939 if (ret)
940 goto out;
941
942 l = path->nodes[0];
943 slot = path->slots[0];
944 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
945 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags &
946 BTRFS_QGROUP_STATUS_FLAGS_MASK);
947 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
948 btrfs_set_qgroup_status_rescan(l, ptr,
949 fs_info->qgroup_rescan_progress.objectid);
950
951 btrfs_mark_buffer_dirty(trans, l);
952
953out:
954 btrfs_free_path(path);
955 return ret;
956}
957
958/*
959 * called with qgroup_lock held
960 */
961static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
962 struct btrfs_root *root)
963{
964 struct btrfs_path *path;
965 struct btrfs_key key;
966 struct extent_buffer *leaf = NULL;
967 int ret;
968 int nr = 0;
969
970 path = btrfs_alloc_path();
971 if (!path)
972 return -ENOMEM;
973
974 key.objectid = 0;
975 key.offset = 0;
976 key.type = 0;
977
978 while (1) {
979 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
980 if (ret < 0)
981 goto out;
982 leaf = path->nodes[0];
983 nr = btrfs_header_nritems(leaf);
984 if (!nr)
985 break;
986 /*
987 * delete the leaf one by one
988 * since the whole tree is going
989 * to be deleted.
990 */
991 path->slots[0] = 0;
992 ret = btrfs_del_items(trans, root, path, 0, nr);
993 if (ret)
994 goto out;
995
996 btrfs_release_path(path);
997 }
998 ret = 0;
999out:
1000 btrfs_free_path(path);
1001 return ret;
1002}
1003
1004int btrfs_quota_enable(struct btrfs_fs_info *fs_info,
1005 struct btrfs_ioctl_quota_ctl_args *quota_ctl_args)
1006{
1007 struct btrfs_root *quota_root;
1008 struct btrfs_root *tree_root = fs_info->tree_root;
1009 struct btrfs_path *path = NULL;
1010 struct btrfs_qgroup_status_item *ptr;
1011 struct extent_buffer *leaf;
1012 struct btrfs_key key;
1013 struct btrfs_key found_key;
1014 struct btrfs_qgroup *qgroup = NULL;
1015 struct btrfs_qgroup *prealloc = NULL;
1016 struct btrfs_trans_handle *trans = NULL;
1017 struct ulist *ulist = NULL;
1018 const bool simple = (quota_ctl_args->cmd == BTRFS_QUOTA_CTL_ENABLE_SIMPLE_QUOTA);
1019 int ret = 0;
1020 int slot;
1021
1022 /*
1023 * We need to have subvol_sem write locked, to prevent races between
1024 * concurrent tasks trying to enable quotas, because we will unlock
1025 * and relock qgroup_ioctl_lock before setting fs_info->quota_root
1026 * and before setting BTRFS_FS_QUOTA_ENABLED.
1027 */
1028 lockdep_assert_held_write(&fs_info->subvol_sem);
1029
1030 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) {
1031 btrfs_err(fs_info,
1032 "qgroups are currently unsupported in extent tree v2");
1033 return -EINVAL;
1034 }
1035
1036 mutex_lock(&fs_info->qgroup_ioctl_lock);
1037 if (fs_info->quota_root)
1038 goto out;
1039
1040 ulist = ulist_alloc(GFP_KERNEL);
1041 if (!ulist) {
1042 ret = -ENOMEM;
1043 goto out;
1044 }
1045
1046 ret = btrfs_sysfs_add_qgroups(fs_info);
1047 if (ret < 0)
1048 goto out;
1049
1050 /*
1051 * Unlock qgroup_ioctl_lock before starting the transaction. This is to
1052 * avoid lock acquisition inversion problems (reported by lockdep) between
1053 * qgroup_ioctl_lock and the vfs freeze semaphores, acquired when we
1054 * start a transaction.
1055 * After we started the transaction lock qgroup_ioctl_lock again and
1056 * check if someone else created the quota root in the meanwhile. If so,
1057 * just return success and release the transaction handle.
1058 *
1059 * Also we don't need to worry about someone else calling
1060 * btrfs_sysfs_add_qgroups() after we unlock and getting an error because
1061 * that function returns 0 (success) when the sysfs entries already exist.
1062 */
1063 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1064
1065 /*
1066 * 1 for quota root item
1067 * 1 for BTRFS_QGROUP_STATUS item
1068 *
1069 * Yet we also need 2*n items for a QGROUP_INFO/QGROUP_LIMIT items
1070 * per subvolume. However those are not currently reserved since it
1071 * would be a lot of overkill.
1072 */
1073 trans = btrfs_start_transaction(tree_root, 2);
1074
1075 mutex_lock(&fs_info->qgroup_ioctl_lock);
1076 if (IS_ERR(trans)) {
1077 ret = PTR_ERR(trans);
1078 trans = NULL;
1079 goto out;
1080 }
1081
1082 if (fs_info->quota_root)
1083 goto out;
1084
1085 fs_info->qgroup_ulist = ulist;
1086 ulist = NULL;
1087
1088 /*
1089 * initially create the quota tree
1090 */
1091 quota_root = btrfs_create_tree(trans, BTRFS_QUOTA_TREE_OBJECTID);
1092 if (IS_ERR(quota_root)) {
1093 ret = PTR_ERR(quota_root);
1094 btrfs_abort_transaction(trans, ret);
1095 goto out;
1096 }
1097
1098 path = btrfs_alloc_path();
1099 if (!path) {
1100 ret = -ENOMEM;
1101 btrfs_abort_transaction(trans, ret);
1102 goto out_free_root;
1103 }
1104
1105 key.objectid = 0;
1106 key.type = BTRFS_QGROUP_STATUS_KEY;
1107 key.offset = 0;
1108
1109 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
1110 sizeof(*ptr));
1111 if (ret) {
1112 btrfs_abort_transaction(trans, ret);
1113 goto out_free_path;
1114 }
1115
1116 leaf = path->nodes[0];
1117 ptr = btrfs_item_ptr(leaf, path->slots[0],
1118 struct btrfs_qgroup_status_item);
1119 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
1120 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
1121 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON;
1122 if (simple) {
1123 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_SIMPLE_MODE;
1124 btrfs_set_fs_incompat(fs_info, SIMPLE_QUOTA);
1125 btrfs_set_qgroup_status_enable_gen(leaf, ptr, trans->transid);
1126 } else {
1127 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1128 }
1129 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags &
1130 BTRFS_QGROUP_STATUS_FLAGS_MASK);
1131 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
1132
1133 btrfs_mark_buffer_dirty(trans, leaf);
1134
1135 key.objectid = 0;
1136 key.type = BTRFS_ROOT_REF_KEY;
1137 key.offset = 0;
1138
1139 btrfs_release_path(path);
1140 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
1141 if (ret > 0)
1142 goto out_add_root;
1143 if (ret < 0) {
1144 btrfs_abort_transaction(trans, ret);
1145 goto out_free_path;
1146 }
1147
1148 while (1) {
1149 slot = path->slots[0];
1150 leaf = path->nodes[0];
1151 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1152
1153 if (found_key.type == BTRFS_ROOT_REF_KEY) {
1154
1155 /* Release locks on tree_root before we access quota_root */
1156 btrfs_release_path(path);
1157
1158 /* We should not have a stray @prealloc pointer. */
1159 ASSERT(prealloc == NULL);
1160 prealloc = kzalloc(sizeof(*prealloc), GFP_NOFS);
1161 if (!prealloc) {
1162 ret = -ENOMEM;
1163 btrfs_abort_transaction(trans, ret);
1164 goto out_free_path;
1165 }
1166
1167 ret = add_qgroup_item(trans, quota_root,
1168 found_key.offset);
1169 if (ret) {
1170 btrfs_abort_transaction(trans, ret);
1171 goto out_free_path;
1172 }
1173
1174 qgroup = add_qgroup_rb(fs_info, prealloc, found_key.offset);
1175 prealloc = NULL;
1176 if (IS_ERR(qgroup)) {
1177 ret = PTR_ERR(qgroup);
1178 btrfs_abort_transaction(trans, ret);
1179 goto out_free_path;
1180 }
1181 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1182 if (ret < 0) {
1183 btrfs_abort_transaction(trans, ret);
1184 goto out_free_path;
1185 }
1186 ret = btrfs_search_slot_for_read(tree_root, &found_key,
1187 path, 1, 0);
1188 if (ret < 0) {
1189 btrfs_abort_transaction(trans, ret);
1190 goto out_free_path;
1191 }
1192 if (ret > 0) {
1193 /*
1194 * Shouldn't happen, but in case it does we
1195 * don't need to do the btrfs_next_item, just
1196 * continue.
1197 */
1198 continue;
1199 }
1200 }
1201 ret = btrfs_next_item(tree_root, path);
1202 if (ret < 0) {
1203 btrfs_abort_transaction(trans, ret);
1204 goto out_free_path;
1205 }
1206 if (ret)
1207 break;
1208 }
1209
1210out_add_root:
1211 btrfs_release_path(path);
1212 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
1213 if (ret) {
1214 btrfs_abort_transaction(trans, ret);
1215 goto out_free_path;
1216 }
1217
1218 ASSERT(prealloc == NULL);
1219 prealloc = kzalloc(sizeof(*prealloc), GFP_NOFS);
1220 if (!prealloc) {
1221 ret = -ENOMEM;
1222 goto out_free_path;
1223 }
1224 qgroup = add_qgroup_rb(fs_info, prealloc, BTRFS_FS_TREE_OBJECTID);
1225 prealloc = NULL;
1226 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1227 if (ret < 0) {
1228 btrfs_abort_transaction(trans, ret);
1229 goto out_free_path;
1230 }
1231
1232 fs_info->qgroup_enable_gen = trans->transid;
1233
1234 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1235 /*
1236 * Commit the transaction while not holding qgroup_ioctl_lock, to avoid
1237 * a deadlock with tasks concurrently doing other qgroup operations, such
1238 * adding/removing qgroups or adding/deleting qgroup relations for example,
1239 * because all qgroup operations first start or join a transaction and then
1240 * lock the qgroup_ioctl_lock mutex.
1241 * We are safe from a concurrent task trying to enable quotas, by calling
1242 * this function, since we are serialized by fs_info->subvol_sem.
1243 */
1244 ret = btrfs_commit_transaction(trans);
1245 trans = NULL;
1246 mutex_lock(&fs_info->qgroup_ioctl_lock);
1247 if (ret)
1248 goto out_free_path;
1249
1250 /*
1251 * Set quota enabled flag after committing the transaction, to avoid
1252 * deadlocks on fs_info->qgroup_ioctl_lock with concurrent snapshot
1253 * creation.
1254 */
1255 spin_lock(&fs_info->qgroup_lock);
1256 fs_info->quota_root = quota_root;
1257 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1258 spin_unlock(&fs_info->qgroup_lock);
1259
1260 /* Skip rescan for simple qgroups. */
1261 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE)
1262 goto out_free_path;
1263
1264 ret = qgroup_rescan_init(fs_info, 0, 1);
1265 if (!ret) {
1266 qgroup_rescan_zero_tracking(fs_info);
1267 fs_info->qgroup_rescan_running = true;
1268 btrfs_queue_work(fs_info->qgroup_rescan_workers,
1269 &fs_info->qgroup_rescan_work);
1270 } else {
1271 /*
1272 * We have set both BTRFS_FS_QUOTA_ENABLED and
1273 * BTRFS_QGROUP_STATUS_FLAG_ON, so we can only fail with
1274 * -EINPROGRESS. That can happen because someone started the
1275 * rescan worker by calling quota rescan ioctl before we
1276 * attempted to initialize the rescan worker. Failure due to
1277 * quotas disabled in the meanwhile is not possible, because
1278 * we are holding a write lock on fs_info->subvol_sem, which
1279 * is also acquired when disabling quotas.
1280 * Ignore such error, and any other error would need to undo
1281 * everything we did in the transaction we just committed.
1282 */
1283 ASSERT(ret == -EINPROGRESS);
1284 ret = 0;
1285 }
1286
1287out_free_path:
1288 btrfs_free_path(path);
1289out_free_root:
1290 if (ret)
1291 btrfs_put_root(quota_root);
1292out:
1293 if (ret) {
1294 ulist_free(fs_info->qgroup_ulist);
1295 fs_info->qgroup_ulist = NULL;
1296 btrfs_sysfs_del_qgroups(fs_info);
1297 }
1298 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1299 if (ret && trans)
1300 btrfs_end_transaction(trans);
1301 else if (trans)
1302 ret = btrfs_end_transaction(trans);
1303 ulist_free(ulist);
1304 kfree(prealloc);
1305 return ret;
1306}
1307
1308/*
1309 * It is possible to have outstanding ordered extents which reserved bytes
1310 * before we disabled. We need to fully flush delalloc, ordered extents, and a
1311 * commit to ensure that we don't leak such reservations, only to have them
1312 * come back if we re-enable.
1313 *
1314 * - enable simple quotas
1315 * - reserve space
1316 * - release it, store rsv_bytes in OE
1317 * - disable quotas
1318 * - enable simple quotas (qgroup rsv are all 0)
1319 * - OE finishes
1320 * - run delayed refs
1321 * - free rsv_bytes, resulting in miscounting or even underflow
1322 */
1323static int flush_reservations(struct btrfs_fs_info *fs_info)
1324{
1325 int ret;
1326
1327 ret = btrfs_start_delalloc_roots(fs_info, LONG_MAX, false);
1328 if (ret)
1329 return ret;
1330 btrfs_wait_ordered_roots(fs_info, U64_MAX, NULL);
1331
1332 return btrfs_commit_current_transaction(fs_info->tree_root);
1333}
1334
1335int btrfs_quota_disable(struct btrfs_fs_info *fs_info)
1336{
1337 struct btrfs_root *quota_root = NULL;
1338 struct btrfs_trans_handle *trans = NULL;
1339 int ret = 0;
1340
1341 /*
1342 * We need to have subvol_sem write locked to prevent races with
1343 * snapshot creation.
1344 */
1345 lockdep_assert_held_write(&fs_info->subvol_sem);
1346
1347 /*
1348 * Relocation will mess with backrefs, so make sure we have the
1349 * cleaner_mutex held to protect us from relocate.
1350 */
1351 lockdep_assert_held(&fs_info->cleaner_mutex);
1352
1353 mutex_lock(&fs_info->qgroup_ioctl_lock);
1354 if (!fs_info->quota_root)
1355 goto out;
1356
1357 /*
1358 * Unlock the qgroup_ioctl_lock mutex before waiting for the rescan worker to
1359 * complete. Otherwise we can deadlock because btrfs_remove_qgroup() needs
1360 * to lock that mutex while holding a transaction handle and the rescan
1361 * worker needs to commit a transaction.
1362 */
1363 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1364
1365 /*
1366 * Request qgroup rescan worker to complete and wait for it. This wait
1367 * must be done before transaction start for quota disable since it may
1368 * deadlock with transaction by the qgroup rescan worker.
1369 */
1370 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1371 btrfs_qgroup_wait_for_completion(fs_info, false);
1372
1373 /*
1374 * We have nothing held here and no trans handle, just return the error
1375 * if there is one.
1376 */
1377 ret = flush_reservations(fs_info);
1378 if (ret)
1379 return ret;
1380
1381 /*
1382 * 1 For the root item
1383 *
1384 * We should also reserve enough items for the quota tree deletion in
1385 * btrfs_clean_quota_tree but this is not done.
1386 *
1387 * Also, we must always start a transaction without holding the mutex
1388 * qgroup_ioctl_lock, see btrfs_quota_enable().
1389 */
1390 trans = btrfs_start_transaction(fs_info->tree_root, 1);
1391
1392 mutex_lock(&fs_info->qgroup_ioctl_lock);
1393 if (IS_ERR(trans)) {
1394 ret = PTR_ERR(trans);
1395 trans = NULL;
1396 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1397 goto out;
1398 }
1399
1400 if (!fs_info->quota_root)
1401 goto out;
1402
1403 spin_lock(&fs_info->qgroup_lock);
1404 quota_root = fs_info->quota_root;
1405 fs_info->quota_root = NULL;
1406 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
1407 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_SIMPLE_MODE;
1408 fs_info->qgroup_drop_subtree_thres = BTRFS_QGROUP_DROP_SUBTREE_THRES_DEFAULT;
1409 spin_unlock(&fs_info->qgroup_lock);
1410
1411 btrfs_free_qgroup_config(fs_info);
1412
1413 ret = btrfs_clean_quota_tree(trans, quota_root);
1414 if (ret) {
1415 btrfs_abort_transaction(trans, ret);
1416 goto out;
1417 }
1418
1419 ret = btrfs_del_root(trans, "a_root->root_key);
1420 if (ret) {
1421 btrfs_abort_transaction(trans, ret);
1422 goto out;
1423 }
1424
1425 spin_lock(&fs_info->trans_lock);
1426 list_del("a_root->dirty_list);
1427 spin_unlock(&fs_info->trans_lock);
1428
1429 btrfs_tree_lock(quota_root->node);
1430 btrfs_clear_buffer_dirty(trans, quota_root->node);
1431 btrfs_tree_unlock(quota_root->node);
1432 ret = btrfs_free_tree_block(trans, btrfs_root_id(quota_root),
1433 quota_root->node, 0, 1);
1434
1435 if (ret < 0)
1436 btrfs_abort_transaction(trans, ret);
1437
1438out:
1439 btrfs_put_root(quota_root);
1440 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1441 if (ret && trans)
1442 btrfs_end_transaction(trans);
1443 else if (trans)
1444 ret = btrfs_commit_transaction(trans);
1445 return ret;
1446}
1447
1448static void qgroup_dirty(struct btrfs_fs_info *fs_info,
1449 struct btrfs_qgroup *qgroup)
1450{
1451 if (list_empty(&qgroup->dirty))
1452 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1453}
1454
1455static void qgroup_iterator_add(struct list_head *head, struct btrfs_qgroup *qgroup)
1456{
1457 if (!list_empty(&qgroup->iterator))
1458 return;
1459
1460 list_add_tail(&qgroup->iterator, head);
1461}
1462
1463static void qgroup_iterator_clean(struct list_head *head)
1464{
1465 while (!list_empty(head)) {
1466 struct btrfs_qgroup *qgroup;
1467
1468 qgroup = list_first_entry(head, struct btrfs_qgroup, iterator);
1469 list_del_init(&qgroup->iterator);
1470 }
1471}
1472
1473/*
1474 * The easy accounting, we're updating qgroup relationship whose child qgroup
1475 * only has exclusive extents.
1476 *
1477 * In this case, all exclusive extents will also be exclusive for parent, so
1478 * excl/rfer just get added/removed.
1479 *
1480 * So is qgroup reservation space, which should also be added/removed to
1481 * parent.
1482 * Or when child tries to release reservation space, parent will underflow its
1483 * reservation (for relationship adding case).
1484 *
1485 * Caller should hold fs_info->qgroup_lock.
1486 */
1487static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info, u64 ref_root,
1488 struct btrfs_qgroup *src, int sign)
1489{
1490 struct btrfs_qgroup *qgroup;
1491 struct btrfs_qgroup *cur;
1492 LIST_HEAD(qgroup_list);
1493 u64 num_bytes = src->excl;
1494 int ret = 0;
1495
1496 qgroup = find_qgroup_rb(fs_info, ref_root);
1497 if (!qgroup)
1498 goto out;
1499
1500 qgroup_iterator_add(&qgroup_list, qgroup);
1501 list_for_each_entry(cur, &qgroup_list, iterator) {
1502 struct btrfs_qgroup_list *glist;
1503
1504 qgroup->rfer += sign * num_bytes;
1505 qgroup->rfer_cmpr += sign * num_bytes;
1506
1507 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1508 qgroup->excl += sign * num_bytes;
1509 qgroup->excl_cmpr += sign * num_bytes;
1510
1511 if (sign > 0)
1512 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1513 else
1514 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1515 qgroup_dirty(fs_info, qgroup);
1516
1517 /* Append parent qgroups to @qgroup_list. */
1518 list_for_each_entry(glist, &qgroup->groups, next_group)
1519 qgroup_iterator_add(&qgroup_list, glist->group);
1520 }
1521 ret = 0;
1522out:
1523 qgroup_iterator_clean(&qgroup_list);
1524 return ret;
1525}
1526
1527
1528/*
1529 * Quick path for updating qgroup with only excl refs.
1530 *
1531 * In that case, just update all parent will be enough.
1532 * Or we needs to do a full rescan.
1533 * Caller should also hold fs_info->qgroup_lock.
1534 *
1535 * Return 0 for quick update, return >0 for need to full rescan
1536 * and mark INCONSISTENT flag.
1537 * Return < 0 for other error.
1538 */
1539static int quick_update_accounting(struct btrfs_fs_info *fs_info,
1540 u64 src, u64 dst, int sign)
1541{
1542 struct btrfs_qgroup *qgroup;
1543 int ret = 1;
1544
1545 qgroup = find_qgroup_rb(fs_info, src);
1546 if (!qgroup)
1547 goto out;
1548 if (qgroup->excl == qgroup->rfer) {
1549 ret = __qgroup_excl_accounting(fs_info, dst, qgroup, sign);
1550 if (ret < 0)
1551 goto out;
1552 ret = 0;
1553 }
1554out:
1555 if (ret)
1556 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1557 return ret;
1558}
1559
1560/*
1561 * Add relation between @src and @dst qgroup. The @prealloc is allocated by the
1562 * callers and transferred here (either used or freed on error).
1563 */
1564int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src, u64 dst,
1565 struct btrfs_qgroup_list *prealloc)
1566{
1567 struct btrfs_fs_info *fs_info = trans->fs_info;
1568 struct btrfs_qgroup *parent;
1569 struct btrfs_qgroup *member;
1570 struct btrfs_qgroup_list *list;
1571 int ret = 0;
1572
1573 ASSERT(prealloc);
1574
1575 /* Check the level of src and dst first */
1576 if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst))
1577 return -EINVAL;
1578
1579 mutex_lock(&fs_info->qgroup_ioctl_lock);
1580 if (!fs_info->quota_root) {
1581 ret = -ENOTCONN;
1582 goto out;
1583 }
1584 member = find_qgroup_rb(fs_info, src);
1585 parent = find_qgroup_rb(fs_info, dst);
1586 if (!member || !parent) {
1587 ret = -EINVAL;
1588 goto out;
1589 }
1590
1591 /* check if such qgroup relation exist firstly */
1592 list_for_each_entry(list, &member->groups, next_group) {
1593 if (list->group == parent) {
1594 ret = -EEXIST;
1595 goto out;
1596 }
1597 }
1598
1599 ret = add_qgroup_relation_item(trans, src, dst);
1600 if (ret)
1601 goto out;
1602
1603 ret = add_qgroup_relation_item(trans, dst, src);
1604 if (ret) {
1605 del_qgroup_relation_item(trans, src, dst);
1606 goto out;
1607 }
1608
1609 spin_lock(&fs_info->qgroup_lock);
1610 ret = __add_relation_rb(prealloc, member, parent);
1611 prealloc = NULL;
1612 if (ret < 0) {
1613 spin_unlock(&fs_info->qgroup_lock);
1614 goto out;
1615 }
1616 ret = quick_update_accounting(fs_info, src, dst, 1);
1617 spin_unlock(&fs_info->qgroup_lock);
1618out:
1619 kfree(prealloc);
1620 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1621 return ret;
1622}
1623
1624static int __del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1625 u64 dst)
1626{
1627 struct btrfs_fs_info *fs_info = trans->fs_info;
1628 struct btrfs_qgroup *parent;
1629 struct btrfs_qgroup *member;
1630 struct btrfs_qgroup_list *list;
1631 bool found = false;
1632 int ret = 0;
1633 int ret2;
1634
1635 if (!fs_info->quota_root) {
1636 ret = -ENOTCONN;
1637 goto out;
1638 }
1639
1640 member = find_qgroup_rb(fs_info, src);
1641 parent = find_qgroup_rb(fs_info, dst);
1642 /*
1643 * The parent/member pair doesn't exist, then try to delete the dead
1644 * relation items only.
1645 */
1646 if (!member || !parent)
1647 goto delete_item;
1648
1649 /* check if such qgroup relation exist firstly */
1650 list_for_each_entry(list, &member->groups, next_group) {
1651 if (list->group == parent) {
1652 found = true;
1653 break;
1654 }
1655 }
1656
1657delete_item:
1658 ret = del_qgroup_relation_item(trans, src, dst);
1659 if (ret < 0 && ret != -ENOENT)
1660 goto out;
1661 ret2 = del_qgroup_relation_item(trans, dst, src);
1662 if (ret2 < 0 && ret2 != -ENOENT)
1663 goto out;
1664
1665 /* At least one deletion succeeded, return 0 */
1666 if (!ret || !ret2)
1667 ret = 0;
1668
1669 if (found) {
1670 spin_lock(&fs_info->qgroup_lock);
1671 del_relation_rb(fs_info, src, dst);
1672 ret = quick_update_accounting(fs_info, src, dst, -1);
1673 spin_unlock(&fs_info->qgroup_lock);
1674 }
1675out:
1676 return ret;
1677}
1678
1679int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1680 u64 dst)
1681{
1682 struct btrfs_fs_info *fs_info = trans->fs_info;
1683 int ret = 0;
1684
1685 mutex_lock(&fs_info->qgroup_ioctl_lock);
1686 ret = __del_qgroup_relation(trans, src, dst);
1687 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1688
1689 return ret;
1690}
1691
1692int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1693{
1694 struct btrfs_fs_info *fs_info = trans->fs_info;
1695 struct btrfs_root *quota_root;
1696 struct btrfs_qgroup *qgroup;
1697 struct btrfs_qgroup *prealloc = NULL;
1698 int ret = 0;
1699
1700 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED)
1701 return 0;
1702
1703 mutex_lock(&fs_info->qgroup_ioctl_lock);
1704 if (!fs_info->quota_root) {
1705 ret = -ENOTCONN;
1706 goto out;
1707 }
1708 quota_root = fs_info->quota_root;
1709 qgroup = find_qgroup_rb(fs_info, qgroupid);
1710 if (qgroup) {
1711 ret = -EEXIST;
1712 goto out;
1713 }
1714
1715 prealloc = kzalloc(sizeof(*prealloc), GFP_NOFS);
1716 if (!prealloc) {
1717 ret = -ENOMEM;
1718 goto out;
1719 }
1720
1721 ret = add_qgroup_item(trans, quota_root, qgroupid);
1722 if (ret)
1723 goto out;
1724
1725 spin_lock(&fs_info->qgroup_lock);
1726 qgroup = add_qgroup_rb(fs_info, prealloc, qgroupid);
1727 spin_unlock(&fs_info->qgroup_lock);
1728 prealloc = NULL;
1729
1730 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1731out:
1732 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1733 kfree(prealloc);
1734 return ret;
1735}
1736
1737/*
1738 * Return 0 if we can not delete the qgroup (not empty or has children etc).
1739 * Return >0 if we can delete the qgroup.
1740 * Return <0 for other errors during tree search.
1741 */
1742static int can_delete_qgroup(struct btrfs_fs_info *fs_info, struct btrfs_qgroup *qgroup)
1743{
1744 struct btrfs_key key;
1745 struct btrfs_path *path;
1746 int ret;
1747
1748 /*
1749 * Squota would never be inconsistent, but there can still be case
1750 * where a dropped subvolume still has qgroup numbers, and squota
1751 * relies on such qgroup for future accounting.
1752 *
1753 * So for squota, do not allow dropping any non-zero qgroup.
1754 */
1755 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE &&
1756 (qgroup->rfer || qgroup->excl || qgroup->excl_cmpr || qgroup->rfer_cmpr))
1757 return 0;
1758
1759 /* For higher level qgroup, we can only delete it if it has no child. */
1760 if (btrfs_qgroup_level(qgroup->qgroupid)) {
1761 if (!list_empty(&qgroup->members))
1762 return 0;
1763 return 1;
1764 }
1765
1766 /*
1767 * For level-0 qgroups, we can only delete it if it has no subvolume
1768 * for it.
1769 * This means even a subvolume is unlinked but not yet fully dropped,
1770 * we can not delete the qgroup.
1771 */
1772 key.objectid = qgroup->qgroupid;
1773 key.type = BTRFS_ROOT_ITEM_KEY;
1774 key.offset = -1ULL;
1775 path = btrfs_alloc_path();
1776 if (!path)
1777 return -ENOMEM;
1778
1779 ret = btrfs_find_root(fs_info->tree_root, &key, path, NULL, NULL);
1780 btrfs_free_path(path);
1781 /*
1782 * The @ret from btrfs_find_root() exactly matches our definition for
1783 * the return value, thus can be returned directly.
1784 */
1785 return ret;
1786}
1787
1788int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1789{
1790 struct btrfs_fs_info *fs_info = trans->fs_info;
1791 struct btrfs_qgroup *qgroup;
1792 struct btrfs_qgroup_list *list;
1793 int ret = 0;
1794
1795 mutex_lock(&fs_info->qgroup_ioctl_lock);
1796 if (!fs_info->quota_root) {
1797 ret = -ENOTCONN;
1798 goto out;
1799 }
1800
1801 qgroup = find_qgroup_rb(fs_info, qgroupid);
1802 if (!qgroup) {
1803 ret = -ENOENT;
1804 goto out;
1805 }
1806
1807 ret = can_delete_qgroup(fs_info, qgroup);
1808 if (ret < 0)
1809 goto out;
1810 if (ret == 0) {
1811 ret = -EBUSY;
1812 goto out;
1813 }
1814
1815 /* Check if there are no children of this qgroup */
1816 if (!list_empty(&qgroup->members)) {
1817 ret = -EBUSY;
1818 goto out;
1819 }
1820
1821 ret = del_qgroup_item(trans, qgroupid);
1822 if (ret && ret != -ENOENT)
1823 goto out;
1824
1825 while (!list_empty(&qgroup->groups)) {
1826 list = list_first_entry(&qgroup->groups,
1827 struct btrfs_qgroup_list, next_group);
1828 ret = __del_qgroup_relation(trans, qgroupid,
1829 list->group->qgroupid);
1830 if (ret)
1831 goto out;
1832 }
1833
1834 spin_lock(&fs_info->qgroup_lock);
1835 /*
1836 * Warn on reserved space. The subvolume should has no child nor
1837 * corresponding subvolume.
1838 * Thus its reserved space should all be zero, no matter if qgroup
1839 * is consistent or the mode.
1840 */
1841 if (qgroup->rsv.values[BTRFS_QGROUP_RSV_DATA] ||
1842 qgroup->rsv.values[BTRFS_QGROUP_RSV_META_PREALLOC] ||
1843 qgroup->rsv.values[BTRFS_QGROUP_RSV_META_PERTRANS]) {
1844 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
1845 btrfs_warn_rl(fs_info,
1846"to be deleted qgroup %u/%llu has non-zero numbers, data %llu meta prealloc %llu meta pertrans %llu",
1847 btrfs_qgroup_level(qgroup->qgroupid),
1848 btrfs_qgroup_subvolid(qgroup->qgroupid),
1849 qgroup->rsv.values[BTRFS_QGROUP_RSV_DATA],
1850 qgroup->rsv.values[BTRFS_QGROUP_RSV_META_PREALLOC],
1851 qgroup->rsv.values[BTRFS_QGROUP_RSV_META_PERTRANS]);
1852
1853 }
1854 /*
1855 * The same for rfer/excl numbers, but that's only if our qgroup is
1856 * consistent and if it's in regular qgroup mode.
1857 * For simple mode it's not as accurate thus we can hit non-zero values
1858 * very frequently.
1859 */
1860 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_FULL &&
1861 !(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT)) {
1862 if (qgroup->rfer || qgroup->excl ||
1863 qgroup->rfer_cmpr || qgroup->excl_cmpr) {
1864 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
1865 btrfs_warn_rl(fs_info,
1866"to be deleted qgroup %u/%llu has non-zero numbers, rfer %llu rfer_cmpr %llu excl %llu excl_cmpr %llu",
1867 btrfs_qgroup_level(qgroup->qgroupid),
1868 btrfs_qgroup_subvolid(qgroup->qgroupid),
1869 qgroup->rfer, qgroup->rfer_cmpr,
1870 qgroup->excl, qgroup->excl_cmpr);
1871 qgroup_mark_inconsistent(fs_info);
1872 }
1873 }
1874 del_qgroup_rb(fs_info, qgroupid);
1875 spin_unlock(&fs_info->qgroup_lock);
1876
1877 /*
1878 * Remove the qgroup from sysfs now without holding the qgroup_lock
1879 * spinlock, since the sysfs_remove_group() function needs to take
1880 * the mutex kernfs_mutex through kernfs_remove_by_name_ns().
1881 */
1882 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
1883 kfree(qgroup);
1884out:
1885 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1886 return ret;
1887}
1888
1889int btrfs_qgroup_cleanup_dropped_subvolume(struct btrfs_fs_info *fs_info, u64 subvolid)
1890{
1891 struct btrfs_trans_handle *trans;
1892 int ret;
1893
1894 if (!is_fstree(subvolid) || !btrfs_qgroup_enabled(fs_info) || !fs_info->quota_root)
1895 return 0;
1896
1897 /*
1898 * Commit current transaction to make sure all the rfer/excl numbers
1899 * get updated.
1900 */
1901 trans = btrfs_start_transaction(fs_info->quota_root, 0);
1902 if (IS_ERR(trans))
1903 return PTR_ERR(trans);
1904
1905 ret = btrfs_commit_transaction(trans);
1906 if (ret < 0)
1907 return ret;
1908
1909 /* Start new trans to delete the qgroup info and limit items. */
1910 trans = btrfs_start_transaction(fs_info->quota_root, 2);
1911 if (IS_ERR(trans))
1912 return PTR_ERR(trans);
1913 ret = btrfs_remove_qgroup(trans, subvolid);
1914 btrfs_end_transaction(trans);
1915 /*
1916 * It's squota and the subvolume still has numbers needed for future
1917 * accounting, in this case we can not delete it. Just skip it.
1918 *
1919 * Or the qgroup is already removed by a qgroup rescan. For both cases we're
1920 * safe to ignore them.
1921 */
1922 if (ret == -EBUSY || ret == -ENOENT)
1923 ret = 0;
1924 return ret;
1925}
1926
1927int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
1928 struct btrfs_qgroup_limit *limit)
1929{
1930 struct btrfs_fs_info *fs_info = trans->fs_info;
1931 struct btrfs_qgroup *qgroup;
1932 int ret = 0;
1933 /* Sometimes we would want to clear the limit on this qgroup.
1934 * To meet this requirement, we treat the -1 as a special value
1935 * which tell kernel to clear the limit on this qgroup.
1936 */
1937 const u64 CLEAR_VALUE = -1;
1938
1939 mutex_lock(&fs_info->qgroup_ioctl_lock);
1940 if (!fs_info->quota_root) {
1941 ret = -ENOTCONN;
1942 goto out;
1943 }
1944
1945 qgroup = find_qgroup_rb(fs_info, qgroupid);
1946 if (!qgroup) {
1947 ret = -ENOENT;
1948 goto out;
1949 }
1950
1951 spin_lock(&fs_info->qgroup_lock);
1952 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) {
1953 if (limit->max_rfer == CLEAR_VALUE) {
1954 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1955 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1956 qgroup->max_rfer = 0;
1957 } else {
1958 qgroup->max_rfer = limit->max_rfer;
1959 }
1960 }
1961 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
1962 if (limit->max_excl == CLEAR_VALUE) {
1963 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1964 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1965 qgroup->max_excl = 0;
1966 } else {
1967 qgroup->max_excl = limit->max_excl;
1968 }
1969 }
1970 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) {
1971 if (limit->rsv_rfer == CLEAR_VALUE) {
1972 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1973 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1974 qgroup->rsv_rfer = 0;
1975 } else {
1976 qgroup->rsv_rfer = limit->rsv_rfer;
1977 }
1978 }
1979 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) {
1980 if (limit->rsv_excl == CLEAR_VALUE) {
1981 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1982 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1983 qgroup->rsv_excl = 0;
1984 } else {
1985 qgroup->rsv_excl = limit->rsv_excl;
1986 }
1987 }
1988 qgroup->lim_flags |= limit->flags;
1989
1990 spin_unlock(&fs_info->qgroup_lock);
1991
1992 ret = update_qgroup_limit_item(trans, qgroup);
1993 if (ret) {
1994 qgroup_mark_inconsistent(fs_info);
1995 btrfs_info(fs_info, "unable to update quota limit for %llu",
1996 qgroupid);
1997 }
1998
1999out:
2000 mutex_unlock(&fs_info->qgroup_ioctl_lock);
2001 return ret;
2002}
2003
2004/*
2005 * Inform qgroup to trace one dirty extent, its info is recorded in @record.
2006 * So qgroup can account it at transaction committing time.
2007 *
2008 * No lock version, caller must acquire delayed ref lock and allocated memory,
2009 * then call btrfs_qgroup_trace_extent_post() after exiting lock context.
2010 *
2011 * Return 0 for success insert
2012 * Return >0 for existing record, caller can free @record safely.
2013 * Return <0 for insertion failure, caller can free @record safely.
2014 */
2015int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info,
2016 struct btrfs_delayed_ref_root *delayed_refs,
2017 struct btrfs_qgroup_extent_record *record,
2018 u64 bytenr)
2019{
2020 struct btrfs_qgroup_extent_record *existing, *ret;
2021 const unsigned long index = (bytenr >> fs_info->sectorsize_bits);
2022
2023 if (!btrfs_qgroup_full_accounting(fs_info))
2024 return 1;
2025
2026#if BITS_PER_LONG == 32
2027 if (bytenr >= MAX_LFS_FILESIZE) {
2028 btrfs_err_rl(fs_info,
2029"qgroup record for extent at %llu is beyond 32bit page cache and xarray index limit",
2030 bytenr);
2031 btrfs_err_32bit_limit(fs_info);
2032 return -EOVERFLOW;
2033 }
2034#endif
2035
2036 trace_btrfs_qgroup_trace_extent(fs_info, record, bytenr);
2037
2038 xa_lock(&delayed_refs->dirty_extents);
2039 existing = xa_load(&delayed_refs->dirty_extents, index);
2040 if (existing) {
2041 if (record->data_rsv && !existing->data_rsv) {
2042 existing->data_rsv = record->data_rsv;
2043 existing->data_rsv_refroot = record->data_rsv_refroot;
2044 }
2045 xa_unlock(&delayed_refs->dirty_extents);
2046 return 1;
2047 }
2048
2049 ret = __xa_store(&delayed_refs->dirty_extents, index, record, GFP_ATOMIC);
2050 xa_unlock(&delayed_refs->dirty_extents);
2051 if (xa_is_err(ret)) {
2052 qgroup_mark_inconsistent(fs_info);
2053 return xa_err(ret);
2054 }
2055
2056 return 0;
2057}
2058
2059/*
2060 * Post handler after qgroup_trace_extent_nolock().
2061 *
2062 * NOTE: Current qgroup does the expensive backref walk at transaction
2063 * committing time with TRANS_STATE_COMMIT_DOING, this blocks incoming
2064 * new transaction.
2065 * This is designed to allow btrfs_find_all_roots() to get correct new_roots
2066 * result.
2067 *
2068 * However for old_roots there is no need to do backref walk at that time,
2069 * since we search commit roots to walk backref and result will always be
2070 * correct.
2071 *
2072 * Due to the nature of no lock version, we can't do backref there.
2073 * So we must call btrfs_qgroup_trace_extent_post() after exiting
2074 * spinlock context.
2075 *
2076 * TODO: If we can fix and prove btrfs_find_all_roots() can get correct result
2077 * using current root, then we can move all expensive backref walk out of
2078 * transaction committing, but not now as qgroup accounting will be wrong again.
2079 */
2080int btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle *trans,
2081 struct btrfs_qgroup_extent_record *qrecord,
2082 u64 bytenr)
2083{
2084 struct btrfs_fs_info *fs_info = trans->fs_info;
2085 struct btrfs_backref_walk_ctx ctx = {
2086 .bytenr = bytenr,
2087 .fs_info = fs_info,
2088 };
2089 int ret;
2090
2091 if (!btrfs_qgroup_full_accounting(fs_info))
2092 return 0;
2093 /*
2094 * We are always called in a context where we are already holding a
2095 * transaction handle. Often we are called when adding a data delayed
2096 * reference from btrfs_truncate_inode_items() (truncating or unlinking),
2097 * in which case we will be holding a write lock on extent buffer from a
2098 * subvolume tree. In this case we can't allow btrfs_find_all_roots() to
2099 * acquire fs_info->commit_root_sem, because that is a higher level lock
2100 * that must be acquired before locking any extent buffers.
2101 *
2102 * So we want btrfs_find_all_roots() to not acquire the commit_root_sem
2103 * but we can't pass it a non-NULL transaction handle, because otherwise
2104 * it would not use commit roots and would lock extent buffers, causing
2105 * a deadlock if it ends up trying to read lock the same extent buffer
2106 * that was previously write locked at btrfs_truncate_inode_items().
2107 *
2108 * So pass a NULL transaction handle to btrfs_find_all_roots() and
2109 * explicitly tell it to not acquire the commit_root_sem - if we are
2110 * holding a transaction handle we don't need its protection.
2111 */
2112 ASSERT(trans != NULL);
2113
2114 if (fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
2115 return 0;
2116
2117 ret = btrfs_find_all_roots(&ctx, true);
2118 if (ret < 0) {
2119 qgroup_mark_inconsistent(fs_info);
2120 btrfs_warn(fs_info,
2121"error accounting new delayed refs extent (err code: %d), quota inconsistent",
2122 ret);
2123 return 0;
2124 }
2125
2126 /*
2127 * Here we don't need to get the lock of
2128 * trans->transaction->delayed_refs, since inserted qrecord won't
2129 * be deleted, only qrecord->node may be modified (new qrecord insert)
2130 *
2131 * So modifying qrecord->old_roots is safe here
2132 */
2133 qrecord->old_roots = ctx.roots;
2134 return 0;
2135}
2136
2137/*
2138 * Inform qgroup to trace one dirty extent, specified by @bytenr and
2139 * @num_bytes.
2140 * So qgroup can account it at commit trans time.
2141 *
2142 * Better encapsulated version, with memory allocation and backref walk for
2143 * commit roots.
2144 * So this can sleep.
2145 *
2146 * Return 0 if the operation is done.
2147 * Return <0 for error, like memory allocation failure or invalid parameter
2148 * (NULL trans)
2149 */
2150int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
2151 u64 num_bytes)
2152{
2153 struct btrfs_fs_info *fs_info = trans->fs_info;
2154 struct btrfs_qgroup_extent_record *record;
2155 struct btrfs_delayed_ref_root *delayed_refs = &trans->transaction->delayed_refs;
2156 const unsigned long index = (bytenr >> fs_info->sectorsize_bits);
2157 int ret;
2158
2159 if (!btrfs_qgroup_full_accounting(fs_info) || bytenr == 0 || num_bytes == 0)
2160 return 0;
2161 record = kzalloc(sizeof(*record), GFP_NOFS);
2162 if (!record)
2163 return -ENOMEM;
2164
2165 if (xa_reserve(&delayed_refs->dirty_extents, index, GFP_NOFS)) {
2166 kfree(record);
2167 return -ENOMEM;
2168 }
2169
2170 record->num_bytes = num_bytes;
2171
2172 ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record, bytenr);
2173 if (ret) {
2174 /* Clean up if insertion fails or item exists. */
2175 xa_release(&delayed_refs->dirty_extents, index);
2176 kfree(record);
2177 return 0;
2178 }
2179 return btrfs_qgroup_trace_extent_post(trans, record, bytenr);
2180}
2181
2182/*
2183 * Inform qgroup to trace all leaf items of data
2184 *
2185 * Return 0 for success
2186 * Return <0 for error(ENOMEM)
2187 */
2188int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
2189 struct extent_buffer *eb)
2190{
2191 struct btrfs_fs_info *fs_info = trans->fs_info;
2192 int nr = btrfs_header_nritems(eb);
2193 int i, extent_type, ret;
2194 struct btrfs_key key;
2195 struct btrfs_file_extent_item *fi;
2196 u64 bytenr, num_bytes;
2197
2198 /* We can be called directly from walk_up_proc() */
2199 if (!btrfs_qgroup_full_accounting(fs_info))
2200 return 0;
2201
2202 for (i = 0; i < nr; i++) {
2203 btrfs_item_key_to_cpu(eb, &key, i);
2204
2205 if (key.type != BTRFS_EXTENT_DATA_KEY)
2206 continue;
2207
2208 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
2209 /* filter out non qgroup-accountable extents */
2210 extent_type = btrfs_file_extent_type(eb, fi);
2211
2212 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
2213 continue;
2214
2215 bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
2216 if (!bytenr)
2217 continue;
2218
2219 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
2220
2221 ret = btrfs_qgroup_trace_extent(trans, bytenr, num_bytes);
2222 if (ret)
2223 return ret;
2224 }
2225 cond_resched();
2226 return 0;
2227}
2228
2229/*
2230 * Walk up the tree from the bottom, freeing leaves and any interior
2231 * nodes which have had all slots visited. If a node (leaf or
2232 * interior) is freed, the node above it will have it's slot
2233 * incremented. The root node will never be freed.
2234 *
2235 * At the end of this function, we should have a path which has all
2236 * slots incremented to the next position for a search. If we need to
2237 * read a new node it will be NULL and the node above it will have the
2238 * correct slot selected for a later read.
2239 *
2240 * If we increment the root nodes slot counter past the number of
2241 * elements, 1 is returned to signal completion of the search.
2242 */
2243static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
2244{
2245 int level = 0;
2246 int nr, slot;
2247 struct extent_buffer *eb;
2248
2249 if (root_level == 0)
2250 return 1;
2251
2252 while (level <= root_level) {
2253 eb = path->nodes[level];
2254 nr = btrfs_header_nritems(eb);
2255 path->slots[level]++;
2256 slot = path->slots[level];
2257 if (slot >= nr || level == 0) {
2258 /*
2259 * Don't free the root - we will detect this
2260 * condition after our loop and return a
2261 * positive value for caller to stop walking the tree.
2262 */
2263 if (level != root_level) {
2264 btrfs_tree_unlock_rw(eb, path->locks[level]);
2265 path->locks[level] = 0;
2266
2267 free_extent_buffer(eb);
2268 path->nodes[level] = NULL;
2269 path->slots[level] = 0;
2270 }
2271 } else {
2272 /*
2273 * We have a valid slot to walk back down
2274 * from. Stop here so caller can process these
2275 * new nodes.
2276 */
2277 break;
2278 }
2279
2280 level++;
2281 }
2282
2283 eb = path->nodes[root_level];
2284 if (path->slots[root_level] >= btrfs_header_nritems(eb))
2285 return 1;
2286
2287 return 0;
2288}
2289
2290/*
2291 * Helper function to trace a subtree tree block swap.
2292 *
2293 * The swap will happen in highest tree block, but there may be a lot of
2294 * tree blocks involved.
2295 *
2296 * For example:
2297 * OO = Old tree blocks
2298 * NN = New tree blocks allocated during balance
2299 *
2300 * File tree (257) Reloc tree for 257
2301 * L2 OO NN
2302 * / \ / \
2303 * L1 OO OO (a) OO NN (a)
2304 * / \ / \ / \ / \
2305 * L0 OO OO OO OO OO OO NN NN
2306 * (b) (c) (b) (c)
2307 *
2308 * When calling qgroup_trace_extent_swap(), we will pass:
2309 * @src_eb = OO(a)
2310 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
2311 * @dst_level = 0
2312 * @root_level = 1
2313 *
2314 * In that case, qgroup_trace_extent_swap() will search from OO(a) to
2315 * reach OO(c), then mark both OO(c) and NN(c) as qgroup dirty.
2316 *
2317 * The main work of qgroup_trace_extent_swap() can be split into 3 parts:
2318 *
2319 * 1) Tree search from @src_eb
2320 * It should acts as a simplified btrfs_search_slot().
2321 * The key for search can be extracted from @dst_path->nodes[dst_level]
2322 * (first key).
2323 *
2324 * 2) Mark the final tree blocks in @src_path and @dst_path qgroup dirty
2325 * NOTE: In above case, OO(a) and NN(a) won't be marked qgroup dirty.
2326 * They should be marked during previous (@dst_level = 1) iteration.
2327 *
2328 * 3) Mark file extents in leaves dirty
2329 * We don't have good way to pick out new file extents only.
2330 * So we still follow the old method by scanning all file extents in
2331 * the leave.
2332 *
2333 * This function can free us from keeping two paths, thus later we only need
2334 * to care about how to iterate all new tree blocks in reloc tree.
2335 */
2336static int qgroup_trace_extent_swap(struct btrfs_trans_handle* trans,
2337 struct extent_buffer *src_eb,
2338 struct btrfs_path *dst_path,
2339 int dst_level, int root_level,
2340 bool trace_leaf)
2341{
2342 struct btrfs_key key;
2343 struct btrfs_path *src_path;
2344 struct btrfs_fs_info *fs_info = trans->fs_info;
2345 u32 nodesize = fs_info->nodesize;
2346 int cur_level = root_level;
2347 int ret;
2348
2349 BUG_ON(dst_level > root_level);
2350 /* Level mismatch */
2351 if (btrfs_header_level(src_eb) != root_level)
2352 return -EINVAL;
2353
2354 src_path = btrfs_alloc_path();
2355 if (!src_path) {
2356 ret = -ENOMEM;
2357 goto out;
2358 }
2359
2360 if (dst_level)
2361 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2362 else
2363 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2364
2365 /* For src_path */
2366 atomic_inc(&src_eb->refs);
2367 src_path->nodes[root_level] = src_eb;
2368 src_path->slots[root_level] = dst_path->slots[root_level];
2369 src_path->locks[root_level] = 0;
2370
2371 /* A simplified version of btrfs_search_slot() */
2372 while (cur_level >= dst_level) {
2373 struct btrfs_key src_key;
2374 struct btrfs_key dst_key;
2375
2376 if (src_path->nodes[cur_level] == NULL) {
2377 struct extent_buffer *eb;
2378 int parent_slot;
2379
2380 eb = src_path->nodes[cur_level + 1];
2381 parent_slot = src_path->slots[cur_level + 1];
2382
2383 eb = btrfs_read_node_slot(eb, parent_slot);
2384 if (IS_ERR(eb)) {
2385 ret = PTR_ERR(eb);
2386 goto out;
2387 }
2388
2389 src_path->nodes[cur_level] = eb;
2390
2391 btrfs_tree_read_lock(eb);
2392 src_path->locks[cur_level] = BTRFS_READ_LOCK;
2393 }
2394
2395 src_path->slots[cur_level] = dst_path->slots[cur_level];
2396 if (cur_level) {
2397 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
2398 &dst_key, dst_path->slots[cur_level]);
2399 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
2400 &src_key, src_path->slots[cur_level]);
2401 } else {
2402 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
2403 &dst_key, dst_path->slots[cur_level]);
2404 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
2405 &src_key, src_path->slots[cur_level]);
2406 }
2407 /* Content mismatch, something went wrong */
2408 if (btrfs_comp_cpu_keys(&dst_key, &src_key)) {
2409 ret = -ENOENT;
2410 goto out;
2411 }
2412 cur_level--;
2413 }
2414
2415 /*
2416 * Now both @dst_path and @src_path have been populated, record the tree
2417 * blocks for qgroup accounting.
2418 */
2419 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
2420 nodesize);
2421 if (ret < 0)
2422 goto out;
2423 ret = btrfs_qgroup_trace_extent(trans, dst_path->nodes[dst_level]->start,
2424 nodesize);
2425 if (ret < 0)
2426 goto out;
2427
2428 /* Record leaf file extents */
2429 if (dst_level == 0 && trace_leaf) {
2430 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
2431 if (ret < 0)
2432 goto out;
2433 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
2434 }
2435out:
2436 btrfs_free_path(src_path);
2437 return ret;
2438}
2439
2440/*
2441 * Helper function to do recursive generation-aware depth-first search, to
2442 * locate all new tree blocks in a subtree of reloc tree.
2443 *
2444 * E.g. (OO = Old tree blocks, NN = New tree blocks, whose gen == last_snapshot)
2445 * reloc tree
2446 * L2 NN (a)
2447 * / \
2448 * L1 OO NN (b)
2449 * / \ / \
2450 * L0 OO OO OO NN
2451 * (c) (d)
2452 * If we pass:
2453 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
2454 * @cur_level = 1
2455 * @root_level = 1
2456 *
2457 * We will iterate through tree blocks NN(b), NN(d) and info qgroup to trace
2458 * above tree blocks along with their counter parts in file tree.
2459 * While during search, old tree blocks OO(c) will be skipped as tree block swap
2460 * won't affect OO(c).
2461 */
2462static int qgroup_trace_new_subtree_blocks(struct btrfs_trans_handle* trans,
2463 struct extent_buffer *src_eb,
2464 struct btrfs_path *dst_path,
2465 int cur_level, int root_level,
2466 u64 last_snapshot, bool trace_leaf)
2467{
2468 struct btrfs_fs_info *fs_info = trans->fs_info;
2469 struct extent_buffer *eb;
2470 bool need_cleanup = false;
2471 int ret = 0;
2472 int i;
2473
2474 /* Level sanity check */
2475 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 ||
2476 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
2477 root_level < cur_level) {
2478 btrfs_err_rl(fs_info,
2479 "%s: bad levels, cur_level=%d root_level=%d",
2480 __func__, cur_level, root_level);
2481 return -EUCLEAN;
2482 }
2483
2484 /* Read the tree block if needed */
2485 if (dst_path->nodes[cur_level] == NULL) {
2486 int parent_slot;
2487 u64 child_gen;
2488
2489 /*
2490 * dst_path->nodes[root_level] must be initialized before
2491 * calling this function.
2492 */
2493 if (cur_level == root_level) {
2494 btrfs_err_rl(fs_info,
2495 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2496 __func__, root_level, root_level, cur_level);
2497 return -EUCLEAN;
2498 }
2499
2500 /*
2501 * We need to get child blockptr/gen from parent before we can
2502 * read it.
2503 */
2504 eb = dst_path->nodes[cur_level + 1];
2505 parent_slot = dst_path->slots[cur_level + 1];
2506 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
2507
2508 /* This node is old, no need to trace */
2509 if (child_gen < last_snapshot)
2510 goto out;
2511
2512 eb = btrfs_read_node_slot(eb, parent_slot);
2513 if (IS_ERR(eb)) {
2514 ret = PTR_ERR(eb);
2515 goto out;
2516 }
2517
2518 dst_path->nodes[cur_level] = eb;
2519 dst_path->slots[cur_level] = 0;
2520
2521 btrfs_tree_read_lock(eb);
2522 dst_path->locks[cur_level] = BTRFS_READ_LOCK;
2523 need_cleanup = true;
2524 }
2525
2526 /* Now record this tree block and its counter part for qgroups */
2527 ret = qgroup_trace_extent_swap(trans, src_eb, dst_path, cur_level,
2528 root_level, trace_leaf);
2529 if (ret < 0)
2530 goto cleanup;
2531
2532 eb = dst_path->nodes[cur_level];
2533
2534 if (cur_level > 0) {
2535 /* Iterate all child tree blocks */
2536 for (i = 0; i < btrfs_header_nritems(eb); i++) {
2537 /* Skip old tree blocks as they won't be swapped */
2538 if (btrfs_node_ptr_generation(eb, i) < last_snapshot)
2539 continue;
2540 dst_path->slots[cur_level] = i;
2541
2542 /* Recursive call (at most 7 times) */
2543 ret = qgroup_trace_new_subtree_blocks(trans, src_eb,
2544 dst_path, cur_level - 1, root_level,
2545 last_snapshot, trace_leaf);
2546 if (ret < 0)
2547 goto cleanup;
2548 }
2549 }
2550
2551cleanup:
2552 if (need_cleanup) {
2553 /* Clean up */
2554 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2555 dst_path->locks[cur_level]);
2556 free_extent_buffer(dst_path->nodes[cur_level]);
2557 dst_path->nodes[cur_level] = NULL;
2558 dst_path->slots[cur_level] = 0;
2559 dst_path->locks[cur_level] = 0;
2560 }
2561out:
2562 return ret;
2563}
2564
2565static int qgroup_trace_subtree_swap(struct btrfs_trans_handle *trans,
2566 struct extent_buffer *src_eb,
2567 struct extent_buffer *dst_eb,
2568 u64 last_snapshot, bool trace_leaf)
2569{
2570 struct btrfs_fs_info *fs_info = trans->fs_info;
2571 struct btrfs_path *dst_path = NULL;
2572 int level;
2573 int ret;
2574
2575 if (!btrfs_qgroup_full_accounting(fs_info))
2576 return 0;
2577
2578 /* Wrong parameter order */
2579 if (btrfs_header_generation(src_eb) > btrfs_header_generation(dst_eb)) {
2580 btrfs_err_rl(fs_info,
2581 "%s: bad parameter order, src_gen=%llu dst_gen=%llu", __func__,
2582 btrfs_header_generation(src_eb),
2583 btrfs_header_generation(dst_eb));
2584 return -EUCLEAN;
2585 }
2586
2587 if (!extent_buffer_uptodate(src_eb) || !extent_buffer_uptodate(dst_eb)) {
2588 ret = -EIO;
2589 goto out;
2590 }
2591
2592 level = btrfs_header_level(dst_eb);
2593 dst_path = btrfs_alloc_path();
2594 if (!dst_path) {
2595 ret = -ENOMEM;
2596 goto out;
2597 }
2598 /* For dst_path */
2599 atomic_inc(&dst_eb->refs);
2600 dst_path->nodes[level] = dst_eb;
2601 dst_path->slots[level] = 0;
2602 dst_path->locks[level] = 0;
2603
2604 /* Do the generation aware breadth-first search */
2605 ret = qgroup_trace_new_subtree_blocks(trans, src_eb, dst_path, level,
2606 level, last_snapshot, trace_leaf);
2607 if (ret < 0)
2608 goto out;
2609 ret = 0;
2610
2611out:
2612 btrfs_free_path(dst_path);
2613 if (ret < 0)
2614 qgroup_mark_inconsistent(fs_info);
2615 return ret;
2616}
2617
2618/*
2619 * Inform qgroup to trace a whole subtree, including all its child tree
2620 * blocks and data.
2621 * The root tree block is specified by @root_eb.
2622 *
2623 * Normally used by relocation(tree block swap) and subvolume deletion.
2624 *
2625 * Return 0 for success
2626 * Return <0 for error(ENOMEM or tree search error)
2627 */
2628int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
2629 struct extent_buffer *root_eb,
2630 u64 root_gen, int root_level)
2631{
2632 struct btrfs_fs_info *fs_info = trans->fs_info;
2633 int ret = 0;
2634 int level;
2635 u8 drop_subptree_thres;
2636 struct extent_buffer *eb = root_eb;
2637 struct btrfs_path *path = NULL;
2638
2639 ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL);
2640 ASSERT(root_eb != NULL);
2641
2642 if (!btrfs_qgroup_full_accounting(fs_info))
2643 return 0;
2644
2645 spin_lock(&fs_info->qgroup_lock);
2646 drop_subptree_thres = fs_info->qgroup_drop_subtree_thres;
2647 spin_unlock(&fs_info->qgroup_lock);
2648
2649 /*
2650 * This function only gets called for snapshot drop, if we hit a high
2651 * node here, it means we are going to change ownership for quite a lot
2652 * of extents, which will greatly slow down btrfs_commit_transaction().
2653 *
2654 * So here if we find a high tree here, we just skip the accounting and
2655 * mark qgroup inconsistent.
2656 */
2657 if (root_level >= drop_subptree_thres) {
2658 qgroup_mark_inconsistent(fs_info);
2659 return 0;
2660 }
2661
2662 if (!extent_buffer_uptodate(root_eb)) {
2663 struct btrfs_tree_parent_check check = {
2664 .transid = root_gen,
2665 .level = root_level
2666 };
2667
2668 ret = btrfs_read_extent_buffer(root_eb, &check);
2669 if (ret)
2670 goto out;
2671 }
2672
2673 if (root_level == 0) {
2674 ret = btrfs_qgroup_trace_leaf_items(trans, root_eb);
2675 goto out;
2676 }
2677
2678 path = btrfs_alloc_path();
2679 if (!path)
2680 return -ENOMEM;
2681
2682 /*
2683 * Walk down the tree. Missing extent blocks are filled in as
2684 * we go. Metadata is accounted every time we read a new
2685 * extent block.
2686 *
2687 * When we reach a leaf, we account for file extent items in it,
2688 * walk back up the tree (adjusting slot pointers as we go)
2689 * and restart the search process.
2690 */
2691 atomic_inc(&root_eb->refs); /* For path */
2692 path->nodes[root_level] = root_eb;
2693 path->slots[root_level] = 0;
2694 path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
2695walk_down:
2696 level = root_level;
2697 while (level >= 0) {
2698 if (path->nodes[level] == NULL) {
2699 int parent_slot;
2700 u64 child_bytenr;
2701
2702 /*
2703 * We need to get child blockptr from parent before we
2704 * can read it.
2705 */
2706 eb = path->nodes[level + 1];
2707 parent_slot = path->slots[level + 1];
2708 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
2709
2710 eb = btrfs_read_node_slot(eb, parent_slot);
2711 if (IS_ERR(eb)) {
2712 ret = PTR_ERR(eb);
2713 goto out;
2714 }
2715
2716 path->nodes[level] = eb;
2717 path->slots[level] = 0;
2718
2719 btrfs_tree_read_lock(eb);
2720 path->locks[level] = BTRFS_READ_LOCK;
2721
2722 ret = btrfs_qgroup_trace_extent(trans, child_bytenr,
2723 fs_info->nodesize);
2724 if (ret)
2725 goto out;
2726 }
2727
2728 if (level == 0) {
2729 ret = btrfs_qgroup_trace_leaf_items(trans,
2730 path->nodes[level]);
2731 if (ret)
2732 goto out;
2733
2734 /* Nonzero return here means we completed our search */
2735 ret = adjust_slots_upwards(path, root_level);
2736 if (ret)
2737 break;
2738
2739 /* Restart search with new slots */
2740 goto walk_down;
2741 }
2742
2743 level--;
2744 }
2745
2746 ret = 0;
2747out:
2748 btrfs_free_path(path);
2749
2750 return ret;
2751}
2752
2753static void qgroup_iterator_nested_add(struct list_head *head, struct btrfs_qgroup *qgroup)
2754{
2755 if (!list_empty(&qgroup->nested_iterator))
2756 return;
2757
2758 list_add_tail(&qgroup->nested_iterator, head);
2759}
2760
2761static void qgroup_iterator_nested_clean(struct list_head *head)
2762{
2763 while (!list_empty(head)) {
2764 struct btrfs_qgroup *qgroup;
2765
2766 qgroup = list_first_entry(head, struct btrfs_qgroup, nested_iterator);
2767 list_del_init(&qgroup->nested_iterator);
2768 }
2769}
2770
2771#define UPDATE_NEW 0
2772#define UPDATE_OLD 1
2773/*
2774 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2775 */
2776static void qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
2777 struct ulist *roots, struct list_head *qgroups,
2778 u64 seq, int update_old)
2779{
2780 struct ulist_node *unode;
2781 struct ulist_iterator uiter;
2782 struct btrfs_qgroup *qg;
2783
2784 if (!roots)
2785 return;
2786 ULIST_ITER_INIT(&uiter);
2787 while ((unode = ulist_next(roots, &uiter))) {
2788 LIST_HEAD(tmp);
2789
2790 qg = find_qgroup_rb(fs_info, unode->val);
2791 if (!qg)
2792 continue;
2793
2794 qgroup_iterator_nested_add(qgroups, qg);
2795 qgroup_iterator_add(&tmp, qg);
2796 list_for_each_entry(qg, &tmp, iterator) {
2797 struct btrfs_qgroup_list *glist;
2798
2799 if (update_old)
2800 btrfs_qgroup_update_old_refcnt(qg, seq, 1);
2801 else
2802 btrfs_qgroup_update_new_refcnt(qg, seq, 1);
2803
2804 list_for_each_entry(glist, &qg->groups, next_group) {
2805 qgroup_iterator_nested_add(qgroups, glist->group);
2806 qgroup_iterator_add(&tmp, glist->group);
2807 }
2808 }
2809 qgroup_iterator_clean(&tmp);
2810 }
2811}
2812
2813/*
2814 * Update qgroup rfer/excl counters.
2815 * Rfer update is easy, codes can explain themselves.
2816 *
2817 * Excl update is tricky, the update is split into 2 parts.
2818 * Part 1: Possible exclusive <-> sharing detect:
2819 * | A | !A |
2820 * -------------------------------------
2821 * B | * | - |
2822 * -------------------------------------
2823 * !B | + | ** |
2824 * -------------------------------------
2825 *
2826 * Conditions:
2827 * A: cur_old_roots < nr_old_roots (not exclusive before)
2828 * !A: cur_old_roots == nr_old_roots (possible exclusive before)
2829 * B: cur_new_roots < nr_new_roots (not exclusive now)
2830 * !B: cur_new_roots == nr_new_roots (possible exclusive now)
2831 *
2832 * Results:
2833 * +: Possible sharing -> exclusive -: Possible exclusive -> sharing
2834 * *: Definitely not changed. **: Possible unchanged.
2835 *
2836 * For !A and !B condition, the exception is cur_old/new_roots == 0 case.
2837 *
2838 * To make the logic clear, we first use condition A and B to split
2839 * combination into 4 results.
2840 *
2841 * Then, for result "+" and "-", check old/new_roots == 0 case, as in them
2842 * only on variant maybe 0.
2843 *
2844 * Lastly, check result **, since there are 2 variants maybe 0, split them
2845 * again(2x2).
2846 * But this time we don't need to consider other things, the codes and logic
2847 * is easy to understand now.
2848 */
2849static void qgroup_update_counters(struct btrfs_fs_info *fs_info,
2850 struct list_head *qgroups, u64 nr_old_roots,
2851 u64 nr_new_roots, u64 num_bytes, u64 seq)
2852{
2853 struct btrfs_qgroup *qg;
2854
2855 list_for_each_entry(qg, qgroups, nested_iterator) {
2856 u64 cur_new_count, cur_old_count;
2857 bool dirty = false;
2858
2859 cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq);
2860 cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq);
2861
2862 trace_qgroup_update_counters(fs_info, qg, cur_old_count,
2863 cur_new_count);
2864
2865 /* Rfer update part */
2866 if (cur_old_count == 0 && cur_new_count > 0) {
2867 qg->rfer += num_bytes;
2868 qg->rfer_cmpr += num_bytes;
2869 dirty = true;
2870 }
2871 if (cur_old_count > 0 && cur_new_count == 0) {
2872 qg->rfer -= num_bytes;
2873 qg->rfer_cmpr -= num_bytes;
2874 dirty = true;
2875 }
2876
2877 /* Excl update part */
2878 /* Exclusive/none -> shared case */
2879 if (cur_old_count == nr_old_roots &&
2880 cur_new_count < nr_new_roots) {
2881 /* Exclusive -> shared */
2882 if (cur_old_count != 0) {
2883 qg->excl -= num_bytes;
2884 qg->excl_cmpr -= num_bytes;
2885 dirty = true;
2886 }
2887 }
2888
2889 /* Shared -> exclusive/none case */
2890 if (cur_old_count < nr_old_roots &&
2891 cur_new_count == nr_new_roots) {
2892 /* Shared->exclusive */
2893 if (cur_new_count != 0) {
2894 qg->excl += num_bytes;
2895 qg->excl_cmpr += num_bytes;
2896 dirty = true;
2897 }
2898 }
2899
2900 /* Exclusive/none -> exclusive/none case */
2901 if (cur_old_count == nr_old_roots &&
2902 cur_new_count == nr_new_roots) {
2903 if (cur_old_count == 0) {
2904 /* None -> exclusive/none */
2905
2906 if (cur_new_count != 0) {
2907 /* None -> exclusive */
2908 qg->excl += num_bytes;
2909 qg->excl_cmpr += num_bytes;
2910 dirty = true;
2911 }
2912 /* None -> none, nothing changed */
2913 } else {
2914 /* Exclusive -> exclusive/none */
2915
2916 if (cur_new_count == 0) {
2917 /* Exclusive -> none */
2918 qg->excl -= num_bytes;
2919 qg->excl_cmpr -= num_bytes;
2920 dirty = true;
2921 }
2922 /* Exclusive -> exclusive, nothing changed */
2923 }
2924 }
2925
2926 if (dirty)
2927 qgroup_dirty(fs_info, qg);
2928 }
2929}
2930
2931/*
2932 * Check if the @roots potentially is a list of fs tree roots
2933 *
2934 * Return 0 for definitely not a fs/subvol tree roots ulist
2935 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2936 * one as well)
2937 */
2938static int maybe_fs_roots(struct ulist *roots)
2939{
2940 struct ulist_node *unode;
2941 struct ulist_iterator uiter;
2942
2943 /* Empty one, still possible for fs roots */
2944 if (!roots || roots->nnodes == 0)
2945 return 1;
2946
2947 ULIST_ITER_INIT(&uiter);
2948 unode = ulist_next(roots, &uiter);
2949 if (!unode)
2950 return 1;
2951
2952 /*
2953 * If it contains fs tree roots, then it must belong to fs/subvol
2954 * trees.
2955 * If it contains a non-fs tree, it won't be shared with fs/subvol trees.
2956 */
2957 return is_fstree(unode->val);
2958}
2959
2960int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
2961 u64 num_bytes, struct ulist *old_roots,
2962 struct ulist *new_roots)
2963{
2964 struct btrfs_fs_info *fs_info = trans->fs_info;
2965 LIST_HEAD(qgroups);
2966 u64 seq;
2967 u64 nr_new_roots = 0;
2968 u64 nr_old_roots = 0;
2969 int ret = 0;
2970
2971 /*
2972 * If quotas get disabled meanwhile, the resources need to be freed and
2973 * we can't just exit here.
2974 */
2975 if (!btrfs_qgroup_full_accounting(fs_info) ||
2976 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
2977 goto out_free;
2978
2979 if (new_roots) {
2980 if (!maybe_fs_roots(new_roots))
2981 goto out_free;
2982 nr_new_roots = new_roots->nnodes;
2983 }
2984 if (old_roots) {
2985 if (!maybe_fs_roots(old_roots))
2986 goto out_free;
2987 nr_old_roots = old_roots->nnodes;
2988 }
2989
2990 /* Quick exit, either not fs tree roots, or won't affect any qgroup */
2991 if (nr_old_roots == 0 && nr_new_roots == 0)
2992 goto out_free;
2993
2994 trace_btrfs_qgroup_account_extent(fs_info, trans->transid, bytenr,
2995 num_bytes, nr_old_roots, nr_new_roots);
2996
2997 mutex_lock(&fs_info->qgroup_rescan_lock);
2998 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
2999 if (fs_info->qgroup_rescan_progress.objectid <= bytenr) {
3000 mutex_unlock(&fs_info->qgroup_rescan_lock);
3001 ret = 0;
3002 goto out_free;
3003 }
3004 }
3005 mutex_unlock(&fs_info->qgroup_rescan_lock);
3006
3007 spin_lock(&fs_info->qgroup_lock);
3008 seq = fs_info->qgroup_seq;
3009
3010 /* Update old refcnts using old_roots */
3011 qgroup_update_refcnt(fs_info, old_roots, &qgroups, seq, UPDATE_OLD);
3012
3013 /* Update new refcnts using new_roots */
3014 qgroup_update_refcnt(fs_info, new_roots, &qgroups, seq, UPDATE_NEW);
3015
3016 qgroup_update_counters(fs_info, &qgroups, nr_old_roots, nr_new_roots,
3017 num_bytes, seq);
3018
3019 /*
3020 * We're done using the iterator, release all its qgroups while holding
3021 * fs_info->qgroup_lock so that we don't race with btrfs_remove_qgroup()
3022 * and trigger use-after-free accesses to qgroups.
3023 */
3024 qgroup_iterator_nested_clean(&qgroups);
3025
3026 /*
3027 * Bump qgroup_seq to avoid seq overlap
3028 */
3029 fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1;
3030 spin_unlock(&fs_info->qgroup_lock);
3031out_free:
3032 ulist_free(old_roots);
3033 ulist_free(new_roots);
3034 return ret;
3035}
3036
3037int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans)
3038{
3039 struct btrfs_fs_info *fs_info = trans->fs_info;
3040 struct btrfs_qgroup_extent_record *record;
3041 struct btrfs_delayed_ref_root *delayed_refs;
3042 struct ulist *new_roots = NULL;
3043 unsigned long index;
3044 u64 num_dirty_extents = 0;
3045 u64 qgroup_to_skip;
3046 int ret = 0;
3047
3048 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE)
3049 return 0;
3050
3051 delayed_refs = &trans->transaction->delayed_refs;
3052 qgroup_to_skip = delayed_refs->qgroup_to_skip;
3053 xa_for_each(&delayed_refs->dirty_extents, index, record) {
3054 const u64 bytenr = (((u64)index) << fs_info->sectorsize_bits);
3055
3056 num_dirty_extents++;
3057 trace_btrfs_qgroup_account_extents(fs_info, record, bytenr);
3058
3059 if (!ret && !(fs_info->qgroup_flags &
3060 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)) {
3061 struct btrfs_backref_walk_ctx ctx = { 0 };
3062
3063 ctx.bytenr = bytenr;
3064 ctx.fs_info = fs_info;
3065
3066 /*
3067 * Old roots should be searched when inserting qgroup
3068 * extent record.
3069 *
3070 * But for INCONSISTENT (NO_ACCOUNTING) -> rescan case,
3071 * we may have some record inserted during
3072 * NO_ACCOUNTING (thus no old_roots populated), but
3073 * later we start rescan, which clears NO_ACCOUNTING,
3074 * leaving some inserted records without old_roots
3075 * populated.
3076 *
3077 * Those cases are rare and should not cause too much
3078 * time spent during commit_transaction().
3079 */
3080 if (!record->old_roots) {
3081 /* Search commit root to find old_roots */
3082 ret = btrfs_find_all_roots(&ctx, false);
3083 if (ret < 0)
3084 goto cleanup;
3085 record->old_roots = ctx.roots;
3086 ctx.roots = NULL;
3087 }
3088
3089 /*
3090 * Use BTRFS_SEQ_LAST as time_seq to do special search,
3091 * which doesn't lock tree or delayed_refs and search
3092 * current root. It's safe inside commit_transaction().
3093 */
3094 ctx.trans = trans;
3095 ctx.time_seq = BTRFS_SEQ_LAST;
3096 ret = btrfs_find_all_roots(&ctx, false);
3097 if (ret < 0)
3098 goto cleanup;
3099 new_roots = ctx.roots;
3100 if (qgroup_to_skip) {
3101 ulist_del(new_roots, qgroup_to_skip, 0);
3102 ulist_del(record->old_roots, qgroup_to_skip,
3103 0);
3104 }
3105 ret = btrfs_qgroup_account_extent(trans, bytenr,
3106 record->num_bytes,
3107 record->old_roots,
3108 new_roots);
3109 record->old_roots = NULL;
3110 new_roots = NULL;
3111 }
3112 /* Free the reserved data space */
3113 btrfs_qgroup_free_refroot(fs_info,
3114 record->data_rsv_refroot,
3115 record->data_rsv,
3116 BTRFS_QGROUP_RSV_DATA);
3117cleanup:
3118 ulist_free(record->old_roots);
3119 ulist_free(new_roots);
3120 new_roots = NULL;
3121 xa_erase(&delayed_refs->dirty_extents, index);
3122 kfree(record);
3123
3124 }
3125 trace_qgroup_num_dirty_extents(fs_info, trans->transid,
3126 num_dirty_extents);
3127 return ret;
3128}
3129
3130/*
3131 * Writes all changed qgroups to disk.
3132 * Called by the transaction commit path and the qgroup assign ioctl.
3133 */
3134int btrfs_run_qgroups(struct btrfs_trans_handle *trans)
3135{
3136 struct btrfs_fs_info *fs_info = trans->fs_info;
3137 int ret = 0;
3138
3139 /*
3140 * In case we are called from the qgroup assign ioctl, assert that we
3141 * are holding the qgroup_ioctl_lock, otherwise we can race with a quota
3142 * disable operation (ioctl) and access a freed quota root.
3143 */
3144 if (trans->transaction->state != TRANS_STATE_COMMIT_DOING)
3145 lockdep_assert_held(&fs_info->qgroup_ioctl_lock);
3146
3147 if (!fs_info->quota_root)
3148 return ret;
3149
3150 spin_lock(&fs_info->qgroup_lock);
3151 while (!list_empty(&fs_info->dirty_qgroups)) {
3152 struct btrfs_qgroup *qgroup;
3153 qgroup = list_first_entry(&fs_info->dirty_qgroups,
3154 struct btrfs_qgroup, dirty);
3155 list_del_init(&qgroup->dirty);
3156 spin_unlock(&fs_info->qgroup_lock);
3157 ret = update_qgroup_info_item(trans, qgroup);
3158 if (ret)
3159 qgroup_mark_inconsistent(fs_info);
3160 ret = update_qgroup_limit_item(trans, qgroup);
3161 if (ret)
3162 qgroup_mark_inconsistent(fs_info);
3163 spin_lock(&fs_info->qgroup_lock);
3164 }
3165 if (btrfs_qgroup_enabled(fs_info))
3166 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
3167 else
3168 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
3169 spin_unlock(&fs_info->qgroup_lock);
3170
3171 ret = update_qgroup_status_item(trans);
3172 if (ret)
3173 qgroup_mark_inconsistent(fs_info);
3174
3175 return ret;
3176}
3177
3178int btrfs_qgroup_check_inherit(struct btrfs_fs_info *fs_info,
3179 struct btrfs_qgroup_inherit *inherit,
3180 size_t size)
3181{
3182 if (inherit->flags & ~BTRFS_QGROUP_INHERIT_FLAGS_SUPP)
3183 return -EOPNOTSUPP;
3184 if (size < sizeof(*inherit) || size > PAGE_SIZE)
3185 return -EINVAL;
3186
3187 /*
3188 * In the past we allowed btrfs_qgroup_inherit to specify to copy
3189 * rfer/excl numbers directly from other qgroups. This behavior has
3190 * been disabled in userspace for a very long time, but here we should
3191 * also disable it in kernel, as this behavior is known to mark qgroup
3192 * inconsistent, and a rescan would wipe out the changes anyway.
3193 *
3194 * Reject any btrfs_qgroup_inherit with num_ref_copies or num_excl_copies.
3195 */
3196 if (inherit->num_ref_copies > 0 || inherit->num_excl_copies > 0)
3197 return -EINVAL;
3198
3199 if (size != struct_size(inherit, qgroups, inherit->num_qgroups))
3200 return -EINVAL;
3201
3202 /*
3203 * Skip the inherit source qgroups check if qgroup is not enabled.
3204 * Qgroup can still be later enabled causing problems, but in that case
3205 * btrfs_qgroup_inherit() would just ignore those invalid ones.
3206 */
3207 if (!btrfs_qgroup_enabled(fs_info))
3208 return 0;
3209
3210 /*
3211 * Now check all the remaining qgroups, they should all:
3212 *
3213 * - Exist
3214 * - Be higher level qgroups.
3215 */
3216 for (int i = 0; i < inherit->num_qgroups; i++) {
3217 struct btrfs_qgroup *qgroup;
3218 u64 qgroupid = inherit->qgroups[i];
3219
3220 if (btrfs_qgroup_level(qgroupid) == 0)
3221 return -EINVAL;
3222
3223 spin_lock(&fs_info->qgroup_lock);
3224 qgroup = find_qgroup_rb(fs_info, qgroupid);
3225 if (!qgroup) {
3226 spin_unlock(&fs_info->qgroup_lock);
3227 return -ENOENT;
3228 }
3229 spin_unlock(&fs_info->qgroup_lock);
3230 }
3231 return 0;
3232}
3233
3234static int qgroup_auto_inherit(struct btrfs_fs_info *fs_info,
3235 u64 inode_rootid,
3236 struct btrfs_qgroup_inherit **inherit)
3237{
3238 int i = 0;
3239 u64 num_qgroups = 0;
3240 struct btrfs_qgroup *inode_qg;
3241 struct btrfs_qgroup_list *qg_list;
3242 struct btrfs_qgroup_inherit *res;
3243 size_t struct_sz;
3244 u64 *qgids;
3245
3246 if (*inherit)
3247 return -EEXIST;
3248
3249 inode_qg = find_qgroup_rb(fs_info, inode_rootid);
3250 if (!inode_qg)
3251 return -ENOENT;
3252
3253 num_qgroups = list_count_nodes(&inode_qg->groups);
3254
3255 if (!num_qgroups)
3256 return 0;
3257
3258 struct_sz = struct_size(res, qgroups, num_qgroups);
3259 if (struct_sz == SIZE_MAX)
3260 return -ERANGE;
3261
3262 res = kzalloc(struct_sz, GFP_NOFS);
3263 if (!res)
3264 return -ENOMEM;
3265 res->num_qgroups = num_qgroups;
3266 qgids = res->qgroups;
3267
3268 list_for_each_entry(qg_list, &inode_qg->groups, next_group)
3269 qgids[i++] = qg_list->group->qgroupid;
3270
3271 *inherit = res;
3272 return 0;
3273}
3274
3275/*
3276 * Check if we can skip rescan when inheriting qgroups. If @src has a single
3277 * @parent, and that @parent is owning all its bytes exclusively, we can skip
3278 * the full rescan, by just adding nodesize to the @parent's excl/rfer.
3279 *
3280 * Return <0 for fatal errors (like srcid/parentid has no qgroup).
3281 * Return 0 if a quick inherit is done.
3282 * Return >0 if a quick inherit is not possible, and a full rescan is needed.
3283 */
3284static int qgroup_snapshot_quick_inherit(struct btrfs_fs_info *fs_info,
3285 u64 srcid, u64 parentid)
3286{
3287 struct btrfs_qgroup *src;
3288 struct btrfs_qgroup *parent;
3289 struct btrfs_qgroup_list *list;
3290 int nr_parents = 0;
3291
3292 src = find_qgroup_rb(fs_info, srcid);
3293 if (!src)
3294 return -ENOENT;
3295 parent = find_qgroup_rb(fs_info, parentid);
3296 if (!parent)
3297 return -ENOENT;
3298
3299 /*
3300 * Source has no parent qgroup, but our new qgroup would have one.
3301 * Qgroup numbers would become inconsistent.
3302 */
3303 if (list_empty(&src->groups))
3304 return 1;
3305
3306 list_for_each_entry(list, &src->groups, next_group) {
3307 /* The parent is not the same, quick update is not possible. */
3308 if (list->group->qgroupid != parentid)
3309 return 1;
3310 nr_parents++;
3311 /*
3312 * More than one parent qgroup, we can't be sure about accounting
3313 * consistency.
3314 */
3315 if (nr_parents > 1)
3316 return 1;
3317 }
3318
3319 /*
3320 * The parent is not exclusively owning all its bytes. We're not sure
3321 * if the source has any bytes not fully owned by the parent.
3322 */
3323 if (parent->excl != parent->rfer)
3324 return 1;
3325
3326 parent->excl += fs_info->nodesize;
3327 parent->rfer += fs_info->nodesize;
3328 return 0;
3329}
3330
3331/*
3332 * Copy the accounting information between qgroups. This is necessary
3333 * when a snapshot or a subvolume is created. Throwing an error will
3334 * cause a transaction abort so we take extra care here to only error
3335 * when a readonly fs is a reasonable outcome.
3336 */
3337int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
3338 u64 objectid, u64 inode_rootid,
3339 struct btrfs_qgroup_inherit *inherit)
3340{
3341 int ret = 0;
3342 u64 *i_qgroups;
3343 bool committing = false;
3344 struct btrfs_fs_info *fs_info = trans->fs_info;
3345 struct btrfs_root *quota_root;
3346 struct btrfs_qgroup *srcgroup;
3347 struct btrfs_qgroup *dstgroup;
3348 struct btrfs_qgroup *prealloc;
3349 struct btrfs_qgroup_list **qlist_prealloc = NULL;
3350 bool free_inherit = false;
3351 bool need_rescan = false;
3352 u32 level_size = 0;
3353 u64 nums;
3354
3355 prealloc = kzalloc(sizeof(*prealloc), GFP_NOFS);
3356 if (!prealloc)
3357 return -ENOMEM;
3358
3359 /*
3360 * There are only two callers of this function.
3361 *
3362 * One in create_subvol() in the ioctl context, which needs to hold
3363 * the qgroup_ioctl_lock.
3364 *
3365 * The other one in create_pending_snapshot() where no other qgroup
3366 * code can modify the fs as they all need to either start a new trans
3367 * or hold a trans handler, thus we don't need to hold
3368 * qgroup_ioctl_lock.
3369 * This would avoid long and complex lock chain and make lockdep happy.
3370 */
3371 spin_lock(&fs_info->trans_lock);
3372 if (trans->transaction->state == TRANS_STATE_COMMIT_DOING)
3373 committing = true;
3374 spin_unlock(&fs_info->trans_lock);
3375
3376 if (!committing)
3377 mutex_lock(&fs_info->qgroup_ioctl_lock);
3378 if (!btrfs_qgroup_enabled(fs_info))
3379 goto out;
3380
3381 quota_root = fs_info->quota_root;
3382 if (!quota_root) {
3383 ret = -EINVAL;
3384 goto out;
3385 }
3386
3387 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE && !inherit) {
3388 ret = qgroup_auto_inherit(fs_info, inode_rootid, &inherit);
3389 if (ret)
3390 goto out;
3391 free_inherit = true;
3392 }
3393
3394 if (inherit) {
3395 i_qgroups = (u64 *)(inherit + 1);
3396 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
3397 2 * inherit->num_excl_copies;
3398 for (int i = 0; i < nums; i++) {
3399 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
3400
3401 /*
3402 * Zero out invalid groups so we can ignore
3403 * them later.
3404 */
3405 if (!srcgroup ||
3406 ((srcgroup->qgroupid >> 48) <= (objectid >> 48)))
3407 *i_qgroups = 0ULL;
3408
3409 ++i_qgroups;
3410 }
3411 }
3412
3413 /*
3414 * create a tracking group for the subvol itself
3415 */
3416 ret = add_qgroup_item(trans, quota_root, objectid);
3417 if (ret)
3418 goto out;
3419
3420 /*
3421 * add qgroup to all inherited groups
3422 */
3423 if (inherit) {
3424 i_qgroups = (u64 *)(inherit + 1);
3425 for (int i = 0; i < inherit->num_qgroups; i++, i_qgroups++) {
3426 if (*i_qgroups == 0)
3427 continue;
3428 ret = add_qgroup_relation_item(trans, objectid,
3429 *i_qgroups);
3430 if (ret && ret != -EEXIST)
3431 goto out;
3432 ret = add_qgroup_relation_item(trans, *i_qgroups,
3433 objectid);
3434 if (ret && ret != -EEXIST)
3435 goto out;
3436 }
3437 ret = 0;
3438
3439 qlist_prealloc = kcalloc(inherit->num_qgroups,
3440 sizeof(struct btrfs_qgroup_list *),
3441 GFP_NOFS);
3442 if (!qlist_prealloc) {
3443 ret = -ENOMEM;
3444 goto out;
3445 }
3446 for (int i = 0; i < inherit->num_qgroups; i++) {
3447 qlist_prealloc[i] = kzalloc(sizeof(struct btrfs_qgroup_list),
3448 GFP_NOFS);
3449 if (!qlist_prealloc[i]) {
3450 ret = -ENOMEM;
3451 goto out;
3452 }
3453 }
3454 }
3455
3456 spin_lock(&fs_info->qgroup_lock);
3457
3458 dstgroup = add_qgroup_rb(fs_info, prealloc, objectid);
3459 prealloc = NULL;
3460
3461 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
3462 dstgroup->lim_flags = inherit->lim.flags;
3463 dstgroup->max_rfer = inherit->lim.max_rfer;
3464 dstgroup->max_excl = inherit->lim.max_excl;
3465 dstgroup->rsv_rfer = inherit->lim.rsv_rfer;
3466 dstgroup->rsv_excl = inherit->lim.rsv_excl;
3467
3468 qgroup_dirty(fs_info, dstgroup);
3469 }
3470
3471 if (srcid && btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_FULL) {
3472 srcgroup = find_qgroup_rb(fs_info, srcid);
3473 if (!srcgroup)
3474 goto unlock;
3475
3476 /*
3477 * We call inherit after we clone the root in order to make sure
3478 * our counts don't go crazy, so at this point the only
3479 * difference between the two roots should be the root node.
3480 */
3481 level_size = fs_info->nodesize;
3482 dstgroup->rfer = srcgroup->rfer;
3483 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
3484 dstgroup->excl = level_size;
3485 dstgroup->excl_cmpr = level_size;
3486 srcgroup->excl = level_size;
3487 srcgroup->excl_cmpr = level_size;
3488
3489 /* inherit the limit info */
3490 dstgroup->lim_flags = srcgroup->lim_flags;
3491 dstgroup->max_rfer = srcgroup->max_rfer;
3492 dstgroup->max_excl = srcgroup->max_excl;
3493 dstgroup->rsv_rfer = srcgroup->rsv_rfer;
3494 dstgroup->rsv_excl = srcgroup->rsv_excl;
3495
3496 qgroup_dirty(fs_info, dstgroup);
3497 qgroup_dirty(fs_info, srcgroup);
3498
3499 /*
3500 * If the source qgroup has parent but the new one doesn't,
3501 * we need a full rescan.
3502 */
3503 if (!inherit && !list_empty(&srcgroup->groups))
3504 need_rescan = true;
3505 }
3506
3507 if (!inherit)
3508 goto unlock;
3509
3510 i_qgroups = (u64 *)(inherit + 1);
3511 for (int i = 0; i < inherit->num_qgroups; i++) {
3512 if (*i_qgroups) {
3513 ret = add_relation_rb(fs_info, qlist_prealloc[i], objectid,
3514 *i_qgroups);
3515 qlist_prealloc[i] = NULL;
3516 if (ret)
3517 goto unlock;
3518 }
3519 if (srcid) {
3520 /* Check if we can do a quick inherit. */
3521 ret = qgroup_snapshot_quick_inherit(fs_info, srcid, *i_qgroups);
3522 if (ret < 0)
3523 goto unlock;
3524 if (ret > 0)
3525 need_rescan = true;
3526 ret = 0;
3527 }
3528 ++i_qgroups;
3529 }
3530
3531 for (int i = 0; i < inherit->num_ref_copies; i++, i_qgroups += 2) {
3532 struct btrfs_qgroup *src;
3533 struct btrfs_qgroup *dst;
3534
3535 if (!i_qgroups[0] || !i_qgroups[1])
3536 continue;
3537
3538 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3539 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3540
3541 if (!src || !dst) {
3542 ret = -EINVAL;
3543 goto unlock;
3544 }
3545
3546 dst->rfer = src->rfer - level_size;
3547 dst->rfer_cmpr = src->rfer_cmpr - level_size;
3548
3549 /* Manually tweaking numbers certainly needs a rescan */
3550 need_rescan = true;
3551 }
3552 for (int i = 0; i < inherit->num_excl_copies; i++, i_qgroups += 2) {
3553 struct btrfs_qgroup *src;
3554 struct btrfs_qgroup *dst;
3555
3556 if (!i_qgroups[0] || !i_qgroups[1])
3557 continue;
3558
3559 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3560 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3561
3562 if (!src || !dst) {
3563 ret = -EINVAL;
3564 goto unlock;
3565 }
3566
3567 dst->excl = src->excl + level_size;
3568 dst->excl_cmpr = src->excl_cmpr + level_size;
3569 need_rescan = true;
3570 }
3571
3572unlock:
3573 spin_unlock(&fs_info->qgroup_lock);
3574 if (!ret)
3575 ret = btrfs_sysfs_add_one_qgroup(fs_info, dstgroup);
3576out:
3577 if (!committing)
3578 mutex_unlock(&fs_info->qgroup_ioctl_lock);
3579 if (need_rescan)
3580 qgroup_mark_inconsistent(fs_info);
3581 if (qlist_prealloc) {
3582 for (int i = 0; i < inherit->num_qgroups; i++)
3583 kfree(qlist_prealloc[i]);
3584 kfree(qlist_prealloc);
3585 }
3586 if (free_inherit)
3587 kfree(inherit);
3588 kfree(prealloc);
3589 return ret;
3590}
3591
3592static bool qgroup_check_limits(const struct btrfs_qgroup *qg, u64 num_bytes)
3593{
3594 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
3595 qgroup_rsv_total(qg) + (s64)qg->rfer + num_bytes > qg->max_rfer)
3596 return false;
3597
3598 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
3599 qgroup_rsv_total(qg) + (s64)qg->excl + num_bytes > qg->max_excl)
3600 return false;
3601
3602 return true;
3603}
3604
3605static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce,
3606 enum btrfs_qgroup_rsv_type type)
3607{
3608 struct btrfs_qgroup *qgroup;
3609 struct btrfs_fs_info *fs_info = root->fs_info;
3610 u64 ref_root = btrfs_root_id(root);
3611 int ret = 0;
3612 LIST_HEAD(qgroup_list);
3613
3614 if (!is_fstree(ref_root))
3615 return 0;
3616
3617 if (num_bytes == 0)
3618 return 0;
3619
3620 if (test_bit(BTRFS_FS_QUOTA_OVERRIDE, &fs_info->flags) &&
3621 capable(CAP_SYS_RESOURCE))
3622 enforce = false;
3623
3624 spin_lock(&fs_info->qgroup_lock);
3625 if (!fs_info->quota_root)
3626 goto out;
3627
3628 qgroup = find_qgroup_rb(fs_info, ref_root);
3629 if (!qgroup)
3630 goto out;
3631
3632 qgroup_iterator_add(&qgroup_list, qgroup);
3633 list_for_each_entry(qgroup, &qgroup_list, iterator) {
3634 struct btrfs_qgroup_list *glist;
3635
3636 if (enforce && !qgroup_check_limits(qgroup, num_bytes)) {
3637 ret = -EDQUOT;
3638 goto out;
3639 }
3640
3641 list_for_each_entry(glist, &qgroup->groups, next_group)
3642 qgroup_iterator_add(&qgroup_list, glist->group);
3643 }
3644
3645 ret = 0;
3646 /*
3647 * no limits exceeded, now record the reservation into all qgroups
3648 */
3649 list_for_each_entry(qgroup, &qgroup_list, iterator)
3650 qgroup_rsv_add(fs_info, qgroup, num_bytes, type);
3651
3652out:
3653 qgroup_iterator_clean(&qgroup_list);
3654 spin_unlock(&fs_info->qgroup_lock);
3655 return ret;
3656}
3657
3658/*
3659 * Free @num_bytes of reserved space with @type for qgroup. (Normally level 0
3660 * qgroup).
3661 *
3662 * Will handle all higher level qgroup too.
3663 *
3664 * NOTE: If @num_bytes is (u64)-1, this means to free all bytes of this qgroup.
3665 * This special case is only used for META_PERTRANS type.
3666 */
3667void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
3668 u64 ref_root, u64 num_bytes,
3669 enum btrfs_qgroup_rsv_type type)
3670{
3671 struct btrfs_qgroup *qgroup;
3672 LIST_HEAD(qgroup_list);
3673
3674 if (!is_fstree(ref_root))
3675 return;
3676
3677 if (num_bytes == 0)
3678 return;
3679
3680 if (num_bytes == (u64)-1 && type != BTRFS_QGROUP_RSV_META_PERTRANS) {
3681 WARN(1, "%s: Invalid type to free", __func__);
3682 return;
3683 }
3684 spin_lock(&fs_info->qgroup_lock);
3685
3686 if (!fs_info->quota_root)
3687 goto out;
3688
3689 qgroup = find_qgroup_rb(fs_info, ref_root);
3690 if (!qgroup)
3691 goto out;
3692
3693 if (num_bytes == (u64)-1)
3694 /*
3695 * We're freeing all pertrans rsv, get reserved value from
3696 * level 0 qgroup as real num_bytes to free.
3697 */
3698 num_bytes = qgroup->rsv.values[type];
3699
3700 qgroup_iterator_add(&qgroup_list, qgroup);
3701 list_for_each_entry(qgroup, &qgroup_list, iterator) {
3702 struct btrfs_qgroup_list *glist;
3703
3704 qgroup_rsv_release(fs_info, qgroup, num_bytes, type);
3705 list_for_each_entry(glist, &qgroup->groups, next_group) {
3706 qgroup_iterator_add(&qgroup_list, glist->group);
3707 }
3708 }
3709out:
3710 qgroup_iterator_clean(&qgroup_list);
3711 spin_unlock(&fs_info->qgroup_lock);
3712}
3713
3714/*
3715 * Check if the leaf is the last leaf. Which means all node pointers
3716 * are at their last position.
3717 */
3718static bool is_last_leaf(struct btrfs_path *path)
3719{
3720 int i;
3721
3722 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3723 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3724 return false;
3725 }
3726 return true;
3727}
3728
3729/*
3730 * returns < 0 on error, 0 when more leafs are to be scanned.
3731 * returns 1 when done.
3732 */
3733static int qgroup_rescan_leaf(struct btrfs_trans_handle *trans,
3734 struct btrfs_path *path)
3735{
3736 struct btrfs_fs_info *fs_info = trans->fs_info;
3737 struct btrfs_root *extent_root;
3738 struct btrfs_key found;
3739 struct extent_buffer *scratch_leaf = NULL;
3740 u64 num_bytes;
3741 bool done;
3742 int slot;
3743 int ret;
3744
3745 if (!btrfs_qgroup_full_accounting(fs_info))
3746 return 1;
3747
3748 mutex_lock(&fs_info->qgroup_rescan_lock);
3749 extent_root = btrfs_extent_root(fs_info,
3750 fs_info->qgroup_rescan_progress.objectid);
3751 ret = btrfs_search_slot_for_read(extent_root,
3752 &fs_info->qgroup_rescan_progress,
3753 path, 1, 0);
3754
3755 btrfs_debug(fs_info,
3756 "current progress key (%llu %u %llu), search_slot ret %d",
3757 fs_info->qgroup_rescan_progress.objectid,
3758 fs_info->qgroup_rescan_progress.type,
3759 fs_info->qgroup_rescan_progress.offset, ret);
3760
3761 if (ret) {
3762 /*
3763 * The rescan is about to end, we will not be scanning any
3764 * further blocks. We cannot unset the RESCAN flag here, because
3765 * we want to commit the transaction if everything went well.
3766 * To make the live accounting work in this phase, we set our
3767 * scan progress pointer such that every real extent objectid
3768 * will be smaller.
3769 */
3770 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3771 btrfs_release_path(path);
3772 mutex_unlock(&fs_info->qgroup_rescan_lock);
3773 return ret;
3774 }
3775 done = is_last_leaf(path);
3776
3777 btrfs_item_key_to_cpu(path->nodes[0], &found,
3778 btrfs_header_nritems(path->nodes[0]) - 1);
3779 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
3780
3781 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);
3782 if (!scratch_leaf) {
3783 ret = -ENOMEM;
3784 mutex_unlock(&fs_info->qgroup_rescan_lock);
3785 goto out;
3786 }
3787 slot = path->slots[0];
3788 btrfs_release_path(path);
3789 mutex_unlock(&fs_info->qgroup_rescan_lock);
3790
3791 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
3792 struct btrfs_backref_walk_ctx ctx = { 0 };
3793
3794 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
3795 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
3796 found.type != BTRFS_METADATA_ITEM_KEY)
3797 continue;
3798 if (found.type == BTRFS_METADATA_ITEM_KEY)
3799 num_bytes = fs_info->nodesize;
3800 else
3801 num_bytes = found.offset;
3802
3803 ctx.bytenr = found.objectid;
3804 ctx.fs_info = fs_info;
3805
3806 ret = btrfs_find_all_roots(&ctx, false);
3807 if (ret < 0)
3808 goto out;
3809 /* For rescan, just pass old_roots as NULL */
3810 ret = btrfs_qgroup_account_extent(trans, found.objectid,
3811 num_bytes, NULL, ctx.roots);
3812 if (ret < 0)
3813 goto out;
3814 }
3815out:
3816 if (scratch_leaf)
3817 free_extent_buffer(scratch_leaf);
3818
3819 if (done && !ret) {
3820 ret = 1;
3821 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3822 }
3823 return ret;
3824}
3825
3826static bool rescan_should_stop(struct btrfs_fs_info *fs_info)
3827{
3828 if (btrfs_fs_closing(fs_info))
3829 return true;
3830 if (test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state))
3831 return true;
3832 if (!btrfs_qgroup_enabled(fs_info))
3833 return true;
3834 if (fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN)
3835 return true;
3836 return false;
3837}
3838
3839static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
3840{
3841 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
3842 qgroup_rescan_work);
3843 struct btrfs_path *path;
3844 struct btrfs_trans_handle *trans = NULL;
3845 int ret = 0;
3846 bool stopped = false;
3847 bool did_leaf_rescans = false;
3848
3849 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE)
3850 return;
3851
3852 path = btrfs_alloc_path();
3853 if (!path) {
3854 ret = -ENOMEM;
3855 goto out;
3856 }
3857 /*
3858 * Rescan should only search for commit root, and any later difference
3859 * should be recorded by qgroup
3860 */
3861 path->search_commit_root = 1;
3862 path->skip_locking = 1;
3863
3864 while (!ret && !(stopped = rescan_should_stop(fs_info))) {
3865 trans = btrfs_start_transaction(fs_info->fs_root, 0);
3866 if (IS_ERR(trans)) {
3867 ret = PTR_ERR(trans);
3868 break;
3869 }
3870
3871 ret = qgroup_rescan_leaf(trans, path);
3872 did_leaf_rescans = true;
3873
3874 if (ret > 0)
3875 btrfs_commit_transaction(trans);
3876 else
3877 btrfs_end_transaction(trans);
3878 }
3879
3880out:
3881 btrfs_free_path(path);
3882
3883 mutex_lock(&fs_info->qgroup_rescan_lock);
3884 if (ret > 0 &&
3885 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
3886 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3887 } else if (ret < 0 || stopped) {
3888 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3889 }
3890 mutex_unlock(&fs_info->qgroup_rescan_lock);
3891
3892 /*
3893 * Only update status, since the previous part has already updated the
3894 * qgroup info, and only if we did any actual work. This also prevents
3895 * race with a concurrent quota disable, which has already set
3896 * fs_info->quota_root to NULL and cleared BTRFS_FS_QUOTA_ENABLED at
3897 * btrfs_quota_disable().
3898 */
3899 if (did_leaf_rescans) {
3900 trans = btrfs_start_transaction(fs_info->quota_root, 1);
3901 if (IS_ERR(trans)) {
3902 ret = PTR_ERR(trans);
3903 trans = NULL;
3904 btrfs_err(fs_info,
3905 "fail to start transaction for status update: %d",
3906 ret);
3907 }
3908 } else {
3909 trans = NULL;
3910 }
3911
3912 mutex_lock(&fs_info->qgroup_rescan_lock);
3913 if (!stopped ||
3914 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN)
3915 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3916 if (trans) {
3917 int ret2 = update_qgroup_status_item(trans);
3918
3919 if (ret2 < 0) {
3920 ret = ret2;
3921 btrfs_err(fs_info, "fail to update qgroup status: %d", ret);
3922 }
3923 }
3924 fs_info->qgroup_rescan_running = false;
3925 fs_info->qgroup_flags &= ~BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN;
3926 complete_all(&fs_info->qgroup_rescan_completion);
3927 mutex_unlock(&fs_info->qgroup_rescan_lock);
3928
3929 if (!trans)
3930 return;
3931
3932 btrfs_end_transaction(trans);
3933
3934 if (stopped) {
3935 btrfs_info(fs_info, "qgroup scan paused");
3936 } else if (fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN) {
3937 btrfs_info(fs_info, "qgroup scan cancelled");
3938 } else if (ret >= 0) {
3939 btrfs_info(fs_info, "qgroup scan completed%s",
3940 ret > 0 ? " (inconsistency flag cleared)" : "");
3941 } else {
3942 btrfs_err(fs_info, "qgroup scan failed with %d", ret);
3943 }
3944}
3945
3946/*
3947 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
3948 * memory required for the rescan context.
3949 */
3950static int
3951qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
3952 int init_flags)
3953{
3954 int ret = 0;
3955
3956 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE) {
3957 btrfs_warn(fs_info, "qgroup rescan init failed, running in simple mode");
3958 return -EINVAL;
3959 }
3960
3961 if (!init_flags) {
3962 /* we're resuming qgroup rescan at mount time */
3963 if (!(fs_info->qgroup_flags &
3964 BTRFS_QGROUP_STATUS_FLAG_RESCAN)) {
3965 btrfs_debug(fs_info,
3966 "qgroup rescan init failed, qgroup rescan is not queued");
3967 ret = -EINVAL;
3968 } else if (!(fs_info->qgroup_flags &
3969 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3970 btrfs_debug(fs_info,
3971 "qgroup rescan init failed, qgroup is not enabled");
3972 ret = -ENOTCONN;
3973 }
3974
3975 if (ret)
3976 return ret;
3977 }
3978
3979 mutex_lock(&fs_info->qgroup_rescan_lock);
3980
3981 if (init_flags) {
3982 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3983 ret = -EINPROGRESS;
3984 } else if (!(fs_info->qgroup_flags &
3985 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3986 btrfs_debug(fs_info,
3987 "qgroup rescan init failed, qgroup is not enabled");
3988 ret = -ENOTCONN;
3989 } else if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED) {
3990 /* Quota disable is in progress */
3991 ret = -EBUSY;
3992 }
3993
3994 if (ret) {
3995 mutex_unlock(&fs_info->qgroup_rescan_lock);
3996 return ret;
3997 }
3998 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3999 }
4000
4001 memset(&fs_info->qgroup_rescan_progress, 0,
4002 sizeof(fs_info->qgroup_rescan_progress));
4003 fs_info->qgroup_flags &= ~(BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
4004 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
4005 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
4006 init_completion(&fs_info->qgroup_rescan_completion);
4007 mutex_unlock(&fs_info->qgroup_rescan_lock);
4008
4009 btrfs_init_work(&fs_info->qgroup_rescan_work,
4010 btrfs_qgroup_rescan_worker, NULL);
4011 return 0;
4012}
4013
4014static void
4015qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
4016{
4017 struct rb_node *n;
4018 struct btrfs_qgroup *qgroup;
4019
4020 spin_lock(&fs_info->qgroup_lock);
4021 /* clear all current qgroup tracking information */
4022 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
4023 qgroup = rb_entry(n, struct btrfs_qgroup, node);
4024 qgroup->rfer = 0;
4025 qgroup->rfer_cmpr = 0;
4026 qgroup->excl = 0;
4027 qgroup->excl_cmpr = 0;
4028 qgroup_dirty(fs_info, qgroup);
4029 }
4030 spin_unlock(&fs_info->qgroup_lock);
4031}
4032
4033int
4034btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
4035{
4036 int ret = 0;
4037
4038 ret = qgroup_rescan_init(fs_info, 0, 1);
4039 if (ret)
4040 return ret;
4041
4042 /*
4043 * We have set the rescan_progress to 0, which means no more
4044 * delayed refs will be accounted by btrfs_qgroup_account_ref.
4045 * However, btrfs_qgroup_account_ref may be right after its call
4046 * to btrfs_find_all_roots, in which case it would still do the
4047 * accounting.
4048 * To solve this, we're committing the transaction, which will
4049 * ensure we run all delayed refs and only after that, we are
4050 * going to clear all tracking information for a clean start.
4051 */
4052
4053 ret = btrfs_commit_current_transaction(fs_info->fs_root);
4054 if (ret) {
4055 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
4056 return ret;
4057 }
4058
4059 qgroup_rescan_zero_tracking(fs_info);
4060
4061 mutex_lock(&fs_info->qgroup_rescan_lock);
4062 fs_info->qgroup_rescan_running = true;
4063 btrfs_queue_work(fs_info->qgroup_rescan_workers,
4064 &fs_info->qgroup_rescan_work);
4065 mutex_unlock(&fs_info->qgroup_rescan_lock);
4066
4067 return 0;
4068}
4069
4070int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
4071 bool interruptible)
4072{
4073 int running;
4074 int ret = 0;
4075
4076 mutex_lock(&fs_info->qgroup_rescan_lock);
4077 running = fs_info->qgroup_rescan_running;
4078 mutex_unlock(&fs_info->qgroup_rescan_lock);
4079
4080 if (!running)
4081 return 0;
4082
4083 if (interruptible)
4084 ret = wait_for_completion_interruptible(
4085 &fs_info->qgroup_rescan_completion);
4086 else
4087 wait_for_completion(&fs_info->qgroup_rescan_completion);
4088
4089 return ret;
4090}
4091
4092/*
4093 * this is only called from open_ctree where we're still single threaded, thus
4094 * locking is omitted here.
4095 */
4096void
4097btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
4098{
4099 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
4100 mutex_lock(&fs_info->qgroup_rescan_lock);
4101 fs_info->qgroup_rescan_running = true;
4102 btrfs_queue_work(fs_info->qgroup_rescan_workers,
4103 &fs_info->qgroup_rescan_work);
4104 mutex_unlock(&fs_info->qgroup_rescan_lock);
4105 }
4106}
4107
4108#define rbtree_iterate_from_safe(node, next, start) \
4109 for (node = start; node && ({ next = rb_next(node); 1;}); node = next)
4110
4111static int qgroup_unreserve_range(struct btrfs_inode *inode,
4112 struct extent_changeset *reserved, u64 start,
4113 u64 len)
4114{
4115 struct rb_node *node;
4116 struct rb_node *next;
4117 struct ulist_node *entry;
4118 int ret = 0;
4119
4120 node = reserved->range_changed.root.rb_node;
4121 if (!node)
4122 return 0;
4123 while (node) {
4124 entry = rb_entry(node, struct ulist_node, rb_node);
4125 if (entry->val < start)
4126 node = node->rb_right;
4127 else
4128 node = node->rb_left;
4129 }
4130
4131 if (entry->val > start && rb_prev(&entry->rb_node))
4132 entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,
4133 rb_node);
4134
4135 rbtree_iterate_from_safe(node, next, &entry->rb_node) {
4136 u64 entry_start;
4137 u64 entry_end;
4138 u64 entry_len;
4139 int clear_ret;
4140
4141 entry = rb_entry(node, struct ulist_node, rb_node);
4142 entry_start = entry->val;
4143 entry_end = entry->aux;
4144 entry_len = entry_end - entry_start + 1;
4145
4146 if (entry_start >= start + len)
4147 break;
4148 if (entry_start + entry_len <= start)
4149 continue;
4150 /*
4151 * Now the entry is in [start, start + len), revert the
4152 * EXTENT_QGROUP_RESERVED bit.
4153 */
4154 clear_ret = clear_extent_bits(&inode->io_tree, entry_start,
4155 entry_end, EXTENT_QGROUP_RESERVED);
4156 if (!ret && clear_ret < 0)
4157 ret = clear_ret;
4158
4159 ulist_del(&reserved->range_changed, entry->val, entry->aux);
4160 if (likely(reserved->bytes_changed >= entry_len)) {
4161 reserved->bytes_changed -= entry_len;
4162 } else {
4163 WARN_ON(1);
4164 reserved->bytes_changed = 0;
4165 }
4166 }
4167
4168 return ret;
4169}
4170
4171/*
4172 * Try to free some space for qgroup.
4173 *
4174 * For qgroup, there are only 3 ways to free qgroup space:
4175 * - Flush nodatacow write
4176 * Any nodatacow write will free its reserved data space at run_delalloc_range().
4177 * In theory, we should only flush nodatacow inodes, but it's not yet
4178 * possible, so we need to flush the whole root.
4179 *
4180 * - Wait for ordered extents
4181 * When ordered extents are finished, their reserved metadata is finally
4182 * converted to per_trans status, which can be freed by later commit
4183 * transaction.
4184 *
4185 * - Commit transaction
4186 * This would free the meta_per_trans space.
4187 * In theory this shouldn't provide much space, but any more qgroup space
4188 * is needed.
4189 */
4190static int try_flush_qgroup(struct btrfs_root *root)
4191{
4192 int ret;
4193
4194 /* Can't hold an open transaction or we run the risk of deadlocking. */
4195 ASSERT(current->journal_info == NULL);
4196 if (WARN_ON(current->journal_info))
4197 return 0;
4198
4199 /*
4200 * We don't want to run flush again and again, so if there is a running
4201 * one, we won't try to start a new flush, but exit directly.
4202 */
4203 if (test_and_set_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state)) {
4204 wait_event(root->qgroup_flush_wait,
4205 !test_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state));
4206 return 0;
4207 }
4208
4209 ret = btrfs_start_delalloc_snapshot(root, true);
4210 if (ret < 0)
4211 goto out;
4212 btrfs_wait_ordered_extents(root, U64_MAX, NULL);
4213
4214 /*
4215 * After waiting for ordered extents run delayed iputs in order to free
4216 * space from unlinked files before committing the current transaction,
4217 * as ordered extents may have been holding the last reference of an
4218 * inode and they add a delayed iput when they complete.
4219 */
4220 btrfs_run_delayed_iputs(root->fs_info);
4221 btrfs_wait_on_delayed_iputs(root->fs_info);
4222
4223 ret = btrfs_commit_current_transaction(root);
4224out:
4225 clear_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state);
4226 wake_up(&root->qgroup_flush_wait);
4227 return ret;
4228}
4229
4230static int qgroup_reserve_data(struct btrfs_inode *inode,
4231 struct extent_changeset **reserved_ret, u64 start,
4232 u64 len)
4233{
4234 struct btrfs_root *root = inode->root;
4235 struct extent_changeset *reserved;
4236 bool new_reserved = false;
4237 u64 orig_reserved;
4238 u64 to_reserve;
4239 int ret;
4240
4241 if (btrfs_qgroup_mode(root->fs_info) == BTRFS_QGROUP_MODE_DISABLED ||
4242 !is_fstree(btrfs_root_id(root)) || len == 0)
4243 return 0;
4244
4245 /* @reserved parameter is mandatory for qgroup */
4246 if (WARN_ON(!reserved_ret))
4247 return -EINVAL;
4248 if (!*reserved_ret) {
4249 new_reserved = true;
4250 *reserved_ret = extent_changeset_alloc();
4251 if (!*reserved_ret)
4252 return -ENOMEM;
4253 }
4254 reserved = *reserved_ret;
4255 /* Record already reserved space */
4256 orig_reserved = reserved->bytes_changed;
4257 ret = set_record_extent_bits(&inode->io_tree, start,
4258 start + len -1, EXTENT_QGROUP_RESERVED, reserved);
4259
4260 /* Newly reserved space */
4261 to_reserve = reserved->bytes_changed - orig_reserved;
4262 trace_btrfs_qgroup_reserve_data(&inode->vfs_inode, start, len,
4263 to_reserve, QGROUP_RESERVE);
4264 if (ret < 0)
4265 goto out;
4266 ret = qgroup_reserve(root, to_reserve, true, BTRFS_QGROUP_RSV_DATA);
4267 if (ret < 0)
4268 goto cleanup;
4269
4270 return ret;
4271
4272cleanup:
4273 qgroup_unreserve_range(inode, reserved, start, len);
4274out:
4275 if (new_reserved) {
4276 extent_changeset_free(reserved);
4277 *reserved_ret = NULL;
4278 }
4279 return ret;
4280}
4281
4282/*
4283 * Reserve qgroup space for range [start, start + len).
4284 *
4285 * This function will either reserve space from related qgroups or do nothing
4286 * if the range is already reserved.
4287 *
4288 * Return 0 for successful reservation
4289 * Return <0 for error (including -EQUOT)
4290 *
4291 * NOTE: This function may sleep for memory allocation, dirty page flushing and
4292 * commit transaction. So caller should not hold any dirty page locked.
4293 */
4294int btrfs_qgroup_reserve_data(struct btrfs_inode *inode,
4295 struct extent_changeset **reserved_ret, u64 start,
4296 u64 len)
4297{
4298 int ret;
4299
4300 ret = qgroup_reserve_data(inode, reserved_ret, start, len);
4301 if (ret <= 0 && ret != -EDQUOT)
4302 return ret;
4303
4304 ret = try_flush_qgroup(inode->root);
4305 if (ret < 0)
4306 return ret;
4307 return qgroup_reserve_data(inode, reserved_ret, start, len);
4308}
4309
4310/* Free ranges specified by @reserved, normally in error path */
4311static int qgroup_free_reserved_data(struct btrfs_inode *inode,
4312 struct extent_changeset *reserved,
4313 u64 start, u64 len, u64 *freed_ret)
4314{
4315 struct btrfs_root *root = inode->root;
4316 struct ulist_node *unode;
4317 struct ulist_iterator uiter;
4318 struct extent_changeset changeset;
4319 u64 freed = 0;
4320 int ret;
4321
4322 extent_changeset_init(&changeset);
4323 len = round_up(start + len, root->fs_info->sectorsize);
4324 start = round_down(start, root->fs_info->sectorsize);
4325
4326 ULIST_ITER_INIT(&uiter);
4327 while ((unode = ulist_next(&reserved->range_changed, &uiter))) {
4328 u64 range_start = unode->val;
4329 /* unode->aux is the inclusive end */
4330 u64 range_len = unode->aux - range_start + 1;
4331 u64 free_start;
4332 u64 free_len;
4333
4334 extent_changeset_release(&changeset);
4335
4336 /* Only free range in range [start, start + len) */
4337 if (range_start >= start + len ||
4338 range_start + range_len <= start)
4339 continue;
4340 free_start = max(range_start, start);
4341 free_len = min(start + len, range_start + range_len) -
4342 free_start;
4343 /*
4344 * TODO: To also modify reserved->ranges_reserved to reflect
4345 * the modification.
4346 *
4347 * However as long as we free qgroup reserved according to
4348 * EXTENT_QGROUP_RESERVED, we won't double free.
4349 * So not need to rush.
4350 */
4351 ret = clear_record_extent_bits(&inode->io_tree, free_start,
4352 free_start + free_len - 1,
4353 EXTENT_QGROUP_RESERVED, &changeset);
4354 if (ret < 0)
4355 goto out;
4356 freed += changeset.bytes_changed;
4357 }
4358 btrfs_qgroup_free_refroot(root->fs_info, btrfs_root_id(root), freed,
4359 BTRFS_QGROUP_RSV_DATA);
4360 if (freed_ret)
4361 *freed_ret = freed;
4362 ret = 0;
4363out:
4364 extent_changeset_release(&changeset);
4365 return ret;
4366}
4367
4368static int __btrfs_qgroup_release_data(struct btrfs_inode *inode,
4369 struct extent_changeset *reserved, u64 start, u64 len,
4370 u64 *released, int free)
4371{
4372 struct extent_changeset changeset;
4373 int trace_op = QGROUP_RELEASE;
4374 int ret;
4375
4376 if (btrfs_qgroup_mode(inode->root->fs_info) == BTRFS_QGROUP_MODE_DISABLED) {
4377 return clear_record_extent_bits(&inode->io_tree, start,
4378 start + len - 1,
4379 EXTENT_QGROUP_RESERVED, NULL);
4380 }
4381
4382 /* In release case, we shouldn't have @reserved */
4383 WARN_ON(!free && reserved);
4384 if (free && reserved)
4385 return qgroup_free_reserved_data(inode, reserved, start, len, released);
4386 extent_changeset_init(&changeset);
4387 ret = clear_record_extent_bits(&inode->io_tree, start, start + len -1,
4388 EXTENT_QGROUP_RESERVED, &changeset);
4389 if (ret < 0)
4390 goto out;
4391
4392 if (free)
4393 trace_op = QGROUP_FREE;
4394 trace_btrfs_qgroup_release_data(&inode->vfs_inode, start, len,
4395 changeset.bytes_changed, trace_op);
4396 if (free)
4397 btrfs_qgroup_free_refroot(inode->root->fs_info,
4398 btrfs_root_id(inode->root),
4399 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
4400 if (released)
4401 *released = changeset.bytes_changed;
4402out:
4403 extent_changeset_release(&changeset);
4404 return ret;
4405}
4406
4407/*
4408 * Free a reserved space range from io_tree and related qgroups
4409 *
4410 * Should be called when a range of pages get invalidated before reaching disk.
4411 * Or for error cleanup case.
4412 * if @reserved is given, only reserved range in [@start, @start + @len) will
4413 * be freed.
4414 *
4415 * For data written to disk, use btrfs_qgroup_release_data().
4416 *
4417 * NOTE: This function may sleep for memory allocation.
4418 */
4419int btrfs_qgroup_free_data(struct btrfs_inode *inode,
4420 struct extent_changeset *reserved,
4421 u64 start, u64 len, u64 *freed)
4422{
4423 return __btrfs_qgroup_release_data(inode, reserved, start, len, freed, 1);
4424}
4425
4426/*
4427 * Release a reserved space range from io_tree only.
4428 *
4429 * Should be called when a range of pages get written to disk and corresponding
4430 * FILE_EXTENT is inserted into corresponding root.
4431 *
4432 * Since new qgroup accounting framework will only update qgroup numbers at
4433 * commit_transaction() time, its reserved space shouldn't be freed from
4434 * related qgroups.
4435 *
4436 * But we should release the range from io_tree, to allow further write to be
4437 * COWed.
4438 *
4439 * NOTE: This function may sleep for memory allocation.
4440 */
4441int btrfs_qgroup_release_data(struct btrfs_inode *inode, u64 start, u64 len, u64 *released)
4442{
4443 return __btrfs_qgroup_release_data(inode, NULL, start, len, released, 0);
4444}
4445
4446static void add_root_meta_rsv(struct btrfs_root *root, int num_bytes,
4447 enum btrfs_qgroup_rsv_type type)
4448{
4449 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
4450 type != BTRFS_QGROUP_RSV_META_PERTRANS)
4451 return;
4452 if (num_bytes == 0)
4453 return;
4454
4455 spin_lock(&root->qgroup_meta_rsv_lock);
4456 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
4457 root->qgroup_meta_rsv_prealloc += num_bytes;
4458 else
4459 root->qgroup_meta_rsv_pertrans += num_bytes;
4460 spin_unlock(&root->qgroup_meta_rsv_lock);
4461}
4462
4463static int sub_root_meta_rsv(struct btrfs_root *root, int num_bytes,
4464 enum btrfs_qgroup_rsv_type type)
4465{
4466 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
4467 type != BTRFS_QGROUP_RSV_META_PERTRANS)
4468 return 0;
4469 if (num_bytes == 0)
4470 return 0;
4471
4472 spin_lock(&root->qgroup_meta_rsv_lock);
4473 if (type == BTRFS_QGROUP_RSV_META_PREALLOC) {
4474 num_bytes = min_t(u64, root->qgroup_meta_rsv_prealloc,
4475 num_bytes);
4476 root->qgroup_meta_rsv_prealloc -= num_bytes;
4477 } else {
4478 num_bytes = min_t(u64, root->qgroup_meta_rsv_pertrans,
4479 num_bytes);
4480 root->qgroup_meta_rsv_pertrans -= num_bytes;
4481 }
4482 spin_unlock(&root->qgroup_meta_rsv_lock);
4483 return num_bytes;
4484}
4485
4486int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
4487 enum btrfs_qgroup_rsv_type type, bool enforce)
4488{
4489 struct btrfs_fs_info *fs_info = root->fs_info;
4490 int ret;
4491
4492 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED ||
4493 !is_fstree(btrfs_root_id(root)) || num_bytes == 0)
4494 return 0;
4495
4496 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
4497 trace_qgroup_meta_reserve(root, (s64)num_bytes, type);
4498 ret = qgroup_reserve(root, num_bytes, enforce, type);
4499 if (ret < 0)
4500 return ret;
4501 /*
4502 * Record what we have reserved into root.
4503 *
4504 * To avoid quota disabled->enabled underflow.
4505 * In that case, we may try to free space we haven't reserved
4506 * (since quota was disabled), so record what we reserved into root.
4507 * And ensure later release won't underflow this number.
4508 */
4509 add_root_meta_rsv(root, num_bytes, type);
4510 return ret;
4511}
4512
4513int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
4514 enum btrfs_qgroup_rsv_type type, bool enforce,
4515 bool noflush)
4516{
4517 int ret;
4518
4519 ret = btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
4520 if ((ret <= 0 && ret != -EDQUOT) || noflush)
4521 return ret;
4522
4523 ret = try_flush_qgroup(root);
4524 if (ret < 0)
4525 return ret;
4526 return btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
4527}
4528
4529/*
4530 * Per-transaction meta reservation should be all freed at transaction commit
4531 * time
4532 */
4533void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root)
4534{
4535 struct btrfs_fs_info *fs_info = root->fs_info;
4536
4537 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED ||
4538 !is_fstree(btrfs_root_id(root)))
4539 return;
4540
4541 /* TODO: Update trace point to handle such free */
4542 trace_qgroup_meta_free_all_pertrans(root);
4543 /* Special value -1 means to free all reserved space */
4544 btrfs_qgroup_free_refroot(fs_info, btrfs_root_id(root), (u64)-1,
4545 BTRFS_QGROUP_RSV_META_PERTRANS);
4546}
4547
4548void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
4549 enum btrfs_qgroup_rsv_type type)
4550{
4551 struct btrfs_fs_info *fs_info = root->fs_info;
4552
4553 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED ||
4554 !is_fstree(btrfs_root_id(root)))
4555 return;
4556
4557 /*
4558 * reservation for META_PREALLOC can happen before quota is enabled,
4559 * which can lead to underflow.
4560 * Here ensure we will only free what we really have reserved.
4561 */
4562 num_bytes = sub_root_meta_rsv(root, num_bytes, type);
4563 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
4564 trace_qgroup_meta_reserve(root, -(s64)num_bytes, type);
4565 btrfs_qgroup_free_refroot(fs_info, btrfs_root_id(root), num_bytes, type);
4566}
4567
4568static void qgroup_convert_meta(struct btrfs_fs_info *fs_info, u64 ref_root,
4569 int num_bytes)
4570{
4571 struct btrfs_qgroup *qgroup;
4572 LIST_HEAD(qgroup_list);
4573
4574 if (num_bytes == 0)
4575 return;
4576 if (!fs_info->quota_root)
4577 return;
4578
4579 spin_lock(&fs_info->qgroup_lock);
4580 qgroup = find_qgroup_rb(fs_info, ref_root);
4581 if (!qgroup)
4582 goto out;
4583
4584 qgroup_iterator_add(&qgroup_list, qgroup);
4585 list_for_each_entry(qgroup, &qgroup_list, iterator) {
4586 struct btrfs_qgroup_list *glist;
4587
4588 qgroup_rsv_release(fs_info, qgroup, num_bytes,
4589 BTRFS_QGROUP_RSV_META_PREALLOC);
4590 if (!sb_rdonly(fs_info->sb))
4591 qgroup_rsv_add(fs_info, qgroup, num_bytes,
4592 BTRFS_QGROUP_RSV_META_PERTRANS);
4593
4594 list_for_each_entry(glist, &qgroup->groups, next_group)
4595 qgroup_iterator_add(&qgroup_list, glist->group);
4596 }
4597out:
4598 qgroup_iterator_clean(&qgroup_list);
4599 spin_unlock(&fs_info->qgroup_lock);
4600}
4601
4602/*
4603 * Convert @num_bytes of META_PREALLOCATED reservation to META_PERTRANS.
4604 *
4605 * This is called when preallocated meta reservation needs to be used.
4606 * Normally after btrfs_join_transaction() call.
4607 */
4608void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes)
4609{
4610 struct btrfs_fs_info *fs_info = root->fs_info;
4611
4612 if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_DISABLED ||
4613 !is_fstree(btrfs_root_id(root)))
4614 return;
4615 /* Same as btrfs_qgroup_free_meta_prealloc() */
4616 num_bytes = sub_root_meta_rsv(root, num_bytes,
4617 BTRFS_QGROUP_RSV_META_PREALLOC);
4618 trace_qgroup_meta_convert(root, num_bytes);
4619 qgroup_convert_meta(fs_info, btrfs_root_id(root), num_bytes);
4620 if (!sb_rdonly(fs_info->sb))
4621 add_root_meta_rsv(root, num_bytes, BTRFS_QGROUP_RSV_META_PERTRANS);
4622}
4623
4624/*
4625 * Check qgroup reserved space leaking, normally at destroy inode
4626 * time
4627 */
4628void btrfs_qgroup_check_reserved_leak(struct btrfs_inode *inode)
4629{
4630 struct extent_changeset changeset;
4631 struct ulist_node *unode;
4632 struct ulist_iterator iter;
4633 int ret;
4634
4635 extent_changeset_init(&changeset);
4636 ret = clear_record_extent_bits(&inode->io_tree, 0, (u64)-1,
4637 EXTENT_QGROUP_RESERVED, &changeset);
4638
4639 WARN_ON(ret < 0);
4640 if (WARN_ON(changeset.bytes_changed)) {
4641 ULIST_ITER_INIT(&iter);
4642 while ((unode = ulist_next(&changeset.range_changed, &iter))) {
4643 btrfs_warn(inode->root->fs_info,
4644 "leaking qgroup reserved space, ino: %llu, start: %llu, end: %llu",
4645 btrfs_ino(inode), unode->val, unode->aux);
4646 }
4647 btrfs_qgroup_free_refroot(inode->root->fs_info,
4648 btrfs_root_id(inode->root),
4649 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
4650
4651 }
4652 extent_changeset_release(&changeset);
4653}
4654
4655void btrfs_qgroup_init_swapped_blocks(
4656 struct btrfs_qgroup_swapped_blocks *swapped_blocks)
4657{
4658 int i;
4659
4660 spin_lock_init(&swapped_blocks->lock);
4661 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
4662 swapped_blocks->blocks[i] = RB_ROOT;
4663 swapped_blocks->swapped = false;
4664}
4665
4666/*
4667 * Delete all swapped blocks record of @root.
4668 * Every record here means we skipped a full subtree scan for qgroup.
4669 *
4670 * Gets called when committing one transaction.
4671 */
4672void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root)
4673{
4674 struct btrfs_qgroup_swapped_blocks *swapped_blocks;
4675 int i;
4676
4677 swapped_blocks = &root->swapped_blocks;
4678
4679 spin_lock(&swapped_blocks->lock);
4680 if (!swapped_blocks->swapped)
4681 goto out;
4682 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4683 struct rb_root *cur_root = &swapped_blocks->blocks[i];
4684 struct btrfs_qgroup_swapped_block *entry;
4685 struct btrfs_qgroup_swapped_block *next;
4686
4687 rbtree_postorder_for_each_entry_safe(entry, next, cur_root,
4688 node)
4689 kfree(entry);
4690 swapped_blocks->blocks[i] = RB_ROOT;
4691 }
4692 swapped_blocks->swapped = false;
4693out:
4694 spin_unlock(&swapped_blocks->lock);
4695}
4696
4697/*
4698 * Add subtree roots record into @subvol_root.
4699 *
4700 * @subvol_root: tree root of the subvolume tree get swapped
4701 * @bg: block group under balance
4702 * @subvol_parent/slot: pointer to the subtree root in subvolume tree
4703 * @reloc_parent/slot: pointer to the subtree root in reloc tree
4704 * BOTH POINTERS ARE BEFORE TREE SWAP
4705 * @last_snapshot: last snapshot generation of the subvolume tree
4706 */
4707int btrfs_qgroup_add_swapped_blocks(struct btrfs_root *subvol_root,
4708 struct btrfs_block_group *bg,
4709 struct extent_buffer *subvol_parent, int subvol_slot,
4710 struct extent_buffer *reloc_parent, int reloc_slot,
4711 u64 last_snapshot)
4712{
4713 struct btrfs_fs_info *fs_info = subvol_root->fs_info;
4714 struct btrfs_qgroup_swapped_blocks *blocks = &subvol_root->swapped_blocks;
4715 struct btrfs_qgroup_swapped_block *block;
4716 struct rb_node **cur;
4717 struct rb_node *parent = NULL;
4718 int level = btrfs_header_level(subvol_parent) - 1;
4719 int ret = 0;
4720
4721 if (!btrfs_qgroup_full_accounting(fs_info))
4722 return 0;
4723
4724 if (btrfs_node_ptr_generation(subvol_parent, subvol_slot) >
4725 btrfs_node_ptr_generation(reloc_parent, reloc_slot)) {
4726 btrfs_err_rl(fs_info,
4727 "%s: bad parameter order, subvol_gen=%llu reloc_gen=%llu",
4728 __func__,
4729 btrfs_node_ptr_generation(subvol_parent, subvol_slot),
4730 btrfs_node_ptr_generation(reloc_parent, reloc_slot));
4731 return -EUCLEAN;
4732 }
4733
4734 block = kmalloc(sizeof(*block), GFP_NOFS);
4735 if (!block) {
4736 ret = -ENOMEM;
4737 goto out;
4738 }
4739
4740 /*
4741 * @reloc_parent/slot is still before swap, while @block is going to
4742 * record the bytenr after swap, so we do the swap here.
4743 */
4744 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot);
4745 block->subvol_generation = btrfs_node_ptr_generation(reloc_parent,
4746 reloc_slot);
4747 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot);
4748 block->reloc_generation = btrfs_node_ptr_generation(subvol_parent,
4749 subvol_slot);
4750 block->last_snapshot = last_snapshot;
4751 block->level = level;
4752
4753 /*
4754 * If we have bg == NULL, we're called from btrfs_recover_relocation(),
4755 * no one else can modify tree blocks thus we qgroup will not change
4756 * no matter the value of trace_leaf.
4757 */
4758 if (bg && bg->flags & BTRFS_BLOCK_GROUP_DATA)
4759 block->trace_leaf = true;
4760 else
4761 block->trace_leaf = false;
4762 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot);
4763
4764 /* Insert @block into @blocks */
4765 spin_lock(&blocks->lock);
4766 cur = &blocks->blocks[level].rb_node;
4767 while (*cur) {
4768 struct btrfs_qgroup_swapped_block *entry;
4769
4770 parent = *cur;
4771 entry = rb_entry(parent, struct btrfs_qgroup_swapped_block,
4772 node);
4773
4774 if (entry->subvol_bytenr < block->subvol_bytenr) {
4775 cur = &(*cur)->rb_left;
4776 } else if (entry->subvol_bytenr > block->subvol_bytenr) {
4777 cur = &(*cur)->rb_right;
4778 } else {
4779 if (entry->subvol_generation !=
4780 block->subvol_generation ||
4781 entry->reloc_bytenr != block->reloc_bytenr ||
4782 entry->reloc_generation !=
4783 block->reloc_generation) {
4784 /*
4785 * Duplicated but mismatch entry found.
4786 * Shouldn't happen.
4787 *
4788 * Marking qgroup inconsistent should be enough
4789 * for end users.
4790 */
4791 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
4792 ret = -EEXIST;
4793 }
4794 kfree(block);
4795 goto out_unlock;
4796 }
4797 }
4798 rb_link_node(&block->node, parent, cur);
4799 rb_insert_color(&block->node, &blocks->blocks[level]);
4800 blocks->swapped = true;
4801out_unlock:
4802 spin_unlock(&blocks->lock);
4803out:
4804 if (ret < 0)
4805 qgroup_mark_inconsistent(fs_info);
4806 return ret;
4807}
4808
4809/*
4810 * Check if the tree block is a subtree root, and if so do the needed
4811 * delayed subtree trace for qgroup.
4812 *
4813 * This is called during btrfs_cow_block().
4814 */
4815int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
4816 struct btrfs_root *root,
4817 struct extent_buffer *subvol_eb)
4818{
4819 struct btrfs_fs_info *fs_info = root->fs_info;
4820 struct btrfs_tree_parent_check check = { 0 };
4821 struct btrfs_qgroup_swapped_blocks *blocks = &root->swapped_blocks;
4822 struct btrfs_qgroup_swapped_block *block;
4823 struct extent_buffer *reloc_eb = NULL;
4824 struct rb_node *node;
4825 bool found = false;
4826 bool swapped = false;
4827 int level = btrfs_header_level(subvol_eb);
4828 int ret = 0;
4829 int i;
4830
4831 if (!btrfs_qgroup_full_accounting(fs_info))
4832 return 0;
4833 if (!is_fstree(btrfs_root_id(root)) || !root->reloc_root)
4834 return 0;
4835
4836 spin_lock(&blocks->lock);
4837 if (!blocks->swapped) {
4838 spin_unlock(&blocks->lock);
4839 return 0;
4840 }
4841 node = blocks->blocks[level].rb_node;
4842
4843 while (node) {
4844 block = rb_entry(node, struct btrfs_qgroup_swapped_block, node);
4845 if (block->subvol_bytenr < subvol_eb->start) {
4846 node = node->rb_left;
4847 } else if (block->subvol_bytenr > subvol_eb->start) {
4848 node = node->rb_right;
4849 } else {
4850 found = true;
4851 break;
4852 }
4853 }
4854 if (!found) {
4855 spin_unlock(&blocks->lock);
4856 goto out;
4857 }
4858 /* Found one, remove it from @blocks first and update blocks->swapped */
4859 rb_erase(&block->node, &blocks->blocks[level]);
4860 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4861 if (RB_EMPTY_ROOT(&blocks->blocks[i])) {
4862 swapped = true;
4863 break;
4864 }
4865 }
4866 blocks->swapped = swapped;
4867 spin_unlock(&blocks->lock);
4868
4869 check.level = block->level;
4870 check.transid = block->reloc_generation;
4871 check.has_first_key = true;
4872 memcpy(&check.first_key, &block->first_key, sizeof(check.first_key));
4873
4874 /* Read out reloc subtree root */
4875 reloc_eb = read_tree_block(fs_info, block->reloc_bytenr, &check);
4876 if (IS_ERR(reloc_eb)) {
4877 ret = PTR_ERR(reloc_eb);
4878 reloc_eb = NULL;
4879 goto free_out;
4880 }
4881 if (!extent_buffer_uptodate(reloc_eb)) {
4882 ret = -EIO;
4883 goto free_out;
4884 }
4885
4886 ret = qgroup_trace_subtree_swap(trans, reloc_eb, subvol_eb,
4887 block->last_snapshot, block->trace_leaf);
4888free_out:
4889 kfree(block);
4890 free_extent_buffer(reloc_eb);
4891out:
4892 if (ret < 0) {
4893 btrfs_err_rl(fs_info,
4894 "failed to account subtree at bytenr %llu: %d",
4895 subvol_eb->start, ret);
4896 qgroup_mark_inconsistent(fs_info);
4897 }
4898 return ret;
4899}
4900
4901void btrfs_qgroup_destroy_extent_records(struct btrfs_transaction *trans)
4902{
4903 struct btrfs_qgroup_extent_record *entry;
4904 unsigned long index;
4905
4906 xa_for_each(&trans->delayed_refs.dirty_extents, index, entry) {
4907 ulist_free(entry->old_roots);
4908 kfree(entry);
4909 }
4910 xa_destroy(&trans->delayed_refs.dirty_extents);
4911}
4912
4913int btrfs_record_squota_delta(struct btrfs_fs_info *fs_info,
4914 const struct btrfs_squota_delta *delta)
4915{
4916 int ret;
4917 struct btrfs_qgroup *qgroup;
4918 struct btrfs_qgroup *qg;
4919 LIST_HEAD(qgroup_list);
4920 u64 root = delta->root;
4921 u64 num_bytes = delta->num_bytes;
4922 const int sign = (delta->is_inc ? 1 : -1);
4923
4924 if (btrfs_qgroup_mode(fs_info) != BTRFS_QGROUP_MODE_SIMPLE)
4925 return 0;
4926
4927 if (!is_fstree(root))
4928 return 0;
4929
4930 /* If the extent predates enabling quotas, don't count it. */
4931 if (delta->generation < fs_info->qgroup_enable_gen)
4932 return 0;
4933
4934 spin_lock(&fs_info->qgroup_lock);
4935 qgroup = find_qgroup_rb(fs_info, root);
4936 if (!qgroup) {
4937 ret = -ENOENT;
4938 goto out;
4939 }
4940
4941 ret = 0;
4942 qgroup_iterator_add(&qgroup_list, qgroup);
4943 list_for_each_entry(qg, &qgroup_list, iterator) {
4944 struct btrfs_qgroup_list *glist;
4945
4946 qg->excl += num_bytes * sign;
4947 qg->rfer += num_bytes * sign;
4948 qgroup_dirty(fs_info, qg);
4949
4950 list_for_each_entry(glist, &qg->groups, next_group)
4951 qgroup_iterator_add(&qgroup_list, glist->group);
4952 }
4953 qgroup_iterator_clean(&qgroup_list);
4954
4955out:
4956 spin_unlock(&fs_info->qgroup_lock);
4957 return ret;
4958}