[linux-2.6-block.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__

struct btrfs_ordered_inode_tree {
	struct mutex mutex;
	struct rb_root tree;
	struct rb_node *last;
};

struct btrfs_sector_sum {
	u64 offset;
	u32 sum;
};

struct btrfs_ordered_sum {
	u64 file_offset;
	u64 len;
	struct list_head list;
	struct btrfs_sector_sum sums;
};

/* bits for the flags field */
#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_START 2 /* set when tree setup */

struct btrfs_ordered_extent {
	u64 file_offset;
	u64 start;
	u64 len;
	unsigned long flags;
	atomic_t refs;
	struct list_head list;
	struct inode *inode;
	wait_queue_head_t wait;
	struct rb_node rb_node;
};


static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes)
{
	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
		root->sectorsize;
	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)
{
	mutex_init(&t->mutex);
	t->tree.rb_node = NULL;
	t->last = NULL;
}

int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
int btrfs_remove_ordered_extent(struct inode *inode,
				struct btrfs_ordered_extent *entry);
int btrfs_dec_test_ordered_pending(struct inode *inode,
				       u64 file_offset, u64 io_size);
int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
			     u64 start, u64 len);
int btrfs_add_ordered_sum(struct inode *inode, struct btrfs_ordered_sum *sum);
struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
							 u64 file_offset);
void btrfs_wait_ordered_extent(struct inode *inode,
			       struct btrfs_ordered_extent *entry);
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);
int btrfs_add_ordered_pending(struct inode *inode,
			      struct btrfs_ordered_extent *ordered,
			      u64 start, u64 len);
#endif
Commit	Line	Data
dc17ff8f CM	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	struct btrfs_ordered_inode_tree {
e6dcd2dc	23	struct mutex mutex;
dc17ff8f	24	struct rb_root tree;
e6dcd2dc	25	struct rb_node *last;
dc17ff8f CM	26	};
dc17ff8f CM	27
e6dcd2dc CM	28	struct btrfs_sector_sum {
	29	u64 offset;
	30	u32 sum;
	31	};
	32
	33	struct btrfs_ordered_sum {
	34	u64 file_offset;
	35	u64 len;
	36	struct list_head list;
	37	struct btrfs_sector_sum sums;
	38	};
	39
	40	/* bits for the flags field */
	41	#define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */
	42	#define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */
	43	#define BTRFS_ORDERED_START 2 /* set when tree setup */
	44
	45	struct btrfs_ordered_extent {
	46	u64 file_offset;
	47	u64 start;
	48	u64 len;
	49	unsigned long flags;
	50	atomic_t refs;
	51	struct list_head list;
	52	struct inode *inode;
	53	wait_queue_head_t wait;
	54	struct rb_node rb_node;
	55	};
	56
	57
	58	static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes)
	59	{
	60	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
	61	root->sectorsize;
	62	return sizeof(struct btrfs_ordered_sum) +
	63	num_sectors * sizeof(struct btrfs_sector_sum);
	64	}
	65
dc17ff8f CM	66	static inline void
	67	btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
	68	{
e6dcd2dc	69	mutex_init(&t->mutex);
dc17ff8f	70	t->tree.rb_node = NULL;
e6dcd2dc	71	t->last = NULL;
dc17ff8f CM	72	}
dc17ff8f CM	73
e6dcd2dc CM	74	int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
	75	int btrfs_remove_ordered_extent(struct inode *inode,
	76	struct btrfs_ordered_extent *entry);
	77	int btrfs_dec_test_ordered_pending(struct inode *inode,
	78	u64 file_offset, u64 io_size);
	79	int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
	80	u64 start, u64 len);
	81	int btrfs_add_ordered_sum(struct inode inode, struct btrfs_ordered_sum sum);
	82	struct btrfs_ordered_extent btrfs_lookup_ordered_extent(struct inode inode,
	83	u64 file_offset);
	84	void btrfs_wait_ordered_extent(struct inode *inode,
	85	struct btrfs_ordered_extent *entry);
	86	void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
	87	struct btrfs_ordered_extent *
	88	btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
	89	int btrfs_add_ordered_pending(struct inode *inode,
	90	struct btrfs_ordered_extent *ordered,
	91	u64 start, u64 len);
dc17ff8f	92	#endif