[linux-2.6-block.git] / fs / btrfs / qgroup.h

/* SPDX-License-Identifier: GPL-2.0 */
/*
 * Copyright (C) 2014 Facebook.  All rights reserved.
 */

#ifndef BTRFS_QGROUP_H
#define BTRFS_QGROUP_H

#include <linux/spinlock.h>
#include <linux/rbtree.h>
#include <linux/kobject.h>
#include "ulist.h"
#include "delayed-ref.h"
#include "misc.h"

/*
 * Btrfs qgroup overview
 *
 * Btrfs qgroup splits into 3 main part:
 * 1) Reserve
 *    Reserve metadata/data space for incoming operations
 *    Affect how qgroup limit works
 *
 * 2) Trace
 *    Tell btrfs qgroup to trace dirty extents.
 *
 *    Dirty extents including:
 *    - Newly allocated extents
 *    - Extents going to be deleted (in this trans)
 *    - Extents whose owner is going to be modified
 *
 *    This is the main part affects whether qgroup numbers will stay
 *    consistent.
 *    Btrfs qgroup can trace clean extents and won't cause any problem,
 *    but it will consume extra CPU time, it should be avoided if possible.
 *
 * 3) Account
 *    Btrfs qgroup will updates its numbers, based on dirty extents traced
 *    in previous step.
 *
 *    Normally at qgroup rescan and transaction commit time.
 */

/*
 * Special performance optimization for balance.
 *
 * For balance, we need to swap subtree of subvolume and reloc trees.
 * In theory, we need to trace all subtree blocks of both subvolume and reloc
 * trees, since their owner has changed during such swap.
 *
 * However since balance has ensured that both subtrees are containing the
 * same contents and have the same tree structures, such swap won't cause
 * qgroup number change.
 *
 * But there is a race window between subtree swap and transaction commit,
 * during that window, if we increase/decrease tree level or merge/split tree
 * blocks, we still need to trace the original subtrees.
 *
 * So for balance, we use a delayed subtree tracing, whose workflow is:
 *
 * 1) Record the subtree root block get swapped.
 *
 *    During subtree swap:
 *    O = Old tree blocks
 *    N = New tree blocks
 *          reloc tree                     subvolume tree X
 *             Root                               Root
 *            /    \                             /    \
 *          NA     OB                          OA      OB
 *        /  |     |  \                      /  |      |  \
 *      NC  ND     OE  OF                   OC  OD     OE  OF
 *
 *   In this case, NA and OA are going to be swapped, record (NA, OA) into
 *   subvolume tree X.
 *
 * 2) After subtree swap.
 *          reloc tree                     subvolume tree X
 *             Root                               Root
 *            /    \                             /    \
 *          OA     OB                          NA      OB
 *        /  |     |  \                      /  |      |  \
 *      OC  OD     OE  OF                   NC  ND     OE  OF
 *
 * 3a) COW happens for OB
 *     If we are going to COW tree block OB, we check OB's bytenr against
 *     tree X's swapped_blocks structure.
 *     If it doesn't fit any, nothing will happen.
 *
 * 3b) COW happens for NA
 *     Check NA's bytenr against tree X's swapped_blocks, and get a hit.
 *     Then we do subtree scan on both subtrees OA and NA.
 *     Resulting 6 tree blocks to be scanned (OA, OC, OD, NA, NC, ND).
 *
 *     Then no matter what we do to subvolume tree X, qgroup numbers will
 *     still be correct.
 *     Then NA's record gets removed from X's swapped_blocks.
 *
 * 4)  Transaction commit
 *     Any record in X's swapped_blocks gets removed, since there is no
 *     modification to the swapped subtrees, no need to trigger heavy qgroup
 *     subtree rescan for them.
 */

#define BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN		(1UL << 3)
#define BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING		(1UL << 4)

/*
 * Record a dirty extent, and info qgroup to update quota on it
 * TODO: Use kmem cache to alloc it.
 */
struct btrfs_qgroup_extent_record {
	struct rb_node node;
	u64 bytenr;
	u64 num_bytes;

	/*
	 * For qgroup reserved data space freeing.
	 *
	 * @data_rsv_refroot and @data_rsv will be recorded after
	 * BTRFS_ADD_DELAYED_EXTENT is called.
	 * And will be used to free reserved qgroup space at
	 * transaction commit time.
	 */
	u32 data_rsv;		/* reserved data space needs to be freed */
	u64 data_rsv_refroot;	/* which root the reserved data belongs to */
	struct ulist *old_roots;
};

