fs/btrfs/qgroup.c

159  * glue structure to represent the relations between qgroups.
276  * Add relation specified by two qgroups.
282  *         -ENOENT  if one of the qgroups is NULL
1023 			  "qgroups are currently unsupported in extent tree v2");
1228 	 * adding/removing qgroups or adding/deleting qgroup relations for example,
1252 	/* Skip rescan for simple qgroups. */
1512 		/* Append parent qgroups to @qgroup_list. */
2390 	/* Now record this tree block and its counter part for qgroups */
2642 				 struct ulist *roots, struct list_head *qgroups,
2659 		qgroup_iterator_nested_add(qgroups, qg);
2670 				qgroup_iterator_nested_add(qgroups, glist->group);
2715 				   struct list_head *qgroups, u64 nr_old_roots,
2720 	list_for_each_entry(qg, qgroups, nested_iterator) {
2830 	LIST_HEAD(qgroups);
2876 	qgroup_update_refcnt(fs_info, old_roots, &qgroups, seq, UPDATE_OLD);
2879 	qgroup_update_refcnt(fs_info, new_roots, &qgroups, seq, UPDATE_NEW);
2881 	qgroup_update_counters(fs_info, &qgroups, nr_old_roots, nr_new_roots,
2885 	 * We're done using the iterator, release all its qgroups while holding
2887 	 * and trigger use-after-free accesses to qgroups.
2889 	qgroup_iterator_nested_clean(&qgroups);
2997  * Writes all changed qgroups to disk.
3055 	 * rfer/excl numbers directly from other qgroups.  This behavior has
3068 	if (size != struct_size(inherit, qgroups, inherit->num_qgroups))
3072 	 * Now check all the remaining qgroups, they should all:
3075 	 * - Be higher level qgroups.
3079 		u64 qgroupid = inherit->qgroups[i];
3119 	struct_sz = struct_size(res, qgroups, num_qgroups);
3127 	qgids = res->qgroups;
3137  * Check if we can skip rescan when inheriting qgroups.  If @src has a single
3193  * Copy the accounting information between qgroups. This is necessary
3509 	 * no limits exceeded, now record the reservation into all qgroups
4156  * This function will either reserve space from related qgroups or do nothing
4280  * Free a reserved space range from io_tree and related qgroups
4306  * related qgroups.