]>
Commit | Line | Data |
---|---|---|
6cbd5570 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 | ||
e20d96d6 | 19 | #include <linux/fs.h> |
d98237b3 | 20 | #include <linux/blkdev.h> |
11bd143f | 21 | #include <linux/crc32c.h> |
87cbda5c | 22 | #include <linux/scatterlist.h> |
22b0ebda | 23 | #include <linux/swap.h> |
0f7d52f4 | 24 | #include <linux/radix-tree.h> |
35b7e476 | 25 | #include <linux/writeback.h> |
5f39d397 | 26 | #include <linux/buffer_head.h> // for block_sync_page |
eb60ceac CM |
27 | #include "ctree.h" |
28 | #include "disk-io.h" | |
e089f05c | 29 | #include "transaction.h" |
0f7d52f4 | 30 | #include "btrfs_inode.h" |
db94535d | 31 | #include "print-tree.h" |
eb60ceac | 32 | |
5f39d397 CM |
33 | #if 0 |
34 | static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf) | |
7eccb903 | 35 | { |
5f39d397 CM |
36 | if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) { |
37 | printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n", | |
38 | (unsigned long long)extent_buffer_blocknr(buf), | |
39 | (unsigned long long)btrfs_header_blocknr(buf)); | |
39279cc3 | 40 | return 1; |
d98237b3 | 41 | } |
9a8dd150 | 42 | return 0; |
eb60ceac | 43 | } |
5f39d397 | 44 | #endif |
eb60ceac | 45 | |
d1310b2e | 46 | static struct extent_io_ops btree_extent_io_ops; |
0da5468f | 47 | |
5f39d397 | 48 | struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root, |
db94535d | 49 | u64 bytenr, u32 blocksize) |
d98237b3 | 50 | { |
5f39d397 | 51 | struct inode *btree_inode = root->fs_info->btree_inode; |
f510cfec | 52 | struct extent_buffer *eb; |
d1310b2e | 53 | eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree, |
db94535d | 54 | bytenr, blocksize, GFP_NOFS); |
f510cfec | 55 | return eb; |
5f39d397 | 56 | } |
d98237b3 | 57 | |
5f39d397 | 58 | struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root, |
db94535d | 59 | u64 bytenr, u32 blocksize) |
5f39d397 CM |
60 | { |
61 | struct inode *btree_inode = root->fs_info->btree_inode; | |
f510cfec | 62 | struct extent_buffer *eb; |
db94535d | 63 | |
d1310b2e | 64 | eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree, |
19c00ddc | 65 | bytenr, blocksize, NULL, GFP_NOFS); |
f510cfec | 66 | return eb; |
d98237b3 CM |
67 | } |
68 | ||
5f39d397 | 69 | struct extent_map *btree_get_extent(struct inode *inode, struct page *page, |
d1310b2e | 70 | size_t page_offset, u64 start, u64 len, |
5f39d397 | 71 | int create) |
7eccb903 | 72 | { |
5f39d397 CM |
73 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
74 | struct extent_map *em; | |
75 | int ret; | |
76 | ||
77 | again: | |
d1310b2e CM |
78 | spin_lock(&em_tree->lock); |
79 | em = lookup_extent_mapping(em_tree, start, len); | |
80 | spin_unlock(&em_tree->lock); | |
5f39d397 CM |
81 | if (em) { |
82 | goto out; | |
7eccb903 | 83 | } |
5f39d397 CM |
84 | em = alloc_extent_map(GFP_NOFS); |
85 | if (!em) { | |
86 | em = ERR_PTR(-ENOMEM); | |
87 | goto out; | |
88 | } | |
89 | em->start = 0; | |
d1310b2e | 90 | em->len = i_size_read(inode); |
5f39d397 | 91 | em->block_start = 0; |
5f39d397 | 92 | em->bdev = inode->i_sb->s_bdev; |
d1310b2e CM |
93 | |
94 | spin_lock(&em_tree->lock); | |
5f39d397 | 95 | ret = add_extent_mapping(em_tree, em); |
d1310b2e CM |
96 | spin_unlock(&em_tree->lock); |
97 | ||
5f39d397 CM |
98 | if (ret == -EEXIST) { |
99 | free_extent_map(em); | |
100 | em = NULL; | |
101 | goto again; | |
102 | } else if (ret) { | |
103 | em = ERR_PTR(ret); | |
104 | } | |
105 | out: | |
106 | return em; | |
7eccb903 CM |
107 | } |
108 | ||
19c00ddc CM |
109 | u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len) |
110 | { | |
111 | return crc32c(seed, data, len); | |
112 | } | |
113 | ||
114 | void btrfs_csum_final(u32 crc, char *result) | |
115 | { | |
116 | *(__le32 *)result = ~cpu_to_le32(crc); | |
117 | } | |
118 | ||
119 | static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf, | |
120 | int verify) | |
121 | { | |
122 | char result[BTRFS_CRC32_SIZE]; | |
123 | unsigned long len; | |
124 | unsigned long cur_len; | |
125 | unsigned long offset = BTRFS_CSUM_SIZE; | |
126 | char *map_token = NULL; | |
127 | char *kaddr; | |
128 | unsigned long map_start; | |
129 | unsigned long map_len; | |
130 | int err; | |
131 | u32 crc = ~(u32)0; | |
132 | ||
133 | len = buf->len - offset; | |
134 | while(len > 0) { | |
135 | err = map_private_extent_buffer(buf, offset, 32, | |
136 | &map_token, &kaddr, | |
137 | &map_start, &map_len, KM_USER0); | |
138 | if (err) { | |
139 | printk("failed to map extent buffer! %lu\n", | |
140 | offset); | |
141 | return 1; | |
142 | } | |
143 | cur_len = min(len, map_len - (offset - map_start)); | |
144 | crc = btrfs_csum_data(root, kaddr + offset - map_start, | |
145 | crc, cur_len); | |
146 | len -= cur_len; | |
147 | offset += cur_len; | |
148 | unmap_extent_buffer(buf, map_token, KM_USER0); | |
149 | } | |
150 | btrfs_csum_final(crc, result); | |
151 | ||
152 | if (verify) { | |
e4204ded CM |
153 | int from_this_trans = 0; |
154 | ||
155 | if (root->fs_info->running_transaction && | |
156 | btrfs_header_generation(buf) == | |
157 | root->fs_info->running_transaction->transid) | |
158 | from_this_trans = 1; | |
159 | ||
160 | /* FIXME, this is not good */ | |
161 | if (from_this_trans == 0 && | |
162 | memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) { | |
163 | u32 val; | |
164 | u32 found = 0; | |
165 | memcpy(&found, result, BTRFS_CRC32_SIZE); | |
166 | ||
167 | read_extent_buffer(buf, &val, 0, BTRFS_CRC32_SIZE); | |
168 | printk("btrfs: %s checksum verify failed on %llu " | |
169 | "wanted %X found %X from_this_trans %d\n", | |
19c00ddc | 170 | root->fs_info->sb->s_id, |
e4204ded | 171 | buf->start, val, found, from_this_trans); |
19c00ddc CM |
172 | return 1; |
173 | } | |
174 | } else { | |
175 | write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE); | |
176 | } | |
177 | return 0; | |
178 | } | |
179 | ||
180 | ||
181 | int csum_dirty_buffer(struct btrfs_root *root, struct page *page) | |
182 | { | |
d1310b2e | 183 | struct extent_io_tree *tree; |
35ebb934 | 184 | u64 start = (u64)page->index << PAGE_CACHE_SHIFT; |
19c00ddc CM |
185 | u64 found_start; |
186 | int found_level; | |
187 | unsigned long len; | |
188 | struct extent_buffer *eb; | |
d1310b2e | 189 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
19c00ddc CM |
190 | |
191 | if (page->private == EXTENT_PAGE_PRIVATE) | |
192 | goto out; | |
193 | if (!page->private) | |
194 | goto out; | |
195 | len = page->private >> 2; | |
196 | if (len == 0) { | |
197 | WARN_ON(1); | |
198 | } | |
199 | eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS); | |
200 | read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1); | |
e18e4809 | 201 | btrfs_clear_buffer_defrag(eb); |
19c00ddc CM |
202 | found_start = btrfs_header_bytenr(eb); |
203 | if (found_start != start) { | |
204 | printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n", | |
205 | start, found_start, len); | |
55c69072 CM |
206 | WARN_ON(1); |
207 | goto err; | |
208 | } | |
209 | if (eb->first_page != page) { | |
210 | printk("bad first page %lu %lu\n", eb->first_page->index, | |
211 | page->index); | |
212 | WARN_ON(1); | |
213 | goto err; | |
214 | } | |
215 | if (!PageUptodate(page)) { | |
216 | printk("csum not up to date page %lu\n", page->index); | |
217 | WARN_ON(1); | |
218 | goto err; | |
19c00ddc CM |
219 | } |
220 | found_level = btrfs_header_level(eb); | |
221 | csum_tree_block(root, eb, 0); | |
55c69072 | 222 | err: |
19c00ddc CM |
223 | free_extent_buffer(eb); |
224 | out: | |
225 | return 0; | |
226 | } | |
227 | ||
0da5468f | 228 | static int btree_writepage_io_hook(struct page *page, u64 start, u64 end) |
d98237b3 | 229 | { |
19c00ddc | 230 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
19c00ddc CM |
231 | |
232 | csum_dirty_buffer(root, page); | |
0da5468f CM |
233 | return 0; |
234 | } | |
235 | ||
236 | static int btree_writepage(struct page *page, struct writeback_control *wbc) | |
237 | { | |
d1310b2e CM |
238 | struct extent_io_tree *tree; |
239 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
240 | return extent_write_full_page(tree, page, btree_get_extent, wbc); |
241 | } | |
0da5468f CM |
242 | |
243 | static int btree_writepages(struct address_space *mapping, | |
244 | struct writeback_control *wbc) | |
245 | { | |
d1310b2e CM |
246 | struct extent_io_tree *tree; |
247 | tree = &BTRFS_I(mapping->host)->io_tree; | |
d8d5f3e1 | 248 | if (wbc->sync_mode == WB_SYNC_NONE) { |
793955bc CM |
249 | u64 num_dirty; |
250 | u64 start = 0; | |
251 | unsigned long thresh = 96 * 1024 * 1024; | |
448d640b CM |
252 | |
253 | if (wbc->for_kupdate) | |
254 | return 0; | |
255 | ||
ca664626 CM |
256 | if (current_is_pdflush()) { |
257 | thresh = 96 * 1024 * 1024; | |
258 | } else { | |
259 | thresh = 8 * 1024 * 1024; | |
260 | } | |
1832a6d5 CM |
261 | num_dirty = count_range_bits(tree, &start, (u64)-1, |
262 | thresh, EXTENT_DIRTY); | |
793955bc CM |
263 | if (num_dirty < thresh) { |
264 | return 0; | |
265 | } | |
266 | } | |
0da5468f CM |
267 | return extent_writepages(tree, mapping, btree_get_extent, wbc); |
268 | } | |
269 | ||
5f39d397 CM |
270 | int btree_readpage(struct file *file, struct page *page) |
271 | { | |
d1310b2e CM |
272 | struct extent_io_tree *tree; |
273 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
274 | return extent_read_full_page(tree, page, btree_get_extent); |
275 | } | |
22b0ebda | 276 | |
70dec807 | 277 | static int btree_releasepage(struct page *page, gfp_t gfp_flags) |
5f39d397 | 278 | { |
d1310b2e CM |
279 | struct extent_io_tree *tree; |
280 | struct extent_map_tree *map; | |
5f39d397 | 281 | int ret; |
d98237b3 | 282 | |
d1310b2e CM |
283 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
284 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
70dec807 | 285 | ret = try_release_extent_mapping(map, tree, page, gfp_flags); |
5f39d397 CM |
286 | if (ret == 1) { |
287 | ClearPagePrivate(page); | |
288 | set_page_private(page, 0); | |
289 | page_cache_release(page); | |
290 | } | |
d98237b3 CM |
291 | return ret; |
292 | } | |
293 | ||
5f39d397 | 294 | static void btree_invalidatepage(struct page *page, unsigned long offset) |
d98237b3 | 295 | { |
d1310b2e CM |
296 | struct extent_io_tree *tree; |
297 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
298 | extent_invalidatepage(tree, page, offset); |
299 | btree_releasepage(page, GFP_NOFS); | |
d98237b3 CM |
300 | } |
301 | ||
5f39d397 | 302 | #if 0 |
d98237b3 | 303 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
ed2ff2cb | 304 | { |
87cbda5c | 305 | struct buffer_head *bh; |
0f7d52f4 | 306 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
87cbda5c | 307 | struct buffer_head *head; |
87cbda5c CM |
308 | if (!page_has_buffers(page)) { |
309 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, | |
310 | (1 << BH_Dirty)|(1 << BH_Uptodate)); | |
311 | } | |
312 | head = page_buffers(page); | |
313 | bh = head; | |
314 | do { | |
315 | if (buffer_dirty(bh)) | |
316 | csum_tree_block(root, bh, 0); | |
317 | bh = bh->b_this_page; | |
318 | } while (bh != head); | |
d98237b3 | 319 | return block_write_full_page(page, btree_get_block, wbc); |
ed2ff2cb | 320 | } |
5f39d397 | 321 | #endif |
eb60ceac | 322 | |
d98237b3 CM |
323 | static struct address_space_operations btree_aops = { |
324 | .readpage = btree_readpage, | |
325 | .writepage = btree_writepage, | |
0da5468f | 326 | .writepages = btree_writepages, |
5f39d397 CM |
327 | .releasepage = btree_releasepage, |
328 | .invalidatepage = btree_invalidatepage, | |
d98237b3 CM |
329 | .sync_page = block_sync_page, |
330 | }; | |
331 | ||
db94535d | 332 | int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize) |
090d1875 | 333 | { |
5f39d397 CM |
334 | struct extent_buffer *buf = NULL; |
335 | struct inode *btree_inode = root->fs_info->btree_inode; | |
de428b63 | 336 | int ret = 0; |
090d1875 | 337 | |
db94535d | 338 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 | 339 | if (!buf) |
090d1875 | 340 | return 0; |
d1310b2e | 341 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, |
19c00ddc | 342 | buf, 0, 0); |
5f39d397 | 343 | free_extent_buffer(buf); |
de428b63 | 344 | return ret; |
090d1875 CM |
345 | } |
346 | ||
db94535d CM |
347 | struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, |
348 | u32 blocksize) | |
eb60ceac | 349 | { |
5f39d397 CM |
350 | struct extent_buffer *buf = NULL; |
351 | struct inode *btree_inode = root->fs_info->btree_inode; | |
d1310b2e | 352 | struct extent_io_tree *io_tree; |
e4204ded | 353 | u64 end; |
19c00ddc CM |
354 | int ret; |
355 | ||
d1310b2e | 356 | io_tree = &BTRFS_I(btree_inode)->io_tree; |
5f39d397 | 357 | |
db94535d | 358 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 CM |
359 | if (!buf) |
360 | return NULL; | |
d1310b2e | 361 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, buf, 0, 1); |
e4204ded CM |
362 | |
363 | if (buf->flags & EXTENT_CSUM) | |
19c00ddc | 364 | return buf; |
e4204ded CM |
365 | |
366 | end = buf->start + PAGE_CACHE_SIZE - 1; | |
d1310b2e | 367 | if (test_range_bit(io_tree, buf->start, end, EXTENT_CSUM, 1)) { |
19c00ddc CM |
368 | buf->flags |= EXTENT_CSUM; |
369 | return buf; | |
370 | } | |
e4204ded | 371 | |
d1310b2e | 372 | lock_extent(io_tree, buf->start, end, GFP_NOFS); |
e4204ded | 373 | |
d1310b2e | 374 | if (test_range_bit(io_tree, buf->start, end, EXTENT_CSUM, 1)) { |
e4204ded CM |
375 | buf->flags |= EXTENT_CSUM; |
376 | goto out_unlock; | |
377 | } | |
378 | ||
19c00ddc | 379 | ret = csum_tree_block(root, buf, 1); |
d1310b2e | 380 | set_extent_bits(io_tree, buf->start, end, EXTENT_CSUM, GFP_NOFS); |
19c00ddc | 381 | buf->flags |= EXTENT_CSUM; |
e4204ded CM |
382 | |
383 | out_unlock: | |
d1310b2e | 384 | unlock_extent(io_tree, buf->start, end, GFP_NOFS); |
5f39d397 | 385 | return buf; |
eb60ceac CM |
386 | } |
387 | ||
e089f05c | 388 | int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5f39d397 | 389 | struct extent_buffer *buf) |
ed2ff2cb | 390 | { |
5f39d397 | 391 | struct inode *btree_inode = root->fs_info->btree_inode; |
55c69072 CM |
392 | if (btrfs_header_generation(buf) == |
393 | root->fs_info->running_transaction->transid) | |
d1310b2e | 394 | clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, |
55c69072 | 395 | buf); |
5f39d397 CM |
396 | return 0; |
397 | } | |
398 | ||
399 | int wait_on_tree_block_writeback(struct btrfs_root *root, | |
400 | struct extent_buffer *buf) | |
401 | { | |
402 | struct inode *btree_inode = root->fs_info->btree_inode; | |
d1310b2e | 403 | wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->io_tree, |
5f39d397 CM |
404 | buf); |
405 | return 0; | |
406 | } | |
407 | ||
db94535d | 408 | static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, |
87ee04eb | 409 | u32 stripesize, struct btrfs_root *root, |
9f5fae2f | 410 | struct btrfs_fs_info *fs_info, |
e20d96d6 | 411 | u64 objectid) |
d97e63b6 | 412 | { |
cfaa7295 | 413 | root->node = NULL; |
0f7d52f4 | 414 | root->inode = NULL; |
a28ec197 | 415 | root->commit_root = NULL; |
db94535d CM |
416 | root->sectorsize = sectorsize; |
417 | root->nodesize = nodesize; | |
418 | root->leafsize = leafsize; | |
87ee04eb | 419 | root->stripesize = stripesize; |
123abc88 | 420 | root->ref_cows = 0; |
9f5fae2f | 421 | root->fs_info = fs_info; |
0f7d52f4 CM |
422 | root->objectid = objectid; |
423 | root->last_trans = 0; | |
1b05da2e CM |
424 | root->highest_inode = 0; |
425 | root->last_inode_alloc = 0; | |
58176a96 | 426 | root->name = NULL; |
4313b399 | 427 | root->in_sysfs = 0; |
3768f368 CM |
428 | memset(&root->root_key, 0, sizeof(root->root_key)); |
429 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
6702ed49 | 430 | memset(&root->defrag_progress, 0, sizeof(root->defrag_progress)); |
58176a96 JB |
431 | memset(&root->root_kobj, 0, sizeof(root->root_kobj)); |
432 | init_completion(&root->kobj_unregister); | |
6702ed49 CM |
433 | root->defrag_running = 0; |
434 | root->defrag_level = 0; | |
4d775673 | 435 | root->root_key.objectid = objectid; |
3768f368 CM |
436 | return 0; |
437 | } | |
438 | ||
db94535d | 439 | static int find_and_setup_root(struct btrfs_root *tree_root, |
9f5fae2f CM |
440 | struct btrfs_fs_info *fs_info, |
441 | u64 objectid, | |
e20d96d6 | 442 | struct btrfs_root *root) |
3768f368 CM |
443 | { |
444 | int ret; | |
db94535d | 445 | u32 blocksize; |
3768f368 | 446 | |
db94535d | 447 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
448 | tree_root->sectorsize, tree_root->stripesize, |
449 | root, fs_info, objectid); | |
3768f368 CM |
450 | ret = btrfs_find_last_root(tree_root, objectid, |
451 | &root->root_item, &root->root_key); | |
452 | BUG_ON(ret); | |
453 | ||
db94535d CM |
454 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
455 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
456 | blocksize); | |
3768f368 | 457 | BUG_ON(!root->node); |
d97e63b6 CM |
458 | return 0; |
459 | } | |
460 | ||
5eda7b5e CM |
461 | struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info, |
462 | struct btrfs_key *location) | |
0f7d52f4 CM |
463 | { |
464 | struct btrfs_root *root; | |
465 | struct btrfs_root *tree_root = fs_info->tree_root; | |
466 | struct btrfs_path *path; | |
5f39d397 | 467 | struct extent_buffer *l; |
1b05da2e | 468 | u64 highest_inode; |
db94535d | 469 | u32 blocksize; |
0f7d52f4 CM |
470 | int ret = 0; |
471 | ||
5eda7b5e | 472 | root = kzalloc(sizeof(*root), GFP_NOFS); |
0cf6c620 | 473 | if (!root) |
0f7d52f4 | 474 | return ERR_PTR(-ENOMEM); |
0f7d52f4 | 475 | if (location->offset == (u64)-1) { |
db94535d | 476 | ret = find_and_setup_root(tree_root, fs_info, |
0f7d52f4 CM |
477 | location->objectid, root); |
478 | if (ret) { | |
0f7d52f4 CM |
479 | kfree(root); |
480 | return ERR_PTR(ret); | |
481 | } | |
482 | goto insert; | |
483 | } | |
484 | ||
db94535d | 485 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
486 | tree_root->sectorsize, tree_root->stripesize, |
487 | root, fs_info, location->objectid); | |
0f7d52f4 CM |
488 | |
489 | path = btrfs_alloc_path(); | |
490 | BUG_ON(!path); | |
491 | ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0); | |
492 | if (ret != 0) { | |
0f7d52f4 CM |
493 | if (ret > 0) |
494 | ret = -ENOENT; | |
495 | goto out; | |
496 | } | |
5f39d397 CM |
497 | l = path->nodes[0]; |
498 | read_extent_buffer(l, &root->root_item, | |
499 | btrfs_item_ptr_offset(l, path->slots[0]), | |
0f7d52f4 | 500 | sizeof(root->root_item)); |
44b36eb2 | 501 | memcpy(&root->root_key, location, sizeof(*location)); |
0f7d52f4 CM |
502 | ret = 0; |
503 | out: | |
504 | btrfs_release_path(root, path); | |
505 | btrfs_free_path(path); | |
506 | if (ret) { | |
507 | kfree(root); | |
508 | return ERR_PTR(ret); | |
509 | } | |
db94535d CM |
510 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
511 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
512 | blocksize); | |
0f7d52f4 CM |
513 | BUG_ON(!root->node); |
514 | insert: | |
0f7d52f4 | 515 | root->ref_cows = 1; |
5eda7b5e CM |
516 | ret = btrfs_find_highest_inode(root, &highest_inode); |
517 | if (ret == 0) { | |
518 | root->highest_inode = highest_inode; | |
519 | root->last_inode_alloc = highest_inode; | |
520 | } | |
521 | return root; | |
522 | } | |
523 | ||
dc17ff8f CM |
524 | struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info, |
525 | u64 root_objectid) | |
526 | { | |
527 | struct btrfs_root *root; | |
528 | ||
529 | if (root_objectid == BTRFS_ROOT_TREE_OBJECTID) | |
530 | return fs_info->tree_root; | |
531 | if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
532 | return fs_info->extent_root; | |
533 | ||
534 | root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
535 | (unsigned long)root_objectid); | |
536 | return root; | |
537 | } | |
538 | ||
edbd8d4e CM |
539 | struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info, |
540 | struct btrfs_key *location) | |
5eda7b5e CM |
541 | { |
542 | struct btrfs_root *root; | |
543 | int ret; | |
544 | ||
edbd8d4e CM |
545 | if (location->objectid == BTRFS_ROOT_TREE_OBJECTID) |
546 | return fs_info->tree_root; | |
547 | if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
548 | return fs_info->extent_root; | |
549 | ||
5eda7b5e CM |
550 | root = radix_tree_lookup(&fs_info->fs_roots_radix, |
551 | (unsigned long)location->objectid); | |
552 | if (root) | |
553 | return root; | |
554 | ||
555 | root = btrfs_read_fs_root_no_radix(fs_info, location); | |
556 | if (IS_ERR(root)) | |
557 | return root; | |
2619ba1f CM |
558 | ret = radix_tree_insert(&fs_info->fs_roots_radix, |
559 | (unsigned long)root->root_key.objectid, | |
0f7d52f4 CM |
560 | root); |
561 | if (ret) { | |
5f39d397 | 562 | free_extent_buffer(root->node); |
0f7d52f4 CM |
563 | kfree(root); |
564 | return ERR_PTR(ret); | |
565 | } | |
edbd8d4e CM |
566 | ret = btrfs_find_dead_roots(fs_info->tree_root, |
567 | root->root_key.objectid, root); | |
568 | BUG_ON(ret); | |
569 | ||
570 | return root; | |
571 | } | |
572 | ||
573 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info, | |
574 | struct btrfs_key *location, | |
575 | const char *name, int namelen) | |
576 | { | |
577 | struct btrfs_root *root; | |
578 | int ret; | |
579 | ||
580 | root = btrfs_read_fs_root_no_name(fs_info, location); | |
581 | if (!root) | |
582 | return NULL; | |
58176a96 | 583 | |
4313b399 CM |
584 | if (root->in_sysfs) |
585 | return root; | |
586 | ||
58176a96 JB |
587 | ret = btrfs_set_root_name(root, name, namelen); |
588 | if (ret) { | |
5f39d397 | 589 | free_extent_buffer(root->node); |
58176a96 JB |
590 | kfree(root); |
591 | return ERR_PTR(ret); | |
592 | } | |
593 | ||
594 | ret = btrfs_sysfs_add_root(root); | |
595 | if (ret) { | |
5f39d397 | 596 | free_extent_buffer(root->node); |
58176a96 JB |
597 | kfree(root->name); |
598 | kfree(root); | |
599 | return ERR_PTR(ret); | |
600 | } | |
4313b399 | 601 | root->in_sysfs = 1; |
0f7d52f4 CM |
602 | return root; |
603 | } | |
19c00ddc CM |
604 | #if 0 |
605 | static int add_hasher(struct btrfs_fs_info *info, char *type) { | |
606 | struct btrfs_hasher *hasher; | |
607 | ||
608 | hasher = kmalloc(sizeof(*hasher), GFP_NOFS); | |
609 | if (!hasher) | |
610 | return -ENOMEM; | |
611 | hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC); | |
612 | if (!hasher->hash_tfm) { | |
613 | kfree(hasher); | |
614 | return -EINVAL; | |
615 | } | |
616 | spin_lock(&info->hash_lock); | |
617 | list_add(&hasher->list, &info->hashers); | |
618 | spin_unlock(&info->hash_lock); | |
619 | return 0; | |
620 | } | |
621 | #endif | |
2c90e5d6 | 622 | struct btrfs_root *open_ctree(struct super_block *sb) |
2e635a27 | 623 | { |
db94535d CM |
624 | u32 sectorsize; |
625 | u32 nodesize; | |
626 | u32 leafsize; | |
627 | u32 blocksize; | |
87ee04eb | 628 | u32 stripesize; |
e20d96d6 CM |
629 | struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root), |
630 | GFP_NOFS); | |
631 | struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root), | |
632 | GFP_NOFS); | |
e20d96d6 CM |
633 | struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info), |
634 | GFP_NOFS); | |
eb60ceac | 635 | int ret; |
39279cc3 | 636 | int err = -EIO; |
2c90e5d6 | 637 | struct btrfs_super_block *disk_super; |
eb60ceac | 638 | |
39279cc3 CM |
639 | if (!extent_root || !tree_root || !fs_info) { |
640 | err = -ENOMEM; | |
641 | goto fail; | |
642 | } | |
0f7d52f4 | 643 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS); |
8fd17795 | 644 | INIT_LIST_HEAD(&fs_info->trans_list); |
facda1e7 | 645 | INIT_LIST_HEAD(&fs_info->dead_roots); |
19c00ddc CM |
646 | INIT_LIST_HEAD(&fs_info->hashers); |
647 | spin_lock_init(&fs_info->hash_lock); | |
1832a6d5 | 648 | spin_lock_init(&fs_info->delalloc_lock); |
cee36a03 | 649 | spin_lock_init(&fs_info->new_trans_lock); |
19c00ddc | 650 | |
58176a96 JB |
651 | memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj)); |
652 | init_completion(&fs_info->kobj_unregister); | |
2c90e5d6 | 653 | sb_set_blocksize(sb, 4096); |
9f5fae2f | 654 | fs_info->running_transaction = NULL; |
15ee9bc7 | 655 | fs_info->last_trans_committed = 0; |
9f5fae2f CM |
656 | fs_info->tree_root = tree_root; |
657 | fs_info->extent_root = extent_root; | |
e20d96d6 | 658 | fs_info->sb = sb; |
e2008b61 | 659 | fs_info->throttles = 0; |
b6cda9bc | 660 | fs_info->mount_opt = 0; |
c59f8951 | 661 | fs_info->max_extent = (u64)-1; |
1832a6d5 | 662 | fs_info->delalloc_bytes = 0; |
d98237b3 CM |
663 | fs_info->btree_inode = new_inode(sb); |
664 | fs_info->btree_inode->i_ino = 1; | |
2c90e5d6 | 665 | fs_info->btree_inode->i_nlink = 1; |
d98237b3 CM |
666 | fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size; |
667 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; | |
d1310b2e | 668 | extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree, |
5f39d397 CM |
669 | fs_info->btree_inode->i_mapping, |
670 | GFP_NOFS); | |
d1310b2e CM |
671 | extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree, |
672 | GFP_NOFS); | |
673 | ||
674 | BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops; | |
0da5468f | 675 | |
d1310b2e | 676 | extent_io_tree_init(&fs_info->free_space_cache, |
f510cfec | 677 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 678 | extent_io_tree_init(&fs_info->block_group_cache, |
96b5179d | 679 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 680 | extent_io_tree_init(&fs_info->pinned_extents, |
1a5bc167 | 681 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 682 | extent_io_tree_init(&fs_info->pending_del, |
1a5bc167 | 683 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 684 | extent_io_tree_init(&fs_info->extent_ins, |
1a5bc167 | 685 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
e66f709b | 686 | fs_info->do_barriers = 1; |
facda1e7 | 687 | fs_info->closing = 0; |
324ae4df | 688 | fs_info->total_pinned = 0; |
e18e4809 CM |
689 | fs_info->last_alloc = 0; |
690 | ||
6da6abae CM |
691 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) |
692 | INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info); | |
693 | #else | |
08607c1b | 694 | INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner); |
6da6abae | 695 | #endif |
0f7d52f4 CM |
696 | BTRFS_I(fs_info->btree_inode)->root = tree_root; |
697 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, | |
698 | sizeof(struct btrfs_key)); | |
22b0ebda | 699 | insert_inode_hash(fs_info->btree_inode); |
d98237b3 | 700 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
39279cc3 | 701 | |
79154b1b | 702 | mutex_init(&fs_info->trans_mutex); |
d561c025 | 703 | mutex_init(&fs_info->fs_mutex); |
3768f368 | 704 | |
19c00ddc CM |
705 | #if 0 |
706 | ret = add_hasher(fs_info, "crc32c"); | |
707 | if (ret) { | |
708 | printk("btrfs: failed hash setup, modprobe cryptomgr?\n"); | |
709 | err = -ENOMEM; | |
710 | goto fail_iput; | |
711 | } | |
712 | #endif | |
87ee04eb | 713 | __setup_root(512, 512, 512, 512, tree_root, |
2c90e5d6 | 714 | fs_info, BTRFS_ROOT_TREE_OBJECTID); |
7eccb903 | 715 | |
2c90e5d6 | 716 | fs_info->sb_buffer = read_tree_block(tree_root, |
db94535d CM |
717 | BTRFS_SUPER_INFO_OFFSET, |
718 | 512); | |
d98237b3 | 719 | |
0f7d52f4 | 720 | if (!fs_info->sb_buffer) |
39279cc3 | 721 | goto fail_iput; |
39279cc3 | 722 | |
5f39d397 CM |
723 | read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0, |
724 | sizeof(fs_info->super_copy)); | |
725 | ||
726 | read_extent_buffer(fs_info->sb_buffer, fs_info->fsid, | |
727 | (unsigned long)btrfs_super_fsid(fs_info->sb_buffer), | |
728 | BTRFS_FSID_SIZE); | |
729 | disk_super = &fs_info->super_copy; | |
0f7d52f4 | 730 | if (!btrfs_super_root(disk_super)) |
39279cc3 | 731 | goto fail_sb_buffer; |
0f7d52f4 | 732 | |
db94535d CM |
733 | nodesize = btrfs_super_nodesize(disk_super); |
734 | leafsize = btrfs_super_leafsize(disk_super); | |
735 | sectorsize = btrfs_super_sectorsize(disk_super); | |
87ee04eb | 736 | stripesize = btrfs_super_stripesize(disk_super); |
db94535d CM |
737 | tree_root->nodesize = nodesize; |
738 | tree_root->leafsize = leafsize; | |
739 | tree_root->sectorsize = sectorsize; | |
87ee04eb | 740 | tree_root->stripesize = stripesize; |
ff79f819 | 741 | sb_set_blocksize(sb, sectorsize); |
db94535d | 742 | |
8352d8a4 | 743 | i_size_write(fs_info->btree_inode, |
db94535d | 744 | btrfs_super_total_bytes(disk_super)); |
8352d8a4 | 745 | |
39279cc3 CM |
746 | if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC, |
747 | sizeof(disk_super->magic))) { | |
748 | printk("btrfs: valid FS not found on %s\n", sb->s_id); | |
749 | goto fail_sb_buffer; | |
750 | } | |
19c00ddc | 751 | |
db94535d CM |
752 | blocksize = btrfs_level_size(tree_root, |
753 | btrfs_super_root_level(disk_super)); | |
19c00ddc | 754 | |
e20d96d6 | 755 | tree_root->node = read_tree_block(tree_root, |
db94535d CM |
756 | btrfs_super_root(disk_super), |
757 | blocksize); | |
39279cc3 CM |
758 | if (!tree_root->node) |
759 | goto fail_sb_buffer; | |
3768f368 | 760 | |
2c90e5d6 | 761 | mutex_lock(&fs_info->fs_mutex); |
db94535d CM |
762 | |
763 | ret = find_and_setup_root(tree_root, fs_info, | |
e20d96d6 | 764 | BTRFS_EXTENT_TREE_OBJECTID, extent_root); |
39279cc3 CM |
765 | if (ret) { |
766 | mutex_unlock(&fs_info->fs_mutex); | |
767 | goto fail_tree_root; | |
768 | } | |
3768f368 | 769 | |
9078a3e1 CM |
770 | btrfs_read_block_groups(extent_root); |
771 | ||
0f7d52f4 | 772 | fs_info->generation = btrfs_super_generation(disk_super) + 1; |
5be6f7f1 | 773 | mutex_unlock(&fs_info->fs_mutex); |
0f7d52f4 | 774 | return tree_root; |
39279cc3 CM |
775 | |
776 | fail_tree_root: | |
5f39d397 | 777 | free_extent_buffer(tree_root->node); |
39279cc3 | 778 | fail_sb_buffer: |
5f39d397 | 779 | free_extent_buffer(fs_info->sb_buffer); |
39279cc3 CM |
780 | fail_iput: |
781 | iput(fs_info->btree_inode); | |
782 | fail: | |
783 | kfree(extent_root); | |
784 | kfree(tree_root); | |
785 | kfree(fs_info); | |
786 | return ERR_PTR(err); | |
eb60ceac CM |
787 | } |
788 | ||
e089f05c | 789 | int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root |
79154b1b | 790 | *root) |
eb60ceac | 791 | { |
e66f709b | 792 | int ret; |
5f39d397 CM |
793 | struct extent_buffer *super = root->fs_info->sb_buffer; |
794 | struct inode *btree_inode = root->fs_info->btree_inode; | |
21ad10cf | 795 | struct super_block *sb = root->fs_info->sb; |
5f39d397 | 796 | |
21ad10cf CM |
797 | if (!btrfs_test_opt(root, NOBARRIER)) |
798 | blkdev_issue_flush(sb->s_bdev, NULL); | |
d1310b2e | 799 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, super); |
5f39d397 CM |
800 | ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping, |
801 | super->start, super->len); | |
21ad10cf CM |
802 | if (!btrfs_test_opt(root, NOBARRIER)) |
803 | blkdev_issue_flush(sb->s_bdev, NULL); | |
5f39d397 | 804 | return ret; |
cfaa7295 CM |
805 | } |
806 | ||
5eda7b5e | 807 | int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
2619ba1f CM |
808 | { |
809 | radix_tree_delete(&fs_info->fs_roots_radix, | |
810 | (unsigned long)root->root_key.objectid); | |
b99aa6cb CM |
811 | if (root->in_sysfs) |
812 | btrfs_sysfs_del_root(root); | |
2619ba1f CM |
813 | if (root->inode) |
814 | iput(root->inode); | |
815 | if (root->node) | |
5f39d397 | 816 | free_extent_buffer(root->node); |
2619ba1f | 817 | if (root->commit_root) |
5f39d397 | 818 | free_extent_buffer(root->commit_root); |
58176a96 JB |
819 | if (root->name) |
820 | kfree(root->name); | |
2619ba1f CM |
821 | kfree(root); |
822 | return 0; | |
823 | } | |
824 | ||
35b7e476 | 825 | static int del_fs_roots(struct btrfs_fs_info *fs_info) |
0f7d52f4 CM |
826 | { |
827 | int ret; | |
828 | struct btrfs_root *gang[8]; | |
829 | int i; | |
830 | ||
831 | while(1) { | |
832 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
833 | (void **)gang, 0, | |
834 | ARRAY_SIZE(gang)); | |
835 | if (!ret) | |
836 | break; | |
2619ba1f | 837 | for (i = 0; i < ret; i++) |
5eda7b5e | 838 | btrfs_free_fs_root(fs_info, gang[i]); |
0f7d52f4 CM |
839 | } |
840 | return 0; | |
841 | } | |
b4100d64 | 842 | |
e20d96d6 | 843 | int close_ctree(struct btrfs_root *root) |
cfaa7295 | 844 | { |
3768f368 | 845 | int ret; |
e089f05c | 846 | struct btrfs_trans_handle *trans; |
0f7d52f4 | 847 | struct btrfs_fs_info *fs_info = root->fs_info; |
e089f05c | 848 | |
facda1e7 | 849 | fs_info->closing = 1; |
08607c1b | 850 | btrfs_transaction_flush_work(root); |
0f7d52f4 | 851 | mutex_lock(&fs_info->fs_mutex); |
6702ed49 | 852 | btrfs_defrag_dirty_roots(root->fs_info); |
79154b1b | 853 | trans = btrfs_start_transaction(root, 1); |
54aa1f4d | 854 | ret = btrfs_commit_transaction(trans, root); |
79154b1b CM |
855 | /* run commit again to drop the original snapshot */ |
856 | trans = btrfs_start_transaction(root, 1); | |
857 | btrfs_commit_transaction(trans, root); | |
858 | ret = btrfs_write_and_wait_transaction(NULL, root); | |
3768f368 | 859 | BUG_ON(ret); |
79154b1b | 860 | write_ctree_super(NULL, root); |
0f7d52f4 CM |
861 | mutex_unlock(&fs_info->fs_mutex); |
862 | ||
863 | if (fs_info->extent_root->node) | |
5f39d397 | 864 | free_extent_buffer(fs_info->extent_root->node); |
f510cfec | 865 | |
0f7d52f4 | 866 | if (fs_info->tree_root->node) |
5f39d397 | 867 | free_extent_buffer(fs_info->tree_root->node); |
f510cfec | 868 | |
5f39d397 | 869 | free_extent_buffer(fs_info->sb_buffer); |
7eccb903 | 870 | |
9078a3e1 | 871 | btrfs_free_block_groups(root->fs_info); |
0f7d52f4 | 872 | del_fs_roots(fs_info); |
d10c5f31 CM |
873 | |
874 | filemap_write_and_wait(fs_info->btree_inode->i_mapping); | |
875 | ||
d1310b2e CM |
876 | extent_io_tree_empty_lru(&fs_info->free_space_cache); |
877 | extent_io_tree_empty_lru(&fs_info->block_group_cache); | |
878 | extent_io_tree_empty_lru(&fs_info->pinned_extents); | |
879 | extent_io_tree_empty_lru(&fs_info->pending_del); | |
880 | extent_io_tree_empty_lru(&fs_info->extent_ins); | |
881 | extent_io_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->io_tree); | |
d10c5f31 | 882 | |
db94535d | 883 | truncate_inode_pages(fs_info->btree_inode->i_mapping, 0); |
d10c5f31 | 884 | |
db94535d | 885 | iput(fs_info->btree_inode); |
19c00ddc CM |
886 | #if 0 |
887 | while(!list_empty(&fs_info->hashers)) { | |
888 | struct btrfs_hasher *hasher; | |
889 | hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher, | |
890 | hashers); | |
891 | list_del(&hasher->hashers); | |
892 | crypto_free_hash(&fs_info->hash_tfm); | |
893 | kfree(hasher); | |
894 | } | |
895 | #endif | |
0f7d52f4 | 896 | kfree(fs_info->extent_root); |
0f7d52f4 | 897 | kfree(fs_info->tree_root); |
eb60ceac CM |
898 | return 0; |
899 | } | |
900 | ||
5f39d397 CM |
901 | int btrfs_buffer_uptodate(struct extent_buffer *buf) |
902 | { | |
810191ff | 903 | struct inode *btree_inode = buf->first_page->mapping->host; |
d1310b2e | 904 | return extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf); |
5f39d397 CM |
905 | } |
906 | ||
907 | int btrfs_set_buffer_uptodate(struct extent_buffer *buf) | |
ccd467d6 | 908 | { |
810191ff | 909 | struct inode *btree_inode = buf->first_page->mapping->host; |
d1310b2e | 910 | return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, |
5f39d397 CM |
911 | buf); |
912 | } | |
6702ed49 | 913 | |
5f39d397 CM |
914 | void btrfs_mark_buffer_dirty(struct extent_buffer *buf) |
915 | { | |
810191ff | 916 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
5f39d397 CM |
917 | u64 transid = btrfs_header_generation(buf); |
918 | struct inode *btree_inode = root->fs_info->btree_inode; | |
6702ed49 | 919 | |
ccd467d6 CM |
920 | if (transid != root->fs_info->generation) { |
921 | printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n", | |
db94535d | 922 | (unsigned long long)buf->start, |
ccd467d6 CM |
923 | transid, root->fs_info->generation); |
924 | WARN_ON(1); | |
925 | } | |
d1310b2e | 926 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, buf); |
eb60ceac CM |
927 | } |
928 | ||
e2008b61 CM |
929 | void btrfs_throttle(struct btrfs_root *root) |
930 | { | |
55c69072 CM |
931 | struct backing_dev_info *bdi; |
932 | ||
933 | bdi = root->fs_info->sb->s_bdev->bd_inode->i_mapping->backing_dev_info; | |
04005cc7 CM |
934 | if (root->fs_info->throttles && bdi_write_congested(bdi)) { |
935 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18) | |
55c69072 | 936 | congestion_wait(WRITE, HZ/20); |
04005cc7 CM |
937 | #else |
938 | blk_congestion_wait(WRITE, HZ/20); | |
939 | #endif | |
940 | } | |
e2008b61 CM |
941 | } |
942 | ||
d3c2fdcf | 943 | void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr) |
35b7e476 | 944 | { |
d3c2fdcf | 945 | balance_dirty_pages_ratelimited_nr( |
304fced6 | 946 | root->fs_info->btree_inode->i_mapping, 1); |
35b7e476 | 947 | } |
6b80053d CM |
948 | |
949 | void btrfs_set_buffer_defrag(struct extent_buffer *buf) | |
950 | { | |
810191ff | 951 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 952 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 953 | set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start, |
6b80053d CM |
954 | buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS); |
955 | } | |
956 | ||
957 | void btrfs_set_buffer_defrag_done(struct extent_buffer *buf) | |
958 | { | |
810191ff | 959 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 960 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 961 | set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start, |
6b80053d CM |
962 | buf->start + buf->len - 1, EXTENT_DEFRAG_DONE, |
963 | GFP_NOFS); | |
964 | } | |
965 | ||
966 | int btrfs_buffer_defrag(struct extent_buffer *buf) | |
967 | { | |
810191ff | 968 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 969 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 970 | return test_range_bit(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
971 | buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0); |
972 | } | |
973 | ||
974 | int btrfs_buffer_defrag_done(struct extent_buffer *buf) | |
975 | { | |
810191ff | 976 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 977 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 978 | return test_range_bit(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
979 | buf->start, buf->start + buf->len - 1, |
980 | EXTENT_DEFRAG_DONE, 0); | |
981 | } | |
982 | ||
983 | int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf) | |
984 | { | |
810191ff | 985 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 986 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 987 | return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
988 | buf->start, buf->start + buf->len - 1, |
989 | EXTENT_DEFRAG_DONE, GFP_NOFS); | |
990 | } | |
991 | ||
992 | int btrfs_clear_buffer_defrag(struct extent_buffer *buf) | |
993 | { | |
810191ff | 994 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 995 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 996 | return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
997 | buf->start, buf->start + buf->len - 1, |
998 | EXTENT_DEFRAG, GFP_NOFS); | |
999 | } | |
1000 | ||
1001 | int btrfs_read_buffer(struct extent_buffer *buf) | |
1002 | { | |
810191ff | 1003 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1004 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1005 | return read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, |
19c00ddc | 1006 | buf, 0, 1); |
6b80053d | 1007 | } |
0da5468f | 1008 | |
d1310b2e | 1009 | static struct extent_io_ops btree_extent_io_ops = { |
0da5468f CM |
1010 | .writepage_io_hook = btree_writepage_io_hook, |
1011 | }; |