[deliverable/linux.git] / fs / btrfs / ordered-data.h

/*
 * Copyright (C) 2007 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 __BTRFS_ORDERED_DATA__
#define __BTRFS_ORDERED_DATA__

/* one of these per inode */
struct btrfs_ordered_inode_tree {
	spinlock_t lock;
	struct rb_root tree;
	struct rb_node *last;
};

/*
 * these are used to collect checksums done just before bios submission.
 * They are attached via a list into the ordered extent, and
 * checksum items are inserted into the tree after all the blocks in
 * the ordered extent are on disk
 */
struct btrfs_sector_sum {
	/* bytenr on disk */
	u64 bytenr;
	u32 sum;
};

struct btrfs_ordered_sum {
	/* bytenr is the start of this extent on disk */
	u64 bytenr;

	/*
	 * this is the length in bytes covered by the sums array below.
	 */
	unsigned long len;
	struct list_head list;
	/* last field is a variable length array of btrfs_sector_sums */
	struct btrfs_sector_sum sums[];
};

/*
 * bits for the flags field:
 *
 * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written.
 * It is used to make sure metadata is inserted into the tree only once
 * per extent.
 *
 * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the
 * rbtree, just before waking any waiters.  It is used to indicate the
 * IO is done and any metadata is inserted into the tree.
 */
#define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */

#define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */

#define BTRFS_ORDERED_NOCOW 2 /* set when we want to write in place */

#define BTRFS_ORDERED_COMPRESSED 3 /* writing a zlib compressed extent */

#define BTRFS_ORDERED_PREALLOC 4 /* set when writing to prealloced extent */

#define BTRFS_ORDERED_DIRECT 5 /* set when we're doing DIO with this extent */

#define BTRFS_ORDERED_IOERR 6 /* We had an io error when writing this out */

#define BTRFS_ORDERED_UPDATED_ISIZE 7 /* indicates whether this ordered extent
				       * has done its due diligence in updating
				       * the isize. */
#define BTRFS_ORDERED_LOGGED_CSUM 8 /* We've logged the csums on this ordered
				       ordered extent */

struct btrfs_ordered_extent {
	/* logical offset in the file */
	u64 file_offset;

	/* disk byte number */
	u64 start;

	/* ram length of the extent in bytes */
	u64 len;

	/* extent length on disk */
	u64 disk_len;

	/* number of bytes that still need writing */
	u64 bytes_left;

	/* number of bytes that still need csumming */
	u64 csum_bytes_left;

	/*
	 * the end of the ordered extent which is behind it but
	 * didn't update disk_i_size. Please see the comment of
	 * btrfs_ordered_update_i_size();
	 */
	u64 outstanding_isize;

	/* flags (described above) */
	unsigned long flags;

	/* compression algorithm */
	int compress_type;

	/* reference count */
	atomic_t refs;

	/* the inode we belong to */
	struct inode *inode;

	/* list of checksums for insertion when the extent io is done */
	struct list_head list;

	/* If we need to wait on this to be done */
	struct list_head log_list;

	/* used to wait for the BTRFS_ORDERED_COMPLETE bit */
	wait_queue_head_t wait;

	/* our friendly rbtree entry */
	struct rb_node rb_node;

	/* a per root list of all the pending ordered extents */
	struct list_head root_extent_list;

	struct btrfs_work work;

	struct completion completion;
	struct btrfs_work flush_work;
	struct list_head work_list;
};

/*
 * calculates the total size you need to allocate for an ordered sum
 * structure spanning 'bytes' in the file
 */
static inline int btrfs_ordered_sum_size(struct btrfs_root *root,
					 unsigned long bytes)
{
	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
		root->sectorsize;
	num_sectors++;
	return sizeof(struct btrfs_ordered_sum) +
		num_sectors * sizeof(struct btrfs_sector_sum);
}

static inline void
btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
{
	spin_lock_init(&t->lock);
	t->tree = RB_ROOT;
	t->last = NULL;
}

void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
void btrfs_remove_ordered_extent(struct inode *inode,
				struct btrfs_ordered_extent *entry);
int btrfs_dec_test_ordered_pending(struct inode *inode,
				   struct btrfs_ordered_extent **cached,
				   u64 file_offset, u64 io_size, int uptodate);