struct btrfs_qgroup_swapped_block {
	struct rb_node node;

	int level;
	bool trace_leaf;

	/* bytenr/generation of the tree block in subvolume tree after swap */
	u64 subvol_bytenr;
	u64 subvol_generation;

	/* bytenr/generation of the tree block in reloc tree after swap */
	u64 reloc_bytenr;
	u64 reloc_generation;

	u64 last_snapshot;
	struct btrfs_key first_key;
};

/*
 * Qgroup reservation types:
 *
 * DATA:
 *	space reserved for data
 *
 * META_PERTRANS:
 * 	Space reserved for metadata (per-transaction)
 * 	Due to the fact that qgroup data is only updated at transaction commit
 * 	time, reserved space for metadata must be kept until transaction
 * 	commits.
 * 	Any metadata reserved that are used in btrfs_start_transaction() should
 * 	be of this type.
 *
 * META_PREALLOC:
 *	There are cases where metadata space is reserved before starting
 *	transaction, and then btrfs_join_transaction() to get a trans handle.
 *	Any metadata reserved for such usage should be of this type.
 *	And after join_transaction() part (or all) of such reservation should
 *	be converted into META_PERTRANS.
 */
enum btrfs_qgroup_rsv_type {
	BTRFS_QGROUP_RSV_DATA,
	BTRFS_QGROUP_RSV_META_PERTRANS,
	BTRFS_QGROUP_RSV_META_PREALLOC,
	BTRFS_QGROUP_RSV_LAST,
};

/*
 * Represents how many bytes we have reserved for this qgroup.
 *
 * Each type should have different reservation behavior.
 * E.g, data follows its io_tree flag modification, while
 * *currently* meta is just reserve-and-clear during transaction.
 *
 * TODO: Add new type for reservation which can survive transaction commit.
 * Current metadata reservation behavior is not suitable for such case.
 */
struct btrfs_qgroup_rsv {
	u64 values[BTRFS_QGROUP_RSV_LAST];
};

/*
 * one struct for each qgroup, organized in fs_info->qgroup_tree.
 */
struct btrfs_qgroup {
	u64 qgroupid;

	/*
	 * state
	 */
	u64 rfer;	/* referenced */
	u64 rfer_cmpr;	/* referenced compressed */
	u64 excl;	/* exclusive */
	u64 excl_cmpr;	/* exclusive compressed */

	/*
	 * limits
	 */
	u64 lim_flags;	/* which limits are set */
	u64 max_rfer;
	u64 max_excl;
	u64 rsv_rfer;
	u64 rsv_excl;

	/*
	 * reservation tracking
	 */
	struct btrfs_qgroup_rsv rsv;

	/*
	 * lists
	 */
	struct list_head groups;  /* groups this group is member of */
	struct list_head members; /* groups that are members of this group */
	struct list_head dirty;   /* dirty groups */

	/*
	 * For qgroup iteration usage.
	 *
	 * The iteration list should always be empty until qgroup_iterator_add()
	 * is called.  And should be reset to empty after the iteration is
	 * finished.
	 */
	struct list_head iterator;

	/*
	 * For nested iterator usage.
	 *
	 * Here we support at most one level of nested iterator calls like:
	 *
	 *	LIST_HEAD(all_qgroups);
	 *	{
	 *		LIST_HEAD(local_qgroups);
	 *		qgroup_iterator_add(local_qgroups, qg);
	 *		qgroup_iterator_nested_add(all_qgroups, qg);
	 *		do_some_work(local_qgroups);
	 *		qgroup_iterator_clean(local_qgroups);
	 *	}
	 *	do_some_work(all_qgroups);
	 *	qgroup_iterator_nested_clean(all_qgroups);
	 */
	struct list_head nested_iterator;
	struct rb_node node;	  /* tree of qgroups */

	/*
	 * temp variables for accounting operations
	 * Refer to qgroup_shared_accounting() for details.
	 */
	u64 old_refcnt;
	u64 new_refcnt;

	/*
	 * Sysfs kobjectid
	 */
	struct kobject kobj;
};

static inline u64 btrfs_qgroup_subvolid(u64 qgroupid)
{
	return (qgroupid & ((1ULL << BTRFS_QGROUP_LEVEL_SHIFT) - 1));
}

