Commit | Line | Data |
---|---|---|
bed92eae AJ |
1 | /* |
2 | * Copyright (C) 2011 STRATO. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
19 | #include <linux/sched.h> | |
20 | #include <linux/pagemap.h> | |
21 | #include <linux/writeback.h> | |
22 | #include <linux/blkdev.h> | |
23 | #include <linux/rbtree.h> | |
24 | #include <linux/slab.h> | |
25 | #include <linux/workqueue.h> | |
55e301fd | 26 | #include <linux/btrfs.h> |
bed92eae AJ |
27 | |
28 | #include "ctree.h" | |
29 | #include "transaction.h" | |
30 | #include "disk-io.h" | |
31 | #include "locking.h" | |
32 | #include "ulist.h" | |
bed92eae | 33 | #include "backref.h" |
2f232036 | 34 | #include "extent_io.h" |
fcebe456 | 35 | #include "qgroup.h" |
bed92eae | 36 | |
e69bcee3 | 37 | |
bed92eae AJ |
38 | /* TODO XXX FIXME |
39 | * - subvol delete -> delete when ref goes to 0? delete limits also? | |
40 | * - reorganize keys | |
41 | * - compressed | |
42 | * - sync | |
bed92eae AJ |
43 | * - copy also limits on subvol creation |
44 | * - limit | |
45 | * - caches fuer ulists | |
46 | * - performance benchmarks | |
47 | * - check all ioctl parameters | |
48 | */ | |
49 | ||
50 | /* | |
51 | * one struct for each qgroup, organized in fs_info->qgroup_tree. | |
52 | */ | |
53 | struct btrfs_qgroup { | |
54 | u64 qgroupid; | |
55 | ||
56 | /* | |
57 | * state | |
58 | */ | |
59 | u64 rfer; /* referenced */ | |
60 | u64 rfer_cmpr; /* referenced compressed */ | |
61 | u64 excl; /* exclusive */ | |
62 | u64 excl_cmpr; /* exclusive compressed */ | |
63 | ||
64 | /* | |
65 | * limits | |
66 | */ | |
67 | u64 lim_flags; /* which limits are set */ | |
68 | u64 max_rfer; | |
69 | u64 max_excl; | |
70 | u64 rsv_rfer; | |
71 | u64 rsv_excl; | |
72 | ||
73 | /* | |
74 | * reservation tracking | |
75 | */ | |
76 | u64 reserved; | |
77 | ||
78 | /* | |
79 | * lists | |
80 | */ | |
81 | struct list_head groups; /* groups this group is member of */ | |
82 | struct list_head members; /* groups that are members of this group */ | |
83 | struct list_head dirty; /* dirty groups */ | |
84 | struct rb_node node; /* tree of qgroups */ | |
85 | ||
86 | /* | |
87 | * temp variables for accounting operations | |
01327610 | 88 | * Refer to qgroup_shared_accounting() for details. |
bed92eae | 89 | */ |
fcebe456 JB |
90 | u64 old_refcnt; |
91 | u64 new_refcnt; | |
bed92eae AJ |
92 | }; |
93 | ||
9c542136 QW |
94 | static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq, |
95 | int mod) | |
96 | { | |
97 | if (qg->old_refcnt < seq) | |
98 | qg->old_refcnt = seq; | |
99 | qg->old_refcnt += mod; | |
100 | } | |
101 | ||
102 | static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq, | |
103 | int mod) | |
104 | { | |
105 | if (qg->new_refcnt < seq) | |
106 | qg->new_refcnt = seq; | |
107 | qg->new_refcnt += mod; | |
108 | } | |
109 | ||
110 | static inline u64 btrfs_qgroup_get_old_refcnt(struct btrfs_qgroup *qg, u64 seq) | |
111 | { | |
112 | if (qg->old_refcnt < seq) | |
113 | return 0; | |
114 | return qg->old_refcnt - seq; | |
115 | } | |
116 | ||
117 | static inline u64 btrfs_qgroup_get_new_refcnt(struct btrfs_qgroup *qg, u64 seq) | |
118 | { | |
119 | if (qg->new_refcnt < seq) | |
120 | return 0; | |
121 | return qg->new_refcnt - seq; | |
122 | } | |
123 | ||
bed92eae AJ |
124 | /* |
125 | * glue structure to represent the relations between qgroups. | |
126 | */ | |
127 | struct btrfs_qgroup_list { | |
128 | struct list_head next_group; | |
129 | struct list_head next_member; | |
130 | struct btrfs_qgroup *group; | |
131 | struct btrfs_qgroup *member; | |
132 | }; | |
133 | ||
ef2fff64 DS |
134 | static inline u64 qgroup_to_aux(struct btrfs_qgroup *qg) |
135 | { | |
136 | return (u64)(uintptr_t)qg; | |
137 | } | |
138 | ||
139 | static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n) | |
140 | { | |
141 | return (struct btrfs_qgroup *)(uintptr_t)n->aux; | |
142 | } | |
fcebe456 | 143 | |
b382a324 JS |
144 | static int |
145 | qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid, | |
146 | int init_flags); | |
147 | static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info); | |
2f232036 | 148 | |
58400fce | 149 | /* must be called with qgroup_ioctl_lock held */ |
bed92eae AJ |
150 | static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info, |
151 | u64 qgroupid) | |
152 | { | |
153 | struct rb_node *n = fs_info->qgroup_tree.rb_node; | |
154 | struct btrfs_qgroup *qgroup; | |
155 | ||
156 | while (n) { | |
157 | qgroup = rb_entry(n, struct btrfs_qgroup, node); | |
158 | if (qgroup->qgroupid < qgroupid) | |
159 | n = n->rb_left; | |
160 | else if (qgroup->qgroupid > qgroupid) | |
161 | n = n->rb_right; | |
162 | else | |
163 | return qgroup; | |
164 | } | |
165 | return NULL; | |
166 | } | |
167 | ||
168 | /* must be called with qgroup_lock held */ | |
169 | static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info, | |
170 | u64 qgroupid) | |
171 | { | |
172 | struct rb_node **p = &fs_info->qgroup_tree.rb_node; | |
173 | struct rb_node *parent = NULL; | |
174 | struct btrfs_qgroup *qgroup; | |
175 | ||
176 | while (*p) { | |
177 | parent = *p; | |
178 | qgroup = rb_entry(parent, struct btrfs_qgroup, node); | |
179 | ||
180 | if (qgroup->qgroupid < qgroupid) | |
181 | p = &(*p)->rb_left; | |
182 | else if (qgroup->qgroupid > qgroupid) | |
183 | p = &(*p)->rb_right; | |
184 | else | |
185 | return qgroup; | |
186 | } | |
187 | ||
188 | qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC); | |
189 | if (!qgroup) | |
190 | return ERR_PTR(-ENOMEM); | |
191 | ||
192 | qgroup->qgroupid = qgroupid; | |
193 | INIT_LIST_HEAD(&qgroup->groups); | |
194 | INIT_LIST_HEAD(&qgroup->members); | |
195 | INIT_LIST_HEAD(&qgroup->dirty); | |
196 | ||
197 | rb_link_node(&qgroup->node, parent, p); | |
198 | rb_insert_color(&qgroup->node, &fs_info->qgroup_tree); | |
199 | ||
200 | return qgroup; | |
201 | } | |
202 | ||
4082bd3d | 203 | static void __del_qgroup_rb(struct btrfs_qgroup *qgroup) |
bed92eae | 204 | { |
bed92eae AJ |
205 | struct btrfs_qgroup_list *list; |
206 | ||
bed92eae | 207 | list_del(&qgroup->dirty); |
bed92eae AJ |
208 | while (!list_empty(&qgroup->groups)) { |
209 | list = list_first_entry(&qgroup->groups, | |
210 | struct btrfs_qgroup_list, next_group); | |
211 | list_del(&list->next_group); | |
212 | list_del(&list->next_member); | |
213 | kfree(list); | |
214 | } | |
215 | ||
216 | while (!list_empty(&qgroup->members)) { | |
217 | list = list_first_entry(&qgroup->members, | |
218 | struct btrfs_qgroup_list, next_member); | |
219 | list_del(&list->next_group); | |
220 | list_del(&list->next_member); | |
221 | kfree(list); | |
222 | } | |
223 | kfree(qgroup); | |
4082bd3d | 224 | } |
bed92eae | 225 | |
4082bd3d WS |
226 | /* must be called with qgroup_lock held */ |
227 | static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid) | |
228 | { | |
229 | struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid); | |
230 | ||
231 | if (!qgroup) | |
232 | return -ENOENT; | |
233 | ||
234 | rb_erase(&qgroup->node, &fs_info->qgroup_tree); | |
235 | __del_qgroup_rb(qgroup); | |
bed92eae AJ |
236 | return 0; |
237 | } | |
238 | ||
239 | /* must be called with qgroup_lock held */ | |
240 | static int add_relation_rb(struct btrfs_fs_info *fs_info, | |
241 | u64 memberid, u64 parentid) | |
242 | { | |
243 | struct btrfs_qgroup *member; | |
244 | struct btrfs_qgroup *parent; | |
245 | struct btrfs_qgroup_list *list; | |
246 | ||
247 | member = find_qgroup_rb(fs_info, memberid); | |
248 | parent = find_qgroup_rb(fs_info, parentid); | |
249 | if (!member || !parent) | |
250 | return -ENOENT; | |
251 | ||
252 | list = kzalloc(sizeof(*list), GFP_ATOMIC); | |
253 | if (!list) | |
254 | return -ENOMEM; | |
255 | ||
256 | list->group = parent; | |
257 | list->member = member; | |
258 | list_add_tail(&list->next_group, &member->groups); | |
259 | list_add_tail(&list->next_member, &parent->members); | |
260 | ||
261 | return 0; | |
262 | } | |
263 | ||
264 | /* must be called with qgroup_lock held */ | |
265 | static int del_relation_rb(struct btrfs_fs_info *fs_info, | |
266 | u64 memberid, u64 parentid) | |
267 | { | |
268 | struct btrfs_qgroup *member; | |
269 | struct btrfs_qgroup *parent; | |
270 | struct btrfs_qgroup_list *list; | |
271 | ||
272 | member = find_qgroup_rb(fs_info, memberid); | |
273 | parent = find_qgroup_rb(fs_info, parentid); | |
274 | if (!member || !parent) | |
275 | return -ENOENT; | |
276 | ||
277 | list_for_each_entry(list, &member->groups, next_group) { | |
278 | if (list->group == parent) { | |
279 | list_del(&list->next_group); | |
280 | list_del(&list->next_member); | |
281 | kfree(list); | |
282 | return 0; | |
283 | } | |
284 | } | |
285 | return -ENOENT; | |
286 | } | |
287 | ||
faa2dbf0 JB |
288 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
289 | int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid, | |
290 | u64 rfer, u64 excl) | |
291 | { | |
292 | struct btrfs_qgroup *qgroup; | |
293 | ||
294 | qgroup = find_qgroup_rb(fs_info, qgroupid); | |
295 | if (!qgroup) | |
296 | return -EINVAL; | |
297 | if (qgroup->rfer != rfer || qgroup->excl != excl) | |
298 | return -EINVAL; | |
299 | return 0; | |
300 | } | |
301 | #endif | |
302 | ||
bed92eae AJ |
303 | /* |
304 | * The full config is read in one go, only called from open_ctree() | |
305 | * It doesn't use any locking, as at this point we're still single-threaded | |
306 | */ | |
307 | int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info) | |
308 | { | |
309 | struct btrfs_key key; | |
310 | struct btrfs_key found_key; | |
311 | struct btrfs_root *quota_root = fs_info->quota_root; | |
312 | struct btrfs_path *path = NULL; | |
313 | struct extent_buffer *l; | |
314 | int slot; | |
315 | int ret = 0; | |
316 | u64 flags = 0; | |
b382a324 | 317 | u64 rescan_progress = 0; |
bed92eae | 318 | |
afcdd129 | 319 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
bed92eae AJ |
320 | return 0; |
321 | ||
323b88f4 | 322 | fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL); |
1e8f9158 WS |
323 | if (!fs_info->qgroup_ulist) { |
324 | ret = -ENOMEM; | |
325 | goto out; | |
326 | } | |
327 | ||
bed92eae AJ |
328 | path = btrfs_alloc_path(); |
329 | if (!path) { | |
330 | ret = -ENOMEM; | |
331 | goto out; | |
332 | } | |
333 | ||
334 | /* default this to quota off, in case no status key is found */ | |
335 | fs_info->qgroup_flags = 0; | |
336 | ||
337 | /* | |
338 | * pass 1: read status, all qgroup infos and limits | |
339 | */ | |
340 | key.objectid = 0; | |
341 | key.type = 0; | |
342 | key.offset = 0; | |
343 | ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1); | |
344 | if (ret) | |
345 | goto out; | |
346 | ||
347 | while (1) { | |
348 | struct btrfs_qgroup *qgroup; | |
349 | ||
350 | slot = path->slots[0]; | |
351 | l = path->nodes[0]; | |
352 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
353 | ||
354 | if (found_key.type == BTRFS_QGROUP_STATUS_KEY) { | |
355 | struct btrfs_qgroup_status_item *ptr; | |
356 | ||
357 | ptr = btrfs_item_ptr(l, slot, | |
358 | struct btrfs_qgroup_status_item); | |
359 | ||
360 | if (btrfs_qgroup_status_version(l, ptr) != | |
361 | BTRFS_QGROUP_STATUS_VERSION) { | |
efe120a0 FH |
362 | btrfs_err(fs_info, |
363 | "old qgroup version, quota disabled"); | |
bed92eae AJ |
364 | goto out; |
365 | } | |
366 | if (btrfs_qgroup_status_generation(l, ptr) != | |
367 | fs_info->generation) { | |
368 | flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
efe120a0 | 369 | btrfs_err(fs_info, |
5d163e0e | 370 | "qgroup generation mismatch, marked as inconsistent"); |
bed92eae AJ |
371 | } |
372 | fs_info->qgroup_flags = btrfs_qgroup_status_flags(l, | |
373 | ptr); | |
b382a324 | 374 | rescan_progress = btrfs_qgroup_status_rescan(l, ptr); |
bed92eae AJ |
375 | goto next1; |
376 | } | |
377 | ||
378 | if (found_key.type != BTRFS_QGROUP_INFO_KEY && | |
379 | found_key.type != BTRFS_QGROUP_LIMIT_KEY) | |
380 | goto next1; | |
381 | ||
382 | qgroup = find_qgroup_rb(fs_info, found_key.offset); | |
383 | if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) || | |
384 | (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) { | |
d41e36a0 | 385 | btrfs_err(fs_info, "inconsistent qgroup config"); |
bed92eae AJ |
386 | flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; |
387 | } | |
388 | if (!qgroup) { | |
389 | qgroup = add_qgroup_rb(fs_info, found_key.offset); | |
390 | if (IS_ERR(qgroup)) { | |
391 | ret = PTR_ERR(qgroup); | |
392 | goto out; | |
393 | } | |
394 | } | |
395 | switch (found_key.type) { | |
396 | case BTRFS_QGROUP_INFO_KEY: { | |
397 | struct btrfs_qgroup_info_item *ptr; | |
398 | ||
399 | ptr = btrfs_item_ptr(l, slot, | |
400 | struct btrfs_qgroup_info_item); | |
401 | qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr); | |
402 | qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr); | |
403 | qgroup->excl = btrfs_qgroup_info_excl(l, ptr); | |
404 | qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr); | |
405 | /* generation currently unused */ | |
406 | break; | |
407 | } | |
408 | case BTRFS_QGROUP_LIMIT_KEY: { | |
409 | struct btrfs_qgroup_limit_item *ptr; | |
410 | ||
411 | ptr = btrfs_item_ptr(l, slot, | |
412 | struct btrfs_qgroup_limit_item); | |
413 | qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr); | |
414 | qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr); | |
415 | qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr); | |
416 | qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr); | |
417 | qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr); | |
418 | break; | |
419 | } | |
420 | } | |
421 | next1: | |
422 | ret = btrfs_next_item(quota_root, path); | |
423 | if (ret < 0) | |
424 | goto out; | |
425 | if (ret) | |
426 | break; | |
427 | } | |
428 | btrfs_release_path(path); | |
429 | ||
430 | /* | |
431 | * pass 2: read all qgroup relations | |
432 | */ | |
433 | key.objectid = 0; | |
434 | key.type = BTRFS_QGROUP_RELATION_KEY; | |
435 | key.offset = 0; | |
436 | ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0); | |
437 | if (ret) | |
438 | goto out; | |
439 | while (1) { | |
440 | slot = path->slots[0]; | |
441 | l = path->nodes[0]; | |
442 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
443 | ||
444 | if (found_key.type != BTRFS_QGROUP_RELATION_KEY) | |
445 | goto next2; | |
446 | ||
447 | if (found_key.objectid > found_key.offset) { | |
448 | /* parent <- member, not needed to build config */ | |
449 | /* FIXME should we omit the key completely? */ | |
450 | goto next2; | |
451 | } | |
452 | ||
453 | ret = add_relation_rb(fs_info, found_key.objectid, | |
454 | found_key.offset); | |
ff24858c | 455 | if (ret == -ENOENT) { |
efe120a0 FH |
456 | btrfs_warn(fs_info, |
457 | "orphan qgroup relation 0x%llx->0x%llx", | |
c1c9ff7c | 458 | found_key.objectid, found_key.offset); |
ff24858c AJ |
459 | ret = 0; /* ignore the error */ |
460 | } | |
bed92eae AJ |
461 | if (ret) |
462 | goto out; | |
463 | next2: | |
464 | ret = btrfs_next_item(quota_root, path); | |
465 | if (ret < 0) | |
466 | goto out; | |
467 | if (ret) | |
468 | break; | |
469 | } | |
470 | out: | |
471 | fs_info->qgroup_flags |= flags; | |
afcdd129 JB |
472 | if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON)) |
473 | clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); | |
474 | else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN && | |
475 | ret >= 0) | |
b382a324 | 476 | ret = qgroup_rescan_init(fs_info, rescan_progress, 0); |
bed92eae AJ |
477 | btrfs_free_path(path); |
478 | ||
eb1716af | 479 | if (ret < 0) { |
1e8f9158 | 480 | ulist_free(fs_info->qgroup_ulist); |
eb1716af | 481 | fs_info->qgroup_ulist = NULL; |
b382a324 | 482 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN; |
eb1716af | 483 | } |
1e8f9158 | 484 | |
bed92eae AJ |
485 | return ret < 0 ? ret : 0; |
486 | } | |
487 | ||
488 | /* | |
e685da14 WS |
489 | * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(), |
490 | * first two are in single-threaded paths.And for the third one, we have set | |
491 | * quota_root to be null with qgroup_lock held before, so it is safe to clean | |
492 | * up the in-memory structures without qgroup_lock held. | |
bed92eae AJ |
493 | */ |
494 | void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info) | |
495 | { | |
496 | struct rb_node *n; | |
497 | struct btrfs_qgroup *qgroup; | |
bed92eae AJ |
498 | |
499 | while ((n = rb_first(&fs_info->qgroup_tree))) { | |
500 | qgroup = rb_entry(n, struct btrfs_qgroup, node); | |
501 | rb_erase(n, &fs_info->qgroup_tree); | |
4082bd3d | 502 | __del_qgroup_rb(qgroup); |
bed92eae | 503 | } |
1e7bac1e WS |
504 | /* |
505 | * we call btrfs_free_qgroup_config() when umounting | |
01327610 | 506 | * filesystem and disabling quota, so we set qgroup_ulist |
1e7bac1e WS |
507 | * to be null here to avoid double free. |
508 | */ | |
1e8f9158 | 509 | ulist_free(fs_info->qgroup_ulist); |
1e7bac1e | 510 | fs_info->qgroup_ulist = NULL; |
bed92eae AJ |
511 | } |
512 | ||
513 | static int add_qgroup_relation_item(struct btrfs_trans_handle *trans, | |
514 | struct btrfs_root *quota_root, | |
515 | u64 src, u64 dst) | |
516 | { | |
517 | int ret; | |
518 | struct btrfs_path *path; | |
519 | struct btrfs_key key; | |
520 | ||
521 | path = btrfs_alloc_path(); | |
522 | if (!path) | |
523 | return -ENOMEM; | |
524 | ||
525 | key.objectid = src; | |
526 | key.type = BTRFS_QGROUP_RELATION_KEY; | |
527 | key.offset = dst; | |
528 | ||
529 | ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0); | |
530 | ||
531 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
532 | ||
533 | btrfs_free_path(path); | |
534 | return ret; | |
535 | } | |
536 | ||
537 | static int del_qgroup_relation_item(struct btrfs_trans_handle *trans, | |
538 | struct btrfs_root *quota_root, | |
539 | u64 src, u64 dst) | |
540 | { | |
541 | int ret; | |
542 | struct btrfs_path *path; | |
543 | struct btrfs_key key; | |
544 | ||
545 | path = btrfs_alloc_path(); | |
546 | if (!path) | |
547 | return -ENOMEM; | |
548 | ||
549 | key.objectid = src; | |
550 | key.type = BTRFS_QGROUP_RELATION_KEY; | |
551 | key.offset = dst; | |
552 | ||
553 | ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1); | |
554 | if (ret < 0) | |
555 | goto out; | |
556 | ||
557 | if (ret > 0) { | |
558 | ret = -ENOENT; | |
559 | goto out; | |
560 | } | |
561 | ||
562 | ret = btrfs_del_item(trans, quota_root, path); | |
563 | out: | |
564 | btrfs_free_path(path); | |
565 | return ret; | |
566 | } | |
567 | ||
568 | static int add_qgroup_item(struct btrfs_trans_handle *trans, | |
569 | struct btrfs_root *quota_root, u64 qgroupid) | |
570 | { | |
571 | int ret; | |
572 | struct btrfs_path *path; | |
573 | struct btrfs_qgroup_info_item *qgroup_info; | |
574 | struct btrfs_qgroup_limit_item *qgroup_limit; | |
575 | struct extent_buffer *leaf; | |
576 | struct btrfs_key key; | |
577 | ||
f5ee5c9a | 578 | if (btrfs_is_testing(quota_root->fs_info)) |
faa2dbf0 | 579 | return 0; |
fccb84c9 | 580 | |
bed92eae AJ |
581 | path = btrfs_alloc_path(); |
582 | if (!path) | |
583 | return -ENOMEM; | |
584 | ||
585 | key.objectid = 0; | |
586 | key.type = BTRFS_QGROUP_INFO_KEY; | |
587 | key.offset = qgroupid; | |
588 | ||
0b4699dc MF |
589 | /* |
590 | * Avoid a transaction abort by catching -EEXIST here. In that | |
591 | * case, we proceed by re-initializing the existing structure | |
592 | * on disk. | |
593 | */ | |
594 | ||
bed92eae AJ |
595 | ret = btrfs_insert_empty_item(trans, quota_root, path, &key, |
596 | sizeof(*qgroup_info)); | |
0b4699dc | 597 | if (ret && ret != -EEXIST) |
bed92eae AJ |
598 | goto out; |
599 | ||
600 | leaf = path->nodes[0]; | |
601 | qgroup_info = btrfs_item_ptr(leaf, path->slots[0], | |
602 | struct btrfs_qgroup_info_item); | |
603 | btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid); | |
604 | btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0); | |
605 | btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0); | |
606 | btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0); | |
607 | btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0); | |
608 | ||
609 | btrfs_mark_buffer_dirty(leaf); | |
610 | ||
611 | btrfs_release_path(path); | |
612 | ||
613 | key.type = BTRFS_QGROUP_LIMIT_KEY; | |
614 | ret = btrfs_insert_empty_item(trans, quota_root, path, &key, | |
615 | sizeof(*qgroup_limit)); | |
0b4699dc | 616 | if (ret && ret != -EEXIST) |
bed92eae AJ |
617 | goto out; |
618 | ||
619 | leaf = path->nodes[0]; | |
620 | qgroup_limit = btrfs_item_ptr(leaf, path->slots[0], | |
621 | struct btrfs_qgroup_limit_item); | |
622 | btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0); | |
623 | btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0); | |
624 | btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0); | |
625 | btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0); | |
626 | btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0); | |
627 | ||
628 | btrfs_mark_buffer_dirty(leaf); | |
629 | ||
630 | ret = 0; | |
631 | out: | |
632 | btrfs_free_path(path); | |
633 | return ret; | |
634 | } | |
635 | ||
636 | static int del_qgroup_item(struct btrfs_trans_handle *trans, | |
637 | struct btrfs_root *quota_root, u64 qgroupid) | |
638 | { | |
639 | int ret; | |
640 | struct btrfs_path *path; | |
641 | struct btrfs_key key; | |
642 | ||
643 | path = btrfs_alloc_path(); | |
644 | if (!path) | |
645 | return -ENOMEM; | |
646 | ||
647 | key.objectid = 0; | |
648 | key.type = BTRFS_QGROUP_INFO_KEY; | |
649 | key.offset = qgroupid; | |
650 | ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1); | |
651 | if (ret < 0) | |
652 | goto out; | |
653 | ||
654 | if (ret > 0) { | |
655 | ret = -ENOENT; | |
656 | goto out; | |
657 | } | |
658 | ||
659 | ret = btrfs_del_item(trans, quota_root, path); | |
660 | if (ret) | |
661 | goto out; | |
662 | ||
663 | btrfs_release_path(path); | |
664 | ||
665 | key.type = BTRFS_QGROUP_LIMIT_KEY; | |
666 | ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1); | |
667 | if (ret < 0) | |
668 | goto out; | |
669 | ||
670 | if (ret > 0) { | |
671 | ret = -ENOENT; | |
672 | goto out; | |
673 | } | |
674 | ||
675 | ret = btrfs_del_item(trans, quota_root, path); | |
676 | ||
677 | out: | |
678 | btrfs_free_path(path); | |
679 | return ret; | |
680 | } | |
681 | ||
682 | static int update_qgroup_limit_item(struct btrfs_trans_handle *trans, | |
1510e71c DY |
683 | struct btrfs_root *root, |
684 | struct btrfs_qgroup *qgroup) | |
bed92eae AJ |
685 | { |
686 | struct btrfs_path *path; | |
687 | struct btrfs_key key; | |
688 | struct extent_buffer *l; | |
689 | struct btrfs_qgroup_limit_item *qgroup_limit; | |
690 | int ret; | |
691 | int slot; | |
692 | ||
693 | key.objectid = 0; | |
694 | key.type = BTRFS_QGROUP_LIMIT_KEY; | |
1510e71c | 695 | key.offset = qgroup->qgroupid; |
bed92eae AJ |
696 | |
697 | path = btrfs_alloc_path(); | |
84cbe2f7 WS |
698 | if (!path) |
699 | return -ENOMEM; | |
700 | ||
bed92eae AJ |
701 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
702 | if (ret > 0) | |
703 | ret = -ENOENT; | |
704 | ||
705 | if (ret) | |
706 | goto out; | |
707 | ||
708 | l = path->nodes[0]; | |
709 | slot = path->slots[0]; | |
a3df41ee | 710 | qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item); |
1510e71c DY |
711 | btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags); |
712 | btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer); | |
713 | btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl); | |
714 | btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer); | |
715 | btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl); | |
bed92eae AJ |
716 | |
717 | btrfs_mark_buffer_dirty(l); | |
718 | ||
719 | out: | |
720 | btrfs_free_path(path); | |
721 | return ret; | |
722 | } | |
723 | ||
724 | static int update_qgroup_info_item(struct btrfs_trans_handle *trans, | |
725 | struct btrfs_root *root, | |
726 | struct btrfs_qgroup *qgroup) | |
727 | { | |
728 | struct btrfs_path *path; | |
729 | struct btrfs_key key; | |
730 | struct extent_buffer *l; | |
731 | struct btrfs_qgroup_info_item *qgroup_info; | |
732 | int ret; | |
733 | int slot; | |
734 | ||
f5ee5c9a | 735 | if (btrfs_is_testing(root->fs_info)) |
faa2dbf0 | 736 | return 0; |
fccb84c9 | 737 | |
bed92eae AJ |
738 | key.objectid = 0; |
739 | key.type = BTRFS_QGROUP_INFO_KEY; | |
740 | key.offset = qgroup->qgroupid; | |
741 | ||
742 | path = btrfs_alloc_path(); | |
84cbe2f7 WS |
743 | if (!path) |
744 | return -ENOMEM; | |
745 | ||
bed92eae AJ |
746 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
747 | if (ret > 0) | |
748 | ret = -ENOENT; | |
749 | ||
750 | if (ret) | |
751 | goto out; | |
752 | ||
753 | l = path->nodes[0]; | |
754 | slot = path->slots[0]; | |
a3df41ee | 755 | qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item); |
bed92eae AJ |
756 | btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid); |
757 | btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer); | |
758 | btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr); | |
759 | btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl); | |
760 | btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr); | |
761 | ||
762 | btrfs_mark_buffer_dirty(l); | |
763 | ||
764 | out: | |
765 | btrfs_free_path(path); | |
766 | return ret; | |
767 | } | |
768 | ||
769 | static int update_qgroup_status_item(struct btrfs_trans_handle *trans, | |
770 | struct btrfs_fs_info *fs_info, | |
771 | struct btrfs_root *root) | |
772 | { | |
773 | struct btrfs_path *path; | |
774 | struct btrfs_key key; | |
775 | struct extent_buffer *l; | |
776 | struct btrfs_qgroup_status_item *ptr; | |
777 | int ret; | |
778 | int slot; | |
779 | ||
780 | key.objectid = 0; | |
781 | key.type = BTRFS_QGROUP_STATUS_KEY; | |
782 | key.offset = 0; | |
783 | ||
784 | path = btrfs_alloc_path(); | |
84cbe2f7 WS |
785 | if (!path) |
786 | return -ENOMEM; | |
787 | ||
bed92eae AJ |
788 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
789 | if (ret > 0) | |
790 | ret = -ENOENT; | |
791 | ||
792 | if (ret) | |
793 | goto out; | |
794 | ||
795 | l = path->nodes[0]; | |
796 | slot = path->slots[0]; | |
797 | ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item); | |
798 | btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags); | |
799 | btrfs_set_qgroup_status_generation(l, ptr, trans->transid); | |
2f232036 JS |
800 | btrfs_set_qgroup_status_rescan(l, ptr, |
801 | fs_info->qgroup_rescan_progress.objectid); | |
bed92eae AJ |
802 | |
803 | btrfs_mark_buffer_dirty(l); | |
804 | ||
805 | out: | |
806 | btrfs_free_path(path); | |
807 | return ret; | |
808 | } | |
809 | ||
810 | /* | |
811 | * called with qgroup_lock held | |
812 | */ | |
813 | static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans, | |
814 | struct btrfs_root *root) | |
815 | { | |
816 | struct btrfs_path *path; | |
817 | struct btrfs_key key; | |
06b3a860 | 818 | struct extent_buffer *leaf = NULL; |
bed92eae | 819 | int ret; |
06b3a860 | 820 | int nr = 0; |
bed92eae | 821 | |
bed92eae AJ |
822 | path = btrfs_alloc_path(); |
823 | if (!path) | |
824 | return -ENOMEM; | |
825 | ||
06b3a860 WS |
826 | path->leave_spinning = 1; |
827 | ||
828 | key.objectid = 0; | |
829 | key.offset = 0; | |
830 | key.type = 0; | |
bed92eae | 831 | |
06b3a860 | 832 | while (1) { |
bed92eae | 833 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
06b3a860 WS |
834 | if (ret < 0) |
835 | goto out; | |
836 | leaf = path->nodes[0]; | |
837 | nr = btrfs_header_nritems(leaf); | |
838 | if (!nr) | |
bed92eae | 839 | break; |
06b3a860 WS |
840 | /* |
841 | * delete the leaf one by one | |
842 | * since the whole tree is going | |
843 | * to be deleted. | |
844 | */ | |
845 | path->slots[0] = 0; | |
846 | ret = btrfs_del_items(trans, root, path, 0, nr); | |
bed92eae AJ |
847 | if (ret) |
848 | goto out; | |
06b3a860 | 849 | |
bed92eae AJ |
850 | btrfs_release_path(path); |
851 | } | |
852 | ret = 0; | |
853 | out: | |
afcdd129 | 854 | set_bit(BTRFS_FS_QUOTA_DISABLING, &root->fs_info->flags); |
bed92eae AJ |
855 | btrfs_free_path(path); |
856 | return ret; | |
857 | } | |
858 | ||
859 | int btrfs_quota_enable(struct btrfs_trans_handle *trans, | |
860 | struct btrfs_fs_info *fs_info) | |
861 | { | |
862 | struct btrfs_root *quota_root; | |
7708f029 | 863 | struct btrfs_root *tree_root = fs_info->tree_root; |
bed92eae AJ |
864 | struct btrfs_path *path = NULL; |
865 | struct btrfs_qgroup_status_item *ptr; | |
866 | struct extent_buffer *leaf; | |
867 | struct btrfs_key key; | |
7708f029 WS |
868 | struct btrfs_key found_key; |
869 | struct btrfs_qgroup *qgroup = NULL; | |
bed92eae | 870 | int ret = 0; |
7708f029 | 871 | int slot; |
bed92eae | 872 | |
f2f6ed3d | 873 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
bed92eae | 874 | if (fs_info->quota_root) { |
afcdd129 | 875 | set_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags); |
bed92eae AJ |
876 | goto out; |
877 | } | |
bed92eae | 878 | |
52bf8e7a | 879 | fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL); |
1e8f9158 WS |
880 | if (!fs_info->qgroup_ulist) { |
881 | ret = -ENOMEM; | |
882 | goto out; | |
883 | } | |
884 | ||
bed92eae AJ |
885 | /* |
886 | * initially create the quota tree | |
887 | */ | |
888 | quota_root = btrfs_create_tree(trans, fs_info, | |
889 | BTRFS_QUOTA_TREE_OBJECTID); | |
890 | if (IS_ERR(quota_root)) { | |
891 | ret = PTR_ERR(quota_root); | |
892 | goto out; | |
893 | } | |
894 | ||
895 | path = btrfs_alloc_path(); | |
5b7ff5b3 TI |
896 | if (!path) { |
897 | ret = -ENOMEM; | |
898 | goto out_free_root; | |
899 | } | |
bed92eae AJ |
900 | |
901 | key.objectid = 0; | |
902 | key.type = BTRFS_QGROUP_STATUS_KEY; | |
903 | key.offset = 0; | |
904 | ||
905 | ret = btrfs_insert_empty_item(trans, quota_root, path, &key, | |
906 | sizeof(*ptr)); | |
907 | if (ret) | |
5b7ff5b3 | 908 | goto out_free_path; |
bed92eae AJ |
909 | |
910 | leaf = path->nodes[0]; | |
911 | ptr = btrfs_item_ptr(leaf, path->slots[0], | |
912 | struct btrfs_qgroup_status_item); | |
913 | btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid); | |
914 | btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION); | |
915 | fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON | | |
916 | BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
917 | btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags); | |
2f232036 | 918 | btrfs_set_qgroup_status_rescan(leaf, ptr, 0); |
bed92eae AJ |
919 | |
920 | btrfs_mark_buffer_dirty(leaf); | |
921 | ||
7708f029 WS |
922 | key.objectid = 0; |
923 | key.type = BTRFS_ROOT_REF_KEY; | |
924 | key.offset = 0; | |
925 | ||
926 | btrfs_release_path(path); | |
927 | ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0); | |
928 | if (ret > 0) | |
929 | goto out_add_root; | |
930 | if (ret < 0) | |
931 | goto out_free_path; | |
932 | ||
933 | ||
934 | while (1) { | |
935 | slot = path->slots[0]; | |
936 | leaf = path->nodes[0]; | |
937 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
938 | ||
939 | if (found_key.type == BTRFS_ROOT_REF_KEY) { | |
940 | ret = add_qgroup_item(trans, quota_root, | |
941 | found_key.offset); | |
942 | if (ret) | |
943 | goto out_free_path; | |
944 | ||
7708f029 WS |
945 | qgroup = add_qgroup_rb(fs_info, found_key.offset); |
946 | if (IS_ERR(qgroup)) { | |
7708f029 WS |
947 | ret = PTR_ERR(qgroup); |
948 | goto out_free_path; | |
949 | } | |
7708f029 WS |
950 | } |
951 | ret = btrfs_next_item(tree_root, path); | |
952 | if (ret < 0) | |
953 | goto out_free_path; | |
954 | if (ret) | |
955 | break; | |
956 | } | |
957 | ||
958 | out_add_root: | |
959 | btrfs_release_path(path); | |
960 | ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID); | |
961 | if (ret) | |
962 | goto out_free_path; | |
963 | ||
7708f029 WS |
964 | qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID); |
965 | if (IS_ERR(qgroup)) { | |
7708f029 WS |
966 | ret = PTR_ERR(qgroup); |
967 | goto out_free_path; | |
968 | } | |
58400fce | 969 | spin_lock(&fs_info->qgroup_lock); |
bed92eae | 970 | fs_info->quota_root = quota_root; |
afcdd129 | 971 | set_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags); |
bed92eae | 972 | spin_unlock(&fs_info->qgroup_lock); |
5b7ff5b3 | 973 | out_free_path: |
bed92eae | 974 | btrfs_free_path(path); |
5b7ff5b3 TI |
975 | out_free_root: |
976 | if (ret) { | |
977 | free_extent_buffer(quota_root->node); | |
978 | free_extent_buffer(quota_root->commit_root); | |
979 | kfree(quota_root); | |
980 | } | |
981 | out: | |
eb1716af | 982 | if (ret) { |
1e8f9158 | 983 | ulist_free(fs_info->qgroup_ulist); |
eb1716af JS |
984 | fs_info->qgroup_ulist = NULL; |
985 | } | |
f2f6ed3d | 986 | mutex_unlock(&fs_info->qgroup_ioctl_lock); |
bed92eae AJ |
987 | return ret; |
988 | } | |
989 | ||
990 | int btrfs_quota_disable(struct btrfs_trans_handle *trans, | |
991 | struct btrfs_fs_info *fs_info) | |
992 | { | |
993 | struct btrfs_root *tree_root = fs_info->tree_root; | |
994 | struct btrfs_root *quota_root; | |
995 | int ret = 0; | |
996 | ||
f2f6ed3d | 997 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
58400fce | 998 | if (!fs_info->quota_root) |
f2f6ed3d | 999 | goto out; |
afcdd129 JB |
1000 | clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); |
1001 | set_bit(BTRFS_FS_QUOTA_DISABLING, &fs_info->flags); | |
d06f23d6 | 1002 | btrfs_qgroup_wait_for_completion(fs_info, false); |
967ef513 | 1003 | spin_lock(&fs_info->qgroup_lock); |
bed92eae AJ |
1004 | quota_root = fs_info->quota_root; |
1005 | fs_info->quota_root = NULL; | |
8ea0ec9e | 1006 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON; |
bed92eae AJ |
1007 | spin_unlock(&fs_info->qgroup_lock); |
1008 | ||
e685da14 WS |
1009 | btrfs_free_qgroup_config(fs_info); |
1010 | ||
bed92eae AJ |
1011 | ret = btrfs_clean_quota_tree(trans, quota_root); |
1012 | if (ret) | |
1013 | goto out; | |
1014 | ||
1015 | ret = btrfs_del_root(trans, tree_root, "a_root->root_key); | |
1016 | if (ret) | |
1017 | goto out; | |
1018 | ||
1019 | list_del("a_root->dirty_list); | |
1020 | ||
1021 | btrfs_tree_lock(quota_root->node); | |
0b246afa | 1022 | clean_tree_block(trans, fs_info, quota_root->node); |
bed92eae AJ |
1023 | btrfs_tree_unlock(quota_root->node); |
1024 | btrfs_free_tree_block(trans, quota_root, quota_root->node, 0, 1); | |
1025 | ||
1026 | free_extent_buffer(quota_root->node); | |
1027 | free_extent_buffer(quota_root->commit_root); | |
1028 | kfree(quota_root); | |
1029 | out: | |
f2f6ed3d | 1030 | mutex_unlock(&fs_info->qgroup_ioctl_lock); |
bed92eae AJ |
1031 | return ret; |
1032 | } | |
1033 | ||
2f232036 JS |
1034 | static void qgroup_dirty(struct btrfs_fs_info *fs_info, |
1035 | struct btrfs_qgroup *qgroup) | |
bed92eae | 1036 | { |
2f232036 JS |
1037 | if (list_empty(&qgroup->dirty)) |
1038 | list_add(&qgroup->dirty, &fs_info->dirty_qgroups); | |
bed92eae AJ |
1039 | } |
1040 | ||
18dc22c1 QW |
1041 | static void report_reserved_underflow(struct btrfs_fs_info *fs_info, |
1042 | struct btrfs_qgroup *qgroup, | |
1043 | u64 num_bytes) | |
1044 | { | |
1045 | btrfs_warn(fs_info, | |
1046 | "qgroup %llu reserved space underflow, have: %llu, to free: %llu", | |
1047 | qgroup->qgroupid, qgroup->reserved, num_bytes); | |
1048 | qgroup->reserved = 0; | |
1049 | } | |
9c8b35b1 QW |
1050 | /* |
1051 | * The easy accounting, if we are adding/removing the only ref for an extent | |
01327610 | 1052 | * then this qgroup and all of the parent qgroups get their reference and |
9c8b35b1 QW |
1053 | * exclusive counts adjusted. |
1054 | * | |
1055 | * Caller should hold fs_info->qgroup_lock. | |
1056 | */ | |
1057 | static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info, | |
1058 | struct ulist *tmp, u64 ref_root, | |
1059 | u64 num_bytes, int sign) | |
1060 | { | |
1061 | struct btrfs_qgroup *qgroup; | |
1062 | struct btrfs_qgroup_list *glist; | |
1063 | struct ulist_node *unode; | |
1064 | struct ulist_iterator uiter; | |
1065 | int ret = 0; | |
1066 | ||
1067 | qgroup = find_qgroup_rb(fs_info, ref_root); | |
1068 | if (!qgroup) | |
1069 | goto out; | |
1070 | ||
1071 | qgroup->rfer += sign * num_bytes; | |
1072 | qgroup->rfer_cmpr += sign * num_bytes; | |
1073 | ||
1074 | WARN_ON(sign < 0 && qgroup->excl < num_bytes); | |
1075 | qgroup->excl += sign * num_bytes; | |
1076 | qgroup->excl_cmpr += sign * num_bytes; | |
18dc22c1 QW |
1077 | if (sign > 0) { |
1078 | if (WARN_ON(qgroup->reserved < num_bytes)) | |
1079 | report_reserved_underflow(fs_info, qgroup, num_bytes); | |
1080 | else | |
1081 | qgroup->reserved -= num_bytes; | |
1082 | } | |
9c8b35b1 QW |
1083 | |
1084 | qgroup_dirty(fs_info, qgroup); | |
1085 | ||
1086 | /* Get all of the parent groups that contain this qgroup */ | |
1087 | list_for_each_entry(glist, &qgroup->groups, next_group) { | |
1088 | ret = ulist_add(tmp, glist->group->qgroupid, | |
ef2fff64 | 1089 | qgroup_to_aux(glist->group), GFP_ATOMIC); |
9c8b35b1 QW |
1090 | if (ret < 0) |
1091 | goto out; | |
1092 | } | |
1093 | ||
1094 | /* Iterate all of the parents and adjust their reference counts */ | |
1095 | ULIST_ITER_INIT(&uiter); | |
1096 | while ((unode = ulist_next(tmp, &uiter))) { | |
ef2fff64 | 1097 | qgroup = unode_aux_to_qgroup(unode); |
9c8b35b1 QW |
1098 | qgroup->rfer += sign * num_bytes; |
1099 | qgroup->rfer_cmpr += sign * num_bytes; | |
1100 | WARN_ON(sign < 0 && qgroup->excl < num_bytes); | |
1101 | qgroup->excl += sign * num_bytes; | |
18dc22c1 QW |
1102 | if (sign > 0) { |
1103 | if (WARN_ON(qgroup->reserved < num_bytes)) | |
1104 | report_reserved_underflow(fs_info, qgroup, | |
1105 | num_bytes); | |
1106 | else | |
1107 | qgroup->reserved -= num_bytes; | |
1108 | } | |
9c8b35b1 QW |
1109 | qgroup->excl_cmpr += sign * num_bytes; |
1110 | qgroup_dirty(fs_info, qgroup); | |
1111 | ||
1112 | /* Add any parents of the parents */ | |
1113 | list_for_each_entry(glist, &qgroup->groups, next_group) { | |
1114 | ret = ulist_add(tmp, glist->group->qgroupid, | |
ef2fff64 | 1115 | qgroup_to_aux(glist->group), GFP_ATOMIC); |
9c8b35b1 QW |
1116 | if (ret < 0) |
1117 | goto out; | |
1118 | } | |
1119 | } | |
1120 | ret = 0; | |
1121 | out: | |
1122 | return ret; | |
1123 | } | |
1124 | ||
1125 | ||
1126 | /* | |
1127 | * Quick path for updating qgroup with only excl refs. | |
1128 | * | |
1129 | * In that case, just update all parent will be enough. | |
1130 | * Or we needs to do a full rescan. | |
1131 | * Caller should also hold fs_info->qgroup_lock. | |
1132 | * | |
1133 | * Return 0 for quick update, return >0 for need to full rescan | |
1134 | * and mark INCONSISTENT flag. | |
1135 | * Return < 0 for other error. | |
1136 | */ | |
1137 | static int quick_update_accounting(struct btrfs_fs_info *fs_info, | |
1138 | struct ulist *tmp, u64 src, u64 dst, | |
1139 | int sign) | |
1140 | { | |
1141 | struct btrfs_qgroup *qgroup; | |
1142 | int ret = 1; | |
1143 | int err = 0; | |
1144 | ||
1145 | qgroup = find_qgroup_rb(fs_info, src); | |
1146 | if (!qgroup) | |
1147 | goto out; | |
1148 | if (qgroup->excl == qgroup->rfer) { | |
1149 | ret = 0; | |
1150 | err = __qgroup_excl_accounting(fs_info, tmp, dst, | |
1151 | qgroup->excl, sign); | |
1152 | if (err < 0) { | |
1153 | ret = err; | |
1154 | goto out; | |
1155 | } | |
1156 | } | |
1157 | out: | |
1158 | if (ret) | |
1159 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
1160 | return ret; | |
1161 | } | |
1162 | ||
bed92eae AJ |
1163 | int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, |
1164 | struct btrfs_fs_info *fs_info, u64 src, u64 dst) | |
1165 | { | |
1166 | struct btrfs_root *quota_root; | |
b7fef4f5 WS |
1167 | struct btrfs_qgroup *parent; |
1168 | struct btrfs_qgroup *member; | |
534e6623 | 1169 | struct btrfs_qgroup_list *list; |
9c8b35b1 | 1170 | struct ulist *tmp; |
bed92eae AJ |
1171 | int ret = 0; |
1172 | ||
8465ecec QW |
1173 | /* Check the level of src and dst first */ |
1174 | if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst)) | |
1175 | return -EINVAL; | |
1176 | ||
6602caf1 | 1177 | tmp = ulist_alloc(GFP_KERNEL); |
ab3680dd CE |
1178 | if (!tmp) |
1179 | return -ENOMEM; | |
1180 | ||
f2f6ed3d | 1181 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
bed92eae | 1182 | quota_root = fs_info->quota_root; |
f2f6ed3d WS |
1183 | if (!quota_root) { |
1184 | ret = -EINVAL; | |
1185 | goto out; | |
1186 | } | |
b7fef4f5 WS |
1187 | member = find_qgroup_rb(fs_info, src); |
1188 | parent = find_qgroup_rb(fs_info, dst); | |
1189 | if (!member || !parent) { | |
1190 | ret = -EINVAL; | |
1191 | goto out; | |
1192 | } | |
bed92eae | 1193 | |
534e6623 WS |
1194 | /* check if such qgroup relation exist firstly */ |
1195 | list_for_each_entry(list, &member->groups, next_group) { | |
1196 | if (list->group == parent) { | |
1197 | ret = -EEXIST; | |
1198 | goto out; | |
1199 | } | |
1200 | } | |
1201 | ||
bed92eae AJ |
1202 | ret = add_qgroup_relation_item(trans, quota_root, src, dst); |
1203 | if (ret) | |
f2f6ed3d | 1204 | goto out; |
bed92eae AJ |
1205 | |
1206 | ret = add_qgroup_relation_item(trans, quota_root, dst, src); | |
1207 | if (ret) { | |
1208 | del_qgroup_relation_item(trans, quota_root, src, dst); | |
f2f6ed3d | 1209 | goto out; |
bed92eae AJ |
1210 | } |
1211 | ||
1212 | spin_lock(&fs_info->qgroup_lock); | |
0b246afa | 1213 | ret = add_relation_rb(fs_info, src, dst); |
9c8b35b1 QW |
1214 | if (ret < 0) { |
1215 | spin_unlock(&fs_info->qgroup_lock); | |
1216 | goto out; | |
1217 | } | |
1218 | ret = quick_update_accounting(fs_info, tmp, src, dst, 1); | |
bed92eae | 1219 | spin_unlock(&fs_info->qgroup_lock); |
f2f6ed3d WS |
1220 | out: |
1221 | mutex_unlock(&fs_info->qgroup_ioctl_lock); | |
9c8b35b1 | 1222 | ulist_free(tmp); |
bed92eae AJ |
1223 | return ret; |
1224 | } | |
1225 | ||
025db916 | 1226 | static int __del_qgroup_relation(struct btrfs_trans_handle *trans, |
bed92eae AJ |
1227 | struct btrfs_fs_info *fs_info, u64 src, u64 dst) |
1228 | { | |
1229 | struct btrfs_root *quota_root; | |
534e6623 WS |
1230 | struct btrfs_qgroup *parent; |
1231 | struct btrfs_qgroup *member; | |
1232 | struct btrfs_qgroup_list *list; | |
9c8b35b1 | 1233 | struct ulist *tmp; |
bed92eae AJ |
1234 | int ret = 0; |
1235 | int err; | |
1236 | ||
6602caf1 | 1237 | tmp = ulist_alloc(GFP_KERNEL); |
9c8b35b1 QW |
1238 | if (!tmp) |
1239 | return -ENOMEM; | |
1240 | ||
bed92eae | 1241 | quota_root = fs_info->quota_root; |
f2f6ed3d WS |
1242 | if (!quota_root) { |
1243 | ret = -EINVAL; | |
1244 | goto out; | |
1245 | } | |
bed92eae | 1246 | |
534e6623 WS |
1247 | member = find_qgroup_rb(fs_info, src); |
1248 | parent = find_qgroup_rb(fs_info, dst); | |
1249 | if (!member || !parent) { | |
1250 | ret = -EINVAL; | |
1251 | goto out; | |
1252 | } | |
1253 | ||
1254 | /* check if such qgroup relation exist firstly */ | |
1255 | list_for_each_entry(list, &member->groups, next_group) { | |
1256 | if (list->group == parent) | |
1257 | goto exist; | |
1258 | } | |
1259 | ret = -ENOENT; | |
1260 | goto out; | |
1261 | exist: | |
bed92eae AJ |
1262 | ret = del_qgroup_relation_item(trans, quota_root, src, dst); |
1263 | err = del_qgroup_relation_item(trans, quota_root, dst, src); | |
1264 | if (err && !ret) | |
1265 | ret = err; | |
1266 | ||
1267 | spin_lock(&fs_info->qgroup_lock); | |
1268 | del_relation_rb(fs_info, src, dst); | |
9c8b35b1 | 1269 | ret = quick_update_accounting(fs_info, tmp, src, dst, -1); |
bed92eae | 1270 | spin_unlock(&fs_info->qgroup_lock); |
f2f6ed3d | 1271 | out: |
9c8b35b1 | 1272 | ulist_free(tmp); |
f5a6b1c5 DY |
1273 | return ret; |
1274 | } | |
1275 | ||
1276 | int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, | |
1277 | struct btrfs_fs_info *fs_info, u64 src, u64 dst) | |
1278 | { | |
1279 | int ret = 0; | |
1280 | ||
1281 | mutex_lock(&fs_info->qgroup_ioctl_lock); | |
1282 | ret = __del_qgroup_relation(trans, fs_info, src, dst); | |
f2f6ed3d | 1283 | mutex_unlock(&fs_info->qgroup_ioctl_lock); |
f5a6b1c5 | 1284 | |
bed92eae AJ |
1285 | return ret; |
1286 | } | |
1287 | ||
1288 | int btrfs_create_qgroup(struct btrfs_trans_handle *trans, | |
4087cf24 | 1289 | struct btrfs_fs_info *fs_info, u64 qgroupid) |
bed92eae AJ |
1290 | { |
1291 | struct btrfs_root *quota_root; | |
1292 | struct btrfs_qgroup *qgroup; | |
1293 | int ret = 0; | |
1294 | ||
f2f6ed3d | 1295 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
bed92eae | 1296 | quota_root = fs_info->quota_root; |
f2f6ed3d WS |
1297 | if (!quota_root) { |
1298 | ret = -EINVAL; | |
1299 | goto out; | |
1300 | } | |
534e6623 WS |
1301 | qgroup = find_qgroup_rb(fs_info, qgroupid); |
1302 | if (qgroup) { | |
1303 | ret = -EEXIST; | |
1304 | goto out; | |
1305 | } | |
bed92eae AJ |
1306 | |
1307 | ret = add_qgroup_item(trans, quota_root, qgroupid); | |
534e6623 WS |
1308 | if (ret) |
1309 | goto out; | |
bed92eae AJ |
1310 | |
1311 | spin_lock(&fs_info->qgroup_lock); | |
1312 | qgroup = add_qgroup_rb(fs_info, qgroupid); | |
1313 | spin_unlock(&fs_info->qgroup_lock); | |
1314 | ||
1315 | if (IS_ERR(qgroup)) | |
1316 | ret = PTR_ERR(qgroup); | |
f2f6ed3d WS |
1317 | out: |
1318 | mutex_unlock(&fs_info->qgroup_ioctl_lock); | |
bed92eae AJ |
1319 | return ret; |
1320 | } | |
1321 | ||
1322 | int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, | |
1323 | struct btrfs_fs_info *fs_info, u64 qgroupid) | |
1324 | { | |
1325 | struct btrfs_root *quota_root; | |
2cf68703 | 1326 | struct btrfs_qgroup *qgroup; |
f5a6b1c5 | 1327 | struct btrfs_qgroup_list *list; |
bed92eae AJ |
1328 | int ret = 0; |
1329 | ||
f2f6ed3d | 1330 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
bed92eae | 1331 | quota_root = fs_info->quota_root; |
f2f6ed3d WS |
1332 | if (!quota_root) { |
1333 | ret = -EINVAL; | |
1334 | goto out; | |
1335 | } | |
bed92eae | 1336 | |
2cf68703 | 1337 | qgroup = find_qgroup_rb(fs_info, qgroupid); |
534e6623 WS |
1338 | if (!qgroup) { |
1339 | ret = -ENOENT; | |
1340 | goto out; | |
1341 | } else { | |
f5a6b1c5 DY |
1342 | /* check if there are no children of this qgroup */ |
1343 | if (!list_empty(&qgroup->members)) { | |
f2f6ed3d WS |
1344 | ret = -EBUSY; |
1345 | goto out; | |
2cf68703 AJ |
1346 | } |
1347 | } | |
bed92eae AJ |
1348 | ret = del_qgroup_item(trans, quota_root, qgroupid); |
1349 | ||
f5a6b1c5 DY |
1350 | while (!list_empty(&qgroup->groups)) { |
1351 | list = list_first_entry(&qgroup->groups, | |
1352 | struct btrfs_qgroup_list, next_group); | |
1353 | ret = __del_qgroup_relation(trans, fs_info, | |
1354 | qgroupid, | |
1355 | list->group->qgroupid); | |
1356 | if (ret) | |
1357 | goto out; | |
1358 | } | |
1359 | ||
bed92eae | 1360 | spin_lock(&fs_info->qgroup_lock); |
0b246afa | 1361 | del_qgroup_rb(fs_info, qgroupid); |
bed92eae | 1362 | spin_unlock(&fs_info->qgroup_lock); |
f2f6ed3d WS |
1363 | out: |
1364 | mutex_unlock(&fs_info->qgroup_ioctl_lock); | |
bed92eae AJ |
1365 | return ret; |
1366 | } | |
1367 | ||
1368 | int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, | |
1369 | struct btrfs_fs_info *fs_info, u64 qgroupid, | |
1370 | struct btrfs_qgroup_limit *limit) | |
1371 | { | |
f2f6ed3d | 1372 | struct btrfs_root *quota_root; |
bed92eae AJ |
1373 | struct btrfs_qgroup *qgroup; |
1374 | int ret = 0; | |
fe759907 YD |
1375 | /* Sometimes we would want to clear the limit on this qgroup. |
1376 | * To meet this requirement, we treat the -1 as a special value | |
1377 | * which tell kernel to clear the limit on this qgroup. | |
1378 | */ | |
1379 | const u64 CLEAR_VALUE = -1; | |
bed92eae | 1380 | |
f2f6ed3d WS |
1381 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
1382 | quota_root = fs_info->quota_root; | |
1383 | if (!quota_root) { | |
1384 | ret = -EINVAL; | |
1385 | goto out; | |
1386 | } | |
bed92eae | 1387 | |
ddb47afa WS |
1388 | qgroup = find_qgroup_rb(fs_info, qgroupid); |
1389 | if (!qgroup) { | |
1390 | ret = -ENOENT; | |
1391 | goto out; | |
1392 | } | |
bed92eae | 1393 | |
58400fce | 1394 | spin_lock(&fs_info->qgroup_lock); |
fe759907 YD |
1395 | if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) { |
1396 | if (limit->max_rfer == CLEAR_VALUE) { | |
1397 | qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER; | |
1398 | limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER; | |
1399 | qgroup->max_rfer = 0; | |
1400 | } else { | |
1401 | qgroup->max_rfer = limit->max_rfer; | |
1402 | } | |
1403 | } | |
1404 | if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) { | |
1405 | if (limit->max_excl == CLEAR_VALUE) { | |
1406 | qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL; | |
1407 | limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL; | |
1408 | qgroup->max_excl = 0; | |
1409 | } else { | |
1410 | qgroup->max_excl = limit->max_excl; | |
1411 | } | |
1412 | } | |
1413 | if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) { | |
1414 | if (limit->rsv_rfer == CLEAR_VALUE) { | |
1415 | qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER; | |
1416 | limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER; | |
1417 | qgroup->rsv_rfer = 0; | |
1418 | } else { | |
1419 | qgroup->rsv_rfer = limit->rsv_rfer; | |
1420 | } | |
1421 | } | |
1422 | if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) { | |
1423 | if (limit->rsv_excl == CLEAR_VALUE) { | |
1424 | qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL; | |
1425 | limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL; | |
1426 | qgroup->rsv_excl = 0; | |
1427 | } else { | |
1428 | qgroup->rsv_excl = limit->rsv_excl; | |
1429 | } | |
1430 | } | |
03477d94 DY |
1431 | qgroup->lim_flags |= limit->flags; |
1432 | ||
bed92eae | 1433 | spin_unlock(&fs_info->qgroup_lock); |
1510e71c DY |
1434 | |
1435 | ret = update_qgroup_limit_item(trans, quota_root, qgroup); | |
1436 | if (ret) { | |
1437 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
1438 | btrfs_info(fs_info, "unable to update quota limit for %llu", | |
1439 | qgroupid); | |
1440 | } | |
1441 | ||
f2f6ed3d WS |
1442 | out: |
1443 | mutex_unlock(&fs_info->qgroup_ioctl_lock); | |
bed92eae AJ |
1444 | return ret; |
1445 | } | |
1152651a | 1446 | |
3b7d00f9 QW |
1447 | int btrfs_qgroup_prepare_account_extents(struct btrfs_trans_handle *trans, |
1448 | struct btrfs_fs_info *fs_info) | |
1449 | { | |
1450 | struct btrfs_qgroup_extent_record *record; | |
1451 | struct btrfs_delayed_ref_root *delayed_refs; | |
1452 | struct rb_node *node; | |
9086db86 | 1453 | u64 qgroup_to_skip; |
3b7d00f9 QW |
1454 | int ret = 0; |
1455 | ||
1456 | delayed_refs = &trans->transaction->delayed_refs; | |
9086db86 | 1457 | qgroup_to_skip = delayed_refs->qgroup_to_skip; |
3b7d00f9 QW |
1458 | |
1459 | /* | |
1460 | * No need to do lock, since this function will only be called in | |
01327610 | 1461 | * btrfs_commit_transaction(). |
3b7d00f9 QW |
1462 | */ |
1463 | node = rb_first(&delayed_refs->dirty_extent_root); | |
1464 | while (node) { | |
1465 | record = rb_entry(node, struct btrfs_qgroup_extent_record, | |
1466 | node); | |
1467 | ret = btrfs_find_all_roots(NULL, fs_info, record->bytenr, 0, | |
1468 | &record->old_roots); | |
1469 | if (ret < 0) | |
1470 | break; | |
9086db86 QW |
1471 | if (qgroup_to_skip) |
1472 | ulist_del(record->old_roots, qgroup_to_skip, 0); | |
3b7d00f9 QW |
1473 | node = rb_next(node); |
1474 | } | |
1475 | return ret; | |
1476 | } | |
1477 | ||
50b3e040 | 1478 | int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info, |
cb93b52c QW |
1479 | struct btrfs_delayed_ref_root *delayed_refs, |
1480 | struct btrfs_qgroup_extent_record *record) | |
3368d001 QW |
1481 | { |
1482 | struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node; | |
1483 | struct rb_node *parent_node = NULL; | |
1484 | struct btrfs_qgroup_extent_record *entry; | |
1485 | u64 bytenr = record->bytenr; | |
1486 | ||
82bd101b | 1487 | assert_spin_locked(&delayed_refs->lock); |
50b3e040 | 1488 | trace_btrfs_qgroup_trace_extent(fs_info, record); |
82bd101b | 1489 | |
3368d001 QW |
1490 | while (*p) { |
1491 | parent_node = *p; | |
1492 | entry = rb_entry(parent_node, struct btrfs_qgroup_extent_record, | |
1493 | node); | |
1494 | if (bytenr < entry->bytenr) | |
1495 | p = &(*p)->rb_left; | |
1496 | else if (bytenr > entry->bytenr) | |
1497 | p = &(*p)->rb_right; | |
1498 | else | |
cb93b52c | 1499 | return 1; |
3368d001 QW |
1500 | } |
1501 | ||
1502 | rb_link_node(&record->node, parent_node, p); | |
1503 | rb_insert_color(&record->node, &delayed_refs->dirty_extent_root); | |
cb93b52c QW |
1504 | return 0; |
1505 | } | |
1506 | ||
50b3e040 | 1507 | int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, |
cb93b52c QW |
1508 | struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes, |
1509 | gfp_t gfp_flag) | |
1510 | { | |
1511 | struct btrfs_qgroup_extent_record *record; | |
1512 | struct btrfs_delayed_ref_root *delayed_refs; | |
1513 | int ret; | |
1514 | ||
afcdd129 JB |
1515 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) |
1516 | || bytenr == 0 || num_bytes == 0) | |
cb93b52c QW |
1517 | return 0; |
1518 | if (WARN_ON(trans == NULL)) | |
1519 | return -EINVAL; | |
1520 | record = kmalloc(sizeof(*record), gfp_flag); | |
1521 | if (!record) | |
1522 | return -ENOMEM; | |
1523 | ||
1524 | delayed_refs = &trans->transaction->delayed_refs; | |
1525 | record->bytenr = bytenr; | |
1526 | record->num_bytes = num_bytes; | |
1527 | record->old_roots = NULL; | |
1528 | ||
1529 | spin_lock(&delayed_refs->lock); | |
2ff7e61e | 1530 | ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record); |
cb93b52c QW |
1531 | spin_unlock(&delayed_refs->lock); |
1532 | if (ret > 0) | |
1533 | kfree(record); | |
1534 | return 0; | |
3368d001 QW |
1535 | } |
1536 | ||
33d1f05c | 1537 | int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans, |
2ff7e61e | 1538 | struct btrfs_fs_info *fs_info, |
33d1f05c QW |
1539 | struct extent_buffer *eb) |
1540 | { | |
1541 | int nr = btrfs_header_nritems(eb); | |
1542 | int i, extent_type, ret; | |
1543 | struct btrfs_key key; | |
1544 | struct btrfs_file_extent_item *fi; | |
1545 | u64 bytenr, num_bytes; | |
1546 | ||
1547 | /* We can be called directly from walk_up_proc() */ | |
0b246afa | 1548 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
33d1f05c QW |
1549 | return 0; |
1550 | ||
1551 | for (i = 0; i < nr; i++) { | |
1552 | btrfs_item_key_to_cpu(eb, &key, i); | |
1553 | ||
1554 | if (key.type != BTRFS_EXTENT_DATA_KEY) | |
1555 | continue; | |
1556 | ||
1557 | fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item); | |
1558 | /* filter out non qgroup-accountable extents */ | |
1559 | extent_type = btrfs_file_extent_type(eb, fi); | |
1560 | ||
1561 | if (extent_type == BTRFS_FILE_EXTENT_INLINE) | |
1562 | continue; | |
1563 | ||
1564 | bytenr = btrfs_file_extent_disk_bytenr(eb, fi); | |
1565 | if (!bytenr) | |
1566 | continue; | |
1567 | ||
1568 | num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi); | |
1569 | ||
0b246afa JM |
1570 | ret = btrfs_qgroup_trace_extent(trans, fs_info, bytenr, |
1571 | num_bytes, GFP_NOFS); | |
33d1f05c QW |
1572 | if (ret) |
1573 | return ret; | |
1574 | } | |
1575 | return 0; | |
1576 | } | |
1577 | ||
1578 | /* | |
1579 | * Walk up the tree from the bottom, freeing leaves and any interior | |
1580 | * nodes which have had all slots visited. If a node (leaf or | |
1581 | * interior) is freed, the node above it will have it's slot | |
1582 | * incremented. The root node will never be freed. | |
1583 | * | |
1584 | * At the end of this function, we should have a path which has all | |
1585 | * slots incremented to the next position for a search. If we need to | |
1586 | * read a new node it will be NULL and the node above it will have the | |
1587 | * correct slot selected for a later read. | |
1588 | * | |
1589 | * If we increment the root nodes slot counter past the number of | |
1590 | * elements, 1 is returned to signal completion of the search. | |
1591 | */ | |
1592 | static int adjust_slots_upwards(struct btrfs_root *root, | |
1593 | struct btrfs_path *path, int root_level) | |
1594 | { | |
1595 | int level = 0; | |
1596 | int nr, slot; | |
1597 | struct extent_buffer *eb; | |
1598 | ||
1599 | if (root_level == 0) | |
1600 | return 1; | |
1601 | ||
1602 | while (level <= root_level) { | |
1603 | eb = path->nodes[level]; | |
1604 | nr = btrfs_header_nritems(eb); | |
1605 | path->slots[level]++; | |
1606 | slot = path->slots[level]; | |
1607 | if (slot >= nr || level == 0) { | |
1608 | /* | |
1609 | * Don't free the root - we will detect this | |
1610 | * condition after our loop and return a | |
1611 | * positive value for caller to stop walking the tree. | |
1612 | */ | |
1613 | if (level != root_level) { | |
1614 | btrfs_tree_unlock_rw(eb, path->locks[level]); | |
1615 | path->locks[level] = 0; | |
1616 | ||
1617 | free_extent_buffer(eb); | |
1618 | path->nodes[level] = NULL; | |
1619 | path->slots[level] = 0; | |
1620 | } | |
1621 | } else { | |
1622 | /* | |
1623 | * We have a valid slot to walk back down | |
1624 | * from. Stop here so caller can process these | |
1625 | * new nodes. | |
1626 | */ | |
1627 | break; | |
1628 | } | |
1629 | ||
1630 | level++; | |
1631 | } | |
1632 | ||
1633 | eb = path->nodes[root_level]; | |
1634 | if (path->slots[root_level] >= btrfs_header_nritems(eb)) | |
1635 | return 1; | |
1636 | ||
1637 | return 0; | |
1638 | } | |
1639 | ||
1640 | int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans, | |
1641 | struct btrfs_root *root, | |
1642 | struct extent_buffer *root_eb, | |
1643 | u64 root_gen, int root_level) | |
1644 | { | |
0b246afa | 1645 | struct btrfs_fs_info *fs_info = root->fs_info; |
33d1f05c QW |
1646 | int ret = 0; |
1647 | int level; | |
1648 | struct extent_buffer *eb = root_eb; | |
1649 | struct btrfs_path *path = NULL; | |
1650 | ||
1651 | BUG_ON(root_level < 0 || root_level > BTRFS_MAX_LEVEL); | |
1652 | BUG_ON(root_eb == NULL); | |
1653 | ||
0b246afa | 1654 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
33d1f05c QW |
1655 | return 0; |
1656 | ||
1657 | if (!extent_buffer_uptodate(root_eb)) { | |
1658 | ret = btrfs_read_buffer(root_eb, root_gen); | |
1659 | if (ret) | |
1660 | goto out; | |
1661 | } | |
1662 | ||
1663 | if (root_level == 0) { | |
2ff7e61e | 1664 | ret = btrfs_qgroup_trace_leaf_items(trans, fs_info, root_eb); |
33d1f05c QW |
1665 | goto out; |
1666 | } | |
1667 | ||
1668 | path = btrfs_alloc_path(); | |
1669 | if (!path) | |
1670 | return -ENOMEM; | |
1671 | ||
1672 | /* | |
1673 | * Walk down the tree. Missing extent blocks are filled in as | |
1674 | * we go. Metadata is accounted every time we read a new | |
1675 | * extent block. | |
1676 | * | |
1677 | * When we reach a leaf, we account for file extent items in it, | |
1678 | * walk back up the tree (adjusting slot pointers as we go) | |
1679 | * and restart the search process. | |
1680 | */ | |
1681 | extent_buffer_get(root_eb); /* For path */ | |
1682 | path->nodes[root_level] = root_eb; | |
1683 | path->slots[root_level] = 0; | |
1684 | path->locks[root_level] = 0; /* so release_path doesn't try to unlock */ | |
1685 | walk_down: | |
1686 | level = root_level; | |
1687 | while (level >= 0) { | |
1688 | if (path->nodes[level] == NULL) { | |
1689 | int parent_slot; | |
1690 | u64 child_gen; | |
1691 | u64 child_bytenr; | |
1692 | ||
1693 | /* | |
1694 | * We need to get child blockptr/gen from parent before | |
1695 | * we can read it. | |
1696 | */ | |
1697 | eb = path->nodes[level + 1]; | |
1698 | parent_slot = path->slots[level + 1]; | |
1699 | child_bytenr = btrfs_node_blockptr(eb, parent_slot); | |
1700 | child_gen = btrfs_node_ptr_generation(eb, parent_slot); | |
1701 | ||
2ff7e61e | 1702 | eb = read_tree_block(fs_info, child_bytenr, child_gen); |
33d1f05c QW |
1703 | if (IS_ERR(eb)) { |
1704 | ret = PTR_ERR(eb); | |
1705 | goto out; | |
1706 | } else if (!extent_buffer_uptodate(eb)) { | |
1707 | free_extent_buffer(eb); | |
1708 | ret = -EIO; | |
1709 | goto out; | |
1710 | } | |
1711 | ||
1712 | path->nodes[level] = eb; | |
1713 | path->slots[level] = 0; | |
1714 | ||
1715 | btrfs_tree_read_lock(eb); | |
1716 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
1717 | path->locks[level] = BTRFS_READ_LOCK_BLOCKING; | |
1718 | ||
0b246afa JM |
1719 | ret = btrfs_qgroup_trace_extent(trans, fs_info, |
1720 | child_bytenr, | |
1721 | fs_info->nodesize, | |
1722 | GFP_NOFS); | |
33d1f05c QW |
1723 | if (ret) |
1724 | goto out; | |
1725 | } | |
1726 | ||
1727 | if (level == 0) { | |
2ff7e61e JM |
1728 | ret = btrfs_qgroup_trace_leaf_items(trans,fs_info, |
1729 | path->nodes[level]); | |
33d1f05c QW |
1730 | if (ret) |
1731 | goto out; | |
1732 | ||
1733 | /* Nonzero return here means we completed our search */ | |
1734 | ret = adjust_slots_upwards(root, path, root_level); | |
1735 | if (ret) | |
1736 | break; | |
1737 | ||
1738 | /* Restart search with new slots */ | |
1739 | goto walk_down; | |
1740 | } | |
1741 | ||
1742 | level--; | |
1743 | } | |
1744 | ||
1745 | ret = 0; | |
1746 | out: | |
1747 | btrfs_free_path(path); | |
1748 | ||
1749 | return ret; | |
1750 | } | |
1751 | ||
d810ef2b QW |
1752 | #define UPDATE_NEW 0 |
1753 | #define UPDATE_OLD 1 | |
1754 | /* | |
1755 | * Walk all of the roots that points to the bytenr and adjust their refcnts. | |
1756 | */ | |
1757 | static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info, | |
1758 | struct ulist *roots, struct ulist *tmp, | |
1759 | struct ulist *qgroups, u64 seq, int update_old) | |
1760 | { | |
1761 | struct ulist_node *unode; | |
1762 | struct ulist_iterator uiter; | |
1763 | struct ulist_node *tmp_unode; | |
1764 | struct ulist_iterator tmp_uiter; | |
1765 | struct btrfs_qgroup *qg; | |
1766 | int ret = 0; | |
1767 | ||
1768 | if (!roots) | |
1769 | return 0; | |
1770 | ULIST_ITER_INIT(&uiter); | |
1771 | while ((unode = ulist_next(roots, &uiter))) { | |
1772 | qg = find_qgroup_rb(fs_info, unode->val); | |
1773 | if (!qg) | |
1774 | continue; | |
1775 | ||
1776 | ulist_reinit(tmp); | |
ef2fff64 | 1777 | ret = ulist_add(qgroups, qg->qgroupid, qgroup_to_aux(qg), |
d810ef2b QW |
1778 | GFP_ATOMIC); |
1779 | if (ret < 0) | |
1780 | return ret; | |
ef2fff64 | 1781 | ret = ulist_add(tmp, qg->qgroupid, qgroup_to_aux(qg), GFP_ATOMIC); |
d810ef2b QW |
1782 | if (ret < 0) |
1783 | return ret; | |
1784 | ULIST_ITER_INIT(&tmp_uiter); | |
1785 | while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { | |
1786 | struct btrfs_qgroup_list *glist; | |
1787 | ||
ef2fff64 | 1788 | qg = unode_aux_to_qgroup(tmp_unode); |
d810ef2b QW |
1789 | if (update_old) |
1790 | btrfs_qgroup_update_old_refcnt(qg, seq, 1); | |
1791 | else | |
1792 | btrfs_qgroup_update_new_refcnt(qg, seq, 1); | |
1793 | list_for_each_entry(glist, &qg->groups, next_group) { | |
1794 | ret = ulist_add(qgroups, glist->group->qgroupid, | |
ef2fff64 | 1795 | qgroup_to_aux(glist->group), |
d810ef2b QW |
1796 | GFP_ATOMIC); |
1797 | if (ret < 0) | |
1798 | return ret; | |
1799 | ret = ulist_add(tmp, glist->group->qgroupid, | |
ef2fff64 | 1800 | qgroup_to_aux(glist->group), |
d810ef2b QW |
1801 | GFP_ATOMIC); |
1802 | if (ret < 0) | |
1803 | return ret; | |
1804 | } | |
1805 | } | |
1806 | } | |
1807 | return 0; | |
1808 | } | |
1809 | ||
823ae5b8 QW |
1810 | /* |
1811 | * Update qgroup rfer/excl counters. | |
1812 | * Rfer update is easy, codes can explain themselves. | |
e69bcee3 | 1813 | * |
823ae5b8 QW |
1814 | * Excl update is tricky, the update is split into 2 part. |
1815 | * Part 1: Possible exclusive <-> sharing detect: | |
1816 | * | A | !A | | |
1817 | * ------------------------------------- | |
1818 | * B | * | - | | |
1819 | * ------------------------------------- | |
1820 | * !B | + | ** | | |
1821 | * ------------------------------------- | |
1822 | * | |
1823 | * Conditions: | |
1824 | * A: cur_old_roots < nr_old_roots (not exclusive before) | |
1825 | * !A: cur_old_roots == nr_old_roots (possible exclusive before) | |
1826 | * B: cur_new_roots < nr_new_roots (not exclusive now) | |
01327610 | 1827 | * !B: cur_new_roots == nr_new_roots (possible exclusive now) |
823ae5b8 QW |
1828 | * |
1829 | * Results: | |
1830 | * +: Possible sharing -> exclusive -: Possible exclusive -> sharing | |
1831 | * *: Definitely not changed. **: Possible unchanged. | |
1832 | * | |
1833 | * For !A and !B condition, the exception is cur_old/new_roots == 0 case. | |
1834 | * | |
1835 | * To make the logic clear, we first use condition A and B to split | |
1836 | * combination into 4 results. | |
1837 | * | |
1838 | * Then, for result "+" and "-", check old/new_roots == 0 case, as in them | |
1839 | * only on variant maybe 0. | |
1840 | * | |
1841 | * Lastly, check result **, since there are 2 variants maybe 0, split them | |
1842 | * again(2x2). | |
1843 | * But this time we don't need to consider other things, the codes and logic | |
1844 | * is easy to understand now. | |
1845 | */ | |
1846 | static int qgroup_update_counters(struct btrfs_fs_info *fs_info, | |
1847 | struct ulist *qgroups, | |
1848 | u64 nr_old_roots, | |
1849 | u64 nr_new_roots, | |
1850 | u64 num_bytes, u64 seq) | |
1851 | { | |
1852 | struct ulist_node *unode; | |
1853 | struct ulist_iterator uiter; | |
1854 | struct btrfs_qgroup *qg; | |
1855 | u64 cur_new_count, cur_old_count; | |
1856 | ||
1857 | ULIST_ITER_INIT(&uiter); | |
1858 | while ((unode = ulist_next(qgroups, &uiter))) { | |
1859 | bool dirty = false; | |
1860 | ||
ef2fff64 | 1861 | qg = unode_aux_to_qgroup(unode); |
823ae5b8 QW |
1862 | cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq); |
1863 | cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq); | |
1864 | ||
bc074524 JM |
1865 | trace_qgroup_update_counters(fs_info, qg->qgroupid, |
1866 | cur_old_count, cur_new_count); | |
0f5dcf8d | 1867 | |
823ae5b8 QW |
1868 | /* Rfer update part */ |
1869 | if (cur_old_count == 0 && cur_new_count > 0) { | |
1870 | qg->rfer += num_bytes; | |
1871 | qg->rfer_cmpr += num_bytes; | |
1872 | dirty = true; | |
1873 | } | |
1874 | if (cur_old_count > 0 && cur_new_count == 0) { | |
1875 | qg->rfer -= num_bytes; | |
1876 | qg->rfer_cmpr -= num_bytes; | |
1877 | dirty = true; | |
1878 | } | |
1879 | ||
1880 | /* Excl update part */ | |
1881 | /* Exclusive/none -> shared case */ | |
1882 | if (cur_old_count == nr_old_roots && | |
1883 | cur_new_count < nr_new_roots) { | |
1884 | /* Exclusive -> shared */ | |
1885 | if (cur_old_count != 0) { | |
1886 | qg->excl -= num_bytes; | |
1887 | qg->excl_cmpr -= num_bytes; | |
1888 | dirty = true; | |
1889 | } | |
1890 | } | |
1891 | ||
1892 | /* Shared -> exclusive/none case */ | |
1893 | if (cur_old_count < nr_old_roots && | |
1894 | cur_new_count == nr_new_roots) { | |
1895 | /* Shared->exclusive */ | |
1896 | if (cur_new_count != 0) { | |
1897 | qg->excl += num_bytes; | |
1898 | qg->excl_cmpr += num_bytes; | |
1899 | dirty = true; | |
1900 | } | |
1901 | } | |
1902 | ||
1903 | /* Exclusive/none -> exclusive/none case */ | |
1904 | if (cur_old_count == nr_old_roots && | |
1905 | cur_new_count == nr_new_roots) { | |
1906 | if (cur_old_count == 0) { | |
1907 | /* None -> exclusive/none */ | |
1908 | ||
1909 | if (cur_new_count != 0) { | |
1910 | /* None -> exclusive */ | |
1911 | qg->excl += num_bytes; | |
1912 | qg->excl_cmpr += num_bytes; | |
1913 | dirty = true; | |
1914 | } | |
1915 | /* None -> none, nothing changed */ | |
1916 | } else { | |
1917 | /* Exclusive -> exclusive/none */ | |
1918 | ||
1919 | if (cur_new_count == 0) { | |
1920 | /* Exclusive -> none */ | |
1921 | qg->excl -= num_bytes; | |
1922 | qg->excl_cmpr -= num_bytes; | |
1923 | dirty = true; | |
1924 | } | |
1925 | /* Exclusive -> exclusive, nothing changed */ | |
1926 | } | |
1927 | } | |
c05f9429 | 1928 | |
823ae5b8 QW |
1929 | if (dirty) |
1930 | qgroup_dirty(fs_info, qg); | |
1931 | } | |
1932 | return 0; | |
1933 | } | |
1934 | ||
442244c9 | 1935 | int |
550d7a2e QW |
1936 | btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, |
1937 | struct btrfs_fs_info *fs_info, | |
1938 | u64 bytenr, u64 num_bytes, | |
1939 | struct ulist *old_roots, struct ulist *new_roots) | |
1940 | { | |
1941 | struct ulist *qgroups = NULL; | |
1942 | struct ulist *tmp = NULL; | |
1943 | u64 seq; | |
1944 | u64 nr_new_roots = 0; | |
1945 | u64 nr_old_roots = 0; | |
1946 | int ret = 0; | |
1947 | ||
1948 | if (new_roots) | |
1949 | nr_new_roots = new_roots->nnodes; | |
1950 | if (old_roots) | |
1951 | nr_old_roots = old_roots->nnodes; | |
1952 | ||
afcdd129 | 1953 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
550d7a2e QW |
1954 | goto out_free; |
1955 | BUG_ON(!fs_info->quota_root); | |
1956 | ||
bc074524 JM |
1957 | trace_btrfs_qgroup_account_extent(fs_info, bytenr, num_bytes, |
1958 | nr_old_roots, nr_new_roots); | |
0f5dcf8d | 1959 | |
550d7a2e QW |
1960 | qgroups = ulist_alloc(GFP_NOFS); |
1961 | if (!qgroups) { | |
1962 | ret = -ENOMEM; | |
1963 | goto out_free; | |
1964 | } | |
1965 | tmp = ulist_alloc(GFP_NOFS); | |
1966 | if (!tmp) { | |
1967 | ret = -ENOMEM; | |
1968 | goto out_free; | |
1969 | } | |
1970 | ||
1971 | mutex_lock(&fs_info->qgroup_rescan_lock); | |
1972 | if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) { | |
1973 | if (fs_info->qgroup_rescan_progress.objectid <= bytenr) { | |
1974 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
1975 | ret = 0; | |
1976 | goto out_free; | |
1977 | } | |
1978 | } | |
1979 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
1980 | ||
1981 | spin_lock(&fs_info->qgroup_lock); | |
1982 | seq = fs_info->qgroup_seq; | |
1983 | ||
1984 | /* Update old refcnts using old_roots */ | |
1985 | ret = qgroup_update_refcnt(fs_info, old_roots, tmp, qgroups, seq, | |
1986 | UPDATE_OLD); | |
1987 | if (ret < 0) | |
1988 | goto out; | |
1989 | ||
1990 | /* Update new refcnts using new_roots */ | |
1991 | ret = qgroup_update_refcnt(fs_info, new_roots, tmp, qgroups, seq, | |
1992 | UPDATE_NEW); | |
1993 | if (ret < 0) | |
1994 | goto out; | |
1995 | ||
1996 | qgroup_update_counters(fs_info, qgroups, nr_old_roots, nr_new_roots, | |
1997 | num_bytes, seq); | |
1998 | ||
1999 | /* | |
2000 | * Bump qgroup_seq to avoid seq overlap | |
2001 | */ | |
2002 | fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1; | |
2003 | out: | |
2004 | spin_unlock(&fs_info->qgroup_lock); | |
2005 | out_free: | |
2006 | ulist_free(tmp); | |
2007 | ulist_free(qgroups); | |
2008 | ulist_free(old_roots); | |
2009 | ulist_free(new_roots); | |
2010 | return ret; | |
2011 | } | |
2012 | ||
2013 | int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans, | |
2014 | struct btrfs_fs_info *fs_info) | |
2015 | { | |
2016 | struct btrfs_qgroup_extent_record *record; | |
2017 | struct btrfs_delayed_ref_root *delayed_refs; | |
2018 | struct ulist *new_roots = NULL; | |
2019 | struct rb_node *node; | |
9086db86 | 2020 | u64 qgroup_to_skip; |
550d7a2e QW |
2021 | int ret = 0; |
2022 | ||
2023 | delayed_refs = &trans->transaction->delayed_refs; | |
9086db86 | 2024 | qgroup_to_skip = delayed_refs->qgroup_to_skip; |
550d7a2e QW |
2025 | while ((node = rb_first(&delayed_refs->dirty_extent_root))) { |
2026 | record = rb_entry(node, struct btrfs_qgroup_extent_record, | |
2027 | node); | |
2028 | ||
bc074524 | 2029 | trace_btrfs_qgroup_account_extents(fs_info, record); |
0f5dcf8d | 2030 | |
550d7a2e QW |
2031 | if (!ret) { |
2032 | /* | |
2033 | * Use (u64)-1 as time_seq to do special search, which | |
2034 | * doesn't lock tree or delayed_refs and search current | |
2035 | * root. It's safe inside commit_transaction(). | |
2036 | */ | |
2037 | ret = btrfs_find_all_roots(trans, fs_info, | |
2038 | record->bytenr, (u64)-1, &new_roots); | |
2039 | if (ret < 0) | |
2040 | goto cleanup; | |
9086db86 QW |
2041 | if (qgroup_to_skip) |
2042 | ulist_del(new_roots, qgroup_to_skip, 0); | |
550d7a2e QW |
2043 | ret = btrfs_qgroup_account_extent(trans, fs_info, |
2044 | record->bytenr, record->num_bytes, | |
2045 | record->old_roots, new_roots); | |
2046 | record->old_roots = NULL; | |
2047 | new_roots = NULL; | |
2048 | } | |
2049 | cleanup: | |
2050 | ulist_free(record->old_roots); | |
2051 | ulist_free(new_roots); | |
2052 | new_roots = NULL; | |
2053 | rb_erase(node, &delayed_refs->dirty_extent_root); | |
2054 | kfree(record); | |
2055 | ||
2056 | } | |
2057 | return ret; | |
2058 | } | |
2059 | ||
bed92eae AJ |
2060 | /* |
2061 | * called from commit_transaction. Writes all changed qgroups to disk. | |
2062 | */ | |
2063 | int btrfs_run_qgroups(struct btrfs_trans_handle *trans, | |
2064 | struct btrfs_fs_info *fs_info) | |
2065 | { | |
2066 | struct btrfs_root *quota_root = fs_info->quota_root; | |
2067 | int ret = 0; | |
3d7b5a28 | 2068 | int start_rescan_worker = 0; |
bed92eae AJ |
2069 | |
2070 | if (!quota_root) | |
2071 | goto out; | |
2072 | ||
afcdd129 JB |
2073 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) && |
2074 | test_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags)) | |
3d7b5a28 JS |
2075 | start_rescan_worker = 1; |
2076 | ||
afcdd129 JB |
2077 | if (test_and_clear_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags)) |
2078 | set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); | |
2079 | if (test_and_clear_bit(BTRFS_FS_QUOTA_DISABLING, &fs_info->flags)) | |
2080 | clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); | |
bed92eae AJ |
2081 | |
2082 | spin_lock(&fs_info->qgroup_lock); | |
2083 | while (!list_empty(&fs_info->dirty_qgroups)) { | |
2084 | struct btrfs_qgroup *qgroup; | |
2085 | qgroup = list_first_entry(&fs_info->dirty_qgroups, | |
2086 | struct btrfs_qgroup, dirty); | |
2087 | list_del_init(&qgroup->dirty); | |
2088 | spin_unlock(&fs_info->qgroup_lock); | |
2089 | ret = update_qgroup_info_item(trans, quota_root, qgroup); | |
d3001ed3 DY |
2090 | if (ret) |
2091 | fs_info->qgroup_flags |= | |
2092 | BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
2093 | ret = update_qgroup_limit_item(trans, quota_root, qgroup); | |
bed92eae AJ |
2094 | if (ret) |
2095 | fs_info->qgroup_flags |= | |
2096 | BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
2097 | spin_lock(&fs_info->qgroup_lock); | |
2098 | } | |
afcdd129 | 2099 | if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
bed92eae AJ |
2100 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON; |
2101 | else | |
2102 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON; | |
2103 | spin_unlock(&fs_info->qgroup_lock); | |
2104 | ||
2105 | ret = update_qgroup_status_item(trans, fs_info, quota_root); | |
2106 | if (ret) | |
2107 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
2108 | ||
3d7b5a28 | 2109 | if (!ret && start_rescan_worker) { |
b382a324 JS |
2110 | ret = qgroup_rescan_init(fs_info, 0, 1); |
2111 | if (!ret) { | |
2112 | qgroup_rescan_zero_tracking(fs_info); | |
fc97fab0 QW |
2113 | btrfs_queue_work(fs_info->qgroup_rescan_workers, |
2114 | &fs_info->qgroup_rescan_work); | |
b382a324 | 2115 | } |
3d7b5a28 JS |
2116 | ret = 0; |
2117 | } | |
2118 | ||
bed92eae AJ |
2119 | out: |
2120 | ||
2121 | return ret; | |
2122 | } | |
2123 | ||
2124 | /* | |
01327610 | 2125 | * Copy the accounting information between qgroups. This is necessary |
918c2ee1 MF |
2126 | * when a snapshot or a subvolume is created. Throwing an error will |
2127 | * cause a transaction abort so we take extra care here to only error | |
2128 | * when a readonly fs is a reasonable outcome. | |
bed92eae AJ |
2129 | */ |
2130 | int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, | |
2131 | struct btrfs_fs_info *fs_info, u64 srcid, u64 objectid, | |
2132 | struct btrfs_qgroup_inherit *inherit) | |
2133 | { | |
2134 | int ret = 0; | |
2135 | int i; | |
2136 | u64 *i_qgroups; | |
2137 | struct btrfs_root *quota_root = fs_info->quota_root; | |
2138 | struct btrfs_qgroup *srcgroup; | |
2139 | struct btrfs_qgroup *dstgroup; | |
2140 | u32 level_size = 0; | |
3f5e2d3b | 2141 | u64 nums; |
bed92eae | 2142 | |
f2f6ed3d | 2143 | mutex_lock(&fs_info->qgroup_ioctl_lock); |
afcdd129 | 2144 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
f2f6ed3d | 2145 | goto out; |
bed92eae | 2146 | |
f2f6ed3d WS |
2147 | if (!quota_root) { |
2148 | ret = -EINVAL; | |
2149 | goto out; | |
2150 | } | |
bed92eae | 2151 | |
3f5e2d3b WS |
2152 | if (inherit) { |
2153 | i_qgroups = (u64 *)(inherit + 1); | |
2154 | nums = inherit->num_qgroups + 2 * inherit->num_ref_copies + | |
2155 | 2 * inherit->num_excl_copies; | |
2156 | for (i = 0; i < nums; ++i) { | |
2157 | srcgroup = find_qgroup_rb(fs_info, *i_qgroups); | |
09870d27 | 2158 | |
918c2ee1 MF |
2159 | /* |
2160 | * Zero out invalid groups so we can ignore | |
2161 | * them later. | |
2162 | */ | |
2163 | if (!srcgroup || | |
2164 | ((srcgroup->qgroupid >> 48) <= (objectid >> 48))) | |
2165 | *i_qgroups = 0ULL; | |
2166 | ||
3f5e2d3b WS |
2167 | ++i_qgroups; |
2168 | } | |
2169 | } | |
2170 | ||
bed92eae AJ |
2171 | /* |
2172 | * create a tracking group for the subvol itself | |
2173 | */ | |
2174 | ret = add_qgroup_item(trans, quota_root, objectid); | |
2175 | if (ret) | |
2176 | goto out; | |
2177 | ||
bed92eae AJ |
2178 | if (srcid) { |
2179 | struct btrfs_root *srcroot; | |
2180 | struct btrfs_key srckey; | |
bed92eae AJ |
2181 | |
2182 | srckey.objectid = srcid; | |
2183 | srckey.type = BTRFS_ROOT_ITEM_KEY; | |
2184 | srckey.offset = (u64)-1; | |
2185 | srcroot = btrfs_read_fs_root_no_name(fs_info, &srckey); | |
2186 | if (IS_ERR(srcroot)) { | |
2187 | ret = PTR_ERR(srcroot); | |
2188 | goto out; | |
2189 | } | |
2190 | ||
2191 | rcu_read_lock(); | |
0b246afa | 2192 | level_size = fs_info->nodesize; |
bed92eae AJ |
2193 | rcu_read_unlock(); |
2194 | } | |
2195 | ||
2196 | /* | |
2197 | * add qgroup to all inherited groups | |
2198 | */ | |
2199 | if (inherit) { | |
2200 | i_qgroups = (u64 *)(inherit + 1); | |
918c2ee1 MF |
2201 | for (i = 0; i < inherit->num_qgroups; ++i, ++i_qgroups) { |
2202 | if (*i_qgroups == 0) | |
2203 | continue; | |
bed92eae AJ |
2204 | ret = add_qgroup_relation_item(trans, quota_root, |
2205 | objectid, *i_qgroups); | |
918c2ee1 | 2206 | if (ret && ret != -EEXIST) |
bed92eae AJ |
2207 | goto out; |
2208 | ret = add_qgroup_relation_item(trans, quota_root, | |
2209 | *i_qgroups, objectid); | |
918c2ee1 | 2210 | if (ret && ret != -EEXIST) |
bed92eae | 2211 | goto out; |
bed92eae | 2212 | } |
918c2ee1 | 2213 | ret = 0; |
bed92eae AJ |
2214 | } |
2215 | ||
2216 | ||
2217 | spin_lock(&fs_info->qgroup_lock); | |
2218 | ||
2219 | dstgroup = add_qgroup_rb(fs_info, objectid); | |
57a5a882 DC |
2220 | if (IS_ERR(dstgroup)) { |
2221 | ret = PTR_ERR(dstgroup); | |
bed92eae | 2222 | goto unlock; |
57a5a882 | 2223 | } |
bed92eae | 2224 | |
e8c8541a | 2225 | if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) { |
e8c8541a DY |
2226 | dstgroup->lim_flags = inherit->lim.flags; |
2227 | dstgroup->max_rfer = inherit->lim.max_rfer; | |
2228 | dstgroup->max_excl = inherit->lim.max_excl; | |
2229 | dstgroup->rsv_rfer = inherit->lim.rsv_rfer; | |
2230 | dstgroup->rsv_excl = inherit->lim.rsv_excl; | |
1510e71c DY |
2231 | |
2232 | ret = update_qgroup_limit_item(trans, quota_root, dstgroup); | |
2233 | if (ret) { | |
2234 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
5d163e0e JM |
2235 | btrfs_info(fs_info, |
2236 | "unable to update quota limit for %llu", | |
2237 | dstgroup->qgroupid); | |
1510e71c DY |
2238 | goto unlock; |
2239 | } | |
e8c8541a DY |
2240 | } |
2241 | ||
bed92eae AJ |
2242 | if (srcid) { |
2243 | srcgroup = find_qgroup_rb(fs_info, srcid); | |
f3a87f1b | 2244 | if (!srcgroup) |
bed92eae | 2245 | goto unlock; |
fcebe456 JB |
2246 | |
2247 | /* | |
2248 | * We call inherit after we clone the root in order to make sure | |
2249 | * our counts don't go crazy, so at this point the only | |
2250 | * difference between the two roots should be the root node. | |
2251 | */ | |
2252 | dstgroup->rfer = srcgroup->rfer; | |
2253 | dstgroup->rfer_cmpr = srcgroup->rfer_cmpr; | |
2254 | dstgroup->excl = level_size; | |
2255 | dstgroup->excl_cmpr = level_size; | |
bed92eae AJ |
2256 | srcgroup->excl = level_size; |
2257 | srcgroup->excl_cmpr = level_size; | |
3eeb4d59 DY |
2258 | |
2259 | /* inherit the limit info */ | |
2260 | dstgroup->lim_flags = srcgroup->lim_flags; | |
2261 | dstgroup->max_rfer = srcgroup->max_rfer; | |
2262 | dstgroup->max_excl = srcgroup->max_excl; | |
2263 | dstgroup->rsv_rfer = srcgroup->rsv_rfer; | |
2264 | dstgroup->rsv_excl = srcgroup->rsv_excl; | |
2265 | ||
bed92eae AJ |
2266 | qgroup_dirty(fs_info, dstgroup); |
2267 | qgroup_dirty(fs_info, srcgroup); | |
2268 | } | |
2269 | ||
f3a87f1b | 2270 | if (!inherit) |
bed92eae AJ |
2271 | goto unlock; |
2272 | ||
2273 | i_qgroups = (u64 *)(inherit + 1); | |
2274 | for (i = 0; i < inherit->num_qgroups; ++i) { | |
918c2ee1 | 2275 | if (*i_qgroups) { |
0b246afa | 2276 | ret = add_relation_rb(fs_info, objectid, *i_qgroups); |
918c2ee1 MF |
2277 | if (ret) |
2278 | goto unlock; | |
2279 | } | |
bed92eae AJ |
2280 | ++i_qgroups; |
2281 | } | |
2282 | ||
918c2ee1 | 2283 | for (i = 0; i < inherit->num_ref_copies; ++i, i_qgroups += 2) { |
bed92eae AJ |
2284 | struct btrfs_qgroup *src; |
2285 | struct btrfs_qgroup *dst; | |
2286 | ||
918c2ee1 MF |
2287 | if (!i_qgroups[0] || !i_qgroups[1]) |
2288 | continue; | |
2289 | ||
bed92eae AJ |
2290 | src = find_qgroup_rb(fs_info, i_qgroups[0]); |
2291 | dst = find_qgroup_rb(fs_info, i_qgroups[1]); | |
2292 | ||
2293 | if (!src || !dst) { | |
2294 | ret = -EINVAL; | |
2295 | goto unlock; | |
2296 | } | |
2297 | ||
2298 | dst->rfer = src->rfer - level_size; | |
2299 | dst->rfer_cmpr = src->rfer_cmpr - level_size; | |
bed92eae | 2300 | } |
918c2ee1 | 2301 | for (i = 0; i < inherit->num_excl_copies; ++i, i_qgroups += 2) { |
bed92eae AJ |
2302 | struct btrfs_qgroup *src; |
2303 | struct btrfs_qgroup *dst; | |
2304 | ||
918c2ee1 MF |
2305 | if (!i_qgroups[0] || !i_qgroups[1]) |
2306 | continue; | |
2307 | ||
bed92eae AJ |
2308 | src = find_qgroup_rb(fs_info, i_qgroups[0]); |
2309 | dst = find_qgroup_rb(fs_info, i_qgroups[1]); | |
2310 | ||
2311 | if (!src || !dst) { | |
2312 | ret = -EINVAL; | |
2313 | goto unlock; | |
2314 | } | |
2315 | ||
2316 | dst->excl = src->excl + level_size; | |
2317 | dst->excl_cmpr = src->excl_cmpr + level_size; | |
bed92eae AJ |
2318 | } |
2319 | ||
2320 | unlock: | |
2321 | spin_unlock(&fs_info->qgroup_lock); | |
2322 | out: | |
f2f6ed3d | 2323 | mutex_unlock(&fs_info->qgroup_ioctl_lock); |
bed92eae AJ |
2324 | return ret; |
2325 | } | |
2326 | ||
003d7c59 JM |
2327 | static bool qgroup_check_limits(const struct btrfs_qgroup *qg, u64 num_bytes) |
2328 | { | |
2329 | if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) && | |
2330 | qg->reserved + (s64)qg->rfer + num_bytes > qg->max_rfer) | |
2331 | return false; | |
2332 | ||
2333 | if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) && | |
2334 | qg->reserved + (s64)qg->excl + num_bytes > qg->max_excl) | |
2335 | return false; | |
2336 | ||
2337 | return true; | |
2338 | } | |
2339 | ||
2340 | static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce) | |
bed92eae AJ |
2341 | { |
2342 | struct btrfs_root *quota_root; | |
2343 | struct btrfs_qgroup *qgroup; | |
2344 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2345 | u64 ref_root = root->root_key.objectid; | |
2346 | int ret = 0; | |
bed92eae AJ |
2347 | struct ulist_node *unode; |
2348 | struct ulist_iterator uiter; | |
2349 | ||
2350 | if (!is_fstree(ref_root)) | |
2351 | return 0; | |
2352 | ||
2353 | if (num_bytes == 0) | |
2354 | return 0; | |
2355 | ||
2356 | spin_lock(&fs_info->qgroup_lock); | |
2357 | quota_root = fs_info->quota_root; | |
2358 | if (!quota_root) | |
2359 | goto out; | |
2360 | ||
2361 | qgroup = find_qgroup_rb(fs_info, ref_root); | |
2362 | if (!qgroup) | |
2363 | goto out; | |
2364 | ||
2365 | /* | |
2366 | * in a first step, we check all affected qgroups if any limits would | |
2367 | * be exceeded | |
2368 | */ | |
1e8f9158 WS |
2369 | ulist_reinit(fs_info->qgroup_ulist); |
2370 | ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid, | |
3c97185c WS |
2371 | (uintptr_t)qgroup, GFP_ATOMIC); |
2372 | if (ret < 0) | |
2373 | goto out; | |
bed92eae | 2374 | ULIST_ITER_INIT(&uiter); |
1e8f9158 | 2375 | while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { |
bed92eae AJ |
2376 | struct btrfs_qgroup *qg; |
2377 | struct btrfs_qgroup_list *glist; | |
2378 | ||
ef2fff64 | 2379 | qg = unode_aux_to_qgroup(unode); |
bed92eae | 2380 | |
003d7c59 | 2381 | if (enforce && !qgroup_check_limits(qg, num_bytes)) { |
bed92eae | 2382 | ret = -EDQUOT; |
720f1e20 WS |
2383 | goto out; |
2384 | } | |
bed92eae AJ |
2385 | |
2386 | list_for_each_entry(glist, &qg->groups, next_group) { | |
1e8f9158 WS |
2387 | ret = ulist_add(fs_info->qgroup_ulist, |
2388 | glist->group->qgroupid, | |
3c97185c WS |
2389 | (uintptr_t)glist->group, GFP_ATOMIC); |
2390 | if (ret < 0) | |
2391 | goto out; | |
bed92eae AJ |
2392 | } |
2393 | } | |
3c97185c | 2394 | ret = 0; |
bed92eae AJ |
2395 | /* |
2396 | * no limits exceeded, now record the reservation into all qgroups | |
2397 | */ | |
2398 | ULIST_ITER_INIT(&uiter); | |
1e8f9158 | 2399 | while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { |
bed92eae AJ |
2400 | struct btrfs_qgroup *qg; |
2401 | ||
ef2fff64 | 2402 | qg = unode_aux_to_qgroup(unode); |
bed92eae | 2403 | |
e2d1f923 | 2404 | qg->reserved += num_bytes; |
bed92eae AJ |
2405 | } |
2406 | ||
2407 | out: | |
2408 | spin_unlock(&fs_info->qgroup_lock); | |
bed92eae AJ |
2409 | return ret; |
2410 | } | |
2411 | ||
297d750b QW |
2412 | void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info, |
2413 | u64 ref_root, u64 num_bytes) | |
bed92eae AJ |
2414 | { |
2415 | struct btrfs_root *quota_root; | |
2416 | struct btrfs_qgroup *qgroup; | |
bed92eae AJ |
2417 | struct ulist_node *unode; |
2418 | struct ulist_iterator uiter; | |
3c97185c | 2419 | int ret = 0; |
bed92eae AJ |
2420 | |
2421 | if (!is_fstree(ref_root)) | |
2422 | return; | |
2423 | ||
2424 | if (num_bytes == 0) | |
2425 | return; | |
2426 | ||
2427 | spin_lock(&fs_info->qgroup_lock); | |
2428 | ||
2429 | quota_root = fs_info->quota_root; | |
2430 | if (!quota_root) | |
2431 | goto out; | |
2432 | ||
2433 | qgroup = find_qgroup_rb(fs_info, ref_root); | |
2434 | if (!qgroup) | |
2435 | goto out; | |
2436 | ||
1e8f9158 WS |
2437 | ulist_reinit(fs_info->qgroup_ulist); |
2438 | ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid, | |
3c97185c WS |
2439 | (uintptr_t)qgroup, GFP_ATOMIC); |
2440 | if (ret < 0) | |
2441 | goto out; | |
bed92eae | 2442 | ULIST_ITER_INIT(&uiter); |
1e8f9158 | 2443 | while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { |
bed92eae AJ |
2444 | struct btrfs_qgroup *qg; |
2445 | struct btrfs_qgroup_list *glist; | |
2446 | ||
ef2fff64 | 2447 | qg = unode_aux_to_qgroup(unode); |
bed92eae | 2448 | |
18dc22c1 QW |
2449 | if (WARN_ON(qg->reserved < num_bytes)) |
2450 | report_reserved_underflow(fs_info, qg, num_bytes); | |
2451 | else | |
2452 | qg->reserved -= num_bytes; | |
bed92eae AJ |
2453 | |
2454 | list_for_each_entry(glist, &qg->groups, next_group) { | |
1e8f9158 WS |
2455 | ret = ulist_add(fs_info->qgroup_ulist, |
2456 | glist->group->qgroupid, | |
3c97185c WS |
2457 | (uintptr_t)glist->group, GFP_ATOMIC); |
2458 | if (ret < 0) | |
2459 | goto out; | |
bed92eae AJ |
2460 | } |
2461 | } | |
2462 | ||
2463 | out: | |
2464 | spin_unlock(&fs_info->qgroup_lock); | |
bed92eae AJ |
2465 | } |
2466 | ||
7cf5b976 QW |
2467 | static inline void qgroup_free(struct btrfs_root *root, u64 num_bytes) |
2468 | { | |
2469 | return btrfs_qgroup_free_refroot(root->fs_info, root->objectid, | |
2470 | num_bytes); | |
2471 | } | |
bed92eae AJ |
2472 | void assert_qgroups_uptodate(struct btrfs_trans_handle *trans) |
2473 | { | |
2474 | if (list_empty(&trans->qgroup_ref_list) && !trans->delayed_ref_elem.seq) | |
2475 | return; | |
64b63580 | 2476 | btrfs_err(trans->fs_info, |
5d163e0e | 2477 | "qgroups not uptodate in trans handle %p: list is%s empty, seq is %#x.%x", |
bed92eae | 2478 | trans, list_empty(&trans->qgroup_ref_list) ? "" : " not", |
fc36ed7e JS |
2479 | (u32)(trans->delayed_ref_elem.seq >> 32), |
2480 | (u32)trans->delayed_ref_elem.seq); | |
bed92eae AJ |
2481 | BUG(); |
2482 | } | |
2f232036 JS |
2483 | |
2484 | /* | |
2485 | * returns < 0 on error, 0 when more leafs are to be scanned. | |
3393168d | 2486 | * returns 1 when done. |
2f232036 JS |
2487 | */ |
2488 | static int | |
b382a324 | 2489 | qgroup_rescan_leaf(struct btrfs_fs_info *fs_info, struct btrfs_path *path, |
0a0e8b89 | 2490 | struct btrfs_trans_handle *trans) |
2f232036 JS |
2491 | { |
2492 | struct btrfs_key found; | |
0a0e8b89 | 2493 | struct extent_buffer *scratch_leaf = NULL; |
2f232036 | 2494 | struct ulist *roots = NULL; |
3284da7b | 2495 | struct seq_list tree_mod_seq_elem = SEQ_LIST_INIT(tree_mod_seq_elem); |
fcebe456 | 2496 | u64 num_bytes; |
2f232036 JS |
2497 | int slot; |
2498 | int ret; | |
2499 | ||
2f232036 JS |
2500 | mutex_lock(&fs_info->qgroup_rescan_lock); |
2501 | ret = btrfs_search_slot_for_read(fs_info->extent_root, | |
2502 | &fs_info->qgroup_rescan_progress, | |
2503 | path, 1, 0); | |
2504 | ||
ab8d0fc4 JM |
2505 | btrfs_debug(fs_info, |
2506 | "current progress key (%llu %u %llu), search_slot ret %d", | |
2507 | fs_info->qgroup_rescan_progress.objectid, | |
2508 | fs_info->qgroup_rescan_progress.type, | |
2509 | fs_info->qgroup_rescan_progress.offset, ret); | |
2f232036 JS |
2510 | |
2511 | if (ret) { | |
2512 | /* | |
2513 | * The rescan is about to end, we will not be scanning any | |
2514 | * further blocks. We cannot unset the RESCAN flag here, because | |
2515 | * we want to commit the transaction if everything went well. | |
2516 | * To make the live accounting work in this phase, we set our | |
2517 | * scan progress pointer such that every real extent objectid | |
2518 | * will be smaller. | |
2519 | */ | |
2520 | fs_info->qgroup_rescan_progress.objectid = (u64)-1; | |
2521 | btrfs_release_path(path); | |
2522 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2523 | return ret; | |
2524 | } | |
2525 | ||
2526 | btrfs_item_key_to_cpu(path->nodes[0], &found, | |
2527 | btrfs_header_nritems(path->nodes[0]) - 1); | |
2528 | fs_info->qgroup_rescan_progress.objectid = found.objectid + 1; | |
2529 | ||
2530 | btrfs_get_tree_mod_seq(fs_info, &tree_mod_seq_elem); | |
0a0e8b89 QW |
2531 | scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]); |
2532 | if (!scratch_leaf) { | |
2533 | ret = -ENOMEM; | |
2534 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2535 | goto out; | |
2536 | } | |
2537 | extent_buffer_get(scratch_leaf); | |
2538 | btrfs_tree_read_lock(scratch_leaf); | |
2539 | btrfs_set_lock_blocking_rw(scratch_leaf, BTRFS_READ_LOCK); | |
2f232036 JS |
2540 | slot = path->slots[0]; |
2541 | btrfs_release_path(path); | |
2542 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2543 | ||
2544 | for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) { | |
2545 | btrfs_item_key_to_cpu(scratch_leaf, &found, slot); | |
3a6d75e8 JB |
2546 | if (found.type != BTRFS_EXTENT_ITEM_KEY && |
2547 | found.type != BTRFS_METADATA_ITEM_KEY) | |
2f232036 | 2548 | continue; |
3a6d75e8 | 2549 | if (found.type == BTRFS_METADATA_ITEM_KEY) |
da17066c | 2550 | num_bytes = fs_info->nodesize; |
3a6d75e8 JB |
2551 | else |
2552 | num_bytes = found.offset; | |
2553 | ||
fcebe456 JB |
2554 | ret = btrfs_find_all_roots(NULL, fs_info, found.objectid, 0, |
2555 | &roots); | |
2f232036 JS |
2556 | if (ret < 0) |
2557 | goto out; | |
9d220c95 QW |
2558 | /* For rescan, just pass old_roots as NULL */ |
2559 | ret = btrfs_qgroup_account_extent(trans, fs_info, | |
2560 | found.objectid, num_bytes, NULL, roots); | |
2561 | if (ret < 0) | |
fcebe456 | 2562 | goto out; |
2f232036 | 2563 | } |
2f232036 | 2564 | out: |
0a0e8b89 QW |
2565 | if (scratch_leaf) { |
2566 | btrfs_tree_read_unlock_blocking(scratch_leaf); | |
2567 | free_extent_buffer(scratch_leaf); | |
2568 | } | |
2f232036 JS |
2569 | btrfs_put_tree_mod_seq(fs_info, &tree_mod_seq_elem); |
2570 | ||
2571 | return ret; | |
2572 | } | |
2573 | ||
d458b054 | 2574 | static void btrfs_qgroup_rescan_worker(struct btrfs_work *work) |
2f232036 | 2575 | { |
b382a324 JS |
2576 | struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info, |
2577 | qgroup_rescan_work); | |
2f232036 JS |
2578 | struct btrfs_path *path; |
2579 | struct btrfs_trans_handle *trans = NULL; | |
2f232036 | 2580 | int err = -ENOMEM; |
53b7cde9 | 2581 | int ret = 0; |
2f232036 JS |
2582 | |
2583 | path = btrfs_alloc_path(); | |
2584 | if (!path) | |
2585 | goto out; | |
2f232036 JS |
2586 | |
2587 | err = 0; | |
7343dd61 | 2588 | while (!err && !btrfs_fs_closing(fs_info)) { |
2f232036 JS |
2589 | trans = btrfs_start_transaction(fs_info->fs_root, 0); |
2590 | if (IS_ERR(trans)) { | |
2591 | err = PTR_ERR(trans); | |
2592 | break; | |
2593 | } | |
afcdd129 | 2594 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) { |
2f232036 JS |
2595 | err = -EINTR; |
2596 | } else { | |
0a0e8b89 | 2597 | err = qgroup_rescan_leaf(fs_info, path, trans); |
2f232036 JS |
2598 | } |
2599 | if (err > 0) | |
3a45bb20 | 2600 | btrfs_commit_transaction(trans); |
2f232036 | 2601 | else |
3a45bb20 | 2602 | btrfs_end_transaction(trans); |
2f232036 JS |
2603 | } |
2604 | ||
2605 | out: | |
2f232036 | 2606 | btrfs_free_path(path); |
2f232036 JS |
2607 | |
2608 | mutex_lock(&fs_info->qgroup_rescan_lock); | |
7343dd61 JM |
2609 | if (!btrfs_fs_closing(fs_info)) |
2610 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN; | |
2f232036 | 2611 | |
3393168d | 2612 | if (err > 0 && |
2f232036 JS |
2613 | fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) { |
2614 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
2615 | } else if (err < 0) { | |
2616 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT; | |
2617 | } | |
2618 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2619 | ||
53b7cde9 | 2620 | /* |
01327610 | 2621 | * only update status, since the previous part has already updated the |
53b7cde9 QW |
2622 | * qgroup info. |
2623 | */ | |
2624 | trans = btrfs_start_transaction(fs_info->quota_root, 1); | |
2625 | if (IS_ERR(trans)) { | |
2626 | err = PTR_ERR(trans); | |
2627 | btrfs_err(fs_info, | |
2628 | "fail to start transaction for status update: %d\n", | |
2629 | err); | |
2630 | goto done; | |
2631 | } | |
2632 | ret = update_qgroup_status_item(trans, fs_info, fs_info->quota_root); | |
2633 | if (ret < 0) { | |
2634 | err = ret; | |
ab8d0fc4 | 2635 | btrfs_err(fs_info, "fail to update qgroup status: %d", err); |
53b7cde9 | 2636 | } |
3a45bb20 | 2637 | btrfs_end_transaction(trans); |
53b7cde9 | 2638 | |
7343dd61 JM |
2639 | if (btrfs_fs_closing(fs_info)) { |
2640 | btrfs_info(fs_info, "qgroup scan paused"); | |
2641 | } else if (err >= 0) { | |
efe120a0 | 2642 | btrfs_info(fs_info, "qgroup scan completed%s", |
3393168d | 2643 | err > 0 ? " (inconsistency flag cleared)" : ""); |
2f232036 | 2644 | } else { |
efe120a0 | 2645 | btrfs_err(fs_info, "qgroup scan failed with %d", err); |
2f232036 | 2646 | } |
57254b6e | 2647 | |
53b7cde9 | 2648 | done: |
d2c609b8 JM |
2649 | mutex_lock(&fs_info->qgroup_rescan_lock); |
2650 | fs_info->qgroup_rescan_running = false; | |
2651 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
57254b6e | 2652 | complete_all(&fs_info->qgroup_rescan_completion); |
2f232036 JS |
2653 | } |
2654 | ||
b382a324 JS |
2655 | /* |
2656 | * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all | |
2657 | * memory required for the rescan context. | |
2658 | */ | |
2659 | static int | |
2660 | qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid, | |
2661 | int init_flags) | |
2f232036 JS |
2662 | { |
2663 | int ret = 0; | |
2f232036 | 2664 | |
b382a324 JS |
2665 | if (!init_flags && |
2666 | (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) || | |
2667 | !(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))) { | |
2668 | ret = -EINVAL; | |
2669 | goto err; | |
2670 | } | |
2f232036 JS |
2671 | |
2672 | mutex_lock(&fs_info->qgroup_rescan_lock); | |
2673 | spin_lock(&fs_info->qgroup_lock); | |
b382a324 JS |
2674 | |
2675 | if (init_flags) { | |
2676 | if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) | |
2677 | ret = -EINPROGRESS; | |
2678 | else if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON)) | |
2679 | ret = -EINVAL; | |
2680 | ||
2681 | if (ret) { | |
2682 | spin_unlock(&fs_info->qgroup_lock); | |
2683 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2684 | goto err; | |
2685 | } | |
b382a324 | 2686 | fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN; |
2f232036 JS |
2687 | } |
2688 | ||
2f232036 JS |
2689 | memset(&fs_info->qgroup_rescan_progress, 0, |
2690 | sizeof(fs_info->qgroup_rescan_progress)); | |
b382a324 | 2691 | fs_info->qgroup_rescan_progress.objectid = progress_objectid; |
190631f1 | 2692 | init_completion(&fs_info->qgroup_rescan_completion); |
8d9eddad | 2693 | fs_info->qgroup_rescan_running = true; |
b382a324 JS |
2694 | |
2695 | spin_unlock(&fs_info->qgroup_lock); | |
2696 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2697 | ||
b382a324 JS |
2698 | memset(&fs_info->qgroup_rescan_work, 0, |
2699 | sizeof(fs_info->qgroup_rescan_work)); | |
fc97fab0 | 2700 | btrfs_init_work(&fs_info->qgroup_rescan_work, |
9e0af237 | 2701 | btrfs_qgroup_rescan_helper, |
fc97fab0 | 2702 | btrfs_qgroup_rescan_worker, NULL, NULL); |
b382a324 JS |
2703 | |
2704 | if (ret) { | |
2705 | err: | |
efe120a0 | 2706 | btrfs_info(fs_info, "qgroup_rescan_init failed with %d", ret); |
b382a324 JS |
2707 | return ret; |
2708 | } | |
2709 | ||
2710 | return 0; | |
2711 | } | |
2712 | ||
2713 | static void | |
2714 | qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info) | |
2715 | { | |
2716 | struct rb_node *n; | |
2717 | struct btrfs_qgroup *qgroup; | |
2718 | ||
2719 | spin_lock(&fs_info->qgroup_lock); | |
2f232036 JS |
2720 | /* clear all current qgroup tracking information */ |
2721 | for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) { | |
2722 | qgroup = rb_entry(n, struct btrfs_qgroup, node); | |
2723 | qgroup->rfer = 0; | |
2724 | qgroup->rfer_cmpr = 0; | |
2725 | qgroup->excl = 0; | |
2726 | qgroup->excl_cmpr = 0; | |
2727 | } | |
2728 | spin_unlock(&fs_info->qgroup_lock); | |
b382a324 | 2729 | } |
2f232036 | 2730 | |
b382a324 JS |
2731 | int |
2732 | btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info) | |
2733 | { | |
2734 | int ret = 0; | |
2735 | struct btrfs_trans_handle *trans; | |
2736 | ||
2737 | ret = qgroup_rescan_init(fs_info, 0, 1); | |
2738 | if (ret) | |
2739 | return ret; | |
2740 | ||
2741 | /* | |
2742 | * We have set the rescan_progress to 0, which means no more | |
2743 | * delayed refs will be accounted by btrfs_qgroup_account_ref. | |
2744 | * However, btrfs_qgroup_account_ref may be right after its call | |
2745 | * to btrfs_find_all_roots, in which case it would still do the | |
2746 | * accounting. | |
2747 | * To solve this, we're committing the transaction, which will | |
2748 | * ensure we run all delayed refs and only after that, we are | |
2749 | * going to clear all tracking information for a clean start. | |
2750 | */ | |
2751 | ||
2752 | trans = btrfs_join_transaction(fs_info->fs_root); | |
2753 | if (IS_ERR(trans)) { | |
2754 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN; | |
2755 | return PTR_ERR(trans); | |
2756 | } | |
3a45bb20 | 2757 | ret = btrfs_commit_transaction(trans); |
b382a324 JS |
2758 | if (ret) { |
2759 | fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN; | |
2760 | return ret; | |
2761 | } | |
2762 | ||
2763 | qgroup_rescan_zero_tracking(fs_info); | |
2764 | ||
fc97fab0 QW |
2765 | btrfs_queue_work(fs_info->qgroup_rescan_workers, |
2766 | &fs_info->qgroup_rescan_work); | |
2f232036 JS |
2767 | |
2768 | return 0; | |
2769 | } | |
57254b6e | 2770 | |
d06f23d6 JM |
2771 | int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info, |
2772 | bool interruptible) | |
57254b6e JS |
2773 | { |
2774 | int running; | |
2775 | int ret = 0; | |
2776 | ||
2777 | mutex_lock(&fs_info->qgroup_rescan_lock); | |
2778 | spin_lock(&fs_info->qgroup_lock); | |
d2c609b8 | 2779 | running = fs_info->qgroup_rescan_running; |
57254b6e JS |
2780 | spin_unlock(&fs_info->qgroup_lock); |
2781 | mutex_unlock(&fs_info->qgroup_rescan_lock); | |
2782 | ||
d06f23d6 JM |
2783 | if (!running) |
2784 | return 0; | |
2785 | ||
2786 | if (interruptible) | |
57254b6e JS |
2787 | ret = wait_for_completion_interruptible( |
2788 | &fs_info->qgroup_rescan_completion); | |
d06f23d6 JM |
2789 | else |
2790 | wait_for_completion(&fs_info->qgroup_rescan_completion); | |
57254b6e JS |
2791 | |
2792 | return ret; | |
2793 | } | |
b382a324 JS |
2794 | |
2795 | /* | |
2796 | * this is only called from open_ctree where we're still single threaded, thus | |
2797 | * locking is omitted here. | |
2798 | */ | |
2799 | void | |
2800 | btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info) | |
2801 | { | |
2802 | if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) | |
fc97fab0 QW |
2803 | btrfs_queue_work(fs_info->qgroup_rescan_workers, |
2804 | &fs_info->qgroup_rescan_work); | |
b382a324 | 2805 | } |
52472553 QW |
2806 | |
2807 | /* | |
2808 | * Reserve qgroup space for range [start, start + len). | |
2809 | * | |
2810 | * This function will either reserve space from related qgroups or doing | |
2811 | * nothing if the range is already reserved. | |
2812 | * | |
2813 | * Return 0 for successful reserve | |
2814 | * Return <0 for error (including -EQUOT) | |
2815 | * | |
2816 | * NOTE: this function may sleep for memory allocation. | |
2817 | */ | |
2818 | int btrfs_qgroup_reserve_data(struct inode *inode, u64 start, u64 len) | |
2819 | { | |
2820 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
2821 | struct extent_changeset changeset; | |
2822 | struct ulist_node *unode; | |
2823 | struct ulist_iterator uiter; | |
2824 | int ret; | |
2825 | ||
afcdd129 JB |
2826 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &root->fs_info->flags) || |
2827 | !is_fstree(root->objectid) || len == 0) | |
52472553 QW |
2828 | return 0; |
2829 | ||
2830 | changeset.bytes_changed = 0; | |
2831 | changeset.range_changed = ulist_alloc(GFP_NOFS); | |
52472553 | 2832 | ret = set_record_extent_bits(&BTRFS_I(inode)->io_tree, start, |
2c53b912 | 2833 | start + len -1, EXTENT_QGROUP_RESERVED, &changeset); |
81fb6f77 QW |
2834 | trace_btrfs_qgroup_reserve_data(inode, start, len, |
2835 | changeset.bytes_changed, | |
2836 | QGROUP_RESERVE); | |
52472553 QW |
2837 | if (ret < 0) |
2838 | goto cleanup; | |
003d7c59 | 2839 | ret = qgroup_reserve(root, changeset.bytes_changed, true); |
52472553 QW |
2840 | if (ret < 0) |
2841 | goto cleanup; | |
2842 | ||
2843 | ulist_free(changeset.range_changed); | |
2844 | return ret; | |
2845 | ||
2846 | cleanup: | |
2847 | /* cleanup already reserved ranges */ | |
2848 | ULIST_ITER_INIT(&uiter); | |
2849 | while ((unode = ulist_next(changeset.range_changed, &uiter))) | |
2850 | clear_extent_bit(&BTRFS_I(inode)->io_tree, unode->val, | |
2851 | unode->aux, EXTENT_QGROUP_RESERVED, 0, 0, NULL, | |
2852 | GFP_NOFS); | |
2853 | ulist_free(changeset.range_changed); | |
2854 | return ret; | |
2855 | } | |
f695fdce QW |
2856 | |
2857 | static int __btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len, | |
2858 | int free) | |
2859 | { | |
2860 | struct extent_changeset changeset; | |
81fb6f77 | 2861 | int trace_op = QGROUP_RELEASE; |
f695fdce QW |
2862 | int ret; |
2863 | ||
2864 | changeset.bytes_changed = 0; | |
2865 | changeset.range_changed = ulist_alloc(GFP_NOFS); | |
2866 | if (!changeset.range_changed) | |
2867 | return -ENOMEM; | |
2868 | ||
2869 | ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, start, | |
f734c44a | 2870 | start + len -1, EXTENT_QGROUP_RESERVED, &changeset); |
f695fdce QW |
2871 | if (ret < 0) |
2872 | goto out; | |
2873 | ||
81fb6f77 | 2874 | if (free) { |
7cf5b976 | 2875 | qgroup_free(BTRFS_I(inode)->root, changeset.bytes_changed); |
81fb6f77 QW |
2876 | trace_op = QGROUP_FREE; |
2877 | } | |
2878 | trace_btrfs_qgroup_release_data(inode, start, len, | |
2879 | changeset.bytes_changed, trace_op); | |
f695fdce QW |
2880 | out: |
2881 | ulist_free(changeset.range_changed); | |
2882 | return ret; | |
2883 | } | |
2884 | ||
2885 | /* | |
2886 | * Free a reserved space range from io_tree and related qgroups | |
2887 | * | |
2888 | * Should be called when a range of pages get invalidated before reaching disk. | |
2889 | * Or for error cleanup case. | |
2890 | * | |
2891 | * For data written to disk, use btrfs_qgroup_release_data(). | |
2892 | * | |
2893 | * NOTE: This function may sleep for memory allocation. | |
2894 | */ | |
2895 | int btrfs_qgroup_free_data(struct inode *inode, u64 start, u64 len) | |
2896 | { | |
2897 | return __btrfs_qgroup_release_data(inode, start, len, 1); | |
2898 | } | |
2899 | ||
2900 | /* | |
2901 | * Release a reserved space range from io_tree only. | |
2902 | * | |
2903 | * Should be called when a range of pages get written to disk and corresponding | |
2904 | * FILE_EXTENT is inserted into corresponding root. | |
2905 | * | |
2906 | * Since new qgroup accounting framework will only update qgroup numbers at | |
2907 | * commit_transaction() time, its reserved space shouldn't be freed from | |
2908 | * related qgroups. | |
2909 | * | |
2910 | * But we should release the range from io_tree, to allow further write to be | |
2911 | * COWed. | |
2912 | * | |
2913 | * NOTE: This function may sleep for memory allocation. | |
2914 | */ | |
2915 | int btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len) | |
2916 | { | |
2917 | return __btrfs_qgroup_release_data(inode, start, len, 0); | |
2918 | } | |
55eeaf05 | 2919 | |
003d7c59 JM |
2920 | int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes, |
2921 | bool enforce) | |
55eeaf05 | 2922 | { |
0b246afa | 2923 | struct btrfs_fs_info *fs_info = root->fs_info; |
55eeaf05 QW |
2924 | int ret; |
2925 | ||
0b246afa | 2926 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) || |
afcdd129 | 2927 | !is_fstree(root->objectid) || num_bytes == 0) |
55eeaf05 QW |
2928 | return 0; |
2929 | ||
0b246afa | 2930 | BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize)); |
003d7c59 | 2931 | ret = qgroup_reserve(root, num_bytes, enforce); |
55eeaf05 QW |
2932 | if (ret < 0) |
2933 | return ret; | |
2934 | atomic_add(num_bytes, &root->qgroup_meta_rsv); | |
2935 | return ret; | |
2936 | } | |
2937 | ||
2938 | void btrfs_qgroup_free_meta_all(struct btrfs_root *root) | |
2939 | { | |
0b246afa | 2940 | struct btrfs_fs_info *fs_info = root->fs_info; |
55eeaf05 QW |
2941 | int reserved; |
2942 | ||
0b246afa | 2943 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) || |
afcdd129 | 2944 | !is_fstree(root->objectid)) |
55eeaf05 QW |
2945 | return; |
2946 | ||
2947 | reserved = atomic_xchg(&root->qgroup_meta_rsv, 0); | |
2948 | if (reserved == 0) | |
2949 | return; | |
7cf5b976 | 2950 | qgroup_free(root, reserved); |
55eeaf05 QW |
2951 | } |
2952 | ||
2953 | void btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes) | |
2954 | { | |
0b246afa JM |
2955 | struct btrfs_fs_info *fs_info = root->fs_info; |
2956 | ||
2957 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) || | |
afcdd129 | 2958 | !is_fstree(root->objectid)) |
55eeaf05 QW |
2959 | return; |
2960 | ||
0b246afa | 2961 | BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize)); |
55eeaf05 QW |
2962 | WARN_ON(atomic_read(&root->qgroup_meta_rsv) < num_bytes); |
2963 | atomic_sub(num_bytes, &root->qgroup_meta_rsv); | |
7cf5b976 | 2964 | qgroup_free(root, num_bytes); |
55eeaf05 | 2965 | } |
56fa9d07 QW |
2966 | |
2967 | /* | |
01327610 | 2968 | * Check qgroup reserved space leaking, normally at destroy inode |
56fa9d07 QW |
2969 | * time |
2970 | */ | |
2971 | void btrfs_qgroup_check_reserved_leak(struct inode *inode) | |
2972 | { | |
2973 | struct extent_changeset changeset; | |
2974 | struct ulist_node *unode; | |
2975 | struct ulist_iterator iter; | |
2976 | int ret; | |
2977 | ||
2978 | changeset.bytes_changed = 0; | |
2979 | changeset.range_changed = ulist_alloc(GFP_NOFS); | |
2980 | if (WARN_ON(!changeset.range_changed)) | |
2981 | return; | |
2982 | ||
2983 | ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, 0, (u64)-1, | |
f734c44a | 2984 | EXTENT_QGROUP_RESERVED, &changeset); |
56fa9d07 QW |
2985 | |
2986 | WARN_ON(ret < 0); | |
2987 | if (WARN_ON(changeset.bytes_changed)) { | |
2988 | ULIST_ITER_INIT(&iter); | |
2989 | while ((unode = ulist_next(changeset.range_changed, &iter))) { | |
2990 | btrfs_warn(BTRFS_I(inode)->root->fs_info, | |
2991 | "leaking qgroup reserved space, ino: %lu, start: %llu, end: %llu", | |
2992 | inode->i_ino, unode->val, unode->aux); | |
2993 | } | |
2994 | qgroup_free(BTRFS_I(inode)->root, changeset.bytes_changed); | |
2995 | } | |
2996 | ulist_free(changeset.range_changed); | |
2997 | } |