ordered-data.h 4.3 KB
Newer Older
C
Chris Mason 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
/*
 * 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__

22
/* one of these per inode */
C
Chris Mason 已提交
23
struct btrfs_ordered_inode_tree {
24
	struct mutex mutex;
C
Chris Mason 已提交
25
	struct rb_root tree;
26
	struct rb_node *last;
C
Chris Mason 已提交
27 28
};

29 30 31 32 33 34
/*
 * 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
 */
35 36 37 38 39 40 41
struct btrfs_sector_sum {
	u64 offset;
	u32 sum;
};

struct btrfs_ordered_sum {
	u64 file_offset;
42 43 44 45 46
	/*
	 * this is the length in bytes covered by the sums array below.
	 * But, the sums array may not be contiguous in the file.
	 */
	unsigned long len;
47
	struct list_head list;
48
	/* last field is a variable length array of btrfs_sector_sums */
49 50 51
	struct btrfs_sector_sum sums;
};

52 53 54 55 56 57 58 59 60 61 62
/*
 * 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.
 */
63
#define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */
64

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

struct btrfs_ordered_extent {
68
	/* logical offset in the file */
69
	u64 file_offset;
70 71

	/* disk byte number */
72
	u64 start;
73 74

	/* length of the extent in bytes */
75
	u64 len;
76 77

	/* flags (described above) */
78
	unsigned long flags;
79 80

	/* reference count */
81
	atomic_t refs;
82 83

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

	/* used to wait for the BTRFS_ORDERED_COMPLETE bit */
87
	wait_queue_head_t wait;
88 89

	/* our friendly rbtree entry */
90 91 92 93
	struct rb_node rb_node;
};


94 95 96 97
/*
 * calculates the total size you need to allocate for an ordered sum
 * structure spanning 'bytes' in the file
 */
98 99 100 101
static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes)
{
	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
		root->sectorsize;
102
	num_sectors++;
103 104 105 106
	return sizeof(struct btrfs_ordered_sum) +
		num_sectors * sizeof(struct btrfs_sector_sum);
}

C
Chris Mason 已提交
107 108 109
static inline void
btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
{
110
	mutex_init(&t->mutex);
C
Chris Mason 已提交
111
	t->tree.rb_node = NULL;
112
	t->last = NULL;
C
Chris Mason 已提交
113 114
}

115 116 117 118 119 120 121
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);
122 123 124
int btrfs_add_ordered_sum(struct inode *inode,
			  struct btrfs_ordered_extent *entry,
			  struct btrfs_ordered_sum *sum);
125 126
struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
							 u64 file_offset);
127 128
void btrfs_start_ordered_extent(struct inode *inode,
				struct btrfs_ordered_extent *entry, int wait);
129 130 131
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);
132 133
int btrfs_ordered_update_i_size(struct inode *inode,
				struct btrfs_ordered_extent *ordered);
134
int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum);
135 136 137 138
int btrfs_wait_on_page_writeback_range(struct address_space *mapping,
				       pgoff_t start, pgoff_t end);
int btrfs_fdatawrite_range(struct address_space *mapping, loff_t start,
			   loff_t end, int sync_mode);
C
Chris Mason 已提交
139
#endif