/*
 * For qgroup event trace points only
 */
enum {
	ENUM_BIT(QGROUP_RESERVE),
	ENUM_BIT(QGROUP_RELEASE),
	ENUM_BIT(QGROUP_FREE),
};

int btrfs_quota_enable(struct btrfs_fs_info *fs_info);
int btrfs_quota_disable(struct btrfs_fs_info *fs_info);
int btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info);
void btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info);
int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
				     bool interruptible);
int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
			      u64 dst);
int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
			      u64 dst);
int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid);
int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid);
int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
		       struct btrfs_qgroup_limit *limit);
int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info);
void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info);
struct btrfs_delayed_extent_op;

int btrfs_qgroup_trace_extent_nolock(
		struct btrfs_fs_info *fs_info,
		struct btrfs_delayed_ref_root *delayed_refs,
		struct btrfs_qgroup_extent_record *record);
int btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle *trans,
				   struct btrfs_qgroup_extent_record *qrecord);
int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
			      u64 num_bytes);
int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
				  struct extent_buffer *eb);
int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
			       struct extent_buffer *root_eb,
			       u64 root_gen, int root_level);
int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
				u64 num_bytes, struct ulist *old_roots,
				struct ulist *new_roots);
int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans);
int btrfs_run_qgroups(struct btrfs_trans_handle *trans);
int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
			 u64 objectid, struct btrfs_qgroup_inherit *inherit);
void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
			       u64 ref_root, u64 num_bytes,
			       enum btrfs_qgroup_rsv_type type);

#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
			       u64 rfer, u64 excl);
#endif

/* New io_tree based accurate qgroup reserve API */
int btrfs_qgroup_reserve_data(struct btrfs_inode *inode,
			struct extent_changeset **reserved, u64 start, u64 len);
int btrfs_qgroup_release_data(struct btrfs_inode *inode, u64 start, u64 len);
int btrfs_qgroup_free_data(struct btrfs_inode *inode,
			   struct extent_changeset *reserved, u64 start,
			   u64 len);
int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
			      enum btrfs_qgroup_rsv_type type, bool enforce);
int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
				enum btrfs_qgroup_rsv_type type, bool enforce,
				bool noflush);
/* Reserve metadata space for pertrans and prealloc type */
static inline int btrfs_qgroup_reserve_meta_pertrans(struct btrfs_root *root,
				int num_bytes, bool enforce)
{
	return __btrfs_qgroup_reserve_meta(root, num_bytes,
					   BTRFS_QGROUP_RSV_META_PERTRANS,
					   enforce, false);
}
static inline int btrfs_qgroup_reserve_meta_prealloc(struct btrfs_root *root,
						     int num_bytes, bool enforce,
						     bool noflush)
{
	return __btrfs_qgroup_reserve_meta(root, num_bytes,
					   BTRFS_QGROUP_RSV_META_PREALLOC,
					   enforce, noflush);
}

void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
			     enum btrfs_qgroup_rsv_type type);

/* Free per-transaction meta reservation for error handling */
static inline void btrfs_qgroup_free_meta_pertrans(struct btrfs_root *root,
						   int num_bytes)
{
	__btrfs_qgroup_free_meta(root, num_bytes,
			BTRFS_QGROUP_RSV_META_PERTRANS);
}

/* Pre-allocated meta reservation can be freed at need */
static inline void btrfs_qgroup_free_meta_prealloc(struct btrfs_root *root,
						   int num_bytes)
{
	__btrfs_qgroup_free_meta(root, num_bytes,
			BTRFS_QGROUP_RSV_META_PREALLOC);
}

void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root);
void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes);
void btrfs_qgroup_check_reserved_leak(struct btrfs_inode *inode);

/* btrfs_qgroup_swapped_blocks related functions */
void btrfs_qgroup_init_swapped_blocks(
	struct btrfs_qgroup_swapped_blocks *swapped_blocks);

void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root);
int btrfs_qgroup_add_swapped_blocks(struct btrfs_trans_handle *trans,
		struct btrfs_root *subvol_root,
		struct btrfs_block_group *bg,
		struct extent_buffer *subvol_parent, int subvol_slot,
		struct extent_buffer *reloc_parent, int reloc_slot,
		u64 last_snapshot);
