]>
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 | ||
8f18cf13 | 19 | #include <linux/kernel.h> |
065631f6 | 20 | #include <linux/bio.h> |
39279cc3 | 21 | #include <linux/buffer_head.h> |
f2eb0a24 | 22 | #include <linux/file.h> |
39279cc3 CM |
23 | #include <linux/fs.h> |
24 | #include <linux/pagemap.h> | |
25 | #include <linux/highmem.h> | |
26 | #include <linux/time.h> | |
27 | #include <linux/init.h> | |
28 | #include <linux/string.h> | |
39279cc3 CM |
29 | #include <linux/backing-dev.h> |
30 | #include <linux/mpage.h> | |
31 | #include <linux/swap.h> | |
32 | #include <linux/writeback.h> | |
33 | #include <linux/statfs.h> | |
34 | #include <linux/compat.h> | |
9ebefb18 | 35 | #include <linux/bit_spinlock.h> |
5103e947 | 36 | #include <linux/xattr.h> |
33268eaf | 37 | #include <linux/posix_acl.h> |
d899e052 | 38 | #include <linux/falloc.h> |
5a0e3ad6 | 39 | #include <linux/slab.h> |
7a36ddec | 40 | #include <linux/ratelimit.h> |
22c44fe6 | 41 | #include <linux/mount.h> |
4b4e25f2 | 42 | #include "compat.h" |
39279cc3 CM |
43 | #include "ctree.h" |
44 | #include "disk-io.h" | |
45 | #include "transaction.h" | |
46 | #include "btrfs_inode.h" | |
47 | #include "ioctl.h" | |
48 | #include "print-tree.h" | |
e6dcd2dc | 49 | #include "ordered-data.h" |
95819c05 | 50 | #include "xattr.h" |
e02119d5 | 51 | #include "tree-log.h" |
4a54c8c1 | 52 | #include "volumes.h" |
c8b97818 | 53 | #include "compression.h" |
b4ce94de | 54 | #include "locking.h" |
dc89e982 | 55 | #include "free-space-cache.h" |
581bb050 | 56 | #include "inode-map.h" |
39279cc3 CM |
57 | |
58 | struct btrfs_iget_args { | |
59 | u64 ino; | |
60 | struct btrfs_root *root; | |
61 | }; | |
62 | ||
6e1d5dcc AD |
63 | static const struct inode_operations btrfs_dir_inode_operations; |
64 | static const struct inode_operations btrfs_symlink_inode_operations; | |
65 | static const struct inode_operations btrfs_dir_ro_inode_operations; | |
66 | static const struct inode_operations btrfs_special_inode_operations; | |
67 | static const struct inode_operations btrfs_file_inode_operations; | |
7f09410b AD |
68 | static const struct address_space_operations btrfs_aops; |
69 | static const struct address_space_operations btrfs_symlink_aops; | |
828c0950 | 70 | static const struct file_operations btrfs_dir_file_operations; |
d1310b2e | 71 | static struct extent_io_ops btrfs_extent_io_ops; |
39279cc3 CM |
72 | |
73 | static struct kmem_cache *btrfs_inode_cachep; | |
74 | struct kmem_cache *btrfs_trans_handle_cachep; | |
75 | struct kmem_cache *btrfs_transaction_cachep; | |
39279cc3 | 76 | struct kmem_cache *btrfs_path_cachep; |
dc89e982 | 77 | struct kmem_cache *btrfs_free_space_cachep; |
39279cc3 CM |
78 | |
79 | #define S_SHIFT 12 | |
80 | static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = { | |
81 | [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE, | |
82 | [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR, | |
83 | [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV, | |
84 | [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV, | |
85 | [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO, | |
86 | [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK, | |
87 | [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK, | |
88 | }; | |
89 | ||
a41ad394 JB |
90 | static int btrfs_setsize(struct inode *inode, loff_t newsize); |
91 | static int btrfs_truncate(struct inode *inode); | |
5fd02043 | 92 | static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent); |
771ed689 CM |
93 | static noinline int cow_file_range(struct inode *inode, |
94 | struct page *locked_page, | |
95 | u64 start, u64 end, int *page_started, | |
96 | unsigned long *nr_written, int unlock); | |
2115133f CM |
97 | static noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans, |
98 | struct btrfs_root *root, struct inode *inode); | |
7b128766 | 99 | |
f34f57a3 | 100 | static int btrfs_init_inode_security(struct btrfs_trans_handle *trans, |
2a7dba39 EP |
101 | struct inode *inode, struct inode *dir, |
102 | const struct qstr *qstr) | |
0279b4cd JO |
103 | { |
104 | int err; | |
105 | ||
f34f57a3 | 106 | err = btrfs_init_acl(trans, inode, dir); |
0279b4cd | 107 | if (!err) |
2a7dba39 | 108 | err = btrfs_xattr_security_init(trans, inode, dir, qstr); |
0279b4cd JO |
109 | return err; |
110 | } | |
111 | ||
c8b97818 CM |
112 | /* |
113 | * this does all the hard work for inserting an inline extent into | |
114 | * the btree. The caller should have done a btrfs_drop_extents so that | |
115 | * no overlapping inline items exist in the btree | |
116 | */ | |
d397712b | 117 | static noinline int insert_inline_extent(struct btrfs_trans_handle *trans, |
c8b97818 CM |
118 | struct btrfs_root *root, struct inode *inode, |
119 | u64 start, size_t size, size_t compressed_size, | |
fe3f566c | 120 | int compress_type, |
c8b97818 CM |
121 | struct page **compressed_pages) |
122 | { | |
123 | struct btrfs_key key; | |
124 | struct btrfs_path *path; | |
125 | struct extent_buffer *leaf; | |
126 | struct page *page = NULL; | |
127 | char *kaddr; | |
128 | unsigned long ptr; | |
129 | struct btrfs_file_extent_item *ei; | |
130 | int err = 0; | |
131 | int ret; | |
132 | size_t cur_size = size; | |
133 | size_t datasize; | |
134 | unsigned long offset; | |
c8b97818 | 135 | |
fe3f566c | 136 | if (compressed_size && compressed_pages) |
c8b97818 | 137 | cur_size = compressed_size; |
c8b97818 | 138 | |
d397712b CM |
139 | path = btrfs_alloc_path(); |
140 | if (!path) | |
c8b97818 CM |
141 | return -ENOMEM; |
142 | ||
b9473439 | 143 | path->leave_spinning = 1; |
c8b97818 | 144 | |
33345d01 | 145 | key.objectid = btrfs_ino(inode); |
c8b97818 CM |
146 | key.offset = start; |
147 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); | |
c8b97818 CM |
148 | datasize = btrfs_file_extent_calc_inline_size(cur_size); |
149 | ||
150 | inode_add_bytes(inode, size); | |
151 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
152 | datasize); | |
c8b97818 CM |
153 | if (ret) { |
154 | err = ret; | |
c8b97818 CM |
155 | goto fail; |
156 | } | |
157 | leaf = path->nodes[0]; | |
158 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
159 | struct btrfs_file_extent_item); | |
160 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
161 | btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); | |
162 | btrfs_set_file_extent_encryption(leaf, ei, 0); | |
163 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
164 | btrfs_set_file_extent_ram_bytes(leaf, ei, size); | |
165 | ptr = btrfs_file_extent_inline_start(ei); | |
166 | ||
261507a0 | 167 | if (compress_type != BTRFS_COMPRESS_NONE) { |
c8b97818 CM |
168 | struct page *cpage; |
169 | int i = 0; | |
d397712b | 170 | while (compressed_size > 0) { |
c8b97818 | 171 | cpage = compressed_pages[i]; |
5b050f04 | 172 | cur_size = min_t(unsigned long, compressed_size, |
c8b97818 CM |
173 | PAGE_CACHE_SIZE); |
174 | ||
7ac687d9 | 175 | kaddr = kmap_atomic(cpage); |
c8b97818 | 176 | write_extent_buffer(leaf, kaddr, ptr, cur_size); |
7ac687d9 | 177 | kunmap_atomic(kaddr); |
c8b97818 CM |
178 | |
179 | i++; | |
180 | ptr += cur_size; | |
181 | compressed_size -= cur_size; | |
182 | } | |
183 | btrfs_set_file_extent_compression(leaf, ei, | |
261507a0 | 184 | compress_type); |
c8b97818 CM |
185 | } else { |
186 | page = find_get_page(inode->i_mapping, | |
187 | start >> PAGE_CACHE_SHIFT); | |
188 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
7ac687d9 | 189 | kaddr = kmap_atomic(page); |
c8b97818 CM |
190 | offset = start & (PAGE_CACHE_SIZE - 1); |
191 | write_extent_buffer(leaf, kaddr + offset, ptr, size); | |
7ac687d9 | 192 | kunmap_atomic(kaddr); |
c8b97818 CM |
193 | page_cache_release(page); |
194 | } | |
195 | btrfs_mark_buffer_dirty(leaf); | |
196 | btrfs_free_path(path); | |
197 | ||
c2167754 YZ |
198 | /* |
199 | * we're an inline extent, so nobody can | |
200 | * extend the file past i_size without locking | |
201 | * a page we already have locked. | |
202 | * | |
203 | * We must do any isize and inode updates | |
204 | * before we unlock the pages. Otherwise we | |
205 | * could end up racing with unlink. | |
206 | */ | |
c8b97818 | 207 | BTRFS_I(inode)->disk_i_size = inode->i_size; |
79787eaa | 208 | ret = btrfs_update_inode(trans, root, inode); |
c2167754 | 209 | |
79787eaa | 210 | return ret; |
c8b97818 CM |
211 | fail: |
212 | btrfs_free_path(path); | |
213 | return err; | |
214 | } | |
215 | ||
216 | ||
217 | /* | |
218 | * conditionally insert an inline extent into the file. This | |
219 | * does the checks required to make sure the data is small enough | |
220 | * to fit as an inline extent. | |
221 | */ | |
7f366cfe | 222 | static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans, |
c8b97818 CM |
223 | struct btrfs_root *root, |
224 | struct inode *inode, u64 start, u64 end, | |
fe3f566c | 225 | size_t compressed_size, int compress_type, |
c8b97818 CM |
226 | struct page **compressed_pages) |
227 | { | |
228 | u64 isize = i_size_read(inode); | |
229 | u64 actual_end = min(end + 1, isize); | |
230 | u64 inline_len = actual_end - start; | |
231 | u64 aligned_end = (end + root->sectorsize - 1) & | |
232 | ~((u64)root->sectorsize - 1); | |
c8b97818 CM |
233 | u64 data_len = inline_len; |
234 | int ret; | |
235 | ||
236 | if (compressed_size) | |
237 | data_len = compressed_size; | |
238 | ||
239 | if (start > 0 || | |
70b99e69 | 240 | actual_end >= PAGE_CACHE_SIZE || |
c8b97818 CM |
241 | data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) || |
242 | (!compressed_size && | |
243 | (actual_end & (root->sectorsize - 1)) == 0) || | |
244 | end + 1 < isize || | |
245 | data_len > root->fs_info->max_inline) { | |
246 | return 1; | |
247 | } | |
248 | ||
2671485d | 249 | ret = btrfs_drop_extents(trans, root, inode, start, aligned_end, 1); |
79787eaa JM |
250 | if (ret) |
251 | return ret; | |
c8b97818 CM |
252 | |
253 | if (isize > actual_end) | |
254 | inline_len = min_t(u64, isize, actual_end); | |
255 | ret = insert_inline_extent(trans, root, inode, start, | |
256 | inline_len, compressed_size, | |
fe3f566c | 257 | compress_type, compressed_pages); |
2adcac1a | 258 | if (ret && ret != -ENOSPC) { |
79787eaa JM |
259 | btrfs_abort_transaction(trans, root, ret); |
260 | return ret; | |
2adcac1a JB |
261 | } else if (ret == -ENOSPC) { |
262 | return 1; | |
79787eaa | 263 | } |
2adcac1a | 264 | |
0ca1f7ce | 265 | btrfs_delalloc_release_metadata(inode, end + 1 - start); |
a1ed835e | 266 | btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0); |
c8b97818 CM |
267 | return 0; |
268 | } | |
269 | ||
771ed689 CM |
270 | struct async_extent { |
271 | u64 start; | |
272 | u64 ram_size; | |
273 | u64 compressed_size; | |
274 | struct page **pages; | |
275 | unsigned long nr_pages; | |
261507a0 | 276 | int compress_type; |
771ed689 CM |
277 | struct list_head list; |
278 | }; | |
279 | ||
280 | struct async_cow { | |
281 | struct inode *inode; | |
282 | struct btrfs_root *root; | |
283 | struct page *locked_page; | |
284 | u64 start; | |
285 | u64 end; | |
286 | struct list_head extents; | |
287 | struct btrfs_work work; | |
288 | }; | |
289 | ||
290 | static noinline int add_async_extent(struct async_cow *cow, | |
291 | u64 start, u64 ram_size, | |
292 | u64 compressed_size, | |
293 | struct page **pages, | |
261507a0 LZ |
294 | unsigned long nr_pages, |
295 | int compress_type) | |
771ed689 CM |
296 | { |
297 | struct async_extent *async_extent; | |
298 | ||
299 | async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS); | |
79787eaa | 300 | BUG_ON(!async_extent); /* -ENOMEM */ |
771ed689 CM |
301 | async_extent->start = start; |
302 | async_extent->ram_size = ram_size; | |
303 | async_extent->compressed_size = compressed_size; | |
304 | async_extent->pages = pages; | |
305 | async_extent->nr_pages = nr_pages; | |
261507a0 | 306 | async_extent->compress_type = compress_type; |
771ed689 CM |
307 | list_add_tail(&async_extent->list, &cow->extents); |
308 | return 0; | |
309 | } | |
310 | ||
d352ac68 | 311 | /* |
771ed689 CM |
312 | * we create compressed extents in two phases. The first |
313 | * phase compresses a range of pages that have already been | |
314 | * locked (both pages and state bits are locked). | |
c8b97818 | 315 | * |
771ed689 CM |
316 | * This is done inside an ordered work queue, and the compression |
317 | * is spread across many cpus. The actual IO submission is step | |
318 | * two, and the ordered work queue takes care of making sure that | |
319 | * happens in the same order things were put onto the queue by | |
320 | * writepages and friends. | |
c8b97818 | 321 | * |
771ed689 CM |
322 | * If this code finds it can't get good compression, it puts an |
323 | * entry onto the work queue to write the uncompressed bytes. This | |
324 | * makes sure that both compressed inodes and uncompressed inodes | |
b2570314 AB |
325 | * are written in the same order that the flusher thread sent them |
326 | * down. | |
d352ac68 | 327 | */ |
771ed689 CM |
328 | static noinline int compress_file_range(struct inode *inode, |
329 | struct page *locked_page, | |
330 | u64 start, u64 end, | |
331 | struct async_cow *async_cow, | |
332 | int *num_added) | |
b888db2b CM |
333 | { |
334 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
335 | struct btrfs_trans_handle *trans; | |
db94535d | 336 | u64 num_bytes; |
db94535d | 337 | u64 blocksize = root->sectorsize; |
c8b97818 | 338 | u64 actual_end; |
42dc7bab | 339 | u64 isize = i_size_read(inode); |
e6dcd2dc | 340 | int ret = 0; |
c8b97818 CM |
341 | struct page **pages = NULL; |
342 | unsigned long nr_pages; | |
343 | unsigned long nr_pages_ret = 0; | |
344 | unsigned long total_compressed = 0; | |
345 | unsigned long total_in = 0; | |
346 | unsigned long max_compressed = 128 * 1024; | |
771ed689 | 347 | unsigned long max_uncompressed = 128 * 1024; |
c8b97818 CM |
348 | int i; |
349 | int will_compress; | |
261507a0 | 350 | int compress_type = root->fs_info->compress_type; |
b888db2b | 351 | |
4cb13e5d LB |
352 | /* if this is a small write inside eof, kick off a defrag */ |
353 | if ((end - start + 1) < 16 * 1024 && | |
354 | (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size)) | |
4cb5300b CM |
355 | btrfs_add_inode_defrag(NULL, inode); |
356 | ||
42dc7bab | 357 | actual_end = min_t(u64, isize, end + 1); |
c8b97818 CM |
358 | again: |
359 | will_compress = 0; | |
360 | nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1; | |
361 | nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE); | |
be20aa9d | 362 | |
f03d9301 CM |
363 | /* |
364 | * we don't want to send crud past the end of i_size through | |
365 | * compression, that's just a waste of CPU time. So, if the | |
366 | * end of the file is before the start of our current | |
367 | * requested range of bytes, we bail out to the uncompressed | |
368 | * cleanup code that can deal with all of this. | |
369 | * | |
370 | * It isn't really the fastest way to fix things, but this is a | |
371 | * very uncommon corner. | |
372 | */ | |
373 | if (actual_end <= start) | |
374 | goto cleanup_and_bail_uncompressed; | |
375 | ||
c8b97818 CM |
376 | total_compressed = actual_end - start; |
377 | ||
378 | /* we want to make sure that amount of ram required to uncompress | |
379 | * an extent is reasonable, so we limit the total size in ram | |
771ed689 CM |
380 | * of a compressed extent to 128k. This is a crucial number |
381 | * because it also controls how easily we can spread reads across | |
382 | * cpus for decompression. | |
383 | * | |
384 | * We also want to make sure the amount of IO required to do | |
385 | * a random read is reasonably small, so we limit the size of | |
386 | * a compressed extent to 128k. | |
c8b97818 CM |
387 | */ |
388 | total_compressed = min(total_compressed, max_uncompressed); | |
db94535d | 389 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); |
be20aa9d | 390 | num_bytes = max(blocksize, num_bytes); |
c8b97818 CM |
391 | total_in = 0; |
392 | ret = 0; | |
db94535d | 393 | |
771ed689 CM |
394 | /* |
395 | * we do compression for mount -o compress and when the | |
396 | * inode has not been flagged as nocompress. This flag can | |
397 | * change at any time if we discover bad compression ratios. | |
c8b97818 | 398 | */ |
6cbff00f | 399 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) && |
1e701a32 | 400 | (btrfs_test_opt(root, COMPRESS) || |
75e7cb7f LB |
401 | (BTRFS_I(inode)->force_compress) || |
402 | (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))) { | |
c8b97818 | 403 | WARN_ON(pages); |
cfbc246e | 404 | pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS); |
560f7d75 LZ |
405 | if (!pages) { |
406 | /* just bail out to the uncompressed code */ | |
407 | goto cont; | |
408 | } | |
c8b97818 | 409 | |
261507a0 LZ |
410 | if (BTRFS_I(inode)->force_compress) |
411 | compress_type = BTRFS_I(inode)->force_compress; | |
412 | ||
413 | ret = btrfs_compress_pages(compress_type, | |
414 | inode->i_mapping, start, | |
415 | total_compressed, pages, | |
416 | nr_pages, &nr_pages_ret, | |
417 | &total_in, | |
418 | &total_compressed, | |
419 | max_compressed); | |
c8b97818 CM |
420 | |
421 | if (!ret) { | |
422 | unsigned long offset = total_compressed & | |
423 | (PAGE_CACHE_SIZE - 1); | |
424 | struct page *page = pages[nr_pages_ret - 1]; | |
425 | char *kaddr; | |
426 | ||
427 | /* zero the tail end of the last page, we might be | |
428 | * sending it down to disk | |
429 | */ | |
430 | if (offset) { | |
7ac687d9 | 431 | kaddr = kmap_atomic(page); |
c8b97818 CM |
432 | memset(kaddr + offset, 0, |
433 | PAGE_CACHE_SIZE - offset); | |
7ac687d9 | 434 | kunmap_atomic(kaddr); |
c8b97818 CM |
435 | } |
436 | will_compress = 1; | |
437 | } | |
438 | } | |
560f7d75 | 439 | cont: |
c8b97818 | 440 | if (start == 0) { |
7a7eaa40 | 441 | trans = btrfs_join_transaction(root); |
79787eaa JM |
442 | if (IS_ERR(trans)) { |
443 | ret = PTR_ERR(trans); | |
444 | trans = NULL; | |
445 | goto cleanup_and_out; | |
446 | } | |
0ca1f7ce | 447 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
771ed689 | 448 | |
c8b97818 | 449 | /* lets try to make an inline extent */ |
771ed689 | 450 | if (ret || total_in < (actual_end - start)) { |
c8b97818 | 451 | /* we didn't compress the entire range, try |
771ed689 | 452 | * to make an uncompressed inline extent. |
c8b97818 CM |
453 | */ |
454 | ret = cow_file_range_inline(trans, root, inode, | |
fe3f566c | 455 | start, end, 0, 0, NULL); |
c8b97818 | 456 | } else { |
771ed689 | 457 | /* try making a compressed inline extent */ |
c8b97818 CM |
458 | ret = cow_file_range_inline(trans, root, inode, |
459 | start, end, | |
fe3f566c LZ |
460 | total_compressed, |
461 | compress_type, pages); | |
c8b97818 | 462 | } |
79787eaa | 463 | if (ret <= 0) { |
771ed689 | 464 | /* |
79787eaa JM |
465 | * inline extent creation worked or returned error, |
466 | * we don't need to create any more async work items. | |
467 | * Unlock and free up our temp pages. | |
771ed689 | 468 | */ |
c8b97818 | 469 | extent_clear_unlock_delalloc(inode, |
a791e35e CM |
470 | &BTRFS_I(inode)->io_tree, |
471 | start, end, NULL, | |
472 | EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY | | |
a3429ab7 | 473 | EXTENT_CLEAR_DELALLOC | |
a791e35e | 474 | EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK); |
c2167754 YZ |
475 | |
476 | btrfs_end_transaction(trans, root); | |
c8b97818 CM |
477 | goto free_pages_out; |
478 | } | |
c2167754 | 479 | btrfs_end_transaction(trans, root); |
c8b97818 CM |
480 | } |
481 | ||
482 | if (will_compress) { | |
483 | /* | |
484 | * we aren't doing an inline extent round the compressed size | |
485 | * up to a block size boundary so the allocator does sane | |
486 | * things | |
487 | */ | |
488 | total_compressed = (total_compressed + blocksize - 1) & | |
489 | ~(blocksize - 1); | |
490 | ||
491 | /* | |
492 | * one last check to make sure the compression is really a | |
493 | * win, compare the page count read with the blocks on disk | |
494 | */ | |
495 | total_in = (total_in + PAGE_CACHE_SIZE - 1) & | |
496 | ~(PAGE_CACHE_SIZE - 1); | |
497 | if (total_compressed >= total_in) { | |
498 | will_compress = 0; | |
499 | } else { | |
c8b97818 CM |
500 | num_bytes = total_in; |
501 | } | |
502 | } | |
503 | if (!will_compress && pages) { | |
504 | /* | |
505 | * the compression code ran but failed to make things smaller, | |
506 | * free any pages it allocated and our page pointer array | |
507 | */ | |
508 | for (i = 0; i < nr_pages_ret; i++) { | |
70b99e69 | 509 | WARN_ON(pages[i]->mapping); |
c8b97818 CM |
510 | page_cache_release(pages[i]); |
511 | } | |
512 | kfree(pages); | |
513 | pages = NULL; | |
514 | total_compressed = 0; | |
515 | nr_pages_ret = 0; | |
516 | ||
517 | /* flag the file so we don't compress in the future */ | |
1e701a32 CM |
518 | if (!btrfs_test_opt(root, FORCE_COMPRESS) && |
519 | !(BTRFS_I(inode)->force_compress)) { | |
a555f810 | 520 | BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS; |
1e701a32 | 521 | } |
c8b97818 | 522 | } |
771ed689 CM |
523 | if (will_compress) { |
524 | *num_added += 1; | |
c8b97818 | 525 | |
771ed689 CM |
526 | /* the async work queues will take care of doing actual |
527 | * allocation on disk for these compressed pages, | |
528 | * and will submit them to the elevator. | |
529 | */ | |
530 | add_async_extent(async_cow, start, num_bytes, | |
261507a0 LZ |
531 | total_compressed, pages, nr_pages_ret, |
532 | compress_type); | |
179e29e4 | 533 | |
24ae6365 | 534 | if (start + num_bytes < end) { |
771ed689 CM |
535 | start += num_bytes; |
536 | pages = NULL; | |
537 | cond_resched(); | |
538 | goto again; | |
539 | } | |
540 | } else { | |
f03d9301 | 541 | cleanup_and_bail_uncompressed: |
771ed689 CM |
542 | /* |
543 | * No compression, but we still need to write the pages in | |
544 | * the file we've been given so far. redirty the locked | |
545 | * page if it corresponds to our extent and set things up | |
546 | * for the async work queue to run cow_file_range to do | |
547 | * the normal delalloc dance | |
548 | */ | |
549 | if (page_offset(locked_page) >= start && | |
550 | page_offset(locked_page) <= end) { | |
551 | __set_page_dirty_nobuffers(locked_page); | |
552 | /* unlocked later on in the async handlers */ | |
553 | } | |
261507a0 LZ |
554 | add_async_extent(async_cow, start, end - start + 1, |
555 | 0, NULL, 0, BTRFS_COMPRESS_NONE); | |
771ed689 CM |
556 | *num_added += 1; |
557 | } | |
3b951516 | 558 | |
771ed689 | 559 | out: |
79787eaa | 560 | return ret; |
771ed689 CM |
561 | |
562 | free_pages_out: | |
563 | for (i = 0; i < nr_pages_ret; i++) { | |
564 | WARN_ON(pages[i]->mapping); | |
565 | page_cache_release(pages[i]); | |
566 | } | |
d397712b | 567 | kfree(pages); |
771ed689 CM |
568 | |
569 | goto out; | |
79787eaa JM |
570 | |
571 | cleanup_and_out: | |
572 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, | |
573 | start, end, NULL, | |
574 | EXTENT_CLEAR_UNLOCK_PAGE | | |
575 | EXTENT_CLEAR_DIRTY | | |
576 | EXTENT_CLEAR_DELALLOC | | |
577 | EXTENT_SET_WRITEBACK | | |
578 | EXTENT_END_WRITEBACK); | |
579 | if (!trans || IS_ERR(trans)) | |
580 | btrfs_error(root->fs_info, ret, "Failed to join transaction"); | |
581 | else | |
582 | btrfs_abort_transaction(trans, root, ret); | |
583 | goto free_pages_out; | |
771ed689 CM |
584 | } |
585 | ||
586 | /* | |
587 | * phase two of compressed writeback. This is the ordered portion | |
588 | * of the code, which only gets called in the order the work was | |
589 | * queued. We walk all the async extents created by compress_file_range | |
590 | * and send them down to the disk. | |
591 | */ | |
592 | static noinline int submit_compressed_extents(struct inode *inode, | |
593 | struct async_cow *async_cow) | |
594 | { | |
595 | struct async_extent *async_extent; | |
596 | u64 alloc_hint = 0; | |
597 | struct btrfs_trans_handle *trans; | |
598 | struct btrfs_key ins; | |
599 | struct extent_map *em; | |
600 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
601 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
602 | struct extent_io_tree *io_tree; | |
f5a84ee3 | 603 | int ret = 0; |
771ed689 CM |
604 | |
605 | if (list_empty(&async_cow->extents)) | |
606 | return 0; | |
607 | ||
771ed689 | 608 | |
d397712b | 609 | while (!list_empty(&async_cow->extents)) { |
771ed689 CM |
610 | async_extent = list_entry(async_cow->extents.next, |
611 | struct async_extent, list); | |
612 | list_del(&async_extent->list); | |
c8b97818 | 613 | |
771ed689 CM |
614 | io_tree = &BTRFS_I(inode)->io_tree; |
615 | ||
f5a84ee3 | 616 | retry: |
771ed689 CM |
617 | /* did the compression code fall back to uncompressed IO? */ |
618 | if (!async_extent->pages) { | |
619 | int page_started = 0; | |
620 | unsigned long nr_written = 0; | |
621 | ||
622 | lock_extent(io_tree, async_extent->start, | |
2ac55d41 | 623 | async_extent->start + |
d0082371 | 624 | async_extent->ram_size - 1); |
771ed689 CM |
625 | |
626 | /* allocate blocks */ | |
f5a84ee3 JB |
627 | ret = cow_file_range(inode, async_cow->locked_page, |
628 | async_extent->start, | |
629 | async_extent->start + | |
630 | async_extent->ram_size - 1, | |
631 | &page_started, &nr_written, 0); | |
771ed689 | 632 | |
79787eaa JM |
633 | /* JDM XXX */ |
634 | ||
771ed689 CM |
635 | /* |
636 | * if page_started, cow_file_range inserted an | |
637 | * inline extent and took care of all the unlocking | |
638 | * and IO for us. Otherwise, we need to submit | |
639 | * all those pages down to the drive. | |
640 | */ | |
f5a84ee3 | 641 | if (!page_started && !ret) |
771ed689 CM |
642 | extent_write_locked_range(io_tree, |
643 | inode, async_extent->start, | |
d397712b | 644 | async_extent->start + |
771ed689 CM |
645 | async_extent->ram_size - 1, |
646 | btrfs_get_extent, | |
647 | WB_SYNC_ALL); | |
648 | kfree(async_extent); | |
649 | cond_resched(); | |
650 | continue; | |
651 | } | |
652 | ||
653 | lock_extent(io_tree, async_extent->start, | |
d0082371 | 654 | async_extent->start + async_extent->ram_size - 1); |
771ed689 | 655 | |
7a7eaa40 | 656 | trans = btrfs_join_transaction(root); |
79787eaa JM |
657 | if (IS_ERR(trans)) { |
658 | ret = PTR_ERR(trans); | |
659 | } else { | |
660 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; | |
661 | ret = btrfs_reserve_extent(trans, root, | |
771ed689 CM |
662 | async_extent->compressed_size, |
663 | async_extent->compressed_size, | |
81c9ad23 | 664 | 0, alloc_hint, &ins, 1); |
79787eaa JM |
665 | if (ret) |
666 | btrfs_abort_transaction(trans, root, ret); | |
667 | btrfs_end_transaction(trans, root); | |
668 | } | |
c2167754 | 669 | |
f5a84ee3 JB |
670 | if (ret) { |
671 | int i; | |
672 | for (i = 0; i < async_extent->nr_pages; i++) { | |
673 | WARN_ON(async_extent->pages[i]->mapping); | |
674 | page_cache_release(async_extent->pages[i]); | |
675 | } | |
676 | kfree(async_extent->pages); | |
677 | async_extent->nr_pages = 0; | |
678 | async_extent->pages = NULL; | |
679 | unlock_extent(io_tree, async_extent->start, | |
680 | async_extent->start + | |
d0082371 | 681 | async_extent->ram_size - 1); |
79787eaa JM |
682 | if (ret == -ENOSPC) |
683 | goto retry; | |
684 | goto out_free; /* JDM: Requeue? */ | |
f5a84ee3 JB |
685 | } |
686 | ||
c2167754 YZ |
687 | /* |
688 | * here we're doing allocation and writeback of the | |
689 | * compressed pages | |
690 | */ | |
691 | btrfs_drop_extent_cache(inode, async_extent->start, | |
692 | async_extent->start + | |
693 | async_extent->ram_size - 1, 0); | |
694 | ||
172ddd60 | 695 | em = alloc_extent_map(); |
79787eaa | 696 | BUG_ON(!em); /* -ENOMEM */ |
771ed689 CM |
697 | em->start = async_extent->start; |
698 | em->len = async_extent->ram_size; | |
445a6944 | 699 | em->orig_start = em->start; |
c8b97818 | 700 | |
771ed689 CM |
701 | em->block_start = ins.objectid; |
702 | em->block_len = ins.offset; | |
703 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
261507a0 | 704 | em->compress_type = async_extent->compress_type; |
771ed689 CM |
705 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
706 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
707 | ||
d397712b | 708 | while (1) { |
890871be | 709 | write_lock(&em_tree->lock); |
771ed689 | 710 | ret = add_extent_mapping(em_tree, em); |
890871be | 711 | write_unlock(&em_tree->lock); |
771ed689 CM |
712 | if (ret != -EEXIST) { |
713 | free_extent_map(em); | |
714 | break; | |
715 | } | |
716 | btrfs_drop_extent_cache(inode, async_extent->start, | |
717 | async_extent->start + | |
718 | async_extent->ram_size - 1, 0); | |
719 | } | |
720 | ||
261507a0 LZ |
721 | ret = btrfs_add_ordered_extent_compress(inode, |
722 | async_extent->start, | |
723 | ins.objectid, | |
724 | async_extent->ram_size, | |
725 | ins.offset, | |
726 | BTRFS_ORDERED_COMPRESSED, | |
727 | async_extent->compress_type); | |
79787eaa | 728 | BUG_ON(ret); /* -ENOMEM */ |
771ed689 | 729 | |
771ed689 CM |
730 | /* |
731 | * clear dirty, set writeback and unlock the pages. | |
732 | */ | |
733 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
734 | &BTRFS_I(inode)->io_tree, |
735 | async_extent->start, | |
736 | async_extent->start + | |
737 | async_extent->ram_size - 1, | |
738 | NULL, EXTENT_CLEAR_UNLOCK_PAGE | | |
739 | EXTENT_CLEAR_UNLOCK | | |
a3429ab7 | 740 | EXTENT_CLEAR_DELALLOC | |
a791e35e | 741 | EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK); |
771ed689 CM |
742 | |
743 | ret = btrfs_submit_compressed_write(inode, | |
d397712b CM |
744 | async_extent->start, |
745 | async_extent->ram_size, | |
746 | ins.objectid, | |
747 | ins.offset, async_extent->pages, | |
748 | async_extent->nr_pages); | |
771ed689 | 749 | |
79787eaa | 750 | BUG_ON(ret); /* -ENOMEM */ |
771ed689 CM |
751 | alloc_hint = ins.objectid + ins.offset; |
752 | kfree(async_extent); | |
753 | cond_resched(); | |
754 | } | |
79787eaa JM |
755 | ret = 0; |
756 | out: | |
757 | return ret; | |
758 | out_free: | |
759 | kfree(async_extent); | |
760 | goto out; | |
771ed689 CM |
761 | } |
762 | ||
4b46fce2 JB |
763 | static u64 get_extent_allocation_hint(struct inode *inode, u64 start, |
764 | u64 num_bytes) | |
765 | { | |
766 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
767 | struct extent_map *em; | |
768 | u64 alloc_hint = 0; | |
769 | ||
770 | read_lock(&em_tree->lock); | |
771 | em = search_extent_mapping(em_tree, start, num_bytes); | |
772 | if (em) { | |
773 | /* | |
774 | * if block start isn't an actual block number then find the | |
775 | * first block in this inode and use that as a hint. If that | |
776 | * block is also bogus then just don't worry about it. | |
777 | */ | |
778 | if (em->block_start >= EXTENT_MAP_LAST_BYTE) { | |
779 | free_extent_map(em); | |
780 | em = search_extent_mapping(em_tree, 0, 0); | |
781 | if (em && em->block_start < EXTENT_MAP_LAST_BYTE) | |
782 | alloc_hint = em->block_start; | |
783 | if (em) | |
784 | free_extent_map(em); | |
785 | } else { | |
786 | alloc_hint = em->block_start; | |
787 | free_extent_map(em); | |
788 | } | |
789 | } | |
790 | read_unlock(&em_tree->lock); | |
791 | ||
792 | return alloc_hint; | |
793 | } | |
794 | ||
771ed689 CM |
795 | /* |
796 | * when extent_io.c finds a delayed allocation range in the file, | |
797 | * the call backs end up in this code. The basic idea is to | |
798 | * allocate extents on disk for the range, and create ordered data structs | |
799 | * in ram to track those extents. | |
800 | * | |
801 | * locked_page is the page that writepage had locked already. We use | |
802 | * it to make sure we don't do extra locks or unlocks. | |
803 | * | |
804 | * *page_started is set to one if we unlock locked_page and do everything | |
805 | * required to start IO on it. It may be clean and already done with | |
806 | * IO when we return. | |
807 | */ | |
808 | static noinline int cow_file_range(struct inode *inode, | |
809 | struct page *locked_page, | |
810 | u64 start, u64 end, int *page_started, | |
811 | unsigned long *nr_written, | |
812 | int unlock) | |
813 | { | |
814 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
815 | struct btrfs_trans_handle *trans; | |
816 | u64 alloc_hint = 0; | |
817 | u64 num_bytes; | |
818 | unsigned long ram_size; | |
819 | u64 disk_num_bytes; | |
820 | u64 cur_alloc_size; | |
821 | u64 blocksize = root->sectorsize; | |
771ed689 CM |
822 | struct btrfs_key ins; |
823 | struct extent_map *em; | |
824 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
825 | int ret = 0; | |
826 | ||
83eea1f1 | 827 | BUG_ON(btrfs_is_free_space_inode(inode)); |
7a7eaa40 | 828 | trans = btrfs_join_transaction(root); |
79787eaa JM |
829 | if (IS_ERR(trans)) { |
830 | extent_clear_unlock_delalloc(inode, | |
831 | &BTRFS_I(inode)->io_tree, | |
beb42dd7 | 832 | start, end, locked_page, |
79787eaa JM |
833 | EXTENT_CLEAR_UNLOCK_PAGE | |
834 | EXTENT_CLEAR_UNLOCK | | |
835 | EXTENT_CLEAR_DELALLOC | | |
836 | EXTENT_CLEAR_DIRTY | | |
837 | EXTENT_SET_WRITEBACK | | |
838 | EXTENT_END_WRITEBACK); | |
839 | return PTR_ERR(trans); | |
840 | } | |
0ca1f7ce | 841 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
771ed689 | 842 | |
771ed689 CM |
843 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); |
844 | num_bytes = max(blocksize, num_bytes); | |
845 | disk_num_bytes = num_bytes; | |
846 | ret = 0; | |
847 | ||
4cb5300b | 848 | /* if this is a small write inside eof, kick off defrag */ |
4cb13e5d LB |
849 | if (num_bytes < 64 * 1024 && |
850 | (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size)) | |
4cb5300b CM |
851 | btrfs_add_inode_defrag(trans, inode); |
852 | ||
771ed689 CM |
853 | if (start == 0) { |
854 | /* lets try to make an inline extent */ | |
855 | ret = cow_file_range_inline(trans, root, inode, | |
fe3f566c | 856 | start, end, 0, 0, NULL); |
771ed689 CM |
857 | if (ret == 0) { |
858 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
859 | &BTRFS_I(inode)->io_tree, |
860 | start, end, NULL, | |
861 | EXTENT_CLEAR_UNLOCK_PAGE | | |
862 | EXTENT_CLEAR_UNLOCK | | |
863 | EXTENT_CLEAR_DELALLOC | | |
864 | EXTENT_CLEAR_DIRTY | | |
865 | EXTENT_SET_WRITEBACK | | |
866 | EXTENT_END_WRITEBACK); | |
c2167754 | 867 | |
771ed689 CM |
868 | *nr_written = *nr_written + |
869 | (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE; | |
870 | *page_started = 1; | |
771ed689 | 871 | goto out; |
79787eaa JM |
872 | } else if (ret < 0) { |
873 | btrfs_abort_transaction(trans, root, ret); | |
874 | goto out_unlock; | |
771ed689 CM |
875 | } |
876 | } | |
877 | ||
878 | BUG_ON(disk_num_bytes > | |
6c41761f | 879 | btrfs_super_total_bytes(root->fs_info->super_copy)); |
771ed689 | 880 | |
4b46fce2 | 881 | alloc_hint = get_extent_allocation_hint(inode, start, num_bytes); |
771ed689 CM |
882 | btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0); |
883 | ||
d397712b | 884 | while (disk_num_bytes > 0) { |
a791e35e CM |
885 | unsigned long op; |
886 | ||
287a0ab9 | 887 | cur_alloc_size = disk_num_bytes; |
e6dcd2dc | 888 | ret = btrfs_reserve_extent(trans, root, cur_alloc_size, |
771ed689 | 889 | root->sectorsize, 0, alloc_hint, |
81c9ad23 | 890 | &ins, 1); |
79787eaa JM |
891 | if (ret < 0) { |
892 | btrfs_abort_transaction(trans, root, ret); | |
893 | goto out_unlock; | |
894 | } | |
d397712b | 895 | |
172ddd60 | 896 | em = alloc_extent_map(); |
79787eaa | 897 | BUG_ON(!em); /* -ENOMEM */ |
e6dcd2dc | 898 | em->start = start; |
445a6944 | 899 | em->orig_start = em->start; |
771ed689 CM |
900 | ram_size = ins.offset; |
901 | em->len = ins.offset; | |
c8b97818 | 902 | |
e6dcd2dc | 903 | em->block_start = ins.objectid; |
c8b97818 | 904 | em->block_len = ins.offset; |
e6dcd2dc | 905 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
7f3c74fb | 906 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
c8b97818 | 907 | |
d397712b | 908 | while (1) { |
890871be | 909 | write_lock(&em_tree->lock); |
e6dcd2dc | 910 | ret = add_extent_mapping(em_tree, em); |
890871be | 911 | write_unlock(&em_tree->lock); |
e6dcd2dc CM |
912 | if (ret != -EEXIST) { |
913 | free_extent_map(em); | |
914 | break; | |
915 | } | |
916 | btrfs_drop_extent_cache(inode, start, | |
c8b97818 | 917 | start + ram_size - 1, 0); |
e6dcd2dc CM |
918 | } |
919 | ||
98d20f67 | 920 | cur_alloc_size = ins.offset; |
e6dcd2dc | 921 | ret = btrfs_add_ordered_extent(inode, start, ins.objectid, |
771ed689 | 922 | ram_size, cur_alloc_size, 0); |
79787eaa | 923 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 | 924 | |
17d217fe YZ |
925 | if (root->root_key.objectid == |
926 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
927 | ret = btrfs_reloc_clone_csums(inode, start, | |
928 | cur_alloc_size); | |
79787eaa JM |
929 | if (ret) { |
930 | btrfs_abort_transaction(trans, root, ret); | |
931 | goto out_unlock; | |
932 | } | |
17d217fe YZ |
933 | } |
934 | ||
d397712b | 935 | if (disk_num_bytes < cur_alloc_size) |
3b951516 | 936 | break; |
d397712b | 937 | |
c8b97818 CM |
938 | /* we're not doing compressed IO, don't unlock the first |
939 | * page (which the caller expects to stay locked), don't | |
940 | * clear any dirty bits and don't set any writeback bits | |
8b62b72b CM |
941 | * |
942 | * Do set the Private2 bit so we know this page was properly | |
943 | * setup for writepage | |
c8b97818 | 944 | */ |
a791e35e CM |
945 | op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0; |
946 | op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
947 | EXTENT_SET_PRIVATE2; | |
948 | ||
c8b97818 CM |
949 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
950 | start, start + ram_size - 1, | |
a791e35e | 951 | locked_page, op); |
c8b97818 | 952 | disk_num_bytes -= cur_alloc_size; |
c59f8951 CM |
953 | num_bytes -= cur_alloc_size; |
954 | alloc_hint = ins.objectid + ins.offset; | |
955 | start += cur_alloc_size; | |
b888db2b | 956 | } |
771ed689 | 957 | ret = 0; |
79787eaa | 958 | out: |
b888db2b | 959 | btrfs_end_transaction(trans, root); |
c8b97818 | 960 | |
be20aa9d | 961 | return ret; |
79787eaa JM |
962 | out_unlock: |
963 | extent_clear_unlock_delalloc(inode, | |
964 | &BTRFS_I(inode)->io_tree, | |
beb42dd7 | 965 | start, end, locked_page, |
79787eaa JM |
966 | EXTENT_CLEAR_UNLOCK_PAGE | |
967 | EXTENT_CLEAR_UNLOCK | | |
968 | EXTENT_CLEAR_DELALLOC | | |
969 | EXTENT_CLEAR_DIRTY | | |
970 | EXTENT_SET_WRITEBACK | | |
971 | EXTENT_END_WRITEBACK); | |
972 | ||
973 | goto out; | |
771ed689 | 974 | } |
c8b97818 | 975 | |
771ed689 CM |
976 | /* |
977 | * work queue call back to started compression on a file and pages | |
978 | */ | |
979 | static noinline void async_cow_start(struct btrfs_work *work) | |
980 | { | |
981 | struct async_cow *async_cow; | |
982 | int num_added = 0; | |
983 | async_cow = container_of(work, struct async_cow, work); | |
984 | ||
985 | compress_file_range(async_cow->inode, async_cow->locked_page, | |
986 | async_cow->start, async_cow->end, async_cow, | |
987 | &num_added); | |
8180ef88 | 988 | if (num_added == 0) { |
cb77fcd8 | 989 | btrfs_add_delayed_iput(async_cow->inode); |
771ed689 | 990 | async_cow->inode = NULL; |
8180ef88 | 991 | } |
771ed689 CM |
992 | } |
993 | ||
994 | /* | |
995 | * work queue call back to submit previously compressed pages | |
996 | */ | |
997 | static noinline void async_cow_submit(struct btrfs_work *work) | |
998 | { | |
999 | struct async_cow *async_cow; | |
1000 | struct btrfs_root *root; | |
1001 | unsigned long nr_pages; | |
1002 | ||
1003 | async_cow = container_of(work, struct async_cow, work); | |
1004 | ||
1005 | root = async_cow->root; | |
1006 | nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >> | |
1007 | PAGE_CACHE_SHIFT; | |
1008 | ||
66657b31 | 1009 | if (atomic_sub_return(nr_pages, &root->fs_info->async_delalloc_pages) < |
287082b0 | 1010 | 5 * 1024 * 1024 && |
771ed689 CM |
1011 | waitqueue_active(&root->fs_info->async_submit_wait)) |
1012 | wake_up(&root->fs_info->async_submit_wait); | |
1013 | ||
d397712b | 1014 | if (async_cow->inode) |
771ed689 | 1015 | submit_compressed_extents(async_cow->inode, async_cow); |
771ed689 | 1016 | } |
c8b97818 | 1017 | |
771ed689 CM |
1018 | static noinline void async_cow_free(struct btrfs_work *work) |
1019 | { | |
1020 | struct async_cow *async_cow; | |
1021 | async_cow = container_of(work, struct async_cow, work); | |
8180ef88 | 1022 | if (async_cow->inode) |
cb77fcd8 | 1023 | btrfs_add_delayed_iput(async_cow->inode); |
771ed689 CM |
1024 | kfree(async_cow); |
1025 | } | |
1026 | ||
1027 | static int cow_file_range_async(struct inode *inode, struct page *locked_page, | |
1028 | u64 start, u64 end, int *page_started, | |
1029 | unsigned long *nr_written) | |
1030 | { | |
1031 | struct async_cow *async_cow; | |
1032 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1033 | unsigned long nr_pages; | |
1034 | u64 cur_end; | |
287082b0 | 1035 | int limit = 10 * 1024 * 1024; |
771ed689 | 1036 | |
a3429ab7 CM |
1037 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED, |
1038 | 1, 0, NULL, GFP_NOFS); | |
d397712b | 1039 | while (start < end) { |
771ed689 | 1040 | async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS); |
79787eaa | 1041 | BUG_ON(!async_cow); /* -ENOMEM */ |
8180ef88 | 1042 | async_cow->inode = igrab(inode); |
771ed689 CM |
1043 | async_cow->root = root; |
1044 | async_cow->locked_page = locked_page; | |
1045 | async_cow->start = start; | |
1046 | ||
6cbff00f | 1047 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) |
771ed689 CM |
1048 | cur_end = end; |
1049 | else | |
1050 | cur_end = min(end, start + 512 * 1024 - 1); | |
1051 | ||
1052 | async_cow->end = cur_end; | |
1053 | INIT_LIST_HEAD(&async_cow->extents); | |
1054 | ||
1055 | async_cow->work.func = async_cow_start; | |
1056 | async_cow->work.ordered_func = async_cow_submit; | |
1057 | async_cow->work.ordered_free = async_cow_free; | |
1058 | async_cow->work.flags = 0; | |
1059 | ||
771ed689 CM |
1060 | nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >> |
1061 | PAGE_CACHE_SHIFT; | |
1062 | atomic_add(nr_pages, &root->fs_info->async_delalloc_pages); | |
1063 | ||
1064 | btrfs_queue_worker(&root->fs_info->delalloc_workers, | |
1065 | &async_cow->work); | |
1066 | ||
1067 | if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) { | |
1068 | wait_event(root->fs_info->async_submit_wait, | |
1069 | (atomic_read(&root->fs_info->async_delalloc_pages) < | |
1070 | limit)); | |
1071 | } | |
1072 | ||
d397712b | 1073 | while (atomic_read(&root->fs_info->async_submit_draining) && |
771ed689 CM |
1074 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
1075 | wait_event(root->fs_info->async_submit_wait, | |
1076 | (atomic_read(&root->fs_info->async_delalloc_pages) == | |
1077 | 0)); | |
1078 | } | |
1079 | ||
1080 | *nr_written += nr_pages; | |
1081 | start = cur_end + 1; | |
1082 | } | |
1083 | *page_started = 1; | |
1084 | return 0; | |
be20aa9d CM |
1085 | } |
1086 | ||
d397712b | 1087 | static noinline int csum_exist_in_range(struct btrfs_root *root, |
17d217fe YZ |
1088 | u64 bytenr, u64 num_bytes) |
1089 | { | |
1090 | int ret; | |
1091 | struct btrfs_ordered_sum *sums; | |
1092 | LIST_HEAD(list); | |
1093 | ||
07d400a6 | 1094 | ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr, |
a2de733c | 1095 | bytenr + num_bytes - 1, &list, 0); |
17d217fe YZ |
1096 | if (ret == 0 && list_empty(&list)) |
1097 | return 0; | |
1098 | ||
1099 | while (!list_empty(&list)) { | |
1100 | sums = list_entry(list.next, struct btrfs_ordered_sum, list); | |
1101 | list_del(&sums->list); | |
1102 | kfree(sums); | |
1103 | } | |
1104 | return 1; | |
1105 | } | |
1106 | ||
d352ac68 CM |
1107 | /* |
1108 | * when nowcow writeback call back. This checks for snapshots or COW copies | |
1109 | * of the extents that exist in the file, and COWs the file as required. | |
1110 | * | |
1111 | * If no cow copies or snapshots exist, we write directly to the existing | |
1112 | * blocks on disk | |
1113 | */ | |
7f366cfe CM |
1114 | static noinline int run_delalloc_nocow(struct inode *inode, |
1115 | struct page *locked_page, | |
771ed689 CM |
1116 | u64 start, u64 end, int *page_started, int force, |
1117 | unsigned long *nr_written) | |
be20aa9d | 1118 | { |
be20aa9d | 1119 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7ea394f1 | 1120 | struct btrfs_trans_handle *trans; |
be20aa9d | 1121 | struct extent_buffer *leaf; |
be20aa9d | 1122 | struct btrfs_path *path; |
80ff3856 | 1123 | struct btrfs_file_extent_item *fi; |
be20aa9d | 1124 | struct btrfs_key found_key; |
80ff3856 YZ |
1125 | u64 cow_start; |
1126 | u64 cur_offset; | |
1127 | u64 extent_end; | |
5d4f98a2 | 1128 | u64 extent_offset; |
80ff3856 YZ |
1129 | u64 disk_bytenr; |
1130 | u64 num_bytes; | |
1131 | int extent_type; | |
79787eaa | 1132 | int ret, err; |
d899e052 | 1133 | int type; |
80ff3856 YZ |
1134 | int nocow; |
1135 | int check_prev = 1; | |
82d5902d | 1136 | bool nolock; |
33345d01 | 1137 | u64 ino = btrfs_ino(inode); |
be20aa9d CM |
1138 | |
1139 | path = btrfs_alloc_path(); | |
17ca04af JB |
1140 | if (!path) { |
1141 | extent_clear_unlock_delalloc(inode, | |
1142 | &BTRFS_I(inode)->io_tree, | |
1143 | start, end, locked_page, | |
1144 | EXTENT_CLEAR_UNLOCK_PAGE | | |
1145 | EXTENT_CLEAR_UNLOCK | | |
1146 | EXTENT_CLEAR_DELALLOC | | |
1147 | EXTENT_CLEAR_DIRTY | | |
1148 | EXTENT_SET_WRITEBACK | | |
1149 | EXTENT_END_WRITEBACK); | |
d8926bb3 | 1150 | return -ENOMEM; |
17ca04af | 1151 | } |
82d5902d | 1152 | |
83eea1f1 | 1153 | nolock = btrfs_is_free_space_inode(inode); |
82d5902d LZ |
1154 | |
1155 | if (nolock) | |
7a7eaa40 | 1156 | trans = btrfs_join_transaction_nolock(root); |
82d5902d | 1157 | else |
7a7eaa40 | 1158 | trans = btrfs_join_transaction(root); |
ff5714cc | 1159 | |
79787eaa | 1160 | if (IS_ERR(trans)) { |
17ca04af JB |
1161 | extent_clear_unlock_delalloc(inode, |
1162 | &BTRFS_I(inode)->io_tree, | |
1163 | start, end, locked_page, | |
1164 | EXTENT_CLEAR_UNLOCK_PAGE | | |
1165 | EXTENT_CLEAR_UNLOCK | | |
1166 | EXTENT_CLEAR_DELALLOC | | |
1167 | EXTENT_CLEAR_DIRTY | | |
1168 | EXTENT_SET_WRITEBACK | | |
1169 | EXTENT_END_WRITEBACK); | |
79787eaa JM |
1170 | btrfs_free_path(path); |
1171 | return PTR_ERR(trans); | |
1172 | } | |
1173 | ||
74b21075 | 1174 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
be20aa9d | 1175 | |
80ff3856 YZ |
1176 | cow_start = (u64)-1; |
1177 | cur_offset = start; | |
1178 | while (1) { | |
33345d01 | 1179 | ret = btrfs_lookup_file_extent(trans, root, path, ino, |
80ff3856 | 1180 | cur_offset, 0); |
79787eaa JM |
1181 | if (ret < 0) { |
1182 | btrfs_abort_transaction(trans, root, ret); | |
1183 | goto error; | |
1184 | } | |
80ff3856 YZ |
1185 | if (ret > 0 && path->slots[0] > 0 && check_prev) { |
1186 | leaf = path->nodes[0]; | |
1187 | btrfs_item_key_to_cpu(leaf, &found_key, | |
1188 | path->slots[0] - 1); | |
33345d01 | 1189 | if (found_key.objectid == ino && |
80ff3856 YZ |
1190 | found_key.type == BTRFS_EXTENT_DATA_KEY) |
1191 | path->slots[0]--; | |
1192 | } | |
1193 | check_prev = 0; | |
1194 | next_slot: | |
1195 | leaf = path->nodes[0]; | |
1196 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1197 | ret = btrfs_next_leaf(root, path); | |
79787eaa JM |
1198 | if (ret < 0) { |
1199 | btrfs_abort_transaction(trans, root, ret); | |
1200 | goto error; | |
1201 | } | |
80ff3856 YZ |
1202 | if (ret > 0) |
1203 | break; | |
1204 | leaf = path->nodes[0]; | |
1205 | } | |
be20aa9d | 1206 | |
80ff3856 YZ |
1207 | nocow = 0; |
1208 | disk_bytenr = 0; | |
17d217fe | 1209 | num_bytes = 0; |
80ff3856 YZ |
1210 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
1211 | ||
33345d01 | 1212 | if (found_key.objectid > ino || |
80ff3856 YZ |
1213 | found_key.type > BTRFS_EXTENT_DATA_KEY || |
1214 | found_key.offset > end) | |
1215 | break; | |
1216 | ||
1217 | if (found_key.offset > cur_offset) { | |
1218 | extent_end = found_key.offset; | |
e9061e21 | 1219 | extent_type = 0; |
80ff3856 YZ |
1220 | goto out_check; |
1221 | } | |
1222 | ||
1223 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1224 | struct btrfs_file_extent_item); | |
1225 | extent_type = btrfs_file_extent_type(leaf, fi); | |
1226 | ||
d899e052 YZ |
1227 | if (extent_type == BTRFS_FILE_EXTENT_REG || |
1228 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
80ff3856 | 1229 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
5d4f98a2 | 1230 | extent_offset = btrfs_file_extent_offset(leaf, fi); |
80ff3856 YZ |
1231 | extent_end = found_key.offset + |
1232 | btrfs_file_extent_num_bytes(leaf, fi); | |
1233 | if (extent_end <= start) { | |
1234 | path->slots[0]++; | |
1235 | goto next_slot; | |
1236 | } | |
17d217fe YZ |
1237 | if (disk_bytenr == 0) |
1238 | goto out_check; | |
80ff3856 YZ |
1239 | if (btrfs_file_extent_compression(leaf, fi) || |
1240 | btrfs_file_extent_encryption(leaf, fi) || | |
1241 | btrfs_file_extent_other_encoding(leaf, fi)) | |
1242 | goto out_check; | |
d899e052 YZ |
1243 | if (extent_type == BTRFS_FILE_EXTENT_REG && !force) |
1244 | goto out_check; | |
d2fb3437 | 1245 | if (btrfs_extent_readonly(root, disk_bytenr)) |
80ff3856 | 1246 | goto out_check; |
33345d01 | 1247 | if (btrfs_cross_ref_exist(trans, root, ino, |
5d4f98a2 YZ |
1248 | found_key.offset - |
1249 | extent_offset, disk_bytenr)) | |
17d217fe | 1250 | goto out_check; |
5d4f98a2 | 1251 | disk_bytenr += extent_offset; |
17d217fe YZ |
1252 | disk_bytenr += cur_offset - found_key.offset; |
1253 | num_bytes = min(end + 1, extent_end) - cur_offset; | |
1254 | /* | |
1255 | * force cow if csum exists in the range. | |
1256 | * this ensure that csum for a given extent are | |
1257 | * either valid or do not exist. | |
1258 | */ | |
1259 | if (csum_exist_in_range(root, disk_bytenr, num_bytes)) | |
1260 | goto out_check; | |
80ff3856 YZ |
1261 | nocow = 1; |
1262 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
1263 | extent_end = found_key.offset + | |
1264 | btrfs_file_extent_inline_len(leaf, fi); | |
1265 | extent_end = ALIGN(extent_end, root->sectorsize); | |
1266 | } else { | |
1267 | BUG_ON(1); | |
1268 | } | |
1269 | out_check: | |
1270 | if (extent_end <= start) { | |
1271 | path->slots[0]++; | |
1272 | goto next_slot; | |
1273 | } | |
1274 | if (!nocow) { | |
1275 | if (cow_start == (u64)-1) | |
1276 | cow_start = cur_offset; | |
1277 | cur_offset = extent_end; | |
1278 | if (cur_offset > end) | |
1279 | break; | |
1280 | path->slots[0]++; | |
1281 | goto next_slot; | |
7ea394f1 YZ |
1282 | } |
1283 | ||
b3b4aa74 | 1284 | btrfs_release_path(path); |
80ff3856 YZ |
1285 | if (cow_start != (u64)-1) { |
1286 | ret = cow_file_range(inode, locked_page, cow_start, | |
771ed689 CM |
1287 | found_key.offset - 1, page_started, |
1288 | nr_written, 1); | |
79787eaa JM |
1289 | if (ret) { |
1290 | btrfs_abort_transaction(trans, root, ret); | |
1291 | goto error; | |
1292 | } | |
80ff3856 | 1293 | cow_start = (u64)-1; |
7ea394f1 | 1294 | } |
80ff3856 | 1295 | |
d899e052 YZ |
1296 | if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) { |
1297 | struct extent_map *em; | |
1298 | struct extent_map_tree *em_tree; | |
1299 | em_tree = &BTRFS_I(inode)->extent_tree; | |
172ddd60 | 1300 | em = alloc_extent_map(); |
79787eaa | 1301 | BUG_ON(!em); /* -ENOMEM */ |
d899e052 | 1302 | em->start = cur_offset; |
445a6944 | 1303 | em->orig_start = em->start; |
d899e052 YZ |
1304 | em->len = num_bytes; |
1305 | em->block_len = num_bytes; | |
1306 | em->block_start = disk_bytenr; | |
1307 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
1308 | set_bit(EXTENT_FLAG_PINNED, &em->flags); | |
4e2f84e6 | 1309 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); |
d899e052 | 1310 | while (1) { |
890871be | 1311 | write_lock(&em_tree->lock); |
d899e052 | 1312 | ret = add_extent_mapping(em_tree, em); |
890871be | 1313 | write_unlock(&em_tree->lock); |
d899e052 YZ |
1314 | if (ret != -EEXIST) { |
1315 | free_extent_map(em); | |
1316 | break; | |
1317 | } | |
1318 | btrfs_drop_extent_cache(inode, em->start, | |
1319 | em->start + em->len - 1, 0); | |
1320 | } | |
1321 | type = BTRFS_ORDERED_PREALLOC; | |
1322 | } else { | |
1323 | type = BTRFS_ORDERED_NOCOW; | |
1324 | } | |
80ff3856 YZ |
1325 | |
1326 | ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr, | |
d899e052 | 1327 | num_bytes, num_bytes, type); |
79787eaa | 1328 | BUG_ON(ret); /* -ENOMEM */ |
771ed689 | 1329 | |
efa56464 YZ |
1330 | if (root->root_key.objectid == |
1331 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
1332 | ret = btrfs_reloc_clone_csums(inode, cur_offset, | |
1333 | num_bytes); | |
79787eaa JM |
1334 | if (ret) { |
1335 | btrfs_abort_transaction(trans, root, ret); | |
1336 | goto error; | |
1337 | } | |
efa56464 YZ |
1338 | } |
1339 | ||
d899e052 | 1340 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
a791e35e CM |
1341 | cur_offset, cur_offset + num_bytes - 1, |
1342 | locked_page, EXTENT_CLEAR_UNLOCK_PAGE | | |
1343 | EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
1344 | EXTENT_SET_PRIVATE2); | |
80ff3856 YZ |
1345 | cur_offset = extent_end; |
1346 | if (cur_offset > end) | |
1347 | break; | |
be20aa9d | 1348 | } |
b3b4aa74 | 1349 | btrfs_release_path(path); |
80ff3856 | 1350 | |
17ca04af | 1351 | if (cur_offset <= end && cow_start == (u64)-1) { |
80ff3856 | 1352 | cow_start = cur_offset; |
17ca04af JB |
1353 | cur_offset = end; |
1354 | } | |
1355 | ||
80ff3856 YZ |
1356 | if (cow_start != (u64)-1) { |
1357 | ret = cow_file_range(inode, locked_page, cow_start, end, | |
771ed689 | 1358 | page_started, nr_written, 1); |
79787eaa JM |
1359 | if (ret) { |
1360 | btrfs_abort_transaction(trans, root, ret); | |
1361 | goto error; | |
1362 | } | |
80ff3856 YZ |
1363 | } |
1364 | ||
79787eaa | 1365 | error: |
0cb59c99 | 1366 | if (nolock) { |
79787eaa | 1367 | err = btrfs_end_transaction_nolock(trans, root); |
0cb59c99 | 1368 | } else { |
79787eaa | 1369 | err = btrfs_end_transaction(trans, root); |
0cb59c99 | 1370 | } |
79787eaa JM |
1371 | if (!ret) |
1372 | ret = err; | |
1373 | ||
17ca04af JB |
1374 | if (ret && cur_offset < end) |
1375 | extent_clear_unlock_delalloc(inode, | |
1376 | &BTRFS_I(inode)->io_tree, | |
1377 | cur_offset, end, locked_page, | |
1378 | EXTENT_CLEAR_UNLOCK_PAGE | | |
1379 | EXTENT_CLEAR_UNLOCK | | |
1380 | EXTENT_CLEAR_DELALLOC | | |
1381 | EXTENT_CLEAR_DIRTY | | |
1382 | EXTENT_SET_WRITEBACK | | |
1383 | EXTENT_END_WRITEBACK); | |
1384 | ||
7ea394f1 | 1385 | btrfs_free_path(path); |
79787eaa | 1386 | return ret; |
be20aa9d CM |
1387 | } |
1388 | ||
d352ac68 CM |
1389 | /* |
1390 | * extent_io.c call back to do delayed allocation processing | |
1391 | */ | |
c8b97818 | 1392 | static int run_delalloc_range(struct inode *inode, struct page *locked_page, |
771ed689 CM |
1393 | u64 start, u64 end, int *page_started, |
1394 | unsigned long *nr_written) | |
be20aa9d | 1395 | { |
be20aa9d | 1396 | int ret; |
7f366cfe | 1397 | struct btrfs_root *root = BTRFS_I(inode)->root; |
a2135011 | 1398 | |
7ddf5a42 | 1399 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) { |
c8b97818 | 1400 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1401 | page_started, 1, nr_written); |
7ddf5a42 | 1402 | } else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC) { |
d899e052 | 1403 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1404 | page_started, 0, nr_written); |
7ddf5a42 JB |
1405 | } else if (!btrfs_test_opt(root, COMPRESS) && |
1406 | !(BTRFS_I(inode)->force_compress) && | |
1407 | !(BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS)) { | |
7f366cfe CM |
1408 | ret = cow_file_range(inode, locked_page, start, end, |
1409 | page_started, nr_written, 1); | |
7ddf5a42 JB |
1410 | } else { |
1411 | set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, | |
1412 | &BTRFS_I(inode)->runtime_flags); | |
771ed689 | 1413 | ret = cow_file_range_async(inode, locked_page, start, end, |
d397712b | 1414 | page_started, nr_written); |
7ddf5a42 | 1415 | } |
b888db2b CM |
1416 | return ret; |
1417 | } | |
1418 | ||
1bf85046 JM |
1419 | static void btrfs_split_extent_hook(struct inode *inode, |
1420 | struct extent_state *orig, u64 split) | |
9ed74f2d | 1421 | { |
0ca1f7ce | 1422 | /* not delalloc, ignore it */ |
9ed74f2d | 1423 | if (!(orig->state & EXTENT_DELALLOC)) |
1bf85046 | 1424 | return; |
9ed74f2d | 1425 | |
9e0baf60 JB |
1426 | spin_lock(&BTRFS_I(inode)->lock); |
1427 | BTRFS_I(inode)->outstanding_extents++; | |
1428 | spin_unlock(&BTRFS_I(inode)->lock); | |
9ed74f2d JB |
1429 | } |
1430 | ||
1431 | /* | |
1432 | * extent_io.c merge_extent_hook, used to track merged delayed allocation | |
1433 | * extents so we can keep track of new extents that are just merged onto old | |
1434 | * extents, such as when we are doing sequential writes, so we can properly | |
1435 | * account for the metadata space we'll need. | |
1436 | */ | |
1bf85046 JM |
1437 | static void btrfs_merge_extent_hook(struct inode *inode, |
1438 | struct extent_state *new, | |
1439 | struct extent_state *other) | |
9ed74f2d | 1440 | { |
9ed74f2d JB |
1441 | /* not delalloc, ignore it */ |
1442 | if (!(other->state & EXTENT_DELALLOC)) | |
1bf85046 | 1443 | return; |
9ed74f2d | 1444 | |
9e0baf60 JB |
1445 | spin_lock(&BTRFS_I(inode)->lock); |
1446 | BTRFS_I(inode)->outstanding_extents--; | |
1447 | spin_unlock(&BTRFS_I(inode)->lock); | |
9ed74f2d JB |
1448 | } |
1449 | ||
d352ac68 CM |
1450 | /* |
1451 | * extent_io.c set_bit_hook, used to track delayed allocation | |
1452 | * bytes in this file, and to maintain the list of inodes that | |
1453 | * have pending delalloc work to be done. | |
1454 | */ | |
1bf85046 JM |
1455 | static void btrfs_set_bit_hook(struct inode *inode, |
1456 | struct extent_state *state, int *bits) | |
291d673e | 1457 | { |
9ed74f2d | 1458 | |
75eff68e CM |
1459 | /* |
1460 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 1461 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
1462 | * bit, which is only set or cleared with irqs on |
1463 | */ | |
0ca1f7ce | 1464 | if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) { |
291d673e | 1465 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1466 | u64 len = state->end + 1 - state->start; |
83eea1f1 | 1467 | bool do_list = !btrfs_is_free_space_inode(inode); |
9ed74f2d | 1468 | |
9e0baf60 | 1469 | if (*bits & EXTENT_FIRST_DELALLOC) { |
0ca1f7ce | 1470 | *bits &= ~EXTENT_FIRST_DELALLOC; |
9e0baf60 JB |
1471 | } else { |
1472 | spin_lock(&BTRFS_I(inode)->lock); | |
1473 | BTRFS_I(inode)->outstanding_extents++; | |
1474 | spin_unlock(&BTRFS_I(inode)->lock); | |
1475 | } | |
287a0ab9 | 1476 | |
75eff68e | 1477 | spin_lock(&root->fs_info->delalloc_lock); |
0ca1f7ce YZ |
1478 | BTRFS_I(inode)->delalloc_bytes += len; |
1479 | root->fs_info->delalloc_bytes += len; | |
0cb59c99 | 1480 | if (do_list && list_empty(&BTRFS_I(inode)->delalloc_inodes)) { |
ea8c2819 CM |
1481 | list_add_tail(&BTRFS_I(inode)->delalloc_inodes, |
1482 | &root->fs_info->delalloc_inodes); | |
1483 | } | |
75eff68e | 1484 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e | 1485 | } |
291d673e CM |
1486 | } |
1487 | ||
d352ac68 CM |
1488 | /* |
1489 | * extent_io.c clear_bit_hook, see set_bit_hook for why | |
1490 | */ | |
1bf85046 JM |
1491 | static void btrfs_clear_bit_hook(struct inode *inode, |
1492 | struct extent_state *state, int *bits) | |
291d673e | 1493 | { |
75eff68e CM |
1494 | /* |
1495 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 1496 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
1497 | * bit, which is only set or cleared with irqs on |
1498 | */ | |
0ca1f7ce | 1499 | if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) { |
291d673e | 1500 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1501 | u64 len = state->end + 1 - state->start; |
83eea1f1 | 1502 | bool do_list = !btrfs_is_free_space_inode(inode); |
bcbfce8a | 1503 | |
9e0baf60 | 1504 | if (*bits & EXTENT_FIRST_DELALLOC) { |
0ca1f7ce | 1505 | *bits &= ~EXTENT_FIRST_DELALLOC; |
9e0baf60 JB |
1506 | } else if (!(*bits & EXTENT_DO_ACCOUNTING)) { |
1507 | spin_lock(&BTRFS_I(inode)->lock); | |
1508 | BTRFS_I(inode)->outstanding_extents--; | |
1509 | spin_unlock(&BTRFS_I(inode)->lock); | |
1510 | } | |
0ca1f7ce YZ |
1511 | |
1512 | if (*bits & EXTENT_DO_ACCOUNTING) | |
1513 | btrfs_delalloc_release_metadata(inode, len); | |
1514 | ||
0cb59c99 JB |
1515 | if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID |
1516 | && do_list) | |
0ca1f7ce | 1517 | btrfs_free_reserved_data_space(inode, len); |
9ed74f2d | 1518 | |
75eff68e | 1519 | spin_lock(&root->fs_info->delalloc_lock); |
0ca1f7ce YZ |
1520 | root->fs_info->delalloc_bytes -= len; |
1521 | BTRFS_I(inode)->delalloc_bytes -= len; | |
1522 | ||
0cb59c99 | 1523 | if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 && |
ea8c2819 CM |
1524 | !list_empty(&BTRFS_I(inode)->delalloc_inodes)) { |
1525 | list_del_init(&BTRFS_I(inode)->delalloc_inodes); | |
1526 | } | |
75eff68e | 1527 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e | 1528 | } |
291d673e CM |
1529 | } |
1530 | ||
d352ac68 CM |
1531 | /* |
1532 | * extent_io.c merge_bio_hook, this must check the chunk tree to make sure | |
1533 | * we don't create bios that span stripes or chunks | |
1534 | */ | |
239b14b3 | 1535 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, |
c8b97818 CM |
1536 | size_t size, struct bio *bio, |
1537 | unsigned long bio_flags) | |
239b14b3 CM |
1538 | { |
1539 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
1540 | struct btrfs_mapping_tree *map_tree; | |
a62b9401 | 1541 | u64 logical = (u64)bio->bi_sector << 9; |
239b14b3 CM |
1542 | u64 length = 0; |
1543 | u64 map_length; | |
239b14b3 CM |
1544 | int ret; |
1545 | ||
771ed689 CM |
1546 | if (bio_flags & EXTENT_BIO_COMPRESSED) |
1547 | return 0; | |
1548 | ||
f2d8d74d | 1549 | length = bio->bi_size; |
239b14b3 CM |
1550 | map_tree = &root->fs_info->mapping_tree; |
1551 | map_length = length; | |
cea9e445 | 1552 | ret = btrfs_map_block(map_tree, READ, logical, |
f188591e | 1553 | &map_length, NULL, 0); |
3444a972 JM |
1554 | /* Will always return 0 or 1 with map_multi == NULL */ |
1555 | BUG_ON(ret < 0); | |
d397712b | 1556 | if (map_length < length + size) |
239b14b3 | 1557 | return 1; |
3444a972 | 1558 | return 0; |
239b14b3 CM |
1559 | } |
1560 | ||
d352ac68 CM |
1561 | /* |
1562 | * in order to insert checksums into the metadata in large chunks, | |
1563 | * we wait until bio submission time. All the pages in the bio are | |
1564 | * checksummed and sums are attached onto the ordered extent record. | |
1565 | * | |
1566 | * At IO completion time the cums attached on the ordered extent record | |
1567 | * are inserted into the btree | |
1568 | */ | |
d397712b CM |
1569 | static int __btrfs_submit_bio_start(struct inode *inode, int rw, |
1570 | struct bio *bio, int mirror_num, | |
eaf25d93 CM |
1571 | unsigned long bio_flags, |
1572 | u64 bio_offset) | |
065631f6 | 1573 | { |
065631f6 | 1574 | struct btrfs_root *root = BTRFS_I(inode)->root; |
065631f6 | 1575 | int ret = 0; |
e015640f | 1576 | |
d20f7043 | 1577 | ret = btrfs_csum_one_bio(root, inode, bio, 0, 0); |
79787eaa | 1578 | BUG_ON(ret); /* -ENOMEM */ |
4a69a410 CM |
1579 | return 0; |
1580 | } | |
e015640f | 1581 | |
4a69a410 CM |
1582 | /* |
1583 | * in order to insert checksums into the metadata in large chunks, | |
1584 | * we wait until bio submission time. All the pages in the bio are | |
1585 | * checksummed and sums are attached onto the ordered extent record. | |
1586 | * | |
1587 | * At IO completion time the cums attached on the ordered extent record | |
1588 | * are inserted into the btree | |
1589 | */ | |
b2950863 | 1590 | static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio, |
eaf25d93 CM |
1591 | int mirror_num, unsigned long bio_flags, |
1592 | u64 bio_offset) | |
4a69a410 CM |
1593 | { |
1594 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
8b712842 | 1595 | return btrfs_map_bio(root, rw, bio, mirror_num, 1); |
44b8bd7e CM |
1596 | } |
1597 | ||
d352ac68 | 1598 | /* |
cad321ad CM |
1599 | * extent_io.c submission hook. This does the right thing for csum calculation |
1600 | * on write, or reading the csums from the tree before a read | |
d352ac68 | 1601 | */ |
b2950863 | 1602 | static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio, |
eaf25d93 CM |
1603 | int mirror_num, unsigned long bio_flags, |
1604 | u64 bio_offset) | |
44b8bd7e CM |
1605 | { |
1606 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1607 | int ret = 0; | |
19b9bdb0 | 1608 | int skip_sum; |
0417341e | 1609 | int metadata = 0; |
44b8bd7e | 1610 | |
6cbff00f | 1611 | skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; |
cad321ad | 1612 | |
83eea1f1 | 1613 | if (btrfs_is_free_space_inode(inode)) |
0417341e JM |
1614 | metadata = 2; |
1615 | ||
7b6d91da | 1616 | if (!(rw & REQ_WRITE)) { |
5fd02043 JB |
1617 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, metadata); |
1618 | if (ret) | |
1619 | return ret; | |
1620 | ||
d20f7043 | 1621 | if (bio_flags & EXTENT_BIO_COMPRESSED) { |
c8b97818 CM |
1622 | return btrfs_submit_compressed_read(inode, bio, |
1623 | mirror_num, bio_flags); | |
c2db1073 TI |
1624 | } else if (!skip_sum) { |
1625 | ret = btrfs_lookup_bio_sums(root, inode, bio, NULL); | |
1626 | if (ret) | |
1627 | return ret; | |
1628 | } | |
4d1b5fb4 | 1629 | goto mapit; |
19b9bdb0 | 1630 | } else if (!skip_sum) { |
17d217fe YZ |
1631 | /* csum items have already been cloned */ |
1632 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) | |
1633 | goto mapit; | |
19b9bdb0 CM |
1634 | /* we're doing a write, do the async checksumming */ |
1635 | return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info, | |
44b8bd7e | 1636 | inode, rw, bio, mirror_num, |
eaf25d93 CM |
1637 | bio_flags, bio_offset, |
1638 | __btrfs_submit_bio_start, | |
4a69a410 | 1639 | __btrfs_submit_bio_done); |
19b9bdb0 CM |
1640 | } |
1641 | ||
0b86a832 | 1642 | mapit: |
8b712842 | 1643 | return btrfs_map_bio(root, rw, bio, mirror_num, 0); |
065631f6 | 1644 | } |
6885f308 | 1645 | |
d352ac68 CM |
1646 | /* |
1647 | * given a list of ordered sums record them in the inode. This happens | |
1648 | * at IO completion time based on sums calculated at bio submission time. | |
1649 | */ | |
ba1da2f4 | 1650 | static noinline int add_pending_csums(struct btrfs_trans_handle *trans, |
e6dcd2dc CM |
1651 | struct inode *inode, u64 file_offset, |
1652 | struct list_head *list) | |
1653 | { | |
e6dcd2dc CM |
1654 | struct btrfs_ordered_sum *sum; |
1655 | ||
c6e30871 | 1656 | list_for_each_entry(sum, list, list) { |
d20f7043 CM |
1657 | btrfs_csum_file_blocks(trans, |
1658 | BTRFS_I(inode)->root->fs_info->csum_root, sum); | |
e6dcd2dc CM |
1659 | } |
1660 | return 0; | |
1661 | } | |
1662 | ||
2ac55d41 JB |
1663 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end, |
1664 | struct extent_state **cached_state) | |
ea8c2819 | 1665 | { |
d397712b | 1666 | if ((end & (PAGE_CACHE_SIZE - 1)) == 0) |
771ed689 | 1667 | WARN_ON(1); |
ea8c2819 | 1668 | return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end, |
2ac55d41 | 1669 | cached_state, GFP_NOFS); |
ea8c2819 CM |
1670 | } |
1671 | ||
d352ac68 | 1672 | /* see btrfs_writepage_start_hook for details on why this is required */ |
247e743c CM |
1673 | struct btrfs_writepage_fixup { |
1674 | struct page *page; | |
1675 | struct btrfs_work work; | |
1676 | }; | |
1677 | ||
b2950863 | 1678 | static void btrfs_writepage_fixup_worker(struct btrfs_work *work) |
247e743c CM |
1679 | { |
1680 | struct btrfs_writepage_fixup *fixup; | |
1681 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 1682 | struct extent_state *cached_state = NULL; |
247e743c CM |
1683 | struct page *page; |
1684 | struct inode *inode; | |
1685 | u64 page_start; | |
1686 | u64 page_end; | |
87826df0 | 1687 | int ret; |
247e743c CM |
1688 | |
1689 | fixup = container_of(work, struct btrfs_writepage_fixup, work); | |
1690 | page = fixup->page; | |
4a096752 | 1691 | again: |
247e743c CM |
1692 | lock_page(page); |
1693 | if (!page->mapping || !PageDirty(page) || !PageChecked(page)) { | |
1694 | ClearPageChecked(page); | |
1695 | goto out_page; | |
1696 | } | |
1697 | ||
1698 | inode = page->mapping->host; | |
1699 | page_start = page_offset(page); | |
1700 | page_end = page_offset(page) + PAGE_CACHE_SIZE - 1; | |
1701 | ||
2ac55d41 | 1702 | lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0, |
d0082371 | 1703 | &cached_state); |
4a096752 CM |
1704 | |
1705 | /* already ordered? We're done */ | |
8b62b72b | 1706 | if (PagePrivate2(page)) |
247e743c | 1707 | goto out; |
4a096752 CM |
1708 | |
1709 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
1710 | if (ordered) { | |
2ac55d41 JB |
1711 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, |
1712 | page_end, &cached_state, GFP_NOFS); | |
4a096752 CM |
1713 | unlock_page(page); |
1714 | btrfs_start_ordered_extent(inode, ordered, 1); | |
87826df0 | 1715 | btrfs_put_ordered_extent(ordered); |
4a096752 CM |
1716 | goto again; |
1717 | } | |
247e743c | 1718 | |
87826df0 JM |
1719 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); |
1720 | if (ret) { | |
1721 | mapping_set_error(page->mapping, ret); | |
1722 | end_extent_writepage(page, ret, page_start, page_end); | |
1723 | ClearPageChecked(page); | |
1724 | goto out; | |
1725 | } | |
1726 | ||
2ac55d41 | 1727 | btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state); |
247e743c | 1728 | ClearPageChecked(page); |
87826df0 | 1729 | set_page_dirty(page); |
247e743c | 1730 | out: |
2ac55d41 JB |
1731 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end, |
1732 | &cached_state, GFP_NOFS); | |
247e743c CM |
1733 | out_page: |
1734 | unlock_page(page); | |
1735 | page_cache_release(page); | |
b897abec | 1736 | kfree(fixup); |
247e743c CM |
1737 | } |
1738 | ||
1739 | /* | |
1740 | * There are a few paths in the higher layers of the kernel that directly | |
1741 | * set the page dirty bit without asking the filesystem if it is a | |
1742 | * good idea. This causes problems because we want to make sure COW | |
1743 | * properly happens and the data=ordered rules are followed. | |
1744 | * | |
c8b97818 | 1745 | * In our case any range that doesn't have the ORDERED bit set |
247e743c CM |
1746 | * hasn't been properly setup for IO. We kick off an async process |
1747 | * to fix it up. The async helper will wait for ordered extents, set | |
1748 | * the delalloc bit and make it safe to write the page. | |
1749 | */ | |
b2950863 | 1750 | static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end) |
247e743c CM |
1751 | { |
1752 | struct inode *inode = page->mapping->host; | |
1753 | struct btrfs_writepage_fixup *fixup; | |
1754 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
247e743c | 1755 | |
8b62b72b CM |
1756 | /* this page is properly in the ordered list */ |
1757 | if (TestClearPagePrivate2(page)) | |
247e743c CM |
1758 | return 0; |
1759 | ||
1760 | if (PageChecked(page)) | |
1761 | return -EAGAIN; | |
1762 | ||
1763 | fixup = kzalloc(sizeof(*fixup), GFP_NOFS); | |
1764 | if (!fixup) | |
1765 | return -EAGAIN; | |
f421950f | 1766 | |
247e743c CM |
1767 | SetPageChecked(page); |
1768 | page_cache_get(page); | |
1769 | fixup->work.func = btrfs_writepage_fixup_worker; | |
1770 | fixup->page = page; | |
1771 | btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work); | |
87826df0 | 1772 | return -EBUSY; |
247e743c CM |
1773 | } |
1774 | ||
d899e052 YZ |
1775 | static int insert_reserved_file_extent(struct btrfs_trans_handle *trans, |
1776 | struct inode *inode, u64 file_pos, | |
1777 | u64 disk_bytenr, u64 disk_num_bytes, | |
1778 | u64 num_bytes, u64 ram_bytes, | |
1779 | u8 compression, u8 encryption, | |
1780 | u16 other_encoding, int extent_type) | |
1781 | { | |
1782 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1783 | struct btrfs_file_extent_item *fi; | |
1784 | struct btrfs_path *path; | |
1785 | struct extent_buffer *leaf; | |
1786 | struct btrfs_key ins; | |
d899e052 YZ |
1787 | int ret; |
1788 | ||
1789 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
1790 | if (!path) |
1791 | return -ENOMEM; | |
d899e052 | 1792 | |
b9473439 | 1793 | path->leave_spinning = 1; |
a1ed835e CM |
1794 | |
1795 | /* | |
1796 | * we may be replacing one extent in the tree with another. | |
1797 | * The new extent is pinned in the extent map, and we don't want | |
1798 | * to drop it from the cache until it is completely in the btree. | |
1799 | * | |
1800 | * So, tell btrfs_drop_extents to leave this extent in the cache. | |
1801 | * the caller is expected to unpin it and allow it to be merged | |
1802 | * with the others. | |
1803 | */ | |
5dc562c5 | 1804 | ret = btrfs_drop_extents(trans, root, inode, file_pos, |
2671485d | 1805 | file_pos + num_bytes, 0); |
79787eaa JM |
1806 | if (ret) |
1807 | goto out; | |
d899e052 | 1808 | |
33345d01 | 1809 | ins.objectid = btrfs_ino(inode); |
d899e052 YZ |
1810 | ins.offset = file_pos; |
1811 | ins.type = BTRFS_EXTENT_DATA_KEY; | |
1812 | ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi)); | |
79787eaa JM |
1813 | if (ret) |
1814 | goto out; | |
d899e052 YZ |
1815 | leaf = path->nodes[0]; |
1816 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1817 | struct btrfs_file_extent_item); | |
1818 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); | |
1819 | btrfs_set_file_extent_type(leaf, fi, extent_type); | |
1820 | btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr); | |
1821 | btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes); | |
1822 | btrfs_set_file_extent_offset(leaf, fi, 0); | |
1823 | btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes); | |
1824 | btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes); | |
1825 | btrfs_set_file_extent_compression(leaf, fi, compression); | |
1826 | btrfs_set_file_extent_encryption(leaf, fi, encryption); | |
1827 | btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding); | |
b9473439 CM |
1828 | |
1829 | btrfs_unlock_up_safe(path, 1); | |
1830 | btrfs_set_lock_blocking(leaf); | |
1831 | ||
d899e052 YZ |
1832 | btrfs_mark_buffer_dirty(leaf); |
1833 | ||
1834 | inode_add_bytes(inode, num_bytes); | |
d899e052 YZ |
1835 | |
1836 | ins.objectid = disk_bytenr; | |
1837 | ins.offset = disk_num_bytes; | |
1838 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
5d4f98a2 YZ |
1839 | ret = btrfs_alloc_reserved_file_extent(trans, root, |
1840 | root->root_key.objectid, | |
33345d01 | 1841 | btrfs_ino(inode), file_pos, &ins); |
79787eaa | 1842 | out: |
d899e052 | 1843 | btrfs_free_path(path); |
b9473439 | 1844 | |
79787eaa | 1845 | return ret; |
d899e052 YZ |
1846 | } |
1847 | ||
5d13a98f CM |
1848 | /* |
1849 | * helper function for btrfs_finish_ordered_io, this | |
1850 | * just reads in some of the csum leaves to prime them into ram | |
1851 | * before we start the transaction. It limits the amount of btree | |
1852 | * reads required while inside the transaction. | |
1853 | */ | |
d352ac68 CM |
1854 | /* as ordered data IO finishes, this gets called so we can finish |
1855 | * an ordered extent if the range of bytes in the file it covers are | |
1856 | * fully written. | |
1857 | */ | |
5fd02043 | 1858 | static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent) |
e6dcd2dc | 1859 | { |
5fd02043 | 1860 | struct inode *inode = ordered_extent->inode; |
e6dcd2dc | 1861 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1862 | struct btrfs_trans_handle *trans = NULL; |
e6dcd2dc | 1863 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
2ac55d41 | 1864 | struct extent_state *cached_state = NULL; |
261507a0 | 1865 | int compress_type = 0; |
e6dcd2dc | 1866 | int ret; |
82d5902d | 1867 | bool nolock; |
e6dcd2dc | 1868 | |
83eea1f1 | 1869 | nolock = btrfs_is_free_space_inode(inode); |
0cb59c99 | 1870 | |
5fd02043 JB |
1871 | if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) { |
1872 | ret = -EIO; | |
1873 | goto out; | |
1874 | } | |
1875 | ||
c2167754 | 1876 | if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) { |
79787eaa | 1877 | BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */ |
c2167754 YZ |
1878 | ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent); |
1879 | if (!ret) { | |
0cb59c99 | 1880 | if (nolock) |
7a7eaa40 | 1881 | trans = btrfs_join_transaction_nolock(root); |
0cb59c99 | 1882 | else |
7a7eaa40 | 1883 | trans = btrfs_join_transaction(root); |
d280e5be LB |
1884 | if (IS_ERR(trans)) { |
1885 | ret = PTR_ERR(trans); | |
1886 | trans = NULL; | |
1887 | goto out; | |
1888 | } | |
0ca1f7ce | 1889 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
2115133f | 1890 | ret = btrfs_update_inode_fallback(trans, root, inode); |
79787eaa JM |
1891 | if (ret) /* -ENOMEM or corruption */ |
1892 | btrfs_abort_transaction(trans, root, ret); | |
c2167754 YZ |
1893 | } |
1894 | goto out; | |
1895 | } | |
e6dcd2dc | 1896 | |
2ac55d41 JB |
1897 | lock_extent_bits(io_tree, ordered_extent->file_offset, |
1898 | ordered_extent->file_offset + ordered_extent->len - 1, | |
d0082371 | 1899 | 0, &cached_state); |
e6dcd2dc | 1900 | |
0cb59c99 | 1901 | if (nolock) |
7a7eaa40 | 1902 | trans = btrfs_join_transaction_nolock(root); |
0cb59c99 | 1903 | else |
7a7eaa40 | 1904 | trans = btrfs_join_transaction(root); |
79787eaa JM |
1905 | if (IS_ERR(trans)) { |
1906 | ret = PTR_ERR(trans); | |
1907 | trans = NULL; | |
1908 | goto out_unlock; | |
1909 | } | |
0ca1f7ce | 1910 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
c2167754 | 1911 | |
c8b97818 | 1912 | if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags)) |
261507a0 | 1913 | compress_type = ordered_extent->compress_type; |
d899e052 | 1914 | if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { |
261507a0 | 1915 | BUG_ON(compress_type); |
920bbbfb | 1916 | ret = btrfs_mark_extent_written(trans, inode, |
d899e052 YZ |
1917 | ordered_extent->file_offset, |
1918 | ordered_extent->file_offset + | |
1919 | ordered_extent->len); | |
d899e052 | 1920 | } else { |
0af3d00b | 1921 | BUG_ON(root == root->fs_info->tree_root); |
d899e052 YZ |
1922 | ret = insert_reserved_file_extent(trans, inode, |
1923 | ordered_extent->file_offset, | |
1924 | ordered_extent->start, | |
1925 | ordered_extent->disk_len, | |
1926 | ordered_extent->len, | |
1927 | ordered_extent->len, | |
261507a0 | 1928 | compress_type, 0, 0, |
d899e052 | 1929 | BTRFS_FILE_EXTENT_REG); |
d899e052 | 1930 | } |
5dc562c5 JB |
1931 | unpin_extent_cache(&BTRFS_I(inode)->extent_tree, |
1932 | ordered_extent->file_offset, ordered_extent->len, | |
1933 | trans->transid); | |
79787eaa JM |
1934 | if (ret < 0) { |
1935 | btrfs_abort_transaction(trans, root, ret); | |
5fd02043 | 1936 | goto out_unlock; |
79787eaa | 1937 | } |
2ac55d41 | 1938 | |
e6dcd2dc CM |
1939 | add_pending_csums(trans, inode, ordered_extent->file_offset, |
1940 | &ordered_extent->list); | |
1941 | ||
1ef30be1 | 1942 | ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent); |
a39f7521 | 1943 | if (!ret || !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { |
2115133f | 1944 | ret = btrfs_update_inode_fallback(trans, root, inode); |
79787eaa JM |
1945 | if (ret) { /* -ENOMEM or corruption */ |
1946 | btrfs_abort_transaction(trans, root, ret); | |
5fd02043 | 1947 | goto out_unlock; |
79787eaa | 1948 | } |
7c735313 JB |
1949 | } else { |
1950 | btrfs_set_inode_last_trans(trans, inode); | |
1ef30be1 JB |
1951 | } |
1952 | ret = 0; | |
5fd02043 JB |
1953 | out_unlock: |
1954 | unlock_extent_cached(io_tree, ordered_extent->file_offset, | |
1955 | ordered_extent->file_offset + | |
1956 | ordered_extent->len - 1, &cached_state, GFP_NOFS); | |
c2167754 | 1957 | out: |
5b0e95bf | 1958 | if (root != root->fs_info->tree_root) |
0cb59c99 | 1959 | btrfs_delalloc_release_metadata(inode, ordered_extent->len); |
5b0e95bf JB |
1960 | if (trans) { |
1961 | if (nolock) | |
0cb59c99 | 1962 | btrfs_end_transaction_nolock(trans, root); |
5b0e95bf | 1963 | else |
0cb59c99 JB |
1964 | btrfs_end_transaction(trans, root); |
1965 | } | |
1966 | ||
5fd02043 JB |
1967 | if (ret) |
1968 | clear_extent_uptodate(io_tree, ordered_extent->file_offset, | |
1969 | ordered_extent->file_offset + | |
1970 | ordered_extent->len - 1, NULL, GFP_NOFS); | |
1971 | ||
1972 | /* | |
1973 | * This needs to be dont to make sure anybody waiting knows we are done | |
1974 | * upating everything for this ordered extent. | |
1975 | */ | |
1976 | btrfs_remove_ordered_extent(inode, ordered_extent); | |
1977 | ||
e6dcd2dc CM |
1978 | /* once for us */ |
1979 | btrfs_put_ordered_extent(ordered_extent); | |
1980 | /* once for the tree */ | |
1981 | btrfs_put_ordered_extent(ordered_extent); | |
1982 | ||
5fd02043 JB |
1983 | return ret; |
1984 | } | |
1985 | ||
1986 | static void finish_ordered_fn(struct btrfs_work *work) | |
1987 | { | |
1988 | struct btrfs_ordered_extent *ordered_extent; | |
1989 | ordered_extent = container_of(work, struct btrfs_ordered_extent, work); | |
1990 | btrfs_finish_ordered_io(ordered_extent); | |
e6dcd2dc CM |
1991 | } |
1992 | ||
b2950863 | 1993 | static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end, |
211f90e6 CM |
1994 | struct extent_state *state, int uptodate) |
1995 | { | |
5fd02043 JB |
1996 | struct inode *inode = page->mapping->host; |
1997 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1998 | struct btrfs_ordered_extent *ordered_extent = NULL; | |
1999 | struct btrfs_workers *workers; | |
2000 | ||
1abe9b8a | 2001 | trace_btrfs_writepage_end_io_hook(page, start, end, uptodate); |
2002 | ||
8b62b72b | 2003 | ClearPagePrivate2(page); |
5fd02043 JB |
2004 | if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start, |
2005 | end - start + 1, uptodate)) | |
2006 | return 0; | |
2007 | ||
2008 | ordered_extent->work.func = finish_ordered_fn; | |
2009 | ordered_extent->work.flags = 0; | |
2010 | ||
83eea1f1 | 2011 | if (btrfs_is_free_space_inode(inode)) |
5fd02043 JB |
2012 | workers = &root->fs_info->endio_freespace_worker; |
2013 | else | |
2014 | workers = &root->fs_info->endio_write_workers; | |
2015 | btrfs_queue_worker(workers, &ordered_extent->work); | |
2016 | ||
2017 | return 0; | |
211f90e6 CM |
2018 | } |
2019 | ||
d352ac68 CM |
2020 | /* |
2021 | * when reads are done, we need to check csums to verify the data is correct | |
4a54c8c1 JS |
2022 | * if there's a match, we allow the bio to finish. If not, the code in |
2023 | * extent_io.c will try to find good copies for us. | |
d352ac68 | 2024 | */ |
b2950863 | 2025 | static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end, |
5cf1ab56 | 2026 | struct extent_state *state, int mirror) |
07157aac | 2027 | { |
35ebb934 | 2028 | size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT); |
07157aac | 2029 | struct inode *inode = page->mapping->host; |
d1310b2e | 2030 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
07157aac | 2031 | char *kaddr; |
aadfeb6e | 2032 | u64 private = ~(u32)0; |
07157aac | 2033 | int ret; |
ff79f819 CM |
2034 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2035 | u32 csum = ~(u32)0; | |
d1310b2e | 2036 | |
d20f7043 CM |
2037 | if (PageChecked(page)) { |
2038 | ClearPageChecked(page); | |
2039 | goto good; | |
2040 | } | |
6cbff00f CH |
2041 | |
2042 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) | |
08d2f347 | 2043 | goto good; |
17d217fe YZ |
2044 | |
2045 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID && | |
9655d298 | 2046 | test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) { |
17d217fe YZ |
2047 | clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM, |
2048 | GFP_NOFS); | |
b6cda9bc | 2049 | return 0; |
17d217fe | 2050 | } |
d20f7043 | 2051 | |
c2e639f0 | 2052 | if (state && state->start == start) { |
70dec807 CM |
2053 | private = state->private; |
2054 | ret = 0; | |
2055 | } else { | |
2056 | ret = get_state_private(io_tree, start, &private); | |
2057 | } | |
7ac687d9 | 2058 | kaddr = kmap_atomic(page); |
d397712b | 2059 | if (ret) |
07157aac | 2060 | goto zeroit; |
d397712b | 2061 | |
ff79f819 CM |
2062 | csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1); |
2063 | btrfs_csum_final(csum, (char *)&csum); | |
d397712b | 2064 | if (csum != private) |
07157aac | 2065 | goto zeroit; |
d397712b | 2066 | |
7ac687d9 | 2067 | kunmap_atomic(kaddr); |
d20f7043 | 2068 | good: |
07157aac CM |
2069 | return 0; |
2070 | ||
2071 | zeroit: | |
945d8962 | 2072 | printk_ratelimited(KERN_INFO "btrfs csum failed ino %llu off %llu csum %u " |
33345d01 LZ |
2073 | "private %llu\n", |
2074 | (unsigned long long)btrfs_ino(page->mapping->host), | |
193f284d CM |
2075 | (unsigned long long)start, csum, |
2076 | (unsigned long long)private); | |
db94535d CM |
2077 | memset(kaddr + offset, 1, end - start + 1); |
2078 | flush_dcache_page(page); | |
7ac687d9 | 2079 | kunmap_atomic(kaddr); |
3b951516 CM |
2080 | if (private == 0) |
2081 | return 0; | |
7e38326f | 2082 | return -EIO; |
07157aac | 2083 | } |
b888db2b | 2084 | |
24bbcf04 YZ |
2085 | struct delayed_iput { |
2086 | struct list_head list; | |
2087 | struct inode *inode; | |
2088 | }; | |
2089 | ||
79787eaa JM |
2090 | /* JDM: If this is fs-wide, why can't we add a pointer to |
2091 | * btrfs_inode instead and avoid the allocation? */ | |
24bbcf04 YZ |
2092 | void btrfs_add_delayed_iput(struct inode *inode) |
2093 | { | |
2094 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
2095 | struct delayed_iput *delayed; | |
2096 | ||
2097 | if (atomic_add_unless(&inode->i_count, -1, 1)) | |
2098 | return; | |
2099 | ||
2100 | delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL); | |
2101 | delayed->inode = inode; | |
2102 | ||
2103 | spin_lock(&fs_info->delayed_iput_lock); | |
2104 | list_add_tail(&delayed->list, &fs_info->delayed_iputs); | |
2105 | spin_unlock(&fs_info->delayed_iput_lock); | |
2106 | } | |
2107 | ||
2108 | void btrfs_run_delayed_iputs(struct btrfs_root *root) | |
2109 | { | |
2110 | LIST_HEAD(list); | |
2111 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2112 | struct delayed_iput *delayed; | |
2113 | int empty; | |
2114 | ||
2115 | spin_lock(&fs_info->delayed_iput_lock); | |
2116 | empty = list_empty(&fs_info->delayed_iputs); | |
2117 | spin_unlock(&fs_info->delayed_iput_lock); | |
2118 | if (empty) | |
2119 | return; | |
2120 | ||
24bbcf04 YZ |
2121 | spin_lock(&fs_info->delayed_iput_lock); |
2122 | list_splice_init(&fs_info->delayed_iputs, &list); | |
2123 | spin_unlock(&fs_info->delayed_iput_lock); | |
2124 | ||
2125 | while (!list_empty(&list)) { | |
2126 | delayed = list_entry(list.next, struct delayed_iput, list); | |
2127 | list_del(&delayed->list); | |
2128 | iput(delayed->inode); | |
2129 | kfree(delayed); | |
2130 | } | |
24bbcf04 YZ |
2131 | } |
2132 | ||
d68fc57b YZ |
2133 | enum btrfs_orphan_cleanup_state { |
2134 | ORPHAN_CLEANUP_STARTED = 1, | |
2135 | ORPHAN_CLEANUP_DONE = 2, | |
2136 | }; | |
2137 | ||
2138 | /* | |
42b2aa86 | 2139 | * This is called in transaction commit time. If there are no orphan |
d68fc57b YZ |
2140 | * files in the subvolume, it removes orphan item and frees block_rsv |
2141 | * structure. | |
2142 | */ | |
2143 | void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans, | |
2144 | struct btrfs_root *root) | |
2145 | { | |
90290e19 | 2146 | struct btrfs_block_rsv *block_rsv; |
d68fc57b YZ |
2147 | int ret; |
2148 | ||
8a35d95f | 2149 | if (atomic_read(&root->orphan_inodes) || |
d68fc57b YZ |
2150 | root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) |
2151 | return; | |
2152 | ||
90290e19 | 2153 | spin_lock(&root->orphan_lock); |
8a35d95f | 2154 | if (atomic_read(&root->orphan_inodes)) { |
90290e19 JB |
2155 | spin_unlock(&root->orphan_lock); |
2156 | return; | |
2157 | } | |
2158 | ||
2159 | if (root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) { | |
2160 | spin_unlock(&root->orphan_lock); | |
2161 | return; | |
2162 | } | |
2163 | ||
2164 | block_rsv = root->orphan_block_rsv; | |
2165 | root->orphan_block_rsv = NULL; | |
2166 | spin_unlock(&root->orphan_lock); | |
2167 | ||
d68fc57b YZ |
2168 | if (root->orphan_item_inserted && |
2169 | btrfs_root_refs(&root->root_item) > 0) { | |
2170 | ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root, | |
2171 | root->root_key.objectid); | |
2172 | BUG_ON(ret); | |
2173 | root->orphan_item_inserted = 0; | |
2174 | } | |
2175 | ||
90290e19 JB |
2176 | if (block_rsv) { |
2177 | WARN_ON(block_rsv->size > 0); | |
2178 | btrfs_free_block_rsv(root, block_rsv); | |
d68fc57b YZ |
2179 | } |
2180 | } | |
2181 | ||
7b128766 JB |
2182 | /* |
2183 | * This creates an orphan entry for the given inode in case something goes | |
2184 | * wrong in the middle of an unlink/truncate. | |
d68fc57b YZ |
2185 | * |
2186 | * NOTE: caller of this function should reserve 5 units of metadata for | |
2187 | * this function. | |
7b128766 JB |
2188 | */ |
2189 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode) | |
2190 | { | |
2191 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d68fc57b YZ |
2192 | struct btrfs_block_rsv *block_rsv = NULL; |
2193 | int reserve = 0; | |
2194 | int insert = 0; | |
2195 | int ret; | |
7b128766 | 2196 | |
d68fc57b | 2197 | if (!root->orphan_block_rsv) { |
66d8f3dd | 2198 | block_rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP); |
b532402e TI |
2199 | if (!block_rsv) |
2200 | return -ENOMEM; | |
d68fc57b | 2201 | } |
7b128766 | 2202 | |
d68fc57b YZ |
2203 | spin_lock(&root->orphan_lock); |
2204 | if (!root->orphan_block_rsv) { | |
2205 | root->orphan_block_rsv = block_rsv; | |
2206 | } else if (block_rsv) { | |
2207 | btrfs_free_block_rsv(root, block_rsv); | |
2208 | block_rsv = NULL; | |
7b128766 | 2209 | } |
7b128766 | 2210 | |
8a35d95f JB |
2211 | if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
2212 | &BTRFS_I(inode)->runtime_flags)) { | |
d68fc57b YZ |
2213 | #if 0 |
2214 | /* | |
2215 | * For proper ENOSPC handling, we should do orphan | |
2216 | * cleanup when mounting. But this introduces backward | |
2217 | * compatibility issue. | |
2218 | */ | |
2219 | if (!xchg(&root->orphan_item_inserted, 1)) | |
2220 | insert = 2; | |
2221 | else | |
2222 | insert = 1; | |
2223 | #endif | |
2224 | insert = 1; | |
321f0e70 | 2225 | atomic_inc(&root->orphan_inodes); |
7b128766 JB |
2226 | } |
2227 | ||
72ac3c0d JB |
2228 | if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED, |
2229 | &BTRFS_I(inode)->runtime_flags)) | |
d68fc57b | 2230 | reserve = 1; |
d68fc57b | 2231 | spin_unlock(&root->orphan_lock); |
7b128766 | 2232 | |
d68fc57b YZ |
2233 | /* grab metadata reservation from transaction handle */ |
2234 | if (reserve) { | |
2235 | ret = btrfs_orphan_reserve_metadata(trans, inode); | |
79787eaa | 2236 | BUG_ON(ret); /* -ENOSPC in reservation; Logic error? JDM */ |
d68fc57b | 2237 | } |
7b128766 | 2238 | |
d68fc57b YZ |
2239 | /* insert an orphan item to track this unlinked/truncated file */ |
2240 | if (insert >= 1) { | |
33345d01 | 2241 | ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode)); |
79787eaa | 2242 | if (ret && ret != -EEXIST) { |
8a35d95f JB |
2243 | clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
2244 | &BTRFS_I(inode)->runtime_flags); | |
79787eaa JM |
2245 | btrfs_abort_transaction(trans, root, ret); |
2246 | return ret; | |
2247 | } | |
2248 | ret = 0; | |
d68fc57b YZ |
2249 | } |
2250 | ||
2251 | /* insert an orphan item to track subvolume contains orphan files */ | |
2252 | if (insert >= 2) { | |
2253 | ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root, | |
2254 | root->root_key.objectid); | |
79787eaa JM |
2255 | if (ret && ret != -EEXIST) { |
2256 | btrfs_abort_transaction(trans, root, ret); | |
2257 | return ret; | |
2258 | } | |
d68fc57b YZ |
2259 | } |
2260 | return 0; | |
7b128766 JB |
2261 | } |
2262 | ||
2263 | /* | |
2264 | * We have done the truncate/delete so we can go ahead and remove the orphan | |
2265 | * item for this particular inode. | |
2266 | */ | |
2267 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode) | |
2268 | { | |
2269 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d68fc57b YZ |
2270 | int delete_item = 0; |
2271 | int release_rsv = 0; | |
7b128766 JB |
2272 | int ret = 0; |
2273 | ||
d68fc57b | 2274 | spin_lock(&root->orphan_lock); |
8a35d95f JB |
2275 | if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
2276 | &BTRFS_I(inode)->runtime_flags)) | |
d68fc57b | 2277 | delete_item = 1; |
7b128766 | 2278 | |
72ac3c0d JB |
2279 | if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED, |
2280 | &BTRFS_I(inode)->runtime_flags)) | |
d68fc57b | 2281 | release_rsv = 1; |
d68fc57b | 2282 | spin_unlock(&root->orphan_lock); |
7b128766 | 2283 | |
d68fc57b | 2284 | if (trans && delete_item) { |
33345d01 | 2285 | ret = btrfs_del_orphan_item(trans, root, btrfs_ino(inode)); |
79787eaa | 2286 | BUG_ON(ret); /* -ENOMEM or corruption (JDM: Recheck) */ |
d68fc57b | 2287 | } |
7b128766 | 2288 | |
8a35d95f | 2289 | if (release_rsv) { |
d68fc57b | 2290 | btrfs_orphan_release_metadata(inode); |
8a35d95f JB |
2291 | atomic_dec(&root->orphan_inodes); |
2292 | } | |
7b128766 | 2293 | |
d68fc57b | 2294 | return 0; |
7b128766 JB |
2295 | } |
2296 | ||
2297 | /* | |
2298 | * this cleans up any orphans that may be left on the list from the last use | |
2299 | * of this root. | |
2300 | */ | |
66b4ffd1 | 2301 | int btrfs_orphan_cleanup(struct btrfs_root *root) |
7b128766 JB |
2302 | { |
2303 | struct btrfs_path *path; | |
2304 | struct extent_buffer *leaf; | |
7b128766 JB |
2305 | struct btrfs_key key, found_key; |
2306 | struct btrfs_trans_handle *trans; | |
2307 | struct inode *inode; | |
8f6d7f4f | 2308 | u64 last_objectid = 0; |
7b128766 JB |
2309 | int ret = 0, nr_unlink = 0, nr_truncate = 0; |
2310 | ||
d68fc57b | 2311 | if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED)) |
66b4ffd1 | 2312 | return 0; |
c71bf099 YZ |
2313 | |
2314 | path = btrfs_alloc_path(); | |
66b4ffd1 JB |
2315 | if (!path) { |
2316 | ret = -ENOMEM; | |
2317 | goto out; | |
2318 | } | |
7b128766 JB |
2319 | path->reada = -1; |
2320 | ||
2321 | key.objectid = BTRFS_ORPHAN_OBJECTID; | |
2322 | btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY); | |
2323 | key.offset = (u64)-1; | |
2324 | ||
7b128766 JB |
2325 | while (1) { |
2326 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
66b4ffd1 JB |
2327 | if (ret < 0) |
2328 | goto out; | |
7b128766 JB |
2329 | |
2330 | /* | |
2331 | * if ret == 0 means we found what we were searching for, which | |
25985edc | 2332 | * is weird, but possible, so only screw with path if we didn't |
7b128766 JB |
2333 | * find the key and see if we have stuff that matches |
2334 | */ | |
2335 | if (ret > 0) { | |
66b4ffd1 | 2336 | ret = 0; |
7b128766 JB |
2337 | if (path->slots[0] == 0) |
2338 | break; | |
2339 | path->slots[0]--; | |
2340 | } | |
2341 | ||
2342 | /* pull out the item */ | |
2343 | leaf = path->nodes[0]; | |
7b128766 JB |
2344 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
2345 | ||
2346 | /* make sure the item matches what we want */ | |
2347 | if (found_key.objectid != BTRFS_ORPHAN_OBJECTID) | |
2348 | break; | |
2349 | if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY) | |
2350 | break; | |
2351 | ||
2352 | /* release the path since we're done with it */ | |
b3b4aa74 | 2353 | btrfs_release_path(path); |
7b128766 JB |
2354 | |
2355 | /* | |
2356 | * this is where we are basically btrfs_lookup, without the | |
2357 | * crossing root thing. we store the inode number in the | |
2358 | * offset of the orphan item. | |
2359 | */ | |
8f6d7f4f JB |
2360 | |
2361 | if (found_key.offset == last_objectid) { | |
2362 | printk(KERN_ERR "btrfs: Error removing orphan entry, " | |
2363 | "stopping orphan cleanup\n"); | |
2364 | ret = -EINVAL; | |
2365 | goto out; | |
2366 | } | |
2367 | ||
2368 | last_objectid = found_key.offset; | |
2369 | ||
5d4f98a2 YZ |
2370 | found_key.objectid = found_key.offset; |
2371 | found_key.type = BTRFS_INODE_ITEM_KEY; | |
2372 | found_key.offset = 0; | |
73f73415 | 2373 | inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL); |
a8c9e576 JB |
2374 | ret = PTR_RET(inode); |
2375 | if (ret && ret != -ESTALE) | |
66b4ffd1 | 2376 | goto out; |
7b128766 | 2377 | |
f8e9e0b0 AJ |
2378 | if (ret == -ESTALE && root == root->fs_info->tree_root) { |
2379 | struct btrfs_root *dead_root; | |
2380 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2381 | int is_dead_root = 0; | |
2382 | ||
2383 | /* | |
2384 | * this is an orphan in the tree root. Currently these | |
2385 | * could come from 2 sources: | |
2386 | * a) a snapshot deletion in progress | |
2387 | * b) a free space cache inode | |
2388 | * We need to distinguish those two, as the snapshot | |
2389 | * orphan must not get deleted. | |
2390 | * find_dead_roots already ran before us, so if this | |
2391 | * is a snapshot deletion, we should find the root | |
2392 | * in the dead_roots list | |
2393 | */ | |
2394 | spin_lock(&fs_info->trans_lock); | |
2395 | list_for_each_entry(dead_root, &fs_info->dead_roots, | |
2396 | root_list) { | |
2397 | if (dead_root->root_key.objectid == | |
2398 | found_key.objectid) { | |
2399 | is_dead_root = 1; | |
2400 | break; | |
2401 | } | |
2402 | } | |
2403 | spin_unlock(&fs_info->trans_lock); | |
2404 | if (is_dead_root) { | |
2405 | /* prevent this orphan from being found again */ | |
2406 | key.offset = found_key.objectid - 1; | |
2407 | continue; | |
2408 | } | |
2409 | } | |
7b128766 | 2410 | /* |
a8c9e576 JB |
2411 | * Inode is already gone but the orphan item is still there, |
2412 | * kill the orphan item. | |
7b128766 | 2413 | */ |
a8c9e576 JB |
2414 | if (ret == -ESTALE) { |
2415 | trans = btrfs_start_transaction(root, 1); | |
66b4ffd1 JB |
2416 | if (IS_ERR(trans)) { |
2417 | ret = PTR_ERR(trans); | |
2418 | goto out; | |
2419 | } | |
8a35d95f JB |
2420 | printk(KERN_ERR "auto deleting %Lu\n", |
2421 | found_key.objectid); | |
a8c9e576 JB |
2422 | ret = btrfs_del_orphan_item(trans, root, |
2423 | found_key.objectid); | |
79787eaa | 2424 | BUG_ON(ret); /* -ENOMEM or corruption (JDM: Recheck) */ |
5b21f2ed | 2425 | btrfs_end_transaction(trans, root); |
7b128766 JB |
2426 | continue; |
2427 | } | |
2428 | ||
a8c9e576 JB |
2429 | /* |
2430 | * add this inode to the orphan list so btrfs_orphan_del does | |
2431 | * the proper thing when we hit it | |
2432 | */ | |
8a35d95f JB |
2433 | set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
2434 | &BTRFS_I(inode)->runtime_flags); | |
a8c9e576 | 2435 | |
7b128766 JB |
2436 | /* if we have links, this was a truncate, lets do that */ |
2437 | if (inode->i_nlink) { | |
a41ad394 JB |
2438 | if (!S_ISREG(inode->i_mode)) { |
2439 | WARN_ON(1); | |
2440 | iput(inode); | |
2441 | continue; | |
2442 | } | |
7b128766 | 2443 | nr_truncate++; |
66b4ffd1 | 2444 | ret = btrfs_truncate(inode); |
7b128766 JB |
2445 | } else { |
2446 | nr_unlink++; | |
2447 | } | |
2448 | ||
2449 | /* this will do delete_inode and everything for us */ | |
2450 | iput(inode); | |
66b4ffd1 JB |
2451 | if (ret) |
2452 | goto out; | |
7b128766 | 2453 | } |
3254c876 MX |
2454 | /* release the path since we're done with it */ |
2455 | btrfs_release_path(path); | |
2456 | ||
d68fc57b YZ |
2457 | root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE; |
2458 | ||
2459 | if (root->orphan_block_rsv) | |
2460 | btrfs_block_rsv_release(root, root->orphan_block_rsv, | |
2461 | (u64)-1); | |
2462 | ||
2463 | if (root->orphan_block_rsv || root->orphan_item_inserted) { | |
7a7eaa40 | 2464 | trans = btrfs_join_transaction(root); |
66b4ffd1 JB |
2465 | if (!IS_ERR(trans)) |
2466 | btrfs_end_transaction(trans, root); | |
d68fc57b | 2467 | } |
7b128766 JB |
2468 | |
2469 | if (nr_unlink) | |
2470 | printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink); | |
2471 | if (nr_truncate) | |
2472 | printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate); | |
66b4ffd1 JB |
2473 | |
2474 | out: | |
2475 | if (ret) | |
2476 | printk(KERN_CRIT "btrfs: could not do orphan cleanup %d\n", ret); | |
2477 | btrfs_free_path(path); | |
2478 | return ret; | |
7b128766 JB |
2479 | } |
2480 | ||
46a53cca CM |
2481 | /* |
2482 | * very simple check to peek ahead in the leaf looking for xattrs. If we | |
2483 | * don't find any xattrs, we know there can't be any acls. | |
2484 | * | |
2485 | * slot is the slot the inode is in, objectid is the objectid of the inode | |
2486 | */ | |
2487 | static noinline int acls_after_inode_item(struct extent_buffer *leaf, | |
2488 | int slot, u64 objectid) | |
2489 | { | |
2490 | u32 nritems = btrfs_header_nritems(leaf); | |
2491 | struct btrfs_key found_key; | |
2492 | int scanned = 0; | |
2493 | ||
2494 | slot++; | |
2495 | while (slot < nritems) { | |
2496 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
2497 | ||
2498 | /* we found a different objectid, there must not be acls */ | |
2499 | if (found_key.objectid != objectid) | |
2500 | return 0; | |
2501 | ||
2502 | /* we found an xattr, assume we've got an acl */ | |
2503 | if (found_key.type == BTRFS_XATTR_ITEM_KEY) | |
2504 | return 1; | |
2505 | ||
2506 | /* | |
2507 | * we found a key greater than an xattr key, there can't | |
2508 | * be any acls later on | |
2509 | */ | |
2510 | if (found_key.type > BTRFS_XATTR_ITEM_KEY) | |
2511 | return 0; | |
2512 | ||
2513 | slot++; | |
2514 | scanned++; | |
2515 | ||
2516 | /* | |
2517 | * it goes inode, inode backrefs, xattrs, extents, | |
2518 | * so if there are a ton of hard links to an inode there can | |
2519 | * be a lot of backrefs. Don't waste time searching too hard, | |
2520 | * this is just an optimization | |
2521 | */ | |
2522 | if (scanned >= 8) | |
2523 | break; | |
2524 | } | |
2525 | /* we hit the end of the leaf before we found an xattr or | |
2526 | * something larger than an xattr. We have to assume the inode | |
2527 | * has acls | |
2528 | */ | |
2529 | return 1; | |
2530 | } | |
2531 | ||
d352ac68 CM |
2532 | /* |
2533 | * read an inode from the btree into the in-memory inode | |
2534 | */ | |
5d4f98a2 | 2535 | static void btrfs_read_locked_inode(struct inode *inode) |
39279cc3 CM |
2536 | { |
2537 | struct btrfs_path *path; | |
5f39d397 | 2538 | struct extent_buffer *leaf; |
39279cc3 | 2539 | struct btrfs_inode_item *inode_item; |
0b86a832 | 2540 | struct btrfs_timespec *tspec; |
39279cc3 CM |
2541 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2542 | struct btrfs_key location; | |
46a53cca | 2543 | int maybe_acls; |
618e21d5 | 2544 | u32 rdev; |
39279cc3 | 2545 | int ret; |
2f7e33d4 MX |
2546 | bool filled = false; |
2547 | ||
2548 | ret = btrfs_fill_inode(inode, &rdev); | |
2549 | if (!ret) | |
2550 | filled = true; | |
39279cc3 CM |
2551 | |
2552 | path = btrfs_alloc_path(); | |
1748f843 MF |
2553 | if (!path) |
2554 | goto make_bad; | |
2555 | ||
d90c7321 | 2556 | path->leave_spinning = 1; |
39279cc3 | 2557 | memcpy(&location, &BTRFS_I(inode)->location, sizeof(location)); |
dc17ff8f | 2558 | |
39279cc3 | 2559 | ret = btrfs_lookup_inode(NULL, root, path, &location, 0); |
5f39d397 | 2560 | if (ret) |
39279cc3 | 2561 | goto make_bad; |
39279cc3 | 2562 | |
5f39d397 | 2563 | leaf = path->nodes[0]; |
2f7e33d4 MX |
2564 | |
2565 | if (filled) | |
2566 | goto cache_acl; | |
2567 | ||
5f39d397 CM |
2568 | inode_item = btrfs_item_ptr(leaf, path->slots[0], |
2569 | struct btrfs_inode_item); | |
5f39d397 | 2570 | inode->i_mode = btrfs_inode_mode(leaf, inode_item); |
bfe86848 | 2571 | set_nlink(inode, btrfs_inode_nlink(leaf, inode_item)); |
5f39d397 CM |
2572 | inode->i_uid = btrfs_inode_uid(leaf, inode_item); |
2573 | inode->i_gid = btrfs_inode_gid(leaf, inode_item); | |
dbe674a9 | 2574 | btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item)); |
5f39d397 CM |
2575 | |
2576 | tspec = btrfs_inode_atime(inode_item); | |
2577 | inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2578 | inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2579 | ||
2580 | tspec = btrfs_inode_mtime(inode_item); | |
2581 | inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2582 | inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2583 | ||
2584 | tspec = btrfs_inode_ctime(inode_item); | |
2585 | inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2586 | inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2587 | ||
a76a3cd4 | 2588 | inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item)); |
e02119d5 | 2589 | BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item); |
5dc562c5 JB |
2590 | BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item); |
2591 | ||
2592 | /* | |
2593 | * If we were modified in the current generation and evicted from memory | |
2594 | * and then re-read we need to do a full sync since we don't have any | |
2595 | * idea about which extents were modified before we were evicted from | |
2596 | * cache. | |
2597 | */ | |
2598 | if (BTRFS_I(inode)->last_trans == root->fs_info->generation) | |
2599 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
2600 | &BTRFS_I(inode)->runtime_flags); | |
2601 | ||
0c4d2d95 | 2602 | inode->i_version = btrfs_inode_sequence(leaf, inode_item); |
e02119d5 | 2603 | inode->i_generation = BTRFS_I(inode)->generation; |
618e21d5 | 2604 | inode->i_rdev = 0; |
5f39d397 CM |
2605 | rdev = btrfs_inode_rdev(leaf, inode_item); |
2606 | ||
aec7477b | 2607 | BTRFS_I(inode)->index_cnt = (u64)-1; |
d2fb3437 | 2608 | BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item); |
2f7e33d4 | 2609 | cache_acl: |
46a53cca CM |
2610 | /* |
2611 | * try to precache a NULL acl entry for files that don't have | |
2612 | * any xattrs or acls | |
2613 | */ | |
33345d01 LZ |
2614 | maybe_acls = acls_after_inode_item(leaf, path->slots[0], |
2615 | btrfs_ino(inode)); | |
72c04902 AV |
2616 | if (!maybe_acls) |
2617 | cache_no_acl(inode); | |
46a53cca | 2618 | |
39279cc3 | 2619 | btrfs_free_path(path); |
39279cc3 | 2620 | |
39279cc3 | 2621 | switch (inode->i_mode & S_IFMT) { |
39279cc3 CM |
2622 | case S_IFREG: |
2623 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 2624 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d1310b2e | 2625 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 CM |
2626 | inode->i_fop = &btrfs_file_operations; |
2627 | inode->i_op = &btrfs_file_inode_operations; | |
2628 | break; | |
2629 | case S_IFDIR: | |
2630 | inode->i_fop = &btrfs_dir_file_operations; | |
2631 | if (root == root->fs_info->tree_root) | |
2632 | inode->i_op = &btrfs_dir_ro_inode_operations; | |
2633 | else | |
2634 | inode->i_op = &btrfs_dir_inode_operations; | |
2635 | break; | |
2636 | case S_IFLNK: | |
2637 | inode->i_op = &btrfs_symlink_inode_operations; | |
2638 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 2639 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 | 2640 | break; |
618e21d5 | 2641 | default: |
0279b4cd | 2642 | inode->i_op = &btrfs_special_inode_operations; |
618e21d5 JB |
2643 | init_special_inode(inode, inode->i_mode, rdev); |
2644 | break; | |
39279cc3 | 2645 | } |
6cbff00f CH |
2646 | |
2647 | btrfs_update_iflags(inode); | |
39279cc3 CM |
2648 | return; |
2649 | ||
2650 | make_bad: | |
39279cc3 | 2651 | btrfs_free_path(path); |
39279cc3 CM |
2652 | make_bad_inode(inode); |
2653 | } | |
2654 | ||
d352ac68 CM |
2655 | /* |
2656 | * given a leaf and an inode, copy the inode fields into the leaf | |
2657 | */ | |
e02119d5 CM |
2658 | static void fill_inode_item(struct btrfs_trans_handle *trans, |
2659 | struct extent_buffer *leaf, | |
5f39d397 | 2660 | struct btrfs_inode_item *item, |
39279cc3 CM |
2661 | struct inode *inode) |
2662 | { | |
5f39d397 CM |
2663 | btrfs_set_inode_uid(leaf, item, inode->i_uid); |
2664 | btrfs_set_inode_gid(leaf, item, inode->i_gid); | |
dbe674a9 | 2665 | btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size); |
5f39d397 CM |
2666 | btrfs_set_inode_mode(leaf, item, inode->i_mode); |
2667 | btrfs_set_inode_nlink(leaf, item, inode->i_nlink); | |
2668 | ||
2669 | btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item), | |
2670 | inode->i_atime.tv_sec); | |
2671 | btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item), | |
2672 | inode->i_atime.tv_nsec); | |
2673 | ||
2674 | btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item), | |
2675 | inode->i_mtime.tv_sec); | |
2676 | btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item), | |
2677 | inode->i_mtime.tv_nsec); | |
2678 | ||
2679 | btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item), | |
2680 | inode->i_ctime.tv_sec); | |
2681 | btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item), | |
2682 | inode->i_ctime.tv_nsec); | |
2683 | ||
a76a3cd4 | 2684 | btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode)); |
e02119d5 | 2685 | btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation); |
0c4d2d95 | 2686 | btrfs_set_inode_sequence(leaf, item, inode->i_version); |
e02119d5 | 2687 | btrfs_set_inode_transid(leaf, item, trans->transid); |
5f39d397 | 2688 | btrfs_set_inode_rdev(leaf, item, inode->i_rdev); |
b98b6767 | 2689 | btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags); |
d82a6f1d | 2690 | btrfs_set_inode_block_group(leaf, item, 0); |
39279cc3 CM |
2691 | } |
2692 | ||
d352ac68 CM |
2693 | /* |
2694 | * copy everything in the in-memory inode into the btree. | |
2695 | */ | |
2115133f | 2696 | static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans, |
d397712b | 2697 | struct btrfs_root *root, struct inode *inode) |
39279cc3 CM |
2698 | { |
2699 | struct btrfs_inode_item *inode_item; | |
2700 | struct btrfs_path *path; | |
5f39d397 | 2701 | struct extent_buffer *leaf; |
39279cc3 CM |
2702 | int ret; |
2703 | ||
2704 | path = btrfs_alloc_path(); | |
16cdcec7 MX |
2705 | if (!path) |
2706 | return -ENOMEM; | |
2707 | ||
b9473439 | 2708 | path->leave_spinning = 1; |
16cdcec7 MX |
2709 | ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location, |
2710 | 1); | |
39279cc3 CM |
2711 | if (ret) { |
2712 | if (ret > 0) | |
2713 | ret = -ENOENT; | |
2714 | goto failed; | |
2715 | } | |
2716 | ||
b4ce94de | 2717 | btrfs_unlock_up_safe(path, 1); |
5f39d397 CM |
2718 | leaf = path->nodes[0]; |
2719 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
16cdcec7 | 2720 | struct btrfs_inode_item); |
39279cc3 | 2721 | |
e02119d5 | 2722 | fill_inode_item(trans, leaf, inode_item, inode); |
5f39d397 | 2723 | btrfs_mark_buffer_dirty(leaf); |
15ee9bc7 | 2724 | btrfs_set_inode_last_trans(trans, inode); |
39279cc3 CM |
2725 | ret = 0; |
2726 | failed: | |
39279cc3 CM |
2727 | btrfs_free_path(path); |
2728 | return ret; | |
2729 | } | |
2730 | ||
2115133f CM |
2731 | /* |
2732 | * copy everything in the in-memory inode into the btree. | |
2733 | */ | |
2734 | noinline int btrfs_update_inode(struct btrfs_trans_handle *trans, | |
2735 | struct btrfs_root *root, struct inode *inode) | |
2736 | { | |
2737 | int ret; | |
2738 | ||
2739 | /* | |
2740 | * If the inode is a free space inode, we can deadlock during commit | |
2741 | * if we put it into the delayed code. | |
2742 | * | |
2743 | * The data relocation inode should also be directly updated | |
2744 | * without delay | |
2745 | */ | |
83eea1f1 | 2746 | if (!btrfs_is_free_space_inode(inode) |
2115133f | 2747 | && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID) { |
8ea05e3a AB |
2748 | btrfs_update_root_times(trans, root); |
2749 | ||
2115133f CM |
2750 | ret = btrfs_delayed_update_inode(trans, root, inode); |
2751 | if (!ret) | |
2752 | btrfs_set_inode_last_trans(trans, inode); | |
2753 | return ret; | |
2754 | } | |
2755 | ||
2756 | return btrfs_update_inode_item(trans, root, inode); | |
2757 | } | |
2758 | ||
2759 | static noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans, | |
2760 | struct btrfs_root *root, struct inode *inode) | |
2761 | { | |
2762 | int ret; | |
2763 | ||
2764 | ret = btrfs_update_inode(trans, root, inode); | |
2765 | if (ret == -ENOSPC) | |
2766 | return btrfs_update_inode_item(trans, root, inode); | |
2767 | return ret; | |
2768 | } | |
2769 | ||
d352ac68 CM |
2770 | /* |
2771 | * unlink helper that gets used here in inode.c and in the tree logging | |
2772 | * recovery code. It remove a link in a directory with a given name, and | |
2773 | * also drops the back refs in the inode to the directory | |
2774 | */ | |
92986796 AV |
2775 | static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
2776 | struct btrfs_root *root, | |
2777 | struct inode *dir, struct inode *inode, | |
2778 | const char *name, int name_len) | |
39279cc3 CM |
2779 | { |
2780 | struct btrfs_path *path; | |
39279cc3 | 2781 | int ret = 0; |
5f39d397 | 2782 | struct extent_buffer *leaf; |
39279cc3 | 2783 | struct btrfs_dir_item *di; |
5f39d397 | 2784 | struct btrfs_key key; |
aec7477b | 2785 | u64 index; |
33345d01 LZ |
2786 | u64 ino = btrfs_ino(inode); |
2787 | u64 dir_ino = btrfs_ino(dir); | |
39279cc3 CM |
2788 | |
2789 | path = btrfs_alloc_path(); | |
54aa1f4d CM |
2790 | if (!path) { |
2791 | ret = -ENOMEM; | |
554233a6 | 2792 | goto out; |
54aa1f4d CM |
2793 | } |
2794 | ||
b9473439 | 2795 | path->leave_spinning = 1; |
33345d01 | 2796 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
39279cc3 CM |
2797 | name, name_len, -1); |
2798 | if (IS_ERR(di)) { | |
2799 | ret = PTR_ERR(di); | |
2800 | goto err; | |
2801 | } | |
2802 | if (!di) { | |
2803 | ret = -ENOENT; | |
2804 | goto err; | |
2805 | } | |
5f39d397 CM |
2806 | leaf = path->nodes[0]; |
2807 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
39279cc3 | 2808 | ret = btrfs_delete_one_dir_name(trans, root, path, di); |
54aa1f4d CM |
2809 | if (ret) |
2810 | goto err; | |
b3b4aa74 | 2811 | btrfs_release_path(path); |
39279cc3 | 2812 | |
33345d01 LZ |
2813 | ret = btrfs_del_inode_ref(trans, root, name, name_len, ino, |
2814 | dir_ino, &index); | |
aec7477b | 2815 | if (ret) { |
d397712b | 2816 | printk(KERN_INFO "btrfs failed to delete reference to %.*s, " |
33345d01 LZ |
2817 | "inode %llu parent %llu\n", name_len, name, |
2818 | (unsigned long long)ino, (unsigned long long)dir_ino); | |
79787eaa | 2819 | btrfs_abort_transaction(trans, root, ret); |
aec7477b JB |
2820 | goto err; |
2821 | } | |
2822 | ||
16cdcec7 | 2823 | ret = btrfs_delete_delayed_dir_index(trans, root, dir, index); |
79787eaa JM |
2824 | if (ret) { |
2825 | btrfs_abort_transaction(trans, root, ret); | |
39279cc3 | 2826 | goto err; |
79787eaa | 2827 | } |
39279cc3 | 2828 | |
e02119d5 | 2829 | ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len, |
33345d01 | 2830 | inode, dir_ino); |
79787eaa JM |
2831 | if (ret != 0 && ret != -ENOENT) { |
2832 | btrfs_abort_transaction(trans, root, ret); | |
2833 | goto err; | |
2834 | } | |
e02119d5 CM |
2835 | |
2836 | ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len, | |
2837 | dir, index); | |
6418c961 CM |
2838 | if (ret == -ENOENT) |
2839 | ret = 0; | |
39279cc3 CM |
2840 | err: |
2841 | btrfs_free_path(path); | |
e02119d5 CM |
2842 | if (ret) |
2843 | goto out; | |
2844 | ||
2845 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
0c4d2d95 JB |
2846 | inode_inc_iversion(inode); |
2847 | inode_inc_iversion(dir); | |
e02119d5 | 2848 | inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME; |
b9959295 | 2849 | ret = btrfs_update_inode(trans, root, dir); |
e02119d5 | 2850 | out: |
39279cc3 CM |
2851 | return ret; |
2852 | } | |
2853 | ||
92986796 AV |
2854 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
2855 | struct btrfs_root *root, | |
2856 | struct inode *dir, struct inode *inode, | |
2857 | const char *name, int name_len) | |
2858 | { | |
2859 | int ret; | |
2860 | ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len); | |
2861 | if (!ret) { | |
2862 | btrfs_drop_nlink(inode); | |
2863 | ret = btrfs_update_inode(trans, root, inode); | |
2864 | } | |
2865 | return ret; | |
2866 | } | |
2867 | ||
2868 | ||
a22285a6 YZ |
2869 | /* helper to check if there is any shared block in the path */ |
2870 | static int check_path_shared(struct btrfs_root *root, | |
2871 | struct btrfs_path *path) | |
39279cc3 | 2872 | { |
a22285a6 YZ |
2873 | struct extent_buffer *eb; |
2874 | int level; | |
0e4dcbef | 2875 | u64 refs = 1; |
5df6a9f6 | 2876 | |
a22285a6 | 2877 | for (level = 0; level < BTRFS_MAX_LEVEL; level++) { |
dedefd72 JB |
2878 | int ret; |
2879 | ||
a22285a6 YZ |
2880 | if (!path->nodes[level]) |
2881 | break; | |
2882 | eb = path->nodes[level]; | |
2883 | if (!btrfs_block_can_be_shared(root, eb)) | |
2884 | continue; | |
2885 | ret = btrfs_lookup_extent_info(NULL, root, eb->start, eb->len, | |
2886 | &refs, NULL); | |
2887 | if (refs > 1) | |
2888 | return 1; | |
5df6a9f6 | 2889 | } |
dedefd72 | 2890 | return 0; |
39279cc3 CM |
2891 | } |
2892 | ||
a22285a6 YZ |
2893 | /* |
2894 | * helper to start transaction for unlink and rmdir. | |
2895 | * | |
2896 | * unlink and rmdir are special in btrfs, they do not always free space. | |
2897 | * so in enospc case, we should make sure they will free space before | |
2898 | * allowing them to use the global metadata reservation. | |
2899 | */ | |
2900 | static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir, | |
2901 | struct dentry *dentry) | |
4df27c4d | 2902 | { |
39279cc3 | 2903 | struct btrfs_trans_handle *trans; |
a22285a6 | 2904 | struct btrfs_root *root = BTRFS_I(dir)->root; |
4df27c4d | 2905 | struct btrfs_path *path; |
a22285a6 | 2906 | struct btrfs_inode_ref *ref; |
4df27c4d | 2907 | struct btrfs_dir_item *di; |
7b128766 | 2908 | struct inode *inode = dentry->d_inode; |
4df27c4d | 2909 | u64 index; |
a22285a6 YZ |
2910 | int check_link = 1; |
2911 | int err = -ENOSPC; | |
4df27c4d | 2912 | int ret; |
33345d01 LZ |
2913 | u64 ino = btrfs_ino(inode); |
2914 | u64 dir_ino = btrfs_ino(dir); | |
4df27c4d | 2915 | |
e70bea5f JB |
2916 | /* |
2917 | * 1 for the possible orphan item | |
2918 | * 1 for the dir item | |
2919 | * 1 for the dir index | |
2920 | * 1 for the inode ref | |
2921 | * 1 for the inode ref in the tree log | |
2922 | * 2 for the dir entries in the log | |
2923 | * 1 for the inode | |
2924 | */ | |
2925 | trans = btrfs_start_transaction(root, 8); | |
a22285a6 YZ |
2926 | if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC) |
2927 | return trans; | |
4df27c4d | 2928 | |
33345d01 | 2929 | if (ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
a22285a6 | 2930 | return ERR_PTR(-ENOSPC); |
4df27c4d | 2931 | |
a22285a6 YZ |
2932 | /* check if there is someone else holds reference */ |
2933 | if (S_ISDIR(inode->i_mode) && atomic_read(&inode->i_count) > 1) | |
2934 | return ERR_PTR(-ENOSPC); | |
4df27c4d | 2935 | |
a22285a6 YZ |
2936 | if (atomic_read(&inode->i_count) > 2) |
2937 | return ERR_PTR(-ENOSPC); | |
4df27c4d | 2938 | |
a22285a6 YZ |
2939 | if (xchg(&root->fs_info->enospc_unlink, 1)) |
2940 | return ERR_PTR(-ENOSPC); | |
2941 | ||
2942 | path = btrfs_alloc_path(); | |
2943 | if (!path) { | |
2944 | root->fs_info->enospc_unlink = 0; | |
2945 | return ERR_PTR(-ENOMEM); | |
4df27c4d YZ |
2946 | } |
2947 | ||
3880a1b4 JB |
2948 | /* 1 for the orphan item */ |
2949 | trans = btrfs_start_transaction(root, 1); | |
5df6a9f6 | 2950 | if (IS_ERR(trans)) { |
a22285a6 YZ |
2951 | btrfs_free_path(path); |
2952 | root->fs_info->enospc_unlink = 0; | |
2953 | return trans; | |
2954 | } | |
4df27c4d | 2955 | |
a22285a6 YZ |
2956 | path->skip_locking = 1; |
2957 | path->search_commit_root = 1; | |
4df27c4d | 2958 | |
a22285a6 YZ |
2959 | ret = btrfs_lookup_inode(trans, root, path, |
2960 | &BTRFS_I(dir)->location, 0); | |
2961 | if (ret < 0) { | |
2962 | err = ret; | |
2963 | goto out; | |
2964 | } | |
2965 | if (ret == 0) { | |
2966 | if (check_path_shared(root, path)) | |
2967 | goto out; | |
2968 | } else { | |
2969 | check_link = 0; | |
5df6a9f6 | 2970 | } |
b3b4aa74 | 2971 | btrfs_release_path(path); |
a22285a6 YZ |
2972 | |
2973 | ret = btrfs_lookup_inode(trans, root, path, | |
2974 | &BTRFS_I(inode)->location, 0); | |
2975 | if (ret < 0) { | |
2976 | err = ret; | |
2977 | goto out; | |
2978 | } | |
2979 | if (ret == 0) { | |
2980 | if (check_path_shared(root, path)) | |
2981 | goto out; | |
2982 | } else { | |
2983 | check_link = 0; | |
2984 | } | |
b3b4aa74 | 2985 | btrfs_release_path(path); |
a22285a6 YZ |
2986 | |
2987 | if (ret == 0 && S_ISREG(inode->i_mode)) { | |
2988 | ret = btrfs_lookup_file_extent(trans, root, path, | |
33345d01 | 2989 | ino, (u64)-1, 0); |
a22285a6 YZ |
2990 | if (ret < 0) { |
2991 | err = ret; | |
2992 | goto out; | |
2993 | } | |
79787eaa | 2994 | BUG_ON(ret == 0); /* Corruption */ |
a22285a6 YZ |
2995 | if (check_path_shared(root, path)) |
2996 | goto out; | |
b3b4aa74 | 2997 | btrfs_release_path(path); |
a22285a6 YZ |
2998 | } |
2999 | ||
3000 | if (!check_link) { | |
3001 | err = 0; | |
3002 | goto out; | |
3003 | } | |
3004 | ||
33345d01 | 3005 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
a22285a6 YZ |
3006 | dentry->d_name.name, dentry->d_name.len, 0); |
3007 | if (IS_ERR(di)) { | |
3008 | err = PTR_ERR(di); | |
3009 | goto out; | |
3010 | } | |
3011 | if (di) { | |
3012 | if (check_path_shared(root, path)) | |
3013 | goto out; | |
3014 | } else { | |
3015 | err = 0; | |
3016 | goto out; | |
3017 | } | |
b3b4aa74 | 3018 | btrfs_release_path(path); |
a22285a6 YZ |
3019 | |
3020 | ref = btrfs_lookup_inode_ref(trans, root, path, | |
3021 | dentry->d_name.name, dentry->d_name.len, | |
33345d01 | 3022 | ino, dir_ino, 0); |
a22285a6 YZ |
3023 | if (IS_ERR(ref)) { |
3024 | err = PTR_ERR(ref); | |
3025 | goto out; | |
3026 | } | |
79787eaa | 3027 | BUG_ON(!ref); /* Logic error */ |
a22285a6 YZ |
3028 | if (check_path_shared(root, path)) |
3029 | goto out; | |
3030 | index = btrfs_inode_ref_index(path->nodes[0], ref); | |
b3b4aa74 | 3031 | btrfs_release_path(path); |
a22285a6 | 3032 | |
16cdcec7 MX |
3033 | /* |
3034 | * This is a commit root search, if we can lookup inode item and other | |
3035 | * relative items in the commit root, it means the transaction of | |
3036 | * dir/file creation has been committed, and the dir index item that we | |
3037 | * delay to insert has also been inserted into the commit root. So | |
3038 | * we needn't worry about the delayed insertion of the dir index item | |
3039 | * here. | |
3040 | */ | |
33345d01 | 3041 | di = btrfs_lookup_dir_index_item(trans, root, path, dir_ino, index, |
a22285a6 YZ |
3042 | dentry->d_name.name, dentry->d_name.len, 0); |
3043 | if (IS_ERR(di)) { | |
3044 | err = PTR_ERR(di); | |
3045 | goto out; | |
3046 | } | |
3047 | BUG_ON(ret == -ENOENT); | |
3048 | if (check_path_shared(root, path)) | |
3049 | goto out; | |
3050 | ||
3051 | err = 0; | |
3052 | out: | |
3053 | btrfs_free_path(path); | |
3880a1b4 JB |
3054 | /* Migrate the orphan reservation over */ |
3055 | if (!err) | |
3056 | err = btrfs_block_rsv_migrate(trans->block_rsv, | |
3057 | &root->fs_info->global_block_rsv, | |
5a77d76c | 3058 | trans->bytes_reserved); |
3880a1b4 | 3059 | |
a22285a6 YZ |
3060 | if (err) { |
3061 | btrfs_end_transaction(trans, root); | |
3062 | root->fs_info->enospc_unlink = 0; | |
3063 | return ERR_PTR(err); | |
3064 | } | |
3065 | ||
3066 | trans->block_rsv = &root->fs_info->global_block_rsv; | |
3067 | return trans; | |
3068 | } | |
3069 | ||
3070 | static void __unlink_end_trans(struct btrfs_trans_handle *trans, | |
3071 | struct btrfs_root *root) | |
3072 | { | |
66d8f3dd | 3073 | if (trans->block_rsv->type == BTRFS_BLOCK_RSV_GLOBAL) { |
5a77d76c JB |
3074 | btrfs_block_rsv_release(root, trans->block_rsv, |
3075 | trans->bytes_reserved); | |
3076 | trans->block_rsv = &root->fs_info->trans_block_rsv; | |
a22285a6 YZ |
3077 | BUG_ON(!root->fs_info->enospc_unlink); |
3078 | root->fs_info->enospc_unlink = 0; | |
3079 | } | |
7ad85bb7 | 3080 | btrfs_end_transaction(trans, root); |
a22285a6 YZ |
3081 | } |
3082 | ||
3083 | static int btrfs_unlink(struct inode *dir, struct dentry *dentry) | |
3084 | { | |
3085 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
3086 | struct btrfs_trans_handle *trans; | |
3087 | struct inode *inode = dentry->d_inode; | |
3088 | int ret; | |
3089 | unsigned long nr = 0; | |
3090 | ||
3091 | trans = __unlink_start_trans(dir, dentry); | |
3092 | if (IS_ERR(trans)) | |
3093 | return PTR_ERR(trans); | |
5f39d397 | 3094 | |
12fcfd22 CM |
3095 | btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0); |
3096 | ||
e02119d5 CM |
3097 | ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
3098 | dentry->d_name.name, dentry->d_name.len); | |
b532402e TI |
3099 | if (ret) |
3100 | goto out; | |
7b128766 | 3101 | |
a22285a6 | 3102 | if (inode->i_nlink == 0) { |
7b128766 | 3103 | ret = btrfs_orphan_add(trans, inode); |
b532402e TI |
3104 | if (ret) |
3105 | goto out; | |
a22285a6 | 3106 | } |
7b128766 | 3107 | |
b532402e | 3108 | out: |
d3c2fdcf | 3109 | nr = trans->blocks_used; |
a22285a6 | 3110 | __unlink_end_trans(trans, root); |
d3c2fdcf | 3111 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
3112 | return ret; |
3113 | } | |
3114 | ||
4df27c4d YZ |
3115 | int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, |
3116 | struct btrfs_root *root, | |
3117 | struct inode *dir, u64 objectid, | |
3118 | const char *name, int name_len) | |
3119 | { | |
3120 | struct btrfs_path *path; | |
3121 | struct extent_buffer *leaf; | |
3122 | struct btrfs_dir_item *di; | |
3123 | struct btrfs_key key; | |
3124 | u64 index; | |
3125 | int ret; | |
33345d01 | 3126 | u64 dir_ino = btrfs_ino(dir); |
4df27c4d YZ |
3127 | |
3128 | path = btrfs_alloc_path(); | |
3129 | if (!path) | |
3130 | return -ENOMEM; | |
3131 | ||
33345d01 | 3132 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
4df27c4d | 3133 | name, name_len, -1); |
79787eaa JM |
3134 | if (IS_ERR_OR_NULL(di)) { |
3135 | if (!di) | |
3136 | ret = -ENOENT; | |
3137 | else | |
3138 | ret = PTR_ERR(di); | |
3139 | goto out; | |
3140 | } | |
4df27c4d YZ |
3141 | |
3142 | leaf = path->nodes[0]; | |
3143 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
3144 | WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid); | |
3145 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
79787eaa JM |
3146 | if (ret) { |
3147 | btrfs_abort_transaction(trans, root, ret); | |
3148 | goto out; | |
3149 | } | |
b3b4aa74 | 3150 | btrfs_release_path(path); |
4df27c4d YZ |
3151 | |
3152 | ret = btrfs_del_root_ref(trans, root->fs_info->tree_root, | |
3153 | objectid, root->root_key.objectid, | |
33345d01 | 3154 | dir_ino, &index, name, name_len); |
4df27c4d | 3155 | if (ret < 0) { |
79787eaa JM |
3156 | if (ret != -ENOENT) { |
3157 | btrfs_abort_transaction(trans, root, ret); | |
3158 | goto out; | |
3159 | } | |
33345d01 | 3160 | di = btrfs_search_dir_index_item(root, path, dir_ino, |
4df27c4d | 3161 | name, name_len); |
79787eaa JM |
3162 | if (IS_ERR_OR_NULL(di)) { |
3163 | if (!di) | |
3164 | ret = -ENOENT; | |
3165 | else | |
3166 | ret = PTR_ERR(di); | |
3167 | btrfs_abort_transaction(trans, root, ret); | |
3168 | goto out; | |
3169 | } | |
4df27c4d YZ |
3170 | |
3171 | leaf = path->nodes[0]; | |
3172 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 3173 | btrfs_release_path(path); |
4df27c4d YZ |
3174 | index = key.offset; |
3175 | } | |
945d8962 | 3176 | btrfs_release_path(path); |
4df27c4d | 3177 | |
16cdcec7 | 3178 | ret = btrfs_delete_delayed_dir_index(trans, root, dir, index); |
79787eaa JM |
3179 | if (ret) { |
3180 | btrfs_abort_transaction(trans, root, ret); | |
3181 | goto out; | |
3182 | } | |
4df27c4d YZ |
3183 | |
3184 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
0c4d2d95 | 3185 | inode_inc_iversion(dir); |
4df27c4d | 3186 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; |
5a24e84c | 3187 | ret = btrfs_update_inode_fallback(trans, root, dir); |
79787eaa JM |
3188 | if (ret) |
3189 | btrfs_abort_transaction(trans, root, ret); | |
3190 | out: | |
71d7aed0 | 3191 | btrfs_free_path(path); |
79787eaa | 3192 | return ret; |
4df27c4d YZ |
3193 | } |
3194 | ||
39279cc3 CM |
3195 | static int btrfs_rmdir(struct inode *dir, struct dentry *dentry) |
3196 | { | |
3197 | struct inode *inode = dentry->d_inode; | |
1832a6d5 | 3198 | int err = 0; |
39279cc3 | 3199 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 | 3200 | struct btrfs_trans_handle *trans; |
1832a6d5 | 3201 | unsigned long nr = 0; |
39279cc3 | 3202 | |
3394e160 | 3203 | if (inode->i_size > BTRFS_EMPTY_DIR_SIZE || |
33345d01 | 3204 | btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) |
134d4512 Y |
3205 | return -ENOTEMPTY; |
3206 | ||
a22285a6 YZ |
3207 | trans = __unlink_start_trans(dir, dentry); |
3208 | if (IS_ERR(trans)) | |
5df6a9f6 | 3209 | return PTR_ERR(trans); |
5df6a9f6 | 3210 | |
33345d01 | 3211 | if (unlikely(btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
4df27c4d YZ |
3212 | err = btrfs_unlink_subvol(trans, root, dir, |
3213 | BTRFS_I(inode)->location.objectid, | |
3214 | dentry->d_name.name, | |
3215 | dentry->d_name.len); | |
3216 | goto out; | |
3217 | } | |
3218 | ||
7b128766 JB |
3219 | err = btrfs_orphan_add(trans, inode); |
3220 | if (err) | |
4df27c4d | 3221 | goto out; |
7b128766 | 3222 | |
39279cc3 | 3223 | /* now the directory is empty */ |
e02119d5 CM |
3224 | err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
3225 | dentry->d_name.name, dentry->d_name.len); | |
d397712b | 3226 | if (!err) |
dbe674a9 | 3227 | btrfs_i_size_write(inode, 0); |
4df27c4d | 3228 | out: |
d3c2fdcf | 3229 | nr = trans->blocks_used; |
a22285a6 | 3230 | __unlink_end_trans(trans, root); |
d3c2fdcf | 3231 | btrfs_btree_balance_dirty(root, nr); |
3954401f | 3232 | |
39279cc3 CM |
3233 | return err; |
3234 | } | |
3235 | ||
39279cc3 CM |
3236 | /* |
3237 | * this can truncate away extent items, csum items and directory items. | |
3238 | * It starts at a high offset and removes keys until it can't find | |
d352ac68 | 3239 | * any higher than new_size |
39279cc3 CM |
3240 | * |
3241 | * csum items that cross the new i_size are truncated to the new size | |
3242 | * as well. | |
7b128766 JB |
3243 | * |
3244 | * min_type is the minimum key type to truncate down to. If set to 0, this | |
3245 | * will kill all the items on this inode, including the INODE_ITEM_KEY. | |
39279cc3 | 3246 | */ |
8082510e YZ |
3247 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, |
3248 | struct btrfs_root *root, | |
3249 | struct inode *inode, | |
3250 | u64 new_size, u32 min_type) | |
39279cc3 | 3251 | { |
39279cc3 | 3252 | struct btrfs_path *path; |
5f39d397 | 3253 | struct extent_buffer *leaf; |
39279cc3 | 3254 | struct btrfs_file_extent_item *fi; |
8082510e YZ |
3255 | struct btrfs_key key; |
3256 | struct btrfs_key found_key; | |
39279cc3 | 3257 | u64 extent_start = 0; |
db94535d | 3258 | u64 extent_num_bytes = 0; |
5d4f98a2 | 3259 | u64 extent_offset = 0; |
39279cc3 | 3260 | u64 item_end = 0; |
8082510e YZ |
3261 | u64 mask = root->sectorsize - 1; |
3262 | u32 found_type = (u8)-1; | |
39279cc3 CM |
3263 | int found_extent; |
3264 | int del_item; | |
85e21bac CM |
3265 | int pending_del_nr = 0; |
3266 | int pending_del_slot = 0; | |
179e29e4 | 3267 | int extent_type = -1; |
8082510e YZ |
3268 | int ret; |
3269 | int err = 0; | |
33345d01 | 3270 | u64 ino = btrfs_ino(inode); |
8082510e YZ |
3271 | |
3272 | BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY); | |
39279cc3 | 3273 | |
0eb0e19c MF |
3274 | path = btrfs_alloc_path(); |
3275 | if (!path) | |
3276 | return -ENOMEM; | |
3277 | path->reada = -1; | |
3278 | ||
5dc562c5 JB |
3279 | /* |
3280 | * We want to drop from the next block forward in case this new size is | |
3281 | * not block aligned since we will be keeping the last block of the | |
3282 | * extent just the way it is. | |
3283 | */ | |
0af3d00b | 3284 | if (root->ref_cows || root == root->fs_info->tree_root) |
5dc562c5 | 3285 | btrfs_drop_extent_cache(inode, (new_size + mask) & (~mask), (u64)-1, 0); |
8082510e | 3286 | |
16cdcec7 MX |
3287 | /* |
3288 | * This function is also used to drop the items in the log tree before | |
3289 | * we relog the inode, so if root != BTRFS_I(inode)->root, it means | |
3290 | * it is used to drop the loged items. So we shouldn't kill the delayed | |
3291 | * items. | |
3292 | */ | |
3293 | if (min_type == 0 && root == BTRFS_I(inode)->root) | |
3294 | btrfs_kill_delayed_inode_items(inode); | |
3295 | ||
33345d01 | 3296 | key.objectid = ino; |
39279cc3 | 3297 | key.offset = (u64)-1; |
5f39d397 CM |
3298 | key.type = (u8)-1; |
3299 | ||
85e21bac | 3300 | search_again: |
b9473439 | 3301 | path->leave_spinning = 1; |
85e21bac | 3302 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
8082510e YZ |
3303 | if (ret < 0) { |
3304 | err = ret; | |
3305 | goto out; | |
3306 | } | |
d397712b | 3307 | |
85e21bac | 3308 | if (ret > 0) { |
e02119d5 CM |
3309 | /* there are no items in the tree for us to truncate, we're |
3310 | * done | |
3311 | */ | |
8082510e YZ |
3312 | if (path->slots[0] == 0) |
3313 | goto out; | |
85e21bac CM |
3314 | path->slots[0]--; |
3315 | } | |
3316 | ||
d397712b | 3317 | while (1) { |
39279cc3 | 3318 | fi = NULL; |
5f39d397 CM |
3319 | leaf = path->nodes[0]; |
3320 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
3321 | found_type = btrfs_key_type(&found_key); | |
39279cc3 | 3322 | |
33345d01 | 3323 | if (found_key.objectid != ino) |
39279cc3 | 3324 | break; |
5f39d397 | 3325 | |
85e21bac | 3326 | if (found_type < min_type) |
39279cc3 CM |
3327 | break; |
3328 | ||
5f39d397 | 3329 | item_end = found_key.offset; |
39279cc3 | 3330 | if (found_type == BTRFS_EXTENT_DATA_KEY) { |
5f39d397 | 3331 | fi = btrfs_item_ptr(leaf, path->slots[0], |
39279cc3 | 3332 | struct btrfs_file_extent_item); |
179e29e4 CM |
3333 | extent_type = btrfs_file_extent_type(leaf, fi); |
3334 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { | |
5f39d397 | 3335 | item_end += |
db94535d | 3336 | btrfs_file_extent_num_bytes(leaf, fi); |
179e29e4 | 3337 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
179e29e4 | 3338 | item_end += btrfs_file_extent_inline_len(leaf, |
c8b97818 | 3339 | fi); |
39279cc3 | 3340 | } |
008630c1 | 3341 | item_end--; |
39279cc3 | 3342 | } |
8082510e YZ |
3343 | if (found_type > min_type) { |
3344 | del_item = 1; | |
3345 | } else { | |
3346 | if (item_end < new_size) | |
b888db2b | 3347 | break; |
8082510e YZ |
3348 | if (found_key.offset >= new_size) |
3349 | del_item = 1; | |
3350 | else | |
3351 | del_item = 0; | |
39279cc3 | 3352 | } |
39279cc3 | 3353 | found_extent = 0; |
39279cc3 | 3354 | /* FIXME, shrink the extent if the ref count is only 1 */ |
179e29e4 CM |
3355 | if (found_type != BTRFS_EXTENT_DATA_KEY) |
3356 | goto delete; | |
3357 | ||
3358 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { | |
39279cc3 | 3359 | u64 num_dec; |
db94535d | 3360 | extent_start = btrfs_file_extent_disk_bytenr(leaf, fi); |
f70a9a6b | 3361 | if (!del_item) { |
db94535d CM |
3362 | u64 orig_num_bytes = |
3363 | btrfs_file_extent_num_bytes(leaf, fi); | |
e02119d5 | 3364 | extent_num_bytes = new_size - |
5f39d397 | 3365 | found_key.offset + root->sectorsize - 1; |
b1632b10 Y |
3366 | extent_num_bytes = extent_num_bytes & |
3367 | ~((u64)root->sectorsize - 1); | |
db94535d CM |
3368 | btrfs_set_file_extent_num_bytes(leaf, fi, |
3369 | extent_num_bytes); | |
3370 | num_dec = (orig_num_bytes - | |
9069218d | 3371 | extent_num_bytes); |
e02119d5 | 3372 | if (root->ref_cows && extent_start != 0) |
a76a3cd4 | 3373 | inode_sub_bytes(inode, num_dec); |
5f39d397 | 3374 | btrfs_mark_buffer_dirty(leaf); |
39279cc3 | 3375 | } else { |
db94535d CM |
3376 | extent_num_bytes = |
3377 | btrfs_file_extent_disk_num_bytes(leaf, | |
3378 | fi); | |
5d4f98a2 YZ |
3379 | extent_offset = found_key.offset - |
3380 | btrfs_file_extent_offset(leaf, fi); | |
3381 | ||
39279cc3 | 3382 | /* FIXME blocksize != 4096 */ |
9069218d | 3383 | num_dec = btrfs_file_extent_num_bytes(leaf, fi); |
39279cc3 CM |
3384 | if (extent_start != 0) { |
3385 | found_extent = 1; | |
e02119d5 | 3386 | if (root->ref_cows) |
a76a3cd4 | 3387 | inode_sub_bytes(inode, num_dec); |
e02119d5 | 3388 | } |
39279cc3 | 3389 | } |
9069218d | 3390 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
c8b97818 CM |
3391 | /* |
3392 | * we can't truncate inline items that have had | |
3393 | * special encodings | |
3394 | */ | |
3395 | if (!del_item && | |
3396 | btrfs_file_extent_compression(leaf, fi) == 0 && | |
3397 | btrfs_file_extent_encryption(leaf, fi) == 0 && | |
3398 | btrfs_file_extent_other_encoding(leaf, fi) == 0) { | |
e02119d5 CM |
3399 | u32 size = new_size - found_key.offset; |
3400 | ||
3401 | if (root->ref_cows) { | |
a76a3cd4 YZ |
3402 | inode_sub_bytes(inode, item_end + 1 - |
3403 | new_size); | |
e02119d5 CM |
3404 | } |
3405 | size = | |
3406 | btrfs_file_extent_calc_inline_size(size); | |
143bede5 JM |
3407 | btrfs_truncate_item(trans, root, path, |
3408 | size, 1); | |
e02119d5 | 3409 | } else if (root->ref_cows) { |
a76a3cd4 YZ |
3410 | inode_sub_bytes(inode, item_end + 1 - |
3411 | found_key.offset); | |
9069218d | 3412 | } |
39279cc3 | 3413 | } |
179e29e4 | 3414 | delete: |
39279cc3 | 3415 | if (del_item) { |
85e21bac CM |
3416 | if (!pending_del_nr) { |
3417 | /* no pending yet, add ourselves */ | |
3418 | pending_del_slot = path->slots[0]; | |
3419 | pending_del_nr = 1; | |
3420 | } else if (pending_del_nr && | |
3421 | path->slots[0] + 1 == pending_del_slot) { | |
3422 | /* hop on the pending chunk */ | |
3423 | pending_del_nr++; | |
3424 | pending_del_slot = path->slots[0]; | |
3425 | } else { | |
d397712b | 3426 | BUG(); |
85e21bac | 3427 | } |
39279cc3 CM |
3428 | } else { |
3429 | break; | |
3430 | } | |
0af3d00b JB |
3431 | if (found_extent && (root->ref_cows || |
3432 | root == root->fs_info->tree_root)) { | |
b9473439 | 3433 | btrfs_set_path_blocking(path); |
39279cc3 | 3434 | ret = btrfs_free_extent(trans, root, extent_start, |
5d4f98a2 YZ |
3435 | extent_num_bytes, 0, |
3436 | btrfs_header_owner(leaf), | |
66d7e7f0 | 3437 | ino, extent_offset, 0); |
39279cc3 CM |
3438 | BUG_ON(ret); |
3439 | } | |
85e21bac | 3440 | |
8082510e YZ |
3441 | if (found_type == BTRFS_INODE_ITEM_KEY) |
3442 | break; | |
3443 | ||
3444 | if (path->slots[0] == 0 || | |
3445 | path->slots[0] != pending_del_slot) { | |
8082510e YZ |
3446 | if (pending_del_nr) { |
3447 | ret = btrfs_del_items(trans, root, path, | |
3448 | pending_del_slot, | |
3449 | pending_del_nr); | |
79787eaa JM |
3450 | if (ret) { |
3451 | btrfs_abort_transaction(trans, | |
3452 | root, ret); | |
3453 | goto error; | |
3454 | } | |
8082510e YZ |
3455 | pending_del_nr = 0; |
3456 | } | |
b3b4aa74 | 3457 | btrfs_release_path(path); |
85e21bac | 3458 | goto search_again; |
8082510e YZ |
3459 | } else { |
3460 | path->slots[0]--; | |
85e21bac | 3461 | } |
39279cc3 | 3462 | } |
8082510e | 3463 | out: |
85e21bac CM |
3464 | if (pending_del_nr) { |
3465 | ret = btrfs_del_items(trans, root, path, pending_del_slot, | |
3466 | pending_del_nr); | |
79787eaa JM |
3467 | if (ret) |
3468 | btrfs_abort_transaction(trans, root, ret); | |
85e21bac | 3469 | } |
79787eaa | 3470 | error: |
39279cc3 | 3471 | btrfs_free_path(path); |
8082510e | 3472 | return err; |
39279cc3 CM |
3473 | } |
3474 | ||
3475 | /* | |
2aaa6655 JB |
3476 | * btrfs_truncate_page - read, zero a chunk and write a page |
3477 | * @inode - inode that we're zeroing | |
3478 | * @from - the offset to start zeroing | |
3479 | * @len - the length to zero, 0 to zero the entire range respective to the | |
3480 | * offset | |
3481 | * @front - zero up to the offset instead of from the offset on | |
3482 | * | |
3483 | * This will find the page for the "from" offset and cow the page and zero the | |
3484 | * part we want to zero. This is used with truncate and hole punching. | |
39279cc3 | 3485 | */ |
2aaa6655 JB |
3486 | int btrfs_truncate_page(struct inode *inode, loff_t from, loff_t len, |
3487 | int front) | |
39279cc3 | 3488 | { |
2aaa6655 | 3489 | struct address_space *mapping = inode->i_mapping; |
db94535d | 3490 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
3491 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
3492 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 3493 | struct extent_state *cached_state = NULL; |
e6dcd2dc | 3494 | char *kaddr; |
db94535d | 3495 | u32 blocksize = root->sectorsize; |
39279cc3 CM |
3496 | pgoff_t index = from >> PAGE_CACHE_SHIFT; |
3497 | unsigned offset = from & (PAGE_CACHE_SIZE-1); | |
3498 | struct page *page; | |
3b16a4e3 | 3499 | gfp_t mask = btrfs_alloc_write_mask(mapping); |
39279cc3 | 3500 | int ret = 0; |
a52d9a80 | 3501 | u64 page_start; |
e6dcd2dc | 3502 | u64 page_end; |
39279cc3 | 3503 | |
2aaa6655 JB |
3504 | if ((offset & (blocksize - 1)) == 0 && |
3505 | (!len || ((len & (blocksize - 1)) == 0))) | |
39279cc3 | 3506 | goto out; |
0ca1f7ce | 3507 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); |
5d5e103a JB |
3508 | if (ret) |
3509 | goto out; | |
39279cc3 CM |
3510 | |
3511 | ret = -ENOMEM; | |
211c17f5 | 3512 | again: |
3b16a4e3 | 3513 | page = find_or_create_page(mapping, index, mask); |
5d5e103a | 3514 | if (!page) { |
0ca1f7ce | 3515 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
39279cc3 | 3516 | goto out; |
5d5e103a | 3517 | } |
e6dcd2dc CM |
3518 | |
3519 | page_start = page_offset(page); | |
3520 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
3521 | ||
39279cc3 | 3522 | if (!PageUptodate(page)) { |
9ebefb18 | 3523 | ret = btrfs_readpage(NULL, page); |
39279cc3 | 3524 | lock_page(page); |
211c17f5 CM |
3525 | if (page->mapping != mapping) { |
3526 | unlock_page(page); | |
3527 | page_cache_release(page); | |
3528 | goto again; | |
3529 | } | |
39279cc3 CM |
3530 | if (!PageUptodate(page)) { |
3531 | ret = -EIO; | |
89642229 | 3532 | goto out_unlock; |
39279cc3 CM |
3533 | } |
3534 | } | |
211c17f5 | 3535 | wait_on_page_writeback(page); |
e6dcd2dc | 3536 | |
d0082371 | 3537 | lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state); |
e6dcd2dc CM |
3538 | set_page_extent_mapped(page); |
3539 | ||
3540 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
3541 | if (ordered) { | |
2ac55d41 JB |
3542 | unlock_extent_cached(io_tree, page_start, page_end, |
3543 | &cached_state, GFP_NOFS); | |
e6dcd2dc CM |
3544 | unlock_page(page); |
3545 | page_cache_release(page); | |
eb84ae03 | 3546 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
3547 | btrfs_put_ordered_extent(ordered); |
3548 | goto again; | |
3549 | } | |
3550 | ||
2ac55d41 | 3551 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end, |
9e8a4a8b LB |
3552 | EXTENT_DIRTY | EXTENT_DELALLOC | |
3553 | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, | |
2ac55d41 | 3554 | 0, 0, &cached_state, GFP_NOFS); |
5d5e103a | 3555 | |
2ac55d41 JB |
3556 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, |
3557 | &cached_state); | |
9ed74f2d | 3558 | if (ret) { |
2ac55d41 JB |
3559 | unlock_extent_cached(io_tree, page_start, page_end, |
3560 | &cached_state, GFP_NOFS); | |
9ed74f2d JB |
3561 | goto out_unlock; |
3562 | } | |
3563 | ||
e6dcd2dc CM |
3564 | ret = 0; |
3565 | if (offset != PAGE_CACHE_SIZE) { | |
2aaa6655 JB |
3566 | if (!len) |
3567 | len = PAGE_CACHE_SIZE - offset; | |
e6dcd2dc | 3568 | kaddr = kmap(page); |
2aaa6655 JB |
3569 | if (front) |
3570 | memset(kaddr, 0, offset); | |
3571 | else | |
3572 | memset(kaddr + offset, 0, len); | |
e6dcd2dc CM |
3573 | flush_dcache_page(page); |
3574 | kunmap(page); | |
3575 | } | |
247e743c | 3576 | ClearPageChecked(page); |
e6dcd2dc | 3577 | set_page_dirty(page); |
2ac55d41 JB |
3578 | unlock_extent_cached(io_tree, page_start, page_end, &cached_state, |
3579 | GFP_NOFS); | |
39279cc3 | 3580 | |
89642229 | 3581 | out_unlock: |
5d5e103a | 3582 | if (ret) |
0ca1f7ce | 3583 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
39279cc3 CM |
3584 | unlock_page(page); |
3585 | page_cache_release(page); | |
3586 | out: | |
3587 | return ret; | |
3588 | } | |
3589 | ||
695a0d0d JB |
3590 | /* |
3591 | * This function puts in dummy file extents for the area we're creating a hole | |
3592 | * for. So if we are truncating this file to a larger size we need to insert | |
3593 | * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for | |
3594 | * the range between oldsize and size | |
3595 | */ | |
a41ad394 | 3596 | int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size) |
39279cc3 | 3597 | { |
9036c102 YZ |
3598 | struct btrfs_trans_handle *trans; |
3599 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3600 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
a22285a6 | 3601 | struct extent_map *em = NULL; |
2ac55d41 | 3602 | struct extent_state *cached_state = NULL; |
5dc562c5 | 3603 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
9036c102 | 3604 | u64 mask = root->sectorsize - 1; |
a41ad394 | 3605 | u64 hole_start = (oldsize + mask) & ~mask; |
9036c102 YZ |
3606 | u64 block_end = (size + mask) & ~mask; |
3607 | u64 last_byte; | |
3608 | u64 cur_offset; | |
3609 | u64 hole_size; | |
9ed74f2d | 3610 | int err = 0; |
39279cc3 | 3611 | |
9036c102 YZ |
3612 | if (size <= hole_start) |
3613 | return 0; | |
3614 | ||
9036c102 YZ |
3615 | while (1) { |
3616 | struct btrfs_ordered_extent *ordered; | |
3617 | btrfs_wait_ordered_range(inode, hole_start, | |
3618 | block_end - hole_start); | |
2ac55d41 | 3619 | lock_extent_bits(io_tree, hole_start, block_end - 1, 0, |
d0082371 | 3620 | &cached_state); |
9036c102 YZ |
3621 | ordered = btrfs_lookup_ordered_extent(inode, hole_start); |
3622 | if (!ordered) | |
3623 | break; | |
2ac55d41 JB |
3624 | unlock_extent_cached(io_tree, hole_start, block_end - 1, |
3625 | &cached_state, GFP_NOFS); | |
9036c102 YZ |
3626 | btrfs_put_ordered_extent(ordered); |
3627 | } | |
39279cc3 | 3628 | |
9036c102 YZ |
3629 | cur_offset = hole_start; |
3630 | while (1) { | |
3631 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, | |
3632 | block_end - cur_offset, 0); | |
79787eaa JM |
3633 | if (IS_ERR(em)) { |
3634 | err = PTR_ERR(em); | |
3635 | break; | |
3636 | } | |
9036c102 YZ |
3637 | last_byte = min(extent_map_end(em), block_end); |
3638 | last_byte = (last_byte + mask) & ~mask; | |
8082510e | 3639 | if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) { |
5dc562c5 | 3640 | struct extent_map *hole_em; |
9036c102 | 3641 | hole_size = last_byte - cur_offset; |
9ed74f2d | 3642 | |
3642320e | 3643 | trans = btrfs_start_transaction(root, 3); |
a22285a6 YZ |
3644 | if (IS_ERR(trans)) { |
3645 | err = PTR_ERR(trans); | |
9ed74f2d | 3646 | break; |
a22285a6 | 3647 | } |
8082510e | 3648 | |
5dc562c5 JB |
3649 | err = btrfs_drop_extents(trans, root, inode, |
3650 | cur_offset, | |
2671485d | 3651 | cur_offset + hole_size, 1); |
5b397377 | 3652 | if (err) { |
79787eaa | 3653 | btrfs_abort_transaction(trans, root, err); |
5b397377 | 3654 | btrfs_end_transaction(trans, root); |
3893e33b | 3655 | break; |
5b397377 | 3656 | } |
8082510e | 3657 | |
9036c102 | 3658 | err = btrfs_insert_file_extent(trans, root, |
33345d01 | 3659 | btrfs_ino(inode), cur_offset, 0, |
9036c102 YZ |
3660 | 0, hole_size, 0, hole_size, |
3661 | 0, 0, 0); | |
5b397377 | 3662 | if (err) { |
79787eaa | 3663 | btrfs_abort_transaction(trans, root, err); |
5b397377 | 3664 | btrfs_end_transaction(trans, root); |
3893e33b | 3665 | break; |
5b397377 | 3666 | } |
8082510e | 3667 | |
5dc562c5 JB |
3668 | btrfs_drop_extent_cache(inode, cur_offset, |
3669 | cur_offset + hole_size - 1, 0); | |
3670 | hole_em = alloc_extent_map(); | |
3671 | if (!hole_em) { | |
3672 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
3673 | &BTRFS_I(inode)->runtime_flags); | |
3674 | goto next; | |
3675 | } | |
3676 | hole_em->start = cur_offset; | |
3677 | hole_em->len = hole_size; | |
3678 | hole_em->orig_start = cur_offset; | |
3679 | ||
3680 | hole_em->block_start = EXTENT_MAP_HOLE; | |
3681 | hole_em->block_len = 0; | |
3682 | hole_em->bdev = root->fs_info->fs_devices->latest_bdev; | |
3683 | hole_em->compress_type = BTRFS_COMPRESS_NONE; | |
3684 | hole_em->generation = trans->transid; | |
8082510e | 3685 | |
5dc562c5 JB |
3686 | while (1) { |
3687 | write_lock(&em_tree->lock); | |
3688 | err = add_extent_mapping(em_tree, hole_em); | |
3689 | if (!err) | |
3690 | list_move(&hole_em->list, | |
3691 | &em_tree->modified_extents); | |
3692 | write_unlock(&em_tree->lock); | |
3693 | if (err != -EEXIST) | |
3694 | break; | |
3695 | btrfs_drop_extent_cache(inode, cur_offset, | |
3696 | cur_offset + | |
3697 | hole_size - 1, 0); | |
3698 | } | |
3699 | free_extent_map(hole_em); | |
3700 | next: | |
3642320e | 3701 | btrfs_update_inode(trans, root, inode); |
8082510e | 3702 | btrfs_end_transaction(trans, root); |
9036c102 YZ |
3703 | } |
3704 | free_extent_map(em); | |
a22285a6 | 3705 | em = NULL; |
9036c102 | 3706 | cur_offset = last_byte; |
8082510e | 3707 | if (cur_offset >= block_end) |
9036c102 YZ |
3708 | break; |
3709 | } | |
1832a6d5 | 3710 | |
a22285a6 | 3711 | free_extent_map(em); |
2ac55d41 JB |
3712 | unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state, |
3713 | GFP_NOFS); | |
9036c102 YZ |
3714 | return err; |
3715 | } | |
39279cc3 | 3716 | |
a41ad394 | 3717 | static int btrfs_setsize(struct inode *inode, loff_t newsize) |
8082510e | 3718 | { |
f4a2f4c5 MX |
3719 | struct btrfs_root *root = BTRFS_I(inode)->root; |
3720 | struct btrfs_trans_handle *trans; | |
a41ad394 | 3721 | loff_t oldsize = i_size_read(inode); |
8082510e YZ |
3722 | int ret; |
3723 | ||
a41ad394 | 3724 | if (newsize == oldsize) |
8082510e YZ |
3725 | return 0; |
3726 | ||
a41ad394 | 3727 | if (newsize > oldsize) { |
a41ad394 JB |
3728 | truncate_pagecache(inode, oldsize, newsize); |
3729 | ret = btrfs_cont_expand(inode, oldsize, newsize); | |
f4a2f4c5 | 3730 | if (ret) |
8082510e | 3731 | return ret; |
8082510e | 3732 | |
f4a2f4c5 MX |
3733 | trans = btrfs_start_transaction(root, 1); |
3734 | if (IS_ERR(trans)) | |
3735 | return PTR_ERR(trans); | |
3736 | ||
3737 | i_size_write(inode, newsize); | |
3738 | btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL); | |
3739 | ret = btrfs_update_inode(trans, root, inode); | |
7ad85bb7 | 3740 | btrfs_end_transaction(trans, root); |
a41ad394 | 3741 | } else { |
8082510e | 3742 | |
a41ad394 JB |
3743 | /* |
3744 | * We're truncating a file that used to have good data down to | |
3745 | * zero. Make sure it gets into the ordered flush list so that | |
3746 | * any new writes get down to disk quickly. | |
3747 | */ | |
3748 | if (newsize == 0) | |
72ac3c0d JB |
3749 | set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE, |
3750 | &BTRFS_I(inode)->runtime_flags); | |
8082510e | 3751 | |
a41ad394 JB |
3752 | /* we don't support swapfiles, so vmtruncate shouldn't fail */ |
3753 | truncate_setsize(inode, newsize); | |
3754 | ret = btrfs_truncate(inode); | |
8082510e YZ |
3755 | } |
3756 | ||
a41ad394 | 3757 | return ret; |
8082510e YZ |
3758 | } |
3759 | ||
9036c102 YZ |
3760 | static int btrfs_setattr(struct dentry *dentry, struct iattr *attr) |
3761 | { | |
3762 | struct inode *inode = dentry->d_inode; | |
b83cc969 | 3763 | struct btrfs_root *root = BTRFS_I(inode)->root; |
9036c102 | 3764 | int err; |
39279cc3 | 3765 | |
b83cc969 LZ |
3766 | if (btrfs_root_readonly(root)) |
3767 | return -EROFS; | |
3768 | ||
9036c102 YZ |
3769 | err = inode_change_ok(inode, attr); |
3770 | if (err) | |
3771 | return err; | |
2bf5a725 | 3772 | |
5a3f23d5 | 3773 | if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) { |
a41ad394 | 3774 | err = btrfs_setsize(inode, attr->ia_size); |
8082510e YZ |
3775 | if (err) |
3776 | return err; | |
39279cc3 | 3777 | } |
9036c102 | 3778 | |
1025774c CH |
3779 | if (attr->ia_valid) { |
3780 | setattr_copy(inode, attr); | |
0c4d2d95 | 3781 | inode_inc_iversion(inode); |
22c44fe6 | 3782 | err = btrfs_dirty_inode(inode); |
1025774c | 3783 | |
22c44fe6 | 3784 | if (!err && attr->ia_valid & ATTR_MODE) |
1025774c CH |
3785 | err = btrfs_acl_chmod(inode); |
3786 | } | |
33268eaf | 3787 | |
39279cc3 CM |
3788 | return err; |
3789 | } | |
61295eb8 | 3790 | |
bd555975 | 3791 | void btrfs_evict_inode(struct inode *inode) |
39279cc3 CM |
3792 | { |
3793 | struct btrfs_trans_handle *trans; | |
3794 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
726c35fa | 3795 | struct btrfs_block_rsv *rsv, *global_rsv; |
07127184 | 3796 | u64 min_size = btrfs_calc_trunc_metadata_size(root, 1); |
d3c2fdcf | 3797 | unsigned long nr; |
39279cc3 CM |
3798 | int ret; |
3799 | ||
1abe9b8a | 3800 | trace_btrfs_inode_evict(inode); |
3801 | ||
39279cc3 | 3802 | truncate_inode_pages(&inode->i_data, 0); |
0af3d00b | 3803 | if (inode->i_nlink && (btrfs_root_refs(&root->root_item) != 0 || |
83eea1f1 | 3804 | btrfs_is_free_space_inode(inode))) |
bd555975 AV |
3805 | goto no_delete; |
3806 | ||
39279cc3 | 3807 | if (is_bad_inode(inode)) { |
7b128766 | 3808 | btrfs_orphan_del(NULL, inode); |
39279cc3 CM |
3809 | goto no_delete; |
3810 | } | |
bd555975 | 3811 | /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */ |
4a096752 | 3812 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
5f39d397 | 3813 | |
c71bf099 | 3814 | if (root->fs_info->log_root_recovering) { |
6bf02314 | 3815 | BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
8a35d95f | 3816 | &BTRFS_I(inode)->runtime_flags)); |
c71bf099 YZ |
3817 | goto no_delete; |
3818 | } | |
3819 | ||
76dda93c YZ |
3820 | if (inode->i_nlink > 0) { |
3821 | BUG_ON(btrfs_root_refs(&root->root_item) != 0); | |
3822 | goto no_delete; | |
3823 | } | |
3824 | ||
66d8f3dd | 3825 | rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP); |
4289a667 JB |
3826 | if (!rsv) { |
3827 | btrfs_orphan_del(NULL, inode); | |
3828 | goto no_delete; | |
3829 | } | |
4a338542 | 3830 | rsv->size = min_size; |
ca7e70f5 | 3831 | rsv->failfast = 1; |
726c35fa | 3832 | global_rsv = &root->fs_info->global_block_rsv; |
4289a667 | 3833 | |
dbe674a9 | 3834 | btrfs_i_size_write(inode, 0); |
5f39d397 | 3835 | |
4289a667 JB |
3836 | /* |
3837 | * This is a bit simpler than btrfs_truncate since | |
3838 | * | |
3839 | * 1) We've already reserved our space for our orphan item in the | |
3840 | * unlink. | |
3841 | * 2) We're going to delete the inode item, so we don't need to update | |
3842 | * it at all. | |
3843 | * | |
3844 | * So we just need to reserve some slack space in case we add bytes when | |
3845 | * doing the truncate. | |
3846 | */ | |
8082510e | 3847 | while (1) { |
aa38a711 | 3848 | ret = btrfs_block_rsv_refill_noflush(root, rsv, min_size); |
726c35fa JB |
3849 | |
3850 | /* | |
3851 | * Try and steal from the global reserve since we will | |
3852 | * likely not use this space anyway, we want to try as | |
3853 | * hard as possible to get this to work. | |
3854 | */ | |
3855 | if (ret) | |
3856 | ret = btrfs_block_rsv_migrate(global_rsv, rsv, min_size); | |
d68fc57b | 3857 | |
d68fc57b | 3858 | if (ret) { |
4289a667 | 3859 | printk(KERN_WARNING "Could not get space for a " |
482e6dc5 | 3860 | "delete, will truncate on mount %d\n", ret); |
4289a667 JB |
3861 | btrfs_orphan_del(NULL, inode); |
3862 | btrfs_free_block_rsv(root, rsv); | |
3863 | goto no_delete; | |
d68fc57b | 3864 | } |
7b128766 | 3865 | |
4289a667 JB |
3866 | trans = btrfs_start_transaction(root, 0); |
3867 | if (IS_ERR(trans)) { | |
3868 | btrfs_orphan_del(NULL, inode); | |
3869 | btrfs_free_block_rsv(root, rsv); | |
3870 | goto no_delete; | |
d68fc57b | 3871 | } |
7b128766 | 3872 | |
4289a667 JB |
3873 | trans->block_rsv = rsv; |
3874 | ||
d68fc57b | 3875 | ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0); |
ca7e70f5 | 3876 | if (ret != -ENOSPC) |
8082510e | 3877 | break; |
85e21bac | 3878 | |
8082510e YZ |
3879 | nr = trans->blocks_used; |
3880 | btrfs_end_transaction(trans, root); | |
3881 | trans = NULL; | |
3882 | btrfs_btree_balance_dirty(root, nr); | |
3883 | } | |
5f39d397 | 3884 | |
4289a667 JB |
3885 | btrfs_free_block_rsv(root, rsv); |
3886 | ||
8082510e | 3887 | if (ret == 0) { |
4289a667 | 3888 | trans->block_rsv = root->orphan_block_rsv; |
8082510e YZ |
3889 | ret = btrfs_orphan_del(trans, inode); |
3890 | BUG_ON(ret); | |
3891 | } | |
54aa1f4d | 3892 | |
4289a667 | 3893 | trans->block_rsv = &root->fs_info->trans_block_rsv; |
581bb050 LZ |
3894 | if (!(root == root->fs_info->tree_root || |
3895 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)) | |
33345d01 | 3896 | btrfs_return_ino(root, btrfs_ino(inode)); |
581bb050 | 3897 | |
d3c2fdcf | 3898 | nr = trans->blocks_used; |
54aa1f4d | 3899 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 3900 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 | 3901 | no_delete: |
dbd5768f | 3902 | clear_inode(inode); |
8082510e | 3903 | return; |
39279cc3 CM |
3904 | } |
3905 | ||
3906 | /* | |
3907 | * this returns the key found in the dir entry in the location pointer. | |
3908 | * If no dir entries were found, location->objectid is 0. | |
3909 | */ | |
3910 | static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry, | |
3911 | struct btrfs_key *location) | |
3912 | { | |
3913 | const char *name = dentry->d_name.name; | |
3914 | int namelen = dentry->d_name.len; | |
3915 | struct btrfs_dir_item *di; | |
3916 | struct btrfs_path *path; | |
3917 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
0d9f7f3e | 3918 | int ret = 0; |
39279cc3 CM |
3919 | |
3920 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
3921 | if (!path) |
3922 | return -ENOMEM; | |
3954401f | 3923 | |
33345d01 | 3924 | di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), name, |
39279cc3 | 3925 | namelen, 0); |
0d9f7f3e Y |
3926 | if (IS_ERR(di)) |
3927 | ret = PTR_ERR(di); | |
d397712b | 3928 | |
c704005d | 3929 | if (IS_ERR_OR_NULL(di)) |
3954401f | 3930 | goto out_err; |
d397712b | 3931 | |
5f39d397 | 3932 | btrfs_dir_item_key_to_cpu(path->nodes[0], di, location); |
39279cc3 | 3933 | out: |
39279cc3 CM |
3934 | btrfs_free_path(path); |
3935 | return ret; | |
3954401f CM |
3936 | out_err: |
3937 | location->objectid = 0; | |
3938 | goto out; | |
39279cc3 CM |
3939 | } |
3940 | ||
3941 | /* | |
3942 | * when we hit a tree root in a directory, the btrfs part of the inode | |
3943 | * needs to be changed to reflect the root directory of the tree root. This | |
3944 | * is kind of like crossing a mount point. | |
3945 | */ | |
3946 | static int fixup_tree_root_location(struct btrfs_root *root, | |
4df27c4d YZ |
3947 | struct inode *dir, |
3948 | struct dentry *dentry, | |
3949 | struct btrfs_key *location, | |
3950 | struct btrfs_root **sub_root) | |
39279cc3 | 3951 | { |
4df27c4d YZ |
3952 | struct btrfs_path *path; |
3953 | struct btrfs_root *new_root; | |
3954 | struct btrfs_root_ref *ref; | |
3955 | struct extent_buffer *leaf; | |
3956 | int ret; | |
3957 | int err = 0; | |
39279cc3 | 3958 | |
4df27c4d YZ |
3959 | path = btrfs_alloc_path(); |
3960 | if (!path) { | |
3961 | err = -ENOMEM; | |
3962 | goto out; | |
3963 | } | |
39279cc3 | 3964 | |
4df27c4d YZ |
3965 | err = -ENOENT; |
3966 | ret = btrfs_find_root_ref(root->fs_info->tree_root, path, | |
3967 | BTRFS_I(dir)->root->root_key.objectid, | |
3968 | location->objectid); | |
3969 | if (ret) { | |
3970 | if (ret < 0) | |
3971 | err = ret; | |
3972 | goto out; | |
3973 | } | |
39279cc3 | 3974 | |
4df27c4d YZ |
3975 | leaf = path->nodes[0]; |
3976 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); | |
33345d01 | 3977 | if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) || |
4df27c4d YZ |
3978 | btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len) |
3979 | goto out; | |
39279cc3 | 3980 | |
4df27c4d YZ |
3981 | ret = memcmp_extent_buffer(leaf, dentry->d_name.name, |
3982 | (unsigned long)(ref + 1), | |
3983 | dentry->d_name.len); | |
3984 | if (ret) | |
3985 | goto out; | |
3986 | ||
b3b4aa74 | 3987 | btrfs_release_path(path); |
4df27c4d YZ |
3988 | |
3989 | new_root = btrfs_read_fs_root_no_name(root->fs_info, location); | |
3990 | if (IS_ERR(new_root)) { | |
3991 | err = PTR_ERR(new_root); | |
3992 | goto out; | |
3993 | } | |
3994 | ||
3995 | if (btrfs_root_refs(&new_root->root_item) == 0) { | |
3996 | err = -ENOENT; | |
3997 | goto out; | |
3998 | } | |
3999 | ||
4000 | *sub_root = new_root; | |
4001 | location->objectid = btrfs_root_dirid(&new_root->root_item); | |
4002 | location->type = BTRFS_INODE_ITEM_KEY; | |
4003 | location->offset = 0; | |
4004 | err = 0; | |
4005 | out: | |
4006 | btrfs_free_path(path); | |
4007 | return err; | |
39279cc3 CM |
4008 | } |
4009 | ||
5d4f98a2 YZ |
4010 | static void inode_tree_add(struct inode *inode) |
4011 | { | |
4012 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4013 | struct btrfs_inode *entry; | |
03e860bd FNP |
4014 | struct rb_node **p; |
4015 | struct rb_node *parent; | |
33345d01 | 4016 | u64 ino = btrfs_ino(inode); |
03e860bd FNP |
4017 | again: |
4018 | p = &root->inode_tree.rb_node; | |
4019 | parent = NULL; | |
5d4f98a2 | 4020 | |
1d3382cb | 4021 | if (inode_unhashed(inode)) |
76dda93c YZ |
4022 | return; |
4023 | ||
5d4f98a2 YZ |
4024 | spin_lock(&root->inode_lock); |
4025 | while (*p) { | |
4026 | parent = *p; | |
4027 | entry = rb_entry(parent, struct btrfs_inode, rb_node); | |
4028 | ||
33345d01 | 4029 | if (ino < btrfs_ino(&entry->vfs_inode)) |
03e860bd | 4030 | p = &parent->rb_left; |
33345d01 | 4031 | else if (ino > btrfs_ino(&entry->vfs_inode)) |
03e860bd | 4032 | p = &parent->rb_right; |
5d4f98a2 YZ |
4033 | else { |
4034 | WARN_ON(!(entry->vfs_inode.i_state & | |
a4ffdde6 | 4035 | (I_WILL_FREE | I_FREEING))); |
03e860bd FNP |
4036 | rb_erase(parent, &root->inode_tree); |
4037 | RB_CLEAR_NODE(parent); | |
4038 | spin_unlock(&root->inode_lock); | |
4039 | goto again; | |
5d4f98a2 YZ |
4040 | } |
4041 | } | |
4042 | rb_link_node(&BTRFS_I(inode)->rb_node, parent, p); | |
4043 | rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree); | |
4044 | spin_unlock(&root->inode_lock); | |
4045 | } | |
4046 | ||
4047 | static void inode_tree_del(struct inode *inode) | |
4048 | { | |
4049 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
76dda93c | 4050 | int empty = 0; |
5d4f98a2 | 4051 | |
03e860bd | 4052 | spin_lock(&root->inode_lock); |
5d4f98a2 | 4053 | if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) { |
5d4f98a2 | 4054 | rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree); |
5d4f98a2 | 4055 | RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); |
76dda93c | 4056 | empty = RB_EMPTY_ROOT(&root->inode_tree); |
5d4f98a2 | 4057 | } |
03e860bd | 4058 | spin_unlock(&root->inode_lock); |
76dda93c | 4059 | |
0af3d00b JB |
4060 | /* |
4061 | * Free space cache has inodes in the tree root, but the tree root has a | |
4062 | * root_refs of 0, so this could end up dropping the tree root as a | |
4063 | * snapshot, so we need the extra !root->fs_info->tree_root check to | |
4064 | * make sure we don't drop it. | |
4065 | */ | |
4066 | if (empty && btrfs_root_refs(&root->root_item) == 0 && | |
4067 | root != root->fs_info->tree_root) { | |
76dda93c YZ |
4068 | synchronize_srcu(&root->fs_info->subvol_srcu); |
4069 | spin_lock(&root->inode_lock); | |
4070 | empty = RB_EMPTY_ROOT(&root->inode_tree); | |
4071 | spin_unlock(&root->inode_lock); | |
4072 | if (empty) | |
4073 | btrfs_add_dead_root(root); | |
4074 | } | |
4075 | } | |
4076 | ||
143bede5 | 4077 | void btrfs_invalidate_inodes(struct btrfs_root *root) |
76dda93c YZ |
4078 | { |
4079 | struct rb_node *node; | |
4080 | struct rb_node *prev; | |
4081 | struct btrfs_inode *entry; | |
4082 | struct inode *inode; | |
4083 | u64 objectid = 0; | |
4084 | ||
4085 | WARN_ON(btrfs_root_refs(&root->root_item) != 0); | |
4086 | ||
4087 | spin_lock(&root->inode_lock); | |
4088 | again: | |
4089 | node = root->inode_tree.rb_node; | |
4090 | prev = NULL; | |
4091 | while (node) { | |
4092 | prev = node; | |
4093 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
4094 | ||
33345d01 | 4095 | if (objectid < btrfs_ino(&entry->vfs_inode)) |
76dda93c | 4096 | node = node->rb_left; |
33345d01 | 4097 | else if (objectid > btrfs_ino(&entry->vfs_inode)) |
76dda93c YZ |
4098 | node = node->rb_right; |
4099 | else | |
4100 | break; | |
4101 | } | |
4102 | if (!node) { | |
4103 | while (prev) { | |
4104 | entry = rb_entry(prev, struct btrfs_inode, rb_node); | |
33345d01 | 4105 | if (objectid <= btrfs_ino(&entry->vfs_inode)) { |
76dda93c YZ |
4106 | node = prev; |
4107 | break; | |
4108 | } | |
4109 | prev = rb_next(prev); | |
4110 | } | |
4111 | } | |
4112 | while (node) { | |
4113 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
33345d01 | 4114 | objectid = btrfs_ino(&entry->vfs_inode) + 1; |
76dda93c YZ |
4115 | inode = igrab(&entry->vfs_inode); |
4116 | if (inode) { | |
4117 | spin_unlock(&root->inode_lock); | |
4118 | if (atomic_read(&inode->i_count) > 1) | |
4119 | d_prune_aliases(inode); | |
4120 | /* | |
45321ac5 | 4121 | * btrfs_drop_inode will have it removed from |
76dda93c YZ |
4122 | * the inode cache when its usage count |
4123 | * hits zero. | |
4124 | */ | |
4125 | iput(inode); | |
4126 | cond_resched(); | |
4127 | spin_lock(&root->inode_lock); | |
4128 | goto again; | |
4129 | } | |
4130 | ||
4131 | if (cond_resched_lock(&root->inode_lock)) | |
4132 | goto again; | |
4133 | ||
4134 | node = rb_next(node); | |
4135 | } | |
4136 | spin_unlock(&root->inode_lock); | |
5d4f98a2 YZ |
4137 | } |
4138 | ||
e02119d5 CM |
4139 | static int btrfs_init_locked_inode(struct inode *inode, void *p) |
4140 | { | |
4141 | struct btrfs_iget_args *args = p; | |
4142 | inode->i_ino = args->ino; | |
e02119d5 | 4143 | BTRFS_I(inode)->root = args->root; |
39279cc3 CM |
4144 | return 0; |
4145 | } | |
4146 | ||
4147 | static int btrfs_find_actor(struct inode *inode, void *opaque) | |
4148 | { | |
4149 | struct btrfs_iget_args *args = opaque; | |
33345d01 | 4150 | return args->ino == btrfs_ino(inode) && |
d397712b | 4151 | args->root == BTRFS_I(inode)->root; |
39279cc3 CM |
4152 | } |
4153 | ||
5d4f98a2 YZ |
4154 | static struct inode *btrfs_iget_locked(struct super_block *s, |
4155 | u64 objectid, | |
4156 | struct btrfs_root *root) | |
39279cc3 CM |
4157 | { |
4158 | struct inode *inode; | |
4159 | struct btrfs_iget_args args; | |
4160 | args.ino = objectid; | |
4161 | args.root = root; | |
4162 | ||
4163 | inode = iget5_locked(s, objectid, btrfs_find_actor, | |
4164 | btrfs_init_locked_inode, | |
4165 | (void *)&args); | |
4166 | return inode; | |
4167 | } | |
4168 | ||
1a54ef8c BR |
4169 | /* Get an inode object given its location and corresponding root. |
4170 | * Returns in *is_new if the inode was read from disk | |
4171 | */ | |
4172 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, | |
73f73415 | 4173 | struct btrfs_root *root, int *new) |
1a54ef8c BR |
4174 | { |
4175 | struct inode *inode; | |
4176 | ||
4177 | inode = btrfs_iget_locked(s, location->objectid, root); | |
4178 | if (!inode) | |
5d4f98a2 | 4179 | return ERR_PTR(-ENOMEM); |
1a54ef8c BR |
4180 | |
4181 | if (inode->i_state & I_NEW) { | |
4182 | BTRFS_I(inode)->root = root; | |
4183 | memcpy(&BTRFS_I(inode)->location, location, sizeof(*location)); | |
4184 | btrfs_read_locked_inode(inode); | |
1748f843 MF |
4185 | if (!is_bad_inode(inode)) { |
4186 | inode_tree_add(inode); | |
4187 | unlock_new_inode(inode); | |
4188 | if (new) | |
4189 | *new = 1; | |
4190 | } else { | |
e0b6d65b ST |
4191 | unlock_new_inode(inode); |
4192 | iput(inode); | |
4193 | inode = ERR_PTR(-ESTALE); | |
1748f843 MF |
4194 | } |
4195 | } | |
4196 | ||
1a54ef8c BR |
4197 | return inode; |
4198 | } | |
4199 | ||
4df27c4d YZ |
4200 | static struct inode *new_simple_dir(struct super_block *s, |
4201 | struct btrfs_key *key, | |
4202 | struct btrfs_root *root) | |
4203 | { | |
4204 | struct inode *inode = new_inode(s); | |
4205 | ||
4206 | if (!inode) | |
4207 | return ERR_PTR(-ENOMEM); | |
4208 | ||
4df27c4d YZ |
4209 | BTRFS_I(inode)->root = root; |
4210 | memcpy(&BTRFS_I(inode)->location, key, sizeof(*key)); | |
72ac3c0d | 4211 | set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags); |
4df27c4d YZ |
4212 | |
4213 | inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID; | |
848cce0d | 4214 | inode->i_op = &btrfs_dir_ro_inode_operations; |
4df27c4d YZ |
4215 | inode->i_fop = &simple_dir_operations; |
4216 | inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO; | |
4217 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; | |
4218 | ||
4219 | return inode; | |
4220 | } | |
4221 | ||
3de4586c | 4222 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry) |
39279cc3 | 4223 | { |
d397712b | 4224 | struct inode *inode; |
4df27c4d | 4225 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 CM |
4226 | struct btrfs_root *sub_root = root; |
4227 | struct btrfs_key location; | |
76dda93c | 4228 | int index; |
b4aff1f8 | 4229 | int ret = 0; |
39279cc3 CM |
4230 | |
4231 | if (dentry->d_name.len > BTRFS_NAME_LEN) | |
4232 | return ERR_PTR(-ENAMETOOLONG); | |
5f39d397 | 4233 | |
b4aff1f8 JB |
4234 | if (unlikely(d_need_lookup(dentry))) { |
4235 | memcpy(&location, dentry->d_fsdata, sizeof(struct btrfs_key)); | |
4236 | kfree(dentry->d_fsdata); | |
4237 | dentry->d_fsdata = NULL; | |
a66e7cc6 JB |
4238 | /* This thing is hashed, drop it for now */ |
4239 | d_drop(dentry); | |
b4aff1f8 JB |
4240 | } else { |
4241 | ret = btrfs_inode_by_name(dir, dentry, &location); | |
4242 | } | |
5f39d397 | 4243 | |
39279cc3 CM |
4244 | if (ret < 0) |
4245 | return ERR_PTR(ret); | |
5f39d397 | 4246 | |
4df27c4d YZ |
4247 | if (location.objectid == 0) |
4248 | return NULL; | |
4249 | ||
4250 | if (location.type == BTRFS_INODE_ITEM_KEY) { | |
73f73415 | 4251 | inode = btrfs_iget(dir->i_sb, &location, root, NULL); |
4df27c4d YZ |
4252 | return inode; |
4253 | } | |
4254 | ||
4255 | BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY); | |
4256 | ||
76dda93c | 4257 | index = srcu_read_lock(&root->fs_info->subvol_srcu); |
4df27c4d YZ |
4258 | ret = fixup_tree_root_location(root, dir, dentry, |
4259 | &location, &sub_root); | |
4260 | if (ret < 0) { | |
4261 | if (ret != -ENOENT) | |
4262 | inode = ERR_PTR(ret); | |
4263 | else | |
4264 | inode = new_simple_dir(dir->i_sb, &location, sub_root); | |
4265 | } else { | |
73f73415 | 4266 | inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL); |
39279cc3 | 4267 | } |
76dda93c YZ |
4268 | srcu_read_unlock(&root->fs_info->subvol_srcu, index); |
4269 | ||
34d19bad | 4270 | if (!IS_ERR(inode) && root != sub_root) { |
c71bf099 YZ |
4271 | down_read(&root->fs_info->cleanup_work_sem); |
4272 | if (!(inode->i_sb->s_flags & MS_RDONLY)) | |
66b4ffd1 | 4273 | ret = btrfs_orphan_cleanup(sub_root); |
c71bf099 | 4274 | up_read(&root->fs_info->cleanup_work_sem); |
66b4ffd1 JB |
4275 | if (ret) |
4276 | inode = ERR_PTR(ret); | |
c71bf099 YZ |
4277 | } |
4278 | ||
3de4586c CM |
4279 | return inode; |
4280 | } | |
4281 | ||
fe15ce44 | 4282 | static int btrfs_dentry_delete(const struct dentry *dentry) |
76dda93c YZ |
4283 | { |
4284 | struct btrfs_root *root; | |
848cce0d | 4285 | struct inode *inode = dentry->d_inode; |
76dda93c | 4286 | |
848cce0d LZ |
4287 | if (!inode && !IS_ROOT(dentry)) |
4288 | inode = dentry->d_parent->d_inode; | |
76dda93c | 4289 | |
848cce0d LZ |
4290 | if (inode) { |
4291 | root = BTRFS_I(inode)->root; | |
efefb143 YZ |
4292 | if (btrfs_root_refs(&root->root_item) == 0) |
4293 | return 1; | |
848cce0d LZ |
4294 | |
4295 | if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) | |
4296 | return 1; | |
efefb143 | 4297 | } |
76dda93c YZ |
4298 | return 0; |
4299 | } | |
4300 | ||
b4aff1f8 JB |
4301 | static void btrfs_dentry_release(struct dentry *dentry) |
4302 | { | |
4303 | if (dentry->d_fsdata) | |
4304 | kfree(dentry->d_fsdata); | |
4305 | } | |
4306 | ||
3de4586c | 4307 | static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry, |
00cd8dd3 | 4308 | unsigned int flags) |
3de4586c | 4309 | { |
a66e7cc6 JB |
4310 | struct dentry *ret; |
4311 | ||
4312 | ret = d_splice_alias(btrfs_lookup_dentry(dir, dentry), dentry); | |
4313 | if (unlikely(d_need_lookup(dentry))) { | |
4314 | spin_lock(&dentry->d_lock); | |
4315 | dentry->d_flags &= ~DCACHE_NEED_LOOKUP; | |
4316 | spin_unlock(&dentry->d_lock); | |
4317 | } | |
4318 | return ret; | |
39279cc3 CM |
4319 | } |
4320 | ||
16cdcec7 | 4321 | unsigned char btrfs_filetype_table[] = { |
39279cc3 CM |
4322 | DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK |
4323 | }; | |
4324 | ||
cbdf5a24 DW |
4325 | static int btrfs_real_readdir(struct file *filp, void *dirent, |
4326 | filldir_t filldir) | |
39279cc3 | 4327 | { |
6da6abae | 4328 | struct inode *inode = filp->f_dentry->d_inode; |
39279cc3 CM |
4329 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4330 | struct btrfs_item *item; | |
4331 | struct btrfs_dir_item *di; | |
4332 | struct btrfs_key key; | |
5f39d397 | 4333 | struct btrfs_key found_key; |
39279cc3 | 4334 | struct btrfs_path *path; |
16cdcec7 MX |
4335 | struct list_head ins_list; |
4336 | struct list_head del_list; | |
39279cc3 | 4337 | int ret; |
5f39d397 | 4338 | struct extent_buffer *leaf; |
39279cc3 | 4339 | int slot; |
39279cc3 CM |
4340 | unsigned char d_type; |
4341 | int over = 0; | |
4342 | u32 di_cur; | |
4343 | u32 di_total; | |
4344 | u32 di_len; | |
4345 | int key_type = BTRFS_DIR_INDEX_KEY; | |
5f39d397 CM |
4346 | char tmp_name[32]; |
4347 | char *name_ptr; | |
4348 | int name_len; | |
16cdcec7 | 4349 | int is_curr = 0; /* filp->f_pos points to the current index? */ |
39279cc3 CM |
4350 | |
4351 | /* FIXME, use a real flag for deciding about the key type */ | |
4352 | if (root->fs_info->tree_root == root) | |
4353 | key_type = BTRFS_DIR_ITEM_KEY; | |
5f39d397 | 4354 | |
3954401f CM |
4355 | /* special case for "." */ |
4356 | if (filp->f_pos == 0) { | |
3765fefa HS |
4357 | over = filldir(dirent, ".", 1, |
4358 | filp->f_pos, btrfs_ino(inode), DT_DIR); | |
3954401f CM |
4359 | if (over) |
4360 | return 0; | |
4361 | filp->f_pos = 1; | |
4362 | } | |
3954401f CM |
4363 | /* special case for .., just use the back ref */ |
4364 | if (filp->f_pos == 1) { | |
5ecc7e5d | 4365 | u64 pino = parent_ino(filp->f_path.dentry); |
3954401f | 4366 | over = filldir(dirent, "..", 2, |
3765fefa | 4367 | filp->f_pos, pino, DT_DIR); |
3954401f | 4368 | if (over) |
49593bfa | 4369 | return 0; |
3954401f CM |
4370 | filp->f_pos = 2; |
4371 | } | |
49593bfa | 4372 | path = btrfs_alloc_path(); |
16cdcec7 MX |
4373 | if (!path) |
4374 | return -ENOMEM; | |
ff5714cc | 4375 | |
026fd317 | 4376 | path->reada = 1; |
49593bfa | 4377 | |
16cdcec7 MX |
4378 | if (key_type == BTRFS_DIR_INDEX_KEY) { |
4379 | INIT_LIST_HEAD(&ins_list); | |
4380 | INIT_LIST_HEAD(&del_list); | |
4381 | btrfs_get_delayed_items(inode, &ins_list, &del_list); | |
4382 | } | |
4383 | ||
39279cc3 CM |
4384 | btrfs_set_key_type(&key, key_type); |
4385 | key.offset = filp->f_pos; | |
33345d01 | 4386 | key.objectid = btrfs_ino(inode); |
5f39d397 | 4387 | |
39279cc3 CM |
4388 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
4389 | if (ret < 0) | |
4390 | goto err; | |
49593bfa DW |
4391 | |
4392 | while (1) { | |
5f39d397 | 4393 | leaf = path->nodes[0]; |
39279cc3 | 4394 | slot = path->slots[0]; |
b9e03af0 LZ |
4395 | if (slot >= btrfs_header_nritems(leaf)) { |
4396 | ret = btrfs_next_leaf(root, path); | |
4397 | if (ret < 0) | |
4398 | goto err; | |
4399 | else if (ret > 0) | |
4400 | break; | |
4401 | continue; | |
39279cc3 | 4402 | } |
3de4586c | 4403 | |
5f39d397 CM |
4404 | item = btrfs_item_nr(leaf, slot); |
4405 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
4406 | ||
4407 | if (found_key.objectid != key.objectid) | |
39279cc3 | 4408 | break; |
5f39d397 | 4409 | if (btrfs_key_type(&found_key) != key_type) |
39279cc3 | 4410 | break; |
5f39d397 | 4411 | if (found_key.offset < filp->f_pos) |
b9e03af0 | 4412 | goto next; |
16cdcec7 MX |
4413 | if (key_type == BTRFS_DIR_INDEX_KEY && |
4414 | btrfs_should_delete_dir_index(&del_list, | |
4415 | found_key.offset)) | |
4416 | goto next; | |
5f39d397 CM |
4417 | |
4418 | filp->f_pos = found_key.offset; | |
16cdcec7 | 4419 | is_curr = 1; |
49593bfa | 4420 | |
39279cc3 CM |
4421 | di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item); |
4422 | di_cur = 0; | |
5f39d397 | 4423 | di_total = btrfs_item_size(leaf, item); |
49593bfa DW |
4424 | |
4425 | while (di_cur < di_total) { | |
5f39d397 CM |
4426 | struct btrfs_key location; |
4427 | ||
22a94d44 JB |
4428 | if (verify_dir_item(root, leaf, di)) |
4429 | break; | |
4430 | ||
5f39d397 | 4431 | name_len = btrfs_dir_name_len(leaf, di); |
49593bfa | 4432 | if (name_len <= sizeof(tmp_name)) { |
5f39d397 CM |
4433 | name_ptr = tmp_name; |
4434 | } else { | |
4435 | name_ptr = kmalloc(name_len, GFP_NOFS); | |
49593bfa DW |
4436 | if (!name_ptr) { |
4437 | ret = -ENOMEM; | |
4438 | goto err; | |
4439 | } | |
5f39d397 CM |
4440 | } |
4441 | read_extent_buffer(leaf, name_ptr, | |
4442 | (unsigned long)(di + 1), name_len); | |
4443 | ||
4444 | d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)]; | |
4445 | btrfs_dir_item_key_to_cpu(leaf, di, &location); | |
3de4586c | 4446 | |
fede766f | 4447 | |
3de4586c | 4448 | /* is this a reference to our own snapshot? If so |
8c9c2bf7 AJ |
4449 | * skip it. |
4450 | * | |
4451 | * In contrast to old kernels, we insert the snapshot's | |
4452 | * dir item and dir index after it has been created, so | |
4453 | * we won't find a reference to our own snapshot. We | |
4454 | * still keep the following code for backward | |
4455 | * compatibility. | |
3de4586c CM |
4456 | */ |
4457 | if (location.type == BTRFS_ROOT_ITEM_KEY && | |
4458 | location.objectid == root->root_key.objectid) { | |
4459 | over = 0; | |
4460 | goto skip; | |
4461 | } | |
5f39d397 | 4462 | over = filldir(dirent, name_ptr, name_len, |
49593bfa | 4463 | found_key.offset, location.objectid, |
39279cc3 | 4464 | d_type); |
5f39d397 | 4465 | |
3de4586c | 4466 | skip: |
5f39d397 CM |
4467 | if (name_ptr != tmp_name) |
4468 | kfree(name_ptr); | |
4469 | ||
39279cc3 CM |
4470 | if (over) |
4471 | goto nopos; | |
5103e947 | 4472 | di_len = btrfs_dir_name_len(leaf, di) + |
49593bfa | 4473 | btrfs_dir_data_len(leaf, di) + sizeof(*di); |
39279cc3 CM |
4474 | di_cur += di_len; |
4475 | di = (struct btrfs_dir_item *)((char *)di + di_len); | |
4476 | } | |
b9e03af0 LZ |
4477 | next: |
4478 | path->slots[0]++; | |
39279cc3 | 4479 | } |
49593bfa | 4480 | |
16cdcec7 MX |
4481 | if (key_type == BTRFS_DIR_INDEX_KEY) { |
4482 | if (is_curr) | |
4483 | filp->f_pos++; | |
4484 | ret = btrfs_readdir_delayed_dir_index(filp, dirent, filldir, | |
4485 | &ins_list); | |
4486 | if (ret) | |
4487 | goto nopos; | |
4488 | } | |
4489 | ||
49593bfa | 4490 | /* Reached end of directory/root. Bump pos past the last item. */ |
5e591a07 | 4491 | if (key_type == BTRFS_DIR_INDEX_KEY) |
406266ab JE |
4492 | /* |
4493 | * 32-bit glibc will use getdents64, but then strtol - | |
4494 | * so the last number we can serve is this. | |
4495 | */ | |
4496 | filp->f_pos = 0x7fffffff; | |
5e591a07 YZ |
4497 | else |
4498 | filp->f_pos++; | |
39279cc3 CM |
4499 | nopos: |
4500 | ret = 0; | |
4501 | err: | |
16cdcec7 MX |
4502 | if (key_type == BTRFS_DIR_INDEX_KEY) |
4503 | btrfs_put_delayed_items(&ins_list, &del_list); | |
39279cc3 | 4504 | btrfs_free_path(path); |
39279cc3 CM |
4505 | return ret; |
4506 | } | |
4507 | ||
a9185b41 | 4508 | int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc) |
39279cc3 CM |
4509 | { |
4510 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4511 | struct btrfs_trans_handle *trans; | |
4512 | int ret = 0; | |
0af3d00b | 4513 | bool nolock = false; |
39279cc3 | 4514 | |
72ac3c0d | 4515 | if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags)) |
4ca8b41e CM |
4516 | return 0; |
4517 | ||
83eea1f1 | 4518 | if (btrfs_fs_closing(root->fs_info) && btrfs_is_free_space_inode(inode)) |
82d5902d | 4519 | nolock = true; |
0af3d00b | 4520 | |
a9185b41 | 4521 | if (wbc->sync_mode == WB_SYNC_ALL) { |
0af3d00b | 4522 | if (nolock) |
7a7eaa40 | 4523 | trans = btrfs_join_transaction_nolock(root); |
0af3d00b | 4524 | else |
7a7eaa40 | 4525 | trans = btrfs_join_transaction(root); |
3612b495 TI |
4526 | if (IS_ERR(trans)) |
4527 | return PTR_ERR(trans); | |
0af3d00b JB |
4528 | if (nolock) |
4529 | ret = btrfs_end_transaction_nolock(trans, root); | |
4530 | else | |
4531 | ret = btrfs_commit_transaction(trans, root); | |
39279cc3 CM |
4532 | } |
4533 | return ret; | |
4534 | } | |
4535 | ||
4536 | /* | |
54aa1f4d | 4537 | * This is somewhat expensive, updating the tree every time the |
39279cc3 CM |
4538 | * inode changes. But, it is most likely to find the inode in cache. |
4539 | * FIXME, needs more benchmarking...there are no reasons other than performance | |
4540 | * to keep or drop this code. | |
4541 | */ | |
22c44fe6 | 4542 | int btrfs_dirty_inode(struct inode *inode) |
39279cc3 CM |
4543 | { |
4544 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4545 | struct btrfs_trans_handle *trans; | |
8929ecfa YZ |
4546 | int ret; |
4547 | ||
72ac3c0d | 4548 | if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags)) |
22c44fe6 | 4549 | return 0; |
39279cc3 | 4550 | |
7a7eaa40 | 4551 | trans = btrfs_join_transaction(root); |
22c44fe6 JB |
4552 | if (IS_ERR(trans)) |
4553 | return PTR_ERR(trans); | |
8929ecfa YZ |
4554 | |
4555 | ret = btrfs_update_inode(trans, root, inode); | |
94b60442 CM |
4556 | if (ret && ret == -ENOSPC) { |
4557 | /* whoops, lets try again with the full transaction */ | |
4558 | btrfs_end_transaction(trans, root); | |
4559 | trans = btrfs_start_transaction(root, 1); | |
22c44fe6 JB |
4560 | if (IS_ERR(trans)) |
4561 | return PTR_ERR(trans); | |
8929ecfa | 4562 | |
94b60442 | 4563 | ret = btrfs_update_inode(trans, root, inode); |
94b60442 | 4564 | } |
39279cc3 | 4565 | btrfs_end_transaction(trans, root); |
16cdcec7 MX |
4566 | if (BTRFS_I(inode)->delayed_node) |
4567 | btrfs_balance_delayed_items(root); | |
22c44fe6 JB |
4568 | |
4569 | return ret; | |
4570 | } | |
4571 | ||
4572 | /* | |
4573 | * This is a copy of file_update_time. We need this so we can return error on | |
4574 | * ENOSPC for updating the inode in the case of file write and mmap writes. | |
4575 | */ | |
e41f941a JB |
4576 | static int btrfs_update_time(struct inode *inode, struct timespec *now, |
4577 | int flags) | |
22c44fe6 | 4578 | { |
2bc55652 AB |
4579 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4580 | ||
4581 | if (btrfs_root_readonly(root)) | |
4582 | return -EROFS; | |
4583 | ||
e41f941a | 4584 | if (flags & S_VERSION) |
22c44fe6 | 4585 | inode_inc_iversion(inode); |
e41f941a JB |
4586 | if (flags & S_CTIME) |
4587 | inode->i_ctime = *now; | |
4588 | if (flags & S_MTIME) | |
4589 | inode->i_mtime = *now; | |
4590 | if (flags & S_ATIME) | |
4591 | inode->i_atime = *now; | |
4592 | return btrfs_dirty_inode(inode); | |
39279cc3 CM |
4593 | } |
4594 | ||
d352ac68 CM |
4595 | /* |
4596 | * find the highest existing sequence number in a directory | |
4597 | * and then set the in-memory index_cnt variable to reflect | |
4598 | * free sequence numbers | |
4599 | */ | |
aec7477b JB |
4600 | static int btrfs_set_inode_index_count(struct inode *inode) |
4601 | { | |
4602 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4603 | struct btrfs_key key, found_key; | |
4604 | struct btrfs_path *path; | |
4605 | struct extent_buffer *leaf; | |
4606 | int ret; | |
4607 | ||
33345d01 | 4608 | key.objectid = btrfs_ino(inode); |
aec7477b JB |
4609 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); |
4610 | key.offset = (u64)-1; | |
4611 | ||
4612 | path = btrfs_alloc_path(); | |
4613 | if (!path) | |
4614 | return -ENOMEM; | |
4615 | ||
4616 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
4617 | if (ret < 0) | |
4618 | goto out; | |
4619 | /* FIXME: we should be able to handle this */ | |
4620 | if (ret == 0) | |
4621 | goto out; | |
4622 | ret = 0; | |
4623 | ||
4624 | /* | |
4625 | * MAGIC NUMBER EXPLANATION: | |
4626 | * since we search a directory based on f_pos we have to start at 2 | |
4627 | * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody | |
4628 | * else has to start at 2 | |
4629 | */ | |
4630 | if (path->slots[0] == 0) { | |
4631 | BTRFS_I(inode)->index_cnt = 2; | |
4632 | goto out; | |
4633 | } | |
4634 | ||
4635 | path->slots[0]--; | |
4636 | ||
4637 | leaf = path->nodes[0]; | |
4638 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
4639 | ||
33345d01 | 4640 | if (found_key.objectid != btrfs_ino(inode) || |
aec7477b JB |
4641 | btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) { |
4642 | BTRFS_I(inode)->index_cnt = 2; | |
4643 | goto out; | |
4644 | } | |
4645 | ||
4646 | BTRFS_I(inode)->index_cnt = found_key.offset + 1; | |
4647 | out: | |
4648 | btrfs_free_path(path); | |
4649 | return ret; | |
4650 | } | |
4651 | ||
d352ac68 CM |
4652 | /* |
4653 | * helper to find a free sequence number in a given directory. This current | |
4654 | * code is very simple, later versions will do smarter things in the btree | |
4655 | */ | |
3de4586c | 4656 | int btrfs_set_inode_index(struct inode *dir, u64 *index) |
aec7477b JB |
4657 | { |
4658 | int ret = 0; | |
4659 | ||
4660 | if (BTRFS_I(dir)->index_cnt == (u64)-1) { | |
16cdcec7 MX |
4661 | ret = btrfs_inode_delayed_dir_index_count(dir); |
4662 | if (ret) { | |
4663 | ret = btrfs_set_inode_index_count(dir); | |
4664 | if (ret) | |
4665 | return ret; | |
4666 | } | |
aec7477b JB |
4667 | } |
4668 | ||
00e4e6b3 | 4669 | *index = BTRFS_I(dir)->index_cnt; |
aec7477b JB |
4670 | BTRFS_I(dir)->index_cnt++; |
4671 | ||
4672 | return ret; | |
4673 | } | |
4674 | ||
39279cc3 CM |
4675 | static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans, |
4676 | struct btrfs_root *root, | |
aec7477b | 4677 | struct inode *dir, |
9c58309d | 4678 | const char *name, int name_len, |
175a4eb7 AV |
4679 | u64 ref_objectid, u64 objectid, |
4680 | umode_t mode, u64 *index) | |
39279cc3 CM |
4681 | { |
4682 | struct inode *inode; | |
5f39d397 | 4683 | struct btrfs_inode_item *inode_item; |
39279cc3 | 4684 | struct btrfs_key *location; |
5f39d397 | 4685 | struct btrfs_path *path; |
9c58309d CM |
4686 | struct btrfs_inode_ref *ref; |
4687 | struct btrfs_key key[2]; | |
4688 | u32 sizes[2]; | |
4689 | unsigned long ptr; | |
39279cc3 CM |
4690 | int ret; |
4691 | int owner; | |
4692 | ||
5f39d397 | 4693 | path = btrfs_alloc_path(); |
d8926bb3 MF |
4694 | if (!path) |
4695 | return ERR_PTR(-ENOMEM); | |
5f39d397 | 4696 | |
39279cc3 | 4697 | inode = new_inode(root->fs_info->sb); |
8fb27640 YS |
4698 | if (!inode) { |
4699 | btrfs_free_path(path); | |
39279cc3 | 4700 | return ERR_PTR(-ENOMEM); |
8fb27640 | 4701 | } |
39279cc3 | 4702 | |
581bb050 LZ |
4703 | /* |
4704 | * we have to initialize this early, so we can reclaim the inode | |
4705 | * number if we fail afterwards in this function. | |
4706 | */ | |
4707 | inode->i_ino = objectid; | |
4708 | ||
aec7477b | 4709 | if (dir) { |
1abe9b8a | 4710 | trace_btrfs_inode_request(dir); |
4711 | ||
3de4586c | 4712 | ret = btrfs_set_inode_index(dir, index); |
09771430 | 4713 | if (ret) { |
8fb27640 | 4714 | btrfs_free_path(path); |
09771430 | 4715 | iput(inode); |
aec7477b | 4716 | return ERR_PTR(ret); |
09771430 | 4717 | } |
aec7477b JB |
4718 | } |
4719 | /* | |
4720 | * index_cnt is ignored for everything but a dir, | |
4721 | * btrfs_get_inode_index_count has an explanation for the magic | |
4722 | * number | |
4723 | */ | |
4724 | BTRFS_I(inode)->index_cnt = 2; | |
39279cc3 | 4725 | BTRFS_I(inode)->root = root; |
e02119d5 | 4726 | BTRFS_I(inode)->generation = trans->transid; |
76195853 | 4727 | inode->i_generation = BTRFS_I(inode)->generation; |
b888db2b | 4728 | |
5dc562c5 JB |
4729 | /* |
4730 | * We could have gotten an inode number from somebody who was fsynced | |
4731 | * and then removed in this same transaction, so let's just set full | |
4732 | * sync since it will be a full sync anyway and this will blow away the | |
4733 | * old info in the log. | |
4734 | */ | |
4735 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags); | |
4736 | ||
569254b0 | 4737 | if (S_ISDIR(mode)) |
39279cc3 CM |
4738 | owner = 0; |
4739 | else | |
4740 | owner = 1; | |
9c58309d CM |
4741 | |
4742 | key[0].objectid = objectid; | |
4743 | btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY); | |
4744 | key[0].offset = 0; | |
4745 | ||
4746 | key[1].objectid = objectid; | |
4747 | btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY); | |
4748 | key[1].offset = ref_objectid; | |
4749 | ||
4750 | sizes[0] = sizeof(struct btrfs_inode_item); | |
4751 | sizes[1] = name_len + sizeof(*ref); | |
4752 | ||
b9473439 | 4753 | path->leave_spinning = 1; |
9c58309d CM |
4754 | ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2); |
4755 | if (ret != 0) | |
5f39d397 CM |
4756 | goto fail; |
4757 | ||
ecc11fab | 4758 | inode_init_owner(inode, dir, mode); |
a76a3cd4 | 4759 | inode_set_bytes(inode, 0); |
39279cc3 | 4760 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; |
5f39d397 CM |
4761 | inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
4762 | struct btrfs_inode_item); | |
293f7e07 LZ |
4763 | memset_extent_buffer(path->nodes[0], 0, (unsigned long)inode_item, |
4764 | sizeof(*inode_item)); | |
e02119d5 | 4765 | fill_inode_item(trans, path->nodes[0], inode_item, inode); |
9c58309d CM |
4766 | |
4767 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1, | |
4768 | struct btrfs_inode_ref); | |
4769 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len); | |
00e4e6b3 | 4770 | btrfs_set_inode_ref_index(path->nodes[0], ref, *index); |
9c58309d CM |
4771 | ptr = (unsigned long)(ref + 1); |
4772 | write_extent_buffer(path->nodes[0], name, ptr, name_len); | |
4773 | ||
5f39d397 CM |
4774 | btrfs_mark_buffer_dirty(path->nodes[0]); |
4775 | btrfs_free_path(path); | |
4776 | ||
39279cc3 CM |
4777 | location = &BTRFS_I(inode)->location; |
4778 | location->objectid = objectid; | |
39279cc3 CM |
4779 | location->offset = 0; |
4780 | btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY); | |
4781 | ||
6cbff00f CH |
4782 | btrfs_inherit_iflags(inode, dir); |
4783 | ||
569254b0 | 4784 | if (S_ISREG(mode)) { |
94272164 CM |
4785 | if (btrfs_test_opt(root, NODATASUM)) |
4786 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM; | |
75e7cb7f LB |
4787 | if (btrfs_test_opt(root, NODATACOW) || |
4788 | (BTRFS_I(dir)->flags & BTRFS_INODE_NODATACOW)) | |
94272164 CM |
4789 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW; |
4790 | } | |
4791 | ||
39279cc3 | 4792 | insert_inode_hash(inode); |
5d4f98a2 | 4793 | inode_tree_add(inode); |
1abe9b8a | 4794 | |
4795 | trace_btrfs_inode_new(inode); | |
1973f0fa | 4796 | btrfs_set_inode_last_trans(trans, inode); |
1abe9b8a | 4797 | |
8ea05e3a AB |
4798 | btrfs_update_root_times(trans, root); |
4799 | ||
39279cc3 | 4800 | return inode; |
5f39d397 | 4801 | fail: |
aec7477b JB |
4802 | if (dir) |
4803 | BTRFS_I(dir)->index_cnt--; | |
5f39d397 | 4804 | btrfs_free_path(path); |
09771430 | 4805 | iput(inode); |
5f39d397 | 4806 | return ERR_PTR(ret); |
39279cc3 CM |
4807 | } |
4808 | ||
4809 | static inline u8 btrfs_inode_type(struct inode *inode) | |
4810 | { | |
4811 | return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT]; | |
4812 | } | |
4813 | ||
d352ac68 CM |
4814 | /* |
4815 | * utility function to add 'inode' into 'parent_inode' with | |
4816 | * a give name and a given sequence number. | |
4817 | * if 'add_backref' is true, also insert a backref from the | |
4818 | * inode to the parent directory. | |
4819 | */ | |
e02119d5 CM |
4820 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
4821 | struct inode *parent_inode, struct inode *inode, | |
4822 | const char *name, int name_len, int add_backref, u64 index) | |
39279cc3 | 4823 | { |
4df27c4d | 4824 | int ret = 0; |
39279cc3 | 4825 | struct btrfs_key key; |
e02119d5 | 4826 | struct btrfs_root *root = BTRFS_I(parent_inode)->root; |
33345d01 LZ |
4827 | u64 ino = btrfs_ino(inode); |
4828 | u64 parent_ino = btrfs_ino(parent_inode); | |
5f39d397 | 4829 | |
33345d01 | 4830 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
4831 | memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key)); |
4832 | } else { | |
33345d01 | 4833 | key.objectid = ino; |
4df27c4d YZ |
4834 | btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY); |
4835 | key.offset = 0; | |
4836 | } | |
4837 | ||
33345d01 | 4838 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
4839 | ret = btrfs_add_root_ref(trans, root->fs_info->tree_root, |
4840 | key.objectid, root->root_key.objectid, | |
33345d01 | 4841 | parent_ino, index, name, name_len); |
4df27c4d | 4842 | } else if (add_backref) { |
33345d01 LZ |
4843 | ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino, |
4844 | parent_ino, index); | |
4df27c4d | 4845 | } |
39279cc3 | 4846 | |
79787eaa JM |
4847 | /* Nothing to clean up yet */ |
4848 | if (ret) | |
4849 | return ret; | |
4df27c4d | 4850 | |
79787eaa JM |
4851 | ret = btrfs_insert_dir_item(trans, root, name, name_len, |
4852 | parent_inode, &key, | |
4853 | btrfs_inode_type(inode), index); | |
4854 | if (ret == -EEXIST) | |
4855 | goto fail_dir_item; | |
4856 | else if (ret) { | |
4857 | btrfs_abort_transaction(trans, root, ret); | |
4858 | return ret; | |
39279cc3 | 4859 | } |
79787eaa JM |
4860 | |
4861 | btrfs_i_size_write(parent_inode, parent_inode->i_size + | |
4862 | name_len * 2); | |
0c4d2d95 | 4863 | inode_inc_iversion(parent_inode); |
79787eaa JM |
4864 | parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME; |
4865 | ret = btrfs_update_inode(trans, root, parent_inode); | |
4866 | if (ret) | |
4867 | btrfs_abort_transaction(trans, root, ret); | |
39279cc3 | 4868 | return ret; |
fe66a05a CM |
4869 | |
4870 | fail_dir_item: | |
4871 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { | |
4872 | u64 local_index; | |
4873 | int err; | |
4874 | err = btrfs_del_root_ref(trans, root->fs_info->tree_root, | |
4875 | key.objectid, root->root_key.objectid, | |
4876 | parent_ino, &local_index, name, name_len); | |
4877 | ||
4878 | } else if (add_backref) { | |
4879 | u64 local_index; | |
4880 | int err; | |
4881 | ||
4882 | err = btrfs_del_inode_ref(trans, root, name, name_len, | |
4883 | ino, parent_ino, &local_index); | |
4884 | } | |
4885 | return ret; | |
39279cc3 CM |
4886 | } |
4887 | ||
4888 | static int btrfs_add_nondir(struct btrfs_trans_handle *trans, | |
a1b075d2 JB |
4889 | struct inode *dir, struct dentry *dentry, |
4890 | struct inode *inode, int backref, u64 index) | |
39279cc3 | 4891 | { |
a1b075d2 JB |
4892 | int err = btrfs_add_link(trans, dir, inode, |
4893 | dentry->d_name.name, dentry->d_name.len, | |
4894 | backref, index); | |
39279cc3 CM |
4895 | if (err > 0) |
4896 | err = -EEXIST; | |
4897 | return err; | |
4898 | } | |
4899 | ||
618e21d5 | 4900 | static int btrfs_mknod(struct inode *dir, struct dentry *dentry, |
1a67aafb | 4901 | umode_t mode, dev_t rdev) |
618e21d5 JB |
4902 | { |
4903 | struct btrfs_trans_handle *trans; | |
4904 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4905 | struct inode *inode = NULL; |
618e21d5 JB |
4906 | int err; |
4907 | int drop_inode = 0; | |
4908 | u64 objectid; | |
1832a6d5 | 4909 | unsigned long nr = 0; |
00e4e6b3 | 4910 | u64 index = 0; |
618e21d5 JB |
4911 | |
4912 | if (!new_valid_dev(rdev)) | |
4913 | return -EINVAL; | |
4914 | ||
9ed74f2d JB |
4915 | /* |
4916 | * 2 for inode item and ref | |
4917 | * 2 for dir items | |
4918 | * 1 for xattr if selinux is on | |
4919 | */ | |
a22285a6 YZ |
4920 | trans = btrfs_start_transaction(root, 5); |
4921 | if (IS_ERR(trans)) | |
4922 | return PTR_ERR(trans); | |
1832a6d5 | 4923 | |
581bb050 LZ |
4924 | err = btrfs_find_free_ino(root, &objectid); |
4925 | if (err) | |
4926 | goto out_unlock; | |
4927 | ||
aec7477b | 4928 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 4929 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 4930 | mode, &index); |
7cf96da3 TI |
4931 | if (IS_ERR(inode)) { |
4932 | err = PTR_ERR(inode); | |
618e21d5 | 4933 | goto out_unlock; |
7cf96da3 | 4934 | } |
618e21d5 | 4935 | |
2a7dba39 | 4936 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
4937 | if (err) { |
4938 | drop_inode = 1; | |
4939 | goto out_unlock; | |
4940 | } | |
4941 | ||
ad19db71 CS |
4942 | /* |
4943 | * If the active LSM wants to access the inode during | |
4944 | * d_instantiate it needs these. Smack checks to see | |
4945 | * if the filesystem supports xattrs by looking at the | |
4946 | * ops vector. | |
4947 | */ | |
4948 | ||
4949 | inode->i_op = &btrfs_special_inode_operations; | |
a1b075d2 | 4950 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
618e21d5 JB |
4951 | if (err) |
4952 | drop_inode = 1; | |
4953 | else { | |
618e21d5 | 4954 | init_special_inode(inode, inode->i_mode, rdev); |
1b4ab1bb | 4955 | btrfs_update_inode(trans, root, inode); |
08c422c2 | 4956 | d_instantiate(dentry, inode); |
618e21d5 | 4957 | } |
618e21d5 | 4958 | out_unlock: |
d3c2fdcf | 4959 | nr = trans->blocks_used; |
7ad85bb7 | 4960 | btrfs_end_transaction(trans, root); |
a22285a6 | 4961 | btrfs_btree_balance_dirty(root, nr); |
618e21d5 JB |
4962 | if (drop_inode) { |
4963 | inode_dec_link_count(inode); | |
4964 | iput(inode); | |
4965 | } | |
618e21d5 JB |
4966 | return err; |
4967 | } | |
4968 | ||
39279cc3 | 4969 | static int btrfs_create(struct inode *dir, struct dentry *dentry, |
ebfc3b49 | 4970 | umode_t mode, bool excl) |
39279cc3 CM |
4971 | { |
4972 | struct btrfs_trans_handle *trans; | |
4973 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4974 | struct inode *inode = NULL; |
39279cc3 | 4975 | int drop_inode = 0; |
a22285a6 | 4976 | int err; |
1832a6d5 | 4977 | unsigned long nr = 0; |
39279cc3 | 4978 | u64 objectid; |
00e4e6b3 | 4979 | u64 index = 0; |
39279cc3 | 4980 | |
9ed74f2d JB |
4981 | /* |
4982 | * 2 for inode item and ref | |
4983 | * 2 for dir items | |
4984 | * 1 for xattr if selinux is on | |
4985 | */ | |
a22285a6 YZ |
4986 | trans = btrfs_start_transaction(root, 5); |
4987 | if (IS_ERR(trans)) | |
4988 | return PTR_ERR(trans); | |
9ed74f2d | 4989 | |
581bb050 LZ |
4990 | err = btrfs_find_free_ino(root, &objectid); |
4991 | if (err) | |
4992 | goto out_unlock; | |
4993 | ||
aec7477b | 4994 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 4995 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 4996 | mode, &index); |
7cf96da3 TI |
4997 | if (IS_ERR(inode)) { |
4998 | err = PTR_ERR(inode); | |
39279cc3 | 4999 | goto out_unlock; |
7cf96da3 | 5000 | } |
39279cc3 | 5001 | |
2a7dba39 | 5002 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
5003 | if (err) { |
5004 | drop_inode = 1; | |
5005 | goto out_unlock; | |
5006 | } | |
5007 | ||
ad19db71 CS |
5008 | /* |
5009 | * If the active LSM wants to access the inode during | |
5010 | * d_instantiate it needs these. Smack checks to see | |
5011 | * if the filesystem supports xattrs by looking at the | |
5012 | * ops vector. | |
5013 | */ | |
5014 | inode->i_fop = &btrfs_file_operations; | |
5015 | inode->i_op = &btrfs_file_inode_operations; | |
5016 | ||
a1b075d2 | 5017 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
39279cc3 CM |
5018 | if (err) |
5019 | drop_inode = 1; | |
5020 | else { | |
5021 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 5022 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d1310b2e | 5023 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
08c422c2 | 5024 | d_instantiate(dentry, inode); |
39279cc3 | 5025 | } |
39279cc3 | 5026 | out_unlock: |
d3c2fdcf | 5027 | nr = trans->blocks_used; |
7ad85bb7 | 5028 | btrfs_end_transaction(trans, root); |
39279cc3 CM |
5029 | if (drop_inode) { |
5030 | inode_dec_link_count(inode); | |
5031 | iput(inode); | |
5032 | } | |
d3c2fdcf | 5033 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
5034 | return err; |
5035 | } | |
5036 | ||
5037 | static int btrfs_link(struct dentry *old_dentry, struct inode *dir, | |
5038 | struct dentry *dentry) | |
5039 | { | |
5040 | struct btrfs_trans_handle *trans; | |
5041 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
5042 | struct inode *inode = old_dentry->d_inode; | |
00e4e6b3 | 5043 | u64 index; |
1832a6d5 | 5044 | unsigned long nr = 0; |
39279cc3 CM |
5045 | int err; |
5046 | int drop_inode = 0; | |
5047 | ||
4a8be425 TH |
5048 | /* do not allow sys_link's with other subvols of the same device */ |
5049 | if (root->objectid != BTRFS_I(inode)->root->objectid) | |
3ab3564f | 5050 | return -EXDEV; |
4a8be425 | 5051 | |
c055e99e AV |
5052 | if (inode->i_nlink == ~0U) |
5053 | return -EMLINK; | |
4a8be425 | 5054 | |
3de4586c | 5055 | err = btrfs_set_inode_index(dir, &index); |
aec7477b JB |
5056 | if (err) |
5057 | goto fail; | |
5058 | ||
a22285a6 | 5059 | /* |
7e6b6465 | 5060 | * 2 items for inode and inode ref |
a22285a6 | 5061 | * 2 items for dir items |
7e6b6465 | 5062 | * 1 item for parent inode |
a22285a6 | 5063 | */ |
7e6b6465 | 5064 | trans = btrfs_start_transaction(root, 5); |
a22285a6 YZ |
5065 | if (IS_ERR(trans)) { |
5066 | err = PTR_ERR(trans); | |
5067 | goto fail; | |
5068 | } | |
5f39d397 | 5069 | |
3153495d | 5070 | btrfs_inc_nlink(inode); |
0c4d2d95 | 5071 | inode_inc_iversion(inode); |
3153495d | 5072 | inode->i_ctime = CURRENT_TIME; |
7de9c6ee | 5073 | ihold(inode); |
aec7477b | 5074 | |
a1b075d2 | 5075 | err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index); |
5f39d397 | 5076 | |
a5719521 | 5077 | if (err) { |
54aa1f4d | 5078 | drop_inode = 1; |
a5719521 | 5079 | } else { |
10d9f309 | 5080 | struct dentry *parent = dentry->d_parent; |
a5719521 | 5081 | err = btrfs_update_inode(trans, root, inode); |
79787eaa JM |
5082 | if (err) |
5083 | goto fail; | |
08c422c2 | 5084 | d_instantiate(dentry, inode); |
6a912213 | 5085 | btrfs_log_new_name(trans, inode, NULL, parent); |
a5719521 | 5086 | } |
39279cc3 | 5087 | |
d3c2fdcf | 5088 | nr = trans->blocks_used; |
7ad85bb7 | 5089 | btrfs_end_transaction(trans, root); |
1832a6d5 | 5090 | fail: |
39279cc3 CM |
5091 | if (drop_inode) { |
5092 | inode_dec_link_count(inode); | |
5093 | iput(inode); | |
5094 | } | |
d3c2fdcf | 5095 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
5096 | return err; |
5097 | } | |
5098 | ||
18bb1db3 | 5099 | static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode) |
39279cc3 | 5100 | { |
b9d86667 | 5101 | struct inode *inode = NULL; |
39279cc3 CM |
5102 | struct btrfs_trans_handle *trans; |
5103 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
5104 | int err = 0; | |
5105 | int drop_on_err = 0; | |
b9d86667 | 5106 | u64 objectid = 0; |
00e4e6b3 | 5107 | u64 index = 0; |
d3c2fdcf | 5108 | unsigned long nr = 1; |
39279cc3 | 5109 | |
9ed74f2d JB |
5110 | /* |
5111 | * 2 items for inode and ref | |
5112 | * 2 items for dir items | |
5113 | * 1 for xattr if selinux is on | |
5114 | */ | |
a22285a6 YZ |
5115 | trans = btrfs_start_transaction(root, 5); |
5116 | if (IS_ERR(trans)) | |
5117 | return PTR_ERR(trans); | |
39279cc3 | 5118 | |
581bb050 LZ |
5119 | err = btrfs_find_free_ino(root, &objectid); |
5120 | if (err) | |
5121 | goto out_fail; | |
5122 | ||
aec7477b | 5123 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 5124 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 5125 | S_IFDIR | mode, &index); |
39279cc3 CM |
5126 | if (IS_ERR(inode)) { |
5127 | err = PTR_ERR(inode); | |
5128 | goto out_fail; | |
5129 | } | |
5f39d397 | 5130 | |
39279cc3 | 5131 | drop_on_err = 1; |
33268eaf | 5132 | |
2a7dba39 | 5133 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
5134 | if (err) |
5135 | goto out_fail; | |
5136 | ||
39279cc3 CM |
5137 | inode->i_op = &btrfs_dir_inode_operations; |
5138 | inode->i_fop = &btrfs_dir_file_operations; | |
39279cc3 | 5139 | |
dbe674a9 | 5140 | btrfs_i_size_write(inode, 0); |
39279cc3 CM |
5141 | err = btrfs_update_inode(trans, root, inode); |
5142 | if (err) | |
5143 | goto out_fail; | |
5f39d397 | 5144 | |
a1b075d2 JB |
5145 | err = btrfs_add_link(trans, dir, inode, dentry->d_name.name, |
5146 | dentry->d_name.len, 0, index); | |
39279cc3 CM |
5147 | if (err) |
5148 | goto out_fail; | |
5f39d397 | 5149 | |
39279cc3 CM |
5150 | d_instantiate(dentry, inode); |
5151 | drop_on_err = 0; | |
39279cc3 CM |
5152 | |
5153 | out_fail: | |
d3c2fdcf | 5154 | nr = trans->blocks_used; |
7ad85bb7 | 5155 | btrfs_end_transaction(trans, root); |
39279cc3 CM |
5156 | if (drop_on_err) |
5157 | iput(inode); | |
d3c2fdcf | 5158 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
5159 | return err; |
5160 | } | |
5161 | ||
d352ac68 CM |
5162 | /* helper for btfs_get_extent. Given an existing extent in the tree, |
5163 | * and an extent that you want to insert, deal with overlap and insert | |
5164 | * the new extent into the tree. | |
5165 | */ | |
3b951516 CM |
5166 | static int merge_extent_mapping(struct extent_map_tree *em_tree, |
5167 | struct extent_map *existing, | |
e6dcd2dc CM |
5168 | struct extent_map *em, |
5169 | u64 map_start, u64 map_len) | |
3b951516 CM |
5170 | { |
5171 | u64 start_diff; | |
3b951516 | 5172 | |
e6dcd2dc CM |
5173 | BUG_ON(map_start < em->start || map_start >= extent_map_end(em)); |
5174 | start_diff = map_start - em->start; | |
5175 | em->start = map_start; | |
5176 | em->len = map_len; | |
c8b97818 CM |
5177 | if (em->block_start < EXTENT_MAP_LAST_BYTE && |
5178 | !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
e6dcd2dc | 5179 | em->block_start += start_diff; |
c8b97818 CM |
5180 | em->block_len -= start_diff; |
5181 | } | |
e6dcd2dc | 5182 | return add_extent_mapping(em_tree, em); |
3b951516 CM |
5183 | } |
5184 | ||
c8b97818 CM |
5185 | static noinline int uncompress_inline(struct btrfs_path *path, |
5186 | struct inode *inode, struct page *page, | |
5187 | size_t pg_offset, u64 extent_offset, | |
5188 | struct btrfs_file_extent_item *item) | |
5189 | { | |
5190 | int ret; | |
5191 | struct extent_buffer *leaf = path->nodes[0]; | |
5192 | char *tmp; | |
5193 | size_t max_size; | |
5194 | unsigned long inline_size; | |
5195 | unsigned long ptr; | |
261507a0 | 5196 | int compress_type; |
c8b97818 CM |
5197 | |
5198 | WARN_ON(pg_offset != 0); | |
261507a0 | 5199 | compress_type = btrfs_file_extent_compression(leaf, item); |
c8b97818 CM |
5200 | max_size = btrfs_file_extent_ram_bytes(leaf, item); |
5201 | inline_size = btrfs_file_extent_inline_item_len(leaf, | |
5202 | btrfs_item_nr(leaf, path->slots[0])); | |
5203 | tmp = kmalloc(inline_size, GFP_NOFS); | |
8d413713 TI |
5204 | if (!tmp) |
5205 | return -ENOMEM; | |
c8b97818 CM |
5206 | ptr = btrfs_file_extent_inline_start(item); |
5207 | ||
5208 | read_extent_buffer(leaf, tmp, ptr, inline_size); | |
5209 | ||
5b050f04 | 5210 | max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size); |
261507a0 LZ |
5211 | ret = btrfs_decompress(compress_type, tmp, page, |
5212 | extent_offset, inline_size, max_size); | |
c8b97818 | 5213 | if (ret) { |
7ac687d9 | 5214 | char *kaddr = kmap_atomic(page); |
c8b97818 CM |
5215 | unsigned long copy_size = min_t(u64, |
5216 | PAGE_CACHE_SIZE - pg_offset, | |
5217 | max_size - extent_offset); | |
5218 | memset(kaddr + pg_offset, 0, copy_size); | |
7ac687d9 | 5219 | kunmap_atomic(kaddr); |
c8b97818 CM |
5220 | } |
5221 | kfree(tmp); | |
5222 | return 0; | |
5223 | } | |
5224 | ||
d352ac68 CM |
5225 | /* |
5226 | * a bit scary, this does extent mapping from logical file offset to the disk. | |
d397712b CM |
5227 | * the ugly parts come from merging extents from the disk with the in-ram |
5228 | * representation. This gets more complex because of the data=ordered code, | |
d352ac68 CM |
5229 | * where the in-ram extents might be locked pending data=ordered completion. |
5230 | * | |
5231 | * This also copies inline extents directly into the page. | |
5232 | */ | |
d397712b | 5233 | |
a52d9a80 | 5234 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, |
70dec807 | 5235 | size_t pg_offset, u64 start, u64 len, |
a52d9a80 CM |
5236 | int create) |
5237 | { | |
5238 | int ret; | |
5239 | int err = 0; | |
db94535d | 5240 | u64 bytenr; |
a52d9a80 CM |
5241 | u64 extent_start = 0; |
5242 | u64 extent_end = 0; | |
33345d01 | 5243 | u64 objectid = btrfs_ino(inode); |
a52d9a80 | 5244 | u32 found_type; |
f421950f | 5245 | struct btrfs_path *path = NULL; |
a52d9a80 CM |
5246 | struct btrfs_root *root = BTRFS_I(inode)->root; |
5247 | struct btrfs_file_extent_item *item; | |
5f39d397 CM |
5248 | struct extent_buffer *leaf; |
5249 | struct btrfs_key found_key; | |
a52d9a80 CM |
5250 | struct extent_map *em = NULL; |
5251 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
d1310b2e | 5252 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
a52d9a80 | 5253 | struct btrfs_trans_handle *trans = NULL; |
261507a0 | 5254 | int compress_type; |
a52d9a80 | 5255 | |
a52d9a80 | 5256 | again: |
890871be | 5257 | read_lock(&em_tree->lock); |
d1310b2e | 5258 | em = lookup_extent_mapping(em_tree, start, len); |
a061fc8d CM |
5259 | if (em) |
5260 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
890871be | 5261 | read_unlock(&em_tree->lock); |
d1310b2e | 5262 | |
a52d9a80 | 5263 | if (em) { |
e1c4b745 CM |
5264 | if (em->start > start || em->start + em->len <= start) |
5265 | free_extent_map(em); | |
5266 | else if (em->block_start == EXTENT_MAP_INLINE && page) | |
70dec807 CM |
5267 | free_extent_map(em); |
5268 | else | |
5269 | goto out; | |
a52d9a80 | 5270 | } |
172ddd60 | 5271 | em = alloc_extent_map(); |
a52d9a80 | 5272 | if (!em) { |
d1310b2e CM |
5273 | err = -ENOMEM; |
5274 | goto out; | |
a52d9a80 | 5275 | } |
e6dcd2dc | 5276 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
d1310b2e | 5277 | em->start = EXTENT_MAP_HOLE; |
445a6944 | 5278 | em->orig_start = EXTENT_MAP_HOLE; |
d1310b2e | 5279 | em->len = (u64)-1; |
c8b97818 | 5280 | em->block_len = (u64)-1; |
f421950f CM |
5281 | |
5282 | if (!path) { | |
5283 | path = btrfs_alloc_path(); | |
026fd317 JB |
5284 | if (!path) { |
5285 | err = -ENOMEM; | |
5286 | goto out; | |
5287 | } | |
5288 | /* | |
5289 | * Chances are we'll be called again, so go ahead and do | |
5290 | * readahead | |
5291 | */ | |
5292 | path->reada = 1; | |
f421950f CM |
5293 | } |
5294 | ||
179e29e4 CM |
5295 | ret = btrfs_lookup_file_extent(trans, root, path, |
5296 | objectid, start, trans != NULL); | |
a52d9a80 CM |
5297 | if (ret < 0) { |
5298 | err = ret; | |
5299 | goto out; | |
5300 | } | |
5301 | ||
5302 | if (ret != 0) { | |
5303 | if (path->slots[0] == 0) | |
5304 | goto not_found; | |
5305 | path->slots[0]--; | |
5306 | } | |
5307 | ||
5f39d397 CM |
5308 | leaf = path->nodes[0]; |
5309 | item = btrfs_item_ptr(leaf, path->slots[0], | |
a52d9a80 | 5310 | struct btrfs_file_extent_item); |
a52d9a80 | 5311 | /* are we inside the extent that was found? */ |
5f39d397 CM |
5312 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
5313 | found_type = btrfs_key_type(&found_key); | |
5314 | if (found_key.objectid != objectid || | |
a52d9a80 CM |
5315 | found_type != BTRFS_EXTENT_DATA_KEY) { |
5316 | goto not_found; | |
5317 | } | |
5318 | ||
5f39d397 CM |
5319 | found_type = btrfs_file_extent_type(leaf, item); |
5320 | extent_start = found_key.offset; | |
261507a0 | 5321 | compress_type = btrfs_file_extent_compression(leaf, item); |
d899e052 YZ |
5322 | if (found_type == BTRFS_FILE_EXTENT_REG || |
5323 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
a52d9a80 | 5324 | extent_end = extent_start + |
db94535d | 5325 | btrfs_file_extent_num_bytes(leaf, item); |
9036c102 YZ |
5326 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { |
5327 | size_t size; | |
5328 | size = btrfs_file_extent_inline_len(leaf, item); | |
5329 | extent_end = (extent_start + size + root->sectorsize - 1) & | |
5330 | ~((u64)root->sectorsize - 1); | |
5331 | } | |
5332 | ||
5333 | if (start >= extent_end) { | |
5334 | path->slots[0]++; | |
5335 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
5336 | ret = btrfs_next_leaf(root, path); | |
5337 | if (ret < 0) { | |
5338 | err = ret; | |
5339 | goto out; | |
a52d9a80 | 5340 | } |
9036c102 YZ |
5341 | if (ret > 0) |
5342 | goto not_found; | |
5343 | leaf = path->nodes[0]; | |
a52d9a80 | 5344 | } |
9036c102 YZ |
5345 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
5346 | if (found_key.objectid != objectid || | |
5347 | found_key.type != BTRFS_EXTENT_DATA_KEY) | |
5348 | goto not_found; | |
5349 | if (start + len <= found_key.offset) | |
5350 | goto not_found; | |
5351 | em->start = start; | |
5352 | em->len = found_key.offset - start; | |
5353 | goto not_found_em; | |
5354 | } | |
5355 | ||
d899e052 YZ |
5356 | if (found_type == BTRFS_FILE_EXTENT_REG || |
5357 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
9036c102 YZ |
5358 | em->start = extent_start; |
5359 | em->len = extent_end - extent_start; | |
ff5b7ee3 YZ |
5360 | em->orig_start = extent_start - |
5361 | btrfs_file_extent_offset(leaf, item); | |
db94535d CM |
5362 | bytenr = btrfs_file_extent_disk_bytenr(leaf, item); |
5363 | if (bytenr == 0) { | |
5f39d397 | 5364 | em->block_start = EXTENT_MAP_HOLE; |
a52d9a80 CM |
5365 | goto insert; |
5366 | } | |
261507a0 | 5367 | if (compress_type != BTRFS_COMPRESS_NONE) { |
c8b97818 | 5368 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
261507a0 | 5369 | em->compress_type = compress_type; |
c8b97818 CM |
5370 | em->block_start = bytenr; |
5371 | em->block_len = btrfs_file_extent_disk_num_bytes(leaf, | |
5372 | item); | |
5373 | } else { | |
5374 | bytenr += btrfs_file_extent_offset(leaf, item); | |
5375 | em->block_start = bytenr; | |
5376 | em->block_len = em->len; | |
d899e052 YZ |
5377 | if (found_type == BTRFS_FILE_EXTENT_PREALLOC) |
5378 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); | |
c8b97818 | 5379 | } |
a52d9a80 CM |
5380 | goto insert; |
5381 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
5f39d397 | 5382 | unsigned long ptr; |
a52d9a80 | 5383 | char *map; |
3326d1b0 CM |
5384 | size_t size; |
5385 | size_t extent_offset; | |
5386 | size_t copy_size; | |
a52d9a80 | 5387 | |
689f9346 | 5388 | em->block_start = EXTENT_MAP_INLINE; |
c8b97818 | 5389 | if (!page || create) { |
689f9346 | 5390 | em->start = extent_start; |
9036c102 | 5391 | em->len = extent_end - extent_start; |
689f9346 Y |
5392 | goto out; |
5393 | } | |
5f39d397 | 5394 | |
9036c102 YZ |
5395 | size = btrfs_file_extent_inline_len(leaf, item); |
5396 | extent_offset = page_offset(page) + pg_offset - extent_start; | |
70dec807 | 5397 | copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset, |
3326d1b0 | 5398 | size - extent_offset); |
3326d1b0 | 5399 | em->start = extent_start + extent_offset; |
70dec807 CM |
5400 | em->len = (copy_size + root->sectorsize - 1) & |
5401 | ~((u64)root->sectorsize - 1); | |
ff5b7ee3 | 5402 | em->orig_start = EXTENT_MAP_INLINE; |
261507a0 | 5403 | if (compress_type) { |
c8b97818 | 5404 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
261507a0 LZ |
5405 | em->compress_type = compress_type; |
5406 | } | |
689f9346 | 5407 | ptr = btrfs_file_extent_inline_start(item) + extent_offset; |
179e29e4 | 5408 | if (create == 0 && !PageUptodate(page)) { |
261507a0 LZ |
5409 | if (btrfs_file_extent_compression(leaf, item) != |
5410 | BTRFS_COMPRESS_NONE) { | |
c8b97818 CM |
5411 | ret = uncompress_inline(path, inode, page, |
5412 | pg_offset, | |
5413 | extent_offset, item); | |
79787eaa | 5414 | BUG_ON(ret); /* -ENOMEM */ |
c8b97818 CM |
5415 | } else { |
5416 | map = kmap(page); | |
5417 | read_extent_buffer(leaf, map + pg_offset, ptr, | |
5418 | copy_size); | |
93c82d57 CM |
5419 | if (pg_offset + copy_size < PAGE_CACHE_SIZE) { |
5420 | memset(map + pg_offset + copy_size, 0, | |
5421 | PAGE_CACHE_SIZE - pg_offset - | |
5422 | copy_size); | |
5423 | } | |
c8b97818 CM |
5424 | kunmap(page); |
5425 | } | |
179e29e4 CM |
5426 | flush_dcache_page(page); |
5427 | } else if (create && PageUptodate(page)) { | |
6bf7e080 | 5428 | BUG(); |
179e29e4 CM |
5429 | if (!trans) { |
5430 | kunmap(page); | |
5431 | free_extent_map(em); | |
5432 | em = NULL; | |
ff5714cc | 5433 | |
b3b4aa74 | 5434 | btrfs_release_path(path); |
7a7eaa40 | 5435 | trans = btrfs_join_transaction(root); |
ff5714cc | 5436 | |
3612b495 TI |
5437 | if (IS_ERR(trans)) |
5438 | return ERR_CAST(trans); | |
179e29e4 CM |
5439 | goto again; |
5440 | } | |
c8b97818 | 5441 | map = kmap(page); |
70dec807 | 5442 | write_extent_buffer(leaf, map + pg_offset, ptr, |
179e29e4 | 5443 | copy_size); |
c8b97818 | 5444 | kunmap(page); |
179e29e4 | 5445 | btrfs_mark_buffer_dirty(leaf); |
a52d9a80 | 5446 | } |
d1310b2e | 5447 | set_extent_uptodate(io_tree, em->start, |
507903b8 | 5448 | extent_map_end(em) - 1, NULL, GFP_NOFS); |
a52d9a80 CM |
5449 | goto insert; |
5450 | } else { | |
d397712b | 5451 | printk(KERN_ERR "btrfs unknown found_type %d\n", found_type); |
a52d9a80 CM |
5452 | WARN_ON(1); |
5453 | } | |
5454 | not_found: | |
5455 | em->start = start; | |
d1310b2e | 5456 | em->len = len; |
a52d9a80 | 5457 | not_found_em: |
5f39d397 | 5458 | em->block_start = EXTENT_MAP_HOLE; |
9036c102 | 5459 | set_bit(EXTENT_FLAG_VACANCY, &em->flags); |
a52d9a80 | 5460 | insert: |
b3b4aa74 | 5461 | btrfs_release_path(path); |
d1310b2e | 5462 | if (em->start > start || extent_map_end(em) <= start) { |
d397712b CM |
5463 | printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed " |
5464 | "[%llu %llu]\n", (unsigned long long)em->start, | |
5465 | (unsigned long long)em->len, | |
5466 | (unsigned long long)start, | |
5467 | (unsigned long long)len); | |
a52d9a80 CM |
5468 | err = -EIO; |
5469 | goto out; | |
5470 | } | |
d1310b2e CM |
5471 | |
5472 | err = 0; | |
890871be | 5473 | write_lock(&em_tree->lock); |
a52d9a80 | 5474 | ret = add_extent_mapping(em_tree, em); |
3b951516 CM |
5475 | /* it is possible that someone inserted the extent into the tree |
5476 | * while we had the lock dropped. It is also possible that | |
5477 | * an overlapping map exists in the tree | |
5478 | */ | |
a52d9a80 | 5479 | if (ret == -EEXIST) { |
3b951516 | 5480 | struct extent_map *existing; |
e6dcd2dc CM |
5481 | |
5482 | ret = 0; | |
5483 | ||
3b951516 | 5484 | existing = lookup_extent_mapping(em_tree, start, len); |
e1c4b745 CM |
5485 | if (existing && (existing->start > start || |
5486 | existing->start + existing->len <= start)) { | |
5487 | free_extent_map(existing); | |
5488 | existing = NULL; | |
5489 | } | |
3b951516 CM |
5490 | if (!existing) { |
5491 | existing = lookup_extent_mapping(em_tree, em->start, | |
5492 | em->len); | |
5493 | if (existing) { | |
5494 | err = merge_extent_mapping(em_tree, existing, | |
e6dcd2dc CM |
5495 | em, start, |
5496 | root->sectorsize); | |
3b951516 CM |
5497 | free_extent_map(existing); |
5498 | if (err) { | |
5499 | free_extent_map(em); | |
5500 | em = NULL; | |
5501 | } | |
5502 | } else { | |
5503 | err = -EIO; | |
3b951516 CM |
5504 | free_extent_map(em); |
5505 | em = NULL; | |
5506 | } | |
5507 | } else { | |
5508 | free_extent_map(em); | |
5509 | em = existing; | |
e6dcd2dc | 5510 | err = 0; |
a52d9a80 | 5511 | } |
a52d9a80 | 5512 | } |
890871be | 5513 | write_unlock(&em_tree->lock); |
a52d9a80 | 5514 | out: |
1abe9b8a | 5515 | |
5516 | trace_btrfs_get_extent(root, em); | |
5517 | ||
f421950f CM |
5518 | if (path) |
5519 | btrfs_free_path(path); | |
a52d9a80 CM |
5520 | if (trans) { |
5521 | ret = btrfs_end_transaction(trans, root); | |
d397712b | 5522 | if (!err) |
a52d9a80 CM |
5523 | err = ret; |
5524 | } | |
a52d9a80 CM |
5525 | if (err) { |
5526 | free_extent_map(em); | |
a52d9a80 CM |
5527 | return ERR_PTR(err); |
5528 | } | |
79787eaa | 5529 | BUG_ON(!em); /* Error is always set */ |
a52d9a80 CM |
5530 | return em; |
5531 | } | |
5532 | ||
ec29ed5b CM |
5533 | struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page, |
5534 | size_t pg_offset, u64 start, u64 len, | |
5535 | int create) | |
5536 | { | |
5537 | struct extent_map *em; | |
5538 | struct extent_map *hole_em = NULL; | |
5539 | u64 range_start = start; | |
5540 | u64 end; | |
5541 | u64 found; | |
5542 | u64 found_end; | |
5543 | int err = 0; | |
5544 | ||
5545 | em = btrfs_get_extent(inode, page, pg_offset, start, len, create); | |
5546 | if (IS_ERR(em)) | |
5547 | return em; | |
5548 | if (em) { | |
5549 | /* | |
5550 | * if our em maps to a hole, there might | |
5551 | * actually be delalloc bytes behind it | |
5552 | */ | |
5553 | if (em->block_start != EXTENT_MAP_HOLE) | |
5554 | return em; | |
5555 | else | |
5556 | hole_em = em; | |
5557 | } | |
5558 | ||
5559 | /* check to see if we've wrapped (len == -1 or similar) */ | |
5560 | end = start + len; | |
5561 | if (end < start) | |
5562 | end = (u64)-1; | |
5563 | else | |
5564 | end -= 1; | |
5565 | ||
5566 | em = NULL; | |
5567 | ||
5568 | /* ok, we didn't find anything, lets look for delalloc */ | |
5569 | found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start, | |
5570 | end, len, EXTENT_DELALLOC, 1); | |
5571 | found_end = range_start + found; | |
5572 | if (found_end < range_start) | |
5573 | found_end = (u64)-1; | |
5574 | ||
5575 | /* | |
5576 | * we didn't find anything useful, return | |
5577 | * the original results from get_extent() | |
5578 | */ | |
5579 | if (range_start > end || found_end <= start) { | |
5580 | em = hole_em; | |
5581 | hole_em = NULL; | |
5582 | goto out; | |
5583 | } | |
5584 | ||
5585 | /* adjust the range_start to make sure it doesn't | |
5586 | * go backwards from the start they passed in | |
5587 | */ | |
5588 | range_start = max(start,range_start); | |
5589 | found = found_end - range_start; | |
5590 | ||
5591 | if (found > 0) { | |
5592 | u64 hole_start = start; | |
5593 | u64 hole_len = len; | |
5594 | ||
172ddd60 | 5595 | em = alloc_extent_map(); |
ec29ed5b CM |
5596 | if (!em) { |
5597 | err = -ENOMEM; | |
5598 | goto out; | |
5599 | } | |
5600 | /* | |
5601 | * when btrfs_get_extent can't find anything it | |
5602 | * returns one huge hole | |
5603 | * | |
5604 | * make sure what it found really fits our range, and | |
5605 | * adjust to make sure it is based on the start from | |
5606 | * the caller | |
5607 | */ | |
5608 | if (hole_em) { | |
5609 | u64 calc_end = extent_map_end(hole_em); | |
5610 | ||
5611 | if (calc_end <= start || (hole_em->start > end)) { | |
5612 | free_extent_map(hole_em); | |
5613 | hole_em = NULL; | |
5614 | } else { | |
5615 | hole_start = max(hole_em->start, start); | |
5616 | hole_len = calc_end - hole_start; | |
5617 | } | |
5618 | } | |
5619 | em->bdev = NULL; | |
5620 | if (hole_em && range_start > hole_start) { | |
5621 | /* our hole starts before our delalloc, so we | |
5622 | * have to return just the parts of the hole | |
5623 | * that go until the delalloc starts | |
5624 | */ | |
5625 | em->len = min(hole_len, | |
5626 | range_start - hole_start); | |
5627 | em->start = hole_start; | |
5628 | em->orig_start = hole_start; | |
5629 | /* | |
5630 | * don't adjust block start at all, | |
5631 | * it is fixed at EXTENT_MAP_HOLE | |
5632 | */ | |
5633 | em->block_start = hole_em->block_start; | |
5634 | em->block_len = hole_len; | |
5635 | } else { | |
5636 | em->start = range_start; | |
5637 | em->len = found; | |
5638 | em->orig_start = range_start; | |
5639 | em->block_start = EXTENT_MAP_DELALLOC; | |
5640 | em->block_len = found; | |
5641 | } | |
5642 | } else if (hole_em) { | |
5643 | return hole_em; | |
5644 | } | |
5645 | out: | |
5646 | ||
5647 | free_extent_map(hole_em); | |
5648 | if (err) { | |
5649 | free_extent_map(em); | |
5650 | return ERR_PTR(err); | |
5651 | } | |
5652 | return em; | |
5653 | } | |
5654 | ||
4b46fce2 | 5655 | static struct extent_map *btrfs_new_extent_direct(struct inode *inode, |
16d299ac | 5656 | struct extent_map *em, |
4b46fce2 JB |
5657 | u64 start, u64 len) |
5658 | { | |
5659 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5660 | struct btrfs_trans_handle *trans; | |
4b46fce2 JB |
5661 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
5662 | struct btrfs_key ins; | |
5663 | u64 alloc_hint; | |
5664 | int ret; | |
16d299ac | 5665 | bool insert = false; |
4b46fce2 | 5666 | |
16d299ac JB |
5667 | /* |
5668 | * Ok if the extent map we looked up is a hole and is for the exact | |
5669 | * range we want, there is no reason to allocate a new one, however if | |
5670 | * it is not right then we need to free this one and drop the cache for | |
5671 | * our range. | |
5672 | */ | |
5673 | if (em->block_start != EXTENT_MAP_HOLE || em->start != start || | |
5674 | em->len != len) { | |
5675 | free_extent_map(em); | |
5676 | em = NULL; | |
5677 | insert = true; | |
5678 | btrfs_drop_extent_cache(inode, start, start + len - 1, 0); | |
5679 | } | |
4b46fce2 | 5680 | |
7a7eaa40 | 5681 | trans = btrfs_join_transaction(root); |
3612b495 TI |
5682 | if (IS_ERR(trans)) |
5683 | return ERR_CAST(trans); | |
4b46fce2 | 5684 | |
4cb5300b CM |
5685 | if (start <= BTRFS_I(inode)->disk_i_size && len < 64 * 1024) |
5686 | btrfs_add_inode_defrag(trans, inode); | |
5687 | ||
4b46fce2 JB |
5688 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
5689 | ||
5690 | alloc_hint = get_extent_allocation_hint(inode, start, len); | |
5691 | ret = btrfs_reserve_extent(trans, root, len, root->sectorsize, 0, | |
81c9ad23 | 5692 | alloc_hint, &ins, 1); |
4b46fce2 JB |
5693 | if (ret) { |
5694 | em = ERR_PTR(ret); | |
5695 | goto out; | |
5696 | } | |
5697 | ||
4b46fce2 | 5698 | if (!em) { |
172ddd60 | 5699 | em = alloc_extent_map(); |
16d299ac JB |
5700 | if (!em) { |
5701 | em = ERR_PTR(-ENOMEM); | |
5702 | goto out; | |
5703 | } | |
4b46fce2 JB |
5704 | } |
5705 | ||
5706 | em->start = start; | |
5707 | em->orig_start = em->start; | |
5708 | em->len = ins.offset; | |
5709 | ||
5710 | em->block_start = ins.objectid; | |
5711 | em->block_len = ins.offset; | |
5712 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
16d299ac JB |
5713 | |
5714 | /* | |
5715 | * We need to do this because if we're using the original em we searched | |
5716 | * for, we could have EXTENT_FLAG_VACANCY set, and we don't want that. | |
5717 | */ | |
5718 | em->flags = 0; | |
4b46fce2 JB |
5719 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
5720 | ||
16d299ac | 5721 | while (insert) { |
4b46fce2 JB |
5722 | write_lock(&em_tree->lock); |
5723 | ret = add_extent_mapping(em_tree, em); | |
5724 | write_unlock(&em_tree->lock); | |
5725 | if (ret != -EEXIST) | |
5726 | break; | |
5727 | btrfs_drop_extent_cache(inode, start, start + em->len - 1, 0); | |
5728 | } | |
5729 | ||
5730 | ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid, | |
5731 | ins.offset, ins.offset, 0); | |
5732 | if (ret) { | |
5733 | btrfs_free_reserved_extent(root, ins.objectid, ins.offset); | |
5734 | em = ERR_PTR(ret); | |
5735 | } | |
5736 | out: | |
5737 | btrfs_end_transaction(trans, root); | |
5738 | return em; | |
5739 | } | |
5740 | ||
46bfbb5c CM |
5741 | /* |
5742 | * returns 1 when the nocow is safe, < 1 on error, 0 if the | |
5743 | * block must be cow'd | |
5744 | */ | |
5745 | static noinline int can_nocow_odirect(struct btrfs_trans_handle *trans, | |
5746 | struct inode *inode, u64 offset, u64 len) | |
5747 | { | |
5748 | struct btrfs_path *path; | |
5749 | int ret; | |
5750 | struct extent_buffer *leaf; | |
5751 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5752 | struct btrfs_file_extent_item *fi; | |
5753 | struct btrfs_key key; | |
5754 | u64 disk_bytenr; | |
5755 | u64 backref_offset; | |
5756 | u64 extent_end; | |
5757 | u64 num_bytes; | |
5758 | int slot; | |
5759 | int found_type; | |
5760 | ||
5761 | path = btrfs_alloc_path(); | |
5762 | if (!path) | |
5763 | return -ENOMEM; | |
5764 | ||
33345d01 | 5765 | ret = btrfs_lookup_file_extent(trans, root, path, btrfs_ino(inode), |
46bfbb5c CM |
5766 | offset, 0); |
5767 | if (ret < 0) | |
5768 | goto out; | |
5769 | ||
5770 | slot = path->slots[0]; | |
5771 | if (ret == 1) { | |
5772 | if (slot == 0) { | |
5773 | /* can't find the item, must cow */ | |
5774 | ret = 0; | |
5775 | goto out; | |
5776 | } | |
5777 | slot--; | |
5778 | } | |
5779 | ret = 0; | |
5780 | leaf = path->nodes[0]; | |
5781 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
33345d01 | 5782 | if (key.objectid != btrfs_ino(inode) || |
46bfbb5c CM |
5783 | key.type != BTRFS_EXTENT_DATA_KEY) { |
5784 | /* not our file or wrong item type, must cow */ | |
5785 | goto out; | |
5786 | } | |
5787 | ||
5788 | if (key.offset > offset) { | |
5789 | /* Wrong offset, must cow */ | |
5790 | goto out; | |
5791 | } | |
5792 | ||
5793 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
5794 | found_type = btrfs_file_extent_type(leaf, fi); | |
5795 | if (found_type != BTRFS_FILE_EXTENT_REG && | |
5796 | found_type != BTRFS_FILE_EXTENT_PREALLOC) { | |
5797 | /* not a regular extent, must cow */ | |
5798 | goto out; | |
5799 | } | |
5800 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
5801 | backref_offset = btrfs_file_extent_offset(leaf, fi); | |
5802 | ||
5803 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
5804 | if (extent_end < offset + len) { | |
5805 | /* extent doesn't include our full range, must cow */ | |
5806 | goto out; | |
5807 | } | |
5808 | ||
5809 | if (btrfs_extent_readonly(root, disk_bytenr)) | |
5810 | goto out; | |
5811 | ||
5812 | /* | |
5813 | * look for other files referencing this extent, if we | |
5814 | * find any we must cow | |
5815 | */ | |
33345d01 | 5816 | if (btrfs_cross_ref_exist(trans, root, btrfs_ino(inode), |
46bfbb5c CM |
5817 | key.offset - backref_offset, disk_bytenr)) |
5818 | goto out; | |
5819 | ||
5820 | /* | |
5821 | * adjust disk_bytenr and num_bytes to cover just the bytes | |
5822 | * in this extent we are about to write. If there | |
5823 | * are any csums in that range we have to cow in order | |
5824 | * to keep the csums correct | |
5825 | */ | |
5826 | disk_bytenr += backref_offset; | |
5827 | disk_bytenr += offset - key.offset; | |
5828 | num_bytes = min(offset + len, extent_end) - offset; | |
5829 | if (csum_exist_in_range(root, disk_bytenr, num_bytes)) | |
5830 | goto out; | |
5831 | /* | |
5832 | * all of the above have passed, it is safe to overwrite this extent | |
5833 | * without cow | |
5834 | */ | |
5835 | ret = 1; | |
5836 | out: | |
5837 | btrfs_free_path(path); | |
5838 | return ret; | |
5839 | } | |
5840 | ||
eb838e73 JB |
5841 | static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend, |
5842 | struct extent_state **cached_state, int writing) | |
5843 | { | |
5844 | struct btrfs_ordered_extent *ordered; | |
5845 | int ret = 0; | |
5846 | ||
5847 | while (1) { | |
5848 | lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
5849 | 0, cached_state); | |
5850 | /* | |
5851 | * We're concerned with the entire range that we're going to be | |
5852 | * doing DIO to, so we need to make sure theres no ordered | |
5853 | * extents in this range. | |
5854 | */ | |
5855 | ordered = btrfs_lookup_ordered_range(inode, lockstart, | |
5856 | lockend - lockstart + 1); | |
5857 | ||
5858 | /* | |
5859 | * We need to make sure there are no buffered pages in this | |
5860 | * range either, we could have raced between the invalidate in | |
5861 | * generic_file_direct_write and locking the extent. The | |
5862 | * invalidate needs to happen so that reads after a write do not | |
5863 | * get stale data. | |
5864 | */ | |
5865 | if (!ordered && (!writing || | |
5866 | !test_range_bit(&BTRFS_I(inode)->io_tree, | |
5867 | lockstart, lockend, EXTENT_UPTODATE, 0, | |
5868 | *cached_state))) | |
5869 | break; | |
5870 | ||
5871 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
5872 | cached_state, GFP_NOFS); | |
5873 | ||
5874 | if (ordered) { | |
5875 | btrfs_start_ordered_extent(inode, ordered, 1); | |
5876 | btrfs_put_ordered_extent(ordered); | |
5877 | } else { | |
5878 | /* Screw you mmap */ | |
5879 | ret = filemap_write_and_wait_range(inode->i_mapping, | |
5880 | lockstart, | |
5881 | lockend); | |
5882 | if (ret) | |
5883 | break; | |
5884 | ||
5885 | /* | |
5886 | * If we found a page that couldn't be invalidated just | |
5887 | * fall back to buffered. | |
5888 | */ | |
5889 | ret = invalidate_inode_pages2_range(inode->i_mapping, | |
5890 | lockstart >> PAGE_CACHE_SHIFT, | |
5891 | lockend >> PAGE_CACHE_SHIFT); | |
5892 | if (ret) | |
5893 | break; | |
5894 | } | |
5895 | ||
5896 | cond_resched(); | |
5897 | } | |
5898 | ||
5899 | return ret; | |
5900 | } | |
5901 | ||
4b46fce2 JB |
5902 | static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock, |
5903 | struct buffer_head *bh_result, int create) | |
5904 | { | |
5905 | struct extent_map *em; | |
5906 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
eb838e73 | 5907 | struct extent_state *cached_state = NULL; |
4b46fce2 | 5908 | u64 start = iblock << inode->i_blkbits; |
eb838e73 | 5909 | u64 lockstart, lockend; |
4b46fce2 | 5910 | u64 len = bh_result->b_size; |
46bfbb5c | 5911 | struct btrfs_trans_handle *trans; |
eb838e73 JB |
5912 | int unlock_bits = EXTENT_LOCKED; |
5913 | int ret; | |
5914 | ||
eb838e73 JB |
5915 | if (create) { |
5916 | ret = btrfs_delalloc_reserve_space(inode, len); | |
5917 | if (ret) | |
5918 | return ret; | |
5919 | unlock_bits |= EXTENT_DELALLOC | EXTENT_DIRTY; | |
c329861d JB |
5920 | } else { |
5921 | len = min_t(u64, len, root->sectorsize); | |
eb838e73 JB |
5922 | } |
5923 | ||
c329861d JB |
5924 | lockstart = start; |
5925 | lockend = start + len - 1; | |
5926 | ||
eb838e73 JB |
5927 | /* |
5928 | * If this errors out it's because we couldn't invalidate pagecache for | |
5929 | * this range and we need to fallback to buffered. | |
5930 | */ | |
5931 | if (lock_extent_direct(inode, lockstart, lockend, &cached_state, create)) | |
5932 | return -ENOTBLK; | |
5933 | ||
5934 | if (create) { | |
5935 | ret = set_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, | |
5936 | lockend, EXTENT_DELALLOC, NULL, | |
5937 | &cached_state, GFP_NOFS); | |
5938 | if (ret) | |
5939 | goto unlock_err; | |
5940 | } | |
4b46fce2 JB |
5941 | |
5942 | em = btrfs_get_extent(inode, NULL, 0, start, len, 0); | |
eb838e73 JB |
5943 | if (IS_ERR(em)) { |
5944 | ret = PTR_ERR(em); | |
5945 | goto unlock_err; | |
5946 | } | |
4b46fce2 JB |
5947 | |
5948 | /* | |
5949 | * Ok for INLINE and COMPRESSED extents we need to fallback on buffered | |
5950 | * io. INLINE is special, and we could probably kludge it in here, but | |
5951 | * it's still buffered so for safety lets just fall back to the generic | |
5952 | * buffered path. | |
5953 | * | |
5954 | * For COMPRESSED we _have_ to read the entire extent in so we can | |
5955 | * decompress it, so there will be buffering required no matter what we | |
5956 | * do, so go ahead and fallback to buffered. | |
5957 | * | |
5958 | * We return -ENOTBLK because thats what makes DIO go ahead and go back | |
5959 | * to buffered IO. Don't blame me, this is the price we pay for using | |
5960 | * the generic code. | |
5961 | */ | |
5962 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) || | |
5963 | em->block_start == EXTENT_MAP_INLINE) { | |
5964 | free_extent_map(em); | |
eb838e73 JB |
5965 | ret = -ENOTBLK; |
5966 | goto unlock_err; | |
4b46fce2 JB |
5967 | } |
5968 | ||
5969 | /* Just a good old fashioned hole, return */ | |
5970 | if (!create && (em->block_start == EXTENT_MAP_HOLE || | |
5971 | test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) { | |
5972 | free_extent_map(em); | |
eb838e73 JB |
5973 | ret = 0; |
5974 | goto unlock_err; | |
4b46fce2 JB |
5975 | } |
5976 | ||
5977 | /* | |
5978 | * We don't allocate a new extent in the following cases | |
5979 | * | |
5980 | * 1) The inode is marked as NODATACOW. In this case we'll just use the | |
5981 | * existing extent. | |
5982 | * 2) The extent is marked as PREALLOC. We're good to go here and can | |
5983 | * just use the extent. | |
5984 | * | |
5985 | */ | |
46bfbb5c | 5986 | if (!create) { |
eb838e73 JB |
5987 | len = min(len, em->len - (start - em->start)); |
5988 | lockstart = start + len; | |
5989 | goto unlock; | |
46bfbb5c | 5990 | } |
4b46fce2 JB |
5991 | |
5992 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) || | |
5993 | ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) && | |
5994 | em->block_start != EXTENT_MAP_HOLE)) { | |
4b46fce2 JB |
5995 | int type; |
5996 | int ret; | |
46bfbb5c | 5997 | u64 block_start; |
4b46fce2 JB |
5998 | |
5999 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) | |
6000 | type = BTRFS_ORDERED_PREALLOC; | |
6001 | else | |
6002 | type = BTRFS_ORDERED_NOCOW; | |
46bfbb5c | 6003 | len = min(len, em->len - (start - em->start)); |
4b46fce2 | 6004 | block_start = em->block_start + (start - em->start); |
46bfbb5c CM |
6005 | |
6006 | /* | |
6007 | * we're not going to log anything, but we do need | |
6008 | * to make sure the current transaction stays open | |
6009 | * while we look for nocow cross refs | |
6010 | */ | |
7a7eaa40 | 6011 | trans = btrfs_join_transaction(root); |
3612b495 | 6012 | if (IS_ERR(trans)) |
46bfbb5c CM |
6013 | goto must_cow; |
6014 | ||
6015 | if (can_nocow_odirect(trans, inode, start, len) == 1) { | |
6016 | ret = btrfs_add_ordered_extent_dio(inode, start, | |
6017 | block_start, len, len, type); | |
6018 | btrfs_end_transaction(trans, root); | |
6019 | if (ret) { | |
6020 | free_extent_map(em); | |
eb838e73 | 6021 | goto unlock_err; |
46bfbb5c CM |
6022 | } |
6023 | goto unlock; | |
4b46fce2 | 6024 | } |
46bfbb5c | 6025 | btrfs_end_transaction(trans, root); |
4b46fce2 | 6026 | } |
46bfbb5c CM |
6027 | must_cow: |
6028 | /* | |
6029 | * this will cow the extent, reset the len in case we changed | |
6030 | * it above | |
6031 | */ | |
6032 | len = bh_result->b_size; | |
16d299ac | 6033 | em = btrfs_new_extent_direct(inode, em, start, len); |
eb838e73 JB |
6034 | if (IS_ERR(em)) { |
6035 | ret = PTR_ERR(em); | |
6036 | goto unlock_err; | |
6037 | } | |
46bfbb5c CM |
6038 | len = min(len, em->len - (start - em->start)); |
6039 | unlock: | |
4b46fce2 JB |
6040 | bh_result->b_blocknr = (em->block_start + (start - em->start)) >> |
6041 | inode->i_blkbits; | |
46bfbb5c | 6042 | bh_result->b_size = len; |
4b46fce2 JB |
6043 | bh_result->b_bdev = em->bdev; |
6044 | set_buffer_mapped(bh_result); | |
c3473e83 JB |
6045 | if (create) { |
6046 | if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) | |
6047 | set_buffer_new(bh_result); | |
6048 | ||
6049 | /* | |
6050 | * Need to update the i_size under the extent lock so buffered | |
6051 | * readers will get the updated i_size when we unlock. | |
6052 | */ | |
6053 | if (start + len > i_size_read(inode)) | |
6054 | i_size_write(inode, start + len); | |
6055 | } | |
4b46fce2 | 6056 | |
eb838e73 JB |
6057 | /* |
6058 | * In the case of write we need to clear and unlock the entire range, | |
6059 | * in the case of read we need to unlock only the end area that we | |
6060 | * aren't using if there is any left over space. | |
6061 | */ | |
24c03fa5 LB |
6062 | if (lockstart < lockend) { |
6063 | if (create && len < lockend - lockstart) { | |
6064 | clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, | |
9e8a4a8b LB |
6065 | lockstart + len - 1, |
6066 | unlock_bits | EXTENT_DEFRAG, 1, 0, | |
24c03fa5 LB |
6067 | &cached_state, GFP_NOFS); |
6068 | /* | |
6069 | * Beside unlock, we also need to cleanup reserved space | |
6070 | * for the left range by attaching EXTENT_DO_ACCOUNTING. | |
6071 | */ | |
6072 | clear_extent_bit(&BTRFS_I(inode)->io_tree, | |
6073 | lockstart + len, lockend, | |
9e8a4a8b LB |
6074 | unlock_bits | EXTENT_DO_ACCOUNTING | |
6075 | EXTENT_DEFRAG, 1, 0, NULL, GFP_NOFS); | |
24c03fa5 LB |
6076 | } else { |
6077 | clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, | |
6078 | lockend, unlock_bits, 1, 0, | |
6079 | &cached_state, GFP_NOFS); | |
6080 | } | |
6081 | } else { | |
eb838e73 | 6082 | free_extent_state(cached_state); |
24c03fa5 | 6083 | } |
eb838e73 | 6084 | |
4b46fce2 JB |
6085 | free_extent_map(em); |
6086 | ||
6087 | return 0; | |
eb838e73 JB |
6088 | |
6089 | unlock_err: | |
6090 | if (create) | |
6091 | unlock_bits |= EXTENT_DO_ACCOUNTING; | |
6092 | ||
6093 | clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
6094 | unlock_bits, 1, 0, &cached_state, GFP_NOFS); | |
6095 | return ret; | |
4b46fce2 JB |
6096 | } |
6097 | ||
6098 | struct btrfs_dio_private { | |
6099 | struct inode *inode; | |
6100 | u64 logical_offset; | |
6101 | u64 disk_bytenr; | |
6102 | u64 bytes; | |
4b46fce2 | 6103 | void *private; |
e65e1535 MX |
6104 | |
6105 | /* number of bios pending for this dio */ | |
6106 | atomic_t pending_bios; | |
6107 | ||
6108 | /* IO errors */ | |
6109 | int errors; | |
6110 | ||
6111 | struct bio *orig_bio; | |
4b46fce2 JB |
6112 | }; |
6113 | ||
6114 | static void btrfs_endio_direct_read(struct bio *bio, int err) | |
6115 | { | |
e65e1535 | 6116 | struct btrfs_dio_private *dip = bio->bi_private; |
4b46fce2 JB |
6117 | struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1; |
6118 | struct bio_vec *bvec = bio->bi_io_vec; | |
4b46fce2 JB |
6119 | struct inode *inode = dip->inode; |
6120 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6121 | u64 start; | |
4b46fce2 JB |
6122 | |
6123 | start = dip->logical_offset; | |
6124 | do { | |
6125 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) { | |
6126 | struct page *page = bvec->bv_page; | |
6127 | char *kaddr; | |
6128 | u32 csum = ~(u32)0; | |
c329861d | 6129 | u64 private = ~(u32)0; |
4b46fce2 JB |
6130 | unsigned long flags; |
6131 | ||
c329861d JB |
6132 | if (get_state_private(&BTRFS_I(inode)->io_tree, |
6133 | start, &private)) | |
6134 | goto failed; | |
4b46fce2 | 6135 | local_irq_save(flags); |
7ac687d9 | 6136 | kaddr = kmap_atomic(page); |
4b46fce2 JB |
6137 | csum = btrfs_csum_data(root, kaddr + bvec->bv_offset, |
6138 | csum, bvec->bv_len); | |
6139 | btrfs_csum_final(csum, (char *)&csum); | |
7ac687d9 | 6140 | kunmap_atomic(kaddr); |
4b46fce2 JB |
6141 | local_irq_restore(flags); |
6142 | ||
6143 | flush_dcache_page(bvec->bv_page); | |
c329861d JB |
6144 | if (csum != private) { |
6145 | failed: | |
33345d01 | 6146 | printk(KERN_ERR "btrfs csum failed ino %llu off" |
4b46fce2 | 6147 | " %llu csum %u private %u\n", |
33345d01 LZ |
6148 | (unsigned long long)btrfs_ino(inode), |
6149 | (unsigned long long)start, | |
c329861d | 6150 | csum, (unsigned)private); |
4b46fce2 JB |
6151 | err = -EIO; |
6152 | } | |
6153 | } | |
6154 | ||
6155 | start += bvec->bv_len; | |
4b46fce2 JB |
6156 | bvec++; |
6157 | } while (bvec <= bvec_end); | |
6158 | ||
6159 | unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset, | |
d0082371 | 6160 | dip->logical_offset + dip->bytes - 1); |
4b46fce2 JB |
6161 | bio->bi_private = dip->private; |
6162 | ||
4b46fce2 | 6163 | kfree(dip); |
c0da7aa1 JB |
6164 | |
6165 | /* If we had a csum failure make sure to clear the uptodate flag */ | |
6166 | if (err) | |
6167 | clear_bit(BIO_UPTODATE, &bio->bi_flags); | |
4b46fce2 JB |
6168 | dio_end_io(bio, err); |
6169 | } | |
6170 | ||
6171 | static void btrfs_endio_direct_write(struct bio *bio, int err) | |
6172 | { | |
6173 | struct btrfs_dio_private *dip = bio->bi_private; | |
6174 | struct inode *inode = dip->inode; | |
6175 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4b46fce2 | 6176 | struct btrfs_ordered_extent *ordered = NULL; |
163cf09c CM |
6177 | u64 ordered_offset = dip->logical_offset; |
6178 | u64 ordered_bytes = dip->bytes; | |
4b46fce2 JB |
6179 | int ret; |
6180 | ||
6181 | if (err) | |
6182 | goto out_done; | |
163cf09c CM |
6183 | again: |
6184 | ret = btrfs_dec_test_first_ordered_pending(inode, &ordered, | |
6185 | &ordered_offset, | |
5fd02043 | 6186 | ordered_bytes, !err); |
4b46fce2 | 6187 | if (!ret) |
163cf09c | 6188 | goto out_test; |
4b46fce2 | 6189 | |
5fd02043 JB |
6190 | ordered->work.func = finish_ordered_fn; |
6191 | ordered->work.flags = 0; | |
6192 | btrfs_queue_worker(&root->fs_info->endio_write_workers, | |
6193 | &ordered->work); | |
163cf09c CM |
6194 | out_test: |
6195 | /* | |
6196 | * our bio might span multiple ordered extents. If we haven't | |
6197 | * completed the accounting for the whole dio, go back and try again | |
6198 | */ | |
6199 | if (ordered_offset < dip->logical_offset + dip->bytes) { | |
6200 | ordered_bytes = dip->logical_offset + dip->bytes - | |
6201 | ordered_offset; | |
5fd02043 | 6202 | ordered = NULL; |
163cf09c CM |
6203 | goto again; |
6204 | } | |
4b46fce2 JB |
6205 | out_done: |
6206 | bio->bi_private = dip->private; | |
6207 | ||
4b46fce2 | 6208 | kfree(dip); |
c0da7aa1 JB |
6209 | |
6210 | /* If we had an error make sure to clear the uptodate flag */ | |
6211 | if (err) | |
6212 | clear_bit(BIO_UPTODATE, &bio->bi_flags); | |
4b46fce2 JB |
6213 | dio_end_io(bio, err); |
6214 | } | |
6215 | ||
eaf25d93 CM |
6216 | static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw, |
6217 | struct bio *bio, int mirror_num, | |
6218 | unsigned long bio_flags, u64 offset) | |
6219 | { | |
6220 | int ret; | |
6221 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6222 | ret = btrfs_csum_one_bio(root, inode, bio, offset, 1); | |
79787eaa | 6223 | BUG_ON(ret); /* -ENOMEM */ |
eaf25d93 CM |
6224 | return 0; |
6225 | } | |
6226 | ||
e65e1535 MX |
6227 | static void btrfs_end_dio_bio(struct bio *bio, int err) |
6228 | { | |
6229 | struct btrfs_dio_private *dip = bio->bi_private; | |
6230 | ||
6231 | if (err) { | |
33345d01 | 6232 | printk(KERN_ERR "btrfs direct IO failed ino %llu rw %lu " |
3dd1462e | 6233 | "sector %#Lx len %u err no %d\n", |
33345d01 | 6234 | (unsigned long long)btrfs_ino(dip->inode), bio->bi_rw, |
3dd1462e | 6235 | (unsigned long long)bio->bi_sector, bio->bi_size, err); |
e65e1535 MX |
6236 | dip->errors = 1; |
6237 | ||
6238 | /* | |
6239 | * before atomic variable goto zero, we must make sure | |
6240 | * dip->errors is perceived to be set. | |
6241 | */ | |
6242 | smp_mb__before_atomic_dec(); | |
6243 | } | |
6244 | ||
6245 | /* if there are more bios still pending for this dio, just exit */ | |
6246 | if (!atomic_dec_and_test(&dip->pending_bios)) | |
6247 | goto out; | |
6248 | ||
6249 | if (dip->errors) | |
6250 | bio_io_error(dip->orig_bio); | |
6251 | else { | |
6252 | set_bit(BIO_UPTODATE, &dip->orig_bio->bi_flags); | |
6253 | bio_endio(dip->orig_bio, 0); | |
6254 | } | |
6255 | out: | |
6256 | bio_put(bio); | |
6257 | } | |
6258 | ||
6259 | static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev, | |
6260 | u64 first_sector, gfp_t gfp_flags) | |
6261 | { | |
6262 | int nr_vecs = bio_get_nr_vecs(bdev); | |
6263 | return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags); | |
6264 | } | |
6265 | ||
6266 | static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode, | |
6267 | int rw, u64 file_offset, int skip_sum, | |
c329861d | 6268 | int async_submit) |
e65e1535 MX |
6269 | { |
6270 | int write = rw & REQ_WRITE; | |
6271 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6272 | int ret; | |
6273 | ||
6274 | bio_get(bio); | |
5fd02043 JB |
6275 | |
6276 | if (!write) { | |
6277 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0); | |
6278 | if (ret) | |
6279 | goto err; | |
6280 | } | |
e65e1535 | 6281 | |
1ae39938 JB |
6282 | if (skip_sum) |
6283 | goto map; | |
6284 | ||
6285 | if (write && async_submit) { | |
e65e1535 MX |
6286 | ret = btrfs_wq_submit_bio(root->fs_info, |
6287 | inode, rw, bio, 0, 0, | |
6288 | file_offset, | |
6289 | __btrfs_submit_bio_start_direct_io, | |
6290 | __btrfs_submit_bio_done); | |
6291 | goto err; | |
1ae39938 JB |
6292 | } else if (write) { |
6293 | /* | |
6294 | * If we aren't doing async submit, calculate the csum of the | |
6295 | * bio now. | |
6296 | */ | |
6297 | ret = btrfs_csum_one_bio(root, inode, bio, file_offset, 1); | |
6298 | if (ret) | |
6299 | goto err; | |
c2db1073 | 6300 | } else if (!skip_sum) { |
c329861d | 6301 | ret = btrfs_lookup_bio_sums_dio(root, inode, bio, file_offset); |
c2db1073 TI |
6302 | if (ret) |
6303 | goto err; | |
6304 | } | |
e65e1535 | 6305 | |
1ae39938 JB |
6306 | map: |
6307 | ret = btrfs_map_bio(root, rw, bio, 0, async_submit); | |
e65e1535 MX |
6308 | err: |
6309 | bio_put(bio); | |
6310 | return ret; | |
6311 | } | |
6312 | ||
6313 | static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip, | |
6314 | int skip_sum) | |
6315 | { | |
6316 | struct inode *inode = dip->inode; | |
6317 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6318 | struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree; | |
6319 | struct bio *bio; | |
6320 | struct bio *orig_bio = dip->orig_bio; | |
6321 | struct bio_vec *bvec = orig_bio->bi_io_vec; | |
6322 | u64 start_sector = orig_bio->bi_sector; | |
6323 | u64 file_offset = dip->logical_offset; | |
6324 | u64 submit_len = 0; | |
6325 | u64 map_length; | |
6326 | int nr_pages = 0; | |
e65e1535 | 6327 | int ret = 0; |
1ae39938 | 6328 | int async_submit = 0; |
e65e1535 | 6329 | |
e65e1535 MX |
6330 | map_length = orig_bio->bi_size; |
6331 | ret = btrfs_map_block(map_tree, READ, start_sector << 9, | |
6332 | &map_length, NULL, 0); | |
6333 | if (ret) { | |
64728bbb | 6334 | bio_put(orig_bio); |
e65e1535 MX |
6335 | return -EIO; |
6336 | } | |
6337 | ||
02f57c7a JB |
6338 | if (map_length >= orig_bio->bi_size) { |
6339 | bio = orig_bio; | |
6340 | goto submit; | |
6341 | } | |
6342 | ||
1ae39938 | 6343 | async_submit = 1; |
02f57c7a JB |
6344 | bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS); |
6345 | if (!bio) | |
6346 | return -ENOMEM; | |
6347 | bio->bi_private = dip; | |
6348 | bio->bi_end_io = btrfs_end_dio_bio; | |
6349 | atomic_inc(&dip->pending_bios); | |
6350 | ||
e65e1535 MX |
6351 | while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) { |
6352 | if (unlikely(map_length < submit_len + bvec->bv_len || | |
6353 | bio_add_page(bio, bvec->bv_page, bvec->bv_len, | |
6354 | bvec->bv_offset) < bvec->bv_len)) { | |
6355 | /* | |
6356 | * inc the count before we submit the bio so | |
6357 | * we know the end IO handler won't happen before | |
6358 | * we inc the count. Otherwise, the dip might get freed | |
6359 | * before we're done setting it up | |
6360 | */ | |
6361 | atomic_inc(&dip->pending_bios); | |
6362 | ret = __btrfs_submit_dio_bio(bio, inode, rw, | |
6363 | file_offset, skip_sum, | |
c329861d | 6364 | async_submit); |
e65e1535 MX |
6365 | if (ret) { |
6366 | bio_put(bio); | |
6367 | atomic_dec(&dip->pending_bios); | |
6368 | goto out_err; | |
6369 | } | |
6370 | ||
e65e1535 MX |
6371 | start_sector += submit_len >> 9; |
6372 | file_offset += submit_len; | |
6373 | ||
6374 | submit_len = 0; | |
6375 | nr_pages = 0; | |
6376 | ||
6377 | bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, | |
6378 | start_sector, GFP_NOFS); | |
6379 | if (!bio) | |
6380 | goto out_err; | |
6381 | bio->bi_private = dip; | |
6382 | bio->bi_end_io = btrfs_end_dio_bio; | |
6383 | ||
6384 | map_length = orig_bio->bi_size; | |
6385 | ret = btrfs_map_block(map_tree, READ, start_sector << 9, | |
6386 | &map_length, NULL, 0); | |
6387 | if (ret) { | |
6388 | bio_put(bio); | |
6389 | goto out_err; | |
6390 | } | |
6391 | } else { | |
6392 | submit_len += bvec->bv_len; | |
6393 | nr_pages ++; | |
6394 | bvec++; | |
6395 | } | |
6396 | } | |
6397 | ||
02f57c7a | 6398 | submit: |
e65e1535 | 6399 | ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum, |
c329861d | 6400 | async_submit); |
e65e1535 MX |
6401 | if (!ret) |
6402 | return 0; | |
6403 | ||
6404 | bio_put(bio); | |
6405 | out_err: | |
6406 | dip->errors = 1; | |
6407 | /* | |
6408 | * before atomic variable goto zero, we must | |
6409 | * make sure dip->errors is perceived to be set. | |
6410 | */ | |
6411 | smp_mb__before_atomic_dec(); | |
6412 | if (atomic_dec_and_test(&dip->pending_bios)) | |
6413 | bio_io_error(dip->orig_bio); | |
6414 | ||
6415 | /* bio_end_io() will handle error, so we needn't return it */ | |
6416 | return 0; | |
6417 | } | |
6418 | ||
4b46fce2 JB |
6419 | static void btrfs_submit_direct(int rw, struct bio *bio, struct inode *inode, |
6420 | loff_t file_offset) | |
6421 | { | |
6422 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6423 | struct btrfs_dio_private *dip; | |
6424 | struct bio_vec *bvec = bio->bi_io_vec; | |
4b46fce2 | 6425 | int skip_sum; |
7b6d91da | 6426 | int write = rw & REQ_WRITE; |
4b46fce2 JB |
6427 | int ret = 0; |
6428 | ||
6429 | skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; | |
6430 | ||
6431 | dip = kmalloc(sizeof(*dip), GFP_NOFS); | |
6432 | if (!dip) { | |
6433 | ret = -ENOMEM; | |
6434 | goto free_ordered; | |
6435 | } | |
4b46fce2 JB |
6436 | |
6437 | dip->private = bio->bi_private; | |
6438 | dip->inode = inode; | |
6439 | dip->logical_offset = file_offset; | |
6440 | ||
4b46fce2 JB |
6441 | dip->bytes = 0; |
6442 | do { | |
6443 | dip->bytes += bvec->bv_len; | |
6444 | bvec++; | |
6445 | } while (bvec <= (bio->bi_io_vec + bio->bi_vcnt - 1)); | |
6446 | ||
46bfbb5c | 6447 | dip->disk_bytenr = (u64)bio->bi_sector << 9; |
4b46fce2 | 6448 | bio->bi_private = dip; |
e65e1535 MX |
6449 | dip->errors = 0; |
6450 | dip->orig_bio = bio; | |
6451 | atomic_set(&dip->pending_bios, 0); | |
4b46fce2 JB |
6452 | |
6453 | if (write) | |
6454 | bio->bi_end_io = btrfs_endio_direct_write; | |
6455 | else | |
6456 | bio->bi_end_io = btrfs_endio_direct_read; | |
6457 | ||
e65e1535 MX |
6458 | ret = btrfs_submit_direct_hook(rw, dip, skip_sum); |
6459 | if (!ret) | |
eaf25d93 | 6460 | return; |
4b46fce2 JB |
6461 | free_ordered: |
6462 | /* | |
6463 | * If this is a write, we need to clean up the reserved space and kill | |
6464 | * the ordered extent. | |
6465 | */ | |
6466 | if (write) { | |
6467 | struct btrfs_ordered_extent *ordered; | |
955256f2 | 6468 | ordered = btrfs_lookup_ordered_extent(inode, file_offset); |
4b46fce2 JB |
6469 | if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) && |
6470 | !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) | |
6471 | btrfs_free_reserved_extent(root, ordered->start, | |
6472 | ordered->disk_len); | |
6473 | btrfs_put_ordered_extent(ordered); | |
6474 | btrfs_put_ordered_extent(ordered); | |
6475 | } | |
6476 | bio_endio(bio, ret); | |
6477 | } | |
6478 | ||
5a5f79b5 CM |
6479 | static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb, |
6480 | const struct iovec *iov, loff_t offset, | |
6481 | unsigned long nr_segs) | |
6482 | { | |
6483 | int seg; | |
a1b75f7d | 6484 | int i; |
5a5f79b5 CM |
6485 | size_t size; |
6486 | unsigned long addr; | |
6487 | unsigned blocksize_mask = root->sectorsize - 1; | |
6488 | ssize_t retval = -EINVAL; | |
6489 | loff_t end = offset; | |
6490 | ||
6491 | if (offset & blocksize_mask) | |
6492 | goto out; | |
6493 | ||
6494 | /* Check the memory alignment. Blocks cannot straddle pages */ | |
6495 | for (seg = 0; seg < nr_segs; seg++) { | |
6496 | addr = (unsigned long)iov[seg].iov_base; | |
6497 | size = iov[seg].iov_len; | |
6498 | end += size; | |
a1b75f7d | 6499 | if ((addr & blocksize_mask) || (size & blocksize_mask)) |
5a5f79b5 | 6500 | goto out; |
a1b75f7d JB |
6501 | |
6502 | /* If this is a write we don't need to check anymore */ | |
6503 | if (rw & WRITE) | |
6504 | continue; | |
6505 | ||
6506 | /* | |
6507 | * Check to make sure we don't have duplicate iov_base's in this | |
6508 | * iovec, if so return EINVAL, otherwise we'll get csum errors | |
6509 | * when reading back. | |
6510 | */ | |
6511 | for (i = seg + 1; i < nr_segs; i++) { | |
6512 | if (iov[seg].iov_base == iov[i].iov_base) | |
6513 | goto out; | |
6514 | } | |
5a5f79b5 CM |
6515 | } |
6516 | retval = 0; | |
6517 | out: | |
6518 | return retval; | |
6519 | } | |
eb838e73 | 6520 | |
16432985 CM |
6521 | static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb, |
6522 | const struct iovec *iov, loff_t offset, | |
6523 | unsigned long nr_segs) | |
6524 | { | |
4b46fce2 JB |
6525 | struct file *file = iocb->ki_filp; |
6526 | struct inode *inode = file->f_mapping->host; | |
4b46fce2 | 6527 | |
5a5f79b5 | 6528 | if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iov, |
eb838e73 | 6529 | offset, nr_segs)) |
5a5f79b5 | 6530 | return 0; |
3f7c579c | 6531 | |
eb838e73 | 6532 | return __blockdev_direct_IO(rw, iocb, inode, |
5a5f79b5 CM |
6533 | BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev, |
6534 | iov, offset, nr_segs, btrfs_get_blocks_direct, NULL, | |
6535 | btrfs_submit_direct, 0); | |
16432985 CM |
6536 | } |
6537 | ||
1506fcc8 YS |
6538 | static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
6539 | __u64 start, __u64 len) | |
6540 | { | |
ec29ed5b | 6541 | return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap); |
1506fcc8 YS |
6542 | } |
6543 | ||
a52d9a80 | 6544 | int btrfs_readpage(struct file *file, struct page *page) |
9ebefb18 | 6545 | { |
d1310b2e CM |
6546 | struct extent_io_tree *tree; |
6547 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
8ddc7d9c | 6548 | return extent_read_full_page(tree, page, btrfs_get_extent, 0); |
9ebefb18 | 6549 | } |
1832a6d5 | 6550 | |
a52d9a80 | 6551 | static int btrfs_writepage(struct page *page, struct writeback_control *wbc) |
39279cc3 | 6552 | { |
d1310b2e | 6553 | struct extent_io_tree *tree; |
b888db2b CM |
6554 | |
6555 | ||
6556 | if (current->flags & PF_MEMALLOC) { | |
6557 | redirty_page_for_writepage(wbc, page); | |
6558 | unlock_page(page); | |
6559 | return 0; | |
6560 | } | |
d1310b2e | 6561 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
a52d9a80 | 6562 | return extent_write_full_page(tree, page, btrfs_get_extent, wbc); |
9ebefb18 CM |
6563 | } |
6564 | ||
f421950f CM |
6565 | int btrfs_writepages(struct address_space *mapping, |
6566 | struct writeback_control *wbc) | |
b293f02e | 6567 | { |
d1310b2e | 6568 | struct extent_io_tree *tree; |
771ed689 | 6569 | |
d1310b2e | 6570 | tree = &BTRFS_I(mapping->host)->io_tree; |
b293f02e CM |
6571 | return extent_writepages(tree, mapping, btrfs_get_extent, wbc); |
6572 | } | |
6573 | ||
3ab2fb5a CM |
6574 | static int |
6575 | btrfs_readpages(struct file *file, struct address_space *mapping, | |
6576 | struct list_head *pages, unsigned nr_pages) | |
6577 | { | |
d1310b2e CM |
6578 | struct extent_io_tree *tree; |
6579 | tree = &BTRFS_I(mapping->host)->io_tree; | |
3ab2fb5a CM |
6580 | return extent_readpages(tree, mapping, pages, nr_pages, |
6581 | btrfs_get_extent); | |
6582 | } | |
e6dcd2dc | 6583 | static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
9ebefb18 | 6584 | { |
d1310b2e CM |
6585 | struct extent_io_tree *tree; |
6586 | struct extent_map_tree *map; | |
a52d9a80 | 6587 | int ret; |
8c2383c3 | 6588 | |
d1310b2e CM |
6589 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
6590 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
70dec807 | 6591 | ret = try_release_extent_mapping(map, tree, page, gfp_flags); |
a52d9a80 CM |
6592 | if (ret == 1) { |
6593 | ClearPagePrivate(page); | |
6594 | set_page_private(page, 0); | |
6595 | page_cache_release(page); | |
39279cc3 | 6596 | } |
a52d9a80 | 6597 | return ret; |
39279cc3 CM |
6598 | } |
6599 | ||
e6dcd2dc CM |
6600 | static int btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
6601 | { | |
98509cfc CM |
6602 | if (PageWriteback(page) || PageDirty(page)) |
6603 | return 0; | |
b335b003 | 6604 | return __btrfs_releasepage(page, gfp_flags & GFP_NOFS); |
e6dcd2dc CM |
6605 | } |
6606 | ||
a52d9a80 | 6607 | static void btrfs_invalidatepage(struct page *page, unsigned long offset) |
39279cc3 | 6608 | { |
5fd02043 | 6609 | struct inode *inode = page->mapping->host; |
d1310b2e | 6610 | struct extent_io_tree *tree; |
e6dcd2dc | 6611 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 6612 | struct extent_state *cached_state = NULL; |
e6dcd2dc CM |
6613 | u64 page_start = page_offset(page); |
6614 | u64 page_end = page_start + PAGE_CACHE_SIZE - 1; | |
39279cc3 | 6615 | |
8b62b72b CM |
6616 | /* |
6617 | * we have the page locked, so new writeback can't start, | |
6618 | * and the dirty bit won't be cleared while we are here. | |
6619 | * | |
6620 | * Wait for IO on this page so that we can safely clear | |
6621 | * the PagePrivate2 bit and do ordered accounting | |
6622 | */ | |
e6dcd2dc | 6623 | wait_on_page_writeback(page); |
8b62b72b | 6624 | |
5fd02043 | 6625 | tree = &BTRFS_I(inode)->io_tree; |
e6dcd2dc CM |
6626 | if (offset) { |
6627 | btrfs_releasepage(page, GFP_NOFS); | |
6628 | return; | |
6629 | } | |
d0082371 | 6630 | lock_extent_bits(tree, page_start, page_end, 0, &cached_state); |
5fd02043 | 6631 | ordered = btrfs_lookup_ordered_extent(inode, |
e6dcd2dc CM |
6632 | page_offset(page)); |
6633 | if (ordered) { | |
eb84ae03 CM |
6634 | /* |
6635 | * IO on this page will never be started, so we need | |
6636 | * to account for any ordered extents now | |
6637 | */ | |
e6dcd2dc CM |
6638 | clear_extent_bit(tree, page_start, page_end, |
6639 | EXTENT_DIRTY | EXTENT_DELALLOC | | |
9e8a4a8b LB |
6640 | EXTENT_LOCKED | EXTENT_DO_ACCOUNTING | |
6641 | EXTENT_DEFRAG, 1, 0, &cached_state, GFP_NOFS); | |
8b62b72b CM |
6642 | /* |
6643 | * whoever cleared the private bit is responsible | |
6644 | * for the finish_ordered_io | |
6645 | */ | |
5fd02043 JB |
6646 | if (TestClearPagePrivate2(page) && |
6647 | btrfs_dec_test_ordered_pending(inode, &ordered, page_start, | |
6648 | PAGE_CACHE_SIZE, 1)) { | |
6649 | btrfs_finish_ordered_io(ordered); | |
8b62b72b | 6650 | } |
e6dcd2dc | 6651 | btrfs_put_ordered_extent(ordered); |
2ac55d41 | 6652 | cached_state = NULL; |
d0082371 | 6653 | lock_extent_bits(tree, page_start, page_end, 0, &cached_state); |
e6dcd2dc CM |
6654 | } |
6655 | clear_extent_bit(tree, page_start, page_end, | |
32c00aff | 6656 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
9e8a4a8b LB |
6657 | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1, 1, |
6658 | &cached_state, GFP_NOFS); | |
e6dcd2dc CM |
6659 | __btrfs_releasepage(page, GFP_NOFS); |
6660 | ||
4a096752 | 6661 | ClearPageChecked(page); |
9ad6b7bc | 6662 | if (PagePrivate(page)) { |
9ad6b7bc CM |
6663 | ClearPagePrivate(page); |
6664 | set_page_private(page, 0); | |
6665 | page_cache_release(page); | |
6666 | } | |
39279cc3 CM |
6667 | } |
6668 | ||
9ebefb18 CM |
6669 | /* |
6670 | * btrfs_page_mkwrite() is not allowed to change the file size as it gets | |
6671 | * called from a page fault handler when a page is first dirtied. Hence we must | |
6672 | * be careful to check for EOF conditions here. We set the page up correctly | |
6673 | * for a written page which means we get ENOSPC checking when writing into | |
6674 | * holes and correct delalloc and unwritten extent mapping on filesystems that | |
6675 | * support these features. | |
6676 | * | |
6677 | * We are not allowed to take the i_mutex here so we have to play games to | |
6678 | * protect against truncate races as the page could now be beyond EOF. Because | |
6679 | * vmtruncate() writes the inode size before removing pages, once we have the | |
6680 | * page lock we can determine safely if the page is beyond EOF. If it is not | |
6681 | * beyond EOF, then the page is guaranteed safe against truncation until we | |
6682 | * unlock the page. | |
6683 | */ | |
c2ec175c | 6684 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf) |
9ebefb18 | 6685 | { |
c2ec175c | 6686 | struct page *page = vmf->page; |
6da6abae | 6687 | struct inode *inode = fdentry(vma->vm_file)->d_inode; |
1832a6d5 | 6688 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
6689 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
6690 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 6691 | struct extent_state *cached_state = NULL; |
e6dcd2dc CM |
6692 | char *kaddr; |
6693 | unsigned long zero_start; | |
9ebefb18 | 6694 | loff_t size; |
1832a6d5 | 6695 | int ret; |
9998eb70 | 6696 | int reserved = 0; |
a52d9a80 | 6697 | u64 page_start; |
e6dcd2dc | 6698 | u64 page_end; |
9ebefb18 | 6699 | |
b2b5ef5c | 6700 | sb_start_pagefault(inode->i_sb); |
0ca1f7ce | 6701 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); |
9998eb70 | 6702 | if (!ret) { |
e41f941a | 6703 | ret = file_update_time(vma->vm_file); |
9998eb70 CM |
6704 | reserved = 1; |
6705 | } | |
56a76f82 NP |
6706 | if (ret) { |
6707 | if (ret == -ENOMEM) | |
6708 | ret = VM_FAULT_OOM; | |
6709 | else /* -ENOSPC, -EIO, etc */ | |
6710 | ret = VM_FAULT_SIGBUS; | |
9998eb70 CM |
6711 | if (reserved) |
6712 | goto out; | |
6713 | goto out_noreserve; | |
56a76f82 | 6714 | } |
1832a6d5 | 6715 | |
56a76f82 | 6716 | ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */ |
e6dcd2dc | 6717 | again: |
9ebefb18 | 6718 | lock_page(page); |
9ebefb18 | 6719 | size = i_size_read(inode); |
e6dcd2dc CM |
6720 | page_start = page_offset(page); |
6721 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
a52d9a80 | 6722 | |
9ebefb18 | 6723 | if ((page->mapping != inode->i_mapping) || |
e6dcd2dc | 6724 | (page_start >= size)) { |
9ebefb18 CM |
6725 | /* page got truncated out from underneath us */ |
6726 | goto out_unlock; | |
6727 | } | |
e6dcd2dc CM |
6728 | wait_on_page_writeback(page); |
6729 | ||
d0082371 | 6730 | lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state); |
e6dcd2dc CM |
6731 | set_page_extent_mapped(page); |
6732 | ||
eb84ae03 CM |
6733 | /* |
6734 | * we can't set the delalloc bits if there are pending ordered | |
6735 | * extents. Drop our locks and wait for them to finish | |
6736 | */ | |
e6dcd2dc CM |
6737 | ordered = btrfs_lookup_ordered_extent(inode, page_start); |
6738 | if (ordered) { | |
2ac55d41 JB |
6739 | unlock_extent_cached(io_tree, page_start, page_end, |
6740 | &cached_state, GFP_NOFS); | |
e6dcd2dc | 6741 | unlock_page(page); |
eb84ae03 | 6742 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
6743 | btrfs_put_ordered_extent(ordered); |
6744 | goto again; | |
6745 | } | |
6746 | ||
fbf19087 JB |
6747 | /* |
6748 | * XXX - page_mkwrite gets called every time the page is dirtied, even | |
6749 | * if it was already dirty, so for space accounting reasons we need to | |
6750 | * clear any delalloc bits for the range we are fixing to save. There | |
6751 | * is probably a better way to do this, but for now keep consistent with | |
6752 | * prepare_pages in the normal write path. | |
6753 | */ | |
2ac55d41 | 6754 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end, |
9e8a4a8b LB |
6755 | EXTENT_DIRTY | EXTENT_DELALLOC | |
6756 | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, | |
2ac55d41 | 6757 | 0, 0, &cached_state, GFP_NOFS); |
fbf19087 | 6758 | |
2ac55d41 JB |
6759 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, |
6760 | &cached_state); | |
9ed74f2d | 6761 | if (ret) { |
2ac55d41 JB |
6762 | unlock_extent_cached(io_tree, page_start, page_end, |
6763 | &cached_state, GFP_NOFS); | |
9ed74f2d JB |
6764 | ret = VM_FAULT_SIGBUS; |
6765 | goto out_unlock; | |
6766 | } | |
e6dcd2dc | 6767 | ret = 0; |
9ebefb18 CM |
6768 | |
6769 | /* page is wholly or partially inside EOF */ | |
a52d9a80 | 6770 | if (page_start + PAGE_CACHE_SIZE > size) |
e6dcd2dc | 6771 | zero_start = size & ~PAGE_CACHE_MASK; |
9ebefb18 | 6772 | else |
e6dcd2dc | 6773 | zero_start = PAGE_CACHE_SIZE; |
9ebefb18 | 6774 | |
e6dcd2dc CM |
6775 | if (zero_start != PAGE_CACHE_SIZE) { |
6776 | kaddr = kmap(page); | |
6777 | memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start); | |
6778 | flush_dcache_page(page); | |
6779 | kunmap(page); | |
6780 | } | |
247e743c | 6781 | ClearPageChecked(page); |
e6dcd2dc | 6782 | set_page_dirty(page); |
50a9b214 | 6783 | SetPageUptodate(page); |
5a3f23d5 | 6784 | |
257c62e1 CM |
6785 | BTRFS_I(inode)->last_trans = root->fs_info->generation; |
6786 | BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid; | |
46d8bc34 | 6787 | BTRFS_I(inode)->last_log_commit = BTRFS_I(inode)->root->last_log_commit; |
257c62e1 | 6788 | |
2ac55d41 | 6789 | unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS); |
9ebefb18 CM |
6790 | |
6791 | out_unlock: | |
b2b5ef5c JK |
6792 | if (!ret) { |
6793 | sb_end_pagefault(inode->i_sb); | |
50a9b214 | 6794 | return VM_FAULT_LOCKED; |
b2b5ef5c | 6795 | } |
9ebefb18 | 6796 | unlock_page(page); |
1832a6d5 | 6797 | out: |
ec39e180 | 6798 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
9998eb70 | 6799 | out_noreserve: |
b2b5ef5c | 6800 | sb_end_pagefault(inode->i_sb); |
9ebefb18 CM |
6801 | return ret; |
6802 | } | |
6803 | ||
a41ad394 | 6804 | static int btrfs_truncate(struct inode *inode) |
39279cc3 CM |
6805 | { |
6806 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
fcb80c2a | 6807 | struct btrfs_block_rsv *rsv; |
39279cc3 | 6808 | int ret; |
3893e33b | 6809 | int err = 0; |
39279cc3 | 6810 | struct btrfs_trans_handle *trans; |
d3c2fdcf | 6811 | unsigned long nr; |
dbe674a9 | 6812 | u64 mask = root->sectorsize - 1; |
07127184 | 6813 | u64 min_size = btrfs_calc_trunc_metadata_size(root, 1); |
39279cc3 | 6814 | |
2aaa6655 | 6815 | ret = btrfs_truncate_page(inode, inode->i_size, 0, 0); |
5d5e103a | 6816 | if (ret) |
a41ad394 | 6817 | return ret; |
8082510e | 6818 | |
4a096752 | 6819 | btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1); |
8082510e | 6820 | btrfs_ordered_update_i_size(inode, inode->i_size, NULL); |
39279cc3 | 6821 | |
fcb80c2a JB |
6822 | /* |
6823 | * Yes ladies and gentelment, this is indeed ugly. The fact is we have | |
6824 | * 3 things going on here | |
6825 | * | |
6826 | * 1) We need to reserve space for our orphan item and the space to | |
6827 | * delete our orphan item. Lord knows we don't want to have a dangling | |
6828 | * orphan item because we didn't reserve space to remove it. | |
6829 | * | |
6830 | * 2) We need to reserve space to update our inode. | |
6831 | * | |
6832 | * 3) We need to have something to cache all the space that is going to | |
6833 | * be free'd up by the truncate operation, but also have some slack | |
6834 | * space reserved in case it uses space during the truncate (thank you | |
6835 | * very much snapshotting). | |
6836 | * | |
6837 | * And we need these to all be seperate. The fact is we can use alot of | |
6838 | * space doing the truncate, and we have no earthly idea how much space | |
6839 | * we will use, so we need the truncate reservation to be seperate so it | |
6840 | * doesn't end up using space reserved for updating the inode or | |
6841 | * removing the orphan item. We also need to be able to stop the | |
6842 | * transaction and start a new one, which means we need to be able to | |
6843 | * update the inode several times, and we have no idea of knowing how | |
6844 | * many times that will be, so we can't just reserve 1 item for the | |
6845 | * entirety of the opration, so that has to be done seperately as well. | |
6846 | * Then there is the orphan item, which does indeed need to be held on | |
6847 | * to for the whole operation, and we need nobody to touch this reserved | |
6848 | * space except the orphan code. | |
6849 | * | |
6850 | * So that leaves us with | |
6851 | * | |
6852 | * 1) root->orphan_block_rsv - for the orphan deletion. | |
6853 | * 2) rsv - for the truncate reservation, which we will steal from the | |
6854 | * transaction reservation. | |
6855 | * 3) fs_info->trans_block_rsv - this will have 1 items worth left for | |
6856 | * updating the inode. | |
6857 | */ | |
66d8f3dd | 6858 | rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP); |
fcb80c2a JB |
6859 | if (!rsv) |
6860 | return -ENOMEM; | |
4a338542 | 6861 | rsv->size = min_size; |
ca7e70f5 | 6862 | rsv->failfast = 1; |
f0cd846e | 6863 | |
907cbceb | 6864 | /* |
07127184 | 6865 | * 1 for the truncate slack space |
907cbceb JB |
6866 | * 1 for the orphan item we're going to add |
6867 | * 1 for the orphan item deletion | |
6868 | * 1 for updating the inode. | |
6869 | */ | |
fcb80c2a JB |
6870 | trans = btrfs_start_transaction(root, 4); |
6871 | if (IS_ERR(trans)) { | |
6872 | err = PTR_ERR(trans); | |
6873 | goto out; | |
6874 | } | |
f0cd846e | 6875 | |
907cbceb JB |
6876 | /* Migrate the slack space for the truncate to our reserve */ |
6877 | ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, rsv, | |
6878 | min_size); | |
fcb80c2a | 6879 | BUG_ON(ret); |
f0cd846e JB |
6880 | |
6881 | ret = btrfs_orphan_add(trans, inode); | |
6882 | if (ret) { | |
6883 | btrfs_end_transaction(trans, root); | |
fcb80c2a | 6884 | goto out; |
f0cd846e JB |
6885 | } |
6886 | ||
5a3f23d5 CM |
6887 | /* |
6888 | * setattr is responsible for setting the ordered_data_close flag, | |
6889 | * but that is only tested during the last file release. That | |
6890 | * could happen well after the next commit, leaving a great big | |
6891 | * window where new writes may get lost if someone chooses to write | |
6892 | * to this file after truncating to zero | |
6893 | * | |
6894 | * The inode doesn't have any dirty data here, and so if we commit | |
6895 | * this is a noop. If someone immediately starts writing to the inode | |
6896 | * it is very likely we'll catch some of their writes in this | |
6897 | * transaction, and the commit will find this file on the ordered | |
6898 | * data list with good things to send down. | |
6899 | * | |
6900 | * This is a best effort solution, there is still a window where | |
6901 | * using truncate to replace the contents of the file will | |
6902 | * end up with a zero length file after a crash. | |
6903 | */ | |
72ac3c0d JB |
6904 | if (inode->i_size == 0 && test_bit(BTRFS_INODE_ORDERED_DATA_CLOSE, |
6905 | &BTRFS_I(inode)->runtime_flags)) | |
5a3f23d5 CM |
6906 | btrfs_add_ordered_operation(trans, root, inode); |
6907 | ||
5dc562c5 JB |
6908 | /* |
6909 | * So if we truncate and then write and fsync we normally would just | |
6910 | * write the extents that changed, which is a problem if we need to | |
6911 | * first truncate that entire inode. So set this flag so we write out | |
6912 | * all of the extents in the inode to the sync log so we're completely | |
6913 | * safe. | |
6914 | */ | |
6915 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags); | |
ca7e70f5 | 6916 | trans->block_rsv = rsv; |
5dc562c5 | 6917 | |
8082510e YZ |
6918 | while (1) { |
6919 | ret = btrfs_truncate_inode_items(trans, root, inode, | |
6920 | inode->i_size, | |
6921 | BTRFS_EXTENT_DATA_KEY); | |
ca7e70f5 | 6922 | if (ret != -ENOSPC) { |
3893e33b | 6923 | err = ret; |
8082510e | 6924 | break; |
3893e33b | 6925 | } |
39279cc3 | 6926 | |
fcb80c2a | 6927 | trans->block_rsv = &root->fs_info->trans_block_rsv; |
8082510e | 6928 | ret = btrfs_update_inode(trans, root, inode); |
3893e33b JB |
6929 | if (ret) { |
6930 | err = ret; | |
6931 | break; | |
6932 | } | |
ca7e70f5 | 6933 | |
8082510e YZ |
6934 | nr = trans->blocks_used; |
6935 | btrfs_end_transaction(trans, root); | |
6936 | btrfs_btree_balance_dirty(root, nr); | |
ca7e70f5 JB |
6937 | |
6938 | trans = btrfs_start_transaction(root, 2); | |
6939 | if (IS_ERR(trans)) { | |
6940 | ret = err = PTR_ERR(trans); | |
6941 | trans = NULL; | |
6942 | break; | |
6943 | } | |
6944 | ||
6945 | ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, | |
6946 | rsv, min_size); | |
6947 | BUG_ON(ret); /* shouldn't happen */ | |
6948 | trans->block_rsv = rsv; | |
8082510e YZ |
6949 | } |
6950 | ||
6951 | if (ret == 0 && inode->i_nlink > 0) { | |
fcb80c2a | 6952 | trans->block_rsv = root->orphan_block_rsv; |
8082510e | 6953 | ret = btrfs_orphan_del(trans, inode); |
3893e33b JB |
6954 | if (ret) |
6955 | err = ret; | |
ded5db9d JB |
6956 | } else if (ret && inode->i_nlink > 0) { |
6957 | /* | |
6958 | * Failed to do the truncate, remove us from the in memory | |
6959 | * orphan list. | |
6960 | */ | |
6961 | ret = btrfs_orphan_del(NULL, inode); | |
8082510e YZ |
6962 | } |
6963 | ||
917c16b2 CM |
6964 | if (trans) { |
6965 | trans->block_rsv = &root->fs_info->trans_block_rsv; | |
6966 | ret = btrfs_update_inode(trans, root, inode); | |
6967 | if (ret && !err) | |
6968 | err = ret; | |
7b128766 | 6969 | |
917c16b2 | 6970 | nr = trans->blocks_used; |
7ad85bb7 | 6971 | ret = btrfs_end_transaction(trans, root); |
917c16b2 CM |
6972 | btrfs_btree_balance_dirty(root, nr); |
6973 | } | |
fcb80c2a JB |
6974 | |
6975 | out: | |
6976 | btrfs_free_block_rsv(root, rsv); | |
6977 | ||
3893e33b JB |
6978 | if (ret && !err) |
6979 | err = ret; | |
a41ad394 | 6980 | |
3893e33b | 6981 | return err; |
39279cc3 CM |
6982 | } |
6983 | ||
d352ac68 CM |
6984 | /* |
6985 | * create a new subvolume directory/inode (helper for the ioctl). | |
6986 | */ | |
d2fb3437 | 6987 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, |
d82a6f1d | 6988 | struct btrfs_root *new_root, u64 new_dirid) |
39279cc3 | 6989 | { |
39279cc3 | 6990 | struct inode *inode; |
76dda93c | 6991 | int err; |
00e4e6b3 | 6992 | u64 index = 0; |
39279cc3 | 6993 | |
12fc9d09 FA |
6994 | inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, |
6995 | new_dirid, new_dirid, | |
6996 | S_IFDIR | (~current_umask() & S_IRWXUGO), | |
6997 | &index); | |
54aa1f4d | 6998 | if (IS_ERR(inode)) |
f46b5a66 | 6999 | return PTR_ERR(inode); |
39279cc3 CM |
7000 | inode->i_op = &btrfs_dir_inode_operations; |
7001 | inode->i_fop = &btrfs_dir_file_operations; | |
7002 | ||
bfe86848 | 7003 | set_nlink(inode, 1); |
dbe674a9 | 7004 | btrfs_i_size_write(inode, 0); |
3b96362c | 7005 | |
76dda93c | 7006 | err = btrfs_update_inode(trans, new_root, inode); |
cb8e7090 | 7007 | |
76dda93c | 7008 | iput(inode); |
ce598979 | 7009 | return err; |
39279cc3 CM |
7010 | } |
7011 | ||
39279cc3 CM |
7012 | struct inode *btrfs_alloc_inode(struct super_block *sb) |
7013 | { | |
7014 | struct btrfs_inode *ei; | |
2ead6ae7 | 7015 | struct inode *inode; |
39279cc3 CM |
7016 | |
7017 | ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS); | |
7018 | if (!ei) | |
7019 | return NULL; | |
2ead6ae7 YZ |
7020 | |
7021 | ei->root = NULL; | |
2ead6ae7 | 7022 | ei->generation = 0; |
15ee9bc7 | 7023 | ei->last_trans = 0; |
257c62e1 | 7024 | ei->last_sub_trans = 0; |
e02119d5 | 7025 | ei->logged_trans = 0; |
2ead6ae7 | 7026 | ei->delalloc_bytes = 0; |
2ead6ae7 YZ |
7027 | ei->disk_i_size = 0; |
7028 | ei->flags = 0; | |
7709cde3 | 7029 | ei->csum_bytes = 0; |
2ead6ae7 YZ |
7030 | ei->index_cnt = (u64)-1; |
7031 | ei->last_unlink_trans = 0; | |
46d8bc34 | 7032 | ei->last_log_commit = 0; |
2ead6ae7 | 7033 | |
9e0baf60 JB |
7034 | spin_lock_init(&ei->lock); |
7035 | ei->outstanding_extents = 0; | |
7036 | ei->reserved_extents = 0; | |
2ead6ae7 | 7037 | |
72ac3c0d | 7038 | ei->runtime_flags = 0; |
261507a0 | 7039 | ei->force_compress = BTRFS_COMPRESS_NONE; |
2ead6ae7 | 7040 | |
16cdcec7 MX |
7041 | ei->delayed_node = NULL; |
7042 | ||
2ead6ae7 | 7043 | inode = &ei->vfs_inode; |
a8067e02 | 7044 | extent_map_tree_init(&ei->extent_tree); |
f993c883 DS |
7045 | extent_io_tree_init(&ei->io_tree, &inode->i_data); |
7046 | extent_io_tree_init(&ei->io_failure_tree, &inode->i_data); | |
0b32f4bb JB |
7047 | ei->io_tree.track_uptodate = 1; |
7048 | ei->io_failure_tree.track_uptodate = 1; | |
2ead6ae7 | 7049 | mutex_init(&ei->log_mutex); |
f248679e | 7050 | mutex_init(&ei->delalloc_mutex); |
e6dcd2dc | 7051 | btrfs_ordered_inode_tree_init(&ei->ordered_tree); |
2ead6ae7 | 7052 | INIT_LIST_HEAD(&ei->delalloc_inodes); |
5a3f23d5 | 7053 | INIT_LIST_HEAD(&ei->ordered_operations); |
2ead6ae7 YZ |
7054 | RB_CLEAR_NODE(&ei->rb_node); |
7055 | ||
7056 | return inode; | |
39279cc3 CM |
7057 | } |
7058 | ||
fa0d7e3d NP |
7059 | static void btrfs_i_callback(struct rcu_head *head) |
7060 | { | |
7061 | struct inode *inode = container_of(head, struct inode, i_rcu); | |
fa0d7e3d NP |
7062 | kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode)); |
7063 | } | |
7064 | ||
39279cc3 CM |
7065 | void btrfs_destroy_inode(struct inode *inode) |
7066 | { | |
e6dcd2dc | 7067 | struct btrfs_ordered_extent *ordered; |
5a3f23d5 CM |
7068 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7069 | ||
b3d9b7a3 | 7070 | WARN_ON(!hlist_empty(&inode->i_dentry)); |
39279cc3 | 7071 | WARN_ON(inode->i_data.nrpages); |
9e0baf60 JB |
7072 | WARN_ON(BTRFS_I(inode)->outstanding_extents); |
7073 | WARN_ON(BTRFS_I(inode)->reserved_extents); | |
7709cde3 JB |
7074 | WARN_ON(BTRFS_I(inode)->delalloc_bytes); |
7075 | WARN_ON(BTRFS_I(inode)->csum_bytes); | |
39279cc3 | 7076 | |
a6dbd429 JB |
7077 | /* |
7078 | * This can happen where we create an inode, but somebody else also | |
7079 | * created the same inode and we need to destroy the one we already | |
7080 | * created. | |
7081 | */ | |
7082 | if (!root) | |
7083 | goto free; | |
7084 | ||
5a3f23d5 CM |
7085 | /* |
7086 | * Make sure we're properly removed from the ordered operation | |
7087 | * lists. | |
7088 | */ | |
7089 | smp_mb(); | |
7090 | if (!list_empty(&BTRFS_I(inode)->ordered_operations)) { | |
7091 | spin_lock(&root->fs_info->ordered_extent_lock); | |
7092 | list_del_init(&BTRFS_I(inode)->ordered_operations); | |
7093 | spin_unlock(&root->fs_info->ordered_extent_lock); | |
7094 | } | |
7095 | ||
8a35d95f JB |
7096 | if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM, |
7097 | &BTRFS_I(inode)->runtime_flags)) { | |
33345d01 LZ |
7098 | printk(KERN_INFO "BTRFS: inode %llu still on the orphan list\n", |
7099 | (unsigned long long)btrfs_ino(inode)); | |
8a35d95f | 7100 | atomic_dec(&root->orphan_inodes); |
7b128766 | 7101 | } |
7b128766 | 7102 | |
d397712b | 7103 | while (1) { |
e6dcd2dc CM |
7104 | ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1); |
7105 | if (!ordered) | |
7106 | break; | |
7107 | else { | |
d397712b CM |
7108 | printk(KERN_ERR "btrfs found ordered " |
7109 | "extent %llu %llu on inode cleanup\n", | |
7110 | (unsigned long long)ordered->file_offset, | |
7111 | (unsigned long long)ordered->len); | |
e6dcd2dc CM |
7112 | btrfs_remove_ordered_extent(inode, ordered); |
7113 | btrfs_put_ordered_extent(ordered); | |
7114 | btrfs_put_ordered_extent(ordered); | |
7115 | } | |
7116 | } | |
5d4f98a2 | 7117 | inode_tree_del(inode); |
5b21f2ed | 7118 | btrfs_drop_extent_cache(inode, 0, (u64)-1, 0); |
a6dbd429 | 7119 | free: |
16cdcec7 | 7120 | btrfs_remove_delayed_node(inode); |
fa0d7e3d | 7121 | call_rcu(&inode->i_rcu, btrfs_i_callback); |
39279cc3 CM |
7122 | } |
7123 | ||
45321ac5 | 7124 | int btrfs_drop_inode(struct inode *inode) |
76dda93c YZ |
7125 | { |
7126 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
45321ac5 | 7127 | |
0af3d00b | 7128 | if (btrfs_root_refs(&root->root_item) == 0 && |
83eea1f1 | 7129 | !btrfs_is_free_space_inode(inode)) |
45321ac5 | 7130 | return 1; |
76dda93c | 7131 | else |
45321ac5 | 7132 | return generic_drop_inode(inode); |
76dda93c YZ |
7133 | } |
7134 | ||
0ee0fda0 | 7135 | static void init_once(void *foo) |
39279cc3 CM |
7136 | { |
7137 | struct btrfs_inode *ei = (struct btrfs_inode *) foo; | |
7138 | ||
7139 | inode_init_once(&ei->vfs_inode); | |
7140 | } | |
7141 | ||
7142 | void btrfs_destroy_cachep(void) | |
7143 | { | |
7144 | if (btrfs_inode_cachep) | |
7145 | kmem_cache_destroy(btrfs_inode_cachep); | |
7146 | if (btrfs_trans_handle_cachep) | |
7147 | kmem_cache_destroy(btrfs_trans_handle_cachep); | |
7148 | if (btrfs_transaction_cachep) | |
7149 | kmem_cache_destroy(btrfs_transaction_cachep); | |
39279cc3 CM |
7150 | if (btrfs_path_cachep) |
7151 | kmem_cache_destroy(btrfs_path_cachep); | |
dc89e982 JB |
7152 | if (btrfs_free_space_cachep) |
7153 | kmem_cache_destroy(btrfs_free_space_cachep); | |
39279cc3 CM |
7154 | } |
7155 | ||
7156 | int btrfs_init_cachep(void) | |
7157 | { | |
837e1972 | 7158 | btrfs_inode_cachep = kmem_cache_create("btrfs_inode", |
9601e3f6 CH |
7159 | sizeof(struct btrfs_inode), 0, |
7160 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once); | |
39279cc3 CM |
7161 | if (!btrfs_inode_cachep) |
7162 | goto fail; | |
9601e3f6 | 7163 | |
837e1972 | 7164 | btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle", |
9601e3f6 CH |
7165 | sizeof(struct btrfs_trans_handle), 0, |
7166 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
7167 | if (!btrfs_trans_handle_cachep) |
7168 | goto fail; | |
9601e3f6 | 7169 | |
837e1972 | 7170 | btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction", |
9601e3f6 CH |
7171 | sizeof(struct btrfs_transaction), 0, |
7172 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
7173 | if (!btrfs_transaction_cachep) |
7174 | goto fail; | |
9601e3f6 | 7175 | |
837e1972 | 7176 | btrfs_path_cachep = kmem_cache_create("btrfs_path", |
9601e3f6 CH |
7177 | sizeof(struct btrfs_path), 0, |
7178 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
7179 | if (!btrfs_path_cachep) |
7180 | goto fail; | |
9601e3f6 | 7181 | |
837e1972 | 7182 | btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space", |
dc89e982 JB |
7183 | sizeof(struct btrfs_free_space), 0, |
7184 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
7185 | if (!btrfs_free_space_cachep) | |
7186 | goto fail; | |
7187 | ||
39279cc3 CM |
7188 | return 0; |
7189 | fail: | |
7190 | btrfs_destroy_cachep(); | |
7191 | return -ENOMEM; | |
7192 | } | |
7193 | ||
7194 | static int btrfs_getattr(struct vfsmount *mnt, | |
7195 | struct dentry *dentry, struct kstat *stat) | |
7196 | { | |
7197 | struct inode *inode = dentry->d_inode; | |
fadc0d8b DS |
7198 | u32 blocksize = inode->i_sb->s_blocksize; |
7199 | ||
39279cc3 | 7200 | generic_fillattr(inode, stat); |
0ee5dc67 | 7201 | stat->dev = BTRFS_I(inode)->root->anon_dev; |
d6667462 | 7202 | stat->blksize = PAGE_CACHE_SIZE; |
fadc0d8b DS |
7203 | stat->blocks = (ALIGN(inode_get_bytes(inode), blocksize) + |
7204 | ALIGN(BTRFS_I(inode)->delalloc_bytes, blocksize)) >> 9; | |
39279cc3 CM |
7205 | return 0; |
7206 | } | |
7207 | ||
75e7cb7f LB |
7208 | /* |
7209 | * If a file is moved, it will inherit the cow and compression flags of the new | |
7210 | * directory. | |
7211 | */ | |
7212 | static void fixup_inode_flags(struct inode *dir, struct inode *inode) | |
7213 | { | |
7214 | struct btrfs_inode *b_dir = BTRFS_I(dir); | |
7215 | struct btrfs_inode *b_inode = BTRFS_I(inode); | |
7216 | ||
7217 | if (b_dir->flags & BTRFS_INODE_NODATACOW) | |
7218 | b_inode->flags |= BTRFS_INODE_NODATACOW; | |
7219 | else | |
7220 | b_inode->flags &= ~BTRFS_INODE_NODATACOW; | |
7221 | ||
bc178237 | 7222 | if (b_dir->flags & BTRFS_INODE_COMPRESS) { |
75e7cb7f | 7223 | b_inode->flags |= BTRFS_INODE_COMPRESS; |
bc178237 LB |
7224 | b_inode->flags &= ~BTRFS_INODE_NOCOMPRESS; |
7225 | } else { | |
7226 | b_inode->flags &= ~(BTRFS_INODE_COMPRESS | | |
7227 | BTRFS_INODE_NOCOMPRESS); | |
7228 | } | |
75e7cb7f LB |
7229 | } |
7230 | ||
d397712b CM |
7231 | static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry, |
7232 | struct inode *new_dir, struct dentry *new_dentry) | |
39279cc3 CM |
7233 | { |
7234 | struct btrfs_trans_handle *trans; | |
7235 | struct btrfs_root *root = BTRFS_I(old_dir)->root; | |
4df27c4d | 7236 | struct btrfs_root *dest = BTRFS_I(new_dir)->root; |
39279cc3 CM |
7237 | struct inode *new_inode = new_dentry->d_inode; |
7238 | struct inode *old_inode = old_dentry->d_inode; | |
7239 | struct timespec ctime = CURRENT_TIME; | |
00e4e6b3 | 7240 | u64 index = 0; |
4df27c4d | 7241 | u64 root_objectid; |
39279cc3 | 7242 | int ret; |
33345d01 | 7243 | u64 old_ino = btrfs_ino(old_inode); |
39279cc3 | 7244 | |
33345d01 | 7245 | if (btrfs_ino(new_dir) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
f679a840 YZ |
7246 | return -EPERM; |
7247 | ||
4df27c4d | 7248 | /* we only allow rename subvolume link between subvolumes */ |
33345d01 | 7249 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest) |
3394e160 CM |
7250 | return -EXDEV; |
7251 | ||
33345d01 LZ |
7252 | if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID || |
7253 | (new_inode && btrfs_ino(new_inode) == BTRFS_FIRST_FREE_OBJECTID)) | |
39279cc3 | 7254 | return -ENOTEMPTY; |
5f39d397 | 7255 | |
4df27c4d YZ |
7256 | if (S_ISDIR(old_inode->i_mode) && new_inode && |
7257 | new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) | |
7258 | return -ENOTEMPTY; | |
5a3f23d5 CM |
7259 | /* |
7260 | * we're using rename to replace one file with another. | |
7261 | * and the replacement file is large. Start IO on it now so | |
7262 | * we don't add too much work to the end of the transaction | |
7263 | */ | |
4baf8c92 | 7264 | if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size && |
5a3f23d5 CM |
7265 | old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) |
7266 | filemap_flush(old_inode->i_mapping); | |
7267 | ||
76dda93c | 7268 | /* close the racy window with snapshot create/destroy ioctl */ |
33345d01 | 7269 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) |
76dda93c | 7270 | down_read(&root->fs_info->subvol_sem); |
a22285a6 YZ |
7271 | /* |
7272 | * We want to reserve the absolute worst case amount of items. So if | |
7273 | * both inodes are subvols and we need to unlink them then that would | |
7274 | * require 4 item modifications, but if they are both normal inodes it | |
7275 | * would require 5 item modifications, so we'll assume their normal | |
7276 | * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items | |
7277 | * should cover the worst case number of items we'll modify. | |
7278 | */ | |
7279 | trans = btrfs_start_transaction(root, 20); | |
b44c59a8 JL |
7280 | if (IS_ERR(trans)) { |
7281 | ret = PTR_ERR(trans); | |
7282 | goto out_notrans; | |
7283 | } | |
76dda93c | 7284 | |
4df27c4d YZ |
7285 | if (dest != root) |
7286 | btrfs_record_root_in_trans(trans, dest); | |
5f39d397 | 7287 | |
a5719521 YZ |
7288 | ret = btrfs_set_inode_index(new_dir, &index); |
7289 | if (ret) | |
7290 | goto out_fail; | |
5a3f23d5 | 7291 | |
33345d01 | 7292 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
7293 | /* force full log commit if subvolume involved. */ |
7294 | root->fs_info->last_trans_log_full_commit = trans->transid; | |
7295 | } else { | |
a5719521 YZ |
7296 | ret = btrfs_insert_inode_ref(trans, dest, |
7297 | new_dentry->d_name.name, | |
7298 | new_dentry->d_name.len, | |
33345d01 LZ |
7299 | old_ino, |
7300 | btrfs_ino(new_dir), index); | |
a5719521 YZ |
7301 | if (ret) |
7302 | goto out_fail; | |
4df27c4d YZ |
7303 | /* |
7304 | * this is an ugly little race, but the rename is required | |
7305 | * to make sure that if we crash, the inode is either at the | |
7306 | * old name or the new one. pinning the log transaction lets | |
7307 | * us make sure we don't allow a log commit to come in after | |
7308 | * we unlink the name but before we add the new name back in. | |
7309 | */ | |
7310 | btrfs_pin_log_trans(root); | |
7311 | } | |
5a3f23d5 CM |
7312 | /* |
7313 | * make sure the inode gets flushed if it is replacing | |
7314 | * something. | |
7315 | */ | |
33345d01 | 7316 | if (new_inode && new_inode->i_size && S_ISREG(old_inode->i_mode)) |
5a3f23d5 | 7317 | btrfs_add_ordered_operation(trans, root, old_inode); |
5a3f23d5 | 7318 | |
0c4d2d95 JB |
7319 | inode_inc_iversion(old_dir); |
7320 | inode_inc_iversion(new_dir); | |
7321 | inode_inc_iversion(old_inode); | |
39279cc3 CM |
7322 | old_dir->i_ctime = old_dir->i_mtime = ctime; |
7323 | new_dir->i_ctime = new_dir->i_mtime = ctime; | |
7324 | old_inode->i_ctime = ctime; | |
5f39d397 | 7325 | |
12fcfd22 CM |
7326 | if (old_dentry->d_parent != new_dentry->d_parent) |
7327 | btrfs_record_unlink_dir(trans, old_dir, old_inode, 1); | |
7328 | ||
33345d01 | 7329 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
7330 | root_objectid = BTRFS_I(old_inode)->root->root_key.objectid; |
7331 | ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid, | |
7332 | old_dentry->d_name.name, | |
7333 | old_dentry->d_name.len); | |
7334 | } else { | |
92986796 AV |
7335 | ret = __btrfs_unlink_inode(trans, root, old_dir, |
7336 | old_dentry->d_inode, | |
7337 | old_dentry->d_name.name, | |
7338 | old_dentry->d_name.len); | |
7339 | if (!ret) | |
7340 | ret = btrfs_update_inode(trans, root, old_inode); | |
4df27c4d | 7341 | } |
79787eaa JM |
7342 | if (ret) { |
7343 | btrfs_abort_transaction(trans, root, ret); | |
7344 | goto out_fail; | |
7345 | } | |
39279cc3 CM |
7346 | |
7347 | if (new_inode) { | |
0c4d2d95 | 7348 | inode_inc_iversion(new_inode); |
39279cc3 | 7349 | new_inode->i_ctime = CURRENT_TIME; |
33345d01 | 7350 | if (unlikely(btrfs_ino(new_inode) == |
4df27c4d YZ |
7351 | BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
7352 | root_objectid = BTRFS_I(new_inode)->location.objectid; | |
7353 | ret = btrfs_unlink_subvol(trans, dest, new_dir, | |
7354 | root_objectid, | |
7355 | new_dentry->d_name.name, | |
7356 | new_dentry->d_name.len); | |
7357 | BUG_ON(new_inode->i_nlink == 0); | |
7358 | } else { | |
7359 | ret = btrfs_unlink_inode(trans, dest, new_dir, | |
7360 | new_dentry->d_inode, | |
7361 | new_dentry->d_name.name, | |
7362 | new_dentry->d_name.len); | |
7363 | } | |
79787eaa | 7364 | if (!ret && new_inode->i_nlink == 0) { |
e02119d5 | 7365 | ret = btrfs_orphan_add(trans, new_dentry->d_inode); |
4df27c4d | 7366 | BUG_ON(ret); |
7b128766 | 7367 | } |
79787eaa JM |
7368 | if (ret) { |
7369 | btrfs_abort_transaction(trans, root, ret); | |
7370 | goto out_fail; | |
7371 | } | |
39279cc3 | 7372 | } |
aec7477b | 7373 | |
75e7cb7f LB |
7374 | fixup_inode_flags(new_dir, old_inode); |
7375 | ||
4df27c4d YZ |
7376 | ret = btrfs_add_link(trans, new_dir, old_inode, |
7377 | new_dentry->d_name.name, | |
a5719521 | 7378 | new_dentry->d_name.len, 0, index); |
79787eaa JM |
7379 | if (ret) { |
7380 | btrfs_abort_transaction(trans, root, ret); | |
7381 | goto out_fail; | |
7382 | } | |
39279cc3 | 7383 | |
33345d01 | 7384 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) { |
10d9f309 | 7385 | struct dentry *parent = new_dentry->d_parent; |
6a912213 | 7386 | btrfs_log_new_name(trans, old_inode, old_dir, parent); |
4df27c4d YZ |
7387 | btrfs_end_log_trans(root); |
7388 | } | |
39279cc3 | 7389 | out_fail: |
7ad85bb7 | 7390 | btrfs_end_transaction(trans, root); |
b44c59a8 | 7391 | out_notrans: |
33345d01 | 7392 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) |
76dda93c | 7393 | up_read(&root->fs_info->subvol_sem); |
9ed74f2d | 7394 | |
39279cc3 CM |
7395 | return ret; |
7396 | } | |
7397 | ||
d352ac68 CM |
7398 | /* |
7399 | * some fairly slow code that needs optimization. This walks the list | |
7400 | * of all the inodes with pending delalloc and forces them to disk. | |
7401 | */ | |
24bbcf04 | 7402 | int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput) |
ea8c2819 CM |
7403 | { |
7404 | struct list_head *head = &root->fs_info->delalloc_inodes; | |
7405 | struct btrfs_inode *binode; | |
5b21f2ed | 7406 | struct inode *inode; |
ea8c2819 | 7407 | |
c146afad YZ |
7408 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
7409 | return -EROFS; | |
7410 | ||
75eff68e | 7411 | spin_lock(&root->fs_info->delalloc_lock); |
d397712b | 7412 | while (!list_empty(head)) { |
ea8c2819 CM |
7413 | binode = list_entry(head->next, struct btrfs_inode, |
7414 | delalloc_inodes); | |
5b21f2ed ZY |
7415 | inode = igrab(&binode->vfs_inode); |
7416 | if (!inode) | |
7417 | list_del_init(&binode->delalloc_inodes); | |
75eff68e | 7418 | spin_unlock(&root->fs_info->delalloc_lock); |
5b21f2ed | 7419 | if (inode) { |
8c8bee1d | 7420 | filemap_flush(inode->i_mapping); |
24bbcf04 YZ |
7421 | if (delay_iput) |
7422 | btrfs_add_delayed_iput(inode); | |
7423 | else | |
7424 | iput(inode); | |
5b21f2ed ZY |
7425 | } |
7426 | cond_resched(); | |
75eff68e | 7427 | spin_lock(&root->fs_info->delalloc_lock); |
ea8c2819 | 7428 | } |
75eff68e | 7429 | spin_unlock(&root->fs_info->delalloc_lock); |
8c8bee1d CM |
7430 | |
7431 | /* the filemap_flush will queue IO into the worker threads, but | |
7432 | * we have to make sure the IO is actually started and that | |
7433 | * ordered extents get created before we return | |
7434 | */ | |
7435 | atomic_inc(&root->fs_info->async_submit_draining); | |
d397712b | 7436 | while (atomic_read(&root->fs_info->nr_async_submits) || |
771ed689 | 7437 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
8c8bee1d | 7438 | wait_event(root->fs_info->async_submit_wait, |
771ed689 CM |
7439 | (atomic_read(&root->fs_info->nr_async_submits) == 0 && |
7440 | atomic_read(&root->fs_info->async_delalloc_pages) == 0)); | |
8c8bee1d CM |
7441 | } |
7442 | atomic_dec(&root->fs_info->async_submit_draining); | |
ea8c2819 CM |
7443 | return 0; |
7444 | } | |
7445 | ||
39279cc3 CM |
7446 | static int btrfs_symlink(struct inode *dir, struct dentry *dentry, |
7447 | const char *symname) | |
7448 | { | |
7449 | struct btrfs_trans_handle *trans; | |
7450 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
7451 | struct btrfs_path *path; | |
7452 | struct btrfs_key key; | |
1832a6d5 | 7453 | struct inode *inode = NULL; |
39279cc3 CM |
7454 | int err; |
7455 | int drop_inode = 0; | |
7456 | u64 objectid; | |
00e4e6b3 | 7457 | u64 index = 0 ; |
39279cc3 CM |
7458 | int name_len; |
7459 | int datasize; | |
5f39d397 | 7460 | unsigned long ptr; |
39279cc3 | 7461 | struct btrfs_file_extent_item *ei; |
5f39d397 | 7462 | struct extent_buffer *leaf; |
1832a6d5 | 7463 | unsigned long nr = 0; |
39279cc3 CM |
7464 | |
7465 | name_len = strlen(symname) + 1; | |
7466 | if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root)) | |
7467 | return -ENAMETOOLONG; | |
1832a6d5 | 7468 | |
9ed74f2d JB |
7469 | /* |
7470 | * 2 items for inode item and ref | |
7471 | * 2 items for dir items | |
7472 | * 1 item for xattr if selinux is on | |
7473 | */ | |
a22285a6 YZ |
7474 | trans = btrfs_start_transaction(root, 5); |
7475 | if (IS_ERR(trans)) | |
7476 | return PTR_ERR(trans); | |
1832a6d5 | 7477 | |
581bb050 LZ |
7478 | err = btrfs_find_free_ino(root, &objectid); |
7479 | if (err) | |
7480 | goto out_unlock; | |
7481 | ||
aec7477b | 7482 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 7483 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 7484 | S_IFLNK|S_IRWXUGO, &index); |
7cf96da3 TI |
7485 | if (IS_ERR(inode)) { |
7486 | err = PTR_ERR(inode); | |
39279cc3 | 7487 | goto out_unlock; |
7cf96da3 | 7488 | } |
39279cc3 | 7489 | |
2a7dba39 | 7490 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
7491 | if (err) { |
7492 | drop_inode = 1; | |
7493 | goto out_unlock; | |
7494 | } | |
7495 | ||
ad19db71 CS |
7496 | /* |
7497 | * If the active LSM wants to access the inode during | |
7498 | * d_instantiate it needs these. Smack checks to see | |
7499 | * if the filesystem supports xattrs by looking at the | |
7500 | * ops vector. | |
7501 | */ | |
7502 | inode->i_fop = &btrfs_file_operations; | |
7503 | inode->i_op = &btrfs_file_inode_operations; | |
7504 | ||
a1b075d2 | 7505 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
39279cc3 CM |
7506 | if (err) |
7507 | drop_inode = 1; | |
7508 | else { | |
7509 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 7510 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d1310b2e | 7511 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 | 7512 | } |
39279cc3 CM |
7513 | if (drop_inode) |
7514 | goto out_unlock; | |
7515 | ||
7516 | path = btrfs_alloc_path(); | |
d8926bb3 MF |
7517 | if (!path) { |
7518 | err = -ENOMEM; | |
7519 | drop_inode = 1; | |
7520 | goto out_unlock; | |
7521 | } | |
33345d01 | 7522 | key.objectid = btrfs_ino(inode); |
39279cc3 | 7523 | key.offset = 0; |
39279cc3 CM |
7524 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); |
7525 | datasize = btrfs_file_extent_calc_inline_size(name_len); | |
7526 | err = btrfs_insert_empty_item(trans, root, path, &key, | |
7527 | datasize); | |
54aa1f4d CM |
7528 | if (err) { |
7529 | drop_inode = 1; | |
b0839166 | 7530 | btrfs_free_path(path); |
54aa1f4d CM |
7531 | goto out_unlock; |
7532 | } | |
5f39d397 CM |
7533 | leaf = path->nodes[0]; |
7534 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
7535 | struct btrfs_file_extent_item); | |
7536 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
7537 | btrfs_set_file_extent_type(leaf, ei, | |
39279cc3 | 7538 | BTRFS_FILE_EXTENT_INLINE); |
c8b97818 CM |
7539 | btrfs_set_file_extent_encryption(leaf, ei, 0); |
7540 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
7541 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
7542 | btrfs_set_file_extent_ram_bytes(leaf, ei, name_len); | |
7543 | ||
39279cc3 | 7544 | ptr = btrfs_file_extent_inline_start(ei); |
5f39d397 CM |
7545 | write_extent_buffer(leaf, symname, ptr, name_len); |
7546 | btrfs_mark_buffer_dirty(leaf); | |
39279cc3 | 7547 | btrfs_free_path(path); |
5f39d397 | 7548 | |
39279cc3 CM |
7549 | inode->i_op = &btrfs_symlink_inode_operations; |
7550 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 7551 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d899e052 | 7552 | inode_set_bytes(inode, name_len); |
dbe674a9 | 7553 | btrfs_i_size_write(inode, name_len - 1); |
54aa1f4d CM |
7554 | err = btrfs_update_inode(trans, root, inode); |
7555 | if (err) | |
7556 | drop_inode = 1; | |
39279cc3 CM |
7557 | |
7558 | out_unlock: | |
08c422c2 AV |
7559 | if (!err) |
7560 | d_instantiate(dentry, inode); | |
d3c2fdcf | 7561 | nr = trans->blocks_used; |
7ad85bb7 | 7562 | btrfs_end_transaction(trans, root); |
39279cc3 CM |
7563 | if (drop_inode) { |
7564 | inode_dec_link_count(inode); | |
7565 | iput(inode); | |
7566 | } | |
d3c2fdcf | 7567 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
7568 | return err; |
7569 | } | |
16432985 | 7570 | |
0af3d00b JB |
7571 | static int __btrfs_prealloc_file_range(struct inode *inode, int mode, |
7572 | u64 start, u64 num_bytes, u64 min_size, | |
7573 | loff_t actual_len, u64 *alloc_hint, | |
7574 | struct btrfs_trans_handle *trans) | |
d899e052 | 7575 | { |
5dc562c5 JB |
7576 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
7577 | struct extent_map *em; | |
d899e052 YZ |
7578 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7579 | struct btrfs_key ins; | |
d899e052 | 7580 | u64 cur_offset = start; |
55a61d1d | 7581 | u64 i_size; |
d899e052 | 7582 | int ret = 0; |
0af3d00b | 7583 | bool own_trans = true; |
d899e052 | 7584 | |
0af3d00b JB |
7585 | if (trans) |
7586 | own_trans = false; | |
d899e052 | 7587 | while (num_bytes > 0) { |
0af3d00b JB |
7588 | if (own_trans) { |
7589 | trans = btrfs_start_transaction(root, 3); | |
7590 | if (IS_ERR(trans)) { | |
7591 | ret = PTR_ERR(trans); | |
7592 | break; | |
7593 | } | |
5a303d5d YZ |
7594 | } |
7595 | ||
efa56464 | 7596 | ret = btrfs_reserve_extent(trans, root, num_bytes, min_size, |
81c9ad23 | 7597 | 0, *alloc_hint, &ins, 1); |
5a303d5d | 7598 | if (ret) { |
0af3d00b JB |
7599 | if (own_trans) |
7600 | btrfs_end_transaction(trans, root); | |
a22285a6 | 7601 | break; |
d899e052 | 7602 | } |
5a303d5d | 7603 | |
d899e052 YZ |
7604 | ret = insert_reserved_file_extent(trans, inode, |
7605 | cur_offset, ins.objectid, | |
7606 | ins.offset, ins.offset, | |
920bbbfb | 7607 | ins.offset, 0, 0, 0, |
d899e052 | 7608 | BTRFS_FILE_EXTENT_PREALLOC); |
79787eaa JM |
7609 | if (ret) { |
7610 | btrfs_abort_transaction(trans, root, ret); | |
7611 | if (own_trans) | |
7612 | btrfs_end_transaction(trans, root); | |
7613 | break; | |
7614 | } | |
a1ed835e CM |
7615 | btrfs_drop_extent_cache(inode, cur_offset, |
7616 | cur_offset + ins.offset -1, 0); | |
5a303d5d | 7617 | |
5dc562c5 JB |
7618 | em = alloc_extent_map(); |
7619 | if (!em) { | |
7620 | set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, | |
7621 | &BTRFS_I(inode)->runtime_flags); | |
7622 | goto next; | |
7623 | } | |
7624 | ||
7625 | em->start = cur_offset; | |
7626 | em->orig_start = cur_offset; | |
7627 | em->len = ins.offset; | |
7628 | em->block_start = ins.objectid; | |
7629 | em->block_len = ins.offset; | |
7630 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
7631 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); | |
7632 | em->generation = trans->transid; | |
7633 | ||
7634 | while (1) { | |
7635 | write_lock(&em_tree->lock); | |
7636 | ret = add_extent_mapping(em_tree, em); | |
7637 | if (!ret) | |
7638 | list_move(&em->list, | |
7639 | &em_tree->modified_extents); | |
7640 | write_unlock(&em_tree->lock); | |
7641 | if (ret != -EEXIST) | |
7642 | break; | |
7643 | btrfs_drop_extent_cache(inode, cur_offset, | |
7644 | cur_offset + ins.offset - 1, | |
7645 | 0); | |
7646 | } | |
7647 | free_extent_map(em); | |
7648 | next: | |
d899e052 YZ |
7649 | num_bytes -= ins.offset; |
7650 | cur_offset += ins.offset; | |
efa56464 | 7651 | *alloc_hint = ins.objectid + ins.offset; |
5a303d5d | 7652 | |
0c4d2d95 | 7653 | inode_inc_iversion(inode); |
d899e052 | 7654 | inode->i_ctime = CURRENT_TIME; |
6cbff00f | 7655 | BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC; |
d899e052 | 7656 | if (!(mode & FALLOC_FL_KEEP_SIZE) && |
efa56464 YZ |
7657 | (actual_len > inode->i_size) && |
7658 | (cur_offset > inode->i_size)) { | |
d1ea6a61 | 7659 | if (cur_offset > actual_len) |
55a61d1d | 7660 | i_size = actual_len; |
d1ea6a61 | 7661 | else |
55a61d1d JB |
7662 | i_size = cur_offset; |
7663 | i_size_write(inode, i_size); | |
7664 | btrfs_ordered_update_i_size(inode, i_size, NULL); | |
5a303d5d YZ |
7665 | } |
7666 | ||
d899e052 | 7667 | ret = btrfs_update_inode(trans, root, inode); |
79787eaa JM |
7668 | |
7669 | if (ret) { | |
7670 | btrfs_abort_transaction(trans, root, ret); | |
7671 | if (own_trans) | |
7672 | btrfs_end_transaction(trans, root); | |
7673 | break; | |
7674 | } | |
d899e052 | 7675 | |
0af3d00b JB |
7676 | if (own_trans) |
7677 | btrfs_end_transaction(trans, root); | |
5a303d5d | 7678 | } |
d899e052 YZ |
7679 | return ret; |
7680 | } | |
7681 | ||
0af3d00b JB |
7682 | int btrfs_prealloc_file_range(struct inode *inode, int mode, |
7683 | u64 start, u64 num_bytes, u64 min_size, | |
7684 | loff_t actual_len, u64 *alloc_hint) | |
7685 | { | |
7686 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
7687 | min_size, actual_len, alloc_hint, | |
7688 | NULL); | |
7689 | } | |
7690 | ||
7691 | int btrfs_prealloc_file_range_trans(struct inode *inode, | |
7692 | struct btrfs_trans_handle *trans, int mode, | |
7693 | u64 start, u64 num_bytes, u64 min_size, | |
7694 | loff_t actual_len, u64 *alloc_hint) | |
7695 | { | |
7696 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
7697 | min_size, actual_len, alloc_hint, trans); | |
7698 | } | |
7699 | ||
e6dcd2dc CM |
7700 | static int btrfs_set_page_dirty(struct page *page) |
7701 | { | |
e6dcd2dc CM |
7702 | return __set_page_dirty_nobuffers(page); |
7703 | } | |
7704 | ||
10556cb2 | 7705 | static int btrfs_permission(struct inode *inode, int mask) |
fdebe2bd | 7706 | { |
b83cc969 | 7707 | struct btrfs_root *root = BTRFS_I(inode)->root; |
cb6db4e5 | 7708 | umode_t mode = inode->i_mode; |
b83cc969 | 7709 | |
cb6db4e5 JM |
7710 | if (mask & MAY_WRITE && |
7711 | (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) { | |
7712 | if (btrfs_root_readonly(root)) | |
7713 | return -EROFS; | |
7714 | if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY) | |
7715 | return -EACCES; | |
7716 | } | |
2830ba7f | 7717 | return generic_permission(inode, mask); |
fdebe2bd | 7718 | } |
39279cc3 | 7719 | |
6e1d5dcc | 7720 | static const struct inode_operations btrfs_dir_inode_operations = { |
3394e160 | 7721 | .getattr = btrfs_getattr, |
39279cc3 CM |
7722 | .lookup = btrfs_lookup, |
7723 | .create = btrfs_create, | |
7724 | .unlink = btrfs_unlink, | |
7725 | .link = btrfs_link, | |
7726 | .mkdir = btrfs_mkdir, | |
7727 | .rmdir = btrfs_rmdir, | |
7728 | .rename = btrfs_rename, | |
7729 | .symlink = btrfs_symlink, | |
7730 | .setattr = btrfs_setattr, | |
618e21d5 | 7731 | .mknod = btrfs_mknod, |
95819c05 CH |
7732 | .setxattr = btrfs_setxattr, |
7733 | .getxattr = btrfs_getxattr, | |
5103e947 | 7734 | .listxattr = btrfs_listxattr, |
95819c05 | 7735 | .removexattr = btrfs_removexattr, |
fdebe2bd | 7736 | .permission = btrfs_permission, |
4e34e719 | 7737 | .get_acl = btrfs_get_acl, |
39279cc3 | 7738 | }; |
6e1d5dcc | 7739 | static const struct inode_operations btrfs_dir_ro_inode_operations = { |
39279cc3 | 7740 | .lookup = btrfs_lookup, |
fdebe2bd | 7741 | .permission = btrfs_permission, |
4e34e719 | 7742 | .get_acl = btrfs_get_acl, |
39279cc3 | 7743 | }; |
76dda93c | 7744 | |
828c0950 | 7745 | static const struct file_operations btrfs_dir_file_operations = { |
39279cc3 CM |
7746 | .llseek = generic_file_llseek, |
7747 | .read = generic_read_dir, | |
cbdf5a24 | 7748 | .readdir = btrfs_real_readdir, |
34287aa3 | 7749 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 7750 | #ifdef CONFIG_COMPAT |
34287aa3 | 7751 | .compat_ioctl = btrfs_ioctl, |
39279cc3 | 7752 | #endif |
6bf13c0c | 7753 | .release = btrfs_release_file, |
e02119d5 | 7754 | .fsync = btrfs_sync_file, |
39279cc3 CM |
7755 | }; |
7756 | ||
d1310b2e | 7757 | static struct extent_io_ops btrfs_extent_io_ops = { |
07157aac | 7758 | .fill_delalloc = run_delalloc_range, |
065631f6 | 7759 | .submit_bio_hook = btrfs_submit_bio_hook, |
239b14b3 | 7760 | .merge_bio_hook = btrfs_merge_bio_hook, |
07157aac | 7761 | .readpage_end_io_hook = btrfs_readpage_end_io_hook, |
e6dcd2dc | 7762 | .writepage_end_io_hook = btrfs_writepage_end_io_hook, |
247e743c | 7763 | .writepage_start_hook = btrfs_writepage_start_hook, |
b0c68f8b CM |
7764 | .set_bit_hook = btrfs_set_bit_hook, |
7765 | .clear_bit_hook = btrfs_clear_bit_hook, | |
9ed74f2d JB |
7766 | .merge_extent_hook = btrfs_merge_extent_hook, |
7767 | .split_extent_hook = btrfs_split_extent_hook, | |
07157aac CM |
7768 | }; |
7769 | ||
35054394 CM |
7770 | /* |
7771 | * btrfs doesn't support the bmap operation because swapfiles | |
7772 | * use bmap to make a mapping of extents in the file. They assume | |
7773 | * these extents won't change over the life of the file and they | |
7774 | * use the bmap result to do IO directly to the drive. | |
7775 | * | |
7776 | * the btrfs bmap call would return logical addresses that aren't | |
7777 | * suitable for IO and they also will change frequently as COW | |
7778 | * operations happen. So, swapfile + btrfs == corruption. | |
7779 | * | |
7780 | * For now we're avoiding this by dropping bmap. | |
7781 | */ | |
7f09410b | 7782 | static const struct address_space_operations btrfs_aops = { |
39279cc3 CM |
7783 | .readpage = btrfs_readpage, |
7784 | .writepage = btrfs_writepage, | |
b293f02e | 7785 | .writepages = btrfs_writepages, |
3ab2fb5a | 7786 | .readpages = btrfs_readpages, |
16432985 | 7787 | .direct_IO = btrfs_direct_IO, |
a52d9a80 CM |
7788 | .invalidatepage = btrfs_invalidatepage, |
7789 | .releasepage = btrfs_releasepage, | |
e6dcd2dc | 7790 | .set_page_dirty = btrfs_set_page_dirty, |
465fdd97 | 7791 | .error_remove_page = generic_error_remove_page, |
39279cc3 CM |
7792 | }; |
7793 | ||
7f09410b | 7794 | static const struct address_space_operations btrfs_symlink_aops = { |
39279cc3 CM |
7795 | .readpage = btrfs_readpage, |
7796 | .writepage = btrfs_writepage, | |
2bf5a725 CM |
7797 | .invalidatepage = btrfs_invalidatepage, |
7798 | .releasepage = btrfs_releasepage, | |
39279cc3 CM |
7799 | }; |
7800 | ||
6e1d5dcc | 7801 | static const struct inode_operations btrfs_file_inode_operations = { |
39279cc3 CM |
7802 | .getattr = btrfs_getattr, |
7803 | .setattr = btrfs_setattr, | |
95819c05 CH |
7804 | .setxattr = btrfs_setxattr, |
7805 | .getxattr = btrfs_getxattr, | |
5103e947 | 7806 | .listxattr = btrfs_listxattr, |
95819c05 | 7807 | .removexattr = btrfs_removexattr, |
fdebe2bd | 7808 | .permission = btrfs_permission, |
1506fcc8 | 7809 | .fiemap = btrfs_fiemap, |
4e34e719 | 7810 | .get_acl = btrfs_get_acl, |
e41f941a | 7811 | .update_time = btrfs_update_time, |
39279cc3 | 7812 | }; |
6e1d5dcc | 7813 | static const struct inode_operations btrfs_special_inode_operations = { |
618e21d5 JB |
7814 | .getattr = btrfs_getattr, |
7815 | .setattr = btrfs_setattr, | |
fdebe2bd | 7816 | .permission = btrfs_permission, |
95819c05 CH |
7817 | .setxattr = btrfs_setxattr, |
7818 | .getxattr = btrfs_getxattr, | |
33268eaf | 7819 | .listxattr = btrfs_listxattr, |
95819c05 | 7820 | .removexattr = btrfs_removexattr, |
4e34e719 | 7821 | .get_acl = btrfs_get_acl, |
e41f941a | 7822 | .update_time = btrfs_update_time, |
618e21d5 | 7823 | }; |
6e1d5dcc | 7824 | static const struct inode_operations btrfs_symlink_inode_operations = { |
39279cc3 CM |
7825 | .readlink = generic_readlink, |
7826 | .follow_link = page_follow_link_light, | |
7827 | .put_link = page_put_link, | |
f209561a | 7828 | .getattr = btrfs_getattr, |
22c44fe6 | 7829 | .setattr = btrfs_setattr, |
fdebe2bd | 7830 | .permission = btrfs_permission, |
0279b4cd JO |
7831 | .setxattr = btrfs_setxattr, |
7832 | .getxattr = btrfs_getxattr, | |
7833 | .listxattr = btrfs_listxattr, | |
7834 | .removexattr = btrfs_removexattr, | |
4e34e719 | 7835 | .get_acl = btrfs_get_acl, |
e41f941a | 7836 | .update_time = btrfs_update_time, |
39279cc3 | 7837 | }; |
76dda93c | 7838 | |
82d339d9 | 7839 | const struct dentry_operations btrfs_dentry_operations = { |
76dda93c | 7840 | .d_delete = btrfs_dentry_delete, |
b4aff1f8 | 7841 | .d_release = btrfs_dentry_release, |
76dda93c | 7842 | }; |