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
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}
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/sizes.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
26/* TODO XXX FIXME
27 * - subvol delete -> delete when ref goes to 0? delete limits also?
28 * - reorganize keys
29 * - compressed
30 * - sync
31 * - copy also limits on subvol creation
32 * - limit
33 * - caches for ulists
34 * - performance benchmarks
35 * - check all ioctl parameters
36 */
37
38/*
39 * Helpers to access qgroup reservation
40 *
41 * Callers should ensure the lock context and type are valid
42 */
43
44static u64 qgroup_rsv_total(const struct btrfs_qgroup *qgroup)
45{
46 u64 ret = 0;
47 int i;
48
49 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
50 ret += qgroup->rsv.values[i];
51
52 return ret;
53}
54
55#ifdef CONFIG_BTRFS_DEBUG
56static const char *qgroup_rsv_type_str(enum btrfs_qgroup_rsv_type type)
57{
58 if (type == BTRFS_QGROUP_RSV_DATA)
59 return "data";
60 if (type == BTRFS_QGROUP_RSV_META_PERTRANS)
61 return "meta_pertrans";
62 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
63 return "meta_prealloc";
64 return NULL;
65}
66#endif
67
68static void qgroup_rsv_add(struct btrfs_fs_info *fs_info,
69 struct btrfs_qgroup *qgroup, u64 num_bytes,
70 enum btrfs_qgroup_rsv_type type)
71{
72 trace_qgroup_update_reserve(fs_info, qgroup, num_bytes, type);
73 qgroup->rsv.values[type] += num_bytes;
74}
75
76static void qgroup_rsv_release(struct btrfs_fs_info *fs_info,
77 struct btrfs_qgroup *qgroup, u64 num_bytes,
78 enum btrfs_qgroup_rsv_type type)
79{
80 trace_qgroup_update_reserve(fs_info, qgroup, -(s64)num_bytes, type);
81 if (qgroup->rsv.values[type] >= num_bytes) {
82 qgroup->rsv.values[type] -= num_bytes;
83 return;
84 }
85#ifdef CONFIG_BTRFS_DEBUG
86 WARN_RATELIMIT(1,
87 "qgroup %llu %s reserved space underflow, have %llu to free %llu",
88 qgroup->qgroupid, qgroup_rsv_type_str(type),
89 qgroup->rsv.values[type], num_bytes);
90#endif
91 qgroup->rsv.values[type] = 0;
92}
93
94static void qgroup_rsv_add_by_qgroup(struct btrfs_fs_info *fs_info,
95 struct btrfs_qgroup *dest,
96 struct btrfs_qgroup *src)
97{
98 int i;
99
100 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
101 qgroup_rsv_add(fs_info, dest, src->rsv.values[i], i);
102}
103
104static void qgroup_rsv_release_by_qgroup(struct btrfs_fs_info *fs_info,
105 struct btrfs_qgroup *dest,
106 struct btrfs_qgroup *src)
107{
108 int i;
109
110 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
111 qgroup_rsv_release(fs_info, dest, src->rsv.values[i], i);
112}
113
114static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq,
115 int mod)
116{
117 if (qg->old_refcnt < seq)
118 qg->old_refcnt = seq;
119 qg->old_refcnt += mod;
120}
121
122static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq,
123 int mod)
124{
125 if (qg->new_refcnt < seq)
126 qg->new_refcnt = seq;
127 qg->new_refcnt += mod;
128}
129
130static inline u64 btrfs_qgroup_get_old_refcnt(struct btrfs_qgroup *qg, u64 seq)
131{
132 if (qg->old_refcnt < seq)
133 return 0;
134 return qg->old_refcnt - seq;
135}
136
137static inline u64 btrfs_qgroup_get_new_refcnt(struct btrfs_qgroup *qg, u64 seq)
138{
139 if (qg->new_refcnt < seq)
140 return 0;
141 return qg->new_refcnt - seq;
142}
143
144/*
145 * glue structure to represent the relations between qgroups.
146 */
147struct btrfs_qgroup_list {
148 struct list_head next_group;
149 struct list_head next_member;
150 struct btrfs_qgroup *group;
151 struct btrfs_qgroup *member;
152};
153
154static inline u64 qgroup_to_aux(struct btrfs_qgroup *qg)
155{
156 return (u64)(uintptr_t)qg;
157}
158
159static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n)
160{
161 return (struct btrfs_qgroup *)(uintptr_t)n->aux;
162}
163
164static int
165qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
166 int init_flags);
167static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
168
169/* must be called with qgroup_ioctl_lock held */
170static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info,
171 u64 qgroupid)
172{
173 struct rb_node *n = fs_info->qgroup_tree.rb_node;
174 struct btrfs_qgroup *qgroup;
175
176 while (n) {
177 qgroup = rb_entry(n, struct btrfs_qgroup, node);
178 if (qgroup->qgroupid < qgroupid)
179 n = n->rb_left;
180 else if (qgroup->qgroupid > qgroupid)
181 n = n->rb_right;
182 else
183 return qgroup;
184 }
185 return NULL;
186}
187
188/* must be called with qgroup_lock held */
189static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
190 u64 qgroupid)
191{
192 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
193 struct rb_node *parent = NULL;
194 struct btrfs_qgroup *qgroup;
195
196 while (*p) {
197 parent = *p;
198 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
199
200 if (qgroup->qgroupid < qgroupid)
201 p = &(*p)->rb_left;
202 else if (qgroup->qgroupid > qgroupid)
203 p = &(*p)->rb_right;
204 else
205 return qgroup;
206 }
207
208 qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC);
209 if (!qgroup)
210 return ERR_PTR(-ENOMEM);
211
212 qgroup->qgroupid = qgroupid;
213 INIT_LIST_HEAD(&qgroup->groups);
214 INIT_LIST_HEAD(&qgroup->members);
215 INIT_LIST_HEAD(&qgroup->dirty);
216
217 rb_link_node(&qgroup->node, parent, p);
218 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
219
220 return qgroup;
221}
222
223static void __del_qgroup_rb(struct btrfs_qgroup *qgroup)
224{
225 struct btrfs_qgroup_list *list;
226
227 list_del(&qgroup->dirty);
228 while (!list_empty(&qgroup->groups)) {
229 list = list_first_entry(&qgroup->groups,
230 struct btrfs_qgroup_list, next_group);
231 list_del(&list->next_group);
232 list_del(&list->next_member);
233 kfree(list);
234 }
235
236 while (!list_empty(&qgroup->members)) {
237 list = list_first_entry(&qgroup->members,
238 struct btrfs_qgroup_list, next_member);
239 list_del(&list->next_group);
240 list_del(&list->next_member);
241 kfree(list);
242 }
243 kfree(qgroup);
244}
245
246/* must be called with qgroup_lock held */
247static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
248{
249 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
250
251 if (!qgroup)
252 return -ENOENT;
253
254 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
255 __del_qgroup_rb(qgroup);
256 return 0;
257}
258
259/* must be called with qgroup_lock held */
260static int add_relation_rb(struct btrfs_fs_info *fs_info,
261 u64 memberid, u64 parentid)
262{
263 struct btrfs_qgroup *member;
264 struct btrfs_qgroup *parent;
265 struct btrfs_qgroup_list *list;
266
267 member = find_qgroup_rb(fs_info, memberid);
268 parent = find_qgroup_rb(fs_info, parentid);
269 if (!member || !parent)
270 return -ENOENT;
271
272 list = kzalloc(sizeof(*list), GFP_ATOMIC);
273 if (!list)
274 return -ENOMEM;
275
276 list->group = parent;
277 list->member = member;
278 list_add_tail(&list->next_group, &member->groups);
279 list_add_tail(&list->next_member, &parent->members);
280
281 return 0;
282}
283
284/* must be called with qgroup_lock held */
285static int del_relation_rb(struct btrfs_fs_info *fs_info,
286 u64 memberid, u64 parentid)
287{
288 struct btrfs_qgroup *member;
289 struct btrfs_qgroup *parent;
290 struct btrfs_qgroup_list *list;
291
292 member = find_qgroup_rb(fs_info, memberid);
293 parent = find_qgroup_rb(fs_info, parentid);
294 if (!member || !parent)
295 return -ENOENT;
296
297 list_for_each_entry(list, &member->groups, next_group) {
298 if (list->group == parent) {
299 list_del(&list->next_group);
300 list_del(&list->next_member);
301 kfree(list);
302 return 0;
303 }
304 }
305 return -ENOENT;
306}
307
308#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
309int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
310 u64 rfer, u64 excl)
311{
312 struct btrfs_qgroup *qgroup;
313
314 qgroup = find_qgroup_rb(fs_info, qgroupid);
315 if (!qgroup)
316 return -EINVAL;
317 if (qgroup->rfer != rfer || qgroup->excl != excl)
318 return -EINVAL;
319 return 0;
320}
321#endif
322
323/*
324 * The full config is read in one go, only called from open_ctree()
325 * It doesn't use any locking, as at this point we're still single-threaded
326 */
327int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
328{
329 struct btrfs_key key;
330 struct btrfs_key found_key;
331 struct btrfs_root *quota_root = fs_info->quota_root;
332 struct btrfs_path *path = NULL;
333 struct extent_buffer *l;
334 int slot;
335 int ret = 0;
336 u64 flags = 0;
337 u64 rescan_progress = 0;
338
339 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
340 return 0;
341
342 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
343 if (!fs_info->qgroup_ulist) {
344 ret = -ENOMEM;
345 goto out;
346 }
347
348 path = btrfs_alloc_path();
349 if (!path) {
350 ret = -ENOMEM;
351 goto out;
352 }
353
354 /* default this to quota off, in case no status key is found */
355 fs_info->qgroup_flags = 0;
356
357 /*
358 * pass 1: read status, all qgroup infos and limits
359 */
360 key.objectid = 0;
361 key.type = 0;
362 key.offset = 0;
363 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
364 if (ret)
365 goto out;
366
367 while (1) {
368 struct btrfs_qgroup *qgroup;
369
370 slot = path->slots[0];
371 l = path->nodes[0];
372 btrfs_item_key_to_cpu(l, &found_key, slot);
373
374 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
375 struct btrfs_qgroup_status_item *ptr;
376
377 ptr = btrfs_item_ptr(l, slot,
378 struct btrfs_qgroup_status_item);
379
380 if (btrfs_qgroup_status_version(l, ptr) !=
381 BTRFS_QGROUP_STATUS_VERSION) {
382 btrfs_err(fs_info,
383 "old qgroup version, quota disabled");
384 goto out;
385 }
386 if (btrfs_qgroup_status_generation(l, ptr) !=
387 fs_info->generation) {
388 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
389 btrfs_err(fs_info,
390 "qgroup generation mismatch, marked as inconsistent");
391 }
392 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l,
393 ptr);
394 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
395 goto next1;
396 }
397
398 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
399 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
400 goto next1;
401
402 qgroup = find_qgroup_rb(fs_info, found_key.offset);
403 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
404 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
405 btrfs_err(fs_info, "inconsistent qgroup config");
406 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
407 }
408 if (!qgroup) {
409 qgroup = add_qgroup_rb(fs_info, found_key.offset);
410 if (IS_ERR(qgroup)) {
411 ret = PTR_ERR(qgroup);
412 goto out;
413 }
414 }
415 switch (found_key.type) {
416 case BTRFS_QGROUP_INFO_KEY: {
417 struct btrfs_qgroup_info_item *ptr;
418
419 ptr = btrfs_item_ptr(l, slot,
420 struct btrfs_qgroup_info_item);
421 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
422 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
423 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
424 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
425 /* generation currently unused */
426 break;
427 }
428 case BTRFS_QGROUP_LIMIT_KEY: {
429 struct btrfs_qgroup_limit_item *ptr;
430
431 ptr = btrfs_item_ptr(l, slot,
432 struct btrfs_qgroup_limit_item);
433 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
434 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
435 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
436 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
437 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
438 break;
439 }
440 }
441next1:
442 ret = btrfs_next_item(quota_root, path);
443 if (ret < 0)
444 goto out;
445 if (ret)
446 break;
447 }
448 btrfs_release_path(path);
449
450 /*
451 * pass 2: read all qgroup relations
452 */
453 key.objectid = 0;
454 key.type = BTRFS_QGROUP_RELATION_KEY;
455 key.offset = 0;
456 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
457 if (ret)
458 goto out;
459 while (1) {
460 slot = path->slots[0];
461 l = path->nodes[0];
462 btrfs_item_key_to_cpu(l, &found_key, slot);
463
464 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
465 goto next2;
466
467 if (found_key.objectid > found_key.offset) {
468 /* parent <- member, not needed to build config */
469 /* FIXME should we omit the key completely? */
470 goto next2;
471 }
472
473 ret = add_relation_rb(fs_info, found_key.objectid,
474 found_key.offset);
475 if (ret == -ENOENT) {
476 btrfs_warn(fs_info,
477 "orphan qgroup relation 0x%llx->0x%llx",
478 found_key.objectid, found_key.offset);
479 ret = 0; /* ignore the error */
480 }
481 if (ret)
482 goto out;
483next2:
484 ret = btrfs_next_item(quota_root, path);
485 if (ret < 0)
486 goto out;
487 if (ret)
488 break;
489 }
490out:
491 fs_info->qgroup_flags |= flags;
492 if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
493 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
494 else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN &&
495 ret >= 0)
496 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
497 btrfs_free_path(path);
498
499 if (ret < 0) {
500 ulist_free(fs_info->qgroup_ulist);
501 fs_info->qgroup_ulist = NULL;
502 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
503 }
504
505 return ret < 0 ? ret : 0;
506}
507
508/*
509 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
510 * first two are in single-threaded paths.And for the third one, we have set
511 * quota_root to be null with qgroup_lock held before, so it is safe to clean
512 * up the in-memory structures without qgroup_lock held.
513 */
514void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
515{
516 struct rb_node *n;
517 struct btrfs_qgroup *qgroup;
518
519 while ((n = rb_first(&fs_info->qgroup_tree))) {
520 qgroup = rb_entry(n, struct btrfs_qgroup, node);
521 rb_erase(n, &fs_info->qgroup_tree);
522 __del_qgroup_rb(qgroup);
523 }
524 /*
525 * We call btrfs_free_qgroup_config() when unmounting
526 * filesystem and disabling quota, so we set qgroup_ulist
527 * to be null here to avoid double free.
528 */
529 ulist_free(fs_info->qgroup_ulist);
530 fs_info->qgroup_ulist = NULL;
531}
532
533static int add_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
534 u64 dst)
535{
536 int ret;
537 struct btrfs_root *quota_root = trans->fs_info->quota_root;
538 struct btrfs_path *path;
539 struct btrfs_key key;
540
541 path = btrfs_alloc_path();
542 if (!path)
543 return -ENOMEM;
544
545 key.objectid = src;
546 key.type = BTRFS_QGROUP_RELATION_KEY;
547 key.offset = dst;
548
549 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
550
551 btrfs_mark_buffer_dirty(path->nodes[0]);
552
553 btrfs_free_path(path);
554 return ret;
555}
556
557static int del_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
558 u64 dst)
559{
560 int ret;
561 struct btrfs_root *quota_root = trans->fs_info->quota_root;
562 struct btrfs_path *path;
563 struct btrfs_key key;
564
565 path = btrfs_alloc_path();
566 if (!path)
567 return -ENOMEM;
568
569 key.objectid = src;
570 key.type = BTRFS_QGROUP_RELATION_KEY;
571 key.offset = dst;
572
573 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
574 if (ret < 0)
575 goto out;
576
577 if (ret > 0) {
578 ret = -ENOENT;
579 goto out;
580 }
581
582 ret = btrfs_del_item(trans, quota_root, path);
583out:
584 btrfs_free_path(path);
585 return ret;
586}
587
588static int add_qgroup_item(struct btrfs_trans_handle *trans,
589 struct btrfs_root *quota_root, u64 qgroupid)
590{
591 int ret;
592 struct btrfs_path *path;
593 struct btrfs_qgroup_info_item *qgroup_info;
594 struct btrfs_qgroup_limit_item *qgroup_limit;
595 struct extent_buffer *leaf;
596 struct btrfs_key key;
597
598 if (btrfs_is_testing(quota_root->fs_info))
599 return 0;
600
601 path = btrfs_alloc_path();
602 if (!path)
603 return -ENOMEM;
604
605 key.objectid = 0;
606 key.type = BTRFS_QGROUP_INFO_KEY;
607 key.offset = qgroupid;
608
609 /*
610 * Avoid a transaction abort by catching -EEXIST here. In that
611 * case, we proceed by re-initializing the existing structure
612 * on disk.
613 */
614
615 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
616 sizeof(*qgroup_info));
617 if (ret && ret != -EEXIST)
618 goto out;
619
620 leaf = path->nodes[0];
621 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
622 struct btrfs_qgroup_info_item);
623 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
624 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
625 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
626 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
627 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
628
629 btrfs_mark_buffer_dirty(leaf);
630
631 btrfs_release_path(path);
632
633 key.type = BTRFS_QGROUP_LIMIT_KEY;
634 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
635 sizeof(*qgroup_limit));
636 if (ret && ret != -EEXIST)
637 goto out;
638
639 leaf = path->nodes[0];
640 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
641 struct btrfs_qgroup_limit_item);
642 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
643 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
644 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
645 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
646 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
647
648 btrfs_mark_buffer_dirty(leaf);
649
650 ret = 0;
651out:
652 btrfs_free_path(path);
653 return ret;
654}
655
656static int del_qgroup_item(struct btrfs_trans_handle *trans, u64 qgroupid)
657{
658 int ret;
659 struct btrfs_root *quota_root = trans->fs_info->quota_root;
660 struct btrfs_path *path;
661 struct btrfs_key key;
662
663 path = btrfs_alloc_path();
664 if (!path)
665 return -ENOMEM;
666
667 key.objectid = 0;
668 key.type = BTRFS_QGROUP_INFO_KEY;
669 key.offset = qgroupid;
670 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
671 if (ret < 0)
672 goto out;
673
674 if (ret > 0) {
675 ret = -ENOENT;
676 goto out;
677 }
678
679 ret = btrfs_del_item(trans, quota_root, path);
680 if (ret)
681 goto out;
682
683 btrfs_release_path(path);
684
685 key.type = BTRFS_QGROUP_LIMIT_KEY;
686 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
687 if (ret < 0)
688 goto out;
689
690 if (ret > 0) {
691 ret = -ENOENT;
692 goto out;
693 }
694
695 ret = btrfs_del_item(trans, quota_root, path);
696
697out:
698 btrfs_free_path(path);
699 return ret;
700}
701
702static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
703 struct btrfs_qgroup *qgroup)
704{
705 struct btrfs_root *quota_root = trans->fs_info->quota_root;
706 struct btrfs_path *path;
707 struct btrfs_key key;
708 struct extent_buffer *l;
709 struct btrfs_qgroup_limit_item *qgroup_limit;
710 int ret;
711 int slot;
712
713 key.objectid = 0;
714 key.type = BTRFS_QGROUP_LIMIT_KEY;
715 key.offset = qgroup->qgroupid;
716
717 path = btrfs_alloc_path();
718 if (!path)
719 return -ENOMEM;
720
721 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
722 if (ret > 0)
723 ret = -ENOENT;
724
725 if (ret)
726 goto out;
727
728 l = path->nodes[0];
729 slot = path->slots[0];
730 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
731 btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags);
732 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer);
733 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl);
734 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer);
735 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl);
736
737 btrfs_mark_buffer_dirty(l);
738
739out:
740 btrfs_free_path(path);
741 return ret;
742}
743
744static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
745 struct btrfs_qgroup *qgroup)
746{
747 struct btrfs_fs_info *fs_info = trans->fs_info;
748 struct btrfs_root *quota_root = fs_info->quota_root;
749 struct btrfs_path *path;
750 struct btrfs_key key;
751 struct extent_buffer *l;
752 struct btrfs_qgroup_info_item *qgroup_info;
753 int ret;
754 int slot;
755
756 if (btrfs_is_testing(fs_info))
757 return 0;
758
759 key.objectid = 0;
760 key.type = BTRFS_QGROUP_INFO_KEY;
761 key.offset = qgroup->qgroupid;
762
763 path = btrfs_alloc_path();
764 if (!path)
765 return -ENOMEM;
766
767 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
768 if (ret > 0)
769 ret = -ENOENT;
770
771 if (ret)
772 goto out;
773
774 l = path->nodes[0];
775 slot = path->slots[0];
776 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
777 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
778 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
779 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
780 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
781 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
782
783 btrfs_mark_buffer_dirty(l);
784
785out:
786 btrfs_free_path(path);
787 return ret;
788}
789
790static int update_qgroup_status_item(struct btrfs_trans_handle *trans)
791{
792 struct btrfs_fs_info *fs_info = trans->fs_info;
793 struct btrfs_root *quota_root = fs_info->quota_root;
794 struct btrfs_path *path;
795 struct btrfs_key key;
796 struct extent_buffer *l;
797 struct btrfs_qgroup_status_item *ptr;
798 int ret;
799 int slot;
800
801 key.objectid = 0;
802 key.type = BTRFS_QGROUP_STATUS_KEY;
803 key.offset = 0;
804
805 path = btrfs_alloc_path();
806 if (!path)
807 return -ENOMEM;
808
809 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
810 if (ret > 0)
811 ret = -ENOENT;
812
813 if (ret)
814 goto out;
815
816 l = path->nodes[0];
817 slot = path->slots[0];
818 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
819 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags);
820 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
821 btrfs_set_qgroup_status_rescan(l, ptr,
822 fs_info->qgroup_rescan_progress.objectid);
823
824 btrfs_mark_buffer_dirty(l);
825
826out:
827 btrfs_free_path(path);
828 return ret;
829}
830
831/*
832 * called with qgroup_lock held
833 */
834static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
835 struct btrfs_root *root)
836{
837 struct btrfs_path *path;
838 struct btrfs_key key;
839 struct extent_buffer *leaf = NULL;
840 int ret;
841 int nr = 0;
842
843 path = btrfs_alloc_path();
844 if (!path)
845 return -ENOMEM;
846
847 path->leave_spinning = 1;
848
849 key.objectid = 0;
850 key.offset = 0;
851 key.type = 0;
852
853 while (1) {
854 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
855 if (ret < 0)
856 goto out;
857 leaf = path->nodes[0];
858 nr = btrfs_header_nritems(leaf);
859 if (!nr)
860 break;
861 /*
862 * delete the leaf one by one
863 * since the whole tree is going
864 * to be deleted.
865 */
866 path->slots[0] = 0;
867 ret = btrfs_del_items(trans, root, path, 0, nr);
868 if (ret)
869 goto out;
870
871 btrfs_release_path(path);
872 }
873 ret = 0;
874out:
875 btrfs_free_path(path);
876 return ret;
877}
878
879int btrfs_quota_enable(struct btrfs_fs_info *fs_info)
880{
881 struct btrfs_root *quota_root;
882 struct btrfs_root *tree_root = fs_info->tree_root;
883 struct btrfs_path *path = NULL;
884 struct btrfs_qgroup_status_item *ptr;
885 struct extent_buffer *leaf;
886 struct btrfs_key key;
887 struct btrfs_key found_key;
888 struct btrfs_qgroup *qgroup = NULL;
889 struct btrfs_trans_handle *trans = NULL;
890 int ret = 0;
891 int slot;
892
893 mutex_lock(&fs_info->qgroup_ioctl_lock);
894 if (fs_info->quota_root)
895 goto out;
896
897 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
898 if (!fs_info->qgroup_ulist) {
899 ret = -ENOMEM;
900 goto out;
901 }
902
903 /*
904 * 1 for quota root item
905 * 1 for BTRFS_QGROUP_STATUS item
906 *
907 * Yet we also need 2*n items for a QGROUP_INFO/QGROUP_LIMIT items
908 * per subvolume. However those are not currently reserved since it
909 * would be a lot of overkill.
910 */
911 trans = btrfs_start_transaction(tree_root, 2);
912 if (IS_ERR(trans)) {
913 ret = PTR_ERR(trans);
914 trans = NULL;
915 goto out;
916 }
917
918 /*
919 * initially create the quota tree
920 */
921 quota_root = btrfs_create_tree(trans, BTRFS_QUOTA_TREE_OBJECTID);
922 if (IS_ERR(quota_root)) {
923 ret = PTR_ERR(quota_root);
924 btrfs_abort_transaction(trans, ret);
925 goto out;
926 }
927
928 path = btrfs_alloc_path();
929 if (!path) {
930 ret = -ENOMEM;
931 btrfs_abort_transaction(trans, ret);
932 goto out_free_root;
933 }
934
935 key.objectid = 0;
936 key.type = BTRFS_QGROUP_STATUS_KEY;
937 key.offset = 0;
938
939 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
940 sizeof(*ptr));
941 if (ret) {
942 btrfs_abort_transaction(trans, ret);
943 goto out_free_path;
944 }
945
946 leaf = path->nodes[0];
947 ptr = btrfs_item_ptr(leaf, path->slots[0],
948 struct btrfs_qgroup_status_item);
949 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
950 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
951 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON |
952 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
953 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags);
954 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
955
956 btrfs_mark_buffer_dirty(leaf);
957
958 key.objectid = 0;
959 key.type = BTRFS_ROOT_REF_KEY;
960 key.offset = 0;
961
962 btrfs_release_path(path);
963 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
964 if (ret > 0)
965 goto out_add_root;
966 if (ret < 0) {
967 btrfs_abort_transaction(trans, ret);
968 goto out_free_path;
969 }
970
971 while (1) {
972 slot = path->slots[0];
973 leaf = path->nodes[0];
974 btrfs_item_key_to_cpu(leaf, &found_key, slot);
975
976 if (found_key.type == BTRFS_ROOT_REF_KEY) {
977 ret = add_qgroup_item(trans, quota_root,
978 found_key.offset);
979 if (ret) {
980 btrfs_abort_transaction(trans, ret);
981 goto out_free_path;
982 }
983
984 qgroup = add_qgroup_rb(fs_info, found_key.offset);
985 if (IS_ERR(qgroup)) {
986 ret = PTR_ERR(qgroup);
987 btrfs_abort_transaction(trans, ret);
988 goto out_free_path;
989 }
990 }
991 ret = btrfs_next_item(tree_root, path);
992 if (ret < 0) {
993 btrfs_abort_transaction(trans, ret);
994 goto out_free_path;
995 }
996 if (ret)
997 break;
998 }
999
1000out_add_root:
1001 btrfs_release_path(path);
1002 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
1003 if (ret) {
1004 btrfs_abort_transaction(trans, ret);
1005 goto out_free_path;
1006 }
1007
1008 qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID);
1009 if (IS_ERR(qgroup)) {
1010 ret = PTR_ERR(qgroup);
1011 btrfs_abort_transaction(trans, ret);
1012 goto out_free_path;
1013 }
1014
1015 ret = btrfs_commit_transaction(trans);
1016 trans = NULL;
1017 if (ret)
1018 goto out_free_path;
1019
1020 /*
1021 * Set quota enabled flag after committing the transaction, to avoid
1022 * deadlocks on fs_info->qgroup_ioctl_lock with concurrent snapshot
1023 * creation.
1024 */
1025 spin_lock(&fs_info->qgroup_lock);
1026 fs_info->quota_root = quota_root;
1027 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1028 spin_unlock(&fs_info->qgroup_lock);
1029
1030 ret = qgroup_rescan_init(fs_info, 0, 1);
1031 if (!ret) {
1032 qgroup_rescan_zero_tracking(fs_info);
1033 btrfs_queue_work(fs_info->qgroup_rescan_workers,
1034 &fs_info->qgroup_rescan_work);
1035 }
1036
1037out_free_path:
1038 btrfs_free_path(path);
1039out_free_root:
1040 if (ret) {
1041 free_extent_buffer(quota_root->node);
1042 free_extent_buffer(quota_root->commit_root);
1043 kfree(quota_root);
1044 }
1045out:
1046 if (ret) {
1047 ulist_free(fs_info->qgroup_ulist);
1048 fs_info->qgroup_ulist = NULL;
1049 if (trans)
1050 btrfs_end_transaction(trans);
1051 }
1052 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1053 return ret;
1054}
1055
1056int btrfs_quota_disable(struct btrfs_fs_info *fs_info)
1057{
1058 struct btrfs_root *quota_root;
1059 struct btrfs_trans_handle *trans = NULL;
1060 int ret = 0;
1061
1062 mutex_lock(&fs_info->qgroup_ioctl_lock);
1063 if (!fs_info->quota_root)
1064 goto out;
1065
1066 /*
1067 * 1 For the root item
1068 *
1069 * We should also reserve enough items for the quota tree deletion in
1070 * btrfs_clean_quota_tree but this is not done.
1071 */
1072 trans = btrfs_start_transaction(fs_info->tree_root, 1);
1073 if (IS_ERR(trans)) {
1074 ret = PTR_ERR(trans);
1075 goto out;
1076 }
1077
1078 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1079 btrfs_qgroup_wait_for_completion(fs_info, false);
1080 spin_lock(&fs_info->qgroup_lock);
1081 quota_root = fs_info->quota_root;
1082 fs_info->quota_root = NULL;
1083 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
1084 spin_unlock(&fs_info->qgroup_lock);
1085
1086 btrfs_free_qgroup_config(fs_info);
1087
1088 ret = btrfs_clean_quota_tree(trans, quota_root);
1089 if (ret) {
1090 btrfs_abort_transaction(trans, ret);
1091 goto end_trans;
1092 }
1093
1094 ret = btrfs_del_root(trans, "a_root->root_key);
1095 if (ret) {
1096 btrfs_abort_transaction(trans, ret);
1097 goto end_trans;
1098 }
1099
1100 list_del("a_root->dirty_list);
1101
1102 btrfs_tree_lock(quota_root->node);
1103 btrfs_clean_tree_block(quota_root->node);
1104 btrfs_tree_unlock(quota_root->node);
1105 btrfs_free_tree_block(trans, quota_root, quota_root->node, 0, 1);
1106
1107 free_extent_buffer(quota_root->node);
1108 free_extent_buffer(quota_root->commit_root);
1109 kfree(quota_root);
1110
1111end_trans:
1112 ret = btrfs_end_transaction(trans);
1113out:
1114 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1115 return ret;
1116}
1117
1118static void qgroup_dirty(struct btrfs_fs_info *fs_info,
1119 struct btrfs_qgroup *qgroup)
1120{
1121 if (list_empty(&qgroup->dirty))
1122 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1123}
1124
1125/*
1126 * The easy accounting, we're updating qgroup relationship whose child qgroup
1127 * only has exclusive extents.
1128 *
1129 * In this case, all exclusive extents will also be exclusive for parent, so
1130 * excl/rfer just get added/removed.
1131 *
1132 * So is qgroup reservation space, which should also be added/removed to
1133 * parent.
1134 * Or when child tries to release reservation space, parent will underflow its
1135 * reservation (for relationship adding case).
1136 *
1137 * Caller should hold fs_info->qgroup_lock.
1138 */
1139static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info,
1140 struct ulist *tmp, u64 ref_root,
1141 struct btrfs_qgroup *src, int sign)
1142{
1143 struct btrfs_qgroup *qgroup;
1144 struct btrfs_qgroup_list *glist;
1145 struct ulist_node *unode;
1146 struct ulist_iterator uiter;
1147 u64 num_bytes = src->excl;
1148 int ret = 0;
1149
1150 qgroup = find_qgroup_rb(fs_info, ref_root);
1151 if (!qgroup)
1152 goto out;
1153
1154 qgroup->rfer += sign * num_bytes;
1155 qgroup->rfer_cmpr += sign * num_bytes;
1156
1157 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1158 qgroup->excl += sign * num_bytes;
1159 qgroup->excl_cmpr += sign * num_bytes;
1160
1161 if (sign > 0)
1162 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1163 else
1164 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1165
1166 qgroup_dirty(fs_info, qgroup);
1167
1168 /* Get all of the parent groups that contain this qgroup */
1169 list_for_each_entry(glist, &qgroup->groups, next_group) {
1170 ret = ulist_add(tmp, glist->group->qgroupid,
1171 qgroup_to_aux(glist->group), GFP_ATOMIC);
1172 if (ret < 0)
1173 goto out;
1174 }
1175
1176 /* Iterate all of the parents and adjust their reference counts */
1177 ULIST_ITER_INIT(&uiter);
1178 while ((unode = ulist_next(tmp, &uiter))) {
1179 qgroup = unode_aux_to_qgroup(unode);
1180 qgroup->rfer += sign * num_bytes;
1181 qgroup->rfer_cmpr += sign * num_bytes;
1182 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1183 qgroup->excl += sign * num_bytes;
1184 if (sign > 0)
1185 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1186 else
1187 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1188 qgroup->excl_cmpr += sign * num_bytes;
1189 qgroup_dirty(fs_info, qgroup);
1190
1191 /* Add any parents of the parents */
1192 list_for_each_entry(glist, &qgroup->groups, next_group) {
1193 ret = ulist_add(tmp, glist->group->qgroupid,
1194 qgroup_to_aux(glist->group), GFP_ATOMIC);
1195 if (ret < 0)
1196 goto out;
1197 }
1198 }
1199 ret = 0;
1200out:
1201 return ret;
1202}
1203
1204
1205/*
1206 * Quick path for updating qgroup with only excl refs.
1207 *
1208 * In that case, just update all parent will be enough.
1209 * Or we needs to do a full rescan.
1210 * Caller should also hold fs_info->qgroup_lock.
1211 *
1212 * Return 0 for quick update, return >0 for need to full rescan
1213 * and mark INCONSISTENT flag.
1214 * Return < 0 for other error.
1215 */
1216static int quick_update_accounting(struct btrfs_fs_info *fs_info,
1217 struct ulist *tmp, u64 src, u64 dst,
1218 int sign)
1219{
1220 struct btrfs_qgroup *qgroup;
1221 int ret = 1;
1222 int err = 0;
1223
1224 qgroup = find_qgroup_rb(fs_info, src);
1225 if (!qgroup)
1226 goto out;
1227 if (qgroup->excl == qgroup->rfer) {
1228 ret = 0;
1229 err = __qgroup_excl_accounting(fs_info, tmp, dst,
1230 qgroup, sign);
1231 if (err < 0) {
1232 ret = err;
1233 goto out;
1234 }
1235 }
1236out:
1237 if (ret)
1238 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1239 return ret;
1240}
1241
1242int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1243 u64 dst)
1244{
1245 struct btrfs_fs_info *fs_info = trans->fs_info;
1246 struct btrfs_root *quota_root;
1247 struct btrfs_qgroup *parent;
1248 struct btrfs_qgroup *member;
1249 struct btrfs_qgroup_list *list;
1250 struct ulist *tmp;
1251 int ret = 0;
1252
1253 /* Check the level of src and dst first */
1254 if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst))
1255 return -EINVAL;
1256
1257 tmp = ulist_alloc(GFP_KERNEL);
1258 if (!tmp)
1259 return -ENOMEM;
1260
1261 mutex_lock(&fs_info->qgroup_ioctl_lock);
1262 quota_root = fs_info->quota_root;
1263 if (!quota_root) {
1264 ret = -EINVAL;
1265 goto out;
1266 }
1267 member = find_qgroup_rb(fs_info, src);
1268 parent = find_qgroup_rb(fs_info, dst);
1269 if (!member || !parent) {
1270 ret = -EINVAL;
1271 goto out;
1272 }
1273
1274 /* check if such qgroup relation exist firstly */
1275 list_for_each_entry(list, &member->groups, next_group) {
1276 if (list->group == parent) {
1277 ret = -EEXIST;
1278 goto out;
1279 }
1280 }
1281
1282 ret = add_qgroup_relation_item(trans, src, dst);
1283 if (ret)
1284 goto out;
1285
1286 ret = add_qgroup_relation_item(trans, dst, src);
1287 if (ret) {
1288 del_qgroup_relation_item(trans, src, dst);
1289 goto out;
1290 }
1291
1292 spin_lock(&fs_info->qgroup_lock);
1293 ret = add_relation_rb(fs_info, src, dst);
1294 if (ret < 0) {
1295 spin_unlock(&fs_info->qgroup_lock);
1296 goto out;
1297 }
1298 ret = quick_update_accounting(fs_info, tmp, src, dst, 1);
1299 spin_unlock(&fs_info->qgroup_lock);
1300out:
1301 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1302 ulist_free(tmp);
1303 return ret;
1304}
1305
1306static int __del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1307 u64 dst)
1308{
1309 struct btrfs_fs_info *fs_info = trans->fs_info;
1310 struct btrfs_root *quota_root;
1311 struct btrfs_qgroup *parent;
1312 struct btrfs_qgroup *member;
1313 struct btrfs_qgroup_list *list;
1314 struct ulist *tmp;
1315 bool found = false;
1316 int ret = 0;
1317 int ret2;
1318
1319 tmp = ulist_alloc(GFP_KERNEL);
1320 if (!tmp)
1321 return -ENOMEM;
1322
1323 quota_root = fs_info->quota_root;
1324 if (!quota_root) {
1325 ret = -EINVAL;
1326 goto out;
1327 }
1328
1329 member = find_qgroup_rb(fs_info, src);
1330 parent = find_qgroup_rb(fs_info, dst);
1331 /*
1332 * The parent/member pair doesn't exist, then try to delete the dead
1333 * relation items only.
1334 */
1335 if (!member || !parent)
1336 goto delete_item;
1337
1338 /* check if such qgroup relation exist firstly */
1339 list_for_each_entry(list, &member->groups, next_group) {
1340 if (list->group == parent) {
1341 found = true;
1342 break;
1343 }
1344 }
1345
1346delete_item:
1347 ret = del_qgroup_relation_item(trans, src, dst);
1348 if (ret < 0 && ret != -ENOENT)
1349 goto out;
1350 ret2 = del_qgroup_relation_item(trans, dst, src);
1351 if (ret2 < 0 && ret2 != -ENOENT)
1352 goto out;
1353
1354 /* At least one deletion succeeded, return 0 */
1355 if (!ret || !ret2)
1356 ret = 0;
1357
1358 if (found) {
1359 spin_lock(&fs_info->qgroup_lock);
1360 del_relation_rb(fs_info, src, dst);
1361 ret = quick_update_accounting(fs_info, tmp, src, dst, -1);
1362 spin_unlock(&fs_info->qgroup_lock);
1363 }
1364out:
1365 ulist_free(tmp);
1366 return ret;
1367}
1368
1369int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1370 u64 dst)
1371{
1372 struct btrfs_fs_info *fs_info = trans->fs_info;
1373 int ret = 0;
1374
1375 mutex_lock(&fs_info->qgroup_ioctl_lock);
1376 ret = __del_qgroup_relation(trans, src, dst);
1377 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1378
1379 return ret;
1380}
1381
1382int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1383{
1384 struct btrfs_fs_info *fs_info = trans->fs_info;
1385 struct btrfs_root *quota_root;
1386 struct btrfs_qgroup *qgroup;
1387 int ret = 0;
1388
1389 mutex_lock(&fs_info->qgroup_ioctl_lock);
1390 quota_root = fs_info->quota_root;
1391 if (!quota_root) {
1392 ret = -EINVAL;
1393 goto out;
1394 }
1395 qgroup = find_qgroup_rb(fs_info, qgroupid);
1396 if (qgroup) {
1397 ret = -EEXIST;
1398 goto out;
1399 }
1400
1401 ret = add_qgroup_item(trans, quota_root, qgroupid);
1402 if (ret)
1403 goto out;
1404
1405 spin_lock(&fs_info->qgroup_lock);
1406 qgroup = add_qgroup_rb(fs_info, qgroupid);
1407 spin_unlock(&fs_info->qgroup_lock);
1408
1409 if (IS_ERR(qgroup))
1410 ret = PTR_ERR(qgroup);
1411out:
1412 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1413 return ret;
1414}
1415
1416int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1417{
1418 struct btrfs_fs_info *fs_info = trans->fs_info;
1419 struct btrfs_root *quota_root;
1420 struct btrfs_qgroup *qgroup;
1421 struct btrfs_qgroup_list *list;
1422 int ret = 0;
1423
1424 mutex_lock(&fs_info->qgroup_ioctl_lock);
1425 quota_root = fs_info->quota_root;
1426 if (!quota_root) {
1427 ret = -EINVAL;
1428 goto out;
1429 }
1430
1431 qgroup = find_qgroup_rb(fs_info, qgroupid);
1432 if (!qgroup) {
1433 ret = -ENOENT;
1434 goto out;
1435 }
1436
1437 /* Check if there are no children of this qgroup */
1438 if (!list_empty(&qgroup->members)) {
1439 ret = -EBUSY;
1440 goto out;
1441 }
1442
1443 ret = del_qgroup_item(trans, qgroupid);
1444 if (ret && ret != -ENOENT)
1445 goto out;
1446
1447 while (!list_empty(&qgroup->groups)) {
1448 list = list_first_entry(&qgroup->groups,
1449 struct btrfs_qgroup_list, next_group);
1450 ret = __del_qgroup_relation(trans, qgroupid,
1451 list->group->qgroupid);
1452 if (ret)
1453 goto out;
1454 }
1455
1456 spin_lock(&fs_info->qgroup_lock);
1457 del_qgroup_rb(fs_info, qgroupid);
1458 spin_unlock(&fs_info->qgroup_lock);
1459out:
1460 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1461 return ret;
1462}
1463
1464int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
1465 struct btrfs_qgroup_limit *limit)
1466{
1467 struct btrfs_fs_info *fs_info = trans->fs_info;
1468 struct btrfs_root *quota_root;
1469 struct btrfs_qgroup *qgroup;
1470 int ret = 0;
1471 /* Sometimes we would want to clear the limit on this qgroup.
1472 * To meet this requirement, we treat the -1 as a special value
1473 * which tell kernel to clear the limit on this qgroup.
1474 */
1475 const u64 CLEAR_VALUE = -1;
1476
1477 mutex_lock(&fs_info->qgroup_ioctl_lock);
1478 quota_root = fs_info->quota_root;
1479 if (!quota_root) {
1480 ret = -EINVAL;
1481 goto out;
1482 }
1483
1484 qgroup = find_qgroup_rb(fs_info, qgroupid);
1485 if (!qgroup) {
1486 ret = -ENOENT;
1487 goto out;
1488 }
1489
1490 spin_lock(&fs_info->qgroup_lock);
1491 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) {
1492 if (limit->max_rfer == CLEAR_VALUE) {
1493 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1494 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1495 qgroup->max_rfer = 0;
1496 } else {
1497 qgroup->max_rfer = limit->max_rfer;
1498 }
1499 }
1500 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
1501 if (limit->max_excl == CLEAR_VALUE) {
1502 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1503 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1504 qgroup->max_excl = 0;
1505 } else {
1506 qgroup->max_excl = limit->max_excl;
1507 }
1508 }
1509 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) {
1510 if (limit->rsv_rfer == CLEAR_VALUE) {
1511 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1512 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1513 qgroup->rsv_rfer = 0;
1514 } else {
1515 qgroup->rsv_rfer = limit->rsv_rfer;
1516 }
1517 }
1518 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) {
1519 if (limit->rsv_excl == CLEAR_VALUE) {
1520 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1521 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1522 qgroup->rsv_excl = 0;
1523 } else {
1524 qgroup->rsv_excl = limit->rsv_excl;
1525 }
1526 }
1527 qgroup->lim_flags |= limit->flags;
1528
1529 spin_unlock(&fs_info->qgroup_lock);
1530
1531 ret = update_qgroup_limit_item(trans, qgroup);
1532 if (ret) {
1533 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1534 btrfs_info(fs_info, "unable to update quota limit for %llu",
1535 qgroupid);
1536 }
1537
1538out:
1539 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1540 return ret;
1541}
1542
1543int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info,
1544 struct btrfs_delayed_ref_root *delayed_refs,
1545 struct btrfs_qgroup_extent_record *record)
1546{
1547 struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node;
1548 struct rb_node *parent_node = NULL;
1549 struct btrfs_qgroup_extent_record *entry;
1550 u64 bytenr = record->bytenr;
1551
1552 lockdep_assert_held(&delayed_refs->lock);
1553 trace_btrfs_qgroup_trace_extent(fs_info, record);
1554
1555 while (*p) {
1556 parent_node = *p;
1557 entry = rb_entry(parent_node, struct btrfs_qgroup_extent_record,
1558 node);
1559 if (bytenr < entry->bytenr) {
1560 p = &(*p)->rb_left;
1561 } else if (bytenr > entry->bytenr) {
1562 p = &(*p)->rb_right;
1563 } else {
1564 if (record->data_rsv && !entry->data_rsv) {
1565 entry->data_rsv = record->data_rsv;
1566 entry->data_rsv_refroot =
1567 record->data_rsv_refroot;
1568 }
1569 return 1;
1570 }
1571 }
1572
1573 rb_link_node(&record->node, parent_node, p);
1574 rb_insert_color(&record->node, &delayed_refs->dirty_extent_root);
1575 return 0;
1576}
1577
1578int btrfs_qgroup_trace_extent_post(struct btrfs_fs_info *fs_info,
1579 struct btrfs_qgroup_extent_record *qrecord)
1580{
1581 struct ulist *old_root;
1582 u64 bytenr = qrecord->bytenr;
1583 int ret;
1584
1585 ret = btrfs_find_all_roots(NULL, fs_info, bytenr, 0, &old_root, false);
1586 if (ret < 0) {
1587 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1588 btrfs_warn(fs_info,
1589"error accounting new delayed refs extent (err code: %d), quota inconsistent",
1590 ret);
1591 return 0;
1592 }
1593
1594 /*
1595 * Here we don't need to get the lock of
1596 * trans->transaction->delayed_refs, since inserted qrecord won't
1597 * be deleted, only qrecord->node may be modified (new qrecord insert)
1598 *
1599 * So modifying qrecord->old_roots is safe here
1600 */
1601 qrecord->old_roots = old_root;
1602 return 0;
1603}
1604
1605int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
1606 u64 num_bytes, gfp_t gfp_flag)
1607{
1608 struct btrfs_fs_info *fs_info = trans->fs_info;
1609 struct btrfs_qgroup_extent_record *record;
1610 struct btrfs_delayed_ref_root *delayed_refs;
1611 int ret;
1612
1613 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)
1614 || bytenr == 0 || num_bytes == 0)
1615 return 0;
1616 record = kzalloc(sizeof(*record), gfp_flag);
1617 if (!record)
1618 return -ENOMEM;
1619
1620 delayed_refs = &trans->transaction->delayed_refs;
1621 record->bytenr = bytenr;
1622 record->num_bytes = num_bytes;
1623 record->old_roots = NULL;
1624
1625 spin_lock(&delayed_refs->lock);
1626 ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record);
1627 spin_unlock(&delayed_refs->lock);
1628 if (ret > 0) {
1629 kfree(record);
1630 return 0;
1631 }
1632 return btrfs_qgroup_trace_extent_post(fs_info, record);
1633}
1634
1635int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
1636 struct extent_buffer *eb)
1637{
1638 struct btrfs_fs_info *fs_info = trans->fs_info;
1639 int nr = btrfs_header_nritems(eb);
1640 int i, extent_type, ret;
1641 struct btrfs_key key;
1642 struct btrfs_file_extent_item *fi;
1643 u64 bytenr, num_bytes;
1644
1645 /* We can be called directly from walk_up_proc() */
1646 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1647 return 0;
1648
1649 for (i = 0; i < nr; i++) {
1650 btrfs_item_key_to_cpu(eb, &key, i);
1651
1652 if (key.type != BTRFS_EXTENT_DATA_KEY)
1653 continue;
1654
1655 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
1656 /* filter out non qgroup-accountable extents */
1657 extent_type = btrfs_file_extent_type(eb, fi);
1658
1659 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1660 continue;
1661
1662 bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1663 if (!bytenr)
1664 continue;
1665
1666 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1667
1668 ret = btrfs_qgroup_trace_extent(trans, bytenr, num_bytes,
1669 GFP_NOFS);
1670 if (ret)
1671 return ret;
1672 }
1673 cond_resched();
1674 return 0;
1675}
1676
1677/*
1678 * Walk up the tree from the bottom, freeing leaves and any interior
1679 * nodes which have had all slots visited. If a node (leaf or
1680 * interior) is freed, the node above it will have it's slot
1681 * incremented. The root node will never be freed.
1682 *
1683 * At the end of this function, we should have a path which has all
1684 * slots incremented to the next position for a search. If we need to
1685 * read a new node it will be NULL and the node above it will have the
1686 * correct slot selected for a later read.
1687 *
1688 * If we increment the root nodes slot counter past the number of
1689 * elements, 1 is returned to signal completion of the search.
1690 */
1691static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
1692{
1693 int level = 0;
1694 int nr, slot;
1695 struct extent_buffer *eb;
1696
1697 if (root_level == 0)
1698 return 1;
1699
1700 while (level <= root_level) {
1701 eb = path->nodes[level];
1702 nr = btrfs_header_nritems(eb);
1703 path->slots[level]++;
1704 slot = path->slots[level];
1705 if (slot >= nr || level == 0) {
1706 /*
1707 * Don't free the root - we will detect this
1708 * condition after our loop and return a
1709 * positive value for caller to stop walking the tree.
1710 */
1711 if (level != root_level) {
1712 btrfs_tree_unlock_rw(eb, path->locks[level]);
1713 path->locks[level] = 0;
1714
1715 free_extent_buffer(eb);
1716 path->nodes[level] = NULL;
1717 path->slots[level] = 0;
1718 }
1719 } else {
1720 /*
1721 * We have a valid slot to walk back down
1722 * from. Stop here so caller can process these
1723 * new nodes.
1724 */
1725 break;
1726 }
1727
1728 level++;
1729 }
1730
1731 eb = path->nodes[root_level];
1732 if (path->slots[root_level] >= btrfs_header_nritems(eb))
1733 return 1;
1734
1735 return 0;
1736}
1737
1738/*
1739 * Helper function to trace a subtree tree block swap.
1740 *
1741 * The swap will happen in highest tree block, but there may be a lot of
1742 * tree blocks involved.
1743 *
1744 * For example:
1745 * OO = Old tree blocks
1746 * NN = New tree blocks allocated during balance
1747 *
1748 * File tree (257) Reloc tree for 257
1749 * L2 OO NN
1750 * / \ / \
1751 * L1 OO OO (a) OO NN (a)
1752 * / \ / \ / \ / \
1753 * L0 OO OO OO OO OO OO NN NN
1754 * (b) (c) (b) (c)
1755 *
1756 * When calling qgroup_trace_extent_swap(), we will pass:
1757 * @src_eb = OO(a)
1758 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
1759 * @dst_level = 0
1760 * @root_level = 1
1761 *
1762 * In that case, qgroup_trace_extent_swap() will search from OO(a) to
1763 * reach OO(c), then mark both OO(c) and NN(c) as qgroup dirty.
1764 *
1765 * The main work of qgroup_trace_extent_swap() can be split into 3 parts:
1766 *
1767 * 1) Tree search from @src_eb
1768 * It should acts as a simplified btrfs_search_slot().
1769 * The key for search can be extracted from @dst_path->nodes[dst_level]
1770 * (first key).
1771 *
1772 * 2) Mark the final tree blocks in @src_path and @dst_path qgroup dirty
1773 * NOTE: In above case, OO(a) and NN(a) won't be marked qgroup dirty.
1774 * They should be marked during previous (@dst_level = 1) iteration.
1775 *
1776 * 3) Mark file extents in leaves dirty
1777 * We don't have good way to pick out new file extents only.
1778 * So we still follow the old method by scanning all file extents in
1779 * the leave.
1780 *
1781 * This function can free us from keeping two paths, thus later we only need
1782 * to care about how to iterate all new tree blocks in reloc tree.
1783 */
1784static int qgroup_trace_extent_swap(struct btrfs_trans_handle* trans,
1785 struct extent_buffer *src_eb,
1786 struct btrfs_path *dst_path,
1787 int dst_level, int root_level,
1788 bool trace_leaf)
1789{
1790 struct btrfs_key key;
1791 struct btrfs_path *src_path;
1792 struct btrfs_fs_info *fs_info = trans->fs_info;
1793 u32 nodesize = fs_info->nodesize;
1794 int cur_level = root_level;
1795 int ret;
1796
1797 BUG_ON(dst_level > root_level);
1798 /* Level mismatch */
1799 if (btrfs_header_level(src_eb) != root_level)
1800 return -EINVAL;
1801
1802 src_path = btrfs_alloc_path();
1803 if (!src_path) {
1804 ret = -ENOMEM;
1805 goto out;
1806 }
1807
1808 if (dst_level)
1809 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
1810 else
1811 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
1812
1813 /* For src_path */
1814 extent_buffer_get(src_eb);
1815 src_path->nodes[root_level] = src_eb;
1816 src_path->slots[root_level] = dst_path->slots[root_level];
1817 src_path->locks[root_level] = 0;
1818
1819 /* A simplified version of btrfs_search_slot() */
1820 while (cur_level >= dst_level) {
1821 struct btrfs_key src_key;
1822 struct btrfs_key dst_key;
1823
1824 if (src_path->nodes[cur_level] == NULL) {
1825 struct btrfs_key first_key;
1826 struct extent_buffer *eb;
1827 int parent_slot;
1828 u64 child_gen;
1829 u64 child_bytenr;
1830
1831 eb = src_path->nodes[cur_level + 1];
1832 parent_slot = src_path->slots[cur_level + 1];
1833 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
1834 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
1835 btrfs_node_key_to_cpu(eb, &first_key, parent_slot);
1836
1837 eb = read_tree_block(fs_info, child_bytenr, child_gen,
1838 cur_level, &first_key);
1839 if (IS_ERR(eb)) {
1840 ret = PTR_ERR(eb);
1841 goto out;
1842 } else if (!extent_buffer_uptodate(eb)) {
1843 free_extent_buffer(eb);
1844 ret = -EIO;
1845 goto out;
1846 }
1847
1848 src_path->nodes[cur_level] = eb;
1849
1850 btrfs_tree_read_lock(eb);
1851 btrfs_set_lock_blocking_read(eb);
1852 src_path->locks[cur_level] = BTRFS_READ_LOCK_BLOCKING;
1853 }
1854
1855 src_path->slots[cur_level] = dst_path->slots[cur_level];
1856 if (cur_level) {
1857 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
1858 &dst_key, dst_path->slots[cur_level]);
1859 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
1860 &src_key, src_path->slots[cur_level]);
1861 } else {
1862 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
1863 &dst_key, dst_path->slots[cur_level]);
1864 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
1865 &src_key, src_path->slots[cur_level]);
1866 }
1867 /* Content mismatch, something went wrong */
1868 if (btrfs_comp_cpu_keys(&dst_key, &src_key)) {
1869 ret = -ENOENT;
1870 goto out;
1871 }
1872 cur_level--;
1873 }
1874
1875 /*
1876 * Now both @dst_path and @src_path have been populated, record the tree
1877 * blocks for qgroup accounting.
1878 */
1879 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
1880 nodesize, GFP_NOFS);
1881 if (ret < 0)
1882 goto out;
1883 ret = btrfs_qgroup_trace_extent(trans,
1884 dst_path->nodes[dst_level]->start,
1885 nodesize, GFP_NOFS);
1886 if (ret < 0)
1887 goto out;
1888
1889 /* Record leaf file extents */
1890 if (dst_level == 0 && trace_leaf) {
1891 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
1892 if (ret < 0)
1893 goto out;
1894 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
1895 }
1896out:
1897 btrfs_free_path(src_path);
1898 return ret;
1899}
1900
1901/*
1902 * Helper function to do recursive generation-aware depth-first search, to
1903 * locate all new tree blocks in a subtree of reloc tree.
1904 *
1905 * E.g. (OO = Old tree blocks, NN = New tree blocks, whose gen == last_snapshot)
1906 * reloc tree
1907 * L2 NN (a)
1908 * / \
1909 * L1 OO NN (b)
1910 * / \ / \
1911 * L0 OO OO OO NN
1912 * (c) (d)
1913 * If we pass:
1914 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
1915 * @cur_level = 1
1916 * @root_level = 1
1917 *
1918 * We will iterate through tree blocks NN(b), NN(d) and info qgroup to trace
1919 * above tree blocks along with their counter parts in file tree.
1920 * While during search, old tree blocks OO(c) will be skipped as tree block swap
1921 * won't affect OO(c).
1922 */
1923static int qgroup_trace_new_subtree_blocks(struct btrfs_trans_handle* trans,
1924 struct extent_buffer *src_eb,
1925 struct btrfs_path *dst_path,
1926 int cur_level, int root_level,
1927 u64 last_snapshot, bool trace_leaf)
1928{
1929 struct btrfs_fs_info *fs_info = trans->fs_info;
1930 struct extent_buffer *eb;
1931 bool need_cleanup = false;
1932 int ret = 0;
1933 int i;
1934
1935 /* Level sanity check */
1936 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 ||
1937 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
1938 root_level < cur_level) {
1939 btrfs_err_rl(fs_info,
1940 "%s: bad levels, cur_level=%d root_level=%d",
1941 __func__, cur_level, root_level);
1942 return -EUCLEAN;
1943 }
1944
1945 /* Read the tree block if needed */
1946 if (dst_path->nodes[cur_level] == NULL) {
1947 struct btrfs_key first_key;
1948 int parent_slot;
1949 u64 child_gen;
1950 u64 child_bytenr;
1951
1952 /*
1953 * dst_path->nodes[root_level] must be initialized before
1954 * calling this function.
1955 */
1956 if (cur_level == root_level) {
1957 btrfs_err_rl(fs_info,
1958 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
1959 __func__, root_level, root_level, cur_level);
1960 return -EUCLEAN;
1961 }
1962
1963 /*
1964 * We need to get child blockptr/gen from parent before we can
1965 * read it.
1966 */
1967 eb = dst_path->nodes[cur_level + 1];
1968 parent_slot = dst_path->slots[cur_level + 1];
1969 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
1970 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
1971 btrfs_node_key_to_cpu(eb, &first_key, parent_slot);
1972
1973 /* This node is old, no need to trace */
1974 if (child_gen < last_snapshot)
1975 goto out;
1976
1977 eb = read_tree_block(fs_info, child_bytenr, child_gen,
1978 cur_level, &first_key);
1979 if (IS_ERR(eb)) {
1980 ret = PTR_ERR(eb);
1981 goto out;
1982 } else if (!extent_buffer_uptodate(eb)) {
1983 free_extent_buffer(eb);
1984 ret = -EIO;
1985 goto out;
1986 }
1987
1988 dst_path->nodes[cur_level] = eb;
1989 dst_path->slots[cur_level] = 0;
1990
1991 btrfs_tree_read_lock(eb);
1992 btrfs_set_lock_blocking_read(eb);
1993 dst_path->locks[cur_level] = BTRFS_READ_LOCK_BLOCKING;
1994 need_cleanup = true;
1995 }
1996
1997 /* Now record this tree block and its counter part for qgroups */
1998 ret = qgroup_trace_extent_swap(trans, src_eb, dst_path, cur_level,
1999 root_level, trace_leaf);
2000 if (ret < 0)
2001 goto cleanup;
2002
2003 eb = dst_path->nodes[cur_level];
2004
2005 if (cur_level > 0) {
2006 /* Iterate all child tree blocks */
2007 for (i = 0; i < btrfs_header_nritems(eb); i++) {
2008 /* Skip old tree blocks as they won't be swapped */
2009 if (btrfs_node_ptr_generation(eb, i) < last_snapshot)
2010 continue;
2011 dst_path->slots[cur_level] = i;
2012
2013 /* Recursive call (at most 7 times) */
2014 ret = qgroup_trace_new_subtree_blocks(trans, src_eb,
2015 dst_path, cur_level - 1, root_level,
2016 last_snapshot, trace_leaf);
2017 if (ret < 0)
2018 goto cleanup;
2019 }
2020 }
2021
2022cleanup:
2023 if (need_cleanup) {
2024 /* Clean up */
2025 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2026 dst_path->locks[cur_level]);
2027 free_extent_buffer(dst_path->nodes[cur_level]);
2028 dst_path->nodes[cur_level] = NULL;
2029 dst_path->slots[cur_level] = 0;
2030 dst_path->locks[cur_level] = 0;
2031 }
2032out:
2033 return ret;
2034}
2035
2036static int qgroup_trace_subtree_swap(struct btrfs_trans_handle *trans,
2037 struct extent_buffer *src_eb,
2038 struct extent_buffer *dst_eb,
2039 u64 last_snapshot, bool trace_leaf)
2040{
2041 struct btrfs_fs_info *fs_info = trans->fs_info;
2042 struct btrfs_path *dst_path = NULL;
2043 int level;
2044 int ret;
2045
2046 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2047 return 0;
2048
2049 /* Wrong parameter order */
2050 if (btrfs_header_generation(src_eb) > btrfs_header_generation(dst_eb)) {
2051 btrfs_err_rl(fs_info,
2052 "%s: bad parameter order, src_gen=%llu dst_gen=%llu", __func__,
2053 btrfs_header_generation(src_eb),
2054 btrfs_header_generation(dst_eb));
2055 return -EUCLEAN;
2056 }
2057
2058 if (!extent_buffer_uptodate(src_eb) || !extent_buffer_uptodate(dst_eb)) {
2059 ret = -EIO;
2060 goto out;
2061 }
2062
2063 level = btrfs_header_level(dst_eb);
2064 dst_path = btrfs_alloc_path();
2065 if (!dst_path) {
2066 ret = -ENOMEM;
2067 goto out;
2068 }
2069 /* For dst_path */
2070 extent_buffer_get(dst_eb);
2071 dst_path->nodes[level] = dst_eb;
2072 dst_path->slots[level] = 0;
2073 dst_path->locks[level] = 0;
2074
2075 /* Do the generation aware breadth-first search */
2076 ret = qgroup_trace_new_subtree_blocks(trans, src_eb, dst_path, level,
2077 level, last_snapshot, trace_leaf);
2078 if (ret < 0)
2079 goto out;
2080 ret = 0;
2081
2082out:
2083 btrfs_free_path(dst_path);
2084 if (ret < 0)
2085 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2086 return ret;
2087}
2088
2089int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
2090 struct extent_buffer *root_eb,
2091 u64 root_gen, int root_level)
2092{
2093 struct btrfs_fs_info *fs_info = trans->fs_info;
2094 int ret = 0;
2095 int level;
2096 struct extent_buffer *eb = root_eb;
2097 struct btrfs_path *path = NULL;
2098
2099 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL);
2100 BUG_ON(root_eb == NULL);
2101
2102 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2103 return 0;
2104
2105 if (!extent_buffer_uptodate(root_eb)) {
2106 ret = btrfs_read_buffer(root_eb, root_gen, root_level, NULL);
2107 if (ret)
2108 goto out;
2109 }
2110
2111 if (root_level == 0) {
2112 ret = btrfs_qgroup_trace_leaf_items(trans, root_eb);
2113 goto out;
2114 }
2115
2116 path = btrfs_alloc_path();
2117 if (!path)
2118 return -ENOMEM;
2119
2120 /*
2121 * Walk down the tree. Missing extent blocks are filled in as
2122 * we go. Metadata is accounted every time we read a new
2123 * extent block.
2124 *
2125 * When we reach a leaf, we account for file extent items in it,
2126 * walk back up the tree (adjusting slot pointers as we go)
2127 * and restart the search process.
2128 */
2129 extent_buffer_get(root_eb); /* For path */
2130 path->nodes[root_level] = root_eb;
2131 path->slots[root_level] = 0;
2132 path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
2133walk_down:
2134 level = root_level;
2135 while (level >= 0) {
2136 if (path->nodes[level] == NULL) {
2137 struct btrfs_key first_key;
2138 int parent_slot;
2139 u64 child_gen;
2140 u64 child_bytenr;
2141
2142 /*
2143 * We need to get child blockptr/gen from parent before
2144 * we can read it.
2145 */
2146 eb = path->nodes[level + 1];
2147 parent_slot = path->slots[level + 1];
2148 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
2149 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
2150 btrfs_node_key_to_cpu(eb, &first_key, parent_slot);
2151
2152 eb = read_tree_block(fs_info, child_bytenr, child_gen,
2153 level, &first_key);
2154 if (IS_ERR(eb)) {
2155 ret = PTR_ERR(eb);
2156 goto out;
2157 } else if (!extent_buffer_uptodate(eb)) {
2158 free_extent_buffer(eb);
2159 ret = -EIO;
2160 goto out;
2161 }
2162
2163 path->nodes[level] = eb;
2164 path->slots[level] = 0;
2165
2166 btrfs_tree_read_lock(eb);
2167 btrfs_set_lock_blocking_read(eb);
2168 path->locks[level] = BTRFS_READ_LOCK_BLOCKING;
2169
2170 ret = btrfs_qgroup_trace_extent(trans, child_bytenr,
2171 fs_info->nodesize,
2172 GFP_NOFS);
2173 if (ret)
2174 goto out;
2175 }
2176
2177 if (level == 0) {
2178 ret = btrfs_qgroup_trace_leaf_items(trans,
2179 path->nodes[level]);
2180 if (ret)
2181 goto out;
2182
2183 /* Nonzero return here means we completed our search */
2184 ret = adjust_slots_upwards(path, root_level);
2185 if (ret)
2186 break;
2187
2188 /* Restart search with new slots */
2189 goto walk_down;
2190 }
2191
2192 level--;
2193 }
2194
2195 ret = 0;
2196out:
2197 btrfs_free_path(path);
2198
2199 return ret;
2200}
2201
2202#define UPDATE_NEW 0
2203#define UPDATE_OLD 1
2204/*
2205 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2206 */
2207static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
2208 struct ulist *roots, struct ulist *tmp,
2209 struct ulist *qgroups, u64 seq, int update_old)
2210{
2211 struct ulist_node *unode;
2212 struct ulist_iterator uiter;
2213 struct ulist_node *tmp_unode;
2214 struct ulist_iterator tmp_uiter;
2215 struct btrfs_qgroup *qg;
2216 int ret = 0;
2217
2218 if (!roots)
2219 return 0;
2220 ULIST_ITER_INIT(&uiter);
2221 while ((unode = ulist_next(roots, &uiter))) {
2222 qg = find_qgroup_rb(fs_info, unode->val);
2223 if (!qg)
2224 continue;
2225
2226 ulist_reinit(tmp);
2227 ret = ulist_add(qgroups, qg->qgroupid, qgroup_to_aux(qg),
2228 GFP_ATOMIC);
2229 if (ret < 0)
2230 return ret;
2231 ret = ulist_add(tmp, qg->qgroupid, qgroup_to_aux(qg), GFP_ATOMIC);
2232 if (ret < 0)
2233 return ret;
2234 ULIST_ITER_INIT(&tmp_uiter);
2235 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) {
2236 struct btrfs_qgroup_list *glist;
2237
2238 qg = unode_aux_to_qgroup(tmp_unode);
2239 if (update_old)
2240 btrfs_qgroup_update_old_refcnt(qg, seq, 1);
2241 else
2242 btrfs_qgroup_update_new_refcnt(qg, seq, 1);
2243 list_for_each_entry(glist, &qg->groups, next_group) {
2244 ret = ulist_add(qgroups, glist->group->qgroupid,
2245 qgroup_to_aux(glist->group),
2246 GFP_ATOMIC);
2247 if (ret < 0)
2248 return ret;
2249 ret = ulist_add(tmp, glist->group->qgroupid,
2250 qgroup_to_aux(glist->group),
2251 GFP_ATOMIC);
2252 if (ret < 0)
2253 return ret;
2254 }
2255 }
2256 }
2257 return 0;
2258}
2259
2260/*
2261 * Update qgroup rfer/excl counters.
2262 * Rfer update is easy, codes can explain themselves.
2263 *
2264 * Excl update is tricky, the update is split into 2 part.
2265 * Part 1: Possible exclusive <-> sharing detect:
2266 * | A | !A |
2267 * -------------------------------------
2268 * B | * | - |
2269 * -------------------------------------
2270 * !B | + | ** |
2271 * -------------------------------------
2272 *
2273 * Conditions:
2274 * A: cur_old_roots < nr_old_roots (not exclusive before)
2275 * !A: cur_old_roots == nr_old_roots (possible exclusive before)
2276 * B: cur_new_roots < nr_new_roots (not exclusive now)
2277 * !B: cur_new_roots == nr_new_roots (possible exclusive now)
2278 *
2279 * Results:
2280 * +: Possible sharing -> exclusive -: Possible exclusive -> sharing
2281 * *: Definitely not changed. **: Possible unchanged.
2282 *
2283 * For !A and !B condition, the exception is cur_old/new_roots == 0 case.
2284 *
2285 * To make the logic clear, we first use condition A and B to split
2286 * combination into 4 results.
2287 *
2288 * Then, for result "+" and "-", check old/new_roots == 0 case, as in them
2289 * only on variant maybe 0.
2290 *
2291 * Lastly, check result **, since there are 2 variants maybe 0, split them
2292 * again(2x2).
2293 * But this time we don't need to consider other things, the codes and logic
2294 * is easy to understand now.
2295 */
2296static int qgroup_update_counters(struct btrfs_fs_info *fs_info,
2297 struct ulist *qgroups,
2298 u64 nr_old_roots,
2299 u64 nr_new_roots,
2300 u64 num_bytes, u64 seq)
2301{
2302 struct ulist_node *unode;
2303 struct ulist_iterator uiter;
2304 struct btrfs_qgroup *qg;
2305 u64 cur_new_count, cur_old_count;
2306
2307 ULIST_ITER_INIT(&uiter);
2308 while ((unode = ulist_next(qgroups, &uiter))) {
2309 bool dirty = false;
2310
2311 qg = unode_aux_to_qgroup(unode);
2312 cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq);
2313 cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq);
2314
2315 trace_qgroup_update_counters(fs_info, qg, cur_old_count,
2316 cur_new_count);
2317
2318 /* Rfer update part */
2319 if (cur_old_count == 0 && cur_new_count > 0) {
2320 qg->rfer += num_bytes;
2321 qg->rfer_cmpr += num_bytes;
2322 dirty = true;
2323 }
2324 if (cur_old_count > 0 && cur_new_count == 0) {
2325 qg->rfer -= num_bytes;
2326 qg->rfer_cmpr -= num_bytes;
2327 dirty = true;
2328 }
2329
2330 /* Excl update part */
2331 /* Exclusive/none -> shared case */
2332 if (cur_old_count == nr_old_roots &&
2333 cur_new_count < nr_new_roots) {
2334 /* Exclusive -> shared */
2335 if (cur_old_count != 0) {
2336 qg->excl -= num_bytes;
2337 qg->excl_cmpr -= num_bytes;
2338 dirty = true;
2339 }
2340 }
2341
2342 /* Shared -> exclusive/none case */
2343 if (cur_old_count < nr_old_roots &&
2344 cur_new_count == nr_new_roots) {
2345 /* Shared->exclusive */
2346 if (cur_new_count != 0) {
2347 qg->excl += num_bytes;
2348 qg->excl_cmpr += num_bytes;
2349 dirty = true;
2350 }
2351 }
2352
2353 /* Exclusive/none -> exclusive/none case */
2354 if (cur_old_count == nr_old_roots &&
2355 cur_new_count == nr_new_roots) {
2356 if (cur_old_count == 0) {
2357 /* None -> exclusive/none */
2358
2359 if (cur_new_count != 0) {
2360 /* None -> exclusive */
2361 qg->excl += num_bytes;
2362 qg->excl_cmpr += num_bytes;
2363 dirty = true;
2364 }
2365 /* None -> none, nothing changed */
2366 } else {
2367 /* Exclusive -> exclusive/none */
2368
2369 if (cur_new_count == 0) {
2370 /* Exclusive -> none */
2371 qg->excl -= num_bytes;
2372 qg->excl_cmpr -= num_bytes;
2373 dirty = true;
2374 }
2375 /* Exclusive -> exclusive, nothing changed */
2376 }
2377 }
2378
2379 if (dirty)
2380 qgroup_dirty(fs_info, qg);
2381 }
2382 return 0;
2383}
2384
2385/*
2386 * Check if the @roots potentially is a list of fs tree roots
2387 *
2388 * Return 0 for definitely not a fs/subvol tree roots ulist
2389 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2390 * one as well)
2391 */
2392static int maybe_fs_roots(struct ulist *roots)
2393{
2394 struct ulist_node *unode;
2395 struct ulist_iterator uiter;
2396
2397 /* Empty one, still possible for fs roots */
2398 if (!roots || roots->nnodes == 0)
2399 return 1;
2400
2401 ULIST_ITER_INIT(&uiter);
2402 unode = ulist_next(roots, &uiter);
2403 if (!unode)
2404 return 1;
2405
2406 /*
2407 * If it contains fs tree roots, then it must belong to fs/subvol
2408 * trees.
2409 * If it contains a non-fs tree, it won't be shared with fs/subvol trees.
2410 */
2411 return is_fstree(unode->val);
2412}
2413
2414int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
2415 u64 num_bytes, struct ulist *old_roots,
2416 struct ulist *new_roots)
2417{
2418 struct btrfs_fs_info *fs_info = trans->fs_info;
2419 struct ulist *qgroups = NULL;
2420 struct ulist *tmp = NULL;
2421 u64 seq;
2422 u64 nr_new_roots = 0;
2423 u64 nr_old_roots = 0;
2424 int ret = 0;
2425
2426 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2427 return 0;
2428
2429 if (new_roots) {
2430 if (!maybe_fs_roots(new_roots))
2431 goto out_free;
2432 nr_new_roots = new_roots->nnodes;
2433 }
2434 if (old_roots) {
2435 if (!maybe_fs_roots(old_roots))
2436 goto out_free;
2437 nr_old_roots = old_roots->nnodes;
2438 }
2439
2440 /* Quick exit, either not fs tree roots, or won't affect any qgroup */
2441 if (nr_old_roots == 0 && nr_new_roots == 0)
2442 goto out_free;
2443
2444 BUG_ON(!fs_info->quota_root);
2445
2446 trace_btrfs_qgroup_account_extent(fs_info, trans->transid, bytenr,
2447 num_bytes, nr_old_roots, nr_new_roots);
2448
2449 qgroups = ulist_alloc(GFP_NOFS);
2450 if (!qgroups) {
2451 ret = -ENOMEM;
2452 goto out_free;
2453 }
2454 tmp = ulist_alloc(GFP_NOFS);
2455 if (!tmp) {
2456 ret = -ENOMEM;
2457 goto out_free;
2458 }
2459
2460 mutex_lock(&fs_info->qgroup_rescan_lock);
2461 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
2462 if (fs_info->qgroup_rescan_progress.objectid <= bytenr) {
2463 mutex_unlock(&fs_info->qgroup_rescan_lock);
2464 ret = 0;
2465 goto out_free;
2466 }
2467 }
2468 mutex_unlock(&fs_info->qgroup_rescan_lock);
2469
2470 spin_lock(&fs_info->qgroup_lock);
2471 seq = fs_info->qgroup_seq;
2472
2473 /* Update old refcnts using old_roots */
2474 ret = qgroup_update_refcnt(fs_info, old_roots, tmp, qgroups, seq,
2475 UPDATE_OLD);
2476 if (ret < 0)
2477 goto out;
2478
2479 /* Update new refcnts using new_roots */
2480 ret = qgroup_update_refcnt(fs_info, new_roots, tmp, qgroups, seq,
2481 UPDATE_NEW);
2482 if (ret < 0)
2483 goto out;
2484
2485 qgroup_update_counters(fs_info, qgroups, nr_old_roots, nr_new_roots,
2486 num_bytes, seq);
2487
2488 /*
2489 * Bump qgroup_seq to avoid seq overlap
2490 */
2491 fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1;
2492out:
2493 spin_unlock(&fs_info->qgroup_lock);
2494out_free:
2495 ulist_free(tmp);
2496 ulist_free(qgroups);
2497 ulist_free(old_roots);
2498 ulist_free(new_roots);
2499 return ret;
2500}
2501
2502int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans)
2503{
2504 struct btrfs_fs_info *fs_info = trans->fs_info;
2505 struct btrfs_qgroup_extent_record *record;
2506 struct btrfs_delayed_ref_root *delayed_refs;
2507 struct ulist *new_roots = NULL;
2508 struct rb_node *node;
2509 u64 num_dirty_extents = 0;
2510 u64 qgroup_to_skip;
2511 int ret = 0;
2512
2513 delayed_refs = &trans->transaction->delayed_refs;
2514 qgroup_to_skip = delayed_refs->qgroup_to_skip;
2515 while ((node = rb_first(&delayed_refs->dirty_extent_root))) {
2516 record = rb_entry(node, struct btrfs_qgroup_extent_record,
2517 node);
2518
2519 num_dirty_extents++;
2520 trace_btrfs_qgroup_account_extents(fs_info, record);
2521
2522 if (!ret) {
2523 /*
2524 * Old roots should be searched when inserting qgroup
2525 * extent record
2526 */
2527 if (WARN_ON(!record->old_roots)) {
2528 /* Search commit root to find old_roots */
2529 ret = btrfs_find_all_roots(NULL, fs_info,
2530 record->bytenr, 0,
2531 &record->old_roots, false);
2532 if (ret < 0)
2533 goto cleanup;
2534 }
2535
2536 /* Free the reserved data space */
2537 btrfs_qgroup_free_refroot(fs_info,
2538 record->data_rsv_refroot,
2539 record->data_rsv,
2540 BTRFS_QGROUP_RSV_DATA);
2541 /*
2542 * Use SEQ_LAST as time_seq to do special search, which
2543 * doesn't lock tree or delayed_refs and search current
2544 * root. It's safe inside commit_transaction().
2545 */
2546 ret = btrfs_find_all_roots(trans, fs_info,
2547 record->bytenr, SEQ_LAST, &new_roots, false);
2548 if (ret < 0)
2549 goto cleanup;
2550 if (qgroup_to_skip) {
2551 ulist_del(new_roots, qgroup_to_skip, 0);
2552 ulist_del(record->old_roots, qgroup_to_skip,
2553 0);
2554 }
2555 ret = btrfs_qgroup_account_extent(trans, record->bytenr,
2556 record->num_bytes,
2557 record->old_roots,
2558 new_roots);
2559 record->old_roots = NULL;
2560 new_roots = NULL;
2561 }
2562cleanup:
2563 ulist_free(record->old_roots);
2564 ulist_free(new_roots);
2565 new_roots = NULL;
2566 rb_erase(node, &delayed_refs->dirty_extent_root);
2567 kfree(record);
2568
2569 }
2570 trace_qgroup_num_dirty_extents(fs_info, trans->transid,
2571 num_dirty_extents);
2572 return ret;
2573}
2574
2575/*
2576 * called from commit_transaction. Writes all changed qgroups to disk.
2577 */
2578int btrfs_run_qgroups(struct btrfs_trans_handle *trans)
2579{
2580 struct btrfs_fs_info *fs_info = trans->fs_info;
2581 struct btrfs_root *quota_root = fs_info->quota_root;
2582 int ret = 0;
2583
2584 if (!quota_root)
2585 return ret;
2586
2587 spin_lock(&fs_info->qgroup_lock);
2588 while (!list_empty(&fs_info->dirty_qgroups)) {
2589 struct btrfs_qgroup *qgroup;
2590 qgroup = list_first_entry(&fs_info->dirty_qgroups,
2591 struct btrfs_qgroup, dirty);
2592 list_del_init(&qgroup->dirty);
2593 spin_unlock(&fs_info->qgroup_lock);
2594 ret = update_qgroup_info_item(trans, qgroup);
2595 if (ret)
2596 fs_info->qgroup_flags |=
2597 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2598 ret = update_qgroup_limit_item(trans, qgroup);
2599 if (ret)
2600 fs_info->qgroup_flags |=
2601 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2602 spin_lock(&fs_info->qgroup_lock);
2603 }
2604 if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2605 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
2606 else
2607 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
2608 spin_unlock(&fs_info->qgroup_lock);
2609
2610 ret = update_qgroup_status_item(trans);
2611 if (ret)
2612 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2613
2614 return ret;
2615}
2616
2617/*
2618 * Copy the accounting information between qgroups. This is necessary
2619 * when a snapshot or a subvolume is created. Throwing an error will
2620 * cause a transaction abort so we take extra care here to only error
2621 * when a readonly fs is a reasonable outcome.
2622 */
2623int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
2624 u64 objectid, struct btrfs_qgroup_inherit *inherit)
2625{
2626 int ret = 0;
2627 int i;
2628 u64 *i_qgroups;
2629 bool committing = false;
2630 struct btrfs_fs_info *fs_info = trans->fs_info;
2631 struct btrfs_root *quota_root;
2632 struct btrfs_qgroup *srcgroup;
2633 struct btrfs_qgroup *dstgroup;
2634 u32 level_size = 0;
2635 u64 nums;
2636
2637 /*
2638 * There are only two callers of this function.
2639 *
2640 * One in create_subvol() in the ioctl context, which needs to hold
2641 * the qgroup_ioctl_lock.
2642 *
2643 * The other one in create_pending_snapshot() where no other qgroup
2644 * code can modify the fs as they all need to either start a new trans
2645 * or hold a trans handler, thus we don't need to hold
2646 * qgroup_ioctl_lock.
2647 * This would avoid long and complex lock chain and make lockdep happy.
2648 */
2649 spin_lock(&fs_info->trans_lock);
2650 if (trans->transaction->state == TRANS_STATE_COMMIT_DOING)
2651 committing = true;
2652 spin_unlock(&fs_info->trans_lock);
2653
2654 if (!committing)
2655 mutex_lock(&fs_info->qgroup_ioctl_lock);
2656 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2657 goto out;
2658
2659 quota_root = fs_info->quota_root;
2660 if (!quota_root) {
2661 ret = -EINVAL;
2662 goto out;
2663 }
2664
2665 if (inherit) {
2666 i_qgroups = (u64 *)(inherit + 1);
2667 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
2668 2 * inherit->num_excl_copies;
2669 for (i = 0; i < nums; ++i) {
2670 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
2671
2672 /*
2673 * Zero out invalid groups so we can ignore
2674 * them later.
2675 */
2676 if (!srcgroup ||
2677 ((srcgroup->qgroupid >> 48) <= (objectid >> 48)))
2678 *i_qgroups = 0ULL;
2679
2680 ++i_qgroups;
2681 }
2682 }
2683
2684 /*
2685 * create a tracking group for the subvol itself
2686 */
2687 ret = add_qgroup_item(trans, quota_root, objectid);
2688 if (ret)
2689 goto out;
2690
2691 /*
2692 * add qgroup to all inherited groups
2693 */
2694 if (inherit) {
2695 i_qgroups = (u64 *)(inherit + 1);
2696 for (i = 0; i < inherit->num_qgroups; ++i, ++i_qgroups) {
2697 if (*i_qgroups == 0)
2698 continue;
2699 ret = add_qgroup_relation_item(trans, objectid,
2700 *i_qgroups);
2701 if (ret && ret != -EEXIST)
2702 goto out;
2703 ret = add_qgroup_relation_item(trans, *i_qgroups,
2704 objectid);
2705 if (ret && ret != -EEXIST)
2706 goto out;
2707 }
2708 ret = 0;
2709 }
2710
2711
2712 spin_lock(&fs_info->qgroup_lock);
2713
2714 dstgroup = add_qgroup_rb(fs_info, objectid);
2715 if (IS_ERR(dstgroup)) {
2716 ret = PTR_ERR(dstgroup);
2717 goto unlock;
2718 }
2719
2720 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
2721 dstgroup->lim_flags = inherit->lim.flags;
2722 dstgroup->max_rfer = inherit->lim.max_rfer;
2723 dstgroup->max_excl = inherit->lim.max_excl;
2724 dstgroup->rsv_rfer = inherit->lim.rsv_rfer;
2725 dstgroup->rsv_excl = inherit->lim.rsv_excl;
2726
2727 ret = update_qgroup_limit_item(trans, dstgroup);
2728 if (ret) {
2729 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2730 btrfs_info(fs_info,
2731 "unable to update quota limit for %llu",
2732 dstgroup->qgroupid);
2733 goto unlock;
2734 }
2735 }
2736
2737 if (srcid) {
2738 srcgroup = find_qgroup_rb(fs_info, srcid);
2739 if (!srcgroup)
2740 goto unlock;
2741
2742 /*
2743 * We call inherit after we clone the root in order to make sure
2744 * our counts don't go crazy, so at this point the only
2745 * difference between the two roots should be the root node.
2746 */
2747 level_size = fs_info->nodesize;
2748 dstgroup->rfer = srcgroup->rfer;
2749 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
2750 dstgroup->excl = level_size;
2751 dstgroup->excl_cmpr = level_size;
2752 srcgroup->excl = level_size;
2753 srcgroup->excl_cmpr = level_size;
2754
2755 /* inherit the limit info */
2756 dstgroup->lim_flags = srcgroup->lim_flags;
2757 dstgroup->max_rfer = srcgroup->max_rfer;
2758 dstgroup->max_excl = srcgroup->max_excl;
2759 dstgroup->rsv_rfer = srcgroup->rsv_rfer;
2760 dstgroup->rsv_excl = srcgroup->rsv_excl;
2761
2762 qgroup_dirty(fs_info, dstgroup);
2763 qgroup_dirty(fs_info, srcgroup);
2764 }
2765
2766 if (!inherit)
2767 goto unlock;
2768
2769 i_qgroups = (u64 *)(inherit + 1);
2770 for (i = 0; i < inherit->num_qgroups; ++i) {
2771 if (*i_qgroups) {
2772 ret = add_relation_rb(fs_info, objectid, *i_qgroups);
2773 if (ret)
2774 goto unlock;
2775 }
2776 ++i_qgroups;
2777 }
2778
2779 for (i = 0; i < inherit->num_ref_copies; ++i, i_qgroups += 2) {
2780 struct btrfs_qgroup *src;
2781 struct btrfs_qgroup *dst;
2782
2783 if (!i_qgroups[0] || !i_qgroups[1])
2784 continue;
2785
2786 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2787 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2788
2789 if (!src || !dst) {
2790 ret = -EINVAL;
2791 goto unlock;
2792 }
2793
2794 dst->rfer = src->rfer - level_size;
2795 dst->rfer_cmpr = src->rfer_cmpr - level_size;
2796 }
2797 for (i = 0; i < inherit->num_excl_copies; ++i, i_qgroups += 2) {
2798 struct btrfs_qgroup *src;
2799 struct btrfs_qgroup *dst;
2800
2801 if (!i_qgroups[0] || !i_qgroups[1])
2802 continue;
2803
2804 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2805 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2806
2807 if (!src || !dst) {
2808 ret = -EINVAL;
2809 goto unlock;
2810 }
2811
2812 dst->excl = src->excl + level_size;
2813 dst->excl_cmpr = src->excl_cmpr + level_size;
2814 }
2815
2816unlock:
2817 spin_unlock(&fs_info->qgroup_lock);
2818out:
2819 if (!committing)
2820 mutex_unlock(&fs_info->qgroup_ioctl_lock);
2821 return ret;
2822}
2823
2824/*
2825 * Two limits to commit transaction in advance.
2826 *
2827 * For RATIO, it will be 1/RATIO of the remaining limit as threshold.
2828 * For SIZE, it will be in byte unit as threshold.
2829 */
2830#define QGROUP_FREE_RATIO 32
2831#define QGROUP_FREE_SIZE SZ_32M
2832static bool qgroup_check_limits(struct btrfs_fs_info *fs_info,
2833 const struct btrfs_qgroup *qg, u64 num_bytes)
2834{
2835 u64 free;
2836 u64 threshold;
2837
2838 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
2839 qgroup_rsv_total(qg) + (s64)qg->rfer + num_bytes > qg->max_rfer)
2840 return false;
2841
2842 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
2843 qgroup_rsv_total(qg) + (s64)qg->excl + num_bytes > qg->max_excl)
2844 return false;
2845
2846 /*
2847 * Even if we passed the check, it's better to check if reservation
2848 * for meta_pertrans is pushing us near limit.
2849 * If there is too much pertrans reservation or it's near the limit,
2850 * let's try commit transaction to free some, using transaction_kthread
2851 */
2852 if ((qg->lim_flags & (BTRFS_QGROUP_LIMIT_MAX_RFER |
2853 BTRFS_QGROUP_LIMIT_MAX_EXCL))) {
2854 if (qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
2855 free = qg->max_excl - qgroup_rsv_total(qg) - qg->excl;
2856 threshold = min_t(u64, qg->max_excl / QGROUP_FREE_RATIO,
2857 QGROUP_FREE_SIZE);
2858 } else {
2859 free = qg->max_rfer - qgroup_rsv_total(qg) - qg->rfer;
2860 threshold = min_t(u64, qg->max_rfer / QGROUP_FREE_RATIO,
2861 QGROUP_FREE_SIZE);
2862 }
2863
2864 /*
2865 * Use transaction_kthread to commit transaction, so we no
2866 * longer need to bother nested transaction nor lock context.
2867 */
2868 if (free < threshold)
2869 btrfs_commit_transaction_locksafe(fs_info);
2870 }
2871
2872 return true;
2873}
2874
2875static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce,
2876 enum btrfs_qgroup_rsv_type type)
2877{
2878 struct btrfs_root *quota_root;
2879 struct btrfs_qgroup *qgroup;
2880 struct btrfs_fs_info *fs_info = root->fs_info;
2881 u64 ref_root = root->root_key.objectid;
2882 int ret = 0;
2883 struct ulist_node *unode;
2884 struct ulist_iterator uiter;
2885
2886 if (!is_fstree(ref_root))
2887 return 0;
2888
2889 if (num_bytes == 0)
2890 return 0;
2891
2892 if (test_bit(BTRFS_FS_QUOTA_OVERRIDE, &fs_info->flags) &&
2893 capable(CAP_SYS_RESOURCE))
2894 enforce = false;
2895
2896 spin_lock(&fs_info->qgroup_lock);
2897 quota_root = fs_info->quota_root;
2898 if (!quota_root)
2899 goto out;
2900
2901 qgroup = find_qgroup_rb(fs_info, ref_root);
2902 if (!qgroup)
2903 goto out;
2904
2905 /*
2906 * in a first step, we check all affected qgroups if any limits would
2907 * be exceeded
2908 */
2909 ulist_reinit(fs_info->qgroup_ulist);
2910 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
2911 qgroup_to_aux(qgroup), GFP_ATOMIC);
2912 if (ret < 0)
2913 goto out;
2914 ULIST_ITER_INIT(&uiter);
2915 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2916 struct btrfs_qgroup *qg;
2917 struct btrfs_qgroup_list *glist;
2918
2919 qg = unode_aux_to_qgroup(unode);
2920
2921 if (enforce && !qgroup_check_limits(fs_info, qg, num_bytes)) {
2922 ret = -EDQUOT;
2923 goto out;
2924 }
2925
2926 list_for_each_entry(glist, &qg->groups, next_group) {
2927 ret = ulist_add(fs_info->qgroup_ulist,
2928 glist->group->qgroupid,
2929 qgroup_to_aux(glist->group), GFP_ATOMIC);
2930 if (ret < 0)
2931 goto out;
2932 }
2933 }
2934 ret = 0;
2935 /*
2936 * no limits exceeded, now record the reservation into all qgroups
2937 */
2938 ULIST_ITER_INIT(&uiter);
2939 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2940 struct btrfs_qgroup *qg;
2941
2942 qg = unode_aux_to_qgroup(unode);
2943
2944 qgroup_rsv_add(fs_info, qg, num_bytes, type);
2945 }
2946
2947out:
2948 spin_unlock(&fs_info->qgroup_lock);
2949 return ret;
2950}
2951
2952/*
2953 * Free @num_bytes of reserved space with @type for qgroup. (Normally level 0
2954 * qgroup).
2955 *
2956 * Will handle all higher level qgroup too.
2957 *
2958 * NOTE: If @num_bytes is (u64)-1, this means to free all bytes of this qgroup.
2959 * This special case is only used for META_PERTRANS type.
2960 */
2961void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
2962 u64 ref_root, u64 num_bytes,
2963 enum btrfs_qgroup_rsv_type type)
2964{
2965 struct btrfs_root *quota_root;
2966 struct btrfs_qgroup *qgroup;
2967 struct ulist_node *unode;
2968 struct ulist_iterator uiter;
2969 int ret = 0;
2970
2971 if (!is_fstree(ref_root))
2972 return;
2973
2974 if (num_bytes == 0)
2975 return;
2976
2977 if (num_bytes == (u64)-1 && type != BTRFS_QGROUP_RSV_META_PERTRANS) {
2978 WARN(1, "%s: Invalid type to free", __func__);
2979 return;
2980 }
2981 spin_lock(&fs_info->qgroup_lock);
2982
2983 quota_root = fs_info->quota_root;
2984 if (!quota_root)
2985 goto out;
2986
2987 qgroup = find_qgroup_rb(fs_info, ref_root);
2988 if (!qgroup)
2989 goto out;
2990
2991 if (num_bytes == (u64)-1)
2992 /*
2993 * We're freeing all pertrans rsv, get reserved value from
2994 * level 0 qgroup as real num_bytes to free.
2995 */
2996 num_bytes = qgroup->rsv.values[type];
2997
2998 ulist_reinit(fs_info->qgroup_ulist);
2999 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3000 qgroup_to_aux(qgroup), GFP_ATOMIC);
3001 if (ret < 0)
3002 goto out;
3003 ULIST_ITER_INIT(&uiter);
3004 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3005 struct btrfs_qgroup *qg;
3006 struct btrfs_qgroup_list *glist;
3007
3008 qg = unode_aux_to_qgroup(unode);
3009
3010 qgroup_rsv_release(fs_info, qg, num_bytes, type);
3011
3012 list_for_each_entry(glist, &qg->groups, next_group) {
3013 ret = ulist_add(fs_info->qgroup_ulist,
3014 glist->group->qgroupid,
3015 qgroup_to_aux(glist->group), GFP_ATOMIC);
3016 if (ret < 0)
3017 goto out;
3018 }
3019 }
3020
3021out:
3022 spin_unlock(&fs_info->qgroup_lock);
3023}
3024
3025/*
3026 * Check if the leaf is the last leaf. Which means all node pointers
3027 * are at their last position.
3028 */
3029static bool is_last_leaf(struct btrfs_path *path)
3030{
3031 int i;
3032
3033 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3034 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3035 return false;
3036 }
3037 return true;
3038}
3039
3040/*
3041 * returns < 0 on error, 0 when more leafs are to be scanned.
3042 * returns 1 when done.
3043 */
3044static int qgroup_rescan_leaf(struct btrfs_trans_handle *trans,
3045 struct btrfs_path *path)
3046{
3047 struct btrfs_fs_info *fs_info = trans->fs_info;
3048 struct btrfs_key found;
3049 struct extent_buffer *scratch_leaf = NULL;
3050 struct ulist *roots = NULL;
3051 u64 num_bytes;
3052 bool done;
3053 int slot;
3054 int ret;
3055
3056 mutex_lock(&fs_info->qgroup_rescan_lock);
3057 ret = btrfs_search_slot_for_read(fs_info->extent_root,
3058 &fs_info->qgroup_rescan_progress,
3059 path, 1, 0);
3060
3061 btrfs_debug(fs_info,
3062 "current progress key (%llu %u %llu), search_slot ret %d",
3063 fs_info->qgroup_rescan_progress.objectid,
3064 fs_info->qgroup_rescan_progress.type,
3065 fs_info->qgroup_rescan_progress.offset, ret);
3066
3067 if (ret) {
3068 /*
3069 * The rescan is about to end, we will not be scanning any
3070 * further blocks. We cannot unset the RESCAN flag here, because
3071 * we want to commit the transaction if everything went well.
3072 * To make the live accounting work in this phase, we set our
3073 * scan progress pointer such that every real extent objectid
3074 * will be smaller.
3075 */
3076 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3077 btrfs_release_path(path);
3078 mutex_unlock(&fs_info->qgroup_rescan_lock);
3079 return ret;
3080 }
3081 done = is_last_leaf(path);
3082
3083 btrfs_item_key_to_cpu(path->nodes[0], &found,
3084 btrfs_header_nritems(path->nodes[0]) - 1);
3085 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
3086
3087 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);
3088 if (!scratch_leaf) {
3089 ret = -ENOMEM;
3090 mutex_unlock(&fs_info->qgroup_rescan_lock);
3091 goto out;
3092 }
3093 slot = path->slots[0];
3094 btrfs_release_path(path);
3095 mutex_unlock(&fs_info->qgroup_rescan_lock);
3096
3097 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
3098 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
3099 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
3100 found.type != BTRFS_METADATA_ITEM_KEY)
3101 continue;
3102 if (found.type == BTRFS_METADATA_ITEM_KEY)
3103 num_bytes = fs_info->nodesize;
3104 else
3105 num_bytes = found.offset;
3106
3107 ret = btrfs_find_all_roots(NULL, fs_info, found.objectid, 0,
3108 &roots, false);
3109 if (ret < 0)
3110 goto out;
3111 /* For rescan, just pass old_roots as NULL */
3112 ret = btrfs_qgroup_account_extent(trans, found.objectid,
3113 num_bytes, NULL, roots);
3114 if (ret < 0)
3115 goto out;
3116 }
3117out:
3118 if (scratch_leaf)
3119 free_extent_buffer(scratch_leaf);
3120
3121 if (done && !ret) {
3122 ret = 1;
3123 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3124 }
3125 return ret;
3126}
3127
3128static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
3129{
3130 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
3131 qgroup_rescan_work);
3132 struct btrfs_path *path;
3133 struct btrfs_trans_handle *trans = NULL;
3134 int err = -ENOMEM;
3135 int ret = 0;
3136
3137 path = btrfs_alloc_path();
3138 if (!path)
3139 goto out;
3140 /*
3141 * Rescan should only search for commit root, and any later difference
3142 * should be recorded by qgroup
3143 */
3144 path->search_commit_root = 1;
3145 path->skip_locking = 1;
3146
3147 err = 0;
3148 while (!err && !btrfs_fs_closing(fs_info)) {
3149 trans = btrfs_start_transaction(fs_info->fs_root, 0);
3150 if (IS_ERR(trans)) {
3151 err = PTR_ERR(trans);
3152 break;
3153 }
3154 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) {
3155 err = -EINTR;
3156 } else {
3157 err = qgroup_rescan_leaf(trans, path);
3158 }
3159 if (err > 0)
3160 btrfs_commit_transaction(trans);
3161 else
3162 btrfs_end_transaction(trans);
3163 }
3164
3165out:
3166 btrfs_free_path(path);
3167
3168 mutex_lock(&fs_info->qgroup_rescan_lock);
3169 if (err > 0 &&
3170 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
3171 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3172 } else if (err < 0) {
3173 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3174 }
3175 mutex_unlock(&fs_info->qgroup_rescan_lock);
3176
3177 /*
3178 * only update status, since the previous part has already updated the
3179 * qgroup info.
3180 */
3181 trans = btrfs_start_transaction(fs_info->quota_root, 1);
3182 if (IS_ERR(trans)) {
3183 err = PTR_ERR(trans);
3184 trans = NULL;
3185 btrfs_err(fs_info,
3186 "fail to start transaction for status update: %d",
3187 err);
3188 }
3189
3190 mutex_lock(&fs_info->qgroup_rescan_lock);
3191 if (!btrfs_fs_closing(fs_info))
3192 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3193 if (trans) {
3194 ret = update_qgroup_status_item(trans);
3195 if (ret < 0) {
3196 err = ret;
3197 btrfs_err(fs_info, "fail to update qgroup status: %d",
3198 err);
3199 }
3200 }
3201 fs_info->qgroup_rescan_running = false;
3202 complete_all(&fs_info->qgroup_rescan_completion);
3203 mutex_unlock(&fs_info->qgroup_rescan_lock);
3204
3205 if (!trans)
3206 return;
3207
3208 btrfs_end_transaction(trans);
3209
3210 if (btrfs_fs_closing(fs_info)) {
3211 btrfs_info(fs_info, "qgroup scan paused");
3212 } else if (err >= 0) {
3213 btrfs_info(fs_info, "qgroup scan completed%s",
3214 err > 0 ? " (inconsistency flag cleared)" : "");
3215 } else {
3216 btrfs_err(fs_info, "qgroup scan failed with %d", err);
3217 }
3218}
3219
3220/*
3221 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
3222 * memory required for the rescan context.
3223 */
3224static int
3225qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
3226 int init_flags)
3227{
3228 int ret = 0;
3229
3230 if (!init_flags) {
3231 /* we're resuming qgroup rescan at mount time */
3232 if (!(fs_info->qgroup_flags &
3233 BTRFS_QGROUP_STATUS_FLAG_RESCAN)) {
3234 btrfs_warn(fs_info,
3235 "qgroup rescan init failed, qgroup is not enabled");
3236 ret = -EINVAL;
3237 } else if (!(fs_info->qgroup_flags &
3238 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3239 btrfs_warn(fs_info,
3240 "qgroup rescan init failed, qgroup rescan is not queued");
3241 ret = -EINVAL;
3242 }
3243
3244 if (ret)
3245 return ret;
3246 }
3247
3248 mutex_lock(&fs_info->qgroup_rescan_lock);
3249 spin_lock(&fs_info->qgroup_lock);
3250
3251 if (init_flags) {
3252 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3253 btrfs_warn(fs_info,
3254 "qgroup rescan is already in progress");
3255 ret = -EINPROGRESS;
3256 } else if (!(fs_info->qgroup_flags &
3257 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3258 btrfs_warn(fs_info,
3259 "qgroup rescan init failed, qgroup is not enabled");
3260 ret = -EINVAL;
3261 }
3262
3263 if (ret) {
3264 spin_unlock(&fs_info->qgroup_lock);
3265 mutex_unlock(&fs_info->qgroup_rescan_lock);
3266 return ret;
3267 }
3268 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3269 }
3270
3271 memset(&fs_info->qgroup_rescan_progress, 0,
3272 sizeof(fs_info->qgroup_rescan_progress));
3273 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
3274 init_completion(&fs_info->qgroup_rescan_completion);
3275 fs_info->qgroup_rescan_running = true;
3276
3277 spin_unlock(&fs_info->qgroup_lock);
3278 mutex_unlock(&fs_info->qgroup_rescan_lock);
3279
3280 memset(&fs_info->qgroup_rescan_work, 0,
3281 sizeof(fs_info->qgroup_rescan_work));
3282 btrfs_init_work(&fs_info->qgroup_rescan_work,
3283 btrfs_qgroup_rescan_helper,
3284 btrfs_qgroup_rescan_worker, NULL, NULL);
3285 return 0;
3286}
3287
3288static void
3289qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
3290{
3291 struct rb_node *n;
3292 struct btrfs_qgroup *qgroup;
3293
3294 spin_lock(&fs_info->qgroup_lock);
3295 /* clear all current qgroup tracking information */
3296 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
3297 qgroup = rb_entry(n, struct btrfs_qgroup, node);
3298 qgroup->rfer = 0;
3299 qgroup->rfer_cmpr = 0;
3300 qgroup->excl = 0;
3301 qgroup->excl_cmpr = 0;
3302 qgroup_dirty(fs_info, qgroup);
3303 }
3304 spin_unlock(&fs_info->qgroup_lock);
3305}
3306
3307int
3308btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
3309{
3310 int ret = 0;
3311 struct btrfs_trans_handle *trans;
3312
3313 ret = qgroup_rescan_init(fs_info, 0, 1);
3314 if (ret)
3315 return ret;
3316
3317 /*
3318 * We have set the rescan_progress to 0, which means no more
3319 * delayed refs will be accounted by btrfs_qgroup_account_ref.
3320 * However, btrfs_qgroup_account_ref may be right after its call
3321 * to btrfs_find_all_roots, in which case it would still do the
3322 * accounting.
3323 * To solve this, we're committing the transaction, which will
3324 * ensure we run all delayed refs and only after that, we are
3325 * going to clear all tracking information for a clean start.
3326 */
3327
3328 trans = btrfs_join_transaction(fs_info->fs_root);
3329 if (IS_ERR(trans)) {
3330 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3331 return PTR_ERR(trans);
3332 }
3333 ret = btrfs_commit_transaction(trans);
3334 if (ret) {
3335 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3336 return ret;
3337 }
3338
3339 qgroup_rescan_zero_tracking(fs_info);
3340
3341 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3342 &fs_info->qgroup_rescan_work);
3343
3344 return 0;
3345}
3346
3347int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
3348 bool interruptible)
3349{
3350 int running;
3351 int ret = 0;
3352
3353 mutex_lock(&fs_info->qgroup_rescan_lock);
3354 spin_lock(&fs_info->qgroup_lock);
3355 running = fs_info->qgroup_rescan_running;
3356 spin_unlock(&fs_info->qgroup_lock);
3357 mutex_unlock(&fs_info->qgroup_rescan_lock);
3358
3359 if (!running)
3360 return 0;
3361
3362 if (interruptible)
3363 ret = wait_for_completion_interruptible(
3364 &fs_info->qgroup_rescan_completion);
3365 else
3366 wait_for_completion(&fs_info->qgroup_rescan_completion);
3367
3368 return ret;
3369}
3370
3371/*
3372 * this is only called from open_ctree where we're still single threaded, thus
3373 * locking is omitted here.
3374 */
3375void
3376btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
3377{
3378 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
3379 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3380 &fs_info->qgroup_rescan_work);
3381}
3382
3383/*
3384 * Reserve qgroup space for range [start, start + len).
3385 *
3386 * This function will either reserve space from related qgroups or doing
3387 * nothing if the range is already reserved.
3388 *
3389 * Return 0 for successful reserve
3390 * Return <0 for error (including -EQUOT)
3391 *
3392 * NOTE: this function may sleep for memory allocation.
3393 * if btrfs_qgroup_reserve_data() is called multiple times with
3394 * same @reserved, caller must ensure when error happens it's OK
3395 * to free *ALL* reserved space.
3396 */
3397int btrfs_qgroup_reserve_data(struct inode *inode,
3398 struct extent_changeset **reserved_ret, u64 start,
3399 u64 len)
3400{
3401 struct btrfs_root *root = BTRFS_I(inode)->root;
3402 struct ulist_node *unode;
3403 struct ulist_iterator uiter;
3404 struct extent_changeset *reserved;
3405 u64 orig_reserved;
3406 u64 to_reserve;
3407 int ret;
3408
3409 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &root->fs_info->flags) ||
3410 !is_fstree(root->root_key.objectid) || len == 0)
3411 return 0;
3412
3413 /* @reserved parameter is mandatory for qgroup */
3414 if (WARN_ON(!reserved_ret))
3415 return -EINVAL;
3416 if (!*reserved_ret) {
3417 *reserved_ret = extent_changeset_alloc();
3418 if (!*reserved_ret)
3419 return -ENOMEM;
3420 }
3421 reserved = *reserved_ret;
3422 /* Record already reserved space */
3423 orig_reserved = reserved->bytes_changed;
3424 ret = set_record_extent_bits(&BTRFS_I(inode)->io_tree, start,
3425 start + len -1, EXTENT_QGROUP_RESERVED, reserved);
3426
3427 /* Newly reserved space */
3428 to_reserve = reserved->bytes_changed - orig_reserved;
3429 trace_btrfs_qgroup_reserve_data(inode, start, len,
3430 to_reserve, QGROUP_RESERVE);
3431 if (ret < 0)
3432 goto cleanup;
3433 ret = qgroup_reserve(root, to_reserve, true, BTRFS_QGROUP_RSV_DATA);
3434 if (ret < 0)
3435 goto cleanup;
3436
3437 return ret;
3438
3439cleanup:
3440 /* cleanup *ALL* already reserved ranges */
3441 ULIST_ITER_INIT(&uiter);
3442 while ((unode = ulist_next(&reserved->range_changed, &uiter)))
3443 clear_extent_bit(&BTRFS_I(inode)->io_tree, unode->val,
3444 unode->aux, EXTENT_QGROUP_RESERVED, 0, 0, NULL);
3445 /* Also free data bytes of already reserved one */
3446 btrfs_qgroup_free_refroot(root->fs_info, root->root_key.objectid,
3447 orig_reserved, BTRFS_QGROUP_RSV_DATA);
3448 extent_changeset_release(reserved);
3449 return ret;
3450}
3451
3452/* Free ranges specified by @reserved, normally in error path */
3453static int qgroup_free_reserved_data(struct inode *inode,
3454 struct extent_changeset *reserved, u64 start, u64 len)
3455{
3456 struct btrfs_root *root = BTRFS_I(inode)->root;
3457 struct ulist_node *unode;
3458 struct ulist_iterator uiter;
3459 struct extent_changeset changeset;
3460 int freed = 0;
3461 int ret;
3462
3463 extent_changeset_init(&changeset);
3464 len = round_up(start + len, root->fs_info->sectorsize);
3465 start = round_down(start, root->fs_info->sectorsize);
3466
3467 ULIST_ITER_INIT(&uiter);
3468 while ((unode = ulist_next(&reserved->range_changed, &uiter))) {
3469 u64 range_start = unode->val;
3470 /* unode->aux is the inclusive end */
3471 u64 range_len = unode->aux - range_start + 1;
3472 u64 free_start;
3473 u64 free_len;
3474
3475 extent_changeset_release(&changeset);
3476
3477 /* Only free range in range [start, start + len) */
3478 if (range_start >= start + len ||
3479 range_start + range_len <= start)
3480 continue;
3481 free_start = max(range_start, start);
3482 free_len = min(start + len, range_start + range_len) -
3483 free_start;
3484 /*
3485 * TODO: To also modify reserved->ranges_reserved to reflect
3486 * the modification.
3487 *
3488 * However as long as we free qgroup reserved according to
3489 * EXTENT_QGROUP_RESERVED, we won't double free.
3490 * So not need to rush.
3491 */
3492 ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree,
3493 free_start, free_start + free_len - 1,
3494 EXTENT_QGROUP_RESERVED, &changeset);
3495 if (ret < 0)
3496 goto out;
3497 freed += changeset.bytes_changed;
3498 }
3499 btrfs_qgroup_free_refroot(root->fs_info, root->root_key.objectid, freed,
3500 BTRFS_QGROUP_RSV_DATA);
3501 ret = freed;
3502out:
3503 extent_changeset_release(&changeset);
3504 return ret;
3505}
3506
3507static int __btrfs_qgroup_release_data(struct inode *inode,
3508 struct extent_changeset *reserved, u64 start, u64 len,
3509 int free)
3510{
3511 struct extent_changeset changeset;
3512 int trace_op = QGROUP_RELEASE;
3513 int ret;
3514
3515 if (!test_bit(BTRFS_FS_QUOTA_ENABLED,
3516 &BTRFS_I(inode)->root->fs_info->flags))
3517 return 0;
3518
3519 /* In release case, we shouldn't have @reserved */
3520 WARN_ON(!free && reserved);
3521 if (free && reserved)
3522 return qgroup_free_reserved_data(inode, reserved, start, len);
3523 extent_changeset_init(&changeset);
3524 ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, start,
3525 start + len -1, EXTENT_QGROUP_RESERVED, &changeset);
3526 if (ret < 0)
3527 goto out;
3528
3529 if (free)
3530 trace_op = QGROUP_FREE;
3531 trace_btrfs_qgroup_release_data(inode, start, len,
3532 changeset.bytes_changed, trace_op);
3533 if (free)
3534 btrfs_qgroup_free_refroot(BTRFS_I(inode)->root->fs_info,
3535 BTRFS_I(inode)->root->root_key.objectid,
3536 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
3537 ret = changeset.bytes_changed;
3538out:
3539 extent_changeset_release(&changeset);
3540 return ret;
3541}
3542
3543/*
3544 * Free a reserved space range from io_tree and related qgroups
3545 *
3546 * Should be called when a range of pages get invalidated before reaching disk.
3547 * Or for error cleanup case.
3548 * if @reserved is given, only reserved range in [@start, @start + @len) will
3549 * be freed.
3550 *
3551 * For data written to disk, use btrfs_qgroup_release_data().
3552 *
3553 * NOTE: This function may sleep for memory allocation.
3554 */
3555int btrfs_qgroup_free_data(struct inode *inode,
3556 struct extent_changeset *reserved, u64 start, u64 len)
3557{
3558 return __btrfs_qgroup_release_data(inode, reserved, start, len, 1);
3559}
3560
3561/*
3562 * Release a reserved space range from io_tree only.
3563 *
3564 * Should be called when a range of pages get written to disk and corresponding
3565 * FILE_EXTENT is inserted into corresponding root.
3566 *
3567 * Since new qgroup accounting framework will only update qgroup numbers at
3568 * commit_transaction() time, its reserved space shouldn't be freed from
3569 * related qgroups.
3570 *
3571 * But we should release the range from io_tree, to allow further write to be
3572 * COWed.
3573 *
3574 * NOTE: This function may sleep for memory allocation.
3575 */
3576int btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len)
3577{
3578 return __btrfs_qgroup_release_data(inode, NULL, start, len, 0);
3579}
3580
3581static void add_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3582 enum btrfs_qgroup_rsv_type type)
3583{
3584 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3585 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3586 return;
3587 if (num_bytes == 0)
3588 return;
3589
3590 spin_lock(&root->qgroup_meta_rsv_lock);
3591 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
3592 root->qgroup_meta_rsv_prealloc += num_bytes;
3593 else
3594 root->qgroup_meta_rsv_pertrans += num_bytes;
3595 spin_unlock(&root->qgroup_meta_rsv_lock);
3596}
3597
3598static int sub_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3599 enum btrfs_qgroup_rsv_type type)
3600{
3601 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3602 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3603 return 0;
3604 if (num_bytes == 0)
3605 return 0;
3606
3607 spin_lock(&root->qgroup_meta_rsv_lock);
3608 if (type == BTRFS_QGROUP_RSV_META_PREALLOC) {
3609 num_bytes = min_t(u64, root->qgroup_meta_rsv_prealloc,
3610 num_bytes);
3611 root->qgroup_meta_rsv_prealloc -= num_bytes;
3612 } else {
3613 num_bytes = min_t(u64, root->qgroup_meta_rsv_pertrans,
3614 num_bytes);
3615 root->qgroup_meta_rsv_pertrans -= num_bytes;
3616 }
3617 spin_unlock(&root->qgroup_meta_rsv_lock);
3618 return num_bytes;
3619}
3620
3621int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
3622 enum btrfs_qgroup_rsv_type type, bool enforce)
3623{
3624 struct btrfs_fs_info *fs_info = root->fs_info;
3625 int ret;
3626
3627 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3628 !is_fstree(root->root_key.objectid) || num_bytes == 0)
3629 return 0;
3630
3631 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
3632 trace_qgroup_meta_reserve(root, (s64)num_bytes, type);
3633 ret = qgroup_reserve(root, num_bytes, enforce, type);
3634 if (ret < 0)
3635 return ret;
3636 /*
3637 * Record what we have reserved into root.
3638 *
3639 * To avoid quota disabled->enabled underflow.
3640 * In that case, we may try to free space we haven't reserved
3641 * (since quota was disabled), so record what we reserved into root.
3642 * And ensure later release won't underflow this number.
3643 */
3644 add_root_meta_rsv(root, num_bytes, type);
3645 return ret;
3646}
3647
3648void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root)
3649{
3650 struct btrfs_fs_info *fs_info = root->fs_info;
3651
3652 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3653 !is_fstree(root->root_key.objectid))
3654 return;
3655
3656 /* TODO: Update trace point to handle such free */
3657 trace_qgroup_meta_free_all_pertrans(root);
3658 /* Special value -1 means to free all reserved space */
3659 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid, (u64)-1,
3660 BTRFS_QGROUP_RSV_META_PERTRANS);
3661}
3662
3663void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
3664 enum btrfs_qgroup_rsv_type type)
3665{
3666 struct btrfs_fs_info *fs_info = root->fs_info;
3667
3668 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3669 !is_fstree(root->root_key.objectid))
3670 return;
3671
3672 /*
3673 * reservation for META_PREALLOC can happen before quota is enabled,
3674 * which can lead to underflow.
3675 * Here ensure we will only free what we really have reserved.
3676 */
3677 num_bytes = sub_root_meta_rsv(root, num_bytes, type);
3678 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
3679 trace_qgroup_meta_reserve(root, -(s64)num_bytes, type);
3680 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid,
3681 num_bytes, type);
3682}
3683
3684static void qgroup_convert_meta(struct btrfs_fs_info *fs_info, u64 ref_root,
3685 int num_bytes)
3686{
3687 struct btrfs_root *quota_root = fs_info->quota_root;
3688 struct btrfs_qgroup *qgroup;
3689 struct ulist_node *unode;
3690 struct ulist_iterator uiter;
3691 int ret = 0;
3692
3693 if (num_bytes == 0)
3694 return;
3695 if (!quota_root)
3696 return;
3697
3698 spin_lock(&fs_info->qgroup_lock);
3699 qgroup = find_qgroup_rb(fs_info, ref_root);
3700 if (!qgroup)
3701 goto out;
3702 ulist_reinit(fs_info->qgroup_ulist);
3703 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3704 qgroup_to_aux(qgroup), GFP_ATOMIC);
3705 if (ret < 0)
3706 goto out;
3707 ULIST_ITER_INIT(&uiter);
3708 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3709 struct btrfs_qgroup *qg;
3710 struct btrfs_qgroup_list *glist;
3711
3712 qg = unode_aux_to_qgroup(unode);
3713
3714 qgroup_rsv_release(fs_info, qg, num_bytes,
3715 BTRFS_QGROUP_RSV_META_PREALLOC);
3716 qgroup_rsv_add(fs_info, qg, num_bytes,
3717 BTRFS_QGROUP_RSV_META_PERTRANS);
3718 list_for_each_entry(glist, &qg->groups, next_group) {
3719 ret = ulist_add(fs_info->qgroup_ulist,
3720 glist->group->qgroupid,
3721 qgroup_to_aux(glist->group), GFP_ATOMIC);
3722 if (ret < 0)
3723 goto out;
3724 }
3725 }
3726out:
3727 spin_unlock(&fs_info->qgroup_lock);
3728}
3729
3730void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes)
3731{
3732 struct btrfs_fs_info *fs_info = root->fs_info;
3733
3734 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3735 !is_fstree(root->root_key.objectid))
3736 return;
3737 /* Same as btrfs_qgroup_free_meta_prealloc() */
3738 num_bytes = sub_root_meta_rsv(root, num_bytes,
3739 BTRFS_QGROUP_RSV_META_PREALLOC);
3740 trace_qgroup_meta_convert(root, num_bytes);
3741 qgroup_convert_meta(fs_info, root->root_key.objectid, num_bytes);
3742}
3743
3744/*
3745 * Check qgroup reserved space leaking, normally at destroy inode
3746 * time
3747 */
3748void btrfs_qgroup_check_reserved_leak(struct inode *inode)
3749{
3750 struct extent_changeset changeset;
3751 struct ulist_node *unode;
3752 struct ulist_iterator iter;
3753 int ret;
3754
3755 extent_changeset_init(&changeset);
3756 ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, 0, (u64)-1,
3757 EXTENT_QGROUP_RESERVED, &changeset);
3758
3759 WARN_ON(ret < 0);
3760 if (WARN_ON(changeset.bytes_changed)) {
3761 ULIST_ITER_INIT(&iter);
3762 while ((unode = ulist_next(&changeset.range_changed, &iter))) {
3763 btrfs_warn(BTRFS_I(inode)->root->fs_info,
3764 "leaking qgroup reserved space, ino: %lu, start: %llu, end: %llu",
3765 inode->i_ino, unode->val, unode->aux);
3766 }
3767 btrfs_qgroup_free_refroot(BTRFS_I(inode)->root->fs_info,
3768 BTRFS_I(inode)->root->root_key.objectid,
3769 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
3770
3771 }
3772 extent_changeset_release(&changeset);
3773}
3774
3775void btrfs_qgroup_init_swapped_blocks(
3776 struct btrfs_qgroup_swapped_blocks *swapped_blocks)
3777{
3778 int i;
3779
3780 spin_lock_init(&swapped_blocks->lock);
3781 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
3782 swapped_blocks->blocks[i] = RB_ROOT;
3783 swapped_blocks->swapped = false;
3784}
3785
3786/*
3787 * Delete all swapped blocks record of @root.
3788 * Every record here means we skipped a full subtree scan for qgroup.
3789 *
3790 * Gets called when committing one transaction.
3791 */
3792void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root)
3793{
3794 struct btrfs_qgroup_swapped_blocks *swapped_blocks;
3795 int i;
3796
3797 swapped_blocks = &root->swapped_blocks;
3798
3799 spin_lock(&swapped_blocks->lock);
3800 if (!swapped_blocks->swapped)
3801 goto out;
3802 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
3803 struct rb_root *cur_root = &swapped_blocks->blocks[i];
3804 struct btrfs_qgroup_swapped_block *entry;
3805 struct btrfs_qgroup_swapped_block *next;
3806
3807 rbtree_postorder_for_each_entry_safe(entry, next, cur_root,
3808 node)
3809 kfree(entry);
3810 swapped_blocks->blocks[i] = RB_ROOT;
3811 }
3812 swapped_blocks->swapped = false;
3813out:
3814 spin_unlock(&swapped_blocks->lock);
3815}
3816
3817/*
3818 * Add subtree roots record into @subvol_root.
3819 *
3820 * @subvol_root: tree root of the subvolume tree get swapped
3821 * @bg: block group under balance
3822 * @subvol_parent/slot: pointer to the subtree root in subvolume tree
3823 * @reloc_parent/slot: pointer to the subtree root in reloc tree
3824 * BOTH POINTERS ARE BEFORE TREE SWAP
3825 * @last_snapshot: last snapshot generation of the subvolume tree
3826 */
3827int btrfs_qgroup_add_swapped_blocks(struct btrfs_trans_handle *trans,
3828 struct btrfs_root *subvol_root,
3829 struct btrfs_block_group_cache *bg,
3830 struct extent_buffer *subvol_parent, int subvol_slot,
3831 struct extent_buffer *reloc_parent, int reloc_slot,
3832 u64 last_snapshot)
3833{
3834 struct btrfs_fs_info *fs_info = subvol_root->fs_info;
3835 struct btrfs_qgroup_swapped_blocks *blocks = &subvol_root->swapped_blocks;
3836 struct btrfs_qgroup_swapped_block *block;
3837 struct rb_node **cur;
3838 struct rb_node *parent = NULL;
3839 int level = btrfs_header_level(subvol_parent) - 1;
3840 int ret = 0;
3841
3842 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
3843 return 0;
3844
3845 if (btrfs_node_ptr_generation(subvol_parent, subvol_slot) >
3846 btrfs_node_ptr_generation(reloc_parent, reloc_slot)) {
3847 btrfs_err_rl(fs_info,
3848 "%s: bad parameter order, subvol_gen=%llu reloc_gen=%llu",
3849 __func__,
3850 btrfs_node_ptr_generation(subvol_parent, subvol_slot),
3851 btrfs_node_ptr_generation(reloc_parent, reloc_slot));
3852 return -EUCLEAN;
3853 }
3854
3855 block = kmalloc(sizeof(*block), GFP_NOFS);
3856 if (!block) {
3857 ret = -ENOMEM;
3858 goto out;
3859 }
3860
3861 /*
3862 * @reloc_parent/slot is still before swap, while @block is going to
3863 * record the bytenr after swap, so we do the swap here.
3864 */
3865 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot);
3866 block->subvol_generation = btrfs_node_ptr_generation(reloc_parent,
3867 reloc_slot);
3868 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot);
3869 block->reloc_generation = btrfs_node_ptr_generation(subvol_parent,
3870 subvol_slot);
3871 block->last_snapshot = last_snapshot;
3872 block->level = level;
3873
3874 /*
3875 * If we have bg == NULL, we're called from btrfs_recover_relocation(),
3876 * no one else can modify tree blocks thus we qgroup will not change
3877 * no matter the value of trace_leaf.
3878 */
3879 if (bg && bg->flags & BTRFS_BLOCK_GROUP_DATA)
3880 block->trace_leaf = true;
3881 else
3882 block->trace_leaf = false;
3883 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot);
3884
3885 /* Insert @block into @blocks */
3886 spin_lock(&blocks->lock);
3887 cur = &blocks->blocks[level].rb_node;
3888 while (*cur) {
3889 struct btrfs_qgroup_swapped_block *entry;
3890
3891 parent = *cur;
3892 entry = rb_entry(parent, struct btrfs_qgroup_swapped_block,
3893 node);
3894
3895 if (entry->subvol_bytenr < block->subvol_bytenr) {
3896 cur = &(*cur)->rb_left;
3897 } else if (entry->subvol_bytenr > block->subvol_bytenr) {
3898 cur = &(*cur)->rb_right;
3899 } else {
3900 if (entry->subvol_generation !=
3901 block->subvol_generation ||
3902 entry->reloc_bytenr != block->reloc_bytenr ||
3903 entry->reloc_generation !=
3904 block->reloc_generation) {
3905 /*
3906 * Duplicated but mismatch entry found.
3907 * Shouldn't happen.
3908 *
3909 * Marking qgroup inconsistent should be enough
3910 * for end users.
3911 */
3912 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
3913 ret = -EEXIST;
3914 }
3915 kfree(block);
3916 goto out_unlock;
3917 }
3918 }
3919 rb_link_node(&block->node, parent, cur);
3920 rb_insert_color(&block->node, &blocks->blocks[level]);
3921 blocks->swapped = true;
3922out_unlock:
3923 spin_unlock(&blocks->lock);
3924out:
3925 if (ret < 0)
3926 fs_info->qgroup_flags |=
3927 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3928 return ret;
3929}
3930
3931/*
3932 * Check if the tree block is a subtree root, and if so do the needed
3933 * delayed subtree trace for qgroup.
3934 *
3935 * This is called during btrfs_cow_block().
3936 */
3937int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
3938 struct btrfs_root *root,
3939 struct extent_buffer *subvol_eb)
3940{
3941 struct btrfs_fs_info *fs_info = root->fs_info;
3942 struct btrfs_qgroup_swapped_blocks *blocks = &root->swapped_blocks;
3943 struct btrfs_qgroup_swapped_block *block;
3944 struct extent_buffer *reloc_eb = NULL;
3945 struct rb_node *node;
3946 bool found = false;
3947 bool swapped = false;
3948 int level = btrfs_header_level(subvol_eb);
3949 int ret = 0;
3950 int i;
3951
3952 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
3953 return 0;
3954 if (!is_fstree(root->root_key.objectid) || !root->reloc_root)
3955 return 0;
3956
3957 spin_lock(&blocks->lock);
3958 if (!blocks->swapped) {
3959 spin_unlock(&blocks->lock);
3960 return 0;
3961 }
3962 node = blocks->blocks[level].rb_node;
3963
3964 while (node) {
3965 block = rb_entry(node, struct btrfs_qgroup_swapped_block, node);
3966 if (block->subvol_bytenr < subvol_eb->start) {
3967 node = node->rb_left;
3968 } else if (block->subvol_bytenr > subvol_eb->start) {
3969 node = node->rb_right;
3970 } else {
3971 found = true;
3972 break;
3973 }
3974 }
3975 if (!found) {
3976 spin_unlock(&blocks->lock);
3977 goto out;
3978 }
3979 /* Found one, remove it from @blocks first and update blocks->swapped */
3980 rb_erase(&block->node, &blocks->blocks[level]);
3981 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
3982 if (RB_EMPTY_ROOT(&blocks->blocks[i])) {
3983 swapped = true;
3984 break;
3985 }
3986 }
3987 blocks->swapped = swapped;
3988 spin_unlock(&blocks->lock);
3989
3990 /* Read out reloc subtree root */
3991 reloc_eb = read_tree_block(fs_info, block->reloc_bytenr,
3992 block->reloc_generation, block->level,
3993 &block->first_key);
3994 if (IS_ERR(reloc_eb)) {
3995 ret = PTR_ERR(reloc_eb);
3996 reloc_eb = NULL;
3997 goto free_out;
3998 }
3999 if (!extent_buffer_uptodate(reloc_eb)) {
4000 ret = -EIO;
4001 goto free_out;
4002 }
4003
4004 ret = qgroup_trace_subtree_swap(trans, reloc_eb, subvol_eb,
4005 block->last_snapshot, block->trace_leaf);
4006free_out:
4007 kfree(block);
4008 free_extent_buffer(reloc_eb);
4009out:
4010 if (ret < 0) {
4011 btrfs_err_rl(fs_info,
4012 "failed to account subtree at bytenr %llu: %d",
4013 subvol_eb->start, ret);
4014 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
4015 }
4016 return ret;
4017}