2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
19 #ifndef __BTRFS_ORDERED_DATA__
20 #define __BTRFS_ORDERED_DATA__
22 /* one of these per inode */
23 struct btrfs_ordered_inode_tree {
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
35 struct btrfs_sector_sum {
40 struct btrfs_ordered_sum {
43 * this is the length in bytes covered by the sums array below.
44 * But, the sums array may not be contiguous in the file.
47 struct list_head list;
48 /* last field is a variable length array of btrfs_sector_sums */
49 struct btrfs_sector_sum sums;
53 * bits for the flags field:
55 * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written.
56 * It is used to make sure metadata is inserted into the tree only once
59 * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the
60 * rbtree, just before waking any waiters. It is used to indicate the
61 * 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 */
65 #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */
67 struct btrfs_ordered_extent {
68 /* logical offset in the file */
71 /* disk byte number */
74 /* length of the extent in bytes */
77 /* flags (described above) */
83 /* list of checksums for insertion when the extent io is done */
84 struct list_head list;
86 /* used to wait for the BTRFS_ORDERED_COMPLETE bit */
87 wait_queue_head_t wait;
89 /* our friendly rbtree entry */
90 struct rb_node rb_node;
95 * calculates the total size you need to allocate for an ordered sum
96 * structure spanning 'bytes' in the file
98 static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes)
100 unsigned long num_sectors = (bytes + root->sectorsize - 1) /
103 return sizeof(struct btrfs_ordered_sum) +
104 num_sectors * sizeof(struct btrfs_sector_sum);
108 btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
110 mutex_init(&t->mutex);
111 t->tree.rb_node = NULL;
115 int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
116 int btrfs_remove_ordered_extent(struct inode *inode,
117 struct btrfs_ordered_extent *entry);
118 int btrfs_dec_test_ordered_pending(struct inode *inode,
119 u64 file_offset, u64 io_size);
120 int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
122 int btrfs_add_ordered_sum(struct inode *inode,
123 struct btrfs_ordered_extent *entry,
124 struct btrfs_ordered_sum *sum);
125 struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
127 void btrfs_start_ordered_extent(struct inode *inode,
128 struct btrfs_ordered_extent *entry, int wait);
129 void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
130 struct btrfs_ordered_extent *
131 btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
132 int btrfs_ordered_update_i_size(struct inode *inode,
133 struct btrfs_ordered_extent *ordered);
134 int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u32 *sum);
135 int btrfs_wait_on_page_writeback_range(struct address_space *mapping,
136 pgoff_t start, pgoff_t end);
137 int btrfs_fdatawrite_range(struct address_space *mapping, loff_t start,
138 loff_t end, int sync_mode);