int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
		struct btrfs_root *root, struct extent_buffer *eb);
void btrfs_qgroup_destroy_extent_records(struct btrfs_transaction *trans);
bool btrfs_check_quota_leak(struct btrfs_fs_info *fs_info);

#endif
Commit	Line	Data
9888c340	1	/* SPDX-License-Identifier: GPL-2.0 */
fcebe456 JB	2	/*
fcebe456 JB	3	* Copyright (C) 2014 Facebook. All rights reserved.
fcebe456 JB	4	*/
fcebe456 JB	5
9888c340 DS	6	#ifndef BTRFS_QGROUP_H
9888c340 DS	7	#define BTRFS_QGROUP_H
fcebe456	8
370a11b8 QW	9	#include <linux/spinlock.h>
370a11b8 QW	10	#include <linux/rbtree.h>
49e5fb46	11	#include <linux/kobject.h>
3368d001 QW	12	#include "ulist.h"
3368d001 QW	13	#include "delayed-ref.h"
e0a8b9a7	14	#include "misc.h"
3368d001	15
1d2beaa9 QW	16	/*
	17	* Btrfs qgroup overview
	18	*
	19	* Btrfs qgroup splits into 3 main part:
	20	* 1) Reserve
	21	* Reserve metadata/data space for incoming operations
	22	* Affect how qgroup limit works
	23	*
	24	* 2) Trace
	25	* Tell btrfs qgroup to trace dirty extents.
	26	*
	27	* Dirty extents including:
	28	* - Newly allocated extents
	29	* - Extents going to be deleted (in this trans)
	30	* - Extents whose owner is going to be modified
	31	*
	32	* This is the main part affects whether qgroup numbers will stay
	33	* consistent.
	34	* Btrfs qgroup can trace clean extents and won't cause any problem,
	35	* but it will consume extra CPU time, it should be avoided if possible.
	36	*
	37	* 3) Account
	38	* Btrfs qgroup will updates its numbers, based on dirty extents traced
	39	* in previous step.
	40	*
	41	* Normally at qgroup rescan and transaction commit time.
	42	*/
	43
370a11b8 QW	44	/*
	45	* Special performance optimization for balance.
	46	*
	47	* For balance, we need to swap subtree of subvolume and reloc trees.
	48	* In theory, we need to trace all subtree blocks of both subvolume and reloc
	49	* trees, since their owner has changed during such swap.
	50	*
	51	* However since balance has ensured that both subtrees are containing the
	52	* same contents and have the same tree structures, such swap won't cause
	53	* qgroup number change.
	54	*
	55	* But there is a race window between subtree swap and transaction commit,
	56	* during that window, if we increase/decrease tree level or merge/split tree
	57	* blocks, we still need to trace the original subtrees.
	58	*
	59	* So for balance, we use a delayed subtree tracing, whose workflow is:
	60	*
	61	* 1) Record the subtree root block get swapped.
	62	*
	63	* During subtree swap:
	64	* O = Old tree blocks
	65	* N = New tree blocks
	66	* reloc tree subvolume tree X
	67	* Root Root
	68	* / \ / \
	69	* NA OB OA OB
	70	* / \| \| \ / \| \| \
	71	* NC ND OE OF OC OD OE OF
	72	*
	73	* In this case, NA and OA are going to be swapped, record (NA, OA) into
	74	* subvolume tree X.
	75	*
	76	* 2) After subtree swap.
	77	* reloc tree subvolume tree X
	78	* Root Root
	79	* / \ / \
	80	* OA OB NA OB
	81	* / \| \| \ / \| \| \
	82	* OC OD OE OF NC ND OE OF
	83	*
	84	* 3a) COW happens for OB
	85	* If we are going to COW tree block OB, we check OB's bytenr against
	86	* tree X's swapped_blocks structure.
	87	* If it doesn't fit any, nothing will happen.
	88	*
	89	* 3b) COW happens for NA
	90	* Check NA's bytenr against tree X's swapped_blocks, and get a hit.
	91	* Then we do subtree scan on both subtrees OA and NA.
	92	* Resulting 6 tree blocks to be scanned (OA, OC, OD, NA, NC, ND).
	93	*
	94	* Then no matter what we do to subvolume tree X, qgroup numbers will
	95	* still be correct.
	96	* Then NA's record gets removed from X's swapped_blocks.
	97	*
	98	* 4) Transaction commit
	99	* Any record in X's swapped_blocks gets removed, since there is no
	100	* modification to the swapped subtrees, no need to trigger heavy qgroup
	101	* subtree rescan for them.
	102	*/
	103