int btrfs_dec_test_first_ordered_pending(struct inode *inode,
				   struct btrfs_ordered_extent **cached,
				   u64 *file_offset, u64 io_size,
				   int uptodate);
int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
			     u64 start, u64 len, u64 disk_len, int type);
int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
				 u64 start, u64 len, u64 disk_len, int type);
int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
				      u64 start, u64 len, u64 disk_len,
				      int type, int compress_type);
void btrfs_add_ordered_sum(struct inode *inode,
			   struct btrfs_ordered_extent *entry,
			   struct btrfs_ordered_sum *sum);
struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
							 u64 file_offset);
void btrfs_start_ordered_extent(struct inode *inode,
				struct btrfs_ordered_extent *entry, int wait);
void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
struct btrfs_ordered_extent *
btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode,
							u64 file_offset,
							u64 len);
int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
				struct btrfs_ordered_extent *ordered);
int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, u32 *sum);
int btrfs_run_ordered_operations(struct btrfs_trans_handle *trans,
				 struct btrfs_root *root, int wait);
void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans,
				 struct btrfs_root *root,
				 struct inode *inode);
void btrfs_wait_ordered_extents(struct btrfs_root *root, int delay_iput);
void btrfs_get_logged_extents(struct btrfs_root *log, struct inode *inode);
void btrfs_wait_logged_extents(struct btrfs_root *log, u64 transid);
void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid);
int __init ordered_data_init(void);
void ordered_data_exit(void);
#endif
Commit	Line	Data
	1	/*
	2	* Copyright (C) 2007 Oracle. 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	#ifndef __BTRFS_ORDERED_DATA__
	20	#define __BTRFS_ORDERED_DATA__
	21
	22	/* one of these per inode */
	23	struct btrfs_ordered_inode_tree {
	24	spinlock_t lock;
	25	struct rb_root tree;
	26	struct rb_node *last;
	27	};
	28
	29	/*
	30	* these are used to collect checksums done just before bios submission.
	31	* They are attached via a list into the ordered extent, and
	32	* checksum items are inserted into the tree after all the blocks in
	33	* the ordered extent are on disk
	34	*/
	35	struct btrfs_sector_sum {
	36	/* bytenr on disk */
	37	u64 bytenr;
	38	u32 sum;
	39	};
	40
	41	struct btrfs_ordered_sum {
	42	/* bytenr is the start of this extent on disk */
	43	u64 bytenr;
	44
	45	/*
	46	* this is the length in bytes covered by the sums array below.
	47	*/
	48	unsigned long len;
	49	struct list_head list;
	50	/* last field is a variable length array of btrfs_sector_sums */
	51	struct btrfs_sector_sum sums[];
	52	};
	53
	54	/*
	55	* bits for the flags field:
	56	*
	57	* BTRFS_ORDERED_IO_DONE is set when all of the blocks are written.
	58	* It is used to make sure metadata is inserted into the tree only once
	59	* per extent.
	60	*
	61	* BTRFS_ORDERED_COMPLETE is set when the extent is removed from the
	62	* rbtree, just before waking any waiters. It is used to indicate the
	63	* IO is done and any metadata is inserted into the tree.
	64	*/
	65	#define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */
	66
	67	#define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */
	68
	69	#define BTRFS_ORDERED_NOCOW 2 /* set when we want to write in place */
	70
	71	#define BTRFS_ORDERED_COMPRESSED 3 /* writing a zlib compressed extent */
	72
	73	#define BTRFS_ORDERED_PREALLOC 4 /* set when writing to prealloced extent */
	74
	75	#define BTRFS_ORDERED_DIRECT 5 /* set when we're doing DIO with this extent */
	76
	77	#define BTRFS_ORDERED_IOERR 6 /* We had an io error when writing this out */
	78
	79	#define BTRFS_ORDERED_UPDATED_ISIZE 7 /* indicates whether this ordered extent
	80	* has done its due diligence in updating
	81	* the isize. */
	82	#define BTRFS_ORDERED_LOGGED_CSUM 8 /* We've logged the csums on this ordered
	83	ordered extent */
	84
	85	struct btrfs_ordered_extent {
	86	/* logical offset in the file */
	87	u64 file_offset;
	88
	89	/* disk byte number */
	90	u64 start;
	91
	92	/* ram length of the extent in bytes */
	93	u64 len;
	94
	95	/* extent length on disk */
	96	u64 disk_len;
	97
	98	/* number of bytes that still need writing */
	99	u64 bytes_left;
	100
	101	/* number of bytes that still need csumming */
	102	u64 csum_bytes_left;
	103
	104	/*
	105	* the end of the ordered extent which is behind it but
	106	* didn't update disk_i_size. Please see the comment of
	107	* btrfs_ordered_update_i_size();
	108	*/
	109	u64 outstanding_isize;
	110
	111	/* flags (described above) */
	112	unsigned long flags;
	113
	114	/* compression algorithm */
	115	int compress_type;
	116
	117	/* reference count */
	118	atomic_t refs;
	119
	120	/* the inode we belong to */
	121	struct inode *inode;
	122
	123	/* list of checksums for insertion when the extent io is done */
	124	struct list_head list;
	125
	126	/* If we need to wait on this to be done */
	127	struct list_head log_list;
	128
	129	/* used to wait for the BTRFS_ORDERED_COMPLETE bit */
	130	wait_queue_head_t wait;
	131
	132	/* our friendly rbtree entry */
	133	struct rb_node rb_node;
	134
	135	/* a per root list of all the pending ordered extents */
	136	struct list_head root_extent_list;
	137
	138	struct btrfs_work work;
	139
	140	struct completion completion;
	141	struct btrfs_work flush_work;
	142	struct list_head work_list;
	143	};
	144
	145	/*
	146	* calculates the total size you need to allocate for an ordered sum
	147	* structure spanning 'bytes' in the file
	148	*/
	149	static inline int btrfs_ordered_sum_size(struct btrfs_root *root,
	150	unsigned long bytes)
	151	{
	152	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
	153	root->sectorsize;
	154	num_sectors++;
	155	return sizeof(struct btrfs_ordered_sum) +
	156	num_sectors * sizeof(struct btrfs_sector_sum);
	157	}
	158
	159	static inline void
	160	btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
	161	{
	162	spin_lock_init(&t->lock);
	163	t->tree = RB_ROOT;
	164	t->last = NULL;
	165	}
	166
	167	void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
	168	void btrfs_remove_ordered_extent(struct inode *inode,
	169	struct btrfs_ordered_extent *entry);
	170	int btrfs_dec_test_ordered_pending(struct inode *inode,
	171	struct btrfs_ordered_extent **cached,
	172	u64 file_offset, u64 io_size, int uptodate);
	173	int btrfs_dec_test_first_ordered_pending(struct inode *inode,
	174	struct btrfs_ordered_extent **cached,
	175	u64 *file_offset, u64 io_size,
	176	int uptodate);
	177	int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
	178	u64 start, u64 len, u64 disk_len, int type);
	179	int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
	180	u64 start, u64 len, u64 disk_len, int type);
	181	int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
	182	u64 start, u64 len, u64 disk_len,
	183	int type, int compress_type);
	184	void btrfs_add_ordered_sum(struct inode *inode,
	185	struct btrfs_ordered_extent *entry,
	186	struct btrfs_ordered_sum *sum);
	187	struct btrfs_ordered_extent btrfs_lookup_ordered_extent(struct inode inode,
	188	u64 file_offset);
	189	void btrfs_start_ordered_extent(struct inode *inode,
	190	struct btrfs_ordered_extent *entry, int wait);
	191	void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
	192	struct btrfs_ordered_extent *
	193	btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
	194	struct btrfs_ordered_extent btrfs_lookup_ordered_range(struct inode inode,
	195	u64 file_offset,
	196	u64 len);
	197	int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
	198	struct btrfs_ordered_extent *ordered);
	199	int btrfs_find_ordered_sum(struct inode inode, u64 offset, u64 disk_bytenr, u32 sum);
	200	int btrfs_run_ordered_operations(struct btrfs_trans_handle *trans,
	201	struct btrfs_root *root, int wait);
	202	void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans,
	203	struct btrfs_root *root,
	204	struct inode *inode);
	205	void btrfs_wait_ordered_extents(struct btrfs_root *root, int delay_iput);
	206	void btrfs_get_logged_extents(struct btrfs_root log, struct inode inode);
	207	void btrfs_wait_logged_extents(struct btrfs_root *log, u64 transid);
	208	void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid);
	209	int __init ordered_data_init(void);
	210	void ordered_data_exit(void);
	211	#endif