xref: /openbmc/linux/fs/btrfs/ordered-data.h (revision 95e9fd10)
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 wether this ordered extent
80 				       * has done its due diligence in updating
81 				       * the isize. */
82 
83 struct btrfs_ordered_extent {
84 	/* logical offset in the file */
85 	u64 file_offset;
86 
87 	/* disk byte number */
88 	u64 start;
89 
90 	/* ram length of the extent in bytes */
91 	u64 len;
92 
93 	/* extent length on disk */
94 	u64 disk_len;
95 
96 	/* number of bytes that still need writing */
97 	u64 bytes_left;
98 
99 	/* flags (described above) */
100 	unsigned long flags;
101 
102 	/* compression algorithm */
103 	int compress_type;
104 
105 	/* reference count */
106 	atomic_t refs;
107 
108 	/* the inode we belong to */
109 	struct inode *inode;
110 
111 	/* list of checksums for insertion when the extent io is done */
112 	struct list_head list;
113 
114 	/* used to wait for the BTRFS_ORDERED_COMPLETE bit */
115 	wait_queue_head_t wait;
116 
117 	/* our friendly rbtree entry */
118 	struct rb_node rb_node;
119 
120 	/* a per root list of all the pending ordered extents */
121 	struct list_head root_extent_list;
122 
123 	struct btrfs_work work;
124 };
125 
126 
127 /*
128  * calculates the total size you need to allocate for an ordered sum
129  * structure spanning 'bytes' in the file
130  */
131 static inline int btrfs_ordered_sum_size(struct btrfs_root *root,
132 					 unsigned long bytes)
133 {
134 	unsigned long num_sectors = (bytes + root->sectorsize - 1) /
135 		root->sectorsize;
136 	num_sectors++;
137 	return sizeof(struct btrfs_ordered_sum) +
138 		num_sectors * sizeof(struct btrfs_sector_sum);
139 }
140 
141 static inline void
142 btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
143 {
144 	spin_lock_init(&t->lock);
145 	t->tree = RB_ROOT;
146 	t->last = NULL;
147 }
148 
149 void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
150 void btrfs_remove_ordered_extent(struct inode *inode,
151 				struct btrfs_ordered_extent *entry);
152 int btrfs_dec_test_ordered_pending(struct inode *inode,
153 				   struct btrfs_ordered_extent **cached,
154 				   u64 file_offset, u64 io_size, int uptodate);
155 int btrfs_dec_test_first_ordered_pending(struct inode *inode,
156 				   struct btrfs_ordered_extent **cached,
157 				   u64 *file_offset, u64 io_size,
158 				   int uptodate);
159 int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
160 			     u64 start, u64 len, u64 disk_len, int type);
161 int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
162 				 u64 start, u64 len, u64 disk_len, int type);
163 int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
164 				      u64 start, u64 len, u64 disk_len,
165 				      int type, int compress_type);
166 void btrfs_add_ordered_sum(struct inode *inode,
167 			   struct btrfs_ordered_extent *entry,
168 			   struct btrfs_ordered_sum *sum);
169 struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
170 							 u64 file_offset);
171 void btrfs_start_ordered_extent(struct inode *inode,
172 				struct btrfs_ordered_extent *entry, int wait);
173 void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
174 struct btrfs_ordered_extent *
175 btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
176 struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode,
177 							u64 file_offset,
178 							u64 len);
179 int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
180 				struct btrfs_ordered_extent *ordered);
181 int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, u32 *sum);
182 void btrfs_run_ordered_operations(struct btrfs_root *root, int wait);
183 void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans,
184 				 struct btrfs_root *root,
185 				 struct inode *inode);
186 void btrfs_wait_ordered_extents(struct btrfs_root *root,
187 				int nocow_only, int delay_iput);
188 #endif
189