e562a8bd	104	#define BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN (1UL << 3)
e15e9f43	105	#define BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING (1UL << 4)
e562a8bd	106
3368d001 QW	107	/*
	108	* Record a dirty extent, and info qgroup to update quota on it
	109	* TODO: Use kmem cache to alloc it.
	110	*/
	111	struct btrfs_qgroup_extent_record {
	112	struct rb_node node;
	113	u64 bytenr;
	114	u64 num_bytes;
1418bae1 QW	115
	116	/*
	117	* For qgroup reserved data space freeing.
	118	*
	119	* @data_rsv_refroot and @data_rsv will be recorded after
	120	* BTRFS_ADD_DELAYED_EXTENT is called.
	121	* And will be used to free reserved qgroup space at
	122	* transaction commit time.
	123	*/
	124	u32 data_rsv; /* reserved data space needs to be freed */
	125	u64 data_rsv_refroot; /* which root the reserved data belongs to */
3368d001 QW	126	struct ulist *old_roots;
	127	};
	128
370a11b8 QW	129	struct btrfs_qgroup_swapped_block {
	130	struct rb_node node;
	131
	132	int level;
	133	bool trace_leaf;
	134
	135	/* bytenr/generation of the tree block in subvolume tree after swap */
	136	u64 subvol_bytenr;
	137	u64 subvol_generation;
	138
	139	/* bytenr/generation of the tree block in reloc tree after swap */
	140	u64 reloc_bytenr;
	141	u64 reloc_generation;
	142
	143	u64 last_snapshot;
	144	struct btrfs_key first_key;
	145	};
	146
733e03a0 QW	147	/*
	148	* Qgroup reservation types:
	149	*
	150	* DATA:
	151	* space reserved for data
	152	*
	153	* META_PERTRANS:
	154	* Space reserved for metadata (per-transaction)
	155	* Due to the fact that qgroup data is only updated at transaction commit
	156	* time, reserved space for metadata must be kept until transaction
	157	* commits.
	158	* Any metadata reserved that are used in btrfs_start_transaction() should
	159	* be of this type.
	160	*
	161	* META_PREALLOC:
	162	* There are cases where metadata space is reserved before starting
	163	* transaction, and then btrfs_join_transaction() to get a trans handle.
	164	* Any metadata reserved for such usage should be of this type.
	165	* And after join_transaction() part (or all) of such reservation should
	166	* be converted into META_PERTRANS.
	167	*/
d4e5c920	168	enum btrfs_qgroup_rsv_type {
bbe339cc	169	BTRFS_QGROUP_RSV_DATA,
733e03a0 QW	170	BTRFS_QGROUP_RSV_META_PERTRANS,
733e03a0 QW	171	BTRFS_QGROUP_RSV_META_PREALLOC,
d4e5c920 QW	172	BTRFS_QGROUP_RSV_LAST,
	173	};
	174
	175	/*
	176	* Represents how many bytes we have reserved for this qgroup.
	177	*
	178	* Each type should have different reservation behavior.
	179	* E.g, data follows its io_tree flag modification, while
52042d8e	180	* currently meta is just reserve-and-clear during transaction.
d4e5c920 QW	181	*
d4e5c920 QW	182	* TODO: Add new type for reservation which can survive transaction commit.
52042d8e	183	* Current metadata reservation behavior is not suitable for such case.
d4e5c920 QW	184	*/
	185	struct btrfs_qgroup_rsv {
	186	u64 values[BTRFS_QGROUP_RSV_LAST];
	187	};
	188
