delayed-ref.h 9.19 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/*
 * Copyright (C) 2008 Oracle.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */
#ifndef __DELAYED_REF__
#define __DELAYED_REF__

21
/* these are the possible values of struct btrfs_delayed_ref_node->action */
22 23 24
#define BTRFS_ADD_DELAYED_REF    1 /* add one backref to the tree */
#define BTRFS_DROP_DELAYED_REF   2 /* delete one backref from the tree */
#define BTRFS_ADD_DELAYED_EXTENT 3 /* record a full extent allocation */
25
#define BTRFS_UPDATE_DELAYED_HEAD 4 /* not changing ref count on head ref */
26

27 28 29 30 31 32 33 34 35
/*
 * XXX: Qu: I really hate the design that ref_head and tree/data ref shares the
 * same ref_node structure.
 * Ref_head is in a higher logic level than tree/data ref, and duplicated
 * bytenr/num_bytes in ref_node is really a waste or memory, they should be
 * referred from ref_head.
 * This gets more disgusting after we use list to store tree/data ref in
 * ref_head. Must clean this mess up later.
 */
36
struct btrfs_delayed_ref_node {
37 38 39 40
	/*
	 * ref_head use rb tree, stored in ref_root->href.
	 * indexed by bytenr
	 */
41 42
	struct rb_node rb_node;

43 44 45
	/*data/tree ref use list, stored in ref_head->ref_list. */
	struct list_head list;

46 47 48 49 50 51
	/* the starting bytenr of the extent */
	u64 bytenr;

	/* the size of the extent */
	u64 num_bytes;

52 53 54
	/* seq number to keep track of insertion order */
	u64 seq;

55 56 57 58 59 60 61 62 63 64 65 66 67 68
	/* ref count on this data structure */
	atomic_t refs;

	/*
	 * how many refs is this entry adding or deleting.  For
	 * head refs, this may be a negative number because it is keeping
	 * track of the total mods done to the reference count.
	 * For individual refs, this will always be a positive number
	 *
	 * It may be more than one, since it is possible for a single
	 * parent to have more than one ref on an extent
	 */
	int ref_mod;

69 70
	unsigned int action:8;
	unsigned int type:8;
71
	/* is this node still in the rbtree? */
72
	unsigned int is_head:1;
73 74 75
	unsigned int in_tree:1;
};

76 77
struct btrfs_delayed_extent_op {
	struct btrfs_disk_key key;
78 79 80 81
	u8 level;
	bool update_key;
	bool update_flags;
	bool is_data;
82 83 84
	u64 flags_to_set;
};

85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
/*
 * the head refs are used to hold a lock on a given extent, which allows us
 * to make sure that only one process is running the delayed refs
 * at a time for a single extent.  They also store the sum of all the
 * reference count modifications we've queued up.
 */
struct btrfs_delayed_ref_head {
	struct btrfs_delayed_ref_node node;

	/*
	 * the mutex is held while running the refs, and it is also
	 * held when checking the sum of reference modifications.
	 */
	struct mutex mutex;

100
	spinlock_t lock;
101
	struct list_head ref_list;
102

Liu Bo's avatar
Liu Bo committed
103 104
	struct rb_node href_node;

105
	struct btrfs_delayed_extent_op *extent_op;
106 107 108 109 110 111 112 113

	/*
	 * This is used to track the final ref_mod from all the refs associated
	 * with this head ref, this is not adjusted as delayed refs are run,
	 * this is meant to track if we need to do the csum accounting or not.
	 */
	int total_ref_mod;

114 115 116 117 118 119 120 121 122 123 124
	/*
	 * For qgroup reserved space freeing.
	 *
	 * ref_root and reserved will be recorded after
	 * BTRFS_ADD_DELAYED_EXTENT is called.
	 * And will be used to free reserved qgroup space at
	 * run_delayed_refs() time.
	 */
	u64 qgroup_ref_root;
	u64 qgroup_reserved;

125 126 127 128 129 130 131 132 133 134 135 136 137
	/*
	 * when a new extent is allocated, it is just reserved in memory
	 * The actual extent isn't inserted into the extent allocation tree
	 * until the delayed ref is processed.  must_insert_reserved is
	 * used to flag a delayed ref so the accounting can be updated
	 * when a full insert is done.
	 *
	 * It is possible the extent will be freed before it is ever
	 * inserted into the extent allocation tree.  In this case
	 * we need to update the in ram accounting to properly reflect
	 * the free has happened.
	 */
	unsigned int must_insert_reserved:1;
138
	unsigned int is_data:1;
139
	unsigned int processing:1;
140 141
};

142
struct btrfs_delayed_tree_ref {
143
	struct btrfs_delayed_ref_node node;
144 145
	u64 root;
	u64 parent;
146 147
	int level;
};
148

149 150
struct btrfs_delayed_data_ref {
	struct btrfs_delayed_ref_node node;
151 152
	u64 root;
	u64 parent;
153 154
	u64 objectid;
	u64 offset;
155 156 157
};

struct btrfs_delayed_ref_root {
Liu Bo's avatar
Liu Bo committed
158 159 160
	/* head ref rbtree */
	struct rb_root href_root;

161 162 163
	/* dirty extent records */
	struct rb_root dirty_extent_root;

164 165 166 167 168 169
	/* this spin lock protects the rbtree and the entries inside */
	spinlock_t lock;

	/* how many delayed ref updates we've queued, used by the
	 * throttling code
	 */
170
	atomic_t num_entries;
171

172 173 174 175 176 177
	/* total number of head nodes in tree */
	unsigned long num_heads;

