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 | ||
eb84ae03 | 22 | /* one of these per inode */ |
dc17ff8f | 23 | struct btrfs_ordered_inode_tree { |
e6dcd2dc | 24 | struct mutex mutex; |
dc17ff8f | 25 | struct rb_root tree; |
e6dcd2dc | 26 | struct rb_node *last; |
dc17ff8f CM |
27 | }; |
28 | ||
eb84ae03 CM |
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 | */ | |
e6dcd2dc | 35 | struct btrfs_sector_sum { |
d20f7043 CM |
36 | /* bytenr on disk */ |
37 | u64 bytenr; | |
e6dcd2dc CM |
38 | u32 sum; |
39 | }; | |
40 | ||
41 | struct btrfs_ordered_sum { | |
d20f7043 CM |
42 | /* bytenr is the start of this extent on disk */ |
43 | u64 bytenr; | |
44 | ||
3edf7d33 CM |
45 | /* |
46 | * this is the length in bytes covered by the sums array below. | |
3edf7d33 CM |
47 | */ |
48 | unsigned long len; | |
e6dcd2dc | 49 | struct list_head list; |
eb84ae03 | 50 | /* last field is a variable length array of btrfs_sector_sums */ |
ed98b56a | 51 | struct btrfs_sector_sum sums[]; |
e6dcd2dc CM |
52 | }; |
53 | ||
eb84ae03 CM |
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 | */ | |
e6dcd2dc | 65 | #define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */ |
eb84ae03 | 66 | |
e6dcd2dc | 67 | #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */ |
e6dcd2dc | 68 | |
7ea394f1 YZ |
69 | #define BTRFS_ORDERED_NOCOW 2 /* set when we want to write in place */ |
70 | ||
c8b97818 CM |
71 | #define BTRFS_ORDERED_COMPRESSED 3 /* writing a compressed extent */ |
72 | ||
d899e052 YZ |
73 | #define BTRFS_ORDERED_PREALLOC 4 /* set when writing to prealloced extent */ |
74 | ||
e6dcd2dc | 75 | struct btrfs_ordered_extent { |
eb84ae03 | 76 | /* logical offset in the file */ |
e6dcd2dc | 77 | u64 file_offset; |
eb84ae03 CM |
78 | |
79 | /* disk byte number */ | |
e6dcd2dc | 80 | u64 start; |
eb84ae03 | 81 | |
c8b97818 | 82 | /* ram length of the extent in bytes */ |
e6dcd2dc | 83 | u64 len; |
eb84ae03 | 84 | |
c8b97818 CM |
85 | /* extent length on disk */ |
86 | u64 disk_len; | |
87 | ||
eb84ae03 | 88 | /* flags (described above) */ |
e6dcd2dc | 89 | unsigned long flags; |
eb84ae03 CM |
90 | |
91 | /* reference count */ | |
e6dcd2dc | 92 | atomic_t refs; |
eb84ae03 | 93 | |
3eaa2885 CM |
94 | /* the inode we belong to */ |
95 | struct inode *inode; | |
96 | ||
eb84ae03 | 97 | /* list of checksums for insertion when the extent io is done */ |
e6dcd2dc | 98 | struct list_head list; |
eb84ae03 CM |
99 | |
100 | /* used to wait for the BTRFS_ORDERED_COMPLETE bit */ | |
e6dcd2dc | 101 | wait_queue_head_t wait; |
eb84ae03 CM |
102 | |
103 | /* our friendly rbtree entry */ | |
e6dcd2dc | 104 | struct rb_node rb_node; |
3eaa2885 CM |
105 | |
106 | /* a per root list of all the pending ordered extents */ | |
107 | struct list_head root_extent_list; | |
e6dcd2dc CM |
108 | }; |
109 | ||
110 | ||
eb84ae03 CM |
111 | /* |
112 | * calculates the total size you need to allocate for an ordered sum | |
113 | * structure spanning 'bytes' in the file | |
114 | */ | |
9ba4611a CM |
115 | static inline int btrfs_ordered_sum_size(struct btrfs_root *root, |
116 | unsigned long bytes) | |
e6dcd2dc CM |
117 | { |
118 | unsigned long num_sectors = (bytes + root->sectorsize - 1) / | |
119 | root->sectorsize; | |
3edf7d33 | 120 | num_sectors++; |
e6dcd2dc CM |
121 | return sizeof(struct btrfs_ordered_sum) + |
122 | num_sectors * sizeof(struct btrfs_sector_sum); | |
123 | } | |
124 | ||
dc17ff8f CM |
125 | static inline void |
126 | btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) | |
127 | { | |
e6dcd2dc | 128 | mutex_init(&t->mutex); |
dc17ff8f | 129 | t->tree.rb_node = NULL; |
e6dcd2dc | 130 | t->last = NULL; |
dc17ff8f CM |
131 | } |
132 | ||
e6dcd2dc CM |
133 | int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry); |
134 | int btrfs_remove_ordered_extent(struct inode *inode, | |
135 | struct btrfs_ordered_extent *entry); | |
136 | int btrfs_dec_test_ordered_pending(struct inode *inode, | |
137 | u64 file_offset, u64 io_size); | |
138 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, | |
d899e052 | 139 | u64 start, u64 len, u64 disk_len, int tyep); |
3edf7d33 CM |
140 | int btrfs_add_ordered_sum(struct inode *inode, |
141 | struct btrfs_ordered_extent *entry, | |
142 | struct btrfs_ordered_sum *sum); | |
e6dcd2dc CM |
143 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
144 | u64 file_offset); | |
eb84ae03 CM |
145 | void btrfs_start_ordered_extent(struct inode *inode, |
146 | struct btrfs_ordered_extent *entry, int wait); | |
cb843a6f | 147 | int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len); |
e6dcd2dc CM |
148 | struct btrfs_ordered_extent * |
149 | btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset); | |
dbe674a9 CM |
150 | int btrfs_ordered_update_i_size(struct inode *inode, |
151 | struct btrfs_ordered_extent *ordered); | |
d20f7043 | 152 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, u32 *sum); |
f421950f CM |
153 | int btrfs_wait_on_page_writeback_range(struct address_space *mapping, |
154 | pgoff_t start, pgoff_t end); | |
155 | int btrfs_fdatawrite_range(struct address_space *mapping, loff_t start, | |
156 | loff_t end, int sync_mode); | |
7ea394f1 | 157 | int btrfs_wait_ordered_extents(struct btrfs_root *root, int nocow_only); |
5a3f23d5 CM |
158 | int btrfs_run_ordered_operations(struct btrfs_root *root, int wait); |
159 | int btrfs_add_ordered_operation(struct btrfs_trans_handle *trans, | |
160 | struct btrfs_root *root, | |
161 | struct inode *inode); | |
dc17ff8f | 162 | #endif |