3159fe7b QW	189	/*
	190	* one struct for each qgroup, organized in fs_info->qgroup_tree.
	191	*/
	192	struct btrfs_qgroup {
	193	u64 qgroupid;
	194
	195	/*
	196	* state
	197	*/
	198	u64 rfer; /* referenced */
	199	u64 rfer_cmpr; /* referenced compressed */
	200	u64 excl; /* exclusive */
	201	u64 excl_cmpr; /* exclusive compressed */
	202
	203	/*
	204	* limits
	205	*/
	206	u64 lim_flags; /* which limits are set */
	207	u64 max_rfer;
	208	u64 max_excl;
	209	u64 rsv_rfer;
	210	u64 rsv_excl;
	211
	212	/*
	213	* reservation tracking
	214	*/
d4e5c920	215	struct btrfs_qgroup_rsv rsv;
3159fe7b QW	216
	217	/*
	218	* lists
	219	*/
	220	struct list_head groups; /* groups this group is member of */
	221	struct list_head members; /* groups that are members of this group */
	222	struct list_head dirty; /* dirty groups */
686c4a5a QW	223
	224	/*
	225	* For qgroup iteration usage.
	226	*
	227	* The iteration list should always be empty until qgroup_iterator_add()
	228	* is called. And should be reset to empty after the iteration is
	229	* finished.
	230	*/
	231	struct list_head iterator;
dce28769 QW	232
	233	/*
	234	* For nested iterator usage.
	235	*
	236	* Here we support at most one level of nested iterator calls like:
	237	*
	238	* LIST_HEAD(all_qgroups);
	239	* {
	240	* LIST_HEAD(local_qgroups);
	241	* qgroup_iterator_add(local_qgroups, qg);
	242	* qgroup_iterator_nested_add(all_qgroups, qg);
	243	* do_some_work(local_qgroups);
	244	* qgroup_iterator_clean(local_qgroups);
	245	* }
	246	* do_some_work(all_qgroups);
	247	* qgroup_iterator_nested_clean(all_qgroups);
	248	*/
	249	struct list_head nested_iterator;
3159fe7b QW	250	struct rb_node node; /* tree of qgroups */
	251
	252	/*
	253	* temp variables for accounting operations
	254	* Refer to qgroup_shared_accounting() for details.
	255	*/
	256	u64 old_refcnt;
	257	u64 new_refcnt;
49e5fb46 QW	258
	259	/*
	260	* Sysfs kobjectid
	261	*/
	262	struct kobject kobj;
3159fe7b QW	263	};
3159fe7b QW	264
49e5fb46 QW	265	static inline u64 btrfs_qgroup_subvolid(u64 qgroupid)
	266	{
	267	return (qgroupid & ((1ULL << BTRFS_QGROUP_LEVEL_SHIFT) - 1));
	268	}
	269
81fb6f77 QW	270	/*
	271	* For qgroup event trace points only
	272	*/
e0a8b9a7 DS	273	enum {
	274	ENUM_BIT(QGROUP_RESERVE),
	275	ENUM_BIT(QGROUP_RELEASE),
	276	ENUM_BIT(QGROUP_FREE),
	277	};
81fb6f77	278
340f1aa2 NB	279	int btrfs_quota_enable(struct btrfs_fs_info *fs_info);
340f1aa2 NB	280	int btrfs_quota_disable(struct btrfs_fs_info *fs_info);
fcebe456 JB	281	int btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info);
fcebe456 JB	282	void btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info);
d06f23d6 JM	283	int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
d06f23d6 JM	284	bool interruptible);
9f8a6ce6 LF	285	int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
9f8a6ce6 LF	286	u64 dst);
39616c27 LF	287	int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
39616c27 LF	288	u64 dst);
49a05ecd	289	int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid);
3efbee1d	290	int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid);
f0042d5e	291	int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
fcebe456 JB	292	struct btrfs_qgroup_limit *limit);
	293	int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info);
	294	void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info);
	295	struct btrfs_delayed_extent_op;
d1b8b94a	296
50b3e040	297	int btrfs_qgroup_trace_extent_nolock(
cb93b52c QW	298	struct btrfs_fs_info *fs_info,
	299	struct btrfs_delayed_ref_root *delayed_refs,
	300	struct btrfs_qgroup_extent_record *record);
8949b9a1	301	int btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle *trans,
fb235dc0	302	struct btrfs_qgroup_extent_record *qrecord);
a95f3aaf	303	int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
e2896e79	304	u64 num_bytes);
33d1f05c	305	int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
33d1f05c	306	struct extent_buffer *eb);
33d1f05c	307	int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
33d1f05c QW	308	struct extent_buffer *root_eb,
33d1f05c QW	309	u64 root_gen, int root_level);
8696d760 LF	310	int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
	311	u64 num_bytes, struct ulist *old_roots,
	312	struct ulist *new_roots);
460fb20a	313	int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans);
280f8bd2	314	int btrfs_run_qgroups(struct btrfs_trans_handle *trans);
a9377422 LF	315	int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
a9377422 LF	316	u64 objectid, struct btrfs_qgroup_inherit *inherit);
297d750b	317	void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
d4e5c920 QW	318	u64 ref_root, u64 num_bytes,
d4e5c920 QW	319	enum btrfs_qgroup_rsv_type type);
fcebe456 JB	320
	321	#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
	322	int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
	323	u64 rfer, u64 excl);
	324	#endif
	325
52472553	326	/* New io_tree based accurate qgroup reserve API */
7661a3e0	327	int btrfs_qgroup_reserve_data(struct btrfs_inode *inode,
364ecf36	328	struct extent_changeset **reserved, u64 start, u64 len);
72b7d15b	329	int btrfs_qgroup_release_data(struct btrfs_inode *inode, u64 start, u64 len);
8b8a979f NB	330	int btrfs_qgroup_free_data(struct btrfs_inode *inode,
	331	struct extent_changeset *reserved, u64 start,
	332	u64 len);
80e9baed NB	333	int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
80e9baed NB	334	enum btrfs_qgroup_rsv_type type, bool enforce);
733e03a0	335	int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
d4135134 FM	336	enum btrfs_qgroup_rsv_type type, bool enforce,
d4135134 FM	337	bool noflush);
733e03a0 QW	338	/* Reserve metadata space for pertrans and prealloc type */
	339	static inline int btrfs_qgroup_reserve_meta_pertrans(struct btrfs_root *root,
	340	int num_bytes, bool enforce)
	341	{
	342	return __btrfs_qgroup_reserve_meta(root, num_bytes,
d4135134 FM	343	BTRFS_QGROUP_RSV_META_PERTRANS,
d4135134 FM	344	enforce, false);
733e03a0 QW	345	}
733e03a0 QW	346	static inline int btrfs_qgroup_reserve_meta_prealloc(struct btrfs_root *root,
d4135134 FM	347	int num_bytes, bool enforce,
d4135134 FM	348	bool noflush)
733e03a0 QW	349	{
733e03a0 QW	350	return __btrfs_qgroup_reserve_meta(root, num_bytes,
d4135134 FM	351	BTRFS_QGROUP_RSV_META_PREALLOC,
d4135134 FM	352	enforce, noflush);
733e03a0 QW	353	}
	354
	355	void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
	356	enum btrfs_qgroup_rsv_type type);
	357
	358	/* Free per-transaction meta reservation for error handling */
	359	static inline void btrfs_qgroup_free_meta_pertrans(struct btrfs_root *root,
	360	int num_bytes)
	361	{
	362	__btrfs_qgroup_free_meta(root, num_bytes,
	363	BTRFS_QGROUP_RSV_META_PERTRANS);
	364	}
	365
	366	/* Pre-allocated meta reservation can be freed at need */
	367	static inline void btrfs_qgroup_free_meta_prealloc(struct btrfs_root *root,
	368	int num_bytes)
	369	{
	370	__btrfs_qgroup_free_meta(root, num_bytes,
	371	BTRFS_QGROUP_RSV_META_PREALLOC);
	372	}
	373
733e03a0	374	void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root);
64cfaef6	375	void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes);
cfdd4592	376	void btrfs_qgroup_check_reserved_leak(struct btrfs_inode *inode);
9888c340	377
370a11b8 QW	378	/* btrfs_qgroup_swapped_blocks related functions */
	379	void btrfs_qgroup_init_swapped_blocks(
	380	struct btrfs_qgroup_swapped_blocks *swapped_blocks);
	381
	382	void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root);
	383	int btrfs_qgroup_add_swapped_blocks(struct btrfs_trans_handle *trans,
	384	struct btrfs_root *subvol_root,
32da5386	385	struct btrfs_block_group *bg,
370a11b8 QW	386	struct extent_buffer *subvol_parent, int subvol_slot,
	387	struct extent_buffer *reloc_parent, int reloc_slot,
	388	u64 last_snapshot);
f616f5cd QW	389	int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
f616f5cd QW	390	struct btrfs_root root, struct extent_buffer eb);
81f7eb00	391	void btrfs_qgroup_destroy_extent_records(struct btrfs_transaction *trans);
5958253c	392	bool btrfs_check_quota_leak(struct btrfs_fs_info *fs_info);
370a11b8	393
9888c340	394	#endif