	/* total number of head nodes ready for processing */
	unsigned long num_heads_ready;

178 179
	u64 pending_csums;

180 181 182 183 184 185
	/*
	 * set when the tree is flushing before a transaction commit,
	 * used by the throttling code to decide if new updates need
	 * to be run right away
	 */
	int flushing;
186 187

	u64 run_delayed_start;
188 189 190

	/*
	 * To make qgroup to skip given root.
191
	 * This is for snapshot, as btrfs_qgroup_inherit() will manually
192 193 194 195
	 * modify counters for snapshot and its source, so we should skip
	 * the snapshot in new_root/old_roots or it will get calculated twice
	 */
	u64 qgroup_to_skip;
196 197
};

198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218
extern struct kmem_cache *btrfs_delayed_ref_head_cachep;
extern struct kmem_cache *btrfs_delayed_tree_ref_cachep;
extern struct kmem_cache *btrfs_delayed_data_ref_cachep;
extern struct kmem_cache *btrfs_delayed_extent_op_cachep;

int btrfs_delayed_ref_init(void);
void btrfs_delayed_ref_exit(void);

static inline struct btrfs_delayed_extent_op *
btrfs_alloc_delayed_extent_op(void)
{
	return kmem_cache_alloc(btrfs_delayed_extent_op_cachep, GFP_NOFS);
}

static inline void
btrfs_free_delayed_extent_op(struct btrfs_delayed_extent_op *op)
{
	if (op)
		kmem_cache_free(btrfs_delayed_extent_op_cachep, op);
}

219 220 221 222 223
static inline void btrfs_put_delayed_ref(struct btrfs_delayed_ref_node *ref)
{
	WARN_ON(atomic_read(&ref->refs) == 0);
	if (atomic_dec_and_test(&ref->refs)) {
		WARN_ON(ref->in_tree);
224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
		switch (ref->type) {
		case BTRFS_TREE_BLOCK_REF_KEY:
		case BTRFS_SHARED_BLOCK_REF_KEY:
			kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);
			break;
		case BTRFS_EXTENT_DATA_REF_KEY:
		case BTRFS_SHARED_DATA_REF_KEY:
			kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
			break;
		case 0:
			kmem_cache_free(btrfs_delayed_ref_head_cachep, ref);
			break;
		default:
			BUG();
		}
239 240 241
	}
}

242 243
int btrfs_add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
			       struct btrfs_trans_handle *trans,
244 245
			       u64 bytenr, u64 num_bytes, u64 parent,
			       u64 ref_root, int level, int action,
246
			       struct btrfs_delayed_extent_op *extent_op);
247 248
int btrfs_add_delayed_data_ref(struct btrfs_fs_info *fs_info,
			       struct btrfs_trans_handle *trans,
249 250
			       u64 bytenr, u64 num_bytes,
			       u64 parent, u64 ref_root,
251
			       u64 owner, u64 offset, u64 reserved, int action,
252
			       struct btrfs_delayed_extent_op *extent_op);
253 254 255
int btrfs_add_delayed_qgroup_reserve(struct btrfs_fs_info *fs_info,
				     struct btrfs_trans_handle *trans,
				     u64 ref_root, u64 bytenr, u64 num_bytes);
256 257
int btrfs_add_delayed_extent_op(struct btrfs_fs_info *fs_info,
				struct btrfs_trans_handle *trans,
258 259
				u64 bytenr, u64 num_bytes,
				struct btrfs_delayed_extent_op *extent_op);
260 261 262 263
void btrfs_merge_delayed_refs(struct btrfs_trans_handle *trans,
			      struct btrfs_fs_info *fs_info,
			      struct btrfs_delayed_ref_root *delayed_refs,
			      struct btrfs_delayed_ref_head *head);
264

265 266
struct btrfs_delayed_ref_head *
btrfs_find_delayed_ref_head(struct btrfs_trans_handle *trans, u64 bytenr);
267 268
int btrfs_delayed_ref_lock(struct btrfs_trans_handle *trans,
			   struct btrfs_delayed_ref_head *head);
269 270 271 272 273
static inline void btrfs_delayed_ref_unlock(struct btrfs_delayed_ref_head *head)
{
	mutex_unlock(&head->mutex);
}

274 275 276

struct btrfs_delayed_ref_head *
btrfs_select_ref_head(struct btrfs_trans_handle *trans);
277

278 279
int btrfs_check_delayed_seq(struct btrfs_fs_info *fs_info,
			    struct btrfs_delayed_ref_root *delayed_refs,
280 281
			    u64 seq);

282 283 284 285 286 287
/*
 * a node might live in a head or a regular ref, this lets you
 * test for the proper type to use.
 */
static int btrfs_delayed_ref_is_head(struct btrfs_delayed_ref_node *node)
{
288
	return node->is_head;
289 290 291 292 293
}

/*
 * helper functions to cast a node into its container
 */
294 295
static inline struct btrfs_delayed_tree_ref *
btrfs_delayed_node_to_tree_ref(struct btrfs_delayed_ref_node *node)
296 297
{
	WARN_ON(btrfs_delayed_ref_is_head(node));
298 299
	return container_of(node, struct btrfs_delayed_tree_ref, node);
}
300

301 302 303 304 305
static inline struct btrfs_delayed_data_ref *
btrfs_delayed_node_to_data_ref(struct btrfs_delayed_ref_node *node)
{
	WARN_ON(btrfs_delayed_ref_is_head(node));
	return container_of(node, struct btrfs_delayed_data_ref, node);
306 307 308 309 310 311 312 313 314
}

static inline struct btrfs_delayed_ref_head *
btrfs_delayed_node_to_head(struct btrfs_delayed_ref_node *node)
{
	WARN_ON(!btrfs_delayed_ref_is_head(node));
	return container_of(node, struct btrfs_delayed_ref_head, node);
}
#endif