projects / linux-2.6-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
btrfs: unlock i_mutex after attempting to delete subvolume during send
[linux-2.6-block.git] / fs / btrfs / inode.c
CommitLineData
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>
a27bb332 35#include <linux/aio.h>
9ebefb18 36#include <linux/bit_spinlock.h>
5103e947 37#include <linux/xattr.h>
33268eaf 38#include <linux/posix_acl.h>
d899e052 39#include <linux/falloc.h>
5a0e3ad6 40#include <linux/slab.h>
7a36ddec 41#include <linux/ratelimit.h>
22c44fe6 42#include <linux/mount.h>
55e301fd 43#include <linux/btrfs.h>
53b381b3 44#include <linux/blkdev.h>
f23b5a59 45#include <linux/posix_acl_xattr.h>
4a3d1caf 46#include <linux/uio.h>
39279cc3
CM		 47#include "ctree.h"
48#include "disk-io.h"
49#include "transaction.h"
50#include "btrfs_inode.h"
39279cc3 51#include "print-tree.h"
e6dcd2dc 52#include "ordered-data.h"
95819c05 53#include "xattr.h"
e02119d5 54#include "tree-log.h"
4a54c8c1 55#include "volumes.h"
c8b97818 56#include "compression.h"
b4ce94de 57#include "locking.h"
dc89e982 58#include "free-space-cache.h"
581bb050 59#include "inode-map.h"
38c227d8 60#include "backref.h"
f23b5a59 61#include "hash.h"
63541927 62#include "props.h"
31193213 63#include "qgroup.h"
39279cc3
CM		 64
65struct btrfs_iget_args {
90d3e592 66 struct btrfs_key *location;
39279cc3
CM		 67 struct btrfs_root *root;
68};
69
6e1d5dcc
AD		 70static const struct inode_operations btrfs_dir_inode_operations;
71static const struct inode_operations btrfs_symlink_inode_operations;
72static const struct inode_operations btrfs_dir_ro_inode_operations;
73static const struct inode_operations btrfs_special_inode_operations;
74static const struct inode_operations btrfs_file_inode_operations;
7f09410b
AD		 75static const struct address_space_operations btrfs_aops;
76static const struct address_space_operations btrfs_symlink_aops;
828c0950 77static const struct file_operations btrfs_dir_file_operations;
d1310b2e 78static struct extent_io_ops btrfs_extent_io_ops;
39279cc3
CM		 79
80static struct kmem_cache *btrfs_inode_cachep;
8ccf6f19 81static struct kmem_cache *btrfs_delalloc_work_cachep;
39279cc3
CM		 82struct kmem_cache *btrfs_trans_handle_cachep;
83struct kmem_cache *btrfs_transaction_cachep;
39279cc3 84struct kmem_cache *btrfs_path_cachep;
dc89e982 85struct kmem_cache *btrfs_free_space_cachep;
39279cc3
CM		 86
87#define S_SHIFT 12
88static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
89 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
90 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
91 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
92 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
93 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
94 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
95 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
96};
97
3972f260 98static int btrfs_setsize(struct inode *inode, struct iattr *attr);
a41ad394 99static int btrfs_truncate(struct inode *inode);
5fd02043 100static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
771ed689
CM		 101static noinline int cow_file_range(struct inode *inode,
102 struct page *locked_page,
103 u64 start, u64 end, int *page_started,
104 unsigned long *nr_written, int unlock);
70c8a91c
JB		 105static struct extent_map *create_pinned_em(struct inode *inode, u64 start,
106 u64 len, u64 orig_start,
107 u64 block_start, u64 block_len,
cc95bef6
JB		 108 u64 orig_block_len, u64 ram_bytes,
109 int type);
7b128766 110
48a3b636 111static int btrfs_dirty_inode(struct inode *inode);
7b128766 112
6a3891c5
JB		 113#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
114void btrfs_test_inode_set_ops(struct inode *inode)
115{
116 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
117}
118#endif
119
f34f57a3 120static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
2a7dba39
EP		 121 struct inode *inode, struct inode *dir,
122 const struct qstr *qstr)
0279b4cd
JO		 123{
124 int err;
125
f34f57a3 126 err = btrfs_init_acl(trans, inode, dir);
0279b4cd 127 if (!err)
2a7dba39 128 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
0279b4cd
JO		 129 return err;
130}
131
c8b97818
CM		 132/*
133 * this does all the hard work for inserting an inline extent into
134 * the btree. The caller should have done a btrfs_drop_extents so that
135 * no overlapping inline items exist in the btree
136 */
40f76580 137static int insert_inline_extent(struct btrfs_trans_handle *trans,
1acae57b 138 struct btrfs_path *path, int extent_inserted,
c8b97818
CM		 139 struct btrfs_root *root, struct inode *inode,
140 u64 start, size_t size, size_t compressed_size,
fe3f566c 141 int compress_type,
c8b97818
CM		 142 struct page **compressed_pages)
143{
c8b97818
CM		 144 struct extent_buffer *leaf;
145 struct page *page = NULL;
146 char *kaddr;
147 unsigned long ptr;
148 struct btrfs_file_extent_item *ei;
149 int err = 0;
150 int ret;
151 size_t cur_size = size;
c8b97818 152 unsigned long offset;
c8b97818 153
fe3f566c 154 if (compressed_size && compressed_pages)
c8b97818 155 cur_size = compressed_size;
c8b97818 156
1acae57b 157 inode_add_bytes(inode, size);
c8b97818 158
1acae57b
FDBM		 159 if (!extent_inserted) {
160 struct btrfs_key key;
161 size_t datasize;
c8b97818 162
1acae57b
FDBM		 163 key.objectid = btrfs_ino(inode);
164 key.offset = start;
962a298f 165 key.type = BTRFS_EXTENT_DATA_KEY;
c8b97818 166
1acae57b
FDBM		 167 datasize = btrfs_file_extent_calc_inline_size(cur_size);
168 path->leave_spinning = 1;
169 ret = btrfs_insert_empty_item(trans, root, path, &key,
170 datasize);
171 if (ret) {
172 err = ret;
173 goto fail;
174 }
c8b97818
CM		 175 }
176 leaf = path->nodes[0];
177 ei = btrfs_item_ptr(leaf, path->slots[0],
178 struct btrfs_file_extent_item);
179 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
180 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
181 btrfs_set_file_extent_encryption(leaf, ei, 0);
182 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
183 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
184 ptr = btrfs_file_extent_inline_start(ei);
185
261507a0 186 if (compress_type != BTRFS_COMPRESS_NONE) {
c8b97818
CM		 187 struct page *cpage;
188 int i = 0;
d397712b 189 while (compressed_size > 0) {
c8b97818 190 cpage = compressed_pages[i];
5b050f04 191 cur_size = min_t(unsigned long, compressed_size,
c8b97818
CM		 192 PAGE_CACHE_SIZE);
193
7ac687d9 194 kaddr = kmap_atomic(cpage);
c8b97818 195 write_extent_buffer(leaf, kaddr, ptr, cur_size);
7ac687d9 196 kunmap_atomic(kaddr);
c8b97818
CM		 197
198 i++;
199 ptr += cur_size;
200 compressed_size -= cur_size;
201 }
202 btrfs_set_file_extent_compression(leaf, ei,
261507a0 203 compress_type);
c8b97818
CM		 204 } else {
205 page = find_get_page(inode->i_mapping,
206 start >> PAGE_CACHE_SHIFT);
207 btrfs_set_file_extent_compression(leaf, ei, 0);
7ac687d9 208 kaddr = kmap_atomic(page);
c8b97818
CM		 209 offset = start & (PAGE_CACHE_SIZE - 1);
210 write_extent_buffer(leaf, kaddr + offset, ptr, size);
7ac687d9 211 kunmap_atomic(kaddr);
c8b97818
CM		 212 page_cache_release(page);
213 }
214 btrfs_mark_buffer_dirty(leaf);
1acae57b 215 btrfs_release_path(path);
c8b97818 216
c2167754
YZ		 217 /*
218 * we're an inline extent, so nobody can
219 * extend the file past i_size without locking
220 * a page we already have locked.
221 *
222 * We must do any isize and inode updates
223 * before we unlock the pages. Otherwise we
224 * could end up racing with unlink.
225 */
c8b97818 226 BTRFS_I(inode)->disk_i_size = inode->i_size;
79787eaa 227 ret = btrfs_update_inode(trans, root, inode);
c2167754 228
79787eaa 229 return ret;
c8b97818 230fail:
c8b97818
CM		 231 return err;
232}
233
234
235/*
236 * conditionally insert an inline extent into the file. This
237 * does the checks required to make sure the data is small enough
238 * to fit as an inline extent.
239 */
00361589
JB		 240static noinline int cow_file_range_inline(struct btrfs_root *root,
241 struct inode *inode, u64 start,
242 u64 end, size_t compressed_size,
243 int compress_type,
244 struct page **compressed_pages)
c8b97818 245{
00361589 246 struct btrfs_trans_handle *trans;
c8b97818
CM		 247 u64 isize = i_size_read(inode);
248 u64 actual_end = min(end + 1, isize);
249 u64 inline_len = actual_end - start;
fda2832f 250 u64 aligned_end = ALIGN(end, root->sectorsize);
c8b97818
CM		 251 u64 data_len = inline_len;
252 int ret;
1acae57b
FDBM		 253 struct btrfs_path *path;
254 int extent_inserted = 0;
255 u32 extent_item_size;
c8b97818
CM		 256
257 if (compressed_size)
258 data_len = compressed_size;
259
260 if (start > 0 ||
354877be
WS		 261 actual_end > PAGE_CACHE_SIZE ||
262 data_len > BTRFS_MAX_INLINE_DATA_SIZE(root) ||
c8b97818
CM		 263 (!compressed_size &&
264 (actual_end & (root->sectorsize - 1)) == 0) ||
265 end + 1 < isize ||
266 data_len > root->fs_info->max_inline) {
267 return 1;
268 }
269
1acae57b
FDBM		 270 path = btrfs_alloc_path();
271 if (!path)
272 return -ENOMEM;
273
00361589 274 trans = btrfs_join_transaction(root);
1acae57b
FDBM		 275 if (IS_ERR(trans)) {
276 btrfs_free_path(path);
00361589 277 return PTR_ERR(trans);
1acae57b 278 }
00361589
JB		 279 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
280
1acae57b
FDBM		 281 if (compressed_size && compressed_pages)
282 extent_item_size = btrfs_file_extent_calc_inline_size(
283 compressed_size);
284 else
285 extent_item_size = btrfs_file_extent_calc_inline_size(
286 inline_len);
287
288 ret = __btrfs_drop_extents(trans, root, inode, path,
289 start, aligned_end, NULL,
290 1, 1, extent_item_size, &extent_inserted);
00361589
JB		 291 if (ret) {
292 btrfs_abort_transaction(trans, root, ret);
293 goto out;
294 }
c8b97818
CM		 295
296 if (isize > actual_end)
297 inline_len = min_t(u64, isize, actual_end);
1acae57b
FDBM		 298 ret = insert_inline_extent(trans, path, extent_inserted,
299 root, inode, start,
c8b97818 300 inline_len, compressed_size,
fe3f566c 301 compress_type, compressed_pages);
2adcac1a 302 if (ret && ret != -ENOSPC) {
79787eaa 303 btrfs_abort_transaction(trans, root, ret);
00361589 304 goto out;
2adcac1a 305 } else if (ret == -ENOSPC) {
00361589
JB		 306 ret = 1;
307 goto out;
79787eaa 308 }
2adcac1a 309
bdc20e67 310 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
0ca1f7ce 311 btrfs_delalloc_release_metadata(inode, end + 1 - start);
a1ed835e 312 btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0);
00361589 313out:
1acae57b 314 btrfs_free_path(path);
00361589
JB		 315 btrfs_end_transaction(trans, root);
316 return ret;
c8b97818
CM		 317}
318
771ed689
CM		 319struct async_extent {
320 u64 start;
321 u64 ram_size;
322 u64 compressed_size;
323 struct page **pages;
324 unsigned long nr_pages;
261507a0 325 int compress_type;
771ed689
CM		 326 struct list_head list;
327};
328
329struct async_cow {
330 struct inode *inode;
331 struct btrfs_root *root;
332 struct page *locked_page;
333 u64 start;
334 u64 end;
335 struct list_head extents;
336 struct btrfs_work work;
337};
338
339static noinline int add_async_extent(struct async_cow *cow,
340 u64 start, u64 ram_size,
341 u64 compressed_size,
342 struct page **pages,
261507a0
LZ		 343 unsigned long nr_pages,
344 int compress_type)
771ed689
CM		 345{
346 struct async_extent *async_extent;
347
348 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
79787eaa 349 BUG_ON(!async_extent); /* -ENOMEM */
771ed689
CM		 350 async_extent->start = start;
351 async_extent->ram_size = ram_size;
352 async_extent->compressed_size = compressed_size;
353 async_extent->pages = pages;
354 async_extent->nr_pages = nr_pages;
261507a0 355 async_extent->compress_type = compress_type;
771ed689
CM		 356 list_add_tail(&async_extent->list, &cow->extents);
357 return 0;
358}
359
f79707b0
WS		 360static inline int inode_need_compress(struct inode *inode)
361{
362 struct btrfs_root *root = BTRFS_I(inode)->root;
363
364 /* force compress */
365 if (btrfs_test_opt(root, FORCE_COMPRESS))
366 return 1;
367 /* bad compression ratios */
368 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
369 return 0;
370 if (btrfs_test_opt(root, COMPRESS) ||
371 BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS ||
372 BTRFS_I(inode)->force_compress)
373 return 1;
374 return 0;
375}
376
d352ac68 377/*
771ed689
CM		 378 * we create compressed extents in two phases. The first
379 * phase compresses a range of pages that have already been
380 * locked (both pages and state bits are locked).
c8b97818 381 *
771ed689
CM		 382 * This is done inside an ordered work queue, and the compression
383 * is spread across many cpus. The actual IO submission is step
384 * two, and the ordered work queue takes care of making sure that
385 * happens in the same order things were put onto the queue by
386 * writepages and friends.
c8b97818 387 *
771ed689
CM		 388 * If this code finds it can't get good compression, it puts an
389 * entry onto the work queue to write the uncompressed bytes. This
390 * makes sure that both compressed inodes and uncompressed inodes
b2570314
AB		 391 * are written in the same order that the flusher thread sent them
392 * down.
d352ac68 393 */
c44f649e 394static noinline void compress_file_range(struct inode *inode,
771ed689
CM		 395 struct page *locked_page,
396 u64 start, u64 end,
397 struct async_cow *async_cow,
398 int *num_added)
b888db2b
CM		 399{
400 struct btrfs_root *root = BTRFS_I(inode)->root;
db94535d 401 u64 num_bytes;
db94535d 402 u64 blocksize = root->sectorsize;
c8b97818 403 u64 actual_end;
42dc7bab 404 u64 isize = i_size_read(inode);
e6dcd2dc 405 int ret = 0;
c8b97818
CM		 406 struct page **pages = NULL;
407 unsigned long nr_pages;
408 unsigned long nr_pages_ret = 0;
409 unsigned long total_compressed = 0;
410 unsigned long total_in = 0;
411 unsigned long max_compressed = 128 * 1024;
771ed689 412 unsigned long max_uncompressed = 128 * 1024;
c8b97818
CM		 413 int i;
414 int will_compress;
261507a0 415 int compress_type = root->fs_info->compress_type;
4adaa611 416 int redirty = 0;
b888db2b 417
4cb13e5d
LB		 418 /* if this is a small write inside eof, kick off a defrag */
419 if ((end - start + 1) < 16 * 1024 &&
420 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
4cb5300b
CM		 421 btrfs_add_inode_defrag(NULL, inode);
422
42dc7bab 423 actual_end = min_t(u64, isize, end + 1);
c8b97818
CM		 424again:
425 will_compress = 0;
426 nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1;
427 nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE);
be20aa9d 428
f03d9301
CM		 429 /*
430 * we don't want to send crud past the end of i_size through
431 * compression, that's just a waste of CPU time. So, if the
432 * end of the file is before the start of our current
433 * requested range of bytes, we bail out to the uncompressed
434 * cleanup code that can deal with all of this.
435 *
436 * It isn't really the fastest way to fix things, but this is a
437 * very uncommon corner.
438 */
439 if (actual_end <= start)
440 goto cleanup_and_bail_uncompressed;
441
c8b97818
CM		 442 total_compressed = actual_end - start;
443
4bcbb332
SW		 444 /*
445 * skip compression for a small file range(<=blocksize) that
446 * isn't an inline extent, since it dosen't save disk space at all.
447 */
448 if (total_compressed <= blocksize &&
449 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
450 goto cleanup_and_bail_uncompressed;
451
c8b97818
CM		 452 /* we want to make sure that amount of ram required to uncompress
453 * an extent is reasonable, so we limit the total size in ram
771ed689
CM		 454 * of a compressed extent to 128k. This is a crucial number
455 * because it also controls how easily we can spread reads across
456 * cpus for decompression.
457 *
458 * We also want to make sure the amount of IO required to do
459 * a random read is reasonably small, so we limit the size of
460 * a compressed extent to 128k.
c8b97818
CM		 461 */
462 total_compressed = min(total_compressed, max_uncompressed);
fda2832f 463 num_bytes = ALIGN(end - start + 1, blocksize);
be20aa9d 464 num_bytes = max(blocksize, num_bytes);
c8b97818
CM		 465 total_in = 0;
466 ret = 0;
db94535d 467
771ed689
CM		 468 /*
469 * we do compression for mount -o compress and when the
470 * inode has not been flagged as nocompress. This flag can
471 * change at any time if we discover bad compression ratios.
c8b97818 472 */
f79707b0 473 if (inode_need_compress(inode)) {
c8b97818 474 WARN_ON(pages);
31e818fe 475 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
560f7d75
LZ		 476 if (!pages) {
477 /* just bail out to the uncompressed code */
478 goto cont;
479 }
c8b97818 480
261507a0
LZ		 481 if (BTRFS_I(inode)->force_compress)
482 compress_type = BTRFS_I(inode)->force_compress;
483
4adaa611
CM		 484 /*
485 * we need to call clear_page_dirty_for_io on each
486 * page in the range. Otherwise applications with the file
487 * mmap'd can wander in and change the page contents while
488 * we are compressing them.
489 *
490 * If the compression fails for any reason, we set the pages
491 * dirty again later on.
492 */
493 extent_range_clear_dirty_for_io(inode, start, end);
494 redirty = 1;
261507a0
LZ		 495 ret = btrfs_compress_pages(compress_type,
496 inode->i_mapping, start,
497 total_compressed, pages,
498 nr_pages, &nr_pages_ret,
499 &total_in,
500 &total_compressed,
501 max_compressed);
c8b97818
CM		 502
503 if (!ret) {
504 unsigned long offset = total_compressed &
505 (PAGE_CACHE_SIZE - 1);
506 struct page *page = pages[nr_pages_ret - 1];
507 char *kaddr;
508
509 /* zero the tail end of the last page, we might be
510 * sending it down to disk
511 */
512 if (offset) {
7ac687d9 513 kaddr = kmap_atomic(page);
c8b97818
CM		 514 memset(kaddr + offset, 0,
515 PAGE_CACHE_SIZE - offset);
7ac687d9 516 kunmap_atomic(kaddr);
c8b97818
CM		 517 }
518 will_compress = 1;
519 }
520 }
560f7d75 521cont:
c8b97818
CM		 522 if (start == 0) {
523 /* lets try to make an inline extent */
771ed689 524 if (ret || total_in < (actual_end - start)) {
c8b97818 525 /* we didn't compress the entire range, try
771ed689 526 * to make an uncompressed inline extent.
c8b97818 527 */
00361589
JB		 528 ret = cow_file_range_inline(root, inode, start, end,
529 0, 0, NULL);
c8b97818 530 } else {
771ed689 531 /* try making a compressed inline extent */
00361589 532 ret = cow_file_range_inline(root, inode, start, end,
fe3f566c
LZ		 533 total_compressed,
534 compress_type, pages);
c8b97818 535 }
79787eaa 536 if (ret <= 0) {
151a41bc
JB		 537 unsigned long clear_flags = EXTENT_DELALLOC |
538 EXTENT_DEFRAG;
e6eb4314
FM		 539 unsigned long page_error_op;
540
151a41bc 541 clear_flags |= (ret < 0) ? EXTENT_DO_ACCOUNTING : 0;
e6eb4314 542 page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
151a41bc 543
771ed689 544 /*
79787eaa
JM		 545 * inline extent creation worked or returned error,
546 * we don't need to create any more async work items.
547 * Unlock and free up our temp pages.
771ed689 548 */
c2790a2e 549 extent_clear_unlock_delalloc(inode, start, end, NULL,
151a41bc 550 clear_flags, PAGE_UNLOCK |
c2790a2e
JB		 551 PAGE_CLEAR_DIRTY |
552 PAGE_SET_WRITEBACK |
e6eb4314 553 page_error_op |
c2790a2e 554 PAGE_END_WRITEBACK);
c8b97818
CM		 555 goto free_pages_out;
556 }
557 }
558
559 if (will_compress) {
560 /*
561 * we aren't doing an inline extent round the compressed size
562 * up to a block size boundary so the allocator does sane
563 * things
564 */
fda2832f 565 total_compressed = ALIGN(total_compressed, blocksize);
c8b97818
CM		 566
567 /*
568 * one last check to make sure the compression is really a
569 * win, compare the page count read with the blocks on disk
570 */
fda2832f 571 total_in = ALIGN(total_in, PAGE_CACHE_SIZE);
c8b97818
CM		 572 if (total_compressed >= total_in) {
573 will_compress = 0;
574 } else {
c8b97818
CM		 575 num_bytes = total_in;
576 }
577 }
578 if (!will_compress && pages) {
579 /*
580 * the compression code ran but failed to make things smaller,
581 * free any pages it allocated and our page pointer array
582 */
583 for (i = 0; i < nr_pages_ret; i++) {
70b99e69 584 WARN_ON(pages[i]->mapping);
c8b97818
CM		 585 page_cache_release(pages[i]);
586 }
587 kfree(pages);
588 pages = NULL;
589 total_compressed = 0;
590 nr_pages_ret = 0;
591
592 /* flag the file so we don't compress in the future */
1e701a32
CM		 593 if (!btrfs_test_opt(root, FORCE_COMPRESS) &&
594 !(BTRFS_I(inode)->force_compress)) {
a555f810 595 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
1e701a32 596 }
c8b97818 597 }
771ed689
CM		 598 if (will_compress) {
599 *num_added += 1;
c8b97818 600
771ed689
CM		 601 /* the async work queues will take care of doing actual
602 * allocation on disk for these compressed pages,
603 * and will submit them to the elevator.
604 */
605 add_async_extent(async_cow, start, num_bytes,
261507a0
LZ		 606 total_compressed, pages, nr_pages_ret,
607 compress_type);
179e29e4 608
24ae6365 609 if (start + num_bytes < end) {
771ed689
CM		 610 start += num_bytes;
611 pages = NULL;
612 cond_resched();
613 goto again;
614 }
615 } else {
f03d9301 616cleanup_and_bail_uncompressed:
771ed689
CM		 617 /*
618 * No compression, but we still need to write the pages in
619 * the file we've been given so far. redirty the locked
620 * page if it corresponds to our extent and set things up
621 * for the async work queue to run cow_file_range to do
622 * the normal delalloc dance
623 */
624 if (page_offset(locked_page) >= start &&
625 page_offset(locked_page) <= end) {
626 __set_page_dirty_nobuffers(locked_page);
627 /* unlocked later on in the async handlers */
628 }
4adaa611
CM		 629 if (redirty)
630 extent_range_redirty_for_io(inode, start, end);
261507a0
LZ		 631 add_async_extent(async_cow, start, end - start + 1,
632 0, NULL, 0, BTRFS_COMPRESS_NONE);
771ed689
CM		 633 *num_added += 1;
634 }
3b951516 635
c44f649e 636 return;
771ed689
CM		 637
638free_pages_out:
639 for (i = 0; i < nr_pages_ret; i++) {
640 WARN_ON(pages[i]->mapping);
641 page_cache_release(pages[i]);
642 }
d397712b 643 kfree(pages);
771ed689 644}
771ed689 645
40ae837b
FM		 646static void free_async_extent_pages(struct async_extent *async_extent)
647{
648 int i;
649
650 if (!async_extent->pages)
651 return;
652
653 for (i = 0; i < async_extent->nr_pages; i++) {
654 WARN_ON(async_extent->pages[i]->mapping);
655 page_cache_release(async_extent->pages[i]);
656 }
657 kfree(async_extent->pages);
658 async_extent->nr_pages = 0;
659 async_extent->pages = NULL;
771ed689
CM		 660}
661
662/*
663 * phase two of compressed writeback. This is the ordered portion
664 * of the code, which only gets called in the order the work was
665 * queued. We walk all the async extents created by compress_file_range
666 * and send them down to the disk.
667 */
dec8f175 668static noinline void submit_compressed_extents(struct inode *inode,
771ed689
CM		 669 struct async_cow *async_cow)
670{
671 struct async_extent *async_extent;
672 u64 alloc_hint = 0;
771ed689
CM		 673 struct btrfs_key ins;
674 struct extent_map *em;
675 struct btrfs_root *root = BTRFS_I(inode)->root;
676 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
677 struct extent_io_tree *io_tree;
f5a84ee3 678 int ret = 0;
771ed689 679
3e04e7f1 680again:
d397712b 681 while (!list_empty(&async_cow->extents)) {
771ed689
CM		 682 async_extent = list_entry(async_cow->extents.next,
683 struct async_extent, list);
684 list_del(&async_extent->list);
c8b97818 685
771ed689
CM		 686 io_tree = &BTRFS_I(inode)->io_tree;
687
f5a84ee3 688retry:
771ed689
CM		 689 /* did the compression code fall back to uncompressed IO? */
690 if (!async_extent->pages) {
691 int page_started = 0;
692 unsigned long nr_written = 0;
693
694 lock_extent(io_tree, async_extent->start,
2ac55d41 695 async_extent->start +
d0082371 696 async_extent->ram_size - 1);
771ed689
CM		 697
698 /* allocate blocks */
f5a84ee3
JB		 699 ret = cow_file_range(inode, async_cow->locked_page,
700 async_extent->start,
701 async_extent->start +
702 async_extent->ram_size - 1,
703 &page_started, &nr_written, 0);
771ed689 704
79787eaa
JM		 705 /* JDM XXX */
706
771ed689
CM		 707 /*
708 * if page_started, cow_file_range inserted an
709 * inline extent and took care of all the unlocking
710 * and IO for us. Otherwise, we need to submit
711 * all those pages down to the drive.
712 */
f5a84ee3 713 if (!page_started && !ret)
771ed689
CM		 714 extent_write_locked_range(io_tree,
715 inode, async_extent->start,
d397712b 716 async_extent->start +
771ed689
CM		 717 async_extent->ram_size - 1,
718 btrfs_get_extent,
719 WB_SYNC_ALL);
3e04e7f1
JB		 720 else if (ret)
721 unlock_page(async_cow->locked_page);
771ed689
CM		 722 kfree(async_extent);
723 cond_resched();
724 continue;
725 }
726
727 lock_extent(io_tree, async_extent->start,
d0082371 728 async_extent->start + async_extent->ram_size - 1);
771ed689 729
00361589 730 ret = btrfs_reserve_extent(root,
771ed689
CM		 731 async_extent->compressed_size,
732 async_extent->compressed_size,
e570fd27 733 0, alloc_hint, &ins, 1, 1);
f5a84ee3 734 if (ret) {
40ae837b 735 free_async_extent_pages(async_extent);
3e04e7f1 736
fdf8e2ea
JB		 737 if (ret == -ENOSPC) {
738 unlock_extent(io_tree, async_extent->start,
739 async_extent->start +
740 async_extent->ram_size - 1);
ce62003f
LB		 741
742 /*
743 * we need to redirty the pages if we decide to
744 * fallback to uncompressed IO, otherwise we
745 * will not submit these pages down to lower
746 * layers.
747 */
748 extent_range_redirty_for_io(inode,
749 async_extent->start,
750 async_extent->start +
751 async_extent->ram_size - 1);
752
79787eaa 753 goto retry;
fdf8e2ea 754 }
3e04e7f1 755 goto out_free;
f5a84ee3 756 }
c2167754
YZ		 757 /*
758 * here we're doing allocation and writeback of the
759 * compressed pages
760 */
761 btrfs_drop_extent_cache(inode, async_extent->start,
762 async_extent->start +
763 async_extent->ram_size - 1, 0);
764
172ddd60 765 em = alloc_extent_map();
b9aa55be
LB		 766 if (!em) {
767 ret = -ENOMEM;
3e04e7f1 768 goto out_free_reserve;
b9aa55be 769 }
771ed689
CM		 770 em->start = async_extent->start;
771 em->len = async_extent->ram_size;
445a6944 772 em->orig_start = em->start;
2ab28f32
JB		 773 em->mod_start = em->start;
774 em->mod_len = em->len;
c8b97818 775
771ed689
CM		 776 em->block_start = ins.objectid;
777 em->block_len = ins.offset;
b4939680 778 em->orig_block_len = ins.offset;
cc95bef6 779 em->ram_bytes = async_extent->ram_size;
771ed689 780 em->bdev = root->fs_info->fs_devices->latest_bdev;
261507a0 781 em->compress_type = async_extent->compress_type;
771ed689
CM		 782 set_bit(EXTENT_FLAG_PINNED, &em->flags);
783 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
70c8a91c 784 em->generation = -1;
771ed689 785
d397712b 786 while (1) {
890871be 787 write_lock(&em_tree->lock);
09a2a8f9 788 ret = add_extent_mapping(em_tree, em, 1);
890871be 789 write_unlock(&em_tree->lock);
771ed689
CM		 790 if (ret != -EEXIST) {
791 free_extent_map(em);
792 break;
793 }
794 btrfs_drop_extent_cache(inode, async_extent->start,
795 async_extent->start +
796 async_extent->ram_size - 1, 0);
797 }
798
3e04e7f1
JB		 799 if (ret)
800 goto out_free_reserve;
801
261507a0
LZ		 802 ret = btrfs_add_ordered_extent_compress(inode,
803 async_extent->start,
804 ins.objectid,
805 async_extent->ram_size,
806 ins.offset,
807 BTRFS_ORDERED_COMPRESSED,
808 async_extent->compress_type);
d9f85963
FM		 809 if (ret) {
810 btrfs_drop_extent_cache(inode, async_extent->start,
811 async_extent->start +
812 async_extent->ram_size - 1, 0);
3e04e7f1 813 goto out_free_reserve;
d9f85963 814 }
771ed689 815
771ed689
CM		 816 /*
817 * clear dirty, set writeback and unlock the pages.
818 */
c2790a2e 819 extent_clear_unlock_delalloc(inode, async_extent->start,
a791e35e
CM		 820 async_extent->start +
821 async_extent->ram_size - 1,
151a41bc
JB		 822 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
823 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
c2790a2e 824 PAGE_SET_WRITEBACK);
771ed689 825 ret = btrfs_submit_compressed_write(inode,
d397712b
CM		 826 async_extent->start,
827 async_extent->ram_size,
828 ins.objectid,
829 ins.offset, async_extent->pages,
830 async_extent->nr_pages);
fce2a4e6
FM		 831 if (ret) {
832 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
833 struct page *p = async_extent->pages[0];
834 const u64 start = async_extent->start;
835 const u64 end = start + async_extent->ram_size - 1;
836
837 p->mapping = inode->i_mapping;
838 tree->ops->writepage_end_io_hook(p, start, end,
839 NULL, 0);
840 p->mapping = NULL;
841 extent_clear_unlock_delalloc(inode, start, end, NULL, 0,
842 PAGE_END_WRITEBACK |
843 PAGE_SET_ERROR);
40ae837b 844 free_async_extent_pages(async_extent);
fce2a4e6 845 }
771ed689
CM		 846 alloc_hint = ins.objectid + ins.offset;
847 kfree(async_extent);
848 cond_resched();
849 }
dec8f175 850 return;
3e04e7f1 851out_free_reserve:
e570fd27 852 btrfs_free_reserved_extent(root, ins.objectid, ins.offset, 1);
79787eaa 853out_free:
c2790a2e 854 extent_clear_unlock_delalloc(inode, async_extent->start,
3e04e7f1
JB		 855 async_extent->start +
856 async_extent->ram_size - 1,
c2790a2e 857 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
151a41bc
JB		 858 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
859 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
704de49d
FM		 860 PAGE_SET_WRITEBACK | PAGE_END_WRITEBACK |
861 PAGE_SET_ERROR);
40ae837b 862 free_async_extent_pages(async_extent);
79787eaa 863 kfree(async_extent);
3e04e7f1 864 goto again;
771ed689
CM		 865}
866
4b46fce2
JB		 867static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
868 u64 num_bytes)
869{
870 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
871 struct extent_map *em;
872 u64 alloc_hint = 0;
873
874 read_lock(&em_tree->lock);
875 em = search_extent_mapping(em_tree, start, num_bytes);
876 if (em) {
877 /*
878 * if block start isn't an actual block number then find the
879 * first block in this inode and use that as a hint. If that
880 * block is also bogus then just don't worry about it.
881 */
882 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
883 free_extent_map(em);
884 em = search_extent_mapping(em_tree, 0, 0);
885 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
886 alloc_hint = em->block_start;
887 if (em)
888 free_extent_map(em);
889 } else {
890 alloc_hint = em->block_start;
891 free_extent_map(em);
892 }
893 }
894 read_unlock(&em_tree->lock);
895
896 return alloc_hint;
897}
898
771ed689
CM		 899/*
900 * when extent_io.c finds a delayed allocation range in the file,
901 * the call backs end up in this code. The basic idea is to
902 * allocate extents on disk for the range, and create ordered data structs
903 * in ram to track those extents.
904 *
905 * locked_page is the page that writepage had locked already. We use
906 * it to make sure we don't do extra locks or unlocks.
907 *
908 * *page_started is set to one if we unlock locked_page and do everything
909 * required to start IO on it. It may be clean and already done with
910 * IO when we return.
911 */
00361589
JB		 912static noinline int cow_file_range(struct inode *inode,
913 struct page *locked_page,
914 u64 start, u64 end, int *page_started,
915 unsigned long *nr_written,
916 int unlock)
771ed689 917{
00361589 918 struct btrfs_root *root = BTRFS_I(inode)->root;
771ed689
CM		 919 u64 alloc_hint = 0;
920 u64 num_bytes;
921 unsigned long ram_size;
922 u64 disk_num_bytes;
923 u64 cur_alloc_size;
924 u64 blocksize = root->sectorsize;
771ed689
CM		 925 struct btrfs_key ins;
926 struct extent_map *em;
927 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
928 int ret = 0;
929
02ecd2c2
JB		 930 if (btrfs_is_free_space_inode(inode)) {
931 WARN_ON_ONCE(1);
29bce2f3
JB		 932 ret = -EINVAL;
933 goto out_unlock;
02ecd2c2 934 }
771ed689 935
fda2832f 936 num_bytes = ALIGN(end - start + 1, blocksize);
771ed689
CM		 937 num_bytes = max(blocksize, num_bytes);
938 disk_num_bytes = num_bytes;
771ed689 939
4cb5300b 940 /* if this is a small write inside eof, kick off defrag */
4cb13e5d
LB		 941 if (num_bytes < 64 * 1024 &&
942 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
00361589 943 btrfs_add_inode_defrag(NULL, inode);
4cb5300b 944
771ed689
CM		 945 if (start == 0) {
946 /* lets try to make an inline extent */
00361589
JB		 947 ret = cow_file_range_inline(root, inode, start, end, 0, 0,
948 NULL);
771ed689 949 if (ret == 0) {
c2790a2e
JB		 950 extent_clear_unlock_delalloc(inode, start, end, NULL,
951 EXTENT_LOCKED | EXTENT_DELALLOC |
151a41bc 952 EXTENT_DEFRAG, PAGE_UNLOCK |
c2790a2e
JB		 953 PAGE_CLEAR_DIRTY | PAGE_SET_WRITEBACK |
954 PAGE_END_WRITEBACK);
c2167754 955
771ed689
CM		 956 *nr_written = *nr_written +
957 (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE;
958 *page_started = 1;
771ed689 959 goto out;
79787eaa 960 } else if (ret < 0) {
79787eaa 961 goto out_unlock;
771ed689
CM		 962 }
963 }
964
965 BUG_ON(disk_num_bytes >
6c41761f 966 btrfs_super_total_bytes(root->fs_info->super_copy));
771ed689 967
4b46fce2 968 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
771ed689
CM		 969 btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
970
d397712b 971 while (disk_num_bytes > 0) {
a791e35e
CM		 972 unsigned long op;
973
287a0ab9 974 cur_alloc_size = disk_num_bytes;
00361589 975 ret = btrfs_reserve_extent(root, cur_alloc_size,
771ed689 976 root->sectorsize, 0, alloc_hint,
e570fd27 977 &ins, 1, 1);
00361589 978 if (ret < 0)
79787eaa 979 goto out_unlock;
d397712b 980
172ddd60 981 em = alloc_extent_map();
b9aa55be
LB		 982 if (!em) {
983 ret = -ENOMEM;
ace68bac 984 goto out_reserve;
b9aa55be 985 }
e6dcd2dc 986 em->start = start;
445a6944 987 em->orig_start = em->start;
771ed689
CM		 988 ram_size = ins.offset;
989 em->len = ins.offset;
2ab28f32
JB		 990 em->mod_start = em->start;
991 em->mod_len = em->len;
c8b97818 992
e6dcd2dc 993 em->block_start = ins.objectid;
c8b97818 994 em->block_len = ins.offset;
b4939680 995 em->orig_block_len = ins.offset;
cc95bef6 996 em->ram_bytes = ram_size;
e6dcd2dc 997 em->bdev = root->fs_info->fs_devices->latest_bdev;
7f3c74fb 998 set_bit(EXTENT_FLAG_PINNED, &em->flags);
70c8a91c 999 em->generation = -1;
c8b97818 1000
d397712b 1001 while (1) {
890871be 1002 write_lock(&em_tree->lock);
09a2a8f9 1003 ret = add_extent_mapping(em_tree, em, 1);
890871be 1004 write_unlock(&em_tree->lock);
e6dcd2dc
CM		 1005 if (ret != -EEXIST) {
1006 free_extent_map(em);
1007 break;
1008 }
1009 btrfs_drop_extent_cache(inode, start,
c8b97818 1010 start + ram_size - 1, 0);
e6dcd2dc 1011 }
ace68bac
LB		 1012 if (ret)
1013 goto out_reserve;
e6dcd2dc 1014
98d20f67 1015 cur_alloc_size = ins.offset;
e6dcd2dc 1016 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
771ed689 1017 ram_size, cur_alloc_size, 0);
ace68bac 1018 if (ret)
d9f85963 1019 goto out_drop_extent_cache;
c8b97818 1020
17d217fe
YZ		 1021 if (root->root_key.objectid ==
1022 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1023 ret = btrfs_reloc_clone_csums(inode, start,
1024 cur_alloc_size);
00361589 1025 if (ret)
d9f85963 1026 goto out_drop_extent_cache;
17d217fe
YZ		 1027 }
1028
d397712b 1029 if (disk_num_bytes < cur_alloc_size)
3b951516 1030 break;
d397712b 1031
c8b97818
CM		 1032 /* we're not doing compressed IO, don't unlock the first
1033 * page (which the caller expects to stay locked), don't
1034 * clear any dirty bits and don't set any writeback bits
8b62b72b
CM		 1035 *
1036 * Do set the Private2 bit so we know this page was properly
1037 * setup for writepage
c8b97818 1038 */
c2790a2e
JB		 1039 op = unlock ? PAGE_UNLOCK : 0;
1040 op |= PAGE_SET_PRIVATE2;
a791e35e 1041
c2790a2e
JB		 1042 extent_clear_unlock_delalloc(inode, start,
1043 start + ram_size - 1, locked_page,
1044 EXTENT_LOCKED | EXTENT_DELALLOC,
1045 op);
c8b97818 1046 disk_num_bytes -= cur_alloc_size;
c59f8951
CM		 1047 num_bytes -= cur_alloc_size;
1048 alloc_hint = ins.objectid + ins.offset;
1049 start += cur_alloc_size;
b888db2b 1050 }
79787eaa 1051out:
be20aa9d 1052 return ret;
b7d5b0a8 1053
d9f85963
FM		 1054out_drop_extent_cache:
1055 btrfs_drop_extent_cache(inode, start, start + ram_size - 1, 0);
ace68bac 1056out_reserve:
e570fd27 1057 btrfs_free_reserved_extent(root, ins.objectid, ins.offset, 1);
79787eaa 1058out_unlock:
c2790a2e 1059 extent_clear_unlock_delalloc(inode, start, end, locked_page,
151a41bc
JB		 1060 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
1061 EXTENT_DELALLOC | EXTENT_DEFRAG,
1062 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
1063 PAGE_SET_WRITEBACK | PAGE_END_WRITEBACK);
79787eaa 1064 goto out;
771ed689 1065}
c8b97818 1066
771ed689
CM		 1067/*
1068 * work queue call back to started compression on a file and pages
1069 */
1070static noinline void async_cow_start(struct btrfs_work *work)
1071{
1072 struct async_cow *async_cow;
1073 int num_added = 0;
1074 async_cow = container_of(work, struct async_cow, work);
1075
1076 compress_file_range(async_cow->inode, async_cow->locked_page,
1077 async_cow->start, async_cow->end, async_cow,
1078 &num_added);
8180ef88 1079 if (num_added == 0) {
cb77fcd8 1080 btrfs_add_delayed_iput(async_cow->inode);
771ed689 1081 async_cow->inode = NULL;
8180ef88 1082 }
771ed689
CM		 1083}
1084
1085/*
1086 * work queue call back to submit previously compressed pages
1087 */
1088static noinline void async_cow_submit(struct btrfs_work *work)
1089{
1090 struct async_cow *async_cow;
1091 struct btrfs_root *root;
1092 unsigned long nr_pages;
1093
1094 async_cow = container_of(work, struct async_cow, work);
1095
1096 root = async_cow->root;
1097 nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >>
1098 PAGE_CACHE_SHIFT;
1099
66657b31 1100 if (atomic_sub_return(nr_pages, &root->fs_info->async_delalloc_pages) <
287082b0 1101 5 * 1024 * 1024 &&
771ed689
CM		 1102 waitqueue_active(&root->fs_info->async_submit_wait))
1103 wake_up(&root->fs_info->async_submit_wait);
1104
d397712b 1105 if (async_cow->inode)
771ed689 1106 submit_compressed_extents(async_cow->inode, async_cow);
771ed689 1107}
c8b97818 1108
771ed689
CM		 1109static noinline void async_cow_free(struct btrfs_work *work)
1110{
1111 struct async_cow *async_cow;
1112 async_cow = container_of(work, struct async_cow, work);
8180ef88 1113 if (async_cow->inode)
cb77fcd8 1114 btrfs_add_delayed_iput(async_cow->inode);
771ed689
CM		 1115 kfree(async_cow);
1116}
1117
1118static int cow_file_range_async(struct inode *inode, struct page *locked_page,
1119 u64 start, u64 end, int *page_started,
1120 unsigned long *nr_written)
1121{
1122 struct async_cow *async_cow;
1123 struct btrfs_root *root = BTRFS_I(inode)->root;
1124 unsigned long nr_pages;
1125 u64 cur_end;
287082b0 1126 int limit = 10 * 1024 * 1024;
771ed689 1127
a3429ab7
CM		 1128 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
1129 1, 0, NULL, GFP_NOFS);
d397712b 1130 while (start < end) {
771ed689 1131 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
79787eaa 1132 BUG_ON(!async_cow); /* -ENOMEM */
8180ef88 1133 async_cow->inode = igrab(inode);
771ed689
CM		 1134 async_cow->root = root;
1135 async_cow->locked_page = locked_page;
1136 async_cow->start = start;
1137
f79707b0
WS		 1138 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS &&
1139 !btrfs_test_opt(root, FORCE_COMPRESS))
771ed689
CM		 1140 cur_end = end;
1141 else
1142 cur_end = min(end, start + 512 * 1024 - 1);
1143
1144 async_cow->end = cur_end;
1145 INIT_LIST_HEAD(&async_cow->extents);
1146
9e0af237
LB		 1147 btrfs_init_work(&async_cow->work,
1148 btrfs_delalloc_helper,
1149 async_cow_start, async_cow_submit,
1150 async_cow_free);
771ed689 1151
771ed689
CM		 1152 nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >>
1153 PAGE_CACHE_SHIFT;
1154 atomic_add(nr_pages, &root->fs_info->async_delalloc_pages);
1155
afe3d242
QW		 1156 btrfs_queue_work(root->fs_info->delalloc_workers,
1157 &async_cow->work);
771ed689
CM		 1158
1159 if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) {
1160 wait_event(root->fs_info->async_submit_wait,
1161 (atomic_read(&root->fs_info->async_delalloc_pages) <
1162 limit));
1163 }
1164
d397712b 1165 while (atomic_read(&root->fs_info->async_submit_draining) &&
771ed689
CM		 1166 atomic_read(&root->fs_info->async_delalloc_pages)) {
1167 wait_event(root->fs_info->async_submit_wait,
1168 (atomic_read(&root->fs_info->async_delalloc_pages) ==
1169 0));
1170 }
1171
1172 *nr_written += nr_pages;
1173 start = cur_end + 1;
1174 }
1175 *page_started = 1;
1176 return 0;
be20aa9d
CM		 1177}
1178
d397712b 1179static noinline int csum_exist_in_range(struct btrfs_root *root,
17d217fe
YZ		 1180 u64 bytenr, u64 num_bytes)
1181{
1182 int ret;
1183 struct btrfs_ordered_sum *sums;
1184 LIST_HEAD(list);
1185
07d400a6 1186 ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr,
a2de733c 1187 bytenr + num_bytes - 1, &list, 0);
17d217fe
YZ		 1188 if (ret == 0 && list_empty(&list))
1189 return 0;
1190
1191 while (!list_empty(&list)) {
1192 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1193 list_del(&sums->list);
1194 kfree(sums);
1195 }
1196 return 1;
1197}
1198
d352ac68
CM		 1199/*
1200 * when nowcow writeback call back. This checks for snapshots or COW copies
1201 * of the extents that exist in the file, and COWs the file as required.
1202 *
1203 * If no cow copies or snapshots exist, we write directly to the existing
1204 * blocks on disk
1205 */
7f366cfe
CM		 1206static noinline int run_delalloc_nocow(struct inode *inode,
1207 struct page *locked_page,
771ed689
CM		 1208 u64 start, u64 end, int *page_started, int force,
1209 unsigned long *nr_written)
be20aa9d 1210{
be20aa9d 1211 struct btrfs_root *root = BTRFS_I(inode)->root;
7ea394f1 1212 struct btrfs_trans_handle *trans;
be20aa9d 1213 struct extent_buffer *leaf;
be20aa9d 1214 struct btrfs_path *path;
80ff3856 1215 struct btrfs_file_extent_item *fi;
be20aa9d 1216 struct btrfs_key found_key;
80ff3856
YZ		 1217 u64 cow_start;
1218 u64 cur_offset;
1219 u64 extent_end;
5d4f98a2 1220 u64 extent_offset;
80ff3856
YZ		 1221 u64 disk_bytenr;
1222 u64 num_bytes;
b4939680 1223 u64 disk_num_bytes;
cc95bef6 1224 u64 ram_bytes;
80ff3856 1225 int extent_type;
79787eaa 1226 int ret, err;
d899e052 1227 int type;
80ff3856
YZ		 1228 int nocow;
1229 int check_prev = 1;
82d5902d 1230 bool nolock;
33345d01 1231 u64 ino = btrfs_ino(inode);
be20aa9d
CM		 1232
1233 path = btrfs_alloc_path();
17ca04af 1234 if (!path) {
c2790a2e
JB		 1235 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1236 EXTENT_LOCKED | EXTENT_DELALLOC |
151a41bc
JB		 1237 EXTENT_DO_ACCOUNTING |
1238 EXTENT_DEFRAG, PAGE_UNLOCK |
c2790a2e
JB		 1239 PAGE_CLEAR_DIRTY |
1240 PAGE_SET_WRITEBACK |
1241 PAGE_END_WRITEBACK);
d8926bb3 1242 return -ENOMEM;
17ca04af 1243 }
82d5902d 1244
83eea1f1 1245 nolock = btrfs_is_free_space_inode(inode);
82d5902d
LZ		 1246
1247 if (nolock)
7a7eaa40 1248 trans = btrfs_join_transaction_nolock(root);
82d5902d 1249 else
7a7eaa40 1250 trans = btrfs_join_transaction(root);
ff5714cc 1251
79787eaa 1252 if (IS_ERR(trans)) {
c2790a2e
JB		 1253 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1254 EXTENT_LOCKED | EXTENT_DELALLOC |
151a41bc
JB		 1255 EXTENT_DO_ACCOUNTING |
1256 EXTENT_DEFRAG, PAGE_UNLOCK |
c2790a2e
JB		 1257 PAGE_CLEAR_DIRTY |
1258 PAGE_SET_WRITEBACK |
1259 PAGE_END_WRITEBACK);
79787eaa
JM		 1260 btrfs_free_path(path);
1261 return PTR_ERR(trans);
1262 }
1263
74b21075 1264 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
be20aa9d 1265
80ff3856
YZ		 1266 cow_start = (u64)-1;
1267 cur_offset = start;
1268 while (1) {
33345d01 1269 ret = btrfs_lookup_file_extent(trans, root, path, ino,
80ff3856 1270 cur_offset, 0);
d788a349 1271 if (ret < 0)
79787eaa 1272 goto error;
80ff3856
YZ		 1273 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1274 leaf = path->nodes[0];
1275 btrfs_item_key_to_cpu(leaf, &found_key,
1276 path->slots[0] - 1);
33345d01 1277 if (found_key.objectid == ino &&
80ff3856
YZ		 1278 found_key.type == BTRFS_EXTENT_DATA_KEY)
1279 path->slots[0]--;
1280 }
1281 check_prev = 0;
1282next_slot:
1283 leaf = path->nodes[0];
1284 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1285 ret = btrfs_next_leaf(root, path);
d788a349 1286 if (ret < 0)
79787eaa 1287 goto error;
80ff3856
YZ		 1288 if (ret > 0)
1289 break;
1290 leaf = path->nodes[0];
1291 }
be20aa9d 1292
80ff3856
YZ		 1293 nocow = 0;
1294 disk_bytenr = 0;
17d217fe 1295 num_bytes = 0;
80ff3856
YZ		 1296 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1297
33345d01 1298 if (found_key.objectid > ino ||
80ff3856
YZ		 1299 found_key.type > BTRFS_EXTENT_DATA_KEY ||
1300 found_key.offset > end)
1301 break;
1302
1303 if (found_key.offset > cur_offset) {
1304 extent_end = found_key.offset;
e9061e21 1305 extent_type = 0;
80ff3856
YZ		 1306 goto out_check;
1307 }
1308
1309 fi = btrfs_item_ptr(leaf, path->slots[0],
1310 struct btrfs_file_extent_item);
1311 extent_type = btrfs_file_extent_type(leaf, fi);
1312
cc95bef6 1313 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
d899e052
YZ		 1314 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1315 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
80ff3856 1316 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
5d4f98a2 1317 extent_offset = btrfs_file_extent_offset(leaf, fi);
80ff3856
YZ		 1318 extent_end = found_key.offset +
1319 btrfs_file_extent_num_bytes(leaf, fi);
b4939680
JB		 1320 disk_num_bytes =
1321 btrfs_file_extent_disk_num_bytes(leaf, fi);
80ff3856
YZ		 1322 if (extent_end <= start) {
1323 path->slots[0]++;
1324 goto next_slot;
1325 }
17d217fe
YZ		 1326 if (disk_bytenr == 0)
1327 goto out_check;
80ff3856
YZ		 1328 if (btrfs_file_extent_compression(leaf, fi) ||
1329 btrfs_file_extent_encryption(leaf, fi) ||
1330 btrfs_file_extent_other_encoding(leaf, fi))
1331 goto out_check;
d899e052
YZ		 1332 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1333 goto out_check;
d2fb3437 1334 if (btrfs_extent_readonly(root, disk_bytenr))
80ff3856 1335 goto out_check;
33345d01 1336 if (btrfs_cross_ref_exist(trans, root, ino,
5d4f98a2
YZ		 1337 found_key.offset -
1338 extent_offset, disk_bytenr))
17d217fe 1339 goto out_check;
5d4f98a2 1340 disk_bytenr += extent_offset;
17d217fe
YZ		 1341 disk_bytenr += cur_offset - found_key.offset;
1342 num_bytes = min(end + 1, extent_end) - cur_offset;
e9894fd3
WS		 1343 /*
1344 * if there are pending snapshots for this root,
1345 * we fall into common COW way.
1346 */
1347 if (!nolock) {
9ea24bbe 1348 err = btrfs_start_write_no_snapshoting(root);
e9894fd3
WS		 1349 if (!err)
1350 goto out_check;
1351 }
17d217fe
YZ		 1352 /*
1353 * force cow if csum exists in the range.
1354 * this ensure that csum for a given extent are
1355 * either valid or do not exist.
1356 */
1357 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
1358 goto out_check;
80ff3856
YZ		 1359 nocow = 1;
1360 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1361 extent_end = found_key.offset +
514ac8ad
CM		 1362 btrfs_file_extent_inline_len(leaf,
1363 path->slots[0], fi);
80ff3856
YZ		 1364 extent_end = ALIGN(extent_end, root->sectorsize);
1365 } else {
1366 BUG_ON(1);
1367 }
1368out_check:
1369 if (extent_end <= start) {
1370 path->slots[0]++;
e9894fd3 1371 if (!nolock && nocow)
9ea24bbe 1372 btrfs_end_write_no_snapshoting(root);
80ff3856
YZ		 1373 goto next_slot;
1374 }
1375 if (!nocow) {
1376 if (cow_start == (u64)-1)
1377 cow_start = cur_offset;
1378 cur_offset = extent_end;
1379 if (cur_offset > end)
1380 break;
1381 path->slots[0]++;
1382 goto next_slot;
7ea394f1
YZ		 1383 }
1384
b3b4aa74 1385 btrfs_release_path(path);
80ff3856 1386 if (cow_start != (u64)-1) {
00361589
JB		 1387 ret = cow_file_range(inode, locked_page,
1388 cow_start, found_key.offset - 1,
1389 page_started, nr_written, 1);
e9894fd3
WS		 1390 if (ret) {
1391 if (!nolock && nocow)
9ea24bbe 1392 btrfs_end_write_no_snapshoting(root);
79787eaa 1393 goto error;
e9894fd3 1394 }
80ff3856 1395 cow_start = (u64)-1;
7ea394f1 1396 }
80ff3856 1397
d899e052
YZ		 1398 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1399 struct extent_map *em;
1400 struct extent_map_tree *em_tree;
1401 em_tree = &BTRFS_I(inode)->extent_tree;
172ddd60 1402 em = alloc_extent_map();
79787eaa 1403 BUG_ON(!em); /* -ENOMEM */
d899e052 1404 em->start = cur_offset;
70c8a91c 1405 em->orig_start = found_key.offset - extent_offset;
d899e052
YZ		 1406 em->len = num_bytes;
1407 em->block_len = num_bytes;
1408 em->block_start = disk_bytenr;
b4939680 1409 em->orig_block_len = disk_num_bytes;
cc95bef6 1410 em->ram_bytes = ram_bytes;
d899e052 1411 em->bdev = root->fs_info->fs_devices->latest_bdev;
2ab28f32
JB		 1412 em->mod_start = em->start;
1413 em->mod_len = em->len;
d899e052 1414 set_bit(EXTENT_FLAG_PINNED, &em->flags);
b11e234d 1415 set_bit(EXTENT_FLAG_FILLING, &em->flags);
70c8a91c 1416 em->generation = -1;
d899e052 1417 while (1) {
890871be 1418 write_lock(&em_tree->lock);
09a2a8f9 1419 ret = add_extent_mapping(em_tree, em, 1);
890871be 1420 write_unlock(&em_tree->lock);
d899e052
YZ		 1421 if (ret != -EEXIST) {
1422 free_extent_map(em);
1423 break;
1424 }
1425 btrfs_drop_extent_cache(inode, em->start,
1426 em->start + em->len - 1, 0);
1427 }
1428 type = BTRFS_ORDERED_PREALLOC;
1429 } else {
1430 type = BTRFS_ORDERED_NOCOW;
1431 }
80ff3856
YZ		 1432
1433 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
d899e052 1434 num_bytes, num_bytes, type);
79787eaa 1435 BUG_ON(ret); /* -ENOMEM */
771ed689 1436
efa56464
YZ		 1437 if (root->root_key.objectid ==
1438 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1439 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1440 num_bytes);
e9894fd3
WS		 1441 if (ret) {
1442 if (!nolock && nocow)
9ea24bbe 1443 btrfs_end_write_no_snapshoting(root);
79787eaa 1444 goto error;
e9894fd3 1445 }
efa56464
YZ		 1446 }
1447
c2790a2e
JB		 1448 extent_clear_unlock_delalloc(inode, cur_offset,
1449 cur_offset + num_bytes - 1,
1450 locked_page, EXTENT_LOCKED |
1451 EXTENT_DELALLOC, PAGE_UNLOCK |
1452 PAGE_SET_PRIVATE2);
e9894fd3 1453 if (!nolock && nocow)
9ea24bbe 1454 btrfs_end_write_no_snapshoting(root);
80ff3856
YZ		 1455 cur_offset = extent_end;
1456 if (cur_offset > end)
1457 break;
be20aa9d 1458 }
b3b4aa74 1459 btrfs_release_path(path);
80ff3856 1460
17ca04af 1461 if (cur_offset <= end && cow_start == (u64)-1) {
80ff3856 1462 cow_start = cur_offset;
17ca04af
JB		 1463 cur_offset = end;
1464 }
1465
80ff3856 1466 if (cow_start != (u64)-1) {
00361589
JB		 1467 ret = cow_file_range(inode, locked_page, cow_start, end,
1468 page_started, nr_written, 1);
d788a349 1469 if (ret)
79787eaa 1470 goto error;
80ff3856
YZ		 1471 }
1472
79787eaa 1473error:
a698d075 1474 err = btrfs_end_transaction(trans, root);
79787eaa
JM		 1475 if (!ret)
1476 ret = err;
1477
17ca04af 1478 if (ret && cur_offset < end)
c2790a2e
JB		 1479 extent_clear_unlock_delalloc(inode, cur_offset, end,
1480 locked_page, EXTENT_LOCKED |
151a41bc
JB		 1481 EXTENT_DELALLOC | EXTENT_DEFRAG |
1482 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1483 PAGE_CLEAR_DIRTY |
c2790a2e
JB		 1484 PAGE_SET_WRITEBACK |
1485 PAGE_END_WRITEBACK);
7ea394f1 1486 btrfs_free_path(path);
79787eaa 1487 return ret;
be20aa9d
CM		 1488}
1489
47059d93
WS		 1490static inline int need_force_cow(struct inode *inode, u64 start, u64 end)
1491{
1492
1493 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
1494 !(BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC))
1495 return 0;
1496
1497 /*
1498 * @defrag_bytes is a hint value, no spinlock held here,
1499 * if is not zero, it means the file is defragging.
1500 * Force cow if given extent needs to be defragged.
1501 */
1502 if (BTRFS_I(inode)->defrag_bytes &&
1503 test_range_bit(&BTRFS_I(inode)->io_tree, start, end,
1504 EXTENT_DEFRAG, 0, NULL))
1505 return 1;
1506
1507 return 0;
1508}
1509
d352ac68
CM		 1510/*
1511 * extent_io.c call back to do delayed allocation processing
1512 */
c8b97818 1513static int run_delalloc_range(struct inode *inode, struct page *locked_page,
771ed689
CM		 1514 u64 start, u64 end, int *page_started,
1515 unsigned long *nr_written)
be20aa9d 1516{
be20aa9d 1517 int ret;
47059d93 1518 int force_cow = need_force_cow(inode, start, end);
a2135011 1519
47059d93 1520 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW && !force_cow) {
c8b97818 1521 ret = run_delalloc_nocow(inode, locked_page, start, end,
d397712b 1522 page_started, 1, nr_written);
47059d93 1523 } else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC && !force_cow) {
d899e052 1524 ret = run_delalloc_nocow(inode, locked_page, start, end,
d397712b 1525 page_started, 0, nr_written);
7816030e 1526 } else if (!inode_need_compress(inode)) {
7f366cfe
CM		 1527 ret = cow_file_range(inode, locked_page, start, end,
1528 page_started, nr_written, 1);
7ddf5a42
JB		 1529 } else {
1530 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
1531 &BTRFS_I(inode)->runtime_flags);
771ed689 1532 ret = cow_file_range_async(inode, locked_page, start, end,
d397712b 1533 page_started, nr_written);
7ddf5a42 1534 }
b888db2b
CM		 1535 return ret;
1536}
1537
1bf85046
JM		 1538static void btrfs_split_extent_hook(struct inode *inode,
1539 struct extent_state *orig, u64 split)
9ed74f2d 1540{
dcab6a3b
JB		 1541 u64 size;
1542
0ca1f7ce 1543 /* not delalloc, ignore it */
9ed74f2d 1544 if (!(orig->state & EXTENT_DELALLOC))
1bf85046 1545 return;
9ed74f2d 1546
dcab6a3b
JB		 1547 size = orig->end - orig->start + 1;
1548 if (size > BTRFS_MAX_EXTENT_SIZE) {
1549 u64 num_extents;
1550 u64 new_size;
1551
1552 /*
ba117213
JB		 1553 * See the explanation in btrfs_merge_extent_hook, the same
1554 * applies here, just in reverse.
dcab6a3b
JB		 1555 */
1556 new_size = orig->end - split + 1;
ba117213 1557 num_extents = div64_u64(new_size + BTRFS_MAX_EXTENT_SIZE - 1,
dcab6a3b 1558 BTRFS_MAX_EXTENT_SIZE);
ba117213
JB		 1559 new_size = split - orig->start;
1560 num_extents += div64_u64(new_size + BTRFS_MAX_EXTENT_SIZE - 1,
1561 BTRFS_MAX_EXTENT_SIZE);
1562 if (div64_u64(size + BTRFS_MAX_EXTENT_SIZE - 1,
1563 BTRFS_MAX_EXTENT_SIZE) >= num_extents)
dcab6a3b
JB		 1564 return;
1565 }
1566
9e0baf60
JB		 1567 spin_lock(&BTRFS_I(inode)->lock);
1568 BTRFS_I(inode)->outstanding_extents++;
1569 spin_unlock(&BTRFS_I(inode)->lock);
9ed74f2d
JB		 1570}
1571
1572/*
1573 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1574 * extents so we can keep track of new extents that are just merged onto old
1575 * extents, such as when we are doing sequential writes, so we can properly
1576 * account for the metadata space we'll need.
1577 */
1bf85046
JM		 1578static void btrfs_merge_extent_hook(struct inode *inode,
1579 struct extent_state *new,
1580 struct extent_state *other)
9ed74f2d 1581{
dcab6a3b
JB		 1582 u64 new_size, old_size;
1583 u64 num_extents;
1584
9ed74f2d
JB		 1585 /* not delalloc, ignore it */
1586 if (!(other->state & EXTENT_DELALLOC))
1bf85046 1587 return;
9ed74f2d 1588
8461a3de
JB		 1589 if (new->start > other->start)
1590 new_size = new->end - other->start + 1;
1591 else
1592 new_size = other->end - new->start + 1;
dcab6a3b
JB		 1593
1594 /* we're not bigger than the max, unreserve the space and go */
1595 if (new_size <= BTRFS_MAX_EXTENT_SIZE) {
1596 spin_lock(&BTRFS_I(inode)->lock);
1597 BTRFS_I(inode)->outstanding_extents--;
1598 spin_unlock(&BTRFS_I(inode)->lock);
1599 return;
1600 }
1601
1602 /*
ba117213
JB		 1603 * We have to add up either side to figure out how many extents were
1604 * accounted for before we merged into one big extent. If the number of
1605 * extents we accounted for is <= the amount we need for the new range
1606 * then we can return, otherwise drop. Think of it like this
1607 *
1608 * [ 4k][MAX_SIZE]
1609 *
1610 * So we've grown the extent by a MAX_SIZE extent, this would mean we
1611 * need 2 outstanding extents, on one side we have 1 and the other side
1612 * we have 1 so they are == and we can return. But in this case
1613 *
1614 * [MAX_SIZE+4k][MAX_SIZE+4k]
1615 *
1616 * Each range on their own accounts for 2 extents, but merged together
1617 * they are only 3 extents worth of accounting, so we need to drop in
1618 * this case.
dcab6a3b 1619 */
ba117213 1620 old_size = other->end - other->start + 1;
dcab6a3b
JB		 1621 num_extents = div64_u64(old_size + BTRFS_MAX_EXTENT_SIZE - 1,
1622 BTRFS_MAX_EXTENT_SIZE);
ba117213
JB		 1623 old_size = new->end - new->start + 1;
1624 num_extents += div64_u64(old_size + BTRFS_MAX_EXTENT_SIZE - 1,
1625 BTRFS_MAX_EXTENT_SIZE);
1626
dcab6a3b 1627 if (div64_u64(new_size + BTRFS_MAX_EXTENT_SIZE - 1,
ba117213 1628 BTRFS_MAX_EXTENT_SIZE) >= num_extents)
dcab6a3b
JB		 1629 return;
1630
9e0baf60
JB		 1631 spin_lock(&BTRFS_I(inode)->lock);
1632 BTRFS_I(inode)->outstanding_extents--;
1633 spin_unlock(&BTRFS_I(inode)->lock);
9ed74f2d
JB		 1634}
1635
eb73c1b7
MX		 1636static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
1637 struct inode *inode)
1638{
1639 spin_lock(&root->delalloc_lock);
1640 if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1641 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1642 &root->delalloc_inodes);
1643 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1644 &BTRFS_I(inode)->runtime_flags);
1645 root->nr_delalloc_inodes++;
1646 if (root->nr_delalloc_inodes == 1) {
1647 spin_lock(&root->fs_info->delalloc_root_lock);
1648 BUG_ON(!list_empty(&root->delalloc_root));
1649 list_add_tail(&root->delalloc_root,
1650 &root->fs_info->delalloc_roots);
1651 spin_unlock(&root->fs_info->delalloc_root_lock);
1652 }
1653 }
1654 spin_unlock(&root->delalloc_lock);
1655}
1656
1657static void btrfs_del_delalloc_inode(struct btrfs_root *root,
1658 struct inode *inode)
1659{
1660 spin_lock(&root->delalloc_lock);
1661 if (!list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1662 list_del_init(&BTRFS_I(inode)->delalloc_inodes);
1663 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1664 &BTRFS_I(inode)->runtime_flags);
1665 root->nr_delalloc_inodes--;
1666 if (!root->nr_delalloc_inodes) {
1667 spin_lock(&root->fs_info->delalloc_root_lock);
1668 BUG_ON(list_empty(&root->delalloc_root));
1669 list_del_init(&root->delalloc_root);
1670 spin_unlock(&root->fs_info->delalloc_root_lock);
1671 }
1672 }
1673 spin_unlock(&root->delalloc_lock);
1674}
1675
d352ac68
CM		 1676/*
1677 * extent_io.c set_bit_hook, used to track delayed allocation
1678 * bytes in this file, and to maintain the list of inodes that
1679 * have pending delalloc work to be done.
1680 */
1bf85046 1681static void btrfs_set_bit_hook(struct inode *inode,
9ee49a04 1682 struct extent_state *state, unsigned *bits)
291d673e 1683{
9ed74f2d 1684
47059d93
WS		 1685 if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
1686 WARN_ON(1);
75eff68e
CM		 1687 /*
1688 * set_bit and clear bit hooks normally require _irqsave/restore
27160b6b 1689 * but in this case, we are only testing for the DELALLOC
75eff68e
CM		 1690 * bit, which is only set or cleared with irqs on
1691 */
0ca1f7ce 1692 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
291d673e 1693 struct btrfs_root *root = BTRFS_I(inode)->root;
0ca1f7ce 1694 u64 len = state->end + 1 - state->start;
83eea1f1 1695 bool do_list = !btrfs_is_free_space_inode(inode);
9ed74f2d 1696
9e0baf60 1697 if (*bits & EXTENT_FIRST_DELALLOC) {
0ca1f7ce 1698 *bits &= ~EXTENT_FIRST_DELALLOC;
9e0baf60
JB		 1699 } else {
1700 spin_lock(&BTRFS_I(inode)->lock);
1701 BTRFS_I(inode)->outstanding_extents++;
1702 spin_unlock(&BTRFS_I(inode)->lock);
1703 }
287a0ab9 1704
6a3891c5
JB		 1705 /* For sanity tests */
1706 if (btrfs_test_is_dummy_root(root))
1707 return;
1708
963d678b
MX		 1709 __percpu_counter_add(&root->fs_info->delalloc_bytes, len,
1710 root->fs_info->delalloc_batch);
df0af1a5 1711 spin_lock(&BTRFS_I(inode)->lock);
0ca1f7ce 1712 BTRFS_I(inode)->delalloc_bytes += len;
47059d93
WS		 1713 if (*bits & EXTENT_DEFRAG)
1714 BTRFS_I(inode)->defrag_bytes += len;
df0af1a5 1715 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
eb73c1b7
MX		 1716 &BTRFS_I(inode)->runtime_flags))
1717 btrfs_add_delalloc_inodes(root, inode);
df0af1a5 1718 spin_unlock(&BTRFS_I(inode)->lock);
291d673e 1719 }
291d673e
CM		 1720}
1721
d352ac68
CM		 1722/*
1723 * extent_io.c clear_bit_hook, see set_bit_hook for why
1724 */
1bf85046 1725static void btrfs_clear_bit_hook(struct inode *inode,
41074888 1726 struct extent_state *state,
9ee49a04 1727 unsigned *bits)
291d673e 1728{
47059d93 1729 u64 len = state->end + 1 - state->start;
dcab6a3b
JB		 1730 u64 num_extents = div64_u64(len + BTRFS_MAX_EXTENT_SIZE -1,
1731 BTRFS_MAX_EXTENT_SIZE);
47059d93
WS		 1732
1733 spin_lock(&BTRFS_I(inode)->lock);
1734 if ((state->state & EXTENT_DEFRAG) && (*bits & EXTENT_DEFRAG))
1735 BTRFS_I(inode)->defrag_bytes -= len;
1736 spin_unlock(&BTRFS_I(inode)->lock);
1737
75eff68e
CM		 1738 /*
1739 * set_bit and clear bit hooks normally require _irqsave/restore
27160b6b 1740 * but in this case, we are only testing for the DELALLOC
75eff68e
CM		 1741 * bit, which is only set or cleared with irqs on
1742 */
0ca1f7ce 1743 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
291d673e 1744 struct btrfs_root *root = BTRFS_I(inode)->root;
83eea1f1 1745 bool do_list = !btrfs_is_free_space_inode(inode);
bcbfce8a 1746
9e0baf60 1747 if (*bits & EXTENT_FIRST_DELALLOC) {
0ca1f7ce 1748 *bits &= ~EXTENT_FIRST_DELALLOC;
9e0baf60
JB		 1749 } else if (!(*bits & EXTENT_DO_ACCOUNTING)) {
1750 spin_lock(&BTRFS_I(inode)->lock);
dcab6a3b 1751 BTRFS_I(inode)->outstanding_extents -= num_extents;
9e0baf60
JB		 1752 spin_unlock(&BTRFS_I(inode)->lock);
1753 }
0ca1f7ce 1754
b6d08f06
JB		 1755 /*
1756 * We don't reserve metadata space for space cache inodes so we
1757 * don't need to call dellalloc_release_metadata if there is an
1758 * error.
1759 */
1760 if (*bits & EXTENT_DO_ACCOUNTING &&
1761 root != root->fs_info->tree_root)
0ca1f7ce
YZ		 1762 btrfs_delalloc_release_metadata(inode, len);
1763
6a3891c5
JB		 1764 /* For sanity tests. */
1765 if (btrfs_test_is_dummy_root(root))
1766 return;
1767
0cb59c99 1768 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
7ee9e440 1769 && do_list && !(state->state & EXTENT_NORESERVE))
0ca1f7ce 1770 btrfs_free_reserved_data_space(inode, len);
9ed74f2d 1771
963d678b
MX		 1772 __percpu_counter_add(&root->fs_info->delalloc_bytes, -len,
1773 root->fs_info->delalloc_batch);
df0af1a5 1774 spin_lock(&BTRFS_I(inode)->lock);
0ca1f7ce 1775 BTRFS_I(inode)->delalloc_bytes -= len;
0cb59c99 1776 if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 &&
df0af1a5 1777 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
eb73c1b7
MX		 1778 &BTRFS_I(inode)->runtime_flags))
1779 btrfs_del_delalloc_inode(root, inode);
df0af1a5 1780 spin_unlock(&BTRFS_I(inode)->lock);
291d673e 1781 }
291d673e
CM		 1782}
1783
d352ac68
CM		 1784/*
1785 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1786 * we don't create bios that span stripes or chunks
1787 */
64a16701 1788int btrfs_merge_bio_hook(int rw, struct page *page, unsigned long offset,
c8b97818
CM		 1789 size_t size, struct bio *bio,
1790 unsigned long bio_flags)
239b14b3
CM		 1791{
1792 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
4f024f37 1793 u64 logical = (u64)bio->bi_iter.bi_sector << 9;
239b14b3
CM		 1794 u64 length = 0;
1795 u64 map_length;
239b14b3
CM		 1796 int ret;
1797
771ed689
CM		 1798 if (bio_flags & EXTENT_BIO_COMPRESSED)
1799 return 0;
1800
4f024f37 1801 length = bio->bi_iter.bi_size;
239b14b3 1802 map_length = length;
64a16701 1803 ret = btrfs_map_block(root->fs_info, rw, logical,
f188591e 1804 &map_length, NULL, 0);
3ec706c8 1805 /* Will always return 0 with map_multi == NULL */
3444a972 1806 BUG_ON(ret < 0);
d397712b 1807 if (map_length < length + size)
239b14b3 1808 return 1;
3444a972 1809 return 0;
239b14b3
CM		 1810}
1811
d352ac68
CM		 1812/*
1813 * in order to insert checksums into the metadata in large chunks,
1814 * we wait until bio submission time. All the pages in the bio are
1815 * checksummed and sums are attached onto the ordered extent record.
1816 *
1817 * At IO completion time the cums attached on the ordered extent record
1818 * are inserted into the btree
1819 */
d397712b
CM		 1820static int __btrfs_submit_bio_start(struct inode *inode, int rw,
1821 struct bio *bio, int mirror_num,
eaf25d93
CM		 1822 unsigned long bio_flags,
1823 u64 bio_offset)
065631f6 1824{
065631f6 1825 struct btrfs_root *root = BTRFS_I(inode)->root;
065631f6 1826 int ret = 0;
e015640f 1827
d20f7043 1828 ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
79787eaa 1829 BUG_ON(ret); /* -ENOMEM */
4a69a410
CM		 1830 return 0;
1831}
e015640f 1832
4a69a410
CM		 1833/*
1834 * in order to insert checksums into the metadata in large chunks,
1835 * we wait until bio submission time. All the pages in the bio are
1836 * checksummed and sums are attached onto the ordered extent record.
1837 *
1838 * At IO completion time the cums attached on the ordered extent record
1839 * are inserted into the btree
1840 */
b2950863 1841static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
eaf25d93
CM		 1842 int mirror_num, unsigned long bio_flags,
1843 u64 bio_offset)
4a69a410
CM		 1844{
1845 struct btrfs_root *root = BTRFS_I(inode)->root;
61891923
SB		 1846 int ret;
1847
1848 ret = btrfs_map_bio(root, rw, bio, mirror_num, 1);
1849 if (ret)
1850 bio_endio(bio, ret);
1851 return ret;
44b8bd7e
CM		 1852}
1853
d352ac68 1854/*
cad321ad
CM		 1855 * extent_io.c submission hook. This does the right thing for csum calculation
1856 * on write, or reading the csums from the tree before a read
d352ac68 1857 */
b2950863 1858static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
eaf25d93
CM		 1859 int mirror_num, unsigned long bio_flags,
1860 u64 bio_offset)
44b8bd7e
CM		 1861{
1862 struct btrfs_root *root = BTRFS_I(inode)->root;
1863 int ret = 0;
19b9bdb0 1864 int skip_sum;
0417341e 1865 int metadata = 0;
b812ce28 1866 int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
44b8bd7e 1867
6cbff00f 1868 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
cad321ad 1869
83eea1f1 1870 if (btrfs_is_free_space_inode(inode))
0417341e
JM		 1871 metadata = 2;
1872
7b6d91da 1873 if (!(rw & REQ_WRITE)) {
5fd02043
JB		 1874 ret = btrfs_bio_wq_end_io(root->fs_info, bio, metadata);
1875 if (ret)
61891923 1876 goto out;
5fd02043 1877
d20f7043 1878 if (bio_flags & EXTENT_BIO_COMPRESSED) {
61891923
SB		 1879 ret = btrfs_submit_compressed_read(inode, bio,
1880 mirror_num,
1881 bio_flags);
1882 goto out;
c2db1073
TI		 1883 } else if (!skip_sum) {
1884 ret = btrfs_lookup_bio_sums(root, inode, bio, NULL);
1885 if (ret)
61891923 1886 goto out;
c2db1073 1887 }
4d1b5fb4 1888 goto mapit;
b812ce28 1889 } else if (async && !skip_sum) {
17d217fe
YZ		 1890 /* csum items have already been cloned */
1891 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1892 goto mapit;
19b9bdb0 1893 /* we're doing a write, do the async checksumming */
61891923 1894 ret = btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
44b8bd7e 1895 inode, rw, bio, mirror_num,
eaf25d93
CM		 1896 bio_flags, bio_offset,
1897 __btrfs_submit_bio_start,
4a69a410 1898 __btrfs_submit_bio_done);
61891923 1899 goto out;
b812ce28
JB		 1900 } else if (!skip_sum) {
1901 ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
1902 if (ret)
1903 goto out;
19b9bdb0
CM		 1904 }
1905
0b86a832 1906mapit:
61891923
SB		 1907 ret = btrfs_map_bio(root, rw, bio, mirror_num, 0);
1908
1909out:
1910 if (ret < 0)
1911 bio_endio(bio, ret);
1912 return ret;
065631f6 1913}
6885f308 1914
d352ac68
CM		 1915/*
1916 * given a list of ordered sums record them in the inode. This happens
1917 * at IO completion time based on sums calculated at bio submission time.
1918 */
ba1da2f4 1919static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
e6dcd2dc
CM		 1920 struct inode *inode, u64 file_offset,
1921 struct list_head *list)
1922{
e6dcd2dc
CM		 1923 struct btrfs_ordered_sum *sum;
1924
c6e30871 1925 list_for_each_entry(sum, list, list) {
39847c4d 1926 trans->adding_csums = 1;
d20f7043
CM		 1927 btrfs_csum_file_blocks(trans,
1928 BTRFS_I(inode)->root->fs_info->csum_root, sum);
39847c4d 1929 trans->adding_csums = 0;
e6dcd2dc
CM		 1930 }
1931 return 0;
1932}
1933
2ac55d41
JB		 1934int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
1935 struct extent_state **cached_state)
ea8c2819 1936{
6c1500f2 1937 WARN_ON((end & (PAGE_CACHE_SIZE - 1)) == 0);
ea8c2819 1938 return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
2ac55d41 1939 cached_state, GFP_NOFS);
ea8c2819
CM		 1940}
1941
d352ac68 1942/* see btrfs_writepage_start_hook for details on why this is required */
247e743c
CM		 1943struct btrfs_writepage_fixup {
1944 struct page *page;
1945 struct btrfs_work work;
1946};
1947
b2950863 1948static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
247e743c
CM		 1949{
1950 struct btrfs_writepage_fixup *fixup;
1951 struct btrfs_ordered_extent *ordered;
2ac55d41 1952 struct extent_state *cached_state = NULL;
247e743c
CM		 1953 struct page *page;
1954 struct inode *inode;
1955 u64 page_start;
1956 u64 page_end;
87826df0 1957 int ret;
247e743c
CM		 1958
1959 fixup = container_of(work, struct btrfs_writepage_fixup, work);
1960 page = fixup->page;
4a096752 1961again:
247e743c
CM		 1962 lock_page(page);
1963 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
1964 ClearPageChecked(page);
1965 goto out_page;
1966 }
1967
1968 inode = page->mapping->host;
1969 page_start = page_offset(page);
1970 page_end = page_offset(page) + PAGE_CACHE_SIZE - 1;
1971
2ac55d41 1972 lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0,
d0082371 1973 &cached_state);
4a096752
CM		 1974
1975 /* already ordered? We're done */
8b62b72b 1976 if (PagePrivate2(page))
247e743c 1977 goto out;
4a096752
CM		 1978
1979 ordered = btrfs_lookup_ordered_extent(inode, page_start);
1980 if (ordered) {
2ac55d41
JB		 1981 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
1982 page_end, &cached_state, GFP_NOFS);
4a096752
CM		 1983 unlock_page(page);
1984 btrfs_start_ordered_extent(inode, ordered, 1);
87826df0 1985 btrfs_put_ordered_extent(ordered);
4a096752
CM		 1986 goto again;
1987 }
247e743c 1988
87826df0
JM		 1989 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
1990 if (ret) {
1991 mapping_set_error(page->mapping, ret);
1992 end_extent_writepage(page, ret, page_start, page_end);
1993 ClearPageChecked(page);
1994 goto out;
1995 }
1996
2ac55d41 1997 btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state);
247e743c 1998 ClearPageChecked(page);
87826df0 1999 set_page_dirty(page);
247e743c 2000out:
2ac55d41
JB		 2001 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
2002 &cached_state, GFP_NOFS);
247e743c
CM		 2003out_page:
2004 unlock_page(page);
2005 page_cache_release(page);
b897abec 2006 kfree(fixup);
247e743c
CM		 2007}
2008
2009/*
2010 * There are a few paths in the higher layers of the kernel that directly
2011 * set the page dirty bit without asking the filesystem if it is a
2012 * good idea. This causes problems because we want to make sure COW
2013 * properly happens and the data=ordered rules are followed.
2014 *
c8b97818 2015 * In our case any range that doesn't have the ORDERED bit set
247e743c
CM		 2016 * hasn't been properly setup for IO. We kick off an async process
2017 * to fix it up. The async helper will wait for ordered extents, set
2018 * the delalloc bit and make it safe to write the page.
2019 */
b2950863 2020static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
247e743c
CM		 2021{
2022 struct inode *inode = page->mapping->host;
2023 struct btrfs_writepage_fixup *fixup;
2024 struct btrfs_root *root = BTRFS_I(inode)->root;
247e743c 2025
8b62b72b
CM		 2026 /* this page is properly in the ordered list */
2027 if (TestClearPagePrivate2(page))
247e743c
CM		 2028 return 0;
2029
2030 if (PageChecked(page))
2031 return -EAGAIN;
2032
2033 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2034 if (!fixup)
2035 return -EAGAIN;
f421950f 2036
247e743c
CM		 2037 SetPageChecked(page);
2038 page_cache_get(page);
9e0af237
LB		 2039 btrfs_init_work(&fixup->work, btrfs_fixup_helper,
2040 btrfs_writepage_fixup_worker, NULL, NULL);
247e743c 2041 fixup->page = page;
dc6e3209 2042 btrfs_queue_work(root->fs_info->fixup_workers, &fixup->work);
87826df0 2043 return -EBUSY;
247e743c
CM		 2044}
2045
d899e052
YZ		 2046static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2047 struct inode *inode, u64 file_pos,
2048 u64 disk_bytenr, u64 disk_num_bytes,
2049 u64 num_bytes, u64 ram_bytes,
2050 u8 compression, u8 encryption,
2051 u16 other_encoding, int extent_type)
2052{
2053 struct btrfs_root *root = BTRFS_I(inode)->root;
2054 struct btrfs_file_extent_item *fi;
2055 struct btrfs_path *path;
2056 struct extent_buffer *leaf;
2057 struct btrfs_key ins;
1acae57b 2058 int extent_inserted = 0;
d899e052
YZ		 2059 int ret;
2060
2061 path = btrfs_alloc_path();
d8926bb3
MF		 2062 if (!path)
2063 return -ENOMEM;
d899e052 2064
a1ed835e
CM		 2065 /*
2066 * we may be replacing one extent in the tree with another.
2067 * The new extent is pinned in the extent map, and we don't want
2068 * to drop it from the cache until it is completely in the btree.
2069 *
2070 * So, tell btrfs_drop_extents to leave this extent in the cache.
2071 * the caller is expected to unpin it and allow it to be merged
2072 * with the others.
2073 */
1acae57b
FDBM		 2074 ret = __btrfs_drop_extents(trans, root, inode, path, file_pos,
2075 file_pos + num_bytes, NULL, 0,
2076 1, sizeof(*fi), &extent_inserted);
79787eaa
JM		 2077 if (ret)
2078 goto out;
d899e052 2079
1acae57b
FDBM		 2080 if (!extent_inserted) {
2081 ins.objectid = btrfs_ino(inode);
2082 ins.offset = file_pos;
2083 ins.type = BTRFS_EXTENT_DATA_KEY;
2084
2085 path->leave_spinning = 1;
2086 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2087 sizeof(*fi));
2088 if (ret)
2089 goto out;
2090 }
d899e052
YZ		 2091 leaf = path->nodes[0];
2092 fi = btrfs_item_ptr(leaf, path->slots[0],
2093 struct btrfs_file_extent_item);
2094 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
2095 btrfs_set_file_extent_type(leaf, fi, extent_type);
2096 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
2097 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
2098 btrfs_set_file_extent_offset(leaf, fi, 0);
2099 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
2100 btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
2101 btrfs_set_file_extent_compression(leaf, fi, compression);
2102 btrfs_set_file_extent_encryption(leaf, fi, encryption);
2103 btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
b9473439 2104
d899e052 2105 btrfs_mark_buffer_dirty(leaf);
ce195332 2106 btrfs_release_path(path);
d899e052
YZ		 2107
2108 inode_add_bytes(inode, num_bytes);
d899e052
YZ		 2109
2110 ins.objectid = disk_bytenr;
2111 ins.offset = disk_num_bytes;
2112 ins.type = BTRFS_EXTENT_ITEM_KEY;
5d4f98a2
YZ		 2113 ret = btrfs_alloc_reserved_file_extent(trans, root,
2114 root->root_key.objectid,
33345d01 2115 btrfs_ino(inode), file_pos, &ins);
79787eaa 2116out:
d899e052 2117 btrfs_free_path(path);
b9473439 2118
79787eaa 2119 return ret;
d899e052
YZ		 2120}
2121
38c227d8
LB		 2122/* snapshot-aware defrag */
2123struct sa_defrag_extent_backref {
2124 struct rb_node node;
2125 struct old_sa_defrag_extent *old;
2126 u64 root_id;
2127 u64 inum;
2128 u64 file_pos;
2129 u64 extent_offset;
2130 u64 num_bytes;
2131 u64 generation;
2132};
2133
2134struct old_sa_defrag_extent {
2135 struct list_head list;
2136 struct new_sa_defrag_extent *new;
2137
2138 u64 extent_offset;
2139 u64 bytenr;
2140 u64 offset;
2141 u64 len;
2142 int count;
2143};
2144
2145struct new_sa_defrag_extent {
2146 struct rb_root root;
2147 struct list_head head;
2148 struct btrfs_path *path;
2149 struct inode *inode;
2150 u64 file_pos;
2151 u64 len;
2152 u64 bytenr;
2153 u64 disk_len;
2154 u8 compress_type;
2155};
2156
2157static int backref_comp(struct sa_defrag_extent_backref *b1,
2158 struct sa_defrag_extent_backref *b2)
2159{
2160 if (b1->root_id < b2->root_id)
2161 return -1;
2162 else if (b1->root_id > b2->root_id)
2163 return 1;
2164
2165 if (b1->inum < b2->inum)
2166 return -1;
2167 else if (b1->inum > b2->inum)
2168 return 1;
2169
2170 if (b1->file_pos < b2->file_pos)
2171 return -1;
2172 else if (b1->file_pos > b2->file_pos)
2173 return 1;
2174
2175 /*
2176 * [------------------------------] ===> (a range of space)
2177 * |<--->| |<---->| =============> (fs/file tree A)
2178 * |<---------------------------->| ===> (fs/file tree B)
2179 *
2180 * A range of space can refer to two file extents in one tree while
2181 * refer to only one file extent in another tree.
2182 *
2183 * So we may process a disk offset more than one time(two extents in A)
2184 * and locate at the same extent(one extent in B), then insert two same
2185 * backrefs(both refer to the extent in B).
2186 */
2187 return 0;
2188}
2189
2190static void backref_insert(struct rb_root *root,
2191 struct sa_defrag_extent_backref *backref)
2192{
2193 struct rb_node **p = &root->rb_node;
2194 struct rb_node *parent = NULL;
2195 struct sa_defrag_extent_backref *entry;
2196 int ret;
2197
2198 while (*p) {
2199 parent = *p;
2200 entry = rb_entry(parent, struct sa_defrag_extent_backref, node);
2201
2202 ret = backref_comp(backref, entry);
2203 if (ret < 0)
2204 p = &(*p)->rb_left;
2205 else
2206 p = &(*p)->rb_right;
2207 }
2208
2209 rb_link_node(&backref->node, parent, p);
2210 rb_insert_color(&backref->node, root);
2211}
2212
2213/*
2214 * Note the backref might has changed, and in this case we just return 0.
2215 */
2216static noinline int record_one_backref(u64 inum, u64 offset, u64 root_id,
2217 void *ctx)
2218{
2219 struct btrfs_file_extent_item *extent;
2220 struct btrfs_fs_info *fs_info;
2221 struct old_sa_defrag_extent *old = ctx;
2222 struct new_sa_defrag_extent *new = old->new;
2223 struct btrfs_path *path = new->path;
2224 struct btrfs_key key;
2225 struct btrfs_root *root;
2226 struct sa_defrag_extent_backref *backref;
2227 struct extent_buffer *leaf;
2228 struct inode *inode = new->inode;
2229 int slot;
2230 int ret;
2231 u64 extent_offset;
2232 u64 num_bytes;
2233
2234 if (BTRFS_I(inode)->root->root_key.objectid == root_id &&
2235 inum == btrfs_ino(inode))
2236 return 0;
2237
2238 key.objectid = root_id;
2239 key.type = BTRFS_ROOT_ITEM_KEY;
2240 key.offset = (u64)-1;
2241
2242 fs_info = BTRFS_I(inode)->root->fs_info;
2243 root = btrfs_read_fs_root_no_name(fs_info, &key);
2244 if (IS_ERR(root)) {
2245 if (PTR_ERR(root) == -ENOENT)
2246 return 0;
2247 WARN_ON(1);
2248 pr_debug("inum=%llu, offset=%llu, root_id=%llu\n",
2249 inum, offset, root_id);
2250 return PTR_ERR(root);
2251 }
2252
2253 key.objectid = inum;
2254 key.type = BTRFS_EXTENT_DATA_KEY;
2255 if (offset > (u64)-1 << 32)
2256 key.offset = 0;
2257 else
2258 key.offset = offset;
2259
2260 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
fae7f21c 2261 if (WARN_ON(ret < 0))
38c227d8 2262 return ret;
50f1319c 2263 ret = 0;
38c227d8
LB		 2264
2265 while (1) {
2266 cond_resched();
2267
2268 leaf = path->nodes[0];
2269 slot = path->slots[0];
2270
2271 if (slot >= btrfs_header_nritems(leaf)) {
2272 ret = btrfs_next_leaf(root, path);
2273 if (ret < 0) {
2274 goto out;
2275 } else if (ret > 0) {
2276 ret = 0;
2277 goto out;
2278 }
2279 continue;
2280 }
2281
2282 path->slots[0]++;
2283
2284 btrfs_item_key_to_cpu(leaf, &key, slot);
2285
2286 if (key.objectid > inum)
2287 goto out;
2288
2289 if (key.objectid < inum || key.type != BTRFS_EXTENT_DATA_KEY)
2290 continue;
2291
2292 extent = btrfs_item_ptr(leaf, slot,
2293 struct btrfs_file_extent_item);
2294
2295 if (btrfs_file_extent_disk_bytenr(leaf, extent) != old->bytenr)
2296 continue;
2297
e68afa49
LB		 2298 /*
2299 * 'offset' refers to the exact key.offset,
2300 * NOT the 'offset' field in btrfs_extent_data_ref, ie.
2301 * (key.offset - extent_offset).
2302 */
2303 if (key.offset != offset)
38c227d8
LB		 2304 continue;
2305
e68afa49 2306 extent_offset = btrfs_file_extent_offset(leaf, extent);
38c227d8 2307 num_bytes = btrfs_file_extent_num_bytes(leaf, extent);
e68afa49 2308
38c227d8
LB		 2309 if (extent_offset >= old->extent_offset + old->offset +
2310 old->len || extent_offset + num_bytes <=
2311 old->extent_offset + old->offset)
2312 continue;
38c227d8
LB		 2313 break;
2314 }
2315
2316 backref = kmalloc(sizeof(*backref), GFP_NOFS);
2317 if (!backref) {
2318 ret = -ENOENT;
2319 goto out;
2320 }
2321
2322 backref->root_id = root_id;
2323 backref->inum = inum;
e68afa49 2324 backref->file_pos = offset;
38c227d8
LB		 2325 backref->num_bytes = num_bytes;
2326 backref->extent_offset = extent_offset;
2327 backref->generation = btrfs_file_extent_generation(leaf, extent);
2328 backref->old = old;
2329 backref_insert(&new->root, backref);
2330 old->count++;
2331out:
2332 btrfs_release_path(path);
2333 WARN_ON(ret);
2334 return ret;
2335}
2336
2337static noinline bool record_extent_backrefs(struct btrfs_path *path,
2338 struct new_sa_defrag_extent *new)
2339{
2340 struct btrfs_fs_info *fs_info = BTRFS_I(new->inode)->root->fs_info;
2341 struct old_sa_defrag_extent *old, *tmp;
2342 int ret;
2343
2344 new->path = path;
2345
2346 list_for_each_entry_safe(old, tmp, &new->head, list) {
e68afa49
LB		 2347 ret = iterate_inodes_from_logical(old->bytenr +
2348 old->extent_offset, fs_info,
38c227d8
LB		 2349 path, record_one_backref,
2350 old);
4724b106
JB		 2351 if (ret < 0 && ret != -ENOENT)
2352 return false;
38c227d8
LB		 2353
2354 /* no backref to be processed for this extent */
2355 if (!old->count) {
2356 list_del(&old->list);
2357 kfree(old);
2358 }
2359 }
2360
2361 if (list_empty(&new->head))
2362 return false;
2363
2364 return true;
2365}
2366
2367static int relink_is_mergable(struct extent_buffer *leaf,
2368 struct btrfs_file_extent_item *fi,
116e0024 2369 struct new_sa_defrag_extent *new)
38c227d8 2370{
116e0024 2371 if (btrfs_file_extent_disk_bytenr(leaf, fi) != new->bytenr)
38c227d8
LB		 2372 return 0;
2373
2374 if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG)
2375 return 0;
2376
116e0024
LB		 2377 if (btrfs_file_extent_compression(leaf, fi) != new->compress_type)
2378 return 0;
2379
2380 if (btrfs_file_extent_encryption(leaf, fi) ||
38c227d8
LB		 2381 btrfs_file_extent_other_encoding(leaf, fi))
2382 return 0;
2383
2384 return 1;
2385}
2386
2387/*
2388 * Note the backref might has changed, and in this case we just return 0.
2389 */
2390static noinline int relink_extent_backref(struct btrfs_path *path,
2391 struct sa_defrag_extent_backref *prev,
2392 struct sa_defrag_extent_backref *backref)
2393{
2394 struct btrfs_file_extent_item *extent;
2395 struct btrfs_file_extent_item *item;
2396 struct btrfs_ordered_extent *ordered;
2397 struct btrfs_trans_handle *trans;
2398 struct btrfs_fs_info *fs_info;
2399 struct btrfs_root *root;
2400 struct btrfs_key key;
2401 struct extent_buffer *leaf;
2402 struct old_sa_defrag_extent *old = backref->old;
2403 struct new_sa_defrag_extent *new = old->new;
2404 struct inode *src_inode = new->inode;
2405 struct inode *inode;
2406 struct extent_state *cached = NULL;
2407 int ret = 0;
2408 u64 start;
2409 u64 len;
2410 u64 lock_start;
2411 u64 lock_end;
2412 bool merge = false;
2413 int index;
2414
2415 if (prev && prev->root_id == backref->root_id &&
2416 prev->inum == backref->inum &&
2417 prev->file_pos + prev->num_bytes == backref->file_pos)
2418 merge = true;
2419
2420 /* step 1: get root */
2421 key.objectid = backref->root_id;
2422 key.type = BTRFS_ROOT_ITEM_KEY;
2423 key.offset = (u64)-1;
2424
2425 fs_info = BTRFS_I(src_inode)->root->fs_info;
2426 index = srcu_read_lock(&fs_info->subvol_srcu);
2427
2428 root = btrfs_read_fs_root_no_name(fs_info, &key);
2429 if (IS_ERR(root)) {
2430 srcu_read_unlock(&fs_info->subvol_srcu, index);
2431 if (PTR_ERR(root) == -ENOENT)
2432 return 0;
2433 return PTR_ERR(root);
2434 }
38c227d8 2435
bcbba5e6
WS		 2436 if (btrfs_root_readonly(root)) {
2437 srcu_read_unlock(&fs_info->subvol_srcu, index);
2438 return 0;
2439 }
2440
38c227d8
LB		 2441 /* step 2: get inode */
2442 key.objectid = backref->inum;
2443 key.type = BTRFS_INODE_ITEM_KEY;
2444 key.offset = 0;
2445
2446 inode = btrfs_iget(fs_info->sb, &key, root, NULL);
2447 if (IS_ERR(inode)) {
2448 srcu_read_unlock(&fs_info->subvol_srcu, index);
2449 return 0;
2450 }
2451
2452 srcu_read_unlock(&fs_info->subvol_srcu, index);
2453
2454 /* step 3: relink backref */
2455 lock_start = backref->file_pos;
2456 lock_end = backref->file_pos + backref->num_bytes - 1;
2457 lock_extent_bits(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2458 0, &cached);
2459
2460 ordered = btrfs_lookup_first_ordered_extent(inode, lock_end);
2461 if (ordered) {
2462 btrfs_put_ordered_extent(ordered);
2463 goto out_unlock;
2464 }
2465
2466 trans = btrfs_join_transaction(root);
2467 if (IS_ERR(trans)) {
2468 ret = PTR_ERR(trans);
2469 goto out_unlock;
2470 }
2471
2472 key.objectid = backref->inum;
2473 key.type = BTRFS_EXTENT_DATA_KEY;
2474 key.offset = backref->file_pos;
2475
2476 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2477 if (ret < 0) {
2478 goto out_free_path;
2479 } else if (ret > 0) {
2480 ret = 0;
2481 goto out_free_path;
2482 }
2483
2484 extent = btrfs_item_ptr(path->nodes[0], path->slots[0],
2485 struct btrfs_file_extent_item);
2486
2487 if (btrfs_file_extent_generation(path->nodes[0], extent) !=
2488 backref->generation)
2489 goto out_free_path;
2490
2491 btrfs_release_path(path);
2492
2493 start = backref->file_pos;
2494 if (backref->extent_offset < old->extent_offset + old->offset)
2495 start += old->extent_offset + old->offset -
2496 backref->extent_offset;
2497
2498 len = min(backref->extent_offset + backref->num_bytes,
2499 old->extent_offset + old->offset + old->len);
2500 len -= max(backref->extent_offset, old->extent_offset + old->offset);
2501
2502 ret = btrfs_drop_extents(trans, root, inode, start,
2503 start + len, 1);
2504 if (ret)
2505 goto out_free_path;
2506again:
2507 key.objectid = btrfs_ino(inode);
2508 key.type = BTRFS_EXTENT_DATA_KEY;
2509 key.offset = start;
2510
a09a0a70 2511 path->leave_spinning = 1;
38c227d8
LB		 2512 if (merge) {
2513 struct btrfs_file_extent_item *fi;
2514 u64 extent_len;
2515 struct btrfs_key found_key;
2516
3c9665df 2517 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
38c227d8
LB		 2518 if (ret < 0)
2519 goto out_free_path;
2520
2521 path->slots[0]--;
2522 leaf = path->nodes[0];
2523 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2524
2525 fi = btrfs_item_ptr(leaf, path->slots[0],
2526 struct btrfs_file_extent_item);
2527 extent_len = btrfs_file_extent_num_bytes(leaf, fi);
2528
116e0024
LB		 2529 if (extent_len + found_key.offset == start &&
2530 relink_is_mergable(leaf, fi, new)) {
38c227d8
LB		 2531 btrfs_set_file_extent_num_bytes(leaf, fi,
2532 extent_len + len);
2533 btrfs_mark_buffer_dirty(leaf);
2534 inode_add_bytes(inode, len);
2535
2536 ret = 1;
2537 goto out_free_path;
2538 } else {
2539 merge = false;
2540 btrfs_release_path(path);
2541 goto again;
2542 }
2543 }
2544
2545 ret = btrfs_insert_empty_item(trans, root, path, &key,
2546 sizeof(*extent));
2547 if (ret) {
2548 btrfs_abort_transaction(trans, root, ret);
2549 goto out_free_path;
2550 }
2551
2552 leaf = path->nodes[0];
2553 item = btrfs_item_ptr(leaf, path->slots[0],
2554 struct btrfs_file_extent_item);
2555 btrfs_set_file_extent_disk_bytenr(leaf, item, new->bytenr);
2556 btrfs_set_file_extent_disk_num_bytes(leaf, item, new->disk_len);
2557 btrfs_set_file_extent_offset(leaf, item, start - new->file_pos);
2558 btrfs_set_file_extent_num_bytes(leaf, item, len);
2559 btrfs_set_file_extent_ram_bytes(leaf, item, new->len);
2560 btrfs_set_file_extent_generation(leaf, item, trans->transid);
2561 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
2562 btrfs_set_file_extent_compression(leaf, item, new->compress_type);
2563 btrfs_set_file_extent_encryption(leaf, item, 0);
2564 btrfs_set_file_extent_other_encoding(leaf, item, 0);
2565
2566 btrfs_mark_buffer_dirty(leaf);
2567 inode_add_bytes(inode, len);
a09a0a70 2568 btrfs_release_path(path);
38c227d8
LB		 2569
2570 ret = btrfs_inc_extent_ref(trans, root, new->bytenr,
2571 new->disk_len, 0,
2572 backref->root_id, backref->inum,
2573 new->file_pos, 0); /* start - extent_offset */
2574 if (ret) {
2575 btrfs_abort_transaction(trans, root, ret);
2576 goto out_free_path;
2577 }
2578
2579 ret = 1;
2580out_free_path:
2581 btrfs_release_path(path);
a09a0a70 2582 path->leave_spinning = 0;
38c227d8
LB		 2583 btrfs_end_transaction(trans, root);
2584out_unlock:
2585 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2586 &cached, GFP_NOFS);
2587 iput(inode);
2588 return ret;
2589}
2590
6f519564
LB		 2591static void free_sa_defrag_extent(struct new_sa_defrag_extent *new)
2592{
2593 struct old_sa_defrag_extent *old, *tmp;
2594
2595 if (!new)
2596 return;
2597
2598 list_for_each_entry_safe(old, tmp, &new->head, list) {
2599 list_del(&old->list);
2600 kfree(old);
2601 }
2602 kfree(new);
2603}
2604
38c227d8
LB		 2605static void relink_file_extents(struct new_sa_defrag_extent *new)
2606{
2607 struct btrfs_path *path;
38c227d8
LB		 2608 struct sa_defrag_extent_backref *backref;
2609 struct sa_defrag_extent_backref *prev = NULL;
2610 struct inode *inode;
2611 struct btrfs_root *root;
2612 struct rb_node *node;
2613 int ret;
2614
2615 inode = new->inode;
2616 root = BTRFS_I(inode)->root;
2617
2618 path = btrfs_alloc_path();
2619 if (!path)
2620 return;
2621
2622 if (!record_extent_backrefs(path, new)) {
2623 btrfs_free_path(path);
2624 goto out;
2625 }
2626 btrfs_release_path(path);
2627
2628 while (1) {
2629 node = rb_first(&new->root);
2630 if (!node)
2631 break;
2632 rb_erase(node, &new->root);
2633
2634 backref = rb_entry(node, struct sa_defrag_extent_backref, node);
2635
2636 ret = relink_extent_backref(path, prev, backref);
2637 WARN_ON(ret < 0);
2638
2639 kfree(prev);
2640
2641 if (ret == 1)
2642 prev = backref;
2643 else
2644 prev = NULL;
2645 cond_resched();
2646 }
2647 kfree(prev);
2648
2649 btrfs_free_path(path);
38c227d8 2650out:
6f519564
LB		 2651 free_sa_defrag_extent(new);
2652
38c227d8
LB		 2653 atomic_dec(&root->fs_info->defrag_running);
2654 wake_up(&root->fs_info->transaction_wait);
38c227d8
LB		 2655}
2656
2657static struct new_sa_defrag_extent *
2658record_old_file_extents(struct inode *inode,
2659 struct btrfs_ordered_extent *ordered)
2660{
2661 struct btrfs_root *root = BTRFS_I(inode)->root;
2662 struct btrfs_path *path;
2663 struct btrfs_key key;
6f519564 2664 struct old_sa_defrag_extent *old;
38c227d8
LB		 2665 struct new_sa_defrag_extent *new;
2666 int ret;
2667
2668 new = kmalloc(sizeof(*new), GFP_NOFS);
2669 if (!new)
2670 return NULL;
2671
2672 new->inode = inode;
2673 new->file_pos = ordered->file_offset;
2674 new->len = ordered->len;
2675 new->bytenr = ordered->start;
2676 new->disk_len = ordered->disk_len;
2677 new->compress_type = ordered->compress_type;
2678 new->root = RB_ROOT;
2679 INIT_LIST_HEAD(&new->head);
2680
2681 path = btrfs_alloc_path();
2682 if (!path)
2683 goto out_kfree;
2684
2685 key.objectid = btrfs_ino(inode);
2686 key.type = BTRFS_EXTENT_DATA_KEY;
2687 key.offset = new->file_pos;
2688
2689 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2690 if (ret < 0)
2691 goto out_free_path;
2692 if (ret > 0 && path->slots[0] > 0)
2693 path->slots[0]--;
2694
2695 /* find out all the old extents for the file range */
2696 while (1) {
2697 struct btrfs_file_extent_item *extent;
2698 struct extent_buffer *l;
2699 int slot;
2700 u64 num_bytes;
2701 u64 offset;
2702 u64 end;
2703 u64 disk_bytenr;
2704 u64 extent_offset;
2705
2706 l = path->nodes[0];
2707 slot = path->slots[0];
2708
2709 if (slot >= btrfs_header_nritems(l)) {
2710 ret = btrfs_next_leaf(root, path);
2711 if (ret < 0)
6f519564 2712 goto out_free_path;
38c227d8
LB		 2713 else if (ret > 0)
2714 break;
2715 continue;
2716 }
2717
2718 btrfs_item_key_to_cpu(l, &key, slot);
2719
2720 if (key.objectid != btrfs_ino(inode))
2721 break;
2722 if (key.type != BTRFS_EXTENT_DATA_KEY)
2723 break;
2724 if (key.offset >= new->file_pos + new->len)
2725 break;
2726
2727 extent = btrfs_item_ptr(l, slot, struct btrfs_file_extent_item);
2728
2729 num_bytes = btrfs_file_extent_num_bytes(l, extent);
2730 if (key.offset + num_bytes < new->file_pos)
2731 goto next;
2732
2733 disk_bytenr = btrfs_file_extent_disk_bytenr(l, extent);
2734 if (!disk_bytenr)
2735 goto next;
2736
2737 extent_offset = btrfs_file_extent_offset(l, extent);
2738
2739 old = kmalloc(sizeof(*old), GFP_NOFS);
2740 if (!old)
6f519564 2741 goto out_free_path;
38c227d8
LB		 2742
2743 offset = max(new->file_pos, key.offset);
2744 end = min(new->file_pos + new->len, key.offset + num_bytes);
2745
2746 old->bytenr = disk_bytenr;
2747 old->extent_offset = extent_offset;
2748 old->offset = offset - key.offset;
2749 old->len = end - offset;
2750 old->new = new;
2751 old->count = 0;
2752 list_add_tail(&old->list, &new->head);
2753next:
2754 path->slots[0]++;
2755 cond_resched();
2756 }
2757
2758 btrfs_free_path(path);
2759 atomic_inc(&root->fs_info->defrag_running);
2760
2761 return new;
2762
38c227d8
LB		 2763out_free_path:
2764 btrfs_free_path(path);
2765out_kfree:
6f519564 2766 free_sa_defrag_extent(new);
38c227d8
LB		 2767 return NULL;
2768}
2769
e570fd27
MX		 2770static void btrfs_release_delalloc_bytes(struct btrfs_root *root,
2771 u64 start, u64 len)
2772{
2773 struct btrfs_block_group_cache *cache;
2774
2775 cache = btrfs_lookup_block_group(root->fs_info, start);
2776 ASSERT(cache);
2777
2778 spin_lock(&cache->lock);
2779 cache->delalloc_bytes -= len;
2780 spin_unlock(&cache->lock);
2781
2782 btrfs_put_block_group(cache);
2783}
2784
d352ac68
CM		 2785/* as ordered data IO finishes, this gets called so we can finish
2786 * an ordered extent if the range of bytes in the file it covers are
2787 * fully written.
2788 */
5fd02043 2789static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
e6dcd2dc 2790{
5fd02043 2791 struct inode *inode = ordered_extent->inode;
e6dcd2dc 2792 struct btrfs_root *root = BTRFS_I(inode)->root;
0ca1f7ce 2793 struct btrfs_trans_handle *trans = NULL;
e6dcd2dc 2794 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
2ac55d41 2795 struct extent_state *cached_state = NULL;
38c227d8 2796 struct new_sa_defrag_extent *new = NULL;
261507a0 2797 int compress_type = 0;
77cef2ec
JB		 2798 int ret = 0;
2799 u64 logical_len = ordered_extent->len;
82d5902d 2800 bool nolock;
77cef2ec 2801 bool truncated = false;
e6dcd2dc 2802
83eea1f1 2803 nolock = btrfs_is_free_space_inode(inode);
0cb59c99 2804
5fd02043
JB		 2805 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
2806 ret = -EIO;
2807 goto out;
2808 }
2809
f612496b
MX		 2810 btrfs_free_io_failure_record(inode, ordered_extent->file_offset,
2811 ordered_extent->file_offset +
2812 ordered_extent->len - 1);
2813
77cef2ec
JB		 2814 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
2815 truncated = true;
2816 logical_len = ordered_extent->truncated_len;
2817 /* Truncated the entire extent, don't bother adding */
2818 if (!logical_len)
2819 goto out;
2820 }
2821
c2167754 2822 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
79787eaa 2823 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
6c760c07
JB		 2824 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
2825 if (nolock)
2826 trans = btrfs_join_transaction_nolock(root);
2827 else
2828 trans = btrfs_join_transaction(root);
2829 if (IS_ERR(trans)) {
2830 ret = PTR_ERR(trans);
2831 trans = NULL;
2832 goto out;
c2167754 2833 }
6c760c07
JB		 2834 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
2835 ret = btrfs_update_inode_fallback(trans, root, inode);
2836 if (ret) /* -ENOMEM or corruption */
2837 btrfs_abort_transaction(trans, root, ret);
c2167754
YZ		 2838 goto out;
2839 }
e6dcd2dc 2840
2ac55d41
JB		 2841 lock_extent_bits(io_tree, ordered_extent->file_offset,
2842 ordered_extent->file_offset + ordered_extent->len - 1,
d0082371 2843 0, &cached_state);
e6dcd2dc 2844
38c227d8
LB		 2845 ret = test_range_bit(io_tree, ordered_extent->file_offset,
2846 ordered_extent->file_offset + ordered_extent->len - 1,
2847 EXTENT_DEFRAG, 1, cached_state);
2848 if (ret) {
2849 u64 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
8101c8db 2850 if (0 && last_snapshot >= BTRFS_I(inode)->generation)
38c227d8
LB		 2851 /* the inode is shared */
2852 new = record_old_file_extents(inode, ordered_extent);
2853
2854 clear_extent_bit(io_tree, ordered_extent->file_offset,
2855 ordered_extent->file_offset + ordered_extent->len - 1,
2856 EXTENT_DEFRAG, 0, 0, &cached_state, GFP_NOFS);
2857 }
2858
0cb59c99 2859 if (nolock)
7a7eaa40 2860 trans = btrfs_join_transaction_nolock(root);
0cb59c99 2861 else
7a7eaa40 2862 trans = btrfs_join_transaction(root);
79787eaa
JM		 2863 if (IS_ERR(trans)) {
2864 ret = PTR_ERR(trans);
2865 trans = NULL;
2866 goto out_unlock;
2867 }
a79b7d4b 2868
0ca1f7ce 2869 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
c2167754 2870
c8b97818 2871 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
261507a0 2872 compress_type = ordered_extent->compress_type;
d899e052 2873 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
261507a0 2874 BUG_ON(compress_type);
920bbbfb 2875 ret = btrfs_mark_extent_written(trans, inode,
d899e052
YZ		 2876 ordered_extent->file_offset,
2877 ordered_extent->file_offset +
77cef2ec 2878 logical_len);
d899e052 2879 } else {
0af3d00b 2880 BUG_ON(root == root->fs_info->tree_root);
d899e052
YZ		 2881 ret = insert_reserved_file_extent(trans, inode,
2882 ordered_extent->file_offset,
2883 ordered_extent->start,
2884 ordered_extent->disk_len,
77cef2ec 2885 logical_len, logical_len,
261507a0 2886 compress_type, 0, 0,
d899e052 2887 BTRFS_FILE_EXTENT_REG);
e570fd27
MX		 2888 if (!ret)
2889 btrfs_release_delalloc_bytes(root,
2890 ordered_extent->start,
2891 ordered_extent->disk_len);
d899e052 2892 }
5dc562c5
JB		 2893 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
2894 ordered_extent->file_offset, ordered_extent->len,
2895 trans->transid);
79787eaa
JM		 2896 if (ret < 0) {
2897 btrfs_abort_transaction(trans, root, ret);
5fd02043 2898 goto out_unlock;
79787eaa 2899 }
2ac55d41 2900
e6dcd2dc
CM		 2901 add_pending_csums(trans, inode, ordered_extent->file_offset,
2902 &ordered_extent->list);
2903
6c760c07
JB		 2904 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
2905 ret = btrfs_update_inode_fallback(trans, root, inode);
2906 if (ret) { /* -ENOMEM or corruption */
2907 btrfs_abort_transaction(trans, root, ret);
2908 goto out_unlock;
1ef30be1
JB		 2909 }
2910 ret = 0;
5fd02043
JB		 2911out_unlock:
2912 unlock_extent_cached(io_tree, ordered_extent->file_offset,
2913 ordered_extent->file_offset +
2914 ordered_extent->len - 1, &cached_state, GFP_NOFS);
c2167754 2915out:
5b0e95bf 2916 if (root != root->fs_info->tree_root)
0cb59c99 2917 btrfs_delalloc_release_metadata(inode, ordered_extent->len);
a698d075
MX		 2918 if (trans)
2919 btrfs_end_transaction(trans, root);
0cb59c99 2920
77cef2ec
JB		 2921 if (ret || truncated) {
2922 u64 start, end;
2923
2924 if (truncated)
2925 start = ordered_extent->file_offset + logical_len;
2926 else
2927 start = ordered_extent->file_offset;
2928 end = ordered_extent->file_offset + ordered_extent->len - 1;
2929 clear_extent_uptodate(io_tree, start, end, NULL, GFP_NOFS);
2930
2931 /* Drop the cache for the part of the extent we didn't write. */
2932 btrfs_drop_extent_cache(inode, start, end, 0);
5fd02043 2933
0bec9ef5
JB		 2934 /*
2935 * If the ordered extent had an IOERR or something else went
2936 * wrong we need to return the space for this ordered extent
77cef2ec
JB		 2937 * back to the allocator. We only free the extent in the
2938 * truncated case if we didn't write out the extent at all.
0bec9ef5 2939 */
77cef2ec
JB		 2940 if ((ret || !logical_len) &&
2941 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
0bec9ef5
JB		 2942 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags))
2943 btrfs_free_reserved_extent(root, ordered_extent->start,
e570fd27 2944 ordered_extent->disk_len, 1);
0bec9ef5
JB		 2945 }
2946
2947
5fd02043 2948 /*
8bad3c02
LB		 2949 * This needs to be done to make sure anybody waiting knows we are done
2950 * updating everything for this ordered extent.
5fd02043
JB		 2951 */
2952 btrfs_remove_ordered_extent(inode, ordered_extent);
2953
38c227d8 2954 /* for snapshot-aware defrag */
6f519564
LB		 2955 if (new) {
2956 if (ret) {
2957 free_sa_defrag_extent(new);
2958 atomic_dec(&root->fs_info->defrag_running);
2959 } else {
2960 relink_file_extents(new);
2961 }
2962 }
38c227d8 2963
e6dcd2dc
CM		 2964 /* once for us */
2965 btrfs_put_ordered_extent(ordered_extent);
2966 /* once for the tree */
2967 btrfs_put_ordered_extent(ordered_extent);
2968
5fd02043
JB		 2969 return ret;
2970}
2971
2972static void finish_ordered_fn(struct btrfs_work *work)
2973{
2974 struct btrfs_ordered_extent *ordered_extent;
2975 ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
2976 btrfs_finish_ordered_io(ordered_extent);
e6dcd2dc
CM		 2977}
2978
b2950863 2979static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
211f90e6
CM		 2980 struct extent_state *state, int uptodate)
2981{
5fd02043
JB		 2982 struct inode *inode = page->mapping->host;
2983 struct btrfs_root *root = BTRFS_I(inode)->root;
2984 struct btrfs_ordered_extent *ordered_extent = NULL;
9e0af237
LB		 2985 struct btrfs_workqueue *wq;
2986 btrfs_work_func_t func;
5fd02043 2987
1abe9b8a 2988 trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
2989
8b62b72b 2990 ClearPagePrivate2(page);
5fd02043
JB		 2991 if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
2992 end - start + 1, uptodate))
2993 return 0;
2994
9e0af237
LB		 2995 if (btrfs_is_free_space_inode(inode)) {
2996 wq = root->fs_info->endio_freespace_worker;
2997 func = btrfs_freespace_write_helper;
2998 } else {
2999 wq = root->fs_info->endio_write_workers;
3000 func = btrfs_endio_write_helper;
3001 }
5fd02043 3002
9e0af237
LB		 3003 btrfs_init_work(&ordered_extent->work, func, finish_ordered_fn, NULL,
3004 NULL);
3005 btrfs_queue_work(wq, &ordered_extent->work);
5fd02043
JB		 3006
3007 return 0;
211f90e6
CM		 3008}
3009
dc380aea
MX		 3010static int __readpage_endio_check(struct inode *inode,
3011 struct btrfs_io_bio *io_bio,
3012 int icsum, struct page *page,
3013 int pgoff, u64 start, size_t len)
3014{
3015 char *kaddr;
3016 u32 csum_expected;
3017 u32 csum = ~(u32)0;
3018 static DEFINE_RATELIMIT_STATE(_rs, DEFAULT_RATELIMIT_INTERVAL,
3019 DEFAULT_RATELIMIT_BURST);
3020
3021 csum_expected = *(((u32 *)io_bio->csum) + icsum);
3022
3023 kaddr = kmap_atomic(page);
3024 csum = btrfs_csum_data(kaddr + pgoff, csum, len);
3025 btrfs_csum_final(csum, (char *)&csum);
3026 if (csum != csum_expected)
3027 goto zeroit;
3028
3029 kunmap_atomic(kaddr);
3030 return 0;
3031zeroit:
3032 if (__ratelimit(&_rs))
f0954c66 3033 btrfs_warn(BTRFS_I(inode)->root->fs_info,
dc380aea
MX		 3034 "csum failed ino %llu off %llu csum %u expected csum %u",
3035 btrfs_ino(inode), start, csum, csum_expected);
3036 memset(kaddr + pgoff, 1, len);
3037 flush_dcache_page(page);
3038 kunmap_atomic(kaddr);
3039 if (csum_expected == 0)
3040 return 0;
3041 return -EIO;
3042}
3043
d352ac68
CM		 3044/*
3045 * when reads are done, we need to check csums to verify the data is correct
4a54c8c1
JS		 3046 * if there's a match, we allow the bio to finish. If not, the code in
3047 * extent_io.c will try to find good copies for us.
d352ac68 3048 */
facc8a22
MX		 3049static int btrfs_readpage_end_io_hook(struct btrfs_io_bio *io_bio,
3050 u64 phy_offset, struct page *page,
3051 u64 start, u64 end, int mirror)
07157aac 3052{
4eee4fa4 3053 size_t offset = start - page_offset(page);
07157aac 3054 struct inode *inode = page->mapping->host;
d1310b2e 3055 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
ff79f819 3056 struct btrfs_root *root = BTRFS_I(inode)->root;
d1310b2e 3057
d20f7043
CM		 3058 if (PageChecked(page)) {
3059 ClearPageChecked(page);
dc380aea 3060 return 0;
d20f7043 3061 }
6cbff00f
CH		 3062
3063 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
dc380aea 3064 return 0;
17d217fe
YZ		 3065
3066 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
9655d298 3067 test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
17d217fe
YZ		 3068 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM,
3069 GFP_NOFS);
b6cda9bc 3070 return 0;
17d217fe 3071 }
d20f7043 3072
facc8a22 3073 phy_offset >>= inode->i_sb->s_blocksize_bits;
dc380aea
MX		 3074 return __readpage_endio_check(inode, io_bio, phy_offset, page, offset,
3075 start, (size_t)(end - start + 1));
07157aac 3076}
b888db2b 3077
24bbcf04
YZ		 3078struct delayed_iput {
3079 struct list_head list;
3080 struct inode *inode;
3081};
3082
79787eaa
JM		 3083/* JDM: If this is fs-wide, why can't we add a pointer to
3084 * btrfs_inode instead and avoid the allocation? */
24bbcf04
YZ		 3085void btrfs_add_delayed_iput(struct inode *inode)
3086{
3087 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
3088 struct delayed_iput *delayed;
3089
3090 if (atomic_add_unless(&inode->i_count, -1, 1))
3091 return;
3092
3093 delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL);
3094 delayed->inode = inode;
3095
3096 spin_lock(&fs_info->delayed_iput_lock);
3097 list_add_tail(&delayed->list, &fs_info->delayed_iputs);
3098 spin_unlock(&fs_info->delayed_iput_lock);
3099}
3100
3101void btrfs_run_delayed_iputs(struct btrfs_root *root)
3102{
3103 LIST_HEAD(list);
3104 struct btrfs_fs_info *fs_info = root->fs_info;
3105 struct delayed_iput *delayed;
3106 int empty;
3107
3108 spin_lock(&fs_info->delayed_iput_lock);
3109 empty = list_empty(&fs_info->delayed_iputs);
3110 spin_unlock(&fs_info->delayed_iput_lock);
3111 if (empty)
3112 return;
3113
d7c15171
ZL		 3114 down_read(&fs_info->delayed_iput_sem);
3115
24bbcf04
YZ		 3116 spin_lock(&fs_info->delayed_iput_lock);
3117 list_splice_init(&fs_info->delayed_iputs, &list);
3118 spin_unlock(&fs_info->delayed_iput_lock);
3119
3120 while (!list_empty(&list)) {
3121 delayed = list_entry(list.next, struct delayed_iput, list);
3122 list_del(&delayed->list);
3123 iput(delayed->inode);
3124 kfree(delayed);
3125 }
d7c15171
ZL		 3126
3127 up_read(&root->fs_info->delayed_iput_sem);
24bbcf04
YZ		 3128}
3129
d68fc57b 3130/*
42b2aa86 3131 * This is called in transaction commit time. If there are no orphan
d68fc57b
YZ		 3132 * files in the subvolume, it removes orphan item and frees block_rsv
3133 * structure.
3134 */
3135void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans,
3136 struct btrfs_root *root)
3137{
90290e19 3138 struct btrfs_block_rsv *block_rsv;
d68fc57b
YZ		 3139 int ret;
3140
8a35d95f 3141 if (atomic_read(&root->orphan_inodes) ||
d68fc57b
YZ		 3142 root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE)
3143 return;
3144
90290e19 3145 spin_lock(&root->orphan_lock);
8a35d95f 3146 if (atomic_read(&root->orphan_inodes)) {
90290e19
JB		 3147 spin_unlock(&root->orphan_lock);
3148 return;
3149 }
3150
3151 if (root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) {
3152 spin_unlock(&root->orphan_lock);
3153 return;
3154 }
3155
3156 block_rsv = root->orphan_block_rsv;
3157 root->orphan_block_rsv = NULL;
3158 spin_unlock(&root->orphan_lock);
3159
27cdeb70 3160 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state) &&
d68fc57b
YZ		 3161 btrfs_root_refs(&root->root_item) > 0) {
3162 ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root,
3163 root->root_key.objectid);
4ef31a45
JB		 3164 if (ret)
3165 btrfs_abort_transaction(trans, root, ret);
3166 else
27cdeb70
MX		 3167 clear_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED,
3168 &root->state);
d68fc57b
YZ		 3169 }
3170
90290e19
JB		 3171 if (block_rsv) {
3172 WARN_ON(block_rsv->size > 0);
3173 btrfs_free_block_rsv(root, block_rsv);
d68fc57b
YZ		 3174 }
3175}
3176
7b128766
JB		 3177/*
3178 * This creates an orphan entry for the given inode in case something goes
3179 * wrong in the middle of an unlink/truncate.
d68fc57b
YZ		 3180 *
3181 * NOTE: caller of this function should reserve 5 units of metadata for
3182 * this function.
7b128766
JB		 3183 */
3184int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode)
3185{
3186 struct btrfs_root *root = BTRFS_I(inode)->root;
d68fc57b
YZ		 3187 struct btrfs_block_rsv *block_rsv = NULL;
3188 int reserve = 0;
3189 int insert = 0;
3190 int ret;
7b128766 3191
d68fc57b 3192 if (!root->orphan_block_rsv) {
66d8f3dd 3193 block_rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
b532402e
TI		 3194 if (!block_rsv)
3195 return -ENOMEM;
d68fc57b 3196 }
7b128766 3197
d68fc57b
YZ		 3198 spin_lock(&root->orphan_lock);
3199 if (!root->orphan_block_rsv) {
3200 root->orphan_block_rsv = block_rsv;
3201 } else if (block_rsv) {
3202 btrfs_free_block_rsv(root, block_rsv);
3203 block_rsv = NULL;
7b128766 3204 }
7b128766 3205
8a35d95f
JB		 3206 if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3207 &BTRFS_I(inode)->runtime_flags)) {
d68fc57b
YZ		 3208#if 0
3209 /*
3210 * For proper ENOSPC handling, we should do orphan
3211 * cleanup when mounting. But this introduces backward
3212 * compatibility issue.
3213 */
3214 if (!xchg(&root->orphan_item_inserted, 1))
3215 insert = 2;
3216 else
3217 insert = 1;
3218#endif
3219 insert = 1;
321f0e70 3220 atomic_inc(&root->orphan_inodes);
7b128766
JB		 3221 }
3222
72ac3c0d
JB		 3223 if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3224 &BTRFS_I(inode)->runtime_flags))
d68fc57b 3225 reserve = 1;
d68fc57b 3226 spin_unlock(&root->orphan_lock);
7b128766 3227
d68fc57b
YZ		 3228 /* grab metadata reservation from transaction handle */
3229 if (reserve) {
3230 ret = btrfs_orphan_reserve_metadata(trans, inode);
79787eaa 3231 BUG_ON(ret); /* -ENOSPC in reservation; Logic error? JDM */
d68fc57b 3232 }
7b128766 3233
d68fc57b
YZ		 3234 /* insert an orphan item to track this unlinked/truncated file */
3235 if (insert >= 1) {
33345d01 3236 ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode));
4ef31a45 3237 if (ret) {
703c88e0 3238 atomic_dec(&root->orphan_inodes);
4ef31a45
JB		 3239 if (reserve) {
3240 clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3241 &BTRFS_I(inode)->runtime_flags);
3242 btrfs_orphan_release_metadata(inode);
3243 }
3244 if (ret != -EEXIST) {
e8e7cff6
JB		 3245 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3246 &BTRFS_I(inode)->runtime_flags);
4ef31a45
JB		 3247 btrfs_abort_transaction(trans, root, ret);
3248 return ret;
3249 }
79787eaa
JM		 3250 }
3251 ret = 0;
d68fc57b
YZ		 3252 }
3253
3254 /* insert an orphan item to track subvolume contains orphan files */
3255 if (insert >= 2) {
3256 ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root,
3257 root->root_key.objectid);
79787eaa
JM		 3258 if (ret && ret != -EEXIST) {
3259 btrfs_abort_transaction(trans, root, ret);
3260 return ret;
3261 }
d68fc57b
YZ		 3262 }
3263 return 0;
7b128766
JB		 3264}
3265
3266/*
3267 * We have done the truncate/delete so we can go ahead and remove the orphan
3268 * item for this particular inode.
3269 */
48a3b636
ES		 3270static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3271 struct inode *inode)
7b128766
JB		 3272{
3273 struct btrfs_root *root = BTRFS_I(inode)->root;
d68fc57b
YZ		 3274 int delete_item = 0;
3275 int release_rsv = 0;
7b128766
JB		 3276 int ret = 0;
3277
d68fc57b 3278 spin_lock(&root->orphan_lock);
8a35d95f
JB		 3279 if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3280 &BTRFS_I(inode)->runtime_flags))
d68fc57b 3281 delete_item = 1;
7b128766 3282
72ac3c0d
JB		 3283 if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3284 &BTRFS_I(inode)->runtime_flags))
d68fc57b 3285 release_rsv = 1;
d68fc57b 3286 spin_unlock(&root->orphan_lock);
7b128766 3287
703c88e0 3288 if (delete_item) {
8a35d95f 3289 atomic_dec(&root->orphan_inodes);
703c88e0
FDBM		 3290 if (trans)
3291 ret = btrfs_del_orphan_item(trans, root,
3292 btrfs_ino(inode));
8a35d95f 3293 }
7b128766 3294
703c88e0
FDBM		 3295 if (release_rsv)
3296 btrfs_orphan_release_metadata(inode);
3297
4ef31a45 3298 return ret;
7b128766
JB		 3299}
3300
3301/*
3302 * this cleans up any orphans that may be left on the list from the last use
3303 * of this root.
3304 */
66b4ffd1 3305int btrfs_orphan_cleanup(struct btrfs_root *root)
7b128766
JB		 3306{
3307 struct btrfs_path *path;
3308 struct extent_buffer *leaf;
7b128766
JB		 3309 struct btrfs_key key, found_key;
3310 struct btrfs_trans_handle *trans;
3311 struct inode *inode;
8f6d7f4f 3312 u64 last_objectid = 0;
7b128766
JB		 3313 int ret = 0, nr_unlink = 0, nr_truncate = 0;
3314
d68fc57b 3315 if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
66b4ffd1 3316 return 0;
c71bf099
YZ		 3317
3318 path = btrfs_alloc_path();
66b4ffd1
JB		 3319 if (!path) {
3320 ret = -ENOMEM;
3321 goto out;
3322 }
7b128766
JB		 3323 path->reada = -1;
3324
3325 key.objectid = BTRFS_ORPHAN_OBJECTID;
962a298f 3326 key.type = BTRFS_ORPHAN_ITEM_KEY;
7b128766
JB		 3327 key.offset = (u64)-1;
3328
7b128766
JB		 3329 while (1) {
3330 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
66b4ffd1
JB		 3331 if (ret < 0)
3332 goto out;
7b128766
JB		 3333
3334 /*
3335 * if ret == 0 means we found what we were searching for, which
25985edc 3336 * is weird, but possible, so only screw with path if we didn't
7b128766
JB		 3337 * find the key and see if we have stuff that matches
3338 */
3339 if (ret > 0) {
66b4ffd1 3340 ret = 0;
7b128766
JB		 3341 if (path->slots[0] == 0)
3342 break;
3343 path->slots[0]--;
3344 }
3345
3346 /* pull out the item */
3347 leaf = path->nodes[0];
7b128766
JB		 3348 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3349
3350 /* make sure the item matches what we want */
3351 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3352 break;
962a298f 3353 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
7b128766
JB		 3354 break;
3355
3356 /* release the path since we're done with it */
b3b4aa74 3357 btrfs_release_path(path);
7b128766
JB		 3358
3359 /*
3360 * this is where we are basically btrfs_lookup, without the
3361 * crossing root thing. we store the inode number in the
3362 * offset of the orphan item.
3363 */
8f6d7f4f
JB		 3364
3365 if (found_key.offset == last_objectid) {
c2cf52eb
SK		 3366 btrfs_err(root->fs_info,
3367 "Error removing orphan entry, stopping orphan cleanup");
8f6d7f4f
JB		 3368 ret = -EINVAL;
3369 goto out;
3370 }
3371
3372 last_objectid = found_key.offset;
3373
5d4f98a2
YZ		 3374 found_key.objectid = found_key.offset;
3375 found_key.type = BTRFS_INODE_ITEM_KEY;
3376 found_key.offset = 0;
73f73415 3377 inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL);
8c6ffba0 3378 ret = PTR_ERR_OR_ZERO(inode);
a8c9e576 3379 if (ret && ret != -ESTALE)
66b4ffd1 3380 goto out;
7b128766 3381
f8e9e0b0
AJ		 3382 if (ret == -ESTALE && root == root->fs_info->tree_root) {
3383 struct btrfs_root *dead_root;
3384 struct btrfs_fs_info *fs_info = root->fs_info;
3385 int is_dead_root = 0;
3386
3387 /*
3388 * this is an orphan in the tree root. Currently these
3389 * could come from 2 sources:
3390 * a) a snapshot deletion in progress
3391 * b) a free space cache inode
3392 * We need to distinguish those two, as the snapshot
3393 * orphan must not get deleted.
3394 * find_dead_roots already ran before us, so if this
3395 * is a snapshot deletion, we should find the root
3396 * in the dead_roots list
3397 */
3398 spin_lock(&fs_info->trans_lock);
3399 list_for_each_entry(dead_root, &fs_info->dead_roots,
3400 root_list) {
3401 if (dead_root->root_key.objectid ==
3402 found_key.objectid) {
3403 is_dead_root = 1;
3404 break;
3405 }
3406 }
3407 spin_unlock(&fs_info->trans_lock);
3408 if (is_dead_root) {
3409 /* prevent this orphan from being found again */
3410 key.offset = found_key.objectid - 1;
3411 continue;
3412 }
3413 }
7b128766 3414 /*
a8c9e576
JB		 3415 * Inode is already gone but the orphan item is still there,
3416 * kill the orphan item.
7b128766 3417 */
a8c9e576
JB		 3418 if (ret == -ESTALE) {
3419 trans = btrfs_start_transaction(root, 1);
66b4ffd1
JB		 3420 if (IS_ERR(trans)) {
3421 ret = PTR_ERR(trans);
3422 goto out;
3423 }
c2cf52eb
SK		 3424 btrfs_debug(root->fs_info, "auto deleting %Lu",
3425 found_key.objectid);
a8c9e576
JB		 3426 ret = btrfs_del_orphan_item(trans, root,
3427 found_key.objectid);
5b21f2ed 3428 btrfs_end_transaction(trans, root);
4ef31a45
JB		 3429 if (ret)
3430 goto out;
7b128766
JB		 3431 continue;
3432 }
3433
a8c9e576
JB		 3434 /*
3435 * add this inode to the orphan list so btrfs_orphan_del does
3436 * the proper thing when we hit it
3437 */
8a35d95f
JB		 3438 set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3439 &BTRFS_I(inode)->runtime_flags);
925396ec 3440 atomic_inc(&root->orphan_inodes);
a8c9e576 3441
7b128766
JB		 3442 /* if we have links, this was a truncate, lets do that */
3443 if (inode->i_nlink) {
fae7f21c 3444 if (WARN_ON(!S_ISREG(inode->i_mode))) {
a41ad394
JB		 3445 iput(inode);
3446 continue;
3447 }
7b128766 3448 nr_truncate++;
f3fe820c
JB		 3449
3450 /* 1 for the orphan item deletion. */
3451 trans = btrfs_start_transaction(root, 1);
3452 if (IS_ERR(trans)) {
c69b26b0 3453 iput(inode);
f3fe820c
JB		 3454 ret = PTR_ERR(trans);
3455 goto out;
3456 }
3457 ret = btrfs_orphan_add(trans, inode);
3458 btrfs_end_transaction(trans, root);
c69b26b0
JB		 3459 if (ret) {
3460 iput(inode);
f3fe820c 3461 goto out;
c69b26b0 3462 }
f3fe820c 3463
66b4ffd1 3464 ret = btrfs_truncate(inode);
4a7d0f68
JB		 3465 if (ret)
3466 btrfs_orphan_del(NULL, inode);
7b128766
JB		 3467 } else {
3468 nr_unlink++;
3469 }
3470
3471 /* this will do delete_inode and everything for us */
3472 iput(inode);
66b4ffd1
JB		 3473 if (ret)
3474 goto out;
7b128766 3475 }
3254c876
MX		 3476 /* release the path since we're done with it */
3477 btrfs_release_path(path);
3478
d68fc57b
YZ		 3479 root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
3480
3481 if (root->orphan_block_rsv)
3482 btrfs_block_rsv_release(root, root->orphan_block_rsv,
3483 (u64)-1);
3484
27cdeb70
MX		 3485 if (root->orphan_block_rsv ||
3486 test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
7a7eaa40 3487 trans = btrfs_join_transaction(root);
66b4ffd1
JB		 3488 if (!IS_ERR(trans))
3489 btrfs_end_transaction(trans, root);
d68fc57b 3490 }
7b128766
JB		 3491
3492 if (nr_unlink)
4884b476 3493 btrfs_debug(root->fs_info, "unlinked %d orphans", nr_unlink);
7b128766 3494 if (nr_truncate)
4884b476 3495 btrfs_debug(root->fs_info, "truncated %d orphans", nr_truncate);
66b4ffd1
JB		 3496
3497out:
3498 if (ret)
68b663d1 3499 btrfs_err(root->fs_info,
c2cf52eb 3500 "could not do orphan cleanup %d", ret);
66b4ffd1
JB		 3501 btrfs_free_path(path);
3502 return ret;
7b128766
JB		 3503}
3504
46a53cca
CM		 3505/*
3506 * very simple check to peek ahead in the leaf looking for xattrs. If we
3507 * don't find any xattrs, we know there can't be any acls.
3508 *
3509 * slot is the slot the inode is in, objectid is the objectid of the inode
3510 */
3511static noinline int acls_after_inode_item(struct extent_buffer *leaf,
63541927
FDBM		 3512 int slot, u64 objectid,
3513 int *first_xattr_slot)
46a53cca
CM		 3514{
3515 u32 nritems = btrfs_header_nritems(leaf);
3516 struct btrfs_key found_key;
f23b5a59
JB		 3517 static u64 xattr_access = 0;
3518 static u64 xattr_default = 0;
46a53cca
CM		 3519 int scanned = 0;
3520
f23b5a59
JB		 3521 if (!xattr_access) {
3522 xattr_access = btrfs_name_hash(POSIX_ACL_XATTR_ACCESS,
3523 strlen(POSIX_ACL_XATTR_ACCESS));
3524 xattr_default = btrfs_name_hash(POSIX_ACL_XATTR_DEFAULT,
3525 strlen(POSIX_ACL_XATTR_DEFAULT));
3526 }
3527
46a53cca 3528 slot++;
63541927 3529 *first_xattr_slot = -1;
46a53cca
CM		 3530 while (slot < nritems) {
3531 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3532
3533 /* we found a different objectid, there must not be acls */
3534 if (found_key.objectid != objectid)
3535 return 0;
3536
3537 /* we found an xattr, assume we've got an acl */
f23b5a59 3538 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
63541927
FDBM		 3539 if (*first_xattr_slot == -1)
3540 *first_xattr_slot = slot;
f23b5a59
JB		 3541 if (found_key.offset == xattr_access ||
3542 found_key.offset == xattr_default)
3543 return 1;
3544 }
46a53cca
CM		 3545
3546 /*
3547 * we found a key greater than an xattr key, there can't
3548 * be any acls later on
3549 */
3550 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3551 return 0;
3552
3553 slot++;
3554 scanned++;
3555
3556 /*
3557 * it goes inode, inode backrefs, xattrs, extents,
3558 * so if there are a ton of hard links to an inode there can
3559 * be a lot of backrefs. Don't waste time searching too hard,
3560 * this is just an optimization
3561 */
3562 if (scanned >= 8)
3563 break;
3564 }
3565 /* we hit the end of the leaf before we found an xattr or
3566 * something larger than an xattr. We have to assume the inode
3567 * has acls
3568 */
63541927
FDBM		 3569 if (*first_xattr_slot == -1)
3570 *first_xattr_slot = slot;
46a53cca
CM		 3571 return 1;
3572}
3573
d352ac68
CM		 3574/*
3575 * read an inode from the btree into the in-memory inode
3576 */
5d4f98a2 3577static void btrfs_read_locked_inode(struct inode *inode)
39279cc3
CM		 3578{
3579 struct btrfs_path *path;
5f39d397 3580 struct extent_buffer *leaf;
39279cc3
CM		 3581 struct btrfs_inode_item *inode_item;
3582 struct btrfs_root *root = BTRFS_I(inode)->root;
3583 struct btrfs_key location;
67de1176 3584 unsigned long ptr;
46a53cca 3585 int maybe_acls;
618e21d5 3586 u32 rdev;
39279cc3 3587 int ret;
2f7e33d4 3588 bool filled = false;
63541927 3589 int first_xattr_slot;
2f7e33d4
MX		 3590
3591 ret = btrfs_fill_inode(inode, &rdev);
3592 if (!ret)
3593 filled = true;
39279cc3
CM		 3594
3595 path = btrfs_alloc_path();
1748f843
MF		 3596 if (!path)
3597 goto make_bad;
3598
39279cc3 3599 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
dc17ff8f 3600
39279cc3 3601 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
5f39d397 3602 if (ret)
39279cc3 3603 goto make_bad;
39279cc3 3604
5f39d397 3605 leaf = path->nodes[0];
2f7e33d4
MX		 3606
3607 if (filled)
67de1176 3608 goto cache_index;
2f7e33d4 3609
5f39d397
CM		 3610 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3611 struct btrfs_inode_item);
5f39d397 3612 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
bfe86848 3613 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
2f2f43d3
EB		 3614 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3615 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
dbe674a9 3616 btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item));
5f39d397 3617
a937b979
DS		 3618 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3619 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
5f39d397 3620
a937b979
DS		 3621 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3622 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
5f39d397 3623
a937b979
DS		 3624 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->ctime);
3625 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->ctime);
5f39d397 3626
9cc97d64 3627 BTRFS_I(inode)->i_otime.tv_sec =
3628 btrfs_timespec_sec(leaf, &inode_item->otime);
3629 BTRFS_I(inode)->i_otime.tv_nsec =
3630 btrfs_timespec_nsec(leaf, &inode_item->otime);
5f39d397 3631
a76a3cd4 3632 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
e02119d5 3633 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
5dc562c5
JB		 3634 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3635
3636 /*
3637 * If we were modified in the current generation and evicted from memory
3638 * and then re-read we need to do a full sync since we don't have any
3639 * idea about which extents were modified before we were evicted from
3640 * cache.
3641 */
3642 if (BTRFS_I(inode)->last_trans == root->fs_info->generation)
3643 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3644 &BTRFS_I(inode)->runtime_flags);
3645
0c4d2d95 3646 inode->i_version = btrfs_inode_sequence(leaf, inode_item);
e02119d5 3647 inode->i_generation = BTRFS_I(inode)->generation;
618e21d5 3648 inode->i_rdev = 0;
5f39d397
CM		 3649 rdev = btrfs_inode_rdev(leaf, inode_item);
3650
aec7477b 3651 BTRFS_I(inode)->index_cnt = (u64)-1;
d2fb3437 3652 BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
67de1176
MX		 3653
3654cache_index:
3655 path->slots[0]++;
3656 if (inode->i_nlink != 1 ||
3657 path->slots[0] >= btrfs_header_nritems(leaf))
3658 goto cache_acl;
3659
3660 btrfs_item_key_to_cpu(leaf, &location, path->slots[0]);
3661 if (location.objectid != btrfs_ino(inode))
3662 goto cache_acl;
3663
3664 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
3665 if (location.type == BTRFS_INODE_REF_KEY) {
3666 struct btrfs_inode_ref *ref;
3667
3668 ref = (struct btrfs_inode_ref *)ptr;
3669 BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref);
3670 } else if (location.type == BTRFS_INODE_EXTREF_KEY) {
3671 struct btrfs_inode_extref *extref;
3672
3673 extref = (struct btrfs_inode_extref *)ptr;
3674 BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf,
3675 extref);
3676 }
2f7e33d4 3677cache_acl:
46a53cca
CM		 3678 /*
3679 * try to precache a NULL acl entry for files that don't have
3680 * any xattrs or acls
3681 */
33345d01 3682 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
63541927
FDBM		 3683 btrfs_ino(inode), &first_xattr_slot);
3684 if (first_xattr_slot != -1) {
3685 path->slots[0] = first_xattr_slot;
3686 ret = btrfs_load_inode_props(inode, path);
3687 if (ret)
3688 btrfs_err(root->fs_info,
351fd353 3689 "error loading props for ino %llu (root %llu): %d",
63541927
FDBM		 3690 btrfs_ino(inode),
3691 root->root_key.objectid, ret);
3692 }
3693 btrfs_free_path(path);
3694
72c04902
AV		 3695 if (!maybe_acls)
3696 cache_no_acl(inode);
46a53cca 3697
39279cc3 3698 switch (inode->i_mode & S_IFMT) {
39279cc3
CM		 3699 case S_IFREG:
3700 inode->i_mapping->a_ops = &btrfs_aops;
d1310b2e 3701 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
39279cc3
CM		 3702 inode->i_fop = &btrfs_file_operations;
3703 inode->i_op = &btrfs_file_inode_operations;
3704 break;
3705 case S_IFDIR:
3706 inode->i_fop = &btrfs_dir_file_operations;
3707 if (root == root->fs_info->tree_root)
3708 inode->i_op = &btrfs_dir_ro_inode_operations;
3709 else
3710 inode->i_op = &btrfs_dir_inode_operations;
3711 break;
3712 case S_IFLNK:
3713 inode->i_op = &btrfs_symlink_inode_operations;
3714 inode->i_mapping->a_ops = &btrfs_symlink_aops;
3715 break;
618e21d5 3716 default:
0279b4cd 3717 inode->i_op = &btrfs_special_inode_operations;
618e21d5
JB		 3718 init_special_inode(inode, inode->i_mode, rdev);
3719 break;
39279cc3 3720 }
6cbff00f
CH		 3721
3722 btrfs_update_iflags(inode);
39279cc3
CM		 3723 return;
3724
3725make_bad:
39279cc3 3726 btrfs_free_path(path);
39279cc3
CM		 3727 make_bad_inode(inode);
3728}
3729
d352ac68
CM		 3730/*
3731 * given a leaf and an inode, copy the inode fields into the leaf
3732 */
e02119d5
CM		 3733static void fill_inode_item(struct btrfs_trans_handle *trans,
3734 struct extent_buffer *leaf,
5f39d397 3735 struct btrfs_inode_item *item,
39279cc3
CM		 3736 struct inode *inode)
3737{
51fab693
LB		 3738 struct btrfs_map_token token;
3739
3740 btrfs_init_map_token(&token);
5f39d397 3741
51fab693
LB		 3742 btrfs_set_token_inode_uid(leaf, item, i_uid_read(inode), &token);
3743 btrfs_set_token_inode_gid(leaf, item, i_gid_read(inode), &token);
3744 btrfs_set_token_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size,
3745 &token);
3746 btrfs_set_token_inode_mode(leaf, item, inode->i_mode, &token);
3747 btrfs_set_token_inode_nlink(leaf, item, inode->i_nlink, &token);
5f39d397 3748
a937b979 3749 btrfs_set_token_timespec_sec(leaf, &item->atime,
51fab693 3750 inode->i_atime.tv_sec, &token);
a937b979 3751 btrfs_set_token_timespec_nsec(leaf, &item->atime,
51fab693 3752 inode->i_atime.tv_nsec, &token);
5f39d397 3753
a937b979 3754 btrfs_set_token_timespec_sec(leaf, &item->mtime,
51fab693 3755 inode->i_mtime.tv_sec, &token);
a937b979 3756 btrfs_set_token_timespec_nsec(leaf, &item->mtime,
51fab693 3757 inode->i_mtime.tv_nsec, &token);
5f39d397 3758
a937b979 3759 btrfs_set_token_timespec_sec(leaf, &item->ctime,
51fab693 3760 inode->i_ctime.tv_sec, &token);
a937b979 3761 btrfs_set_token_timespec_nsec(leaf, &item->ctime,
51fab693 3762 inode->i_ctime.tv_nsec, &token);
5f39d397 3763
9cc97d64 3764 btrfs_set_token_timespec_sec(leaf, &item->otime,
3765 BTRFS_I(inode)->i_otime.tv_sec, &token);
3766 btrfs_set_token_timespec_nsec(leaf, &item->otime,
3767 BTRFS_I(inode)->i_otime.tv_nsec, &token);
3768
51fab693
LB		 3769 btrfs_set_token_inode_nbytes(leaf, item, inode_get_bytes(inode),
3770 &token);
3771 btrfs_set_token_inode_generation(leaf, item, BTRFS_I(inode)->generation,
3772 &token);
3773 btrfs_set_token_inode_sequence(leaf, item, inode->i_version, &token);
3774 btrfs_set_token_inode_transid(leaf, item, trans->transid, &token);
3775 btrfs_set_token_inode_rdev(leaf, item, inode->i_rdev, &token);
3776 btrfs_set_token_inode_flags(leaf, item, BTRFS_I(inode)->flags, &token);
3777 btrfs_set_token_inode_block_group(leaf, item, 0, &token);
39279cc3
CM		 3778}
3779
d352ac68
CM		 3780/*
3781 * copy everything in the in-memory inode into the btree.
3782 */
2115133f 3783static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
d397712b 3784 struct btrfs_root *root, struct inode *inode)
39279cc3
CM		 3785{
3786 struct btrfs_inode_item *inode_item;
3787 struct btrfs_path *path;
5f39d397 3788 struct extent_buffer *leaf;
39279cc3
CM		 3789 int ret;
3790
3791 path = btrfs_alloc_path();
16cdcec7
MX		 3792 if (!path)
3793 return -ENOMEM;
3794
b9473439 3795 path->leave_spinning = 1;
16cdcec7
MX		 3796 ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location,
3797 1);
39279cc3
CM		 3798 if (ret) {
3799 if (ret > 0)
3800 ret = -ENOENT;
3801 goto failed;
3802 }
3803
5f39d397
CM		 3804 leaf = path->nodes[0];
3805 inode_item = btrfs_item_ptr(leaf, path->slots[0],
16cdcec7 3806 struct btrfs_inode_item);
39279cc3 3807
e02119d5 3808 fill_inode_item(trans, leaf, inode_item, inode);
5f39d397 3809 btrfs_mark_buffer_dirty(leaf);
15ee9bc7 3810 btrfs_set_inode_last_trans(trans, inode);
39279cc3
CM		 3811 ret = 0;
3812failed:
39279cc3
CM		 3813 btrfs_free_path(path);
3814 return ret;
3815}
3816
2115133f
CM		 3817/*
3818 * copy everything in the in-memory inode into the btree.
3819 */
3820noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
3821 struct btrfs_root *root, struct inode *inode)
3822{
3823 int ret;
3824
3825 /*
3826 * If the inode is a free space inode, we can deadlock during commit
3827 * if we put it into the delayed code.
3828 *
3829 * The data relocation inode should also be directly updated
3830 * without delay
3831 */
83eea1f1 3832 if (!btrfs_is_free_space_inode(inode)
1d52c78a
JB		 3833 && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
3834 && !root->fs_info->log_root_recovering) {
8ea05e3a
AB		 3835 btrfs_update_root_times(trans, root);
3836
2115133f
CM		 3837 ret = btrfs_delayed_update_inode(trans, root, inode);
3838 if (!ret)
3839 btrfs_set_inode_last_trans(trans, inode);
3840 return ret;
3841 }
3842
3843 return btrfs_update_inode_item(trans, root, inode);
3844}
3845
be6aef60
JB		 3846noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
3847 struct btrfs_root *root,
3848 struct inode *inode)
2115133f
CM		 3849{
3850 int ret;
3851
3852 ret = btrfs_update_inode(trans, root, inode);
3853 if (ret == -ENOSPC)
3854 return btrfs_update_inode_item(trans, root, inode);
3855 return ret;
3856}
3857
d352ac68
CM		 3858/*
3859 * unlink helper that gets used here in inode.c and in the tree logging
3860 * recovery code. It remove a link in a directory with a given name, and
3861 * also drops the back refs in the inode to the directory
3862 */
92986796
AV		 3863static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3864 struct btrfs_root *root,
3865 struct inode *dir, struct inode *inode,
3866 const char *name, int name_len)
39279cc3
CM		 3867{
3868 struct btrfs_path *path;
39279cc3 3869 int ret = 0;
5f39d397 3870 struct extent_buffer *leaf;
39279cc3 3871 struct btrfs_dir_item *di;
5f39d397 3872 struct btrfs_key key;
aec7477b 3873 u64 index;
33345d01
LZ		 3874 u64 ino = btrfs_ino(inode);
3875 u64 dir_ino = btrfs_ino(dir);
39279cc3
CM		 3876
3877 path = btrfs_alloc_path();
54aa1f4d
CM		 3878 if (!path) {
3879 ret = -ENOMEM;
554233a6 3880 goto out;
54aa1f4d
CM		 3881 }
3882
b9473439 3883 path->leave_spinning = 1;
33345d01 3884 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
39279cc3
CM		 3885 name, name_len, -1);
3886 if (IS_ERR(di)) {
3887 ret = PTR_ERR(di);
3888 goto err;
3889 }
3890 if (!di) {
3891 ret = -ENOENT;
3892 goto err;
3893 }
5f39d397
CM		 3894 leaf = path->nodes[0];
3895 btrfs_dir_item_key_to_cpu(leaf, di, &key);
39279cc3 3896 ret = btrfs_delete_one_dir_name(trans, root, path, di);
54aa1f4d
CM		 3897 if (ret)
3898 goto err;
b3b4aa74 3899 btrfs_release_path(path);
39279cc3 3900
67de1176
MX		 3901 /*
3902 * If we don't have dir index, we have to get it by looking up
3903 * the inode ref, since we get the inode ref, remove it directly,
3904 * it is unnecessary to do delayed deletion.
3905 *
3906 * But if we have dir index, needn't search inode ref to get it.
3907 * Since the inode ref is close to the inode item, it is better
3908 * that we delay to delete it, and just do this deletion when
3909 * we update the inode item.
3910 */
3911 if (BTRFS_I(inode)->dir_index) {
3912 ret = btrfs_delayed_delete_inode_ref(inode);
3913 if (!ret) {
3914 index = BTRFS_I(inode)->dir_index;
3915 goto skip_backref;
3916 }
3917 }
3918
33345d01
LZ		 3919 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
3920 dir_ino, &index);
aec7477b 3921 if (ret) {
c2cf52eb
SK		 3922 btrfs_info(root->fs_info,
3923 "failed to delete reference to %.*s, inode %llu parent %llu",
c1c9ff7c 3924 name_len, name, ino, dir_ino);
79787eaa 3925 btrfs_abort_transaction(trans, root, ret);
aec7477b
JB		 3926 goto err;
3927 }
67de1176 3928skip_backref:
16cdcec7 3929 ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
79787eaa
JM		 3930 if (ret) {
3931 btrfs_abort_transaction(trans, root, ret);
39279cc3 3932 goto err;
79787eaa 3933 }
39279cc3 3934
e02119d5 3935 ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len,
33345d01 3936 inode, dir_ino);
79787eaa
JM		 3937 if (ret != 0 && ret != -ENOENT) {
3938 btrfs_abort_transaction(trans, root, ret);
3939 goto err;
3940 }
e02119d5
CM		 3941
3942 ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len,
3943 dir, index);
6418c961
CM		 3944 if (ret == -ENOENT)
3945 ret = 0;
d4e3991b
ZB		 3946 else if (ret)
3947 btrfs_abort_transaction(trans, root, ret);
39279cc3
CM		 3948err:
3949 btrfs_free_path(path);
e02119d5
CM		 3950 if (ret)
3951 goto out;
3952
3953 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
0c4d2d95
JB		 3954 inode_inc_iversion(inode);
3955 inode_inc_iversion(dir);
e02119d5 3956 inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME;
b9959295 3957 ret = btrfs_update_inode(trans, root, dir);
e02119d5 3958out:
39279cc3
CM		 3959 return ret;
3960}
3961
92986796
AV		 3962int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3963 struct btrfs_root *root,
3964 struct inode *dir, struct inode *inode,
3965 const char *name, int name_len)
3966{
3967 int ret;
3968 ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
3969 if (!ret) {
8b558c5f 3970 drop_nlink(inode);
92986796
AV		 3971 ret = btrfs_update_inode(trans, root, inode);
3972 }
3973 return ret;
3974}
39279cc3 3975
a22285a6
YZ		 3976/*
3977 * helper to start transaction for unlink and rmdir.
3978 *
d52be818
JB		 3979 * unlink and rmdir are special in btrfs, they do not always free space, so
3980 * if we cannot make our reservations the normal way try and see if there is
3981 * plenty of slack room in the global reserve to migrate, otherwise we cannot
3982 * allow the unlink to occur.
a22285a6 3983 */
d52be818 3984static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir)
4df27c4d 3985{
39279cc3 3986 struct btrfs_trans_handle *trans;
a22285a6 3987 struct btrfs_root *root = BTRFS_I(dir)->root;
4df27c4d
YZ		 3988 int ret;
3989
e70bea5f
JB		 3990 /*
3991 * 1 for the possible orphan item
3992 * 1 for the dir item
3993 * 1 for the dir index
3994 * 1 for the inode ref
e70bea5f
JB		 3995 * 1 for the inode
3996 */
6e137ed3 3997 trans = btrfs_start_transaction(root, 5);
a22285a6
YZ		 3998 if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC)
3999 return trans;
4df27c4d 4000
d52be818
JB		 4001 if (PTR_ERR(trans) == -ENOSPC) {
4002 u64 num_bytes = btrfs_calc_trans_metadata_size(root, 5);
4df27c4d 4003
d52be818
JB		 4004 trans = btrfs_start_transaction(root, 0);
4005 if (IS_ERR(trans))
4006 return trans;
4007 ret = btrfs_cond_migrate_bytes(root->fs_info,
4008 &root->fs_info->trans_block_rsv,
4009 num_bytes, 5);
4010 if (ret) {
4011 btrfs_end_transaction(trans, root);
4012 return ERR_PTR(ret);
a22285a6 4013 }
5a77d76c 4014 trans->block_rsv = &root->fs_info->trans_block_rsv;
d52be818 4015 trans->bytes_reserved = num_bytes;
a22285a6 4016 }
d52be818 4017 return trans;
a22285a6
YZ		 4018}
4019
4020static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4021{
4022 struct btrfs_root *root = BTRFS_I(dir)->root;
4023 struct btrfs_trans_handle *trans;
4024 struct inode *inode = dentry->d_inode;
4025 int ret;
a22285a6 4026
d52be818 4027 trans = __unlink_start_trans(dir);
a22285a6
YZ		 4028 if (IS_ERR(trans))
4029 return PTR_ERR(trans);
5f39d397 4030
12fcfd22
CM		 4031 btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0);
4032
e02119d5
CM		 4033 ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
4034 dentry->d_name.name, dentry->d_name.len);
b532402e
TI		 4035 if (ret)
4036 goto out;
7b128766 4037
a22285a6 4038 if (inode->i_nlink == 0) {
7b128766 4039 ret = btrfs_orphan_add(trans, inode);
b532402e
TI		 4040 if (ret)
4041 goto out;
a22285a6 4042 }
7b128766 4043
b532402e 4044out:
d52be818 4045 btrfs_end_transaction(trans, root);
b53d3f5d 4046 btrfs_btree_balance_dirty(root);
39279cc3
CM		 4047 return ret;
4048}
4049
4df27c4d
YZ		 4050int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4051 struct btrfs_root *root,
4052 struct inode *dir, u64 objectid,
4053 const char *name, int name_len)
4054{
4055 struct btrfs_path *path;
4056 struct extent_buffer *leaf;
4057 struct btrfs_dir_item *di;
4058 struct btrfs_key key;
4059 u64 index;
4060 int ret;
33345d01 4061 u64 dir_ino = btrfs_ino(dir);
4df27c4d
YZ		 4062
4063 path = btrfs_alloc_path();
4064 if (!path)
4065 return -ENOMEM;
4066
33345d01 4067 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4df27c4d 4068 name, name_len, -1);
79787eaa
JM		 4069 if (IS_ERR_OR_NULL(di)) {
4070 if (!di)
4071 ret = -ENOENT;
4072 else
4073 ret = PTR_ERR(di);
4074 goto out;
4075 }
4df27c4d
YZ		 4076
4077 leaf = path->nodes[0];
4078 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4079 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4080 ret = btrfs_delete_one_dir_name(trans, root, path, di);
79787eaa
JM		 4081 if (ret) {
4082 btrfs_abort_transaction(trans, root, ret);
4083 goto out;
4084 }
b3b4aa74 4085 btrfs_release_path(path);
4df27c4d
YZ		 4086
4087 ret = btrfs_del_root_ref(trans, root->fs_info->tree_root,
4088 objectid, root->root_key.objectid,
33345d01 4089 dir_ino, &index, name, name_len);
4df27c4d 4090 if (ret < 0) {
79787eaa
JM		 4091 if (ret != -ENOENT) {
4092 btrfs_abort_transaction(trans, root, ret);
4093 goto out;
4094 }
33345d01 4095 di = btrfs_search_dir_index_item(root, path, dir_ino,
4df27c4d 4096 name, name_len);
79787eaa
JM		 4097 if (IS_ERR_OR_NULL(di)) {
4098 if (!di)
4099 ret = -ENOENT;
4100 else
4101 ret = PTR_ERR(di);
4102 btrfs_abort_transaction(trans, root, ret);
4103 goto out;
4104 }
4df27c4d
YZ		 4105
4106 leaf = path->nodes[0];
4107 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
b3b4aa74 4108 btrfs_release_path(path);
4df27c4d
YZ		 4109 index = key.offset;
4110 }
945d8962 4111 btrfs_release_path(path);
4df27c4d 4112
16cdcec7 4113 ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
79787eaa
JM		 4114 if (ret) {
4115 btrfs_abort_transaction(trans, root, ret);
4116 goto out;
4117 }
4df27c4d
YZ		 4118
4119 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
0c4d2d95 4120 inode_inc_iversion(dir);
4df27c4d 4121 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
5a24e84c 4122 ret = btrfs_update_inode_fallback(trans, root, dir);
79787eaa
JM		 4123 if (ret)
4124 btrfs_abort_transaction(trans, root, ret);
4125out:
71d7aed0 4126 btrfs_free_path(path);
79787eaa 4127 return ret;
4df27c4d
YZ		 4128}
4129
39279cc3
CM		 4130static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4131{
4132 struct inode *inode = dentry->d_inode;
1832a6d5 4133 int err = 0;
39279cc3 4134 struct btrfs_root *root = BTRFS_I(dir)->root;
39279cc3 4135 struct btrfs_trans_handle *trans;
39279cc3 4136
b3ae244e 4137 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
134d4512 4138 return -ENOTEMPTY;
b3ae244e
DS		 4139 if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID)
4140 return -EPERM;
134d4512 4141
d52be818 4142 trans = __unlink_start_trans(dir);
a22285a6 4143 if (IS_ERR(trans))
5df6a9f6 4144 return PTR_ERR(trans);
5df6a9f6 4145
33345d01 4146 if (unlikely(btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4df27c4d
YZ		 4147 err = btrfs_unlink_subvol(trans, root, dir,
4148 BTRFS_I(inode)->location.objectid,
4149 dentry->d_name.name,
4150 dentry->d_name.len);
4151 goto out;
4152 }
4153
7b128766
JB		 4154 err = btrfs_orphan_add(trans, inode);
4155 if (err)
4df27c4d 4156 goto out;
7b128766 4157
39279cc3 4158 /* now the directory is empty */
e02119d5
CM		 4159 err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
4160 dentry->d_name.name, dentry->d_name.len);
d397712b 4161 if (!err)
dbe674a9 4162 btrfs_i_size_write(inode, 0);
4df27c4d 4163out:
d52be818 4164 btrfs_end_transaction(trans, root);
b53d3f5d 4165 btrfs_btree_balance_dirty(root);
3954401f 4166
39279cc3
CM		 4167 return err;
4168}
4169
28f75a0e
CM		 4170static int truncate_space_check(struct btrfs_trans_handle *trans,
4171 struct btrfs_root *root,
4172 u64 bytes_deleted)
4173{
4174 int ret;
4175
4176 bytes_deleted = btrfs_csum_bytes_to_leaves(root, bytes_deleted);
4177 ret = btrfs_block_rsv_add(root, &root->fs_info->trans_block_rsv,
4178 bytes_deleted, BTRFS_RESERVE_NO_FLUSH);
4179 if (!ret)
4180 trans->bytes_reserved += bytes_deleted;
4181 return ret;
4182
4183}
4184
39279cc3
CM		 4185/*
4186 * this can truncate away extent items, csum items and directory items.
4187 * It starts at a high offset and removes keys until it can't find
d352ac68 4188 * any higher than new_size
39279cc3
CM		 4189 *
4190 * csum items that cross the new i_size are truncated to the new size
4191 * as well.
7b128766
JB		 4192 *
4193 * min_type is the minimum key type to truncate down to. If set to 0, this
4194 * will kill all the items on this inode, including the INODE_ITEM_KEY.
39279cc3 4195 */
8082510e
YZ		 4196int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
4197 struct btrfs_root *root,
4198 struct inode *inode,
4199 u64 new_size, u32 min_type)
39279cc3 4200{
39279cc3 4201 struct btrfs_path *path;
5f39d397 4202 struct extent_buffer *leaf;
39279cc3 4203 struct btrfs_file_extent_item *fi;
8082510e
YZ		 4204 struct btrfs_key key;
4205 struct btrfs_key found_key;
39279cc3 4206 u64 extent_start = 0;
db94535d 4207 u64 extent_num_bytes = 0;
5d4f98a2 4208 u64 extent_offset = 0;
39279cc3 4209 u64 item_end = 0;
7f4f6e0a 4210 u64 last_size = (u64)-1;
8082510e 4211 u32 found_type = (u8)-1;
39279cc3
CM		 4212 int found_extent;
4213 int del_item;
85e21bac
CM		 4214 int pending_del_nr = 0;
4215 int pending_del_slot = 0;
179e29e4 4216 int extent_type = -1;
8082510e
YZ		 4217 int ret;
4218 int err = 0;
33345d01 4219 u64 ino = btrfs_ino(inode);
28ed1345 4220 u64 bytes_deleted = 0;
1262133b
JB		 4221 bool be_nice = 0;
4222 bool should_throttle = 0;
28f75a0e 4223 bool should_end = 0;
8082510e
YZ		 4224
4225 BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
39279cc3 4226
28ed1345
CM		 4227 /*
4228 * for non-free space inodes and ref cows, we want to back off from
4229 * time to time
4230 */
4231 if (!btrfs_is_free_space_inode(inode) &&
4232 test_bit(BTRFS_ROOT_REF_COWS, &root->state))
4233 be_nice = 1;
4234
0eb0e19c
MF		 4235 path = btrfs_alloc_path();
4236 if (!path)
4237 return -ENOMEM;
4238 path->reada = -1;
4239
5dc562c5
JB		 4240 /*
4241 * We want to drop from the next block forward in case this new size is
4242 * not block aligned since we will be keeping the last block of the
4243 * extent just the way it is.
4244 */
27cdeb70
MX		 4245 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) ||
4246 root == root->fs_info->tree_root)
fda2832f
QW		 4247 btrfs_drop_extent_cache(inode, ALIGN(new_size,
4248 root->sectorsize), (u64)-1, 0);
8082510e 4249
16cdcec7
MX		 4250 /*
4251 * This function is also used to drop the items in the log tree before
4252 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
4253 * it is used to drop the loged items. So we shouldn't kill the delayed
4254 * items.
4255 */
4256 if (min_type == 0 && root == BTRFS_I(inode)->root)
4257 btrfs_kill_delayed_inode_items(inode);
4258
33345d01 4259 key.objectid = ino;
39279cc3 4260 key.offset = (u64)-1;
5f39d397
CM		 4261 key.type = (u8)-1;
4262
85e21bac 4263search_again:
28ed1345
CM		 4264 /*
4265 * with a 16K leaf size and 128MB extents, you can actually queue
4266 * up a huge file in a single leaf. Most of the time that
4267 * bytes_deleted is > 0, it will be huge by the time we get here
4268 */
4269 if (be_nice && bytes_deleted > 32 * 1024 * 1024) {
4270 if (btrfs_should_end_transaction(trans, root)) {
4271 err = -EAGAIN;
4272 goto error;
4273 }
4274 }
4275
4276
b9473439 4277 path->leave_spinning = 1;
85e21bac 4278 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
8082510e
YZ		 4279 if (ret < 0) {
4280 err = ret;
4281 goto out;
4282 }
d397712b 4283
85e21bac 4284 if (ret > 0) {
e02119d5
CM		 4285 /* there are no items in the tree for us to truncate, we're
4286 * done
4287 */
8082510e
YZ		 4288 if (path->slots[0] == 0)
4289 goto out;
85e21bac
CM		 4290 path->slots[0]--;
4291 }
4292
d397712b 4293 while (1) {
39279cc3 4294 fi = NULL;
5f39d397
CM		 4295 leaf = path->nodes[0];
4296 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
962a298f 4297 found_type = found_key.type;
39279cc3 4298
33345d01 4299 if (found_key.objectid != ino)
39279cc3 4300 break;
5f39d397 4301
85e21bac 4302 if (found_type < min_type)
39279cc3
CM		 4303 break;
4304
5f39d397 4305 item_end = found_key.offset;
39279cc3 4306 if (found_type == BTRFS_EXTENT_DATA_KEY) {
5f39d397 4307 fi = btrfs_item_ptr(leaf, path->slots[0],
39279cc3 4308 struct btrfs_file_extent_item);
179e29e4
CM		 4309 extent_type = btrfs_file_extent_type(leaf, fi);
4310 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
5f39d397 4311 item_end +=
db94535d 4312 btrfs_file_extent_num_bytes(leaf, fi);
179e29e4 4313 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
179e29e4 4314 item_end += btrfs_file_extent_inline_len(leaf,
514ac8ad 4315 path->slots[0], fi);
39279cc3 4316 }
008630c1 4317 item_end--;
39279cc3 4318 }
8082510e
YZ		 4319 if (found_type > min_type) {
4320 del_item = 1;
4321 } else {
4322 if (item_end < new_size)
b888db2b 4323 break;
8082510e
YZ		 4324 if (found_key.offset >= new_size)
4325 del_item = 1;
4326 else
4327 del_item = 0;
39279cc3 4328 }
39279cc3 4329 found_extent = 0;
39279cc3 4330 /* FIXME, shrink the extent if the ref count is only 1 */
179e29e4
CM		 4331 if (found_type != BTRFS_EXTENT_DATA_KEY)
4332 goto delete;
4333
7f4f6e0a
JB		 4334 if (del_item)
4335 last_size = found_key.offset;
4336 else
4337 last_size = new_size;
4338
179e29e4 4339 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
39279cc3 4340 u64 num_dec;
db94535d 4341 extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
f70a9a6b 4342 if (!del_item) {
db94535d
CM		 4343 u64 orig_num_bytes =
4344 btrfs_file_extent_num_bytes(leaf, fi);
fda2832f
QW		 4345 extent_num_bytes = ALIGN(new_size -
4346 found_key.offset,
4347 root->sectorsize);
db94535d
CM		 4348 btrfs_set_file_extent_num_bytes(leaf, fi,
4349 extent_num_bytes);
4350 num_dec = (orig_num_bytes -
9069218d 4351 extent_num_bytes);
27cdeb70
MX		 4352 if (test_bit(BTRFS_ROOT_REF_COWS,
4353 &root->state) &&
4354 extent_start != 0)
a76a3cd4 4355 inode_sub_bytes(inode, num_dec);
5f39d397 4356 btrfs_mark_buffer_dirty(leaf);
39279cc3 4357 } else {
db94535d
CM		 4358 extent_num_bytes =
4359 btrfs_file_extent_disk_num_bytes(leaf,
4360 fi);
5d4f98a2
YZ		 4361 extent_offset = found_key.offset -
4362 btrfs_file_extent_offset(leaf, fi);
4363
39279cc3 4364 /* FIXME blocksize != 4096 */
9069218d 4365 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
39279cc3
CM		 4366 if (extent_start != 0) {
4367 found_extent = 1;
27cdeb70
MX		 4368 if (test_bit(BTRFS_ROOT_REF_COWS,
4369 &root->state))
a76a3cd4 4370 inode_sub_bytes(inode, num_dec);
e02119d5 4371 }
39279cc3 4372 }
9069218d 4373 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
c8b97818
CM		 4374 /*
4375 * we can't truncate inline items that have had
4376 * special encodings
4377 */
4378 if (!del_item &&
4379 btrfs_file_extent_compression(leaf, fi) == 0 &&
4380 btrfs_file_extent_encryption(leaf, fi) == 0 &&
4381 btrfs_file_extent_other_encoding(leaf, fi) == 0) {
e02119d5
CM		 4382 u32 size = new_size - found_key.offset;
4383
27cdeb70 4384 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state))
a76a3cd4
YZ		 4385 inode_sub_bytes(inode, item_end + 1 -
4386 new_size);
514ac8ad
CM		 4387
4388 /*
4389 * update the ram bytes to properly reflect
4390 * the new size of our item
4391 */
4392 btrfs_set_file_extent_ram_bytes(leaf, fi, size);
e02119d5
CM		 4393 size =
4394 btrfs_file_extent_calc_inline_size(size);
afe5fea7 4395 btrfs_truncate_item(root, path, size, 1);
27cdeb70
MX		 4396 } else if (test_bit(BTRFS_ROOT_REF_COWS,
4397 &root->state)) {
a76a3cd4
YZ		 4398 inode_sub_bytes(inode, item_end + 1 -
4399 found_key.offset);
9069218d 4400 }
39279cc3 4401 }
179e29e4 4402delete:
39279cc3 4403 if (del_item) {
85e21bac
CM		 4404 if (!pending_del_nr) {
4405 /* no pending yet, add ourselves */
4406 pending_del_slot = path->slots[0];
4407 pending_del_nr = 1;
4408 } else if (pending_del_nr &&
4409 path->slots[0] + 1 == pending_del_slot) {
4410 /* hop on the pending chunk */
4411 pending_del_nr++;
4412 pending_del_slot = path->slots[0];
4413 } else {
d397712b 4414 BUG();
85e21bac 4415 }
39279cc3
CM		 4416 } else {
4417 break;
4418 }
28f75a0e
CM		 4419 should_throttle = 0;
4420
27cdeb70
MX		 4421 if (found_extent &&
4422 (test_bit(BTRFS_ROOT_REF_COWS, &root->state) ||
4423 root == root->fs_info->tree_root)) {
b9473439 4424 btrfs_set_path_blocking(path);
28ed1345 4425 bytes_deleted += extent_num_bytes;
39279cc3 4426 ret = btrfs_free_extent(trans, root, extent_start,
5d4f98a2
YZ		 4427 extent_num_bytes, 0,
4428 btrfs_header_owner(leaf),
66d7e7f0 4429 ino, extent_offset, 0);
39279cc3 4430 BUG_ON(ret);
1262133b 4431 if (btrfs_should_throttle_delayed_refs(trans, root))
28ed1345
CM		 4432 btrfs_async_run_delayed_refs(root,
4433 trans->delayed_ref_updates * 2, 0);
28f75a0e
CM		 4434 if (be_nice) {
4435 if (truncate_space_check(trans, root,
4436 extent_num_bytes)) {
4437 should_end = 1;
4438 }
4439 if (btrfs_should_throttle_delayed_refs(trans,
4440 root)) {
4441 should_throttle = 1;
4442 }
4443 }
39279cc3 4444 }
85e21bac 4445
8082510e
YZ		 4446 if (found_type == BTRFS_INODE_ITEM_KEY)
4447 break;
4448
4449 if (path->slots[0] == 0 ||
1262133b 4450 path->slots[0] != pending_del_slot ||
28f75a0e 4451 should_throttle || should_end) {
8082510e
YZ		 4452 if (pending_del_nr) {
4453 ret = btrfs_del_items(trans, root, path,
4454 pending_del_slot,
4455 pending_del_nr);
79787eaa
JM		 4456 if (ret) {
4457 btrfs_abort_transaction(trans,
4458 root, ret);
4459 goto error;
4460 }
8082510e
YZ		 4461 pending_del_nr = 0;
4462 }
b3b4aa74 4463 btrfs_release_path(path);
28f75a0e 4464 if (should_throttle) {
1262133b
JB		 4465 unsigned long updates = trans->delayed_ref_updates;
4466 if (updates) {
4467 trans->delayed_ref_updates = 0;
4468 ret = btrfs_run_delayed_refs(trans, root, updates * 2);
4469 if (ret && !err)
4470 err = ret;
4471 }
4472 }
28f75a0e
CM		 4473 /*
4474 * if we failed to refill our space rsv, bail out
4475 * and let the transaction restart
4476 */
4477 if (should_end) {
4478 err = -EAGAIN;
4479 goto error;
4480 }
85e21bac 4481 goto search_again;
8082510e
YZ		 4482 } else {
4483 path->slots[0]--;
85e21bac 4484 }
39279cc3 4485 }
8082510e 4486out:
85e21bac
CM		 4487 if (pending_del_nr) {
4488 ret = btrfs_del_items(trans, root, path, pending_del_slot,
4489 pending_del_nr);
79787eaa
JM		 4490 if (ret)
4491 btrfs_abort_transaction(trans, root, ret);
85e21bac 4492 }
79787eaa 4493error:
dac5705c
FM		 4494 if (last_size != (u64)-1 &&
4495 root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID)
7f4f6e0a 4496 btrfs_ordered_update_i_size(inode, last_size, NULL);
28ed1345 4497
39279cc3 4498 btrfs_free_path(path);
28ed1345 4499
28f75a0e 4500 if (be_nice && bytes_deleted > 32 * 1024 * 1024) {
28ed1345
CM		 4501 unsigned long updates = trans->delayed_ref_updates;
4502 if (updates) {
4503 trans->delayed_ref_updates = 0;
4504 ret = btrfs_run_delayed_refs(trans, root, updates * 2);
4505 if (ret && !err)
4506 err = ret;
4507 }
4508 }
8082510e 4509 return err;
39279cc3
CM		 4510}
4511
4512/*
2aaa6655
JB		 4513 * btrfs_truncate_page - read, zero a chunk and write a page
4514 * @inode - inode that we're zeroing
4515 * @from - the offset to start zeroing
4516 * @len - the length to zero, 0 to zero the entire range respective to the
4517 * offset
4518 * @front - zero up to the offset instead of from the offset on
4519 *
4520 * This will find the page for the "from" offset and cow the page and zero the
4521 * part we want to zero. This is used with truncate and hole punching.
39279cc3 4522 */
2aaa6655
JB		 4523int btrfs_truncate_page(struct inode *inode, loff_t from, loff_t len,
4524 int front)
39279cc3 4525{
2aaa6655 4526 struct address_space *mapping = inode->i_mapping;
db94535d 4527 struct btrfs_root *root = BTRFS_I(inode)->root;
e6dcd2dc
CM		 4528 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
4529 struct btrfs_ordered_extent *ordered;
2ac55d41 4530 struct extent_state *cached_state = NULL;
e6dcd2dc 4531 char *kaddr;
db94535d 4532 u32 blocksize = root->sectorsize;
39279cc3
CM		 4533 pgoff_t index = from >> PAGE_CACHE_SHIFT;
4534 unsigned offset = from & (PAGE_CACHE_SIZE-1);
4535 struct page *page;
3b16a4e3 4536 gfp_t mask = btrfs_alloc_write_mask(mapping);
39279cc3 4537 int ret = 0;
a52d9a80 4538 u64 page_start;
e6dcd2dc 4539 u64 page_end;
39279cc3 4540
2aaa6655
JB		 4541 if ((offset & (blocksize - 1)) == 0 &&
4542 (!len || ((len & (blocksize - 1)) == 0)))
39279cc3 4543 goto out;
0ca1f7ce 4544 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
5d5e103a
JB		 4545 if (ret)
4546 goto out;
39279cc3 4547
211c17f5 4548again:
3b16a4e3 4549 page = find_or_create_page(mapping, index, mask);
5d5e103a 4550 if (!page) {
0ca1f7ce 4551 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
ac6a2b36 4552 ret = -ENOMEM;
39279cc3 4553 goto out;
5d5e103a 4554 }
e6dcd2dc
CM		 4555
4556 page_start = page_offset(page);
4557 page_end = page_start + PAGE_CACHE_SIZE - 1;
4558
39279cc3 4559 if (!PageUptodate(page)) {
9ebefb18 4560 ret = btrfs_readpage(NULL, page);
39279cc3 4561 lock_page(page);
211c17f5
CM		 4562 if (page->mapping != mapping) {
4563 unlock_page(page);
4564 page_cache_release(page);
4565 goto again;
4566 }
39279cc3
CM		 4567 if (!PageUptodate(page)) {
4568 ret = -EIO;
89642229 4569 goto out_unlock;
39279cc3
CM		 4570 }
4571 }
211c17f5 4572 wait_on_page_writeback(page);
e6dcd2dc 4573
d0082371 4574 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state);
e6dcd2dc
CM		 4575 set_page_extent_mapped(page);
4576
4577 ordered = btrfs_lookup_ordered_extent(inode, page_start);
4578 if (ordered) {
2ac55d41
JB		 4579 unlock_extent_cached(io_tree, page_start, page_end,
4580 &cached_state, GFP_NOFS);
e6dcd2dc
CM		 4581 unlock_page(page);
4582 page_cache_release(page);
eb84ae03 4583 btrfs_start_ordered_extent(inode, ordered, 1);
e6dcd2dc
CM		 4584 btrfs_put_ordered_extent(ordered);
4585 goto again;
4586 }
4587
2ac55d41 4588 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
9e8a4a8b
LB		 4589 EXTENT_DIRTY | EXTENT_DELALLOC |
4590 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
2ac55d41 4591 0, 0, &cached_state, GFP_NOFS);
5d5e103a 4592
2ac55d41
JB		 4593 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
4594 &cached_state);
9ed74f2d 4595 if (ret) {
2ac55d41
JB		 4596 unlock_extent_cached(io_tree, page_start, page_end,
4597 &cached_state, GFP_NOFS);
9ed74f2d
JB		 4598 goto out_unlock;
4599 }
4600
e6dcd2dc 4601 if (offset != PAGE_CACHE_SIZE) {
2aaa6655
JB		 4602 if (!len)
4603 len = PAGE_CACHE_SIZE - offset;
e6dcd2dc 4604 kaddr = kmap(page);
2aaa6655
JB		 4605 if (front)
4606 memset(kaddr, 0, offset);
4607 else
4608 memset(kaddr + offset, 0, len);
e6dcd2dc
CM		 4609 flush_dcache_page(page);
4610 kunmap(page);
4611 }
247e743c 4612 ClearPageChecked(page);
e6dcd2dc 4613 set_page_dirty(page);
2ac55d41
JB		 4614 unlock_extent_cached(io_tree, page_start, page_end, &cached_state,
4615 GFP_NOFS);
39279cc3 4616
89642229 4617out_unlock:
5d5e103a 4618 if (ret)
0ca1f7ce 4619 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
39279cc3
CM		 4620 unlock_page(page);
4621 page_cache_release(page);
4622out:
4623 return ret;
4624}
4625
16e7549f
JB		 4626static int maybe_insert_hole(struct btrfs_root *root, struct inode *inode,
4627 u64 offset, u64 len)
4628{
4629 struct btrfs_trans_handle *trans;
4630 int ret;
4631
4632 /*
4633 * Still need to make sure the inode looks like it's been updated so
4634 * that any holes get logged if we fsync.
4635 */
4636 if (btrfs_fs_incompat(root->fs_info, NO_HOLES)) {
4637 BTRFS_I(inode)->last_trans = root->fs_info->generation;
4638 BTRFS_I(inode)->last_sub_trans = root->log_transid;
4639 BTRFS_I(inode)->last_log_commit = root->last_log_commit;
4640 return 0;
4641 }
4642
4643 /*
4644 * 1 - for the one we're dropping
4645 * 1 - for the one we're adding
4646 * 1 - for updating the inode.
4647 */
4648 trans = btrfs_start_transaction(root, 3);
4649 if (IS_ERR(trans))
4650 return PTR_ERR(trans);
4651
4652 ret = btrfs_drop_extents(trans, root, inode, offset, offset + len, 1);
4653 if (ret) {
4654 btrfs_abort_transaction(trans, root, ret);
4655 btrfs_end_transaction(trans, root);
4656 return ret;
4657 }
4658
4659 ret = btrfs_insert_file_extent(trans, root, btrfs_ino(inode), offset,
4660 0, 0, len, 0, len, 0, 0, 0);
4661 if (ret)
4662 btrfs_abort_transaction(trans, root, ret);
4663 else
4664 btrfs_update_inode(trans, root, inode);
4665 btrfs_end_transaction(trans, root);
4666 return ret;
4667}
4668
695a0d0d
JB		 4669/*
4670 * This function puts in dummy file extents for the area we're creating a hole
4671 * for. So if we are truncating this file to a larger size we need to insert
4672 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
4673 * the range between oldsize and size
4674 */
a41ad394 4675int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size)
39279cc3 4676{
9036c102
YZ		 4677 struct btrfs_root *root = BTRFS_I(inode)->root;
4678 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
a22285a6 4679 struct extent_map *em = NULL;
2ac55d41 4680 struct extent_state *cached_state = NULL;
5dc562c5 4681 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
fda2832f
QW		 4682 u64 hole_start = ALIGN(oldsize, root->sectorsize);
4683 u64 block_end = ALIGN(size, root->sectorsize);
9036c102
YZ		 4684 u64 last_byte;
4685 u64 cur_offset;
4686 u64 hole_size;
9ed74f2d 4687 int err = 0;
39279cc3 4688
a71754fc
JB		 4689 /*
4690 * If our size started in the middle of a page we need to zero out the
4691 * rest of the page before we expand the i_size, otherwise we could
4692 * expose stale data.
4693 */
4694 err = btrfs_truncate_page(inode, oldsize, 0, 0);
4695 if (err)
4696 return err;
4697
9036c102
YZ		 4698 if (size <= hole_start)
4699 return 0;
4700
9036c102
YZ		 4701 while (1) {
4702 struct btrfs_ordered_extent *ordered;
fa7c1494 4703
2ac55d41 4704 lock_extent_bits(io_tree, hole_start, block_end - 1, 0,
d0082371 4705 &cached_state);
fa7c1494
MX		 4706 ordered = btrfs_lookup_ordered_range(inode, hole_start,
4707 block_end - hole_start);
9036c102
YZ		 4708 if (!ordered)
4709 break;
2ac55d41
JB		 4710 unlock_extent_cached(io_tree, hole_start, block_end - 1,
4711 &cached_state, GFP_NOFS);
fa7c1494 4712 btrfs_start_ordered_extent(inode, ordered, 1);
9036c102
YZ		 4713 btrfs_put_ordered_extent(ordered);
4714 }
39279cc3 4715
9036c102
YZ		 4716 cur_offset = hole_start;
4717 while (1) {
4718 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
4719 block_end - cur_offset, 0);
79787eaa
JM		 4720 if (IS_ERR(em)) {
4721 err = PTR_ERR(em);
f2767956 4722 em = NULL;
79787eaa
JM		 4723 break;
4724 }
9036c102 4725 last_byte = min(extent_map_end(em), block_end);
fda2832f 4726 last_byte = ALIGN(last_byte , root->sectorsize);
8082510e 4727 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
5dc562c5 4728 struct extent_map *hole_em;
9036c102 4729 hole_size = last_byte - cur_offset;
9ed74f2d 4730
16e7549f
JB		 4731 err = maybe_insert_hole(root, inode, cur_offset,
4732 hole_size);
4733 if (err)
3893e33b 4734 break;
5dc562c5
JB		 4735 btrfs_drop_extent_cache(inode, cur_offset,
4736 cur_offset + hole_size - 1, 0);
4737 hole_em = alloc_extent_map();
4738 if (!hole_em) {
4739 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
4740 &BTRFS_I(inode)->runtime_flags);
4741 goto next;
4742 }
4743 hole_em->start = cur_offset;
4744 hole_em->len = hole_size;
4745 hole_em->orig_start = cur_offset;
8082510e 4746
5dc562c5
JB		 4747 hole_em->block_start = EXTENT_MAP_HOLE;
4748 hole_em->block_len = 0;
b4939680 4749 hole_em->orig_block_len = 0;
cc95bef6 4750 hole_em->ram_bytes = hole_size;
5dc562c5
JB		 4751 hole_em->bdev = root->fs_info->fs_devices->latest_bdev;
4752 hole_em->compress_type = BTRFS_COMPRESS_NONE;
16e7549f 4753 hole_em->generation = root->fs_info->generation;
8082510e 4754
5dc562c5
JB		 4755 while (1) {
4756 write_lock(&em_tree->lock);
09a2a8f9 4757 err = add_extent_mapping(em_tree, hole_em, 1);
5dc562c5
JB		 4758 write_unlock(&em_tree->lock);
4759 if (err != -EEXIST)
4760 break;
4761 btrfs_drop_extent_cache(inode, cur_offset,
4762 cur_offset +
4763 hole_size - 1, 0);
4764 }
4765 free_extent_map(hole_em);
9036c102 4766 }
16e7549f 4767next:
9036c102 4768 free_extent_map(em);
a22285a6 4769 em = NULL;
9036c102 4770 cur_offset = last_byte;
8082510e 4771 if (cur_offset >= block_end)
9036c102
YZ		 4772 break;
4773 }
a22285a6 4774 free_extent_map(em);
2ac55d41
JB		 4775 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
4776 GFP_NOFS);
9036c102
YZ		 4777 return err;
4778}
39279cc3 4779
9ea24bbe
FM		 4780static int wait_snapshoting_atomic_t(atomic_t *a)
4781{
4782 schedule();
4783 return 0;
4784}
4785
4786static void wait_for_snapshot_creation(struct btrfs_root *root)
4787{
4788 while (true) {
4789 int ret;
4790
4791 ret = btrfs_start_write_no_snapshoting(root);
4792 if (ret)
4793 break;
4794 wait_on_atomic_t(&root->will_be_snapshoted,
4795 wait_snapshoting_atomic_t,
4796 TASK_UNINTERRUPTIBLE);
4797 }
4798}
4799
3972f260 4800static int btrfs_setsize(struct inode *inode, struct iattr *attr)
8082510e 4801{
f4a2f4c5
MX		 4802 struct btrfs_root *root = BTRFS_I(inode)->root;
4803 struct btrfs_trans_handle *trans;
a41ad394 4804 loff_t oldsize = i_size_read(inode);
3972f260
ES		 4805 loff_t newsize = attr->ia_size;
4806 int mask = attr->ia_valid;
8082510e
YZ		 4807 int ret;
4808
3972f260
ES		 4809 /*
4810 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
4811 * special case where we need to update the times despite not having
4812 * these flags set. For all other operations the VFS set these flags
4813 * explicitly if it wants a timestamp update.
4814 */
dff6efc3
CH		 4815 if (newsize != oldsize) {
4816 inode_inc_iversion(inode);
4817 if (!(mask & (ATTR_CTIME | ATTR_MTIME)))
4818 inode->i_ctime = inode->i_mtime =
4819 current_fs_time(inode->i_sb);
4820 }
3972f260 4821
a41ad394 4822 if (newsize > oldsize) {
7caef267 4823 truncate_pagecache(inode, newsize);
9ea24bbe
FM		 4824 /*
4825 * Don't do an expanding truncate while snapshoting is ongoing.
4826 * This is to ensure the snapshot captures a fully consistent
4827 * state of this file - if the snapshot captures this expanding
4828 * truncation, it must capture all writes that happened before
4829 * this truncation.
4830 */
4831 wait_for_snapshot_creation(root);
a41ad394 4832 ret = btrfs_cont_expand(inode, oldsize, newsize);
9ea24bbe
FM		 4833 if (ret) {
4834 btrfs_end_write_no_snapshoting(root);
8082510e 4835 return ret;
9ea24bbe 4836 }
8082510e 4837
f4a2f4c5 4838 trans = btrfs_start_transaction(root, 1);
9ea24bbe
FM		 4839 if (IS_ERR(trans)) {
4840 btrfs_end_write_no_snapshoting(root);
f4a2f4c5 4841 return PTR_ERR(trans);
9ea24bbe 4842 }
f4a2f4c5
MX		 4843
4844 i_size_write(inode, newsize);
4845 btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL);
4846 ret = btrfs_update_inode(trans, root, inode);
9ea24bbe 4847 btrfs_end_write_no_snapshoting(root);
7ad85bb7 4848 btrfs_end_transaction(trans, root);
a41ad394 4849 } else {
8082510e 4850
a41ad394
JB		 4851 /*
4852 * We're truncating a file that used to have good data down to
4853 * zero. Make sure it gets into the ordered flush list so that
4854 * any new writes get down to disk quickly.
4855 */
4856 if (newsize == 0)
72ac3c0d
JB		 4857 set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE,
4858 &BTRFS_I(inode)->runtime_flags);
8082510e 4859
f3fe820c
JB		 4860 /*
4861 * 1 for the orphan item we're going to add
4862 * 1 for the orphan item deletion.
4863 */
4864 trans = btrfs_start_transaction(root, 2);
4865 if (IS_ERR(trans))
4866 return PTR_ERR(trans);
4867
4868 /*
4869 * We need to do this in case we fail at _any_ point during the
4870 * actual truncate. Once we do the truncate_setsize we could
4871 * invalidate pages which forces any outstanding ordered io to
4872 * be instantly completed which will give us extents that need
4873 * to be truncated. If we fail to get an orphan inode down we
4874 * could have left over extents that were never meant to live,
4875 * so we need to garuntee from this point on that everything
4876 * will be consistent.
4877 */
4878 ret = btrfs_orphan_add(trans, inode);
4879 btrfs_end_transaction(trans, root);
4880 if (ret)
4881 return ret;
4882
a41ad394
JB		 4883 /* we don't support swapfiles, so vmtruncate shouldn't fail */
4884 truncate_setsize(inode, newsize);
2e60a51e
MX		 4885
4886 /* Disable nonlocked read DIO to avoid the end less truncate */
4887 btrfs_inode_block_unlocked_dio(inode);
4888 inode_dio_wait(inode);
4889 btrfs_inode_resume_unlocked_dio(inode);
4890
a41ad394 4891 ret = btrfs_truncate(inode);
7f4f6e0a
JB		 4892 if (ret && inode->i_nlink) {
4893 int err;
4894
4895 /*
4896 * failed to truncate, disk_i_size is only adjusted down
4897 * as we remove extents, so it should represent the true
4898 * size of the inode, so reset the in memory size and
4899 * delete our orphan entry.
4900 */
4901 trans = btrfs_join_transaction(root);
4902 if (IS_ERR(trans)) {
4903 btrfs_orphan_del(NULL, inode);
4904 return ret;
4905 }
4906 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
4907 err = btrfs_orphan_del(trans, inode);
4908 if (err)
4909 btrfs_abort_transaction(trans, root, err);
4910 btrfs_end_transaction(trans, root);
4911 }
8082510e
YZ		 4912 }
4913
a41ad394 4914 return ret;
8082510e
YZ		 4915}
4916
9036c102
YZ		 4917static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
4918{
4919 struct inode *inode = dentry->d_inode;
b83cc969 4920 struct btrfs_root *root = BTRFS_I(inode)->root;
9036c102 4921 int err;
39279cc3 4922
b83cc969
LZ		 4923 if (btrfs_root_readonly(root))
4924 return -EROFS;
4925
9036c102
YZ		 4926 err = inode_change_ok(inode, attr);
4927 if (err)
4928 return err;
2bf5a725 4929
5a3f23d5 4930 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
3972f260 4931 err = btrfs_setsize(inode, attr);
8082510e
YZ		 4932 if (err)
4933 return err;
39279cc3 4934 }
9036c102 4935
1025774c
CH		 4936 if (attr->ia_valid) {
4937 setattr_copy(inode, attr);
0c4d2d95 4938 inode_inc_iversion(inode);
22c44fe6 4939 err = btrfs_dirty_inode(inode);
1025774c 4940
22c44fe6 4941 if (!err && attr->ia_valid & ATTR_MODE)
996a710d 4942 err = posix_acl_chmod(inode, inode->i_mode);
1025774c 4943 }
33268eaf 4944
39279cc3
CM		 4945 return err;
4946}
61295eb8 4947
131e404a
FDBM		 4948/*
4949 * While truncating the inode pages during eviction, we get the VFS calling
4950 * btrfs_invalidatepage() against each page of the inode. This is slow because
4951 * the calls to btrfs_invalidatepage() result in a huge amount of calls to
4952 * lock_extent_bits() and clear_extent_bit(), which keep merging and splitting
4953 * extent_state structures over and over, wasting lots of time.
4954 *
4955 * Therefore if the inode is being evicted, let btrfs_invalidatepage() skip all
4956 * those expensive operations on a per page basis and do only the ordered io
4957 * finishing, while we release here the extent_map and extent_state structures,
4958 * without the excessive merging and splitting.
4959 */
4960static void evict_inode_truncate_pages(struct inode *inode)
4961{
4962 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
4963 struct extent_map_tree *map_tree = &BTRFS_I(inode)->extent_tree;
4964 struct rb_node *node;
4965
4966 ASSERT(inode->i_state & I_FREEING);
91b0abe3 4967 truncate_inode_pages_final(&inode->i_data);
131e404a
FDBM		 4968
4969 write_lock(&map_tree->lock);
4970 while (!RB_EMPTY_ROOT(&map_tree->map)) {
4971 struct extent_map *em;
4972
4973 node = rb_first(&map_tree->map);
4974 em = rb_entry(node, struct extent_map, rb_node);
180589ef
WS		 4975 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
4976 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
131e404a
FDBM		 4977 remove_extent_mapping(map_tree, em);
4978 free_extent_map(em);
7064dd5c
FM		 4979 if (need_resched()) {
4980 write_unlock(&map_tree->lock);
4981 cond_resched();
4982 write_lock(&map_tree->lock);
4983 }
131e404a
FDBM		 4984 }
4985 write_unlock(&map_tree->lock);
4986
4987 spin_lock(&io_tree->lock);
4988 while (!RB_EMPTY_ROOT(&io_tree->state)) {
4989 struct extent_state *state;
4990 struct extent_state *cached_state = NULL;
4991
4992 node = rb_first(&io_tree->state);
4993 state = rb_entry(node, struct extent_state, rb_node);
4994 atomic_inc(&state->refs);
4995 spin_unlock(&io_tree->lock);
4996
4997 lock_extent_bits(io_tree, state->start, state->end,
4998 0, &cached_state);
4999 clear_extent_bit(io_tree, state->start, state->end,
5000 EXTENT_LOCKED | EXTENT_DIRTY |
5001 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
5002 EXTENT_DEFRAG, 1, 1,
5003 &cached_state, GFP_NOFS);
5004 free_extent_state(state);
5005
7064dd5c 5006 cond_resched();
131e404a
FDBM		 5007 spin_lock(&io_tree->lock);
5008 }
5009 spin_unlock(&io_tree->lock);
5010}
5011
bd555975 5012void btrfs_evict_inode(struct inode *inode)
39279cc3
CM		 5013{
5014 struct btrfs_trans_handle *trans;
5015 struct btrfs_root *root = BTRFS_I(inode)->root;
726c35fa 5016 struct btrfs_block_rsv *rsv, *global_rsv;
3bce876f 5017 int steal_from_global = 0;
07127184 5018 u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
39279cc3
CM		 5019 int ret;
5020
1abe9b8a 5021 trace_btrfs_inode_evict(inode);
5022
131e404a
FDBM		 5023 evict_inode_truncate_pages(inode);
5024
69e9c6c6
SB		 5025 if (inode->i_nlink &&
5026 ((btrfs_root_refs(&root->root_item) != 0 &&
5027 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5028 btrfs_is_free_space_inode(inode)))
bd555975
AV		 5029 goto no_delete;
5030
39279cc3 5031 if (is_bad_inode(inode)) {
7b128766 5032 btrfs_orphan_del(NULL, inode);
39279cc3
CM		 5033 goto no_delete;
5034 }
bd555975 5035 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
4a096752 5036 btrfs_wait_ordered_range(inode, 0, (u64)-1);
5f39d397 5037
f612496b
MX		 5038 btrfs_free_io_failure_record(inode, 0, (u64)-1);
5039
c71bf099 5040 if (root->fs_info->log_root_recovering) {
6bf02314 5041 BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
8a35d95f 5042 &BTRFS_I(inode)->runtime_flags));
c71bf099
YZ		 5043 goto no_delete;
5044 }
5045
76dda93c 5046 if (inode->i_nlink > 0) {
69e9c6c6
SB		 5047 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5048 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
76dda93c
YZ		 5049 goto no_delete;
5050 }
5051
0e8c36a9
MX		 5052 ret = btrfs_commit_inode_delayed_inode(inode);
5053 if (ret) {
5054 btrfs_orphan_del(NULL, inode);
5055 goto no_delete;
5056 }
5057
66d8f3dd 5058 rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
4289a667
JB		 5059 if (!rsv) {
5060 btrfs_orphan_del(NULL, inode);
5061 goto no_delete;
5062 }
4a338542 5063 rsv->size = min_size;
ca7e70f5 5064 rsv->failfast = 1;
726c35fa 5065 global_rsv = &root->fs_info->global_block_rsv;
4289a667 5066
dbe674a9 5067 btrfs_i_size_write(inode, 0);
5f39d397 5068
4289a667 5069 /*
8407aa46
MX		 5070 * This is a bit simpler than btrfs_truncate since we've already
5071 * reserved our space for our orphan item in the unlink, so we just
5072 * need to reserve some slack space in case we add bytes and update
5073 * inode item when doing the truncate.
4289a667 5074 */
8082510e 5075 while (1) {
08e007d2
MX		 5076 ret = btrfs_block_rsv_refill(root, rsv, min_size,
5077 BTRFS_RESERVE_FLUSH_LIMIT);
726c35fa
JB		 5078
5079 /*
5080 * Try and steal from the global reserve since we will
5081 * likely not use this space anyway, we want to try as
5082 * hard as possible to get this to work.
5083 */
5084 if (ret)
3bce876f
JB		 5085 steal_from_global++;
5086 else
5087 steal_from_global = 0;
5088 ret = 0;
d68fc57b 5089
3bce876f
JB		 5090 /*
5091 * steal_from_global == 0: we reserved stuff, hooray!
5092 * steal_from_global == 1: we didn't reserve stuff, boo!
5093 * steal_from_global == 2: we've committed, still not a lot of
5094 * room but maybe we'll have room in the global reserve this
5095 * time.
5096 * steal_from_global == 3: abandon all hope!
5097 */
5098 if (steal_from_global > 2) {
c2cf52eb
SK		 5099 btrfs_warn(root->fs_info,
5100 "Could not get space for a delete, will truncate on mount %d",
5101 ret);
4289a667
JB		 5102 btrfs_orphan_del(NULL, inode);
5103 btrfs_free_block_rsv(root, rsv);
5104 goto no_delete;
d68fc57b 5105 }
7b128766 5106
0e8c36a9 5107 trans = btrfs_join_transaction(root);
4289a667
JB		 5108 if (IS_ERR(trans)) {
5109 btrfs_orphan_del(NULL, inode);
5110 btrfs_free_block_rsv(root, rsv);
5111 goto no_delete;
d68fc57b 5112 }
7b128766 5113
3bce876f
JB		 5114 /*
5115 * We can't just steal from the global reserve, we need tomake
5116 * sure there is room to do it, if not we need to commit and try
5117 * again.
5118 */
5119 if (steal_from_global) {
5120 if (!btrfs_check_space_for_delayed_refs(trans, root))
5121 ret = btrfs_block_rsv_migrate(global_rsv, rsv,
5122 min_size);
5123 else
5124 ret = -ENOSPC;
5125 }
5126
5127 /*
5128 * Couldn't steal from the global reserve, we have too much
5129 * pending stuff built up, commit the transaction and try it
5130 * again.
5131 */
5132 if (ret) {
5133 ret = btrfs_commit_transaction(trans, root);
5134 if (ret) {
5135 btrfs_orphan_del(NULL, inode);
5136 btrfs_free_block_rsv(root, rsv);
5137 goto no_delete;
5138 }
5139 continue;
5140 } else {
5141 steal_from_global = 0;
5142 }
5143
4289a667
JB		 5144 trans->block_rsv = rsv;
5145
d68fc57b 5146 ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0);
28ed1345 5147 if (ret != -ENOSPC && ret != -EAGAIN)
8082510e 5148 break;
85e21bac 5149
8407aa46 5150 trans->block_rsv = &root->fs_info->trans_block_rsv;
8082510e
YZ		 5151 btrfs_end_transaction(trans, root);
5152 trans = NULL;
b53d3f5d 5153 btrfs_btree_balance_dirty(root);
8082510e 5154 }
5f39d397 5155
4289a667
JB		 5156 btrfs_free_block_rsv(root, rsv);
5157
4ef31a45
JB		 5158 /*
5159 * Errors here aren't a big deal, it just means we leave orphan items
5160 * in the tree. They will be cleaned up on the next mount.
5161 */
8082510e 5162 if (ret == 0) {
4289a667 5163 trans->block_rsv = root->orphan_block_rsv;
4ef31a45
JB		 5164 btrfs_orphan_del(trans, inode);
5165 } else {
5166 btrfs_orphan_del(NULL, inode);
8082510e 5167 }
54aa1f4d 5168
4289a667 5169 trans->block_rsv = &root->fs_info->trans_block_rsv;
581bb050
LZ		 5170 if (!(root == root->fs_info->tree_root ||
5171 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID))
33345d01 5172 btrfs_return_ino(root, btrfs_ino(inode));
581bb050 5173
54aa1f4d 5174 btrfs_end_transaction(trans, root);
b53d3f5d 5175 btrfs_btree_balance_dirty(root);
39279cc3 5176no_delete:
89042e5a 5177 btrfs_remove_delayed_node(inode);
dbd5768f 5178 clear_inode(inode);
8082510e 5179 return;
39279cc3
CM		 5180}
5181
5182/*
5183 * this returns the key found in the dir entry in the location pointer.
5184 * If no dir entries were found, location->objectid is 0.
5185 */
5186static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
5187 struct btrfs_key *location)
5188{
5189 const char *name = dentry->d_name.name;
5190 int namelen = dentry->d_name.len;
5191 struct btrfs_dir_item *di;
5192 struct btrfs_path *path;
5193 struct btrfs_root *root = BTRFS_I(dir)->root;
0d9f7f3e 5194 int ret = 0;
39279cc3
CM		 5195
5196 path = btrfs_alloc_path();
d8926bb3
MF		 5197 if (!path)
5198 return -ENOMEM;
3954401f 5199
33345d01 5200 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), name,
39279cc3 5201 namelen, 0);
0d9f7f3e
Y		 5202 if (IS_ERR(di))
5203 ret = PTR_ERR(di);
d397712b 5204
c704005d 5205 if (IS_ERR_OR_NULL(di))
3954401f 5206 goto out_err;
d397712b 5207
5f39d397 5208 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
39279cc3 5209out:
39279cc3
CM		 5210 btrfs_free_path(path);
5211 return ret;
3954401f
CM		 5212out_err:
5213 location->objectid = 0;
5214 goto out;
39279cc3
CM		 5215}
5216
5217/*
5218 * when we hit a tree root in a directory, the btrfs part of the inode
5219 * needs to be changed to reflect the root directory of the tree root. This
5220 * is kind of like crossing a mount point.
5221 */
5222static int fixup_tree_root_location(struct btrfs_root *root,
4df27c4d
YZ		 5223 struct inode *dir,
5224 struct dentry *dentry,
5225 struct btrfs_key *location,
5226 struct btrfs_root **sub_root)
39279cc3 5227{
4df27c4d
YZ		 5228 struct btrfs_path *path;
5229 struct btrfs_root *new_root;
5230 struct btrfs_root_ref *ref;
5231 struct extent_buffer *leaf;
1d4c08e0 5232 struct btrfs_key key;
4df27c4d
YZ		 5233 int ret;
5234 int err = 0;
39279cc3 5235
4df27c4d
YZ		 5236 path = btrfs_alloc_path();
5237 if (!path) {
5238 err = -ENOMEM;
5239 goto out;
5240 }
39279cc3 5241
4df27c4d 5242 err = -ENOENT;
1d4c08e0
DS		 5243 key.objectid = BTRFS_I(dir)->root->root_key.objectid;
5244 key.type = BTRFS_ROOT_REF_KEY;
5245 key.offset = location->objectid;
5246
5247 ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, path,
5248 0, 0);
4df27c4d
YZ		 5249 if (ret) {
5250 if (ret < 0)
5251 err = ret;
5252 goto out;
5253 }
39279cc3 5254
4df27c4d
YZ		 5255 leaf = path->nodes[0];
5256 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
33345d01 5257 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) ||
4df27c4d
YZ		 5258 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
5259 goto out;
39279cc3 5260
4df27c4d
YZ		 5261 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
5262 (unsigned long)(ref + 1),
5263 dentry->d_name.len);
5264 if (ret)
5265 goto out;
5266
b3b4aa74 5267 btrfs_release_path(path);
4df27c4d
YZ		 5268
5269 new_root = btrfs_read_fs_root_no_name(root->fs_info, location);
5270 if (IS_ERR(new_root)) {
5271 err = PTR_ERR(new_root);
5272 goto out;
5273 }
5274
4df27c4d
YZ		 5275 *sub_root = new_root;
5276 location->objectid = btrfs_root_dirid(&new_root->root_item);
5277 location->type = BTRFS_INODE_ITEM_KEY;
5278 location->offset = 0;
5279 err = 0;
5280out:
5281 btrfs_free_path(path);
5282 return err;
39279cc3
CM		 5283}
5284
5d4f98a2
YZ		 5285static void inode_tree_add(struct inode *inode)
5286{
5287 struct btrfs_root *root = BTRFS_I(inode)->root;
5288 struct btrfs_inode *entry;
03e860bd
FNP		 5289 struct rb_node **p;
5290 struct rb_node *parent;
cef21937 5291 struct rb_node *new = &BTRFS_I(inode)->rb_node;
33345d01 5292 u64 ino = btrfs_ino(inode);
5d4f98a2 5293
1d3382cb 5294 if (inode_unhashed(inode))
76dda93c 5295 return;
e1409cef 5296 parent = NULL;
5d4f98a2 5297 spin_lock(&root->inode_lock);
e1409cef 5298 p = &root->inode_tree.rb_node;
5d4f98a2
YZ		 5299 while (*p) {
5300 parent = *p;
5301 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5302
33345d01 5303 if (ino < btrfs_ino(&entry->vfs_inode))
03e860bd 5304 p = &parent->rb_left;
33345d01 5305 else if (ino > btrfs_ino(&entry->vfs_inode))
03e860bd 5306 p = &parent->rb_right;
5d4f98a2
YZ		 5307 else {
5308 WARN_ON(!(entry->vfs_inode.i_state &
a4ffdde6 5309 (I_WILL_FREE | I_FREEING)));
cef21937 5310 rb_replace_node(parent, new, &root->inode_tree);
03e860bd
FNP		 5311 RB_CLEAR_NODE(parent);
5312 spin_unlock(&root->inode_lock);
cef21937 5313 return;
5d4f98a2
YZ		 5314 }
5315 }
cef21937
FDBM		 5316 rb_link_node(new, parent, p);
5317 rb_insert_color(new, &root->inode_tree);
5d4f98a2
YZ		 5318 spin_unlock(&root->inode_lock);
5319}
5320
5321static void inode_tree_del(struct inode *inode)
5322{
5323 struct btrfs_root *root = BTRFS_I(inode)->root;
76dda93c 5324 int empty = 0;
5d4f98a2 5325
03e860bd 5326 spin_lock(&root->inode_lock);
5d4f98a2 5327 if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) {
5d4f98a2 5328 rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree);
5d4f98a2 5329 RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node);
76dda93c 5330 empty = RB_EMPTY_ROOT(&root->inode_tree);
5d4f98a2 5331 }
03e860bd 5332 spin_unlock(&root->inode_lock);
76dda93c 5333
69e9c6c6 5334 if (empty && btrfs_root_refs(&root->root_item) == 0) {
76dda93c
YZ		 5335 synchronize_srcu(&root->fs_info->subvol_srcu);
5336 spin_lock(&root->inode_lock);
5337 empty = RB_EMPTY_ROOT(&root->inode_tree);
5338 spin_unlock(&root->inode_lock);
5339 if (empty)
5340 btrfs_add_dead_root(root);
5341 }
5342}
5343
143bede5 5344void btrfs_invalidate_inodes(struct btrfs_root *root)
76dda93c
YZ		 5345{
5346 struct rb_node *node;
5347 struct rb_node *prev;
5348 struct btrfs_inode *entry;
5349 struct inode *inode;
5350 u64 objectid = 0;
5351
7813b3db
LB		 5352 if (!test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state))
5353 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
76dda93c
YZ		 5354
5355 spin_lock(&root->inode_lock);
5356again:
5357 node = root->inode_tree.rb_node;
5358 prev = NULL;
5359 while (node) {
5360 prev = node;
5361 entry = rb_entry(node, struct btrfs_inode, rb_node);
5362
33345d01 5363 if (objectid < btrfs_ino(&entry->vfs_inode))
76dda93c 5364 node = node->rb_left;
33345d01 5365 else if (objectid > btrfs_ino(&entry->vfs_inode))
76dda93c
YZ		 5366 node = node->rb_right;
5367 else
5368 break;
5369 }
5370 if (!node) {
5371 while (prev) {
5372 entry = rb_entry(prev, struct btrfs_inode, rb_node);
33345d01 5373 if (objectid <= btrfs_ino(&entry->vfs_inode)) {
76dda93c
YZ		 5374 node = prev;
5375 break;
5376 }
5377 prev = rb_next(prev);
5378 }
5379 }
5380 while (node) {
5381 entry = rb_entry(node, struct btrfs_inode, rb_node);
33345d01 5382 objectid = btrfs_ino(&entry->vfs_inode) + 1;
76dda93c
YZ		 5383 inode = igrab(&entry->vfs_inode);
5384 if (inode) {
5385 spin_unlock(&root->inode_lock);
5386 if (atomic_read(&inode->i_count) > 1)
5387 d_prune_aliases(inode);
5388 /*
45321ac5 5389 * btrfs_drop_inode will have it removed from
76dda93c
YZ		 5390 * the inode cache when its usage count
5391 * hits zero.
5392 */
5393 iput(inode);
5394 cond_resched();
5395 spin_lock(&root->inode_lock);
5396 goto again;
5397 }
5398
5399 if (cond_resched_lock(&root->inode_lock))
5400 goto again;
5401
5402 node = rb_next(node);
5403 }
5404 spin_unlock(&root->inode_lock);
5d4f98a2
YZ		 5405}
5406
e02119d5
CM		 5407static int btrfs_init_locked_inode(struct inode *inode, void *p)
5408{
5409 struct btrfs_iget_args *args = p;
90d3e592
CM		 5410 inode->i_ino = args->location->objectid;
5411 memcpy(&BTRFS_I(inode)->location, args->location,
5412 sizeof(*args->location));
e02119d5 5413 BTRFS_I(inode)->root = args->root;
39279cc3
CM		 5414 return 0;
5415}
5416
5417static int btrfs_find_actor(struct inode *inode, void *opaque)
5418{
5419 struct btrfs_iget_args *args = opaque;
90d3e592 5420 return args->location->objectid == BTRFS_I(inode)->location.objectid &&
d397712b 5421 args->root == BTRFS_I(inode)->root;
39279cc3
CM		 5422}
5423
5d4f98a2 5424static struct inode *btrfs_iget_locked(struct super_block *s,
90d3e592 5425 struct btrfs_key *location,
5d4f98a2 5426 struct btrfs_root *root)
39279cc3
CM		 5427{
5428 struct inode *inode;
5429 struct btrfs_iget_args args;
90d3e592 5430 unsigned long hashval = btrfs_inode_hash(location->objectid, root);
778ba82b 5431
90d3e592 5432 args.location = location;
39279cc3
CM		 5433 args.root = root;
5434
778ba82b 5435 inode = iget5_locked(s, hashval, btrfs_find_actor,
39279cc3
CM		 5436 btrfs_init_locked_inode,
5437 (void *)&args);
5438 return inode;
5439}
5440
1a54ef8c
BR		 5441/* Get an inode object given its location and corresponding root.
5442 * Returns in *is_new if the inode was read from disk
5443 */
5444struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location,
73f73415 5445 struct btrfs_root *root, int *new)
1a54ef8c
BR		 5446{
5447 struct inode *inode;
5448
90d3e592 5449 inode = btrfs_iget_locked(s, location, root);
1a54ef8c 5450 if (!inode)
5d4f98a2 5451 return ERR_PTR(-ENOMEM);
1a54ef8c
BR		 5452
5453 if (inode->i_state & I_NEW) {
1a54ef8c 5454 btrfs_read_locked_inode(inode);
1748f843
MF		 5455 if (!is_bad_inode(inode)) {
5456 inode_tree_add(inode);
5457 unlock_new_inode(inode);
5458 if (new)
5459 *new = 1;
5460 } else {
e0b6d65b
ST		 5461 unlock_new_inode(inode);
5462 iput(inode);
5463 inode = ERR_PTR(-ESTALE);
1748f843
MF		 5464 }
5465 }
5466
1a54ef8c
BR		 5467 return inode;
5468}
5469
4df27c4d
YZ		 5470static struct inode *new_simple_dir(struct super_block *s,
5471 struct btrfs_key *key,
5472 struct btrfs_root *root)
5473{
5474 struct inode *inode = new_inode(s);
5475
5476 if (!inode)
5477 return ERR_PTR(-ENOMEM);
5478
4df27c4d
YZ		 5479 BTRFS_I(inode)->root = root;
5480 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
72ac3c0d 5481 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
4df27c4d
YZ		 5482
5483 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
848cce0d 5484 inode->i_op = &btrfs_dir_ro_inode_operations;
4df27c4d
YZ		 5485 inode->i_fop = &simple_dir_operations;
5486 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
9cc97d64 5487 inode->i_mtime = CURRENT_TIME;
5488 inode->i_atime = inode->i_mtime;
5489 inode->i_ctime = inode->i_mtime;
5490 BTRFS_I(inode)->i_otime = inode->i_mtime;
4df27c4d
YZ		 5491
5492 return inode;
5493}
5494
3de4586c 5495struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
39279cc3 5496{
d397712b 5497 struct inode *inode;
4df27c4d 5498 struct btrfs_root *root = BTRFS_I(dir)->root;
39279cc3
CM		 5499 struct btrfs_root *sub_root = root;
5500 struct btrfs_key location;
76dda93c 5501 int index;
b4aff1f8 5502 int ret = 0;
39279cc3
CM		 5503
5504 if (dentry->d_name.len > BTRFS_NAME_LEN)
5505 return ERR_PTR(-ENAMETOOLONG);
5f39d397 5506
39e3c955 5507 ret = btrfs_inode_by_name(dir, dentry, &location);
39279cc3
CM		 5508 if (ret < 0)
5509 return ERR_PTR(ret);
5f39d397 5510
4df27c4d 5511 if (location.objectid == 0)
5662344b 5512 return ERR_PTR(-ENOENT);
4df27c4d
YZ		 5513
5514 if (location.type == BTRFS_INODE_ITEM_KEY) {
73f73415 5515 inode = btrfs_iget(dir->i_sb, &location, root, NULL);
4df27c4d
YZ		 5516 return inode;
5517 }
5518
5519 BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY);
5520
76dda93c 5521 index = srcu_read_lock(&root->fs_info->subvol_srcu);
4df27c4d
YZ		 5522 ret = fixup_tree_root_location(root, dir, dentry,
5523 &location, &sub_root);
5524 if (ret < 0) {
5525 if (ret != -ENOENT)
5526 inode = ERR_PTR(ret);
5527 else
5528 inode = new_simple_dir(dir->i_sb, &location, sub_root);
5529 } else {
73f73415 5530 inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL);
39279cc3 5531 }
76dda93c
YZ		 5532 srcu_read_unlock(&root->fs_info->subvol_srcu, index);
5533
34d19bad 5534 if (!IS_ERR(inode) && root != sub_root) {
c71bf099
YZ		 5535 down_read(&root->fs_info->cleanup_work_sem);
5536 if (!(inode->i_sb->s_flags & MS_RDONLY))
66b4ffd1 5537 ret = btrfs_orphan_cleanup(sub_root);
c71bf099 5538 up_read(&root->fs_info->cleanup_work_sem);
01cd3367
JB		 5539 if (ret) {
5540 iput(inode);
66b4ffd1 5541 inode = ERR_PTR(ret);
01cd3367 5542 }
c71bf099
YZ		 5543 }
5544
3de4586c
CM		 5545 return inode;
5546}
5547
fe15ce44 5548static int btrfs_dentry_delete(const struct dentry *dentry)
76dda93c
YZ		 5549{
5550 struct btrfs_root *root;
848cce0d 5551 struct inode *inode = dentry->d_inode;
76dda93c 5552
848cce0d
LZ		 5553 if (!inode && !IS_ROOT(dentry))
5554 inode = dentry->d_parent->d_inode;
76dda93c 5555
848cce0d
LZ		 5556 if (inode) {
5557 root = BTRFS_I(inode)->root;
efefb143
YZ		 5558 if (btrfs_root_refs(&root->root_item) == 0)
5559 return 1;
848cce0d
LZ		 5560
5561 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5562 return 1;
efefb143 5563 }
76dda93c
YZ		 5564 return 0;
5565}
5566
b4aff1f8
JB		 5567static void btrfs_dentry_release(struct dentry *dentry)
5568{
944a4515 5569 kfree(dentry->d_fsdata);
b4aff1f8
JB		 5570}
5571
3de4586c 5572static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
00cd8dd3 5573 unsigned int flags)
3de4586c 5574{
5662344b 5575 struct inode *inode;
a66e7cc6 5576
5662344b
TI		 5577 inode = btrfs_lookup_dentry(dir, dentry);
5578 if (IS_ERR(inode)) {
5579 if (PTR_ERR(inode) == -ENOENT)
5580 inode = NULL;
5581 else
5582 return ERR_CAST(inode);
5583 }
5584
41d28bca 5585 return d_splice_alias(inode, dentry);
39279cc3
CM		 5586}
5587
16cdcec7 5588unsigned char btrfs_filetype_table[] = {
39279cc3
CM		 5589 DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
5590};
5591
9cdda8d3 5592static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
39279cc3 5593{
9cdda8d3 5594 struct inode *inode = file_inode(file);
39279cc3
CM		 5595 struct btrfs_root *root = BTRFS_I(inode)->root;
5596 struct btrfs_item *item;
5597 struct btrfs_dir_item *di;
5598 struct btrfs_key key;
5f39d397 5599 struct btrfs_key found_key;
39279cc3 5600 struct btrfs_path *path;
16cdcec7
MX		 5601 struct list_head ins_list;
5602 struct list_head del_list;
39279cc3 5603 int ret;
5f39d397 5604 struct extent_buffer *leaf;
39279cc3 5605 int slot;
39279cc3
CM		 5606 unsigned char d_type;
5607 int over = 0;
5608 u32 di_cur;
5609 u32 di_total;
5610 u32 di_len;
5611 int key_type = BTRFS_DIR_INDEX_KEY;
5f39d397
CM		 5612 char tmp_name[32];
5613 char *name_ptr;
5614 int name_len;
9cdda8d3 5615 int is_curr = 0; /* ctx->pos points to the current index? */
39279cc3
CM		 5616
5617 /* FIXME, use a real flag for deciding about the key type */
5618 if (root->fs_info->tree_root == root)
5619 key_type = BTRFS_DIR_ITEM_KEY;
5f39d397 5620
9cdda8d3
AV		 5621 if (!dir_emit_dots(file, ctx))
5622 return 0;
5623
49593bfa 5624 path = btrfs_alloc_path();
16cdcec7
MX		 5625 if (!path)
5626 return -ENOMEM;
ff5714cc 5627
026fd317 5628 path->reada = 1;
49593bfa 5629
16cdcec7
MX		 5630 if (key_type == BTRFS_DIR_INDEX_KEY) {
5631 INIT_LIST_HEAD(&ins_list);
5632 INIT_LIST_HEAD(&del_list);
5633 btrfs_get_delayed_items(inode, &ins_list, &del_list);
5634 }
5635
962a298f 5636 key.type = key_type;
9cdda8d3 5637 key.offset = ctx->pos;
33345d01 5638 key.objectid = btrfs_ino(inode);
5f39d397 5639
39279cc3
CM		 5640 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5641 if (ret < 0)
5642 goto err;
49593bfa
DW		 5643
5644 while (1) {
5f39d397 5645 leaf = path->nodes[0];
39279cc3 5646 slot = path->slots[0];
b9e03af0
LZ		 5647 if (slot >= btrfs_header_nritems(leaf)) {
5648 ret = btrfs_next_leaf(root, path);
5649 if (ret < 0)
5650 goto err;
5651 else if (ret > 0)
5652 break;
5653 continue;
39279cc3 5654 }
3de4586c 5655
dd3cc16b 5656 item = btrfs_item_nr(slot);
5f39d397
CM		 5657 btrfs_item_key_to_cpu(leaf, &found_key, slot);
5658
5659 if (found_key.objectid != key.objectid)
39279cc3 5660 break;
962a298f 5661 if (found_key.type != key_type)
39279cc3 5662 break;
9cdda8d3 5663 if (found_key.offset < ctx->pos)
b9e03af0 5664 goto next;
16cdcec7
MX		 5665 if (key_type == BTRFS_DIR_INDEX_KEY &&
5666 btrfs_should_delete_dir_index(&del_list,
5667 found_key.offset))
5668 goto next;
5f39d397 5669
9cdda8d3 5670 ctx->pos = found_key.offset;
16cdcec7 5671 is_curr = 1;
49593bfa 5672
39279cc3
CM		 5673 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
5674 di_cur = 0;
5f39d397 5675 di_total = btrfs_item_size(leaf, item);
49593bfa
DW		 5676
5677 while (di_cur < di_total) {
5f39d397
CM		 5678 struct btrfs_key location;
5679
22a94d44
JB		 5680 if (verify_dir_item(root, leaf, di))
5681 break;
5682
5f39d397 5683 name_len = btrfs_dir_name_len(leaf, di);
49593bfa 5684 if (name_len <= sizeof(tmp_name)) {
5f39d397
CM		 5685 name_ptr = tmp_name;
5686 } else {
5687 name_ptr = kmalloc(name_len, GFP_NOFS);
49593bfa
DW		 5688 if (!name_ptr) {
5689 ret = -ENOMEM;
5690 goto err;
5691 }
5f39d397
CM		 5692 }
5693 read_extent_buffer(leaf, name_ptr,
5694 (unsigned long)(di + 1), name_len);
5695
5696 d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
5697 btrfs_dir_item_key_to_cpu(leaf, di, &location);
3de4586c 5698
fede766f 5699
3de4586c 5700 /* is this a reference to our own snapshot? If so
8c9c2bf7
AJ		 5701 * skip it.
5702 *
5703 * In contrast to old kernels, we insert the snapshot's
5704 * dir item and dir index after it has been created, so
5705 * we won't find a reference to our own snapshot. We
5706 * still keep the following code for backward
5707 * compatibility.
3de4586c
CM		 5708 */
5709 if (location.type == BTRFS_ROOT_ITEM_KEY &&
5710 location.objectid == root->root_key.objectid) {
5711 over = 0;
5712 goto skip;
5713 }
9cdda8d3
AV		 5714 over = !dir_emit(ctx, name_ptr, name_len,
5715 location.objectid, d_type);
5f39d397 5716
3de4586c 5717skip:
5f39d397
CM		 5718 if (name_ptr != tmp_name)
5719 kfree(name_ptr);
5720
39279cc3
CM		 5721 if (over)
5722 goto nopos;
5103e947 5723 di_len = btrfs_dir_name_len(leaf, di) +
49593bfa 5724 btrfs_dir_data_len(leaf, di) + sizeof(*di);
39279cc3
CM		 5725 di_cur += di_len;
5726 di = (struct btrfs_dir_item *)((char *)di + di_len);
5727 }
b9e03af0
LZ		 5728next:
5729 path->slots[0]++;
39279cc3 5730 }
49593bfa 5731
16cdcec7
MX		 5732 if (key_type == BTRFS_DIR_INDEX_KEY) {
5733 if (is_curr)
9cdda8d3
AV		 5734 ctx->pos++;
5735 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
16cdcec7
MX		 5736 if (ret)
5737 goto nopos;
5738 }
5739
49593bfa 5740 /* Reached end of directory/root. Bump pos past the last item. */
db62efbb
ZB		 5741 ctx->pos++;
5742
5743 /*
5744 * Stop new entries from being returned after we return the last
5745 * entry.
5746 *
5747 * New directory entries are assigned a strictly increasing
5748 * offset. This means that new entries created during readdir
5749 * are *guaranteed* to be seen in the future by that readdir.
5750 * This has broken buggy programs which operate on names as
5751 * they're returned by readdir. Until we re-use freed offsets
5752 * we have this hack to stop new entries from being returned
5753 * under the assumption that they'll never reach this huge
5754 * offset.
5755 *
5756 * This is being careful not to overflow 32bit loff_t unless the
5757 * last entry requires it because doing so has broken 32bit apps
5758 * in the past.
5759 */
5760 if (key_type == BTRFS_DIR_INDEX_KEY) {
5761 if (ctx->pos >= INT_MAX)
5762 ctx->pos = LLONG_MAX;
5763 else
5764 ctx->pos = INT_MAX;
5765 }
39279cc3
CM		 5766nopos:
5767 ret = 0;
5768err:
16cdcec7
MX		 5769 if (key_type == BTRFS_DIR_INDEX_KEY)
5770 btrfs_put_delayed_items(&ins_list, &del_list);
39279cc3 5771 btrfs_free_path(path);
39279cc3
CM		 5772 return ret;
5773}
5774
a9185b41 5775int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc)
39279cc3
CM		 5776{
5777 struct btrfs_root *root = BTRFS_I(inode)->root;
5778 struct btrfs_trans_handle *trans;
5779 int ret = 0;
0af3d00b 5780 bool nolock = false;
39279cc3 5781
72ac3c0d 5782 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
4ca8b41e
CM		 5783 return 0;
5784
83eea1f1 5785 if (btrfs_fs_closing(root->fs_info) && btrfs_is_free_space_inode(inode))
82d5902d 5786 nolock = true;
0af3d00b 5787
a9185b41 5788 if (wbc->sync_mode == WB_SYNC_ALL) {
0af3d00b 5789 if (nolock)
7a7eaa40 5790 trans = btrfs_join_transaction_nolock(root);
0af3d00b 5791 else
7a7eaa40 5792 trans = btrfs_join_transaction(root);
3612b495
TI		 5793 if (IS_ERR(trans))
5794 return PTR_ERR(trans);
a698d075 5795 ret = btrfs_commit_transaction(trans, root);
39279cc3
CM		 5796 }
5797 return ret;
5798}
5799
5800/*
54aa1f4d 5801 * This is somewhat expensive, updating the tree every time the
39279cc3
CM		 5802 * inode changes. But, it is most likely to find the inode in cache.
5803 * FIXME, needs more benchmarking...there are no reasons other than performance
5804 * to keep or drop this code.
5805 */
48a3b636 5806static int btrfs_dirty_inode(struct inode *inode)
39279cc3
CM		 5807{
5808 struct btrfs_root *root = BTRFS_I(inode)->root;
5809 struct btrfs_trans_handle *trans;
8929ecfa
YZ		 5810 int ret;
5811
72ac3c0d 5812 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
22c44fe6 5813 return 0;
39279cc3 5814
7a7eaa40 5815 trans = btrfs_join_transaction(root);
22c44fe6
JB		 5816 if (IS_ERR(trans))
5817 return PTR_ERR(trans);
8929ecfa
YZ		 5818
5819 ret = btrfs_update_inode(trans, root, inode);
94b60442
CM		 5820 if (ret && ret == -ENOSPC) {
5821 /* whoops, lets try again with the full transaction */
5822 btrfs_end_transaction(trans, root);
5823 trans = btrfs_start_transaction(root, 1);
22c44fe6
JB		 5824 if (IS_ERR(trans))
5825 return PTR_ERR(trans);
8929ecfa 5826
94b60442 5827 ret = btrfs_update_inode(trans, root, inode);
94b60442 5828 }
39279cc3 5829 btrfs_end_transaction(trans, root);
16cdcec7
MX		 5830 if (BTRFS_I(inode)->delayed_node)
5831 btrfs_balance_delayed_items(root);
22c44fe6
JB		 5832
5833 return ret;
5834}
5835
5836/*
5837 * This is a copy of file_update_time. We need this so we can return error on
5838 * ENOSPC for updating the inode in the case of file write and mmap writes.
5839 */
e41f941a
JB		 5840static int btrfs_update_time(struct inode *inode, struct timespec *now,
5841 int flags)
22c44fe6 5842{
2bc55652
AB		 5843 struct btrfs_root *root = BTRFS_I(inode)->root;
5844
5845 if (btrfs_root_readonly(root))
5846 return -EROFS;
5847
e41f941a 5848 if (flags & S_VERSION)
22c44fe6 5849 inode_inc_iversion(inode);
e41f941a
JB		 5850 if (flags & S_CTIME)
5851 inode->i_ctime = *now;
5852 if (flags & S_MTIME)
5853 inode->i_mtime = *now;
5854 if (flags & S_ATIME)
5855 inode->i_atime = *now;
5856 return btrfs_dirty_inode(inode);
39279cc3
CM		 5857}
5858
d352ac68
CM		 5859/*
5860 * find the highest existing sequence number in a directory
5861 * and then set the in-memory index_cnt variable to reflect
5862 * free sequence numbers
5863 */
aec7477b
JB		 5864static int btrfs_set_inode_index_count(struct inode *inode)
5865{
5866 struct btrfs_root *root = BTRFS_I(inode)->root;
5867 struct btrfs_key key, found_key;
5868 struct btrfs_path *path;
5869 struct extent_buffer *leaf;
5870 int ret;
5871
33345d01 5872 key.objectid = btrfs_ino(inode);
962a298f 5873 key.type = BTRFS_DIR_INDEX_KEY;
aec7477b
JB		 5874 key.offset = (u64)-1;
5875
5876 path = btrfs_alloc_path();
5877 if (!path)
5878 return -ENOMEM;
5879
5880 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5881 if (ret < 0)
5882 goto out;
5883 /* FIXME: we should be able to handle this */
5884 if (ret == 0)
5885 goto out;
5886 ret = 0;
5887
5888 /*
5889 * MAGIC NUMBER EXPLANATION:
5890 * since we search a directory based on f_pos we have to start at 2
5891 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
5892 * else has to start at 2
5893 */
5894 if (path->slots[0] == 0) {
5895 BTRFS_I(inode)->index_cnt = 2;
5896 goto out;
5897 }
5898
5899 path->slots[0]--;
5900
5901 leaf = path->nodes[0];
5902 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5903
33345d01 5904 if (found_key.objectid != btrfs_ino(inode) ||
962a298f 5905 found_key.type != BTRFS_DIR_INDEX_KEY) {
aec7477b
JB		 5906 BTRFS_I(inode)->index_cnt = 2;
5907 goto out;
5908 }
5909
5910 BTRFS_I(inode)->index_cnt = found_key.offset + 1;
5911out:
5912 btrfs_free_path(path);
5913 return ret;
5914}
5915
d352ac68
CM		 5916/*
5917 * helper to find a free sequence number in a given directory. This current
5918 * code is very simple, later versions will do smarter things in the btree
5919 */
3de4586c 5920int btrfs_set_inode_index(struct inode *dir, u64 *index)
aec7477b
JB		 5921{
5922 int ret = 0;
5923
5924 if (BTRFS_I(dir)->index_cnt == (u64)-1) {
16cdcec7
MX		 5925 ret = btrfs_inode_delayed_dir_index_count(dir);
5926 if (ret) {
5927 ret = btrfs_set_inode_index_count(dir);
5928 if (ret)
5929 return ret;
5930 }
aec7477b
JB		 5931 }
5932
00e4e6b3 5933 *index = BTRFS_I(dir)->index_cnt;
aec7477b
JB		 5934 BTRFS_I(dir)->index_cnt++;
5935
5936 return ret;
5937}
5938
b0d5d10f
CM		 5939static int btrfs_insert_inode_locked(struct inode *inode)
5940{
5941 struct btrfs_iget_args args;
5942 args.location = &BTRFS_I(inode)->location;
5943 args.root = BTRFS_I(inode)->root;
5944
5945 return insert_inode_locked4(inode,
5946 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
5947 btrfs_find_actor, &args);
5948}
5949
39279cc3
CM		 5950static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
5951 struct btrfs_root *root,
aec7477b 5952 struct inode *dir,
9c58309d 5953 const char *name, int name_len,
175a4eb7
AV		 5954 u64 ref_objectid, u64 objectid,
5955 umode_t mode, u64 *index)
39279cc3
CM		 5956{
5957 struct inode *inode;
5f39d397 5958 struct btrfs_inode_item *inode_item;
39279cc3 5959 struct btrfs_key *location;
5f39d397 5960 struct btrfs_path *path;
9c58309d
CM		 5961 struct btrfs_inode_ref *ref;
5962 struct btrfs_key key[2];
5963 u32 sizes[2];
ef3b9af5 5964 int nitems = name ? 2 : 1;
9c58309d 5965 unsigned long ptr;
39279cc3 5966 int ret;
39279cc3 5967
5f39d397 5968 path = btrfs_alloc_path();
d8926bb3
MF		 5969 if (!path)
5970 return ERR_PTR(-ENOMEM);
5f39d397 5971
39279cc3 5972 inode = new_inode(root->fs_info->sb);
8fb27640
YS		 5973 if (!inode) {
5974 btrfs_free_path(path);
39279cc3 5975 return ERR_PTR(-ENOMEM);
8fb27640 5976 }
39279cc3 5977
5762b5c9
FM		 5978 /*
5979 * O_TMPFILE, set link count to 0, so that after this point,
5980 * we fill in an inode item with the correct link count.
5981 */
5982 if (!name)
5983 set_nlink(inode, 0);
5984
581bb050
LZ		 5985 /*
5986 * we have to initialize this early, so we can reclaim the inode
5987 * number if we fail afterwards in this function.
5988 */
5989 inode->i_ino = objectid;
5990
ef3b9af5 5991 if (dir && name) {
1abe9b8a 5992 trace_btrfs_inode_request(dir);
5993
3de4586c 5994 ret = btrfs_set_inode_index(dir, index);
09771430 5995 if (ret) {
8fb27640 5996 btrfs_free_path(path);
09771430 5997 iput(inode);
aec7477b 5998 return ERR_PTR(ret);
09771430 5999 }
ef3b9af5
FM		 6000 } else if (dir) {
6001 *index = 0;
aec7477b
JB		 6002 }
6003 /*
6004 * index_cnt is ignored for everything but a dir,
6005 * btrfs_get_inode_index_count has an explanation for the magic
6006 * number
6007 */
6008 BTRFS_I(inode)->index_cnt = 2;
67de1176 6009 BTRFS_I(inode)->dir_index = *index;
39279cc3 6010 BTRFS_I(inode)->root = root;
e02119d5 6011 BTRFS_I(inode)->generation = trans->transid;
76195853 6012 inode->i_generation = BTRFS_I(inode)->generation;
b888db2b 6013
5dc562c5
JB		 6014 /*
6015 * We could have gotten an inode number from somebody who was fsynced
6016 * and then removed in this same transaction, so let's just set full
6017 * sync since it will be a full sync anyway and this will blow away the
6018 * old info in the log.
6019 */
6020 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
6021
9c58309d 6022 key[0].objectid = objectid;
962a298f 6023 key[0].type = BTRFS_INODE_ITEM_KEY;
9c58309d
CM		 6024 key[0].offset = 0;
6025
9c58309d 6026 sizes[0] = sizeof(struct btrfs_inode_item);
ef3b9af5
FM		 6027
6028 if (name) {
6029 /*
6030 * Start new inodes with an inode_ref. This is slightly more
6031 * efficient for small numbers of hard links since they will
6032 * be packed into one item. Extended refs will kick in if we
6033 * add more hard links than can fit in the ref item.
6034 */
6035 key[1].objectid = objectid;
962a298f 6036 key[1].type = BTRFS_INODE_REF_KEY;
ef3b9af5
FM		 6037 key[1].offset = ref_objectid;
6038
6039 sizes[1] = name_len + sizeof(*ref);
6040 }
9c58309d 6041
b0d5d10f
CM		 6042 location = &BTRFS_I(inode)->location;
6043 location->objectid = objectid;
6044 location->offset = 0;
962a298f 6045 location->type = BTRFS_INODE_ITEM_KEY;
b0d5d10f
CM		 6046
6047 ret = btrfs_insert_inode_locked(inode);
6048 if (ret < 0)
6049 goto fail;
6050
b9473439 6051 path->leave_spinning = 1;
ef3b9af5 6052 ret = btrfs_insert_empty_items(trans, root, path, key, sizes, nitems);
9c58309d 6053 if (ret != 0)
b0d5d10f 6054 goto fail_unlock;
5f39d397 6055
ecc11fab 6056 inode_init_owner(inode, dir, mode);
a76a3cd4 6057 inode_set_bytes(inode, 0);
9cc97d64 6058
6059 inode->i_mtime = CURRENT_TIME;
6060 inode->i_atime = inode->i_mtime;
6061 inode->i_ctime = inode->i_mtime;
6062 BTRFS_I(inode)->i_otime = inode->i_mtime;
6063
5f39d397
CM		 6064 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6065 struct btrfs_inode_item);
293f7e07
LZ		 6066 memset_extent_buffer(path->nodes[0], 0, (unsigned long)inode_item,
6067 sizeof(*inode_item));
e02119d5 6068 fill_inode_item(trans, path->nodes[0], inode_item, inode);
9c58309d 6069
ef3b9af5
FM		 6070 if (name) {
6071 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6072 struct btrfs_inode_ref);
6073 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
6074 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
6075 ptr = (unsigned long)(ref + 1);
6076 write_extent_buffer(path->nodes[0], name, ptr, name_len);
6077 }
9c58309d 6078
5f39d397
CM		 6079 btrfs_mark_buffer_dirty(path->nodes[0]);
6080 btrfs_free_path(path);
6081
6cbff00f
CH		 6082 btrfs_inherit_iflags(inode, dir);
6083
569254b0 6084 if (S_ISREG(mode)) {
94272164
CM		 6085 if (btrfs_test_opt(root, NODATASUM))
6086 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
213490b3 6087 if (btrfs_test_opt(root, NODATACOW))
f2bdf9a8
JB		 6088 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6089 BTRFS_INODE_NODATASUM;
94272164
CM		 6090 }
6091
5d4f98a2 6092 inode_tree_add(inode);
1abe9b8a 6093
6094 trace_btrfs_inode_new(inode);
1973f0fa 6095 btrfs_set_inode_last_trans(trans, inode);
1abe9b8a 6096
8ea05e3a
AB		 6097 btrfs_update_root_times(trans, root);
6098
63541927
FDBM		 6099 ret = btrfs_inode_inherit_props(trans, inode, dir);
6100 if (ret)
6101 btrfs_err(root->fs_info,
6102 "error inheriting props for ino %llu (root %llu): %d",
6103 btrfs_ino(inode), root->root_key.objectid, ret);
6104
39279cc3 6105 return inode;
b0d5d10f
CM		 6106
6107fail_unlock:
6108 unlock_new_inode(inode);
5f39d397 6109fail:
ef3b9af5 6110 if (dir && name)
aec7477b 6111 BTRFS_I(dir)->index_cnt--;
5f39d397 6112 btrfs_free_path(path);
09771430 6113 iput(inode);
5f39d397 6114 return ERR_PTR(ret);
39279cc3
CM		 6115}
6116
6117static inline u8 btrfs_inode_type(struct inode *inode)
6118{
6119 return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
6120}
6121
d352ac68
CM		 6122/*
6123 * utility function to add 'inode' into 'parent_inode' with
6124 * a give name and a given sequence number.
6125 * if 'add_backref' is true, also insert a backref from the
6126 * inode to the parent directory.
6127 */
e02119d5
CM		 6128int btrfs_add_link(struct btrfs_trans_handle *trans,
6129 struct inode *parent_inode, struct inode *inode,
6130 const char *name, int name_len, int add_backref, u64 index)
39279cc3 6131{
4df27c4d 6132 int ret = 0;
39279cc3 6133 struct btrfs_key key;
e02119d5 6134 struct btrfs_root *root = BTRFS_I(parent_inode)->root;
33345d01
LZ		 6135 u64 ino = btrfs_ino(inode);
6136 u64 parent_ino = btrfs_ino(parent_inode);
5f39d397 6137
33345d01 6138 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4df27c4d
YZ		 6139 memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key));
6140 } else {
33345d01 6141 key.objectid = ino;
962a298f 6142 key.type = BTRFS_INODE_ITEM_KEY;
4df27c4d
YZ		 6143 key.offset = 0;
6144 }
6145
33345d01 6146 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4df27c4d
YZ		 6147 ret = btrfs_add_root_ref(trans, root->fs_info->tree_root,
6148 key.objectid, root->root_key.objectid,
33345d01 6149 parent_ino, index, name, name_len);
4df27c4d 6150 } else if (add_backref) {
33345d01
LZ		 6151 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
6152 parent_ino, index);
4df27c4d 6153 }
39279cc3 6154
79787eaa
JM		 6155 /* Nothing to clean up yet */
6156 if (ret)
6157 return ret;
4df27c4d 6158
79787eaa
JM		 6159 ret = btrfs_insert_dir_item(trans, root, name, name_len,
6160 parent_inode, &key,
6161 btrfs_inode_type(inode), index);
9c52057c 6162 if (ret == -EEXIST || ret == -EOVERFLOW)
79787eaa
JM		 6163 goto fail_dir_item;
6164 else if (ret) {
6165 btrfs_abort_transaction(trans, root, ret);
6166 return ret;
39279cc3 6167 }
79787eaa
JM		 6168
6169 btrfs_i_size_write(parent_inode, parent_inode->i_size +
6170 name_len * 2);
0c4d2d95 6171 inode_inc_iversion(parent_inode);
79787eaa
JM		 6172 parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
6173 ret = btrfs_update_inode(trans, root, parent_inode);
6174 if (ret)
6175 btrfs_abort_transaction(trans, root, ret);
39279cc3 6176 return ret;
fe66a05a
CM		 6177
6178fail_dir_item:
6179 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6180 u64 local_index;
6181 int err;
6182 err = btrfs_del_root_ref(trans, root->fs_info->tree_root,
6183 key.objectid, root->root_key.objectid,
6184 parent_ino, &local_index, name, name_len);
6185
6186 } else if (add_backref) {
6187 u64 local_index;
6188 int err;
6189
6190 err = btrfs_del_inode_ref(trans, root, name, name_len,
6191 ino, parent_ino, &local_index);
6192 }
6193 return ret;
39279cc3
CM		 6194}
6195
6196static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
a1b075d2
JB		 6197 struct inode *dir, struct dentry *dentry,
6198 struct inode *inode, int backref, u64 index)
39279cc3 6199{
a1b075d2
JB		 6200 int err = btrfs_add_link(trans, dir, inode,
6201 dentry->d_name.name, dentry->d_name.len,
6202 backref, index);
39279cc3
CM		 6203 if (err > 0)
6204 err = -EEXIST;
6205 return err;
6206}
6207
618e21d5 6208static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
1a67aafb 6209 umode_t mode, dev_t rdev)
618e21d5
JB		 6210{
6211 struct btrfs_trans_handle *trans;
6212 struct btrfs_root *root = BTRFS_I(dir)->root;
1832a6d5 6213 struct inode *inode = NULL;
618e21d5
JB		 6214 int err;
6215 int drop_inode = 0;
6216 u64 objectid;
00e4e6b3 6217 u64 index = 0;
618e21d5
JB		 6218
6219 if (!new_valid_dev(rdev))
6220 return -EINVAL;
6221
9ed74f2d
JB		 6222 /*
6223 * 2 for inode item and ref
6224 * 2 for dir items
6225 * 1 for xattr if selinux is on
6226 */
a22285a6
YZ		 6227 trans = btrfs_start_transaction(root, 5);
6228 if (IS_ERR(trans))
6229 return PTR_ERR(trans);
1832a6d5 6230
581bb050
LZ		 6231 err = btrfs_find_free_ino(root, &objectid);
6232 if (err)
6233 goto out_unlock;
6234
aec7477b 6235 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
33345d01 6236 dentry->d_name.len, btrfs_ino(dir), objectid,
d82a6f1d 6237 mode, &index);
7cf96da3
TI		 6238 if (IS_ERR(inode)) {
6239 err = PTR_ERR(inode);
618e21d5 6240 goto out_unlock;
7cf96da3 6241 }
618e21d5 6242
ad19db71
CS		 6243 /*
6244 * If the active LSM wants to access the inode during
6245 * d_instantiate it needs these. Smack checks to see
6246 * if the filesystem supports xattrs by looking at the
6247 * ops vector.
6248 */
ad19db71 6249 inode->i_op = &btrfs_special_inode_operations;
b0d5d10f
CM		 6250 init_special_inode(inode, inode->i_mode, rdev);
6251
6252 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
618e21d5 6253 if (err)
b0d5d10f
CM		 6254 goto out_unlock_inode;
6255
6256 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
6257 if (err) {
6258 goto out_unlock_inode;
6259 } else {
1b4ab1bb 6260 btrfs_update_inode(trans, root, inode);
b0d5d10f 6261 unlock_new_inode(inode);
08c422c2 6262 d_instantiate(dentry, inode);
618e21d5 6263 }
b0d5d10f 6264
618e21d5 6265out_unlock:
7ad85bb7 6266 btrfs_end_transaction(trans, root);
c581afc8 6267 btrfs_balance_delayed_items(root);
b53d3f5d 6268 btrfs_btree_balance_dirty(root);
618e21d5
JB		 6269 if (drop_inode) {
6270 inode_dec_link_count(inode);
6271 iput(inode);
6272 }
618e21d5 6273 return err;
b0d5d10f
CM		 6274
6275out_unlock_inode:
6276 drop_inode = 1;
6277 unlock_new_inode(inode);
6278 goto out_unlock;
6279
618e21d5
JB		 6280}
6281
39279cc3 6282static int btrfs_create(struct inode *dir, struct dentry *dentry,
ebfc3b49 6283 umode_t mode, bool excl)
39279cc3
CM		 6284{
6285 struct btrfs_trans_handle *trans;
6286 struct btrfs_root *root = BTRFS_I(dir)->root;
1832a6d5 6287 struct inode *inode = NULL;
43baa579 6288 int drop_inode_on_err = 0;
a22285a6 6289 int err;
39279cc3 6290 u64 objectid;
00e4e6b3 6291 u64 index = 0;
39279cc3 6292
9ed74f2d
JB		 6293 /*
6294 * 2 for inode item and ref
6295 * 2 for dir items
6296 * 1 for xattr if selinux is on
6297 */
a22285a6
YZ		 6298 trans = btrfs_start_transaction(root, 5);
6299 if (IS_ERR(trans))
6300 return PTR_ERR(trans);
9ed74f2d 6301
581bb050
LZ		 6302 err = btrfs_find_free_ino(root, &objectid);
6303 if (err)
6304 goto out_unlock;
6305
aec7477b 6306 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
33345d01 6307 dentry->d_name.len, btrfs_ino(dir), objectid,
d82a6f1d 6308 mode, &index);
7cf96da3
TI		 6309 if (IS_ERR(inode)) {
6310 err = PTR_ERR(inode);
39279cc3 6311 goto out_unlock;
7cf96da3 6312 }
43baa579 6313 drop_inode_on_err = 1;
ad19db71
CS		 6314 /*
6315 * If the active LSM wants to access the inode during
6316 * d_instantiate it needs these. Smack checks to see
6317 * if the filesystem supports xattrs by looking at the
6318 * ops vector.
6319 */
6320 inode->i_fop = &btrfs_file_operations;
6321 inode->i_op = &btrfs_file_inode_operations;
b0d5d10f 6322 inode->i_mapping->a_ops = &btrfs_aops;
b0d5d10f
CM		 6323
6324 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6325 if (err)
6326 goto out_unlock_inode;
6327
6328 err = btrfs_update_inode(trans, root, inode);
6329 if (err)
6330 goto out_unlock_inode;
ad19db71 6331
a1b075d2 6332 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
39279cc3 6333 if (err)
b0d5d10f 6334 goto out_unlock_inode;
43baa579 6335
43baa579 6336 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
b0d5d10f 6337 unlock_new_inode(inode);
43baa579
FB		 6338 d_instantiate(dentry, inode);
6339
39279cc3 6340out_unlock:
7ad85bb7 6341 btrfs_end_transaction(trans, root);
43baa579 6342 if (err && drop_inode_on_err) {
39279cc3
CM		 6343 inode_dec_link_count(inode);
6344 iput(inode);
6345 }
c581afc8 6346 btrfs_balance_delayed_items(root);
b53d3f5d 6347 btrfs_btree_balance_dirty(root);
39279cc3 6348 return err;
b0d5d10f
CM		 6349
6350out_unlock_inode:
6351 unlock_new_inode(inode);
6352 goto out_unlock;
6353
39279cc3
CM		 6354}
6355
6356static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6357 struct dentry *dentry)
6358{
6359 struct btrfs_trans_handle *trans;
6360 struct btrfs_root *root = BTRFS_I(dir)->root;
6361 struct inode *inode = old_dentry->d_inode;
00e4e6b3 6362 u64 index;
39279cc3
CM		 6363 int err;
6364 int drop_inode = 0;
6365
4a8be425
TH		 6366 /* do not allow sys_link's with other subvols of the same device */
6367 if (root->objectid != BTRFS_I(inode)->root->objectid)
3ab3564f 6368 return -EXDEV;
4a8be425 6369
f186373f 6370 if (inode->i_nlink >= BTRFS_LINK_MAX)
c055e99e 6371 return -EMLINK;
4a8be425 6372
3de4586c 6373 err = btrfs_set_inode_index(dir, &index);
aec7477b
JB		 6374 if (err)
6375 goto fail;
6376
a22285a6 6377 /*
7e6b6465 6378 * 2 items for inode and inode ref
a22285a6 6379 * 2 items for dir items
7e6b6465 6380 * 1 item for parent inode
a22285a6 6381 */
7e6b6465 6382 trans = btrfs_start_transaction(root, 5);
a22285a6
YZ		 6383 if (IS_ERR(trans)) {
6384 err = PTR_ERR(trans);
6385 goto fail;
6386 }
5f39d397 6387
67de1176
MX		 6388 /* There are several dir indexes for this inode, clear the cache. */
6389 BTRFS_I(inode)->dir_index = 0ULL;
8b558c5f 6390 inc_nlink(inode);
0c4d2d95 6391 inode_inc_iversion(inode);
3153495d 6392 inode->i_ctime = CURRENT_TIME;
7de9c6ee 6393 ihold(inode);
e9976151 6394 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
aec7477b 6395
a1b075d2 6396 err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index);
5f39d397 6397
a5719521 6398 if (err) {
54aa1f4d 6399 drop_inode = 1;
a5719521 6400 } else {
10d9f309 6401 struct dentry *parent = dentry->d_parent;
a5719521 6402 err = btrfs_update_inode(trans, root, inode);
79787eaa
JM		 6403 if (err)
6404 goto fail;
ef3b9af5
FM		 6405 if (inode->i_nlink == 1) {
6406 /*
6407 * If new hard link count is 1, it's a file created
6408 * with open(2) O_TMPFILE flag.
6409 */
6410 err = btrfs_orphan_del(trans, inode);
6411 if (err)
6412 goto fail;
6413 }
08c422c2 6414 d_instantiate(dentry, inode);
6a912213 6415 btrfs_log_new_name(trans, inode, NULL, parent);
a5719521 6416 }
39279cc3 6417
7ad85bb7 6418 btrfs_end_transaction(trans, root);
c581afc8 6419 btrfs_balance_delayed_items(root);
1832a6d5 6420fail:
39279cc3
CM		 6421 if (drop_inode) {
6422 inode_dec_link_count(inode);
6423 iput(inode);
6424 }
b53d3f5d 6425 btrfs_btree_balance_dirty(root);
39279cc3
CM		 6426 return err;
6427}
6428
18bb1db3 6429static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
39279cc3 6430{
b9d86667 6431 struct inode *inode = NULL;
39279cc3
CM		 6432 struct btrfs_trans_handle *trans;
6433 struct btrfs_root *root = BTRFS_I(dir)->root;
6434 int err = 0;
6435 int drop_on_err = 0;
b9d86667 6436 u64 objectid = 0;
00e4e6b3 6437 u64 index = 0;
39279cc3 6438
9ed74f2d
JB		 6439 /*
6440 * 2 items for inode and ref
6441 * 2 items for dir items
6442 * 1 for xattr if selinux is on
6443 */
a22285a6
YZ		 6444 trans = btrfs_start_transaction(root, 5);
6445 if (IS_ERR(trans))
6446 return PTR_ERR(trans);
39279cc3 6447
581bb050
LZ		 6448 err = btrfs_find_free_ino(root, &objectid);
6449 if (err)
6450 goto out_fail;
6451
aec7477b 6452 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
33345d01 6453 dentry->d_name.len, btrfs_ino(dir), objectid,
d82a6f1d 6454 S_IFDIR | mode, &index);
39279cc3
CM		 6455 if (IS_ERR(inode)) {
6456 err = PTR_ERR(inode);
6457 goto out_fail;
6458 }
5f39d397 6459
39279cc3 6460 drop_on_err = 1;
b0d5d10f
CM		 6461 /* these must be set before we unlock the inode */
6462 inode->i_op = &btrfs_dir_inode_operations;
6463 inode->i_fop = &btrfs_dir_file_operations;
33268eaf 6464
2a7dba39 6465 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
33268eaf 6466 if (err)
b0d5d10f 6467 goto out_fail_inode;
39279cc3 6468
dbe674a9 6469 btrfs_i_size_write(inode, 0);
39279cc3
CM		 6470 err = btrfs_update_inode(trans, root, inode);
6471 if (err)
b0d5d10f 6472 goto out_fail_inode;
5f39d397 6473
a1b075d2
JB		 6474 err = btrfs_add_link(trans, dir, inode, dentry->d_name.name,
6475 dentry->d_name.len, 0, index);
39279cc3 6476 if (err)
b0d5d10f 6477 goto out_fail_inode;
5f39d397 6478
39279cc3 6479 d_instantiate(dentry, inode);
b0d5d10f
CM		 6480 /*
6481 * mkdir is special. We're unlocking after we call d_instantiate
6482 * to avoid a race with nfsd calling d_instantiate.
6483 */
6484 unlock_new_inode(inode);
39279cc3 6485 drop_on_err = 0;
39279cc3
CM		 6486
6487out_fail:
7ad85bb7 6488 btrfs_end_transaction(trans, root);
c7cfb8a5
WS		 6489 if (drop_on_err) {
6490 inode_dec_link_count(inode);
39279cc3 6491 iput(inode);
c7cfb8a5 6492 }
c581afc8 6493 btrfs_balance_delayed_items(root);
b53d3f5d 6494 btrfs_btree_balance_dirty(root);
39279cc3 6495 return err;
b0d5d10f
CM		 6496
6497out_fail_inode:
6498 unlock_new_inode(inode);
6499 goto out_fail;
39279cc3
CM		 6500}
6501
e6c4efd8
QW		 6502/* Find next extent map of a given extent map, caller needs to ensure locks */
6503static struct extent_map *next_extent_map(struct extent_map *em)
6504{
6505 struct rb_node *next;
6506
6507 next = rb_next(&em->rb_node);
6508 if (!next)
6509 return NULL;
6510 return container_of(next, struct extent_map, rb_node);
6511}
6512
6513static struct extent_map *prev_extent_map(struct extent_map *em)
6514{
6515 struct rb_node *prev;
6516
6517 prev = rb_prev(&em->rb_node);
6518 if (!prev)
6519 return NULL;
6520 return container_of(prev, struct extent_map, rb_node);
6521}
6522
d352ac68 6523/* helper for btfs_get_extent. Given an existing extent in the tree,
e6c4efd8 6524 * the existing extent is the nearest extent to map_start,
d352ac68 6525 * and an extent that you want to insert, deal with overlap and insert
e6c4efd8 6526 * the best fitted new extent into the tree.
d352ac68 6527 */
3b951516
CM		 6528static int merge_extent_mapping(struct extent_map_tree *em_tree,
6529 struct extent_map *existing,
e6dcd2dc 6530 struct extent_map *em,
51f395ad 6531 u64 map_start)
3b951516 6532{
e6c4efd8
QW		 6533 struct extent_map *prev;
6534 struct extent_map *next;
6535 u64 start;
6536 u64 end;
3b951516 6537 u64 start_diff;
3b951516 6538
e6dcd2dc 6539 BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
e6c4efd8
QW		 6540
6541 if (existing->start > map_start) {
6542 next = existing;
6543 prev = prev_extent_map(next);
6544 } else {
6545 prev = existing;
6546 next = next_extent_map(prev);
6547 }
6548
6549 start = prev ? extent_map_end(prev) : em->start;
6550 start = max_t(u64, start, em->start);
6551 end = next ? next->start : extent_map_end(em);
6552 end = min_t(u64, end, extent_map_end(em));
6553 start_diff = start - em->start;
6554 em->start = start;
6555 em->len = end - start;
c8b97818
CM		 6556 if (em->block_start < EXTENT_MAP_LAST_BYTE &&
6557 !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
e6dcd2dc 6558 em->block_start += start_diff;
c8b97818
CM		 6559 em->block_len -= start_diff;
6560 }
09a2a8f9 6561 return add_extent_mapping(em_tree, em, 0);
3b951516
CM		 6562}
6563
c8b97818
CM		 6564static noinline int uncompress_inline(struct btrfs_path *path,
6565 struct inode *inode, struct page *page,
6566 size_t pg_offset, u64 extent_offset,
6567 struct btrfs_file_extent_item *item)
6568{
6569 int ret;
6570 struct extent_buffer *leaf = path->nodes[0];
6571 char *tmp;
6572 size_t max_size;
6573 unsigned long inline_size;
6574 unsigned long ptr;
261507a0 6575 int compress_type;
c8b97818
CM		 6576
6577 WARN_ON(pg_offset != 0);
261507a0 6578 compress_type = btrfs_file_extent_compression(leaf, item);
c8b97818
CM		 6579 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6580 inline_size = btrfs_file_extent_inline_item_len(leaf,
dd3cc16b 6581 btrfs_item_nr(path->slots[0]));
c8b97818 6582 tmp = kmalloc(inline_size, GFP_NOFS);
8d413713
TI		 6583 if (!tmp)
6584 return -ENOMEM;
c8b97818
CM		 6585 ptr = btrfs_file_extent_inline_start(item);
6586
6587 read_extent_buffer(leaf, tmp, ptr, inline_size);
6588
5b050f04 6589 max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size);
261507a0
LZ		 6590 ret = btrfs_decompress(compress_type, tmp, page,
6591 extent_offset, inline_size, max_size);
c8b97818 6592 kfree(tmp);
166ae5a4 6593 return ret;
c8b97818
CM		 6594}
6595
d352ac68
CM		 6596/*
6597 * a bit scary, this does extent mapping from logical file offset to the disk.
d397712b
CM		 6598 * the ugly parts come from merging extents from the disk with the in-ram
6599 * representation. This gets more complex because of the data=ordered code,
d352ac68
CM		 6600 * where the in-ram extents might be locked pending data=ordered completion.
6601 *
6602 * This also copies inline extents directly into the page.
6603 */
d397712b 6604
a52d9a80 6605struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
70dec807 6606 size_t pg_offset, u64 start, u64 len,
a52d9a80
CM		 6607 int create)
6608{
6609 int ret;
6610 int err = 0;
a52d9a80
CM		 6611 u64 extent_start = 0;
6612 u64 extent_end = 0;
33345d01 6613 u64 objectid = btrfs_ino(inode);
a52d9a80 6614 u32 found_type;
f421950f 6615 struct btrfs_path *path = NULL;
a52d9a80
CM		 6616 struct btrfs_root *root = BTRFS_I(inode)->root;
6617 struct btrfs_file_extent_item *item;
5f39d397
CM		 6618 struct extent_buffer *leaf;
6619 struct btrfs_key found_key;
a52d9a80
CM		 6620 struct extent_map *em = NULL;
6621 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
d1310b2e 6622 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
a52d9a80 6623 struct btrfs_trans_handle *trans = NULL;
7ffbb598 6624 const bool new_inline = !page || create;
a52d9a80 6625
a52d9a80 6626again:
890871be 6627 read_lock(&em_tree->lock);
d1310b2e 6628 em = lookup_extent_mapping(em_tree, start, len);
a061fc8d
CM		 6629 if (em)
6630 em->bdev = root->fs_info->fs_devices->latest_bdev;
890871be 6631 read_unlock(&em_tree->lock);
d1310b2e 6632
a52d9a80 6633 if (em) {
e1c4b745
CM		 6634 if (em->start > start || em->start + em->len <= start)
6635 free_extent_map(em);
6636 else if (em->block_start == EXTENT_MAP_INLINE && page)
70dec807
CM		 6637 free_extent_map(em);
6638 else
6639 goto out;
a52d9a80 6640 }
172ddd60 6641 em = alloc_extent_map();
a52d9a80 6642 if (!em) {
d1310b2e
CM		 6643 err = -ENOMEM;
6644 goto out;
a52d9a80 6645 }
e6dcd2dc 6646 em->bdev = root->fs_info->fs_devices->latest_bdev;
d1310b2e 6647 em->start = EXTENT_MAP_HOLE;
445a6944 6648 em->orig_start = EXTENT_MAP_HOLE;
d1310b2e 6649 em->len = (u64)-1;
c8b97818 6650 em->block_len = (u64)-1;
f421950f
CM		 6651
6652 if (!path) {
6653 path = btrfs_alloc_path();
026fd317
JB		 6654 if (!path) {
6655 err = -ENOMEM;
6656 goto out;
6657 }
6658 /*
6659 * Chances are we'll be called again, so go ahead and do
6660 * readahead
6661 */
6662 path->reada = 1;
f421950f
CM		 6663 }
6664
179e29e4
CM		 6665 ret = btrfs_lookup_file_extent(trans, root, path,
6666 objectid, start, trans != NULL);
a52d9a80
CM		 6667 if (ret < 0) {
6668 err = ret;
6669 goto out;
6670 }
6671
6672 if (ret != 0) {
6673 if (path->slots[0] == 0)
6674 goto not_found;
6675 path->slots[0]--;
6676 }
6677
5f39d397
CM		 6678 leaf = path->nodes[0];
6679 item = btrfs_item_ptr(leaf, path->slots[0],
a52d9a80 6680 struct btrfs_file_extent_item);
a52d9a80 6681 /* are we inside the extent that was found? */
5f39d397 6682 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
962a298f 6683 found_type = found_key.type;
5f39d397 6684 if (found_key.objectid != objectid ||
a52d9a80 6685 found_type != BTRFS_EXTENT_DATA_KEY) {
25a50341
JB		 6686 /*
6687 * If we backup past the first extent we want to move forward
6688 * and see if there is an extent in front of us, otherwise we'll
6689 * say there is a hole for our whole search range which can
6690 * cause problems.
6691 */
6692 extent_end = start;
6693 goto next;
a52d9a80
CM		 6694 }
6695
5f39d397
CM		 6696 found_type = btrfs_file_extent_type(leaf, item);
6697 extent_start = found_key.offset;
d899e052
YZ		 6698 if (found_type == BTRFS_FILE_EXTENT_REG ||
6699 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
a52d9a80 6700 extent_end = extent_start +
db94535d 6701 btrfs_file_extent_num_bytes(leaf, item);
9036c102
YZ		 6702 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
6703 size_t size;
514ac8ad 6704 size = btrfs_file_extent_inline_len(leaf, path->slots[0], item);
fda2832f 6705 extent_end = ALIGN(extent_start + size, root->sectorsize);
9036c102 6706 }
25a50341 6707next:
9036c102
YZ		 6708 if (start >= extent_end) {
6709 path->slots[0]++;
6710 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6711 ret = btrfs_next_leaf(root, path);
6712 if (ret < 0) {
6713 err = ret;
6714 goto out;
a52d9a80 6715 }
9036c102
YZ		 6716 if (ret > 0)
6717 goto not_found;
6718 leaf = path->nodes[0];
a52d9a80 6719 }
9036c102
YZ		 6720 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6721 if (found_key.objectid != objectid ||
6722 found_key.type != BTRFS_EXTENT_DATA_KEY)
6723 goto not_found;
6724 if (start + len <= found_key.offset)
6725 goto not_found;
e2eca69d
WS		 6726 if (start > found_key.offset)
6727 goto next;
9036c102 6728 em->start = start;
70c8a91c 6729 em->orig_start = start;
9036c102
YZ		 6730 em->len = found_key.offset - start;
6731 goto not_found_em;
6732 }
6733
7ffbb598
FM		 6734 btrfs_extent_item_to_extent_map(inode, path, item, new_inline, em);
6735
d899e052
YZ		 6736 if (found_type == BTRFS_FILE_EXTENT_REG ||
6737 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
a52d9a80
CM		 6738 goto insert;
6739 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5f39d397 6740 unsigned long ptr;
a52d9a80 6741 char *map;
3326d1b0
CM		 6742 size_t size;
6743 size_t extent_offset;
6744 size_t copy_size;
a52d9a80 6745
7ffbb598 6746 if (new_inline)
689f9346 6747 goto out;
5f39d397 6748
514ac8ad 6749 size = btrfs_file_extent_inline_len(leaf, path->slots[0], item);
9036c102 6750 extent_offset = page_offset(page) + pg_offset - extent_start;
70dec807 6751 copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
3326d1b0 6752 size - extent_offset);
3326d1b0 6753 em->start = extent_start + extent_offset;
fda2832f 6754 em->len = ALIGN(copy_size, root->sectorsize);
b4939680 6755 em->orig_block_len = em->len;
70c8a91c 6756 em->orig_start = em->start;
689f9346 6757 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
179e29e4 6758 if (create == 0 && !PageUptodate(page)) {
261507a0
LZ		 6759 if (btrfs_file_extent_compression(leaf, item) !=
6760 BTRFS_COMPRESS_NONE) {
c8b97818
CM		 6761 ret = uncompress_inline(path, inode, page,
6762 pg_offset,
6763 extent_offset, item);
166ae5a4
ZB		 6764 if (ret) {
6765 err = ret;
6766 goto out;
6767 }
c8b97818
CM		 6768 } else {
6769 map = kmap(page);
6770 read_extent_buffer(leaf, map + pg_offset, ptr,
6771 copy_size);
93c82d57
CM		 6772 if (pg_offset + copy_size < PAGE_CACHE_SIZE) {
6773 memset(map + pg_offset + copy_size, 0,
6774 PAGE_CACHE_SIZE - pg_offset -
6775 copy_size);
6776 }
c8b97818
CM		 6777 kunmap(page);
6778 }
179e29e4
CM		 6779 flush_dcache_page(page);
6780 } else if (create && PageUptodate(page)) {
6bf7e080 6781 BUG();
179e29e4
CM		 6782 if (!trans) {
6783 kunmap(page);
6784 free_extent_map(em);
6785 em = NULL;
ff5714cc 6786
b3b4aa74 6787 btrfs_release_path(path);
7a7eaa40 6788 trans = btrfs_join_transaction(root);
ff5714cc 6789
3612b495
TI		 6790 if (IS_ERR(trans))
6791 return ERR_CAST(trans);
179e29e4
CM		 6792 goto again;
6793 }
c8b97818 6794 map = kmap(page);
70dec807 6795 write_extent_buffer(leaf, map + pg_offset, ptr,
179e29e4 6796 copy_size);
c8b97818 6797 kunmap(page);
179e29e4 6798 btrfs_mark_buffer_dirty(leaf);
a52d9a80 6799 }
d1310b2e 6800 set_extent_uptodate(io_tree, em->start,
507903b8 6801 extent_map_end(em) - 1, NULL, GFP_NOFS);
a52d9a80 6802 goto insert;
a52d9a80
CM		 6803 }
6804not_found:
6805 em->start = start;
70c8a91c 6806 em->orig_start = start;
d1310b2e 6807 em->len = len;
a52d9a80 6808not_found_em:
5f39d397 6809 em->block_start = EXTENT_MAP_HOLE;
9036c102 6810 set_bit(EXTENT_FLAG_VACANCY, &em->flags);
a52d9a80 6811insert:
b3b4aa74 6812 btrfs_release_path(path);
d1310b2e 6813 if (em->start > start || extent_map_end(em) <= start) {
c2cf52eb 6814 btrfs_err(root->fs_info, "bad extent! em: [%llu %llu] passed [%llu %llu]",
c1c9ff7c 6815 em->start, em->len, start, len);
a52d9a80
CM		 6816 err = -EIO;
6817 goto out;
6818 }
d1310b2e
CM		 6819
6820 err = 0;
890871be 6821 write_lock(&em_tree->lock);
09a2a8f9 6822 ret = add_extent_mapping(em_tree, em, 0);
3b951516
CM		 6823 /* it is possible that someone inserted the extent into the tree
6824 * while we had the lock dropped. It is also possible that
6825 * an overlapping map exists in the tree
6826 */
a52d9a80 6827 if (ret == -EEXIST) {
3b951516 6828 struct extent_map *existing;
e6dcd2dc
CM		 6829
6830 ret = 0;
6831
e6c4efd8
QW		 6832 existing = search_extent_mapping(em_tree, start, len);
6833 /*
6834 * existing will always be non-NULL, since there must be
6835 * extent causing the -EEXIST.
6836 */
6837 if (start >= extent_map_end(existing) ||
32be3a1a 6838 start <= existing->start) {
e6c4efd8
QW		 6839 /*
6840 * The existing extent map is the one nearest to
6841 * the [start, start + len) range which overlaps
6842 */
6843 err = merge_extent_mapping(em_tree, existing,
6844 em, start);
e1c4b745 6845 free_extent_map(existing);
e6c4efd8 6846 if (err) {
3b951516
CM		 6847 free_extent_map(em);
6848 em = NULL;
6849 }
6850 } else {
6851 free_extent_map(em);
6852 em = existing;
e6dcd2dc 6853 err = 0;
a52d9a80 6854 }
a52d9a80 6855 }
890871be 6856 write_unlock(&em_tree->lock);
a52d9a80 6857out:
1abe9b8a 6858
4cd8587c 6859 trace_btrfs_get_extent(root, em);
1abe9b8a 6860
f421950f
CM		 6861 if (path)
6862 btrfs_free_path(path);
a52d9a80
CM		 6863 if (trans) {
6864 ret = btrfs_end_transaction(trans, root);
d397712b 6865 if (!err)
a52d9a80
CM		 6866 err = ret;
6867 }
a52d9a80
CM		 6868 if (err) {
6869 free_extent_map(em);
a52d9a80
CM		 6870 return ERR_PTR(err);
6871 }
79787eaa 6872 BUG_ON(!em); /* Error is always set */
a52d9a80
CM		 6873 return em;
6874}
6875
ec29ed5b
CM		 6876struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page,
6877 size_t pg_offset, u64 start, u64 len,
6878 int create)
6879{
6880 struct extent_map *em;
6881 struct extent_map *hole_em = NULL;
6882 u64 range_start = start;
6883 u64 end;
6884 u64 found;
6885 u64 found_end;
6886 int err = 0;
6887
6888 em = btrfs_get_extent(inode, page, pg_offset, start, len, create);
6889 if (IS_ERR(em))
6890 return em;
6891 if (em) {
6892 /*
f9e4fb53
LB		 6893 * if our em maps to
6894 * - a hole or
6895 * - a pre-alloc extent,
6896 * there might actually be delalloc bytes behind it.
ec29ed5b 6897 */
f9e4fb53
LB		 6898 if (em->block_start != EXTENT_MAP_HOLE &&
6899 !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
ec29ed5b
CM		 6900 return em;
6901 else
6902 hole_em = em;
6903 }
6904
6905 /* check to see if we've wrapped (len == -1 or similar) */
6906 end = start + len;
6907 if (end < start)
6908 end = (u64)-1;
6909 else
6910 end -= 1;
6911
6912 em = NULL;
6913
6914 /* ok, we didn't find anything, lets look for delalloc */
6915 found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start,
6916 end, len, EXTENT_DELALLOC, 1);
6917 found_end = range_start + found;
6918 if (found_end < range_start)
6919 found_end = (u64)-1;
6920
6921 /*
6922 * we didn't find anything useful, return
6923 * the original results from get_extent()
6924 */
6925 if (range_start > end || found_end <= start) {
6926 em = hole_em;
6927 hole_em = NULL;
6928 goto out;
6929 }
6930
6931 /* adjust the range_start to make sure it doesn't
6932 * go backwards from the start they passed in
6933 */
67871254 6934 range_start = max(start, range_start);
ec29ed5b
CM		 6935 found = found_end - range_start;
6936
6937 if (found > 0) {
6938 u64 hole_start = start;
6939 u64 hole_len = len;
6940
172ddd60 6941 em = alloc_extent_map();
ec29ed5b
CM		 6942 if (!em) {
6943 err = -ENOMEM;
6944 goto out;
6945 }
6946 /*
6947 * when btrfs_get_extent can't find anything it
6948 * returns one huge hole
6949 *
6950 * make sure what it found really fits our range, and
6951 * adjust to make sure it is based on the start from
6952 * the caller
6953 */
6954 if (hole_em) {
6955 u64 calc_end = extent_map_end(hole_em);
6956
6957 if (calc_end <= start || (hole_em->start > end)) {
6958 free_extent_map(hole_em);
6959 hole_em = NULL;
6960 } else {
6961 hole_start = max(hole_em->start, start);
6962 hole_len = calc_end - hole_start;
6963 }
6964 }
6965 em->bdev = NULL;
6966 if (hole_em && range_start > hole_start) {
6967 /* our hole starts before our delalloc, so we
6968 * have to return just the parts of the hole
6969 * that go until the delalloc starts
6970 */
6971 em->len = min(hole_len,
6972 range_start - hole_start);
6973 em->start = hole_start;
6974 em->orig_start = hole_start;
6975 /*
6976 * don't adjust block start at all,
6977 * it is fixed at EXTENT_MAP_HOLE
6978 */
6979 em->block_start = hole_em->block_start;
6980 em->block_len = hole_len;
f9e4fb53
LB		 6981 if (test_bit(EXTENT_FLAG_PREALLOC, &hole_em->flags))
6982 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
ec29ed5b
CM		 6983 } else {
6984 em->start = range_start;
6985 em->len = found;
6986 em->orig_start = range_start;
6987 em->block_start = EXTENT_MAP_DELALLOC;
6988 em->block_len = found;
6989 }
6990 } else if (hole_em) {
6991 return hole_em;
6992 }
6993out:
6994
6995 free_extent_map(hole_em);
6996 if (err) {
6997 free_extent_map(em);
6998 return ERR_PTR(err);
6999 }
7000 return em;
7001}
7002
4b46fce2
JB		 7003static struct extent_map *btrfs_new_extent_direct(struct inode *inode,
7004 u64 start, u64 len)
7005{
7006 struct btrfs_root *root = BTRFS_I(inode)->root;
70c8a91c 7007 struct extent_map *em;
4b46fce2
JB		 7008 struct btrfs_key ins;
7009 u64 alloc_hint;
7010 int ret;
4b46fce2 7011
4b46fce2 7012 alloc_hint = get_extent_allocation_hint(inode, start, len);
00361589 7013 ret = btrfs_reserve_extent(root, len, root->sectorsize, 0,
e570fd27 7014 alloc_hint, &ins, 1, 1);
00361589
JB		 7015 if (ret)
7016 return ERR_PTR(ret);
4b46fce2 7017
70c8a91c 7018 em = create_pinned_em(inode, start, ins.offset, start, ins.objectid,
cc95bef6 7019 ins.offset, ins.offset, ins.offset, 0);
00361589 7020 if (IS_ERR(em)) {
e570fd27 7021 btrfs_free_reserved_extent(root, ins.objectid, ins.offset, 1);
00361589
JB		 7022 return em;
7023 }
4b46fce2
JB		 7024
7025 ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid,
7026 ins.offset, ins.offset, 0);
7027 if (ret) {
e570fd27 7028 btrfs_free_reserved_extent(root, ins.objectid, ins.offset, 1);
00361589
JB		 7029 free_extent_map(em);
7030 return ERR_PTR(ret);
4b46fce2 7031 }
00361589 7032
4b46fce2
JB		 7033 return em;
7034}
7035
46bfbb5c
CM		 7036/*
7037 * returns 1 when the nocow is safe, < 1 on error, 0 if the
7038 * block must be cow'd
7039 */
00361589 7040noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7ee9e440
JB		 7041 u64 *orig_start, u64 *orig_block_len,
7042 u64 *ram_bytes)
46bfbb5c 7043{
00361589 7044 struct btrfs_trans_handle *trans;
46bfbb5c
CM		 7045 struct btrfs_path *path;
7046 int ret;
7047 struct extent_buffer *leaf;
7048 struct btrfs_root *root = BTRFS_I(inode)->root;
7b2b7085 7049 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
46bfbb5c
CM		 7050 struct btrfs_file_extent_item *fi;
7051 struct btrfs_key key;
7052 u64 disk_bytenr;
7053 u64 backref_offset;
7054 u64 extent_end;
7055 u64 num_bytes;
7056 int slot;
7057 int found_type;
7ee9e440 7058 bool nocow = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW);
e77751aa 7059
46bfbb5c
CM		 7060 path = btrfs_alloc_path();
7061 if (!path)
7062 return -ENOMEM;
7063
00361589 7064 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode),
46bfbb5c
CM		 7065 offset, 0);
7066 if (ret < 0)
7067 goto out;
7068
7069 slot = path->slots[0];
7070 if (ret == 1) {
7071 if (slot == 0) {
7072 /* can't find the item, must cow */
7073 ret = 0;
7074 goto out;
7075 }
7076 slot--;
7077 }
7078 ret = 0;
7079 leaf = path->nodes[0];
7080 btrfs_item_key_to_cpu(leaf, &key, slot);
33345d01 7081 if (key.objectid != btrfs_ino(inode) ||
46bfbb5c
CM		 7082 key.type != BTRFS_EXTENT_DATA_KEY) {
7083 /* not our file or wrong item type, must cow */
7084 goto out;
7085 }
7086
7087 if (key.offset > offset) {
7088 /* Wrong offset, must cow */
7089 goto out;
7090 }
7091
7092 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
7093 found_type = btrfs_file_extent_type(leaf, fi);
7094 if (found_type != BTRFS_FILE_EXTENT_REG &&
7095 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
7096 /* not a regular extent, must cow */
7097 goto out;
7098 }
7ee9e440
JB		 7099
7100 if (!nocow && found_type == BTRFS_FILE_EXTENT_REG)
7101 goto out;
7102
e77751aa
MX		 7103 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
7104 if (extent_end <= offset)
7105 goto out;
7106
46bfbb5c 7107 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
7ee9e440
JB		 7108 if (disk_bytenr == 0)
7109 goto out;
7110
7111 if (btrfs_file_extent_compression(leaf, fi) ||
7112 btrfs_file_extent_encryption(leaf, fi) ||
7113 btrfs_file_extent_other_encoding(leaf, fi))
7114 goto out;
7115
46bfbb5c
CM		 7116 backref_offset = btrfs_file_extent_offset(leaf, fi);
7117
7ee9e440
JB		 7118 if (orig_start) {
7119 *orig_start = key.offset - backref_offset;
7120 *orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
7121 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7122 }
eb384b55 7123
46bfbb5c
CM		 7124 if (btrfs_extent_readonly(root, disk_bytenr))
7125 goto out;
7b2b7085
MX		 7126
7127 num_bytes = min(offset + *len, extent_end) - offset;
7128 if (!nocow && found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7129 u64 range_end;
7130
7131 range_end = round_up(offset + num_bytes, root->sectorsize) - 1;
7132 ret = test_range_bit(io_tree, offset, range_end,
7133 EXTENT_DELALLOC, 0, NULL);
7134 if (ret) {
7135 ret = -EAGAIN;
7136 goto out;
7137 }
7138 }
7139
1bda19eb 7140 btrfs_release_path(path);
46bfbb5c
CM		 7141
7142 /*
7143 * look for other files referencing this extent, if we
7144 * find any we must cow
7145 */
00361589
JB		 7146 trans = btrfs_join_transaction(root);
7147 if (IS_ERR(trans)) {
7148 ret = 0;
46bfbb5c 7149 goto out;
00361589
JB		 7150 }
7151
7152 ret = btrfs_cross_ref_exist(trans, root, btrfs_ino(inode),
7153 key.offset - backref_offset, disk_bytenr);
7154 btrfs_end_transaction(trans, root);
7155 if (ret) {
7156 ret = 0;
7157 goto out;
7158 }
46bfbb5c
CM		 7159
7160 /*
7161 * adjust disk_bytenr and num_bytes to cover just the bytes
7162 * in this extent we are about to write. If there
7163 * are any csums in that range we have to cow in order
7164 * to keep the csums correct
7165 */
7166 disk_bytenr += backref_offset;
7167 disk_bytenr += offset - key.offset;
46bfbb5c
CM		 7168 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
7169 goto out;
7170 /*
7171 * all of the above have passed, it is safe to overwrite this extent
7172 * without cow
7173 */
eb384b55 7174 *len = num_bytes;
46bfbb5c
CM		 7175 ret = 1;
7176out:
7177 btrfs_free_path(path);
7178 return ret;
7179}
7180
fc4adbff
AG		 7181bool btrfs_page_exists_in_range(struct inode *inode, loff_t start, loff_t end)
7182{
7183 struct radix_tree_root *root = &inode->i_mapping->page_tree;
7184 int found = false;
7185 void **pagep = NULL;
7186 struct page *page = NULL;
7187 int start_idx;
7188 int end_idx;
7189
7190 start_idx = start >> PAGE_CACHE_SHIFT;
7191
7192 /*
7193 * end is the last byte in the last page. end == start is legal
7194 */
7195 end_idx = end >> PAGE_CACHE_SHIFT;
7196
7197 rcu_read_lock();
7198
7199 /* Most of the code in this while loop is lifted from
7200 * find_get_page. It's been modified to begin searching from a
7201 * page and return just the first page found in that range. If the
7202 * found idx is less than or equal to the end idx then we know that
7203 * a page exists. If no pages are found or if those pages are
7204 * outside of the range then we're fine (yay!) */
7205 while (page == NULL &&
7206 radix_tree_gang_lookup_slot(root, &pagep, NULL, start_idx, 1)) {
7207 page = radix_tree_deref_slot(pagep);
7208 if (unlikely(!page))
7209 break;
7210
7211 if (radix_tree_exception(page)) {
809f9016
FM		 7212 if (radix_tree_deref_retry(page)) {
7213 page = NULL;
fc4adbff 7214 continue;
809f9016 7215 }
fc4adbff
AG		 7216 /*
7217 * Otherwise, shmem/tmpfs must be storing a swap entry
7218 * here as an exceptional entry: so return it without
7219 * attempting to raise page count.
7220 */
6fdef6d4 7221 page = NULL;
fc4adbff
AG		 7222 break; /* TODO: Is this relevant for this use case? */
7223 }
7224
91405151
FM		 7225 if (!page_cache_get_speculative(page)) {
7226 page = NULL;
fc4adbff 7227 continue;
91405151 7228 }
fc4adbff
AG		 7229
7230 /*
7231 * Has the page moved?
7232 * This is part of the lockless pagecache protocol. See
7233 * include/linux/pagemap.h for details.
7234 */
7235 if (unlikely(page != *pagep)) {
7236 page_cache_release(page);
7237 page = NULL;
7238 }
7239 }
7240
7241 if (page) {
7242 if (page->index <= end_idx)
7243 found = true;
7244 page_cache_release(page);
7245 }
7246
7247 rcu_read_unlock();
7248 return found;
7249}
7250
eb838e73
JB		 7251static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7252 struct extent_state **cached_state, int writing)
7253{
7254 struct btrfs_ordered_extent *ordered;
7255 int ret = 0;
7256
7257 while (1) {
7258 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7259 0, cached_state);
7260 /*
7261 * We're concerned with the entire range that we're going to be
7262 * doing DIO to, so we need to make sure theres no ordered
7263 * extents in this range.
7264 */
7265 ordered = btrfs_lookup_ordered_range(inode, lockstart,
7266 lockend - lockstart + 1);
7267
7268 /*
7269 * We need to make sure there are no buffered pages in this
7270 * range either, we could have raced between the invalidate in
7271 * generic_file_direct_write and locking the extent. The
7272 * invalidate needs to happen so that reads after a write do not
7273 * get stale data.
7274 */
fc4adbff
AG		 7275 if (!ordered &&
7276 (!writing ||
7277 !btrfs_page_exists_in_range(inode, lockstart, lockend)))
eb838e73
JB		 7278 break;
7279
7280 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7281 cached_state, GFP_NOFS);
7282
7283 if (ordered) {
7284 btrfs_start_ordered_extent(inode, ordered, 1);
7285 btrfs_put_ordered_extent(ordered);
7286 } else {
7287 /* Screw you mmap */
728404da 7288 ret = btrfs_fdatawrite_range(inode, lockstart, lockend);
075bdbdb
FM		 7289 if (ret)
7290 break;
7291 ret = filemap_fdatawait_range(inode->i_mapping,
7292 lockstart,
7293 lockend);
eb838e73
JB		 7294 if (ret)
7295 break;
7296
7297 /*
7298 * If we found a page that couldn't be invalidated just
7299 * fall back to buffered.
7300 */
7301 ret = invalidate_inode_pages2_range(inode->i_mapping,
7302 lockstart >> PAGE_CACHE_SHIFT,
7303 lockend >> PAGE_CACHE_SHIFT);
7304 if (ret)
7305 break;
7306 }
7307
7308 cond_resched();
7309 }
7310
7311 return ret;
7312}
7313
69ffb543
JB		 7314static struct extent_map *create_pinned_em(struct inode *inode, u64 start,
7315 u64 len, u64 orig_start,
7316 u64 block_start, u64 block_len,
cc95bef6
JB		 7317 u64 orig_block_len, u64 ram_bytes,
7318 int type)
69ffb543
JB		 7319{
7320 struct extent_map_tree *em_tree;
7321 struct extent_map *em;
7322 struct btrfs_root *root = BTRFS_I(inode)->root;
7323 int ret;
7324
7325 em_tree = &BTRFS_I(inode)->extent_tree;
7326 em = alloc_extent_map();
7327 if (!em)
7328 return ERR_PTR(-ENOMEM);
7329
7330 em->start = start;
7331 em->orig_start = orig_start;
2ab28f32
JB		 7332 em->mod_start = start;
7333 em->mod_len = len;
69ffb543
JB		 7334 em->len = len;
7335 em->block_len = block_len;
7336 em->block_start = block_start;
7337 em->bdev = root->fs_info->fs_devices->latest_bdev;
b4939680 7338 em->orig_block_len = orig_block_len;
cc95bef6 7339 em->ram_bytes = ram_bytes;
70c8a91c 7340 em->generation = -1;
69ffb543
JB		 7341 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7342 if (type == BTRFS_ORDERED_PREALLOC)
b11e234d 7343 set_bit(EXTENT_FLAG_FILLING, &em->flags);
69ffb543
JB		 7344
7345 do {
7346 btrfs_drop_extent_cache(inode, em->start,
7347 em->start + em->len - 1, 0);
7348 write_lock(&em_tree->lock);
09a2a8f9 7349 ret = add_extent_mapping(em_tree, em, 1);
69ffb543
JB		 7350 write_unlock(&em_tree->lock);
7351 } while (ret == -EEXIST);
7352
7353 if (ret) {
7354 free_extent_map(em);
7355 return ERR_PTR(ret);
7356 }
7357
7358 return em;
7359}
7360
7361
4b46fce2
JB		 7362static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock,
7363 struct buffer_head *bh_result, int create)
7364{
7365 struct extent_map *em;
7366 struct btrfs_root *root = BTRFS_I(inode)->root;
eb838e73 7367 struct extent_state *cached_state = NULL;
4b46fce2 7368 u64 start = iblock << inode->i_blkbits;
eb838e73 7369 u64 lockstart, lockend;
4b46fce2 7370 u64 len = bh_result->b_size;
e1cbbfa5 7371 u64 *outstanding_extents = NULL;
eb838e73 7372 int unlock_bits = EXTENT_LOCKED;
0934856d 7373 int ret = 0;
eb838e73 7374
172a5049 7375 if (create)
3266789f 7376 unlock_bits |= EXTENT_DIRTY;
172a5049 7377 else
c329861d 7378 len = min_t(u64, len, root->sectorsize);
eb838e73 7379
c329861d
JB		 7380 lockstart = start;
7381 lockend = start + len - 1;
7382
e1cbbfa5
JB		 7383 if (current->journal_info) {
7384 /*
7385 * Need to pull our outstanding extents and set journal_info to NULL so
7386 * that anything that needs to check if there's a transction doesn't get
7387 * confused.
7388 */
7389 outstanding_extents = current->journal_info;
7390 current->journal_info = NULL;
7391 }
7392
eb838e73
JB		 7393 /*
7394 * If this errors out it's because we couldn't invalidate pagecache for
7395 * this range and we need to fallback to buffered.
7396 */
7397 if (lock_extent_direct(inode, lockstart, lockend, &cached_state, create))
7398 return -ENOTBLK;
7399
4b46fce2 7400 em = btrfs_get_extent(inode, NULL, 0, start, len, 0);
eb838e73
JB		 7401 if (IS_ERR(em)) {
7402 ret = PTR_ERR(em);
7403 goto unlock_err;
7404 }
4b46fce2
JB		 7405
7406 /*
7407 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7408 * io. INLINE is special, and we could probably kludge it in here, but
7409 * it's still buffered so for safety lets just fall back to the generic
7410 * buffered path.
7411 *
7412 * For COMPRESSED we _have_ to read the entire extent in so we can
7413 * decompress it, so there will be buffering required no matter what we
7414 * do, so go ahead and fallback to buffered.
7415 *
7416 * We return -ENOTBLK because thats what makes DIO go ahead and go back
7417 * to buffered IO. Don't blame me, this is the price we pay for using
7418 * the generic code.
7419 */
7420 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7421 em->block_start == EXTENT_MAP_INLINE) {
7422 free_extent_map(em);
eb838e73
JB		 7423 ret = -ENOTBLK;
7424 goto unlock_err;
4b46fce2
JB		 7425 }
7426
7427 /* Just a good old fashioned hole, return */
7428 if (!create && (em->block_start == EXTENT_MAP_HOLE ||
7429 test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
7430 free_extent_map(em);
eb838e73 7431 goto unlock_err;
4b46fce2
JB		 7432 }
7433
7434 /*
7435 * We don't allocate a new extent in the following cases
7436 *
7437 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7438 * existing extent.
7439 * 2) The extent is marked as PREALLOC. We're good to go here and can
7440 * just use the extent.
7441 *
7442 */
46bfbb5c 7443 if (!create) {
eb838e73
JB		 7444 len = min(len, em->len - (start - em->start));
7445 lockstart = start + len;
7446 goto unlock;
46bfbb5c 7447 }
4b46fce2
JB		 7448
7449 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7450 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7451 em->block_start != EXTENT_MAP_HOLE)) {
4b46fce2 7452 int type;
eb384b55 7453 u64 block_start, orig_start, orig_block_len, ram_bytes;
4b46fce2
JB		 7454
7455 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7456 type = BTRFS_ORDERED_PREALLOC;
7457 else
7458 type = BTRFS_ORDERED_NOCOW;
46bfbb5c 7459 len = min(len, em->len - (start - em->start));
4b46fce2 7460 block_start = em->block_start + (start - em->start);
46bfbb5c 7461
00361589 7462 if (can_nocow_extent(inode, start, &len, &orig_start,
7ee9e440 7463 &orig_block_len, &ram_bytes) == 1) {
69ffb543
JB		 7464 if (type == BTRFS_ORDERED_PREALLOC) {
7465 free_extent_map(em);
7466 em = create_pinned_em(inode, start, len,
7467 orig_start,
b4939680 7468 block_start, len,
cc95bef6
JB		 7469 orig_block_len,
7470 ram_bytes, type);
555e1286
FM		 7471 if (IS_ERR(em)) {
7472 ret = PTR_ERR(em);
69ffb543 7473 goto unlock_err;
555e1286 7474 }
69ffb543
JB		 7475 }
7476
46bfbb5c
CM		 7477 ret = btrfs_add_ordered_extent_dio(inode, start,
7478 block_start, len, len, type);
46bfbb5c
CM		 7479 if (ret) {
7480 free_extent_map(em);
eb838e73 7481 goto unlock_err;
46bfbb5c
CM		 7482 }
7483 goto unlock;
4b46fce2 7484 }
4b46fce2 7485 }
00361589 7486
46bfbb5c
CM		 7487 /*
7488 * this will cow the extent, reset the len in case we changed
7489 * it above
7490 */
7491 len = bh_result->b_size;
70c8a91c
JB		 7492 free_extent_map(em);
7493 em = btrfs_new_extent_direct(inode, start, len);
eb838e73
JB		 7494 if (IS_ERR(em)) {
7495 ret = PTR_ERR(em);
7496 goto unlock_err;
7497 }
46bfbb5c
CM		 7498 len = min(len, em->len - (start - em->start));
7499unlock:
4b46fce2
JB		 7500 bh_result->b_blocknr = (em->block_start + (start - em->start)) >>
7501 inode->i_blkbits;
46bfbb5c 7502 bh_result->b_size = len;
4b46fce2
JB		 7503 bh_result->b_bdev = em->bdev;
7504 set_buffer_mapped(bh_result);
c3473e83
JB		 7505 if (create) {
7506 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7507 set_buffer_new(bh_result);
7508
7509 /*
7510 * Need to update the i_size under the extent lock so buffered
7511 * readers will get the updated i_size when we unlock.
7512 */
7513 if (start + len > i_size_read(inode))
7514 i_size_write(inode, start + len);
0934856d 7515
e1cbbfa5
JB		 7516 /*
7517 * If we have an outstanding_extents count still set then we're
7518 * within our reservation, otherwise we need to adjust our inode
7519 * counter appropriately.
7520 */
7521 if (*outstanding_extents) {
7522 (*outstanding_extents)--;
7523 } else {
3e05bde8
JB		 7524 spin_lock(&BTRFS_I(inode)->lock);
7525 BTRFS_I(inode)->outstanding_extents++;
7526 spin_unlock(&BTRFS_I(inode)->lock);
7527 }
e1cbbfa5
JB		 7528
7529 current->journal_info = outstanding_extents;
3266789f 7530 btrfs_free_reserved_data_space(inode, len);
c3473e83 7531 }
4b46fce2 7532
eb838e73
JB		 7533 /*
7534 * In the case of write we need to clear and unlock the entire range,
7535 * in the case of read we need to unlock only the end area that we
7536 * aren't using if there is any left over space.
7537 */
24c03fa5 7538 if (lockstart < lockend) {
0934856d
MX		 7539 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
7540 lockend, unlock_bits, 1, 0,
7541 &cached_state, GFP_NOFS);
24c03fa5 7542 } else {
eb838e73 7543 free_extent_state(cached_state);
24c03fa5 7544 }
eb838e73 7545
4b46fce2
JB		 7546 free_extent_map(em);
7547
7548 return 0;
eb838e73
JB		 7549
7550unlock_err:
eb838e73
JB		 7551 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7552 unlock_bits, 1, 0, &cached_state, GFP_NOFS);
e1cbbfa5
JB		 7553 if (outstanding_extents)
7554 current->journal_info = outstanding_extents;
eb838e73 7555 return ret;
4b46fce2
JB		 7556}
7557
8b110e39
MX		 7558static inline int submit_dio_repair_bio(struct inode *inode, struct bio *bio,
7559 int rw, int mirror_num)
7560{
7561 struct btrfs_root *root = BTRFS_I(inode)->root;
7562 int ret;
7563
7564 BUG_ON(rw & REQ_WRITE);
7565
7566 bio_get(bio);
7567
7568 ret = btrfs_bio_wq_end_io(root->fs_info, bio,
7569 BTRFS_WQ_ENDIO_DIO_REPAIR);
7570 if (ret)
7571 goto err;
7572
7573 ret = btrfs_map_bio(root, rw, bio, mirror_num, 0);
7574err:
7575 bio_put(bio);
7576 return ret;
7577}
7578
7579static int btrfs_check_dio_repairable(struct inode *inode,
7580 struct bio *failed_bio,
7581 struct io_failure_record *failrec,
7582 int failed_mirror)
7583{
7584 int num_copies;
7585
7586 num_copies = btrfs_num_copies(BTRFS_I(inode)->root->fs_info,
7587 failrec->logical, failrec->len);
7588 if (num_copies == 1) {
7589 /*
7590 * we only have a single copy of the data, so don't bother with
7591 * all the retry and error correction code that follows. no
7592 * matter what the error is, it is very likely to persist.
7593 */
7594 pr_debug("Check DIO Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d\n",
7595 num_copies, failrec->this_mirror, failed_mirror);
7596 return 0;
7597 }
7598
7599 failrec->failed_mirror = failed_mirror;
7600 failrec->this_mirror++;
7601 if (failrec->this_mirror == failed_mirror)
7602 failrec->this_mirror++;
7603
7604 if (failrec->this_mirror > num_copies) {
7605 pr_debug("Check DIO Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d\n",
7606 num_copies, failrec->this_mirror, failed_mirror);
7607 return 0;
7608 }
7609
7610 return 1;
7611}
7612
7613static int dio_read_error(struct inode *inode, struct bio *failed_bio,
7614 struct page *page, u64 start, u64 end,
7615 int failed_mirror, bio_end_io_t *repair_endio,
7616 void *repair_arg)
7617{
7618 struct io_failure_record *failrec;
7619 struct bio *bio;
7620 int isector;
7621 int read_mode;
7622 int ret;
7623
7624 BUG_ON(failed_bio->bi_rw & REQ_WRITE);
7625
7626 ret = btrfs_get_io_failure_record(inode, start, end, &failrec);
7627 if (ret)
7628 return ret;
7629
7630 ret = btrfs_check_dio_repairable(inode, failed_bio, failrec,
7631 failed_mirror);
7632 if (!ret) {
7633 free_io_failure(inode, failrec);
7634 return -EIO;
7635 }
7636
7637 if (failed_bio->bi_vcnt > 1)
7638 read_mode = READ_SYNC | REQ_FAILFAST_DEV;
7639 else
7640 read_mode = READ_SYNC;
7641
7642 isector = start - btrfs_io_bio(failed_bio)->logical;
7643 isector >>= inode->i_sb->s_blocksize_bits;
7644 bio = btrfs_create_repair_bio(inode, failed_bio, failrec, page,
7645 0, isector, repair_endio, repair_arg);
7646 if (!bio) {
7647 free_io_failure(inode, failrec);
7648 return -EIO;
7649 }
7650
7651 btrfs_debug(BTRFS_I(inode)->root->fs_info,
7652 "Repair DIO Read Error: submitting new dio read[%#x] to this_mirror=%d, in_validation=%d\n",
7653 read_mode, failrec->this_mirror, failrec->in_validation);
7654
7655 ret = submit_dio_repair_bio(inode, bio, read_mode,
7656 failrec->this_mirror);
7657 if (ret) {
7658 free_io_failure(inode, failrec);
7659 bio_put(bio);
7660 }
7661
7662 return ret;
7663}
7664
7665struct btrfs_retry_complete {
7666 struct completion done;
7667 struct inode *inode;
7668 u64 start;
7669 int uptodate;
7670};
7671
7672static void btrfs_retry_endio_nocsum(struct bio *bio, int err)
7673{
7674 struct btrfs_retry_complete *done = bio->bi_private;
7675 struct bio_vec *bvec;
7676 int i;
7677
7678 if (err)
7679 goto end;
7680
7681 done->uptodate = 1;
7682 bio_for_each_segment_all(bvec, bio, i)
7683 clean_io_failure(done->inode, done->start, bvec->bv_page, 0);
7684end:
7685 complete(&done->done);
7686 bio_put(bio);
7687}
7688
7689static int __btrfs_correct_data_nocsum(struct inode *inode,
7690 struct btrfs_io_bio *io_bio)
4b46fce2 7691{
2c30c71b 7692 struct bio_vec *bvec;
8b110e39 7693 struct btrfs_retry_complete done;
4b46fce2 7694 u64 start;
2c30c71b 7695 int i;
c1dc0896 7696 int ret;
4b46fce2 7697
8b110e39
MX		 7698 start = io_bio->logical;
7699 done.inode = inode;
7700
7701 bio_for_each_segment_all(bvec, &io_bio->bio, i) {
7702try_again:
7703 done.uptodate = 0;
7704 done.start = start;
7705 init_completion(&done.done);
7706
7707 ret = dio_read_error(inode, &io_bio->bio, bvec->bv_page, start,
7708 start + bvec->bv_len - 1,
7709 io_bio->mirror_num,
7710 btrfs_retry_endio_nocsum, &done);
7711 if (ret)
7712 return ret;
7713
7714 wait_for_completion(&done.done);
7715
7716 if (!done.uptodate) {
7717 /* We might have another mirror, so try again */
7718 goto try_again;
7719 }
7720
7721 start += bvec->bv_len;
7722 }
7723
7724 return 0;
7725}
7726
7727static void btrfs_retry_endio(struct bio *bio, int err)
7728{
7729 struct btrfs_retry_complete *done = bio->bi_private;
7730 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
7731 struct bio_vec *bvec;
7732 int uptodate;
7733 int ret;
7734 int i;
7735
7736 if (err)
7737 goto end;
7738
7739 uptodate = 1;
7740 bio_for_each_segment_all(bvec, bio, i) {
7741 ret = __readpage_endio_check(done->inode, io_bio, i,
7742 bvec->bv_page, 0,
7743 done->start, bvec->bv_len);
7744 if (!ret)
7745 clean_io_failure(done->inode, done->start,
7746 bvec->bv_page, 0);
7747 else
7748 uptodate = 0;
7749 }
7750
7751 done->uptodate = uptodate;
7752end:
7753 complete(&done->done);
7754 bio_put(bio);
7755}
7756
7757static int __btrfs_subio_endio_read(struct inode *inode,
7758 struct btrfs_io_bio *io_bio, int err)
7759{
7760 struct bio_vec *bvec;
7761 struct btrfs_retry_complete done;
7762 u64 start;
7763 u64 offset = 0;
7764 int i;
7765 int ret;
dc380aea 7766
8b110e39 7767 err = 0;
c1dc0896 7768 start = io_bio->logical;
8b110e39
MX		 7769 done.inode = inode;
7770
c1dc0896 7771 bio_for_each_segment_all(bvec, &io_bio->bio, i) {
dc380aea
MX		 7772 ret = __readpage_endio_check(inode, io_bio, i, bvec->bv_page,
7773 0, start, bvec->bv_len);
8b110e39
MX		 7774 if (likely(!ret))
7775 goto next;
7776try_again:
7777 done.uptodate = 0;
7778 done.start = start;
7779 init_completion(&done.done);
7780
7781 ret = dio_read_error(inode, &io_bio->bio, bvec->bv_page, start,
7782 start + bvec->bv_len - 1,
7783 io_bio->mirror_num,
7784 btrfs_retry_endio, &done);
7785 if (ret) {
7786 err = ret;
7787 goto next;
7788 }
7789
7790 wait_for_completion(&done.done);
7791
7792 if (!done.uptodate) {
7793 /* We might have another mirror, so try again */
7794 goto try_again;
7795 }
7796next:
7797 offset += bvec->bv_len;
4b46fce2 7798 start += bvec->bv_len;
2c30c71b 7799 }
c1dc0896
MX		 7800
7801 return err;
7802}
7803
8b110e39
MX		 7804static int btrfs_subio_endio_read(struct inode *inode,
7805 struct btrfs_io_bio *io_bio, int err)
7806{
7807 bool skip_csum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
7808
7809 if (skip_csum) {
7810 if (unlikely(err))
7811 return __btrfs_correct_data_nocsum(inode, io_bio);
7812 else
7813 return 0;
7814 } else {
7815 return __btrfs_subio_endio_read(inode, io_bio, err);
7816 }
7817}
7818
c1dc0896
MX		 7819static void btrfs_endio_direct_read(struct bio *bio, int err)
7820{
7821 struct btrfs_dio_private *dip = bio->bi_private;
7822 struct inode *inode = dip->inode;
7823 struct bio *dio_bio;
7824 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
7825
8b110e39
MX		 7826 if (dip->flags & BTRFS_DIO_ORIG_BIO_SUBMITTED)
7827 err = btrfs_subio_endio_read(inode, io_bio, err);
c1dc0896 7828
4b46fce2 7829 unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset,
d0082371 7830 dip->logical_offset + dip->bytes - 1);
9be3395b 7831 dio_bio = dip->dio_bio;
4b46fce2 7832
4b46fce2 7833 kfree(dip);
c0da7aa1
JB		 7834
7835 /* If we had a csum failure make sure to clear the uptodate flag */
7836 if (err)
9be3395b
CM		 7837 clear_bit(BIO_UPTODATE, &dio_bio->bi_flags);
7838 dio_end_io(dio_bio, err);
23ea8e5a
MX		 7839
7840 if (io_bio->end_io)
7841 io_bio->end_io(io_bio, err);
9be3395b 7842 bio_put(bio);
4b46fce2
JB		 7843}
7844
7845static void btrfs_endio_direct_write(struct bio *bio, int err)
7846{
7847 struct btrfs_dio_private *dip = bio->bi_private;
7848 struct inode *inode = dip->inode;
7849 struct btrfs_root *root = BTRFS_I(inode)->root;
4b46fce2 7850 struct btrfs_ordered_extent *ordered = NULL;
163cf09c
CM		 7851 u64 ordered_offset = dip->logical_offset;
7852 u64 ordered_bytes = dip->bytes;
9be3395b 7853 struct bio *dio_bio;
4b46fce2
JB		 7854 int ret;
7855
7856 if (err)
7857 goto out_done;
163cf09c
CM		 7858again:
7859 ret = btrfs_dec_test_first_ordered_pending(inode, &ordered,
7860 &ordered_offset,
5fd02043 7861 ordered_bytes, !err);
4b46fce2 7862 if (!ret)
163cf09c 7863 goto out_test;
4b46fce2 7864
9e0af237
LB		 7865 btrfs_init_work(&ordered->work, btrfs_endio_write_helper,
7866 finish_ordered_fn, NULL, NULL);
fccb5d86
QW		 7867 btrfs_queue_work(root->fs_info->endio_write_workers,
7868 &ordered->work);
163cf09c
CM		 7869out_test:
7870 /*
7871 * our bio might span multiple ordered extents. If we haven't
7872 * completed the accounting for the whole dio, go back and try again
7873 */
7874 if (ordered_offset < dip->logical_offset + dip->bytes) {
7875 ordered_bytes = dip->logical_offset + dip->bytes -
7876 ordered_offset;
5fd02043 7877 ordered = NULL;
163cf09c
CM		 7878 goto again;
7879 }
4b46fce2 7880out_done:
9be3395b 7881 dio_bio = dip->dio_bio;
4b46fce2 7882
4b46fce2 7883 kfree(dip);
c0da7aa1
JB		 7884
7885 /* If we had an error make sure to clear the uptodate flag */
7886 if (err)
9be3395b
CM		 7887 clear_bit(BIO_UPTODATE, &dio_bio->bi_flags);
7888 dio_end_io(dio_bio, err);
7889 bio_put(bio);
4b46fce2
JB		 7890}
7891
eaf25d93
CM		 7892static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw,
7893 struct bio *bio, int mirror_num,
7894 unsigned long bio_flags, u64 offset)
7895{
7896 int ret;
7897 struct btrfs_root *root = BTRFS_I(inode)->root;
7898 ret = btrfs_csum_one_bio(root, inode, bio, offset, 1);
79787eaa 7899 BUG_ON(ret); /* -ENOMEM */
eaf25d93
CM		 7900 return 0;
7901}
7902
e65e1535
MX		 7903static void btrfs_end_dio_bio(struct bio *bio, int err)
7904{
7905 struct btrfs_dio_private *dip = bio->bi_private;
7906
8b110e39
MX		 7907 if (err)
7908 btrfs_warn(BTRFS_I(dip->inode)->root->fs_info,
7909 "direct IO failed ino %llu rw %lu sector %#Lx len %u err no %d",
7910 btrfs_ino(dip->inode), bio->bi_rw,
7911 (unsigned long long)bio->bi_iter.bi_sector,
7912 bio->bi_iter.bi_size, err);
7913
7914 if (dip->subio_endio)
7915 err = dip->subio_endio(dip->inode, btrfs_io_bio(bio), err);
c1dc0896
MX		 7916
7917 if (err) {
e65e1535
MX		 7918 dip->errors = 1;
7919
7920 /*
7921 * before atomic variable goto zero, we must make sure
7922 * dip->errors is perceived to be set.
7923 */
4e857c58 7924 smp_mb__before_atomic();
e65e1535
MX		 7925 }
7926
7927 /* if there are more bios still pending for this dio, just exit */
7928 if (!atomic_dec_and_test(&dip->pending_bios))
7929 goto out;
7930
9be3395b 7931 if (dip->errors) {
e65e1535 7932 bio_io_error(dip->orig_bio);
9be3395b
CM		 7933 } else {
7934 set_bit(BIO_UPTODATE, &dip->dio_bio->bi_flags);
e65e1535
MX		 7935 bio_endio(dip->orig_bio, 0);
7936 }
7937out:
7938 bio_put(bio);
7939}
7940
7941static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev,
7942 u64 first_sector, gfp_t gfp_flags)
7943{
7944 int nr_vecs = bio_get_nr_vecs(bdev);
7945 return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags);
7946}
7947
c1dc0896
MX		 7948static inline int btrfs_lookup_and_bind_dio_csum(struct btrfs_root *root,
7949 struct inode *inode,
7950 struct btrfs_dio_private *dip,
7951 struct bio *bio,
7952 u64 file_offset)
7953{
7954 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
7955 struct btrfs_io_bio *orig_io_bio = btrfs_io_bio(dip->orig_bio);
7956 int ret;
7957
7958 /*
7959 * We load all the csum data we need when we submit
7960 * the first bio to reduce the csum tree search and
7961 * contention.
7962 */
7963 if (dip->logical_offset == file_offset) {
7964 ret = btrfs_lookup_bio_sums_dio(root, inode, dip->orig_bio,
7965 file_offset);
7966 if (ret)
7967 return ret;
7968 }
7969
7970 if (bio == dip->orig_bio)
7971 return 0;
7972
7973 file_offset -= dip->logical_offset;
7974 file_offset >>= inode->i_sb->s_blocksize_bits;
7975 io_bio->csum = (u8 *)(((u32 *)orig_io_bio->csum) + file_offset);
7976
7977 return 0;
7978}
7979
e65e1535
MX		 7980static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
7981 int rw, u64 file_offset, int skip_sum,
c329861d 7982 int async_submit)
e65e1535 7983{
facc8a22 7984 struct btrfs_dio_private *dip = bio->bi_private;
e65e1535
MX		 7985 int write = rw & REQ_WRITE;
7986 struct btrfs_root *root = BTRFS_I(inode)->root;
7987 int ret;
7988
b812ce28
JB		 7989 if (async_submit)
7990 async_submit = !atomic_read(&BTRFS_I(inode)->sync_writers);
7991
e65e1535 7992 bio_get(bio);
5fd02043
JB		 7993
7994 if (!write) {
bfebd8b5
DS		 7995 ret = btrfs_bio_wq_end_io(root->fs_info, bio,
7996 BTRFS_WQ_ENDIO_DATA);
5fd02043
JB		 7997 if (ret)
7998 goto err;
7999 }
e65e1535 8000
1ae39938
JB		 8001 if (skip_sum)
8002 goto map;
8003
8004 if (write && async_submit) {
e65e1535
MX		 8005 ret = btrfs_wq_submit_bio(root->fs_info,
8006 inode, rw, bio, 0, 0,
8007 file_offset,
8008 __btrfs_submit_bio_start_direct_io,
8009 __btrfs_submit_bio_done);
8010 goto err;
1ae39938
JB		 8011 } else if (write) {
8012 /*
8013 * If we aren't doing async submit, calculate the csum of the
8014 * bio now.
8015 */
8016 ret = btrfs_csum_one_bio(root, inode, bio, file_offset, 1);
8017 if (ret)
8018 goto err;
23ea8e5a 8019 } else {
c1dc0896
MX		 8020 ret = btrfs_lookup_and_bind_dio_csum(root, inode, dip, bio,
8021 file_offset);
c2db1073
TI		 8022 if (ret)
8023 goto err;
8024 }
1ae39938
JB		 8025map:
8026 ret = btrfs_map_bio(root, rw, bio, 0, async_submit);
e65e1535
MX		 8027err:
8028 bio_put(bio);
8029 return ret;
8030}
8031
8032static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip,
8033 int skip_sum)
8034{
8035 struct inode *inode = dip->inode;
8036 struct btrfs_root *root = BTRFS_I(inode)->root;
e65e1535
MX		 8037 struct bio *bio;
8038 struct bio *orig_bio = dip->orig_bio;
8039 struct bio_vec *bvec = orig_bio->bi_io_vec;
4f024f37 8040 u64 start_sector = orig_bio->bi_iter.bi_sector;
e65e1535
MX		 8041 u64 file_offset = dip->logical_offset;
8042 u64 submit_len = 0;
8043 u64 map_length;
8044 int nr_pages = 0;
23ea8e5a 8045 int ret;
1ae39938 8046 int async_submit = 0;
e65e1535 8047
4f024f37 8048 map_length = orig_bio->bi_iter.bi_size;
53b381b3 8049 ret = btrfs_map_block(root->fs_info, rw, start_sector << 9,
e65e1535 8050 &map_length, NULL, 0);
7a5c3c9b 8051 if (ret)
e65e1535 8052 return -EIO;
facc8a22 8053
4f024f37 8054 if (map_length >= orig_bio->bi_iter.bi_size) {
02f57c7a 8055 bio = orig_bio;
c1dc0896 8056 dip->flags |= BTRFS_DIO_ORIG_BIO_SUBMITTED;
02f57c7a
JB		 8057 goto submit;
8058 }
8059
53b381b3 8060 /* async crcs make it difficult to collect full stripe writes. */
ffe2d203 8061 if (btrfs_get_alloc_profile(root, 1) & BTRFS_BLOCK_GROUP_RAID56_MASK)
53b381b3
DW		 8062 async_submit = 0;
8063 else
8064 async_submit = 1;
8065
02f57c7a
JB		 8066 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS);
8067 if (!bio)
8068 return -ENOMEM;
7a5c3c9b 8069
02f57c7a
JB		 8070 bio->bi_private = dip;
8071 bio->bi_end_io = btrfs_end_dio_bio;
c1dc0896 8072 btrfs_io_bio(bio)->logical = file_offset;
02f57c7a
JB		 8073 atomic_inc(&dip->pending_bios);
8074
e65e1535 8075 while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) {
ee39b432 8076 if (map_length < submit_len + bvec->bv_len ||
e65e1535 8077 bio_add_page(bio, bvec->bv_page, bvec->bv_len,
ee39b432 8078 bvec->bv_offset) < bvec->bv_len) {
e65e1535
MX		 8079 /*
8080 * inc the count before we submit the bio so
8081 * we know the end IO handler won't happen before
8082 * we inc the count. Otherwise, the dip might get freed
8083 * before we're done setting it up
8084 */
8085 atomic_inc(&dip->pending_bios);
8086 ret = __btrfs_submit_dio_bio(bio, inode, rw,
8087 file_offset, skip_sum,
c329861d 8088 async_submit);
e65e1535
MX		 8089 if (ret) {
8090 bio_put(bio);
8091 atomic_dec(&dip->pending_bios);
8092 goto out_err;
8093 }
8094
e65e1535
MX		 8095 start_sector += submit_len >> 9;
8096 file_offset += submit_len;
8097
8098 submit_len = 0;
8099 nr_pages = 0;
8100
8101 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev,
8102 start_sector, GFP_NOFS);
8103 if (!bio)
8104 goto out_err;
8105 bio->bi_private = dip;
8106 bio->bi_end_io = btrfs_end_dio_bio;
c1dc0896 8107 btrfs_io_bio(bio)->logical = file_offset;
e65e1535 8108
4f024f37 8109 map_length = orig_bio->bi_iter.bi_size;
53b381b3 8110 ret = btrfs_map_block(root->fs_info, rw,
3ec706c8 8111 start_sector << 9,
e65e1535
MX		 8112 &map_length, NULL, 0);
8113 if (ret) {
8114 bio_put(bio);
8115 goto out_err;
8116 }
8117 } else {
8118 submit_len += bvec->bv_len;
67871254 8119 nr_pages++;
e65e1535
MX		 8120 bvec++;
8121 }
8122 }
8123
02f57c7a 8124submit:
e65e1535 8125 ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum,
c329861d 8126 async_submit);
e65e1535
MX		 8127 if (!ret)
8128 return 0;
8129
8130 bio_put(bio);
8131out_err:
8132 dip->errors = 1;
8133 /*
8134 * before atomic variable goto zero, we must
8135 * make sure dip->errors is perceived to be set.
8136 */
4e857c58 8137 smp_mb__before_atomic();
e65e1535
MX		 8138 if (atomic_dec_and_test(&dip->pending_bios))
8139 bio_io_error(dip->orig_bio);
8140
8141 /* bio_end_io() will handle error, so we needn't return it */
8142 return 0;
8143}
8144
9be3395b
CM		 8145static void btrfs_submit_direct(int rw, struct bio *dio_bio,
8146 struct inode *inode, loff_t file_offset)
4b46fce2
JB		 8147{
8148 struct btrfs_root *root = BTRFS_I(inode)->root;
8149 struct btrfs_dio_private *dip;
9be3395b 8150 struct bio *io_bio;
23ea8e5a 8151 struct btrfs_io_bio *btrfs_bio;
4b46fce2 8152 int skip_sum;
7b6d91da 8153 int write = rw & REQ_WRITE;
4b46fce2
JB		 8154 int ret = 0;
8155
8156 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
8157
9be3395b 8158 io_bio = btrfs_bio_clone(dio_bio, GFP_NOFS);
9be3395b
CM		 8159 if (!io_bio) {
8160 ret = -ENOMEM;
8161 goto free_ordered;
8162 }
8163
c1dc0896 8164 dip = kzalloc(sizeof(*dip), GFP_NOFS);
4b46fce2
JB		 8165 if (!dip) {
8166 ret = -ENOMEM;
9be3395b 8167 goto free_io_bio;
4b46fce2 8168 }
4b46fce2 8169
9be3395b 8170 dip->private = dio_bio->bi_private;
4b46fce2
JB		 8171 dip->inode = inode;
8172 dip->logical_offset = file_offset;
4f024f37
KO		 8173 dip->bytes = dio_bio->bi_iter.bi_size;
8174 dip->disk_bytenr = (u64)dio_bio->bi_iter.bi_sector << 9;
9be3395b 8175 io_bio->bi_private = dip;
9be3395b
CM		 8176 dip->orig_bio = io_bio;
8177 dip->dio_bio = dio_bio;
e65e1535 8178 atomic_set(&dip->pending_bios, 0);
c1dc0896
MX		 8179 btrfs_bio = btrfs_io_bio(io_bio);
8180 btrfs_bio->logical = file_offset;
4b46fce2 8181
c1dc0896 8182 if (write) {
9be3395b 8183 io_bio->bi_end_io = btrfs_endio_direct_write;
c1dc0896 8184 } else {
9be3395b 8185 io_bio->bi_end_io = btrfs_endio_direct_read;
c1dc0896
MX		 8186 dip->subio_endio = btrfs_subio_endio_read;
8187 }
4b46fce2 8188
e65e1535
MX		 8189 ret = btrfs_submit_direct_hook(rw, dip, skip_sum);
8190 if (!ret)
eaf25d93 8191 return;
9be3395b 8192
23ea8e5a
MX		 8193 if (btrfs_bio->end_io)
8194 btrfs_bio->end_io(btrfs_bio, ret);
9be3395b
CM		 8195free_io_bio:
8196 bio_put(io_bio);
8197
4b46fce2
JB		 8198free_ordered:
8199 /*
8200 * If this is a write, we need to clean up the reserved space and kill
8201 * the ordered extent.
8202 */
8203 if (write) {
8204 struct btrfs_ordered_extent *ordered;
955256f2 8205 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
4b46fce2
JB		 8206 if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) &&
8207 !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags))
8208 btrfs_free_reserved_extent(root, ordered->start,
e570fd27 8209 ordered->disk_len, 1);
4b46fce2
JB		 8210 btrfs_put_ordered_extent(ordered);
8211 btrfs_put_ordered_extent(ordered);
8212 }
9be3395b 8213 bio_endio(dio_bio, ret);
4b46fce2
JB		 8214}
8215
5a5f79b5 8216static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb,
28060d5d 8217 const struct iov_iter *iter, loff_t offset)
5a5f79b5
CM		 8218{
8219 int seg;
a1b75f7d 8220 int i;
5a5f79b5
CM		 8221 unsigned blocksize_mask = root->sectorsize - 1;
8222 ssize_t retval = -EINVAL;
5a5f79b5
CM		 8223
8224 if (offset & blocksize_mask)
8225 goto out;
8226
28060d5d
AV		 8227 if (iov_iter_alignment(iter) & blocksize_mask)
8228 goto out;
a1b75f7d 8229
28060d5d
AV		 8230 /* If this is a write we don't need to check anymore */
8231 if (rw & WRITE)
8232 return 0;
8233 /*
8234 * Check to make sure we don't have duplicate iov_base's in this
8235 * iovec, if so return EINVAL, otherwise we'll get csum errors
8236 * when reading back.
8237 */
8238 for (seg = 0; seg < iter->nr_segs; seg++) {
8239 for (i = seg + 1; i < iter->nr_segs; i++) {
8240 if (iter->iov[seg].iov_base == iter->iov[i].iov_base)
a1b75f7d
JB		 8241 goto out;
8242 }
5a5f79b5
CM		 8243 }
8244 retval = 0;
8245out:
8246 return retval;
8247}
eb838e73 8248
16432985 8249static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb,
d8d3d94b 8250 struct iov_iter *iter, loff_t offset)
16432985 8251{
4b46fce2
JB		 8252 struct file *file = iocb->ki_filp;
8253 struct inode *inode = file->f_mapping->host;
e1cbbfa5 8254 u64 outstanding_extents = 0;
0934856d 8255 size_t count = 0;
2e60a51e 8256 int flags = 0;
38851cc1
MX		 8257 bool wakeup = true;
8258 bool relock = false;
0934856d 8259 ssize_t ret;
4b46fce2 8260
28060d5d 8261 if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iter, offset))
5a5f79b5 8262 return 0;
3f7c579c 8263
38851cc1 8264 atomic_inc(&inode->i_dio_count);
4e857c58 8265 smp_mb__after_atomic();
38851cc1 8266
0e267c44 8267 /*
41bd9ca4
MX		 8268 * The generic stuff only does filemap_write_and_wait_range, which
8269 * isn't enough if we've written compressed pages to this area, so
8270 * we need to flush the dirty pages again to make absolutely sure
8271 * that any outstanding dirty pages are on disk.
0e267c44 8272 */
a6cbcd4a 8273 count = iov_iter_count(iter);
41bd9ca4
MX		 8274 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
8275 &BTRFS_I(inode)->runtime_flags))
9a025a08
WS		 8276 filemap_fdatawrite_range(inode->i_mapping, offset,
8277 offset + count - 1);
0e267c44 8278
0934856d 8279 if (rw & WRITE) {
38851cc1
MX		 8280 /*
8281 * If the write DIO is beyond the EOF, we need update
8282 * the isize, but it is protected by i_mutex. So we can
8283 * not unlock the i_mutex at this case.
8284 */
8285 if (offset + count <= inode->i_size) {
8286 mutex_unlock(&inode->i_mutex);
8287 relock = true;
8288 }
0934856d
MX		 8289 ret = btrfs_delalloc_reserve_space(inode, count);
8290 if (ret)
38851cc1 8291 goto out;
e1cbbfa5
JB		 8292 outstanding_extents = div64_u64(count +
8293 BTRFS_MAX_EXTENT_SIZE - 1,
8294 BTRFS_MAX_EXTENT_SIZE);
8295
8296 /*
8297 * We need to know how many extents we reserved so that we can
8298 * do the accounting properly if we go over the number we
8299 * originally calculated. Abuse current->journal_info for this.
8300 */
8301 current->journal_info = &outstanding_extents;
ee39b432
DS		 8302 } else if (test_bit(BTRFS_INODE_READDIO_NEED_LOCK,
8303 &BTRFS_I(inode)->runtime_flags)) {
38851cc1
MX		 8304 inode_dio_done(inode);
8305 flags = DIO_LOCKING | DIO_SKIP_HOLES;
8306 wakeup = false;
0934856d
MX		 8307 }
8308
8309 ret = __blockdev_direct_IO(rw, iocb, inode,
8310 BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev,
31b14039 8311 iter, offset, btrfs_get_blocks_direct, NULL,
2e60a51e 8312 btrfs_submit_direct, flags);
0934856d 8313 if (rw & WRITE) {
e1cbbfa5 8314 current->journal_info = NULL;
0934856d
MX		 8315 if (ret < 0 && ret != -EIOCBQUEUED)
8316 btrfs_delalloc_release_space(inode, count);
172a5049 8317 else if (ret >= 0 && (size_t)ret < count)
0934856d
MX		 8318 btrfs_delalloc_release_space(inode,
8319 count - (size_t)ret);
0934856d 8320 }
38851cc1 8321out:
2e60a51e
MX		 8322 if (wakeup)
8323 inode_dio_done(inode);
38851cc1
MX		 8324 if (relock)
8325 mutex_lock(&inode->i_mutex);
0934856d
MX		 8326
8327 return ret;
16432985
CM		 8328}
8329
05dadc09
TI		 8330#define BTRFS_FIEMAP_FLAGS (FIEMAP_FLAG_SYNC)
8331
1506fcc8
YS		 8332static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
8333 __u64 start, __u64 len)
8334{
05dadc09
TI		 8335 int ret;
8336
8337 ret = fiemap_check_flags(fieinfo, BTRFS_FIEMAP_FLAGS);
8338 if (ret)
8339 return ret;
8340
ec29ed5b 8341 return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap);
1506fcc8
YS		 8342}
8343
a52d9a80 8344int btrfs_readpage(struct file *file, struct page *page)
9ebefb18 8345{
d1310b2e
CM		 8346 struct extent_io_tree *tree;
8347 tree = &BTRFS_I(page->mapping->host)->io_tree;
8ddc7d9c 8348 return extent_read_full_page(tree, page, btrfs_get_extent, 0);
9ebefb18 8349}
1832a6d5 8350
a52d9a80 8351static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
39279cc3 8352{
d1310b2e 8353 struct extent_io_tree *tree;
b888db2b
CM		 8354
8355
8356 if (current->flags & PF_MEMALLOC) {
8357 redirty_page_for_writepage(wbc, page);
8358 unlock_page(page);
8359 return 0;
8360 }
d1310b2e 8361 tree = &BTRFS_I(page->mapping->host)->io_tree;
a52d9a80 8362 return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
9ebefb18
CM		 8363}
8364
48a3b636
ES		 8365static int btrfs_writepages(struct address_space *mapping,
8366 struct writeback_control *wbc)
b293f02e 8367{
d1310b2e 8368 struct extent_io_tree *tree;
771ed689 8369
d1310b2e 8370 tree = &BTRFS_I(mapping->host)->io_tree;
b293f02e
CM		 8371 return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
8372}
8373
3ab2fb5a
CM		 8374static int
8375btrfs_readpages(struct file *file, struct address_space *mapping,
8376 struct list_head *pages, unsigned nr_pages)
8377{
d1310b2e
CM		 8378 struct extent_io_tree *tree;
8379 tree = &BTRFS_I(mapping->host)->io_tree;
3ab2fb5a
CM		 8380 return extent_readpages(tree, mapping, pages, nr_pages,
8381 btrfs_get_extent);
8382}
e6dcd2dc 8383static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
9ebefb18 8384{
d1310b2e
CM		 8385 struct extent_io_tree *tree;
8386 struct extent_map_tree *map;
a52d9a80 8387 int ret;
8c2383c3 8388
d1310b2e
CM		 8389 tree = &BTRFS_I(page->mapping->host)->io_tree;
8390 map = &BTRFS_I(page->mapping->host)->extent_tree;
70dec807 8391 ret = try_release_extent_mapping(map, tree, page, gfp_flags);
a52d9a80
CM		 8392 if (ret == 1) {
8393 ClearPagePrivate(page);
8394 set_page_private(page, 0);
8395 page_cache_release(page);
39279cc3 8396 }
a52d9a80 8397 return ret;
39279cc3
CM		 8398}
8399
e6dcd2dc
CM		 8400static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8401{
98509cfc
CM		 8402 if (PageWriteback(page) || PageDirty(page))
8403 return 0;
b335b003 8404 return __btrfs_releasepage(page, gfp_flags & GFP_NOFS);
e6dcd2dc
CM		 8405}
8406
d47992f8
LC		 8407static void btrfs_invalidatepage(struct page *page, unsigned int offset,
8408 unsigned int length)
39279cc3 8409{
5fd02043 8410 struct inode *inode = page->mapping->host;
d1310b2e 8411 struct extent_io_tree *tree;
e6dcd2dc 8412 struct btrfs_ordered_extent *ordered;
2ac55d41 8413 struct extent_state *cached_state = NULL;
e6dcd2dc
CM		 8414 u64 page_start = page_offset(page);
8415 u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
131e404a 8416 int inode_evicting = inode->i_state & I_FREEING;
39279cc3 8417
8b62b72b
CM		 8418 /*
8419 * we have the page locked, so new writeback can't start,
8420 * and the dirty bit won't be cleared while we are here.
8421 *
8422 * Wait for IO on this page so that we can safely clear
8423 * the PagePrivate2 bit and do ordered accounting
8424 */
e6dcd2dc 8425 wait_on_page_writeback(page);
8b62b72b 8426
5fd02043 8427 tree = &BTRFS_I(inode)->io_tree;
e6dcd2dc
CM		 8428 if (offset) {
8429 btrfs_releasepage(page, GFP_NOFS);
8430 return;
8431 }
131e404a
FDBM		 8432
8433 if (!inode_evicting)
8434 lock_extent_bits(tree, page_start, page_end, 0, &cached_state);
8435 ordered = btrfs_lookup_ordered_extent(inode, page_start);
e6dcd2dc 8436 if (ordered) {
eb84ae03
CM		 8437 /*
8438 * IO on this page will never be started, so we need
8439 * to account for any ordered extents now
8440 */
131e404a
FDBM		 8441 if (!inode_evicting)
8442 clear_extent_bit(tree, page_start, page_end,
8443 EXTENT_DIRTY | EXTENT_DELALLOC |
8444 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8445 EXTENT_DEFRAG, 1, 0, &cached_state,
8446 GFP_NOFS);
8b62b72b
CM		 8447 /*
8448 * whoever cleared the private bit is responsible
8449 * for the finish_ordered_io
8450 */
77cef2ec
JB		 8451 if (TestClearPagePrivate2(page)) {
8452 struct btrfs_ordered_inode_tree *tree;
8453 u64 new_len;
8454
8455 tree = &BTRFS_I(inode)->ordered_tree;
8456
8457 spin_lock_irq(&tree->lock);
8458 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8459 new_len = page_start - ordered->file_offset;
8460 if (new_len < ordered->truncated_len)
8461 ordered->truncated_len = new_len;
8462 spin_unlock_irq(&tree->lock);
8463
8464 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8465 page_start,
8466 PAGE_CACHE_SIZE, 1))
8467 btrfs_finish_ordered_io(ordered);
8b62b72b 8468 }
e6dcd2dc 8469 btrfs_put_ordered_extent(ordered);
131e404a
FDBM		 8470 if (!inode_evicting) {
8471 cached_state = NULL;
8472 lock_extent_bits(tree, page_start, page_end, 0,
8473 &cached_state);
8474 }
8475 }
8476
8477 if (!inode_evicting) {
8478 clear_extent_bit(tree, page_start, page_end,
8479 EXTENT_LOCKED | EXTENT_DIRTY |
8480 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8481 EXTENT_DEFRAG, 1, 1,
8482 &cached_state, GFP_NOFS);
8483
8484 __btrfs_releasepage(page, GFP_NOFS);
e6dcd2dc 8485 }
e6dcd2dc 8486
4a096752 8487 ClearPageChecked(page);
9ad6b7bc 8488 if (PagePrivate(page)) {
9ad6b7bc
CM		 8489 ClearPagePrivate(page);
8490 set_page_private(page, 0);
8491 page_cache_release(page);
8492 }
39279cc3
CM		 8493}
8494
9ebefb18
CM		 8495/*
8496 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8497 * called from a page fault handler when a page is first dirtied. Hence we must
8498 * be careful to check for EOF conditions here. We set the page up correctly
8499 * for a written page which means we get ENOSPC checking when writing into
8500 * holes and correct delalloc and unwritten extent mapping on filesystems that
8501 * support these features.
8502 *
8503 * We are not allowed to take the i_mutex here so we have to play games to
8504 * protect against truncate races as the page could now be beyond EOF. Because
8505 * vmtruncate() writes the inode size before removing pages, once we have the
8506 * page lock we can determine safely if the page is beyond EOF. If it is not
8507 * beyond EOF, then the page is guaranteed safe against truncation until we
8508 * unlock the page.
8509 */
c2ec175c 8510int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
9ebefb18 8511{
c2ec175c 8512 struct page *page = vmf->page;
496ad9aa 8513 struct inode *inode = file_inode(vma->vm_file);
1832a6d5 8514 struct btrfs_root *root = BTRFS_I(inode)->root;
e6dcd2dc
CM		 8515 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8516 struct btrfs_ordered_extent *ordered;
2ac55d41 8517 struct extent_state *cached_state = NULL;
e6dcd2dc
CM		 8518 char *kaddr;
8519 unsigned long zero_start;
9ebefb18 8520 loff_t size;
1832a6d5 8521 int ret;
9998eb70 8522 int reserved = 0;
a52d9a80 8523 u64 page_start;
e6dcd2dc 8524 u64 page_end;
9ebefb18 8525
b2b5ef5c 8526 sb_start_pagefault(inode->i_sb);
0ca1f7ce 8527 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
9998eb70 8528 if (!ret) {
e41f941a 8529 ret = file_update_time(vma->vm_file);
9998eb70
CM		 8530 reserved = 1;
8531 }
56a76f82
NP		 8532 if (ret) {
8533 if (ret == -ENOMEM)
8534 ret = VM_FAULT_OOM;
8535 else /* -ENOSPC, -EIO, etc */
8536 ret = VM_FAULT_SIGBUS;
9998eb70
CM		 8537 if (reserved)
8538 goto out;
8539 goto out_noreserve;
56a76f82 8540 }
1832a6d5 8541
56a76f82 8542 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
e6dcd2dc 8543again:
9ebefb18 8544 lock_page(page);
9ebefb18 8545 size = i_size_read(inode);
e6dcd2dc
CM		 8546 page_start = page_offset(page);
8547 page_end = page_start + PAGE_CACHE_SIZE - 1;
a52d9a80 8548
9ebefb18 8549 if ((page->mapping != inode->i_mapping) ||
e6dcd2dc 8550 (page_start >= size)) {
9ebefb18
CM		 8551 /* page got truncated out from underneath us */
8552 goto out_unlock;
8553 }
e6dcd2dc
CM		 8554 wait_on_page_writeback(page);
8555
d0082371 8556 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state);
e6dcd2dc
CM		 8557 set_page_extent_mapped(page);
8558
eb84ae03
CM		 8559 /*
8560 * we can't set the delalloc bits if there are pending ordered
8561 * extents. Drop our locks and wait for them to finish
8562 */
e6dcd2dc
CM		 8563 ordered = btrfs_lookup_ordered_extent(inode, page_start);
8564 if (ordered) {
2ac55d41
JB		 8565 unlock_extent_cached(io_tree, page_start, page_end,
8566 &cached_state, GFP_NOFS);
e6dcd2dc 8567 unlock_page(page);
eb84ae03 8568 btrfs_start_ordered_extent(inode, ordered, 1);
e6dcd2dc
CM		 8569 btrfs_put_ordered_extent(ordered);
8570 goto again;
8571 }
8572
fbf19087
JB		 8573 /*
8574 * XXX - page_mkwrite gets called every time the page is dirtied, even
8575 * if it was already dirty, so for space accounting reasons we need to
8576 * clear any delalloc bits for the range we are fixing to save. There
8577 * is probably a better way to do this, but for now keep consistent with
8578 * prepare_pages in the normal write path.
8579 */
2ac55d41 8580 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
9e8a4a8b
LB		 8581 EXTENT_DIRTY | EXTENT_DELALLOC |
8582 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
2ac55d41 8583 0, 0, &cached_state, GFP_NOFS);
fbf19087 8584
2ac55d41
JB		 8585 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
8586 &cached_state);
9ed74f2d 8587 if (ret) {
2ac55d41
JB		 8588 unlock_extent_cached(io_tree, page_start, page_end,
8589 &cached_state, GFP_NOFS);
9ed74f2d
JB		 8590 ret = VM_FAULT_SIGBUS;
8591 goto out_unlock;
8592 }
e6dcd2dc 8593 ret = 0;
9ebefb18
CM		 8594
8595 /* page is wholly or partially inside EOF */
a52d9a80 8596 if (page_start + PAGE_CACHE_SIZE > size)
e6dcd2dc 8597 zero_start = size & ~PAGE_CACHE_MASK;
9ebefb18 8598 else
e6dcd2dc 8599 zero_start = PAGE_CACHE_SIZE;
9ebefb18 8600
e6dcd2dc
CM		 8601 if (zero_start != PAGE_CACHE_SIZE) {
8602 kaddr = kmap(page);
8603 memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
8604 flush_dcache_page(page);
8605 kunmap(page);
8606 }
247e743c 8607 ClearPageChecked(page);
e6dcd2dc 8608 set_page_dirty(page);
50a9b214 8609 SetPageUptodate(page);
5a3f23d5 8610
257c62e1
CM		 8611 BTRFS_I(inode)->last_trans = root->fs_info->generation;
8612 BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
46d8bc34 8613 BTRFS_I(inode)->last_log_commit = BTRFS_I(inode)->root->last_log_commit;
257c62e1 8614
2ac55d41 8615 unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
9ebefb18
CM		 8616
8617out_unlock:
b2b5ef5c
JK		 8618 if (!ret) {
8619 sb_end_pagefault(inode->i_sb);
50a9b214 8620 return VM_FAULT_LOCKED;
b2b5ef5c 8621 }
9ebefb18 8622 unlock_page(page);
1832a6d5 8623out:
ec39e180 8624 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
9998eb70 8625out_noreserve:
b2b5ef5c 8626 sb_end_pagefault(inode->i_sb);
9ebefb18
CM		 8627 return ret;
8628}
8629
a41ad394 8630static int btrfs_truncate(struct inode *inode)
39279cc3
CM		 8631{
8632 struct btrfs_root *root = BTRFS_I(inode)->root;
fcb80c2a 8633 struct btrfs_block_rsv *rsv;
a71754fc 8634 int ret = 0;
3893e33b 8635 int err = 0;
39279cc3 8636 struct btrfs_trans_handle *trans;
dbe674a9 8637 u64 mask = root->sectorsize - 1;
07127184 8638 u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
39279cc3 8639
0ef8b726
JB		 8640 ret = btrfs_wait_ordered_range(inode, inode->i_size & (~mask),
8641 (u64)-1);
8642 if (ret)
8643 return ret;
39279cc3 8644
fcb80c2a
JB		 8645 /*
8646 * Yes ladies and gentelment, this is indeed ugly. The fact is we have
8647 * 3 things going on here
8648 *
8649 * 1) We need to reserve space for our orphan item and the space to
8650 * delete our orphan item. Lord knows we don't want to have a dangling
8651 * orphan item because we didn't reserve space to remove it.
8652 *
8653 * 2) We need to reserve space to update our inode.
8654 *
8655 * 3) We need to have something to cache all the space that is going to
8656 * be free'd up by the truncate operation, but also have some slack
8657 * space reserved in case it uses space during the truncate (thank you
8658 * very much snapshotting).
8659 *
8660 * And we need these to all be seperate. The fact is we can use alot of
8661 * space doing the truncate, and we have no earthly idea how much space
8662 * we will use, so we need the truncate reservation to be seperate so it
8663 * doesn't end up using space reserved for updating the inode or
8664 * removing the orphan item. We also need to be able to stop the
8665 * transaction and start a new one, which means we need to be able to
8666 * update the inode several times, and we have no idea of knowing how
8667 * many times that will be, so we can't just reserve 1 item for the
8668 * entirety of the opration, so that has to be done seperately as well.
8669 * Then there is the orphan item, which does indeed need to be held on
8670 * to for the whole operation, and we need nobody to touch this reserved
8671 * space except the orphan code.
8672 *
8673 * So that leaves us with
8674 *
8675 * 1) root->orphan_block_rsv - for the orphan deletion.
8676 * 2) rsv - for the truncate reservation, which we will steal from the
8677 * transaction reservation.
8678 * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
8679 * updating the inode.
8680 */
66d8f3dd 8681 rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
fcb80c2a
JB		 8682 if (!rsv)
8683 return -ENOMEM;
4a338542 8684 rsv->size = min_size;
ca7e70f5 8685 rsv->failfast = 1;
f0cd846e 8686
907cbceb 8687 /*
07127184 8688 * 1 for the truncate slack space
907cbceb
JB		 8689 * 1 for updating the inode.
8690 */
f3fe820c 8691 trans = btrfs_start_transaction(root, 2);
fcb80c2a
JB		 8692 if (IS_ERR(trans)) {
8693 err = PTR_ERR(trans);
8694 goto out;
8695 }
f0cd846e 8696
907cbceb
JB		 8697 /* Migrate the slack space for the truncate to our reserve */
8698 ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, rsv,
8699 min_size);
fcb80c2a 8700 BUG_ON(ret);
f0cd846e 8701
5dc562c5
JB		 8702 /*
8703 * So if we truncate and then write and fsync we normally would just
8704 * write the extents that changed, which is a problem if we need to
8705 * first truncate that entire inode. So set this flag so we write out
8706 * all of the extents in the inode to the sync log so we're completely
8707 * safe.
8708 */
8709 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
ca7e70f5 8710 trans->block_rsv = rsv;
907cbceb 8711
8082510e
YZ		 8712 while (1) {
8713 ret = btrfs_truncate_inode_items(trans, root, inode,
8714 inode->i_size,
8715 BTRFS_EXTENT_DATA_KEY);
28ed1345 8716 if (ret != -ENOSPC && ret != -EAGAIN) {
3893e33b 8717 err = ret;
8082510e 8718 break;
3893e33b 8719 }
39279cc3 8720
fcb80c2a 8721 trans->block_rsv = &root->fs_info->trans_block_rsv;
8082510e 8722 ret = btrfs_update_inode(trans, root, inode);
3893e33b
JB		 8723 if (ret) {
8724 err = ret;
8725 break;
8726 }
ca7e70f5 8727
8082510e 8728 btrfs_end_transaction(trans, root);
b53d3f5d 8729 btrfs_btree_balance_dirty(root);
ca7e70f5
JB		 8730
8731 trans = btrfs_start_transaction(root, 2);
8732 if (IS_ERR(trans)) {
8733 ret = err = PTR_ERR(trans);
8734 trans = NULL;
8735 break;
8736 }
8737
8738 ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv,
8739 rsv, min_size);
8740 BUG_ON(ret); /* shouldn't happen */
8741 trans->block_rsv = rsv;
8082510e
YZ		 8742 }
8743
8744 if (ret == 0 && inode->i_nlink > 0) {
fcb80c2a 8745 trans->block_rsv = root->orphan_block_rsv;
8082510e 8746 ret = btrfs_orphan_del(trans, inode);
3893e33b
JB		 8747 if (ret)
8748 err = ret;
8082510e
YZ		 8749 }
8750
917c16b2
CM		 8751 if (trans) {
8752 trans->block_rsv = &root->fs_info->trans_block_rsv;
8753 ret = btrfs_update_inode(trans, root, inode);
8754 if (ret && !err)
8755 err = ret;
7b128766 8756
7ad85bb7 8757 ret = btrfs_end_transaction(trans, root);
b53d3f5d 8758 btrfs_btree_balance_dirty(root);
917c16b2 8759 }
fcb80c2a
JB		 8760
8761out:
8762 btrfs_free_block_rsv(root, rsv);
8763
3893e33b
JB		 8764 if (ret && !err)
8765 err = ret;
a41ad394 8766
3893e33b 8767 return err;
39279cc3
CM		 8768}
8769
d352ac68
CM		 8770/*
8771 * create a new subvolume directory/inode (helper for the ioctl).
8772 */
d2fb3437 8773int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
63541927
FDBM		 8774 struct btrfs_root *new_root,
8775 struct btrfs_root *parent_root,
8776 u64 new_dirid)
39279cc3 8777{
39279cc3 8778 struct inode *inode;
76dda93c 8779 int err;
00e4e6b3 8780 u64 index = 0;
39279cc3 8781
12fc9d09
FA		 8782 inode = btrfs_new_inode(trans, new_root, NULL, "..", 2,
8783 new_dirid, new_dirid,
8784 S_IFDIR | (~current_umask() & S_IRWXUGO),
8785 &index);
54aa1f4d 8786 if (IS_ERR(inode))
f46b5a66 8787 return PTR_ERR(inode);
39279cc3
CM		 8788 inode->i_op = &btrfs_dir_inode_operations;
8789 inode->i_fop = &btrfs_dir_file_operations;
8790
bfe86848 8791 set_nlink(inode, 1);
dbe674a9 8792 btrfs_i_size_write(inode, 0);
b0d5d10f 8793 unlock_new_inode(inode);
3b96362c 8794
63541927
FDBM		 8795 err = btrfs_subvol_inherit_props(trans, new_root, parent_root);
8796 if (err)
8797 btrfs_err(new_root->fs_info,
351fd353 8798 "error inheriting subvolume %llu properties: %d",
63541927
FDBM		 8799 new_root->root_key.objectid, err);
8800
76dda93c 8801 err = btrfs_update_inode(trans, new_root, inode);
cb8e7090 8802
76dda93c 8803 iput(inode);
ce598979 8804 return err;
39279cc3
CM		 8805}
8806
39279cc3
CM		 8807struct inode *btrfs_alloc_inode(struct super_block *sb)
8808{
8809 struct btrfs_inode *ei;
2ead6ae7 8810 struct inode *inode;
39279cc3
CM		 8811
8812 ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
8813 if (!ei)
8814 return NULL;
2ead6ae7
YZ		 8815
8816 ei->root = NULL;
2ead6ae7 8817 ei->generation = 0;
15ee9bc7 8818 ei->last_trans = 0;
257c62e1 8819 ei->last_sub_trans = 0;
e02119d5 8820 ei->logged_trans = 0;
2ead6ae7 8821 ei->delalloc_bytes = 0;
47059d93 8822 ei->defrag_bytes = 0;
2ead6ae7
YZ		 8823 ei->disk_i_size = 0;
8824 ei->flags = 0;
7709cde3 8825 ei->csum_bytes = 0;
2ead6ae7 8826 ei->index_cnt = (u64)-1;
67de1176 8827 ei->dir_index = 0;
2ead6ae7 8828 ei->last_unlink_trans = 0;
46d8bc34 8829 ei->last_log_commit = 0;
2ead6ae7 8830
9e0baf60
JB		 8831 spin_lock_init(&ei->lock);
8832 ei->outstanding_extents = 0;
8833 ei->reserved_extents = 0;
2ead6ae7 8834
72ac3c0d 8835 ei->runtime_flags = 0;
261507a0 8836 ei->force_compress = BTRFS_COMPRESS_NONE;
2ead6ae7 8837
16cdcec7
MX		 8838 ei->delayed_node = NULL;
8839
9cc97d64 8840 ei->i_otime.tv_sec = 0;
8841 ei->i_otime.tv_nsec = 0;
8842
2ead6ae7 8843 inode = &ei->vfs_inode;
a8067e02 8844 extent_map_tree_init(&ei->extent_tree);
f993c883
DS		 8845 extent_io_tree_init(&ei->io_tree, &inode->i_data);
8846 extent_io_tree_init(&ei->io_failure_tree, &inode->i_data);
0b32f4bb
JB		 8847 ei->io_tree.track_uptodate = 1;
8848 ei->io_failure_tree.track_uptodate = 1;
b812ce28 8849 atomic_set(&ei->sync_writers, 0);
2ead6ae7 8850 mutex_init(&ei->log_mutex);
f248679e 8851 mutex_init(&ei->delalloc_mutex);
e6dcd2dc 8852 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
2ead6ae7 8853 INIT_LIST_HEAD(&ei->delalloc_inodes);
2ead6ae7
YZ		 8854 RB_CLEAR_NODE(&ei->rb_node);
8855
8856 return inode;
39279cc3
CM		 8857}
8858
aaedb55b
JB		 8859#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8860void btrfs_test_destroy_inode(struct inode *inode)
8861{
8862 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
8863 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8864}
8865#endif
8866
fa0d7e3d
NP		 8867static void btrfs_i_callback(struct rcu_head *head)
8868{
8869 struct inode *inode = container_of(head, struct inode, i_rcu);
fa0d7e3d
NP		 8870 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8871}
8872
39279cc3
CM		 8873void btrfs_destroy_inode(struct inode *inode)
8874{
e6dcd2dc 8875 struct btrfs_ordered_extent *ordered;
5a3f23d5
CM		 8876 struct btrfs_root *root = BTRFS_I(inode)->root;
8877
b3d9b7a3 8878 WARN_ON(!hlist_empty(&inode->i_dentry));
39279cc3 8879 WARN_ON(inode->i_data.nrpages);
9e0baf60
JB		 8880 WARN_ON(BTRFS_I(inode)->outstanding_extents);
8881 WARN_ON(BTRFS_I(inode)->reserved_extents);
7709cde3
JB		 8882 WARN_ON(BTRFS_I(inode)->delalloc_bytes);
8883 WARN_ON(BTRFS_I(inode)->csum_bytes);
47059d93 8884 WARN_ON(BTRFS_I(inode)->defrag_bytes);
39279cc3 8885
a6dbd429
JB		 8886 /*
8887 * This can happen where we create an inode, but somebody else also
8888 * created the same inode and we need to destroy the one we already
8889 * created.
8890 */
8891 if (!root)
8892 goto free;
8893
8a35d95f
JB		 8894 if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
8895 &BTRFS_I(inode)->runtime_flags)) {
c2cf52eb 8896 btrfs_info(root->fs_info, "inode %llu still on the orphan list",
c1c9ff7c 8897 btrfs_ino(inode));
8a35d95f 8898 atomic_dec(&root->orphan_inodes);
7b128766 8899 }
7b128766 8900
d397712b 8901 while (1) {
e6dcd2dc
CM		 8902 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
8903 if (!ordered)
8904 break;
8905 else {
c2cf52eb 8906 btrfs_err(root->fs_info, "found ordered extent %llu %llu on inode cleanup",
c1c9ff7c 8907 ordered->file_offset, ordered->len);
e6dcd2dc
CM		 8908 btrfs_remove_ordered_extent(inode, ordered);
8909 btrfs_put_ordered_extent(ordered);
8910 btrfs_put_ordered_extent(ordered);
8911 }
8912 }
5d4f98a2 8913 inode_tree_del(inode);
5b21f2ed 8914 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
a6dbd429 8915free:
fa0d7e3d 8916 call_rcu(&inode->i_rcu, btrfs_i_callback);
39279cc3
CM		 8917}
8918
45321ac5 8919int btrfs_drop_inode(struct inode *inode)
76dda93c
YZ		 8920{
8921 struct btrfs_root *root = BTRFS_I(inode)->root;
45321ac5 8922
6379ef9f
NA		 8923 if (root == NULL)
8924 return 1;
8925
fa6ac876 8926 /* the snap/subvol tree is on deleting */
69e9c6c6 8927 if (btrfs_root_refs(&root->root_item) == 0)
45321ac5 8928 return 1;
76dda93c 8929 else
45321ac5 8930 return generic_drop_inode(inode);
76dda93c
YZ		 8931}
8932
0ee0fda0 8933static void init_once(void *foo)
39279cc3
CM		 8934{
8935 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
8936
8937 inode_init_once(&ei->vfs_inode);
8938}
8939
8940void btrfs_destroy_cachep(void)
8941{
8c0a8537
KS		 8942 /*
8943 * Make sure all delayed rcu free inodes are flushed before we
8944 * destroy cache.
8945 */
8946 rcu_barrier();
39279cc3
CM		 8947 if (btrfs_inode_cachep)
8948 kmem_cache_destroy(btrfs_inode_cachep);
8949 if (btrfs_trans_handle_cachep)
8950 kmem_cache_destroy(btrfs_trans_handle_cachep);
8951 if (btrfs_transaction_cachep)
8952 kmem_cache_destroy(btrfs_transaction_cachep);
39279cc3
CM		 8953 if (btrfs_path_cachep)
8954 kmem_cache_destroy(btrfs_path_cachep);
dc89e982
JB		 8955 if (btrfs_free_space_cachep)
8956 kmem_cache_destroy(btrfs_free_space_cachep);
8ccf6f19
MX		 8957 if (btrfs_delalloc_work_cachep)
8958 kmem_cache_destroy(btrfs_delalloc_work_cachep);
39279cc3
CM		 8959}
8960
8961int btrfs_init_cachep(void)
8962{
837e1972 8963 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
9601e3f6
CH		 8964 sizeof(struct btrfs_inode), 0,
8965 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once);
39279cc3
CM		 8966 if (!btrfs_inode_cachep)
8967 goto fail;
9601e3f6 8968
837e1972 8969 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
9601e3f6
CH		 8970 sizeof(struct btrfs_trans_handle), 0,
8971 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
39279cc3
CM		 8972 if (!btrfs_trans_handle_cachep)
8973 goto fail;
9601e3f6 8974
837e1972 8975 btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction",
9601e3f6
CH		 8976 sizeof(struct btrfs_transaction), 0,
8977 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
39279cc3
CM		 8978 if (!btrfs_transaction_cachep)
8979 goto fail;
9601e3f6 8980
837e1972 8981 btrfs_path_cachep = kmem_cache_create("btrfs_path",
9601e3f6
CH		 8982 sizeof(struct btrfs_path), 0,
8983 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
39279cc3
CM		 8984 if (!btrfs_path_cachep)
8985 goto fail;
9601e3f6 8986
837e1972 8987 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
dc89e982
JB		 8988 sizeof(struct btrfs_free_space), 0,
8989 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
8990 if (!btrfs_free_space_cachep)
8991 goto fail;
8992
8ccf6f19
MX		 8993 btrfs_delalloc_work_cachep = kmem_cache_create("btrfs_delalloc_work",
8994 sizeof(struct btrfs_delalloc_work), 0,
8995 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD,
8996 NULL);
8997 if (!btrfs_delalloc_work_cachep)
8998 goto fail;
8999
39279cc3
CM		 9000 return 0;
9001fail:
9002 btrfs_destroy_cachep();
9003 return -ENOMEM;
9004}
9005
9006static int btrfs_getattr(struct vfsmount *mnt,
9007 struct dentry *dentry, struct kstat *stat)
9008{
df0af1a5 9009 u64 delalloc_bytes;
39279cc3 9010 struct inode *inode = dentry->d_inode;
fadc0d8b
DS		 9011 u32 blocksize = inode->i_sb->s_blocksize;
9012
39279cc3 9013 generic_fillattr(inode, stat);
0ee5dc67 9014 stat->dev = BTRFS_I(inode)->root->anon_dev;
d6667462 9015 stat->blksize = PAGE_CACHE_SIZE;
df0af1a5
MX		 9016
9017 spin_lock(&BTRFS_I(inode)->lock);
9018 delalloc_bytes = BTRFS_I(inode)->delalloc_bytes;
9019 spin_unlock(&BTRFS_I(inode)->lock);
fadc0d8b 9020 stat->blocks = (ALIGN(inode_get_bytes(inode), blocksize) +
df0af1a5 9021 ALIGN(delalloc_bytes, blocksize)) >> 9;
39279cc3
CM		 9022 return 0;
9023}
9024
d397712b
CM		 9025static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
9026 struct inode *new_dir, struct dentry *new_dentry)
39279cc3
CM		 9027{
9028 struct btrfs_trans_handle *trans;
9029 struct btrfs_root *root = BTRFS_I(old_dir)->root;
4df27c4d 9030 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
39279cc3
CM		 9031 struct inode *new_inode = new_dentry->d_inode;
9032 struct inode *old_inode = old_dentry->d_inode;
9033 struct timespec ctime = CURRENT_TIME;
00e4e6b3 9034 u64 index = 0;
4df27c4d 9035 u64 root_objectid;
39279cc3 9036 int ret;
33345d01 9037 u64 old_ino = btrfs_ino(old_inode);
39279cc3 9038
33345d01 9039 if (btrfs_ino(new_dir) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
f679a840
YZ		 9040 return -EPERM;
9041
4df27c4d 9042 /* we only allow rename subvolume link between subvolumes */
33345d01 9043 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
3394e160
CM		 9044 return -EXDEV;
9045
33345d01
LZ		 9046 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
9047 (new_inode && btrfs_ino(new_inode) == BTRFS_FIRST_FREE_OBJECTID))
39279cc3 9048 return -ENOTEMPTY;
5f39d397 9049
4df27c4d
YZ		 9050 if (S_ISDIR(old_inode->i_mode) && new_inode &&
9051 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
9052 return -ENOTEMPTY;
9c52057c
CM		 9053
9054
9055 /* check for collisions, even if the name isn't there */
4871c158 9056 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino,
9c52057c
CM		 9057 new_dentry->d_name.name,
9058 new_dentry->d_name.len);
9059
9060 if (ret) {
9061 if (ret == -EEXIST) {
9062 /* we shouldn't get
9063 * eexist without a new_inode */
fae7f21c 9064 if (WARN_ON(!new_inode)) {
9c52057c
CM		 9065 return ret;
9066 }
9067 } else {
9068 /* maybe -EOVERFLOW */
9069 return ret;
9070 }
9071 }
9072 ret = 0;
9073
5a3f23d5 9074 /*
8d875f95
CM		 9075 * we're using rename to replace one file with another. Start IO on it
9076 * now so we don't add too much work to the end of the transaction
5a3f23d5 9077 */
8d875f95 9078 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
5a3f23d5
CM		 9079 filemap_flush(old_inode->i_mapping);
9080
76dda93c 9081 /* close the racy window with snapshot create/destroy ioctl */
33345d01 9082 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
76dda93c 9083 down_read(&root->fs_info->subvol_sem);
a22285a6
YZ		 9084 /*
9085 * We want to reserve the absolute worst case amount of items. So if
9086 * both inodes are subvols and we need to unlink them then that would
9087 * require 4 item modifications, but if they are both normal inodes it
9088 * would require 5 item modifications, so we'll assume their normal
9089 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9090 * should cover the worst case number of items we'll modify.
9091 */
6e137ed3 9092 trans = btrfs_start_transaction(root, 11);
b44c59a8
JL		 9093 if (IS_ERR(trans)) {
9094 ret = PTR_ERR(trans);
9095 goto out_notrans;
9096 }
76dda93c 9097
4df27c4d
YZ		 9098 if (dest != root)
9099 btrfs_record_root_in_trans(trans, dest);
5f39d397 9100
a5719521
YZ		 9101 ret = btrfs_set_inode_index(new_dir, &index);
9102 if (ret)
9103 goto out_fail;
5a3f23d5 9104
67de1176 9105 BTRFS_I(old_inode)->dir_index = 0ULL;
33345d01 9106 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
4df27c4d 9107 /* force full log commit if subvolume involved. */
995946dd 9108 btrfs_set_log_full_commit(root->fs_info, trans);
4df27c4d 9109 } else {
a5719521
YZ		 9110 ret = btrfs_insert_inode_ref(trans, dest,
9111 new_dentry->d_name.name,
9112 new_dentry->d_name.len,
33345d01
LZ		 9113 old_ino,
9114 btrfs_ino(new_dir), index);
a5719521
YZ		 9115 if (ret)
9116 goto out_fail;
4df27c4d
YZ		 9117 /*
9118 * this is an ugly little race, but the rename is required
9119 * to make sure that if we crash, the inode is either at the
9120 * old name or the new one. pinning the log transaction lets
9121 * us make sure we don't allow a log commit to come in after
9122 * we unlink the name but before we add the new name back in.
9123 */
9124 btrfs_pin_log_trans(root);
9125 }
5a3f23d5 9126
0c4d2d95
JB		 9127 inode_inc_iversion(old_dir);
9128 inode_inc_iversion(new_dir);
9129 inode_inc_iversion(old_inode);
39279cc3
CM		 9130 old_dir->i_ctime = old_dir->i_mtime = ctime;
9131 new_dir->i_ctime = new_dir->i_mtime = ctime;
9132 old_inode->i_ctime = ctime;
5f39d397 9133
12fcfd22
CM		 9134 if (old_dentry->d_parent != new_dentry->d_parent)
9135 btrfs_record_unlink_dir(trans, old_dir, old_inode, 1);
9136
33345d01 9137 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
4df27c4d
YZ		 9138 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
9139 ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid,
9140 old_dentry->d_name.name,
9141 old_dentry->d_name.len);
9142 } else {
92986796
AV		 9143 ret = __btrfs_unlink_inode(trans, root, old_dir,
9144 old_dentry->d_inode,
9145 old_dentry->d_name.name,
9146 old_dentry->d_name.len);
9147 if (!ret)
9148 ret = btrfs_update_inode(trans, root, old_inode);
4df27c4d 9149 }
79787eaa
JM		 9150 if (ret) {
9151 btrfs_abort_transaction(trans, root, ret);
9152 goto out_fail;
9153 }
39279cc3
CM		 9154
9155 if (new_inode) {
0c4d2d95 9156 inode_inc_iversion(new_inode);
39279cc3 9157 new_inode->i_ctime = CURRENT_TIME;
33345d01 9158 if (unlikely(btrfs_ino(new_inode) ==
4df27c4d
YZ		 9159 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9160 root_objectid = BTRFS_I(new_inode)->location.objectid;
9161 ret = btrfs_unlink_subvol(trans, dest, new_dir,
9162 root_objectid,
9163 new_dentry->d_name.name,
9164 new_dentry->d_name.len);
9165 BUG_ON(new_inode->i_nlink == 0);
9166 } else {
9167 ret = btrfs_unlink_inode(trans, dest, new_dir,
9168 new_dentry->d_inode,
9169 new_dentry->d_name.name,
9170 new_dentry->d_name.len);
9171 }
4ef31a45 9172 if (!ret && new_inode->i_nlink == 0)
e02119d5 9173 ret = btrfs_orphan_add(trans, new_dentry->d_inode);
79787eaa
JM		 9174 if (ret) {
9175 btrfs_abort_transaction(trans, root, ret);
9176 goto out_fail;
9177 }
39279cc3 9178 }
aec7477b 9179
4df27c4d
YZ		 9180 ret = btrfs_add_link(trans, new_dir, old_inode,
9181 new_dentry->d_name.name,
a5719521 9182 new_dentry->d_name.len, 0, index);
79787eaa
JM		 9183 if (ret) {
9184 btrfs_abort_transaction(trans, root, ret);
9185 goto out_fail;
9186 }
39279cc3 9187
67de1176
MX		 9188 if (old_inode->i_nlink == 1)
9189 BTRFS_I(old_inode)->dir_index = index;
9190
33345d01 9191 if (old_ino != BTRFS_FIRST_FREE_OBJECTID) {
10d9f309 9192 struct dentry *parent = new_dentry->d_parent;
6a912213 9193 btrfs_log_new_name(trans, old_inode, old_dir, parent);
4df27c4d
YZ		 9194 btrfs_end_log_trans(root);
9195 }
39279cc3 9196out_fail:
7ad85bb7 9197 btrfs_end_transaction(trans, root);
b44c59a8 9198out_notrans:
33345d01 9199 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
76dda93c 9200 up_read(&root->fs_info->subvol_sem);
9ed74f2d 9201
39279cc3
CM		 9202 return ret;
9203}
9204
80ace85c
MS		 9205static int btrfs_rename2(struct inode *old_dir, struct dentry *old_dentry,
9206 struct inode *new_dir, struct dentry *new_dentry,
9207 unsigned int flags)
9208{
9209 if (flags & ~RENAME_NOREPLACE)
9210 return -EINVAL;
9211
9212 return btrfs_rename(old_dir, old_dentry, new_dir, new_dentry);
9213}
9214
8ccf6f19
MX		 9215static void btrfs_run_delalloc_work(struct btrfs_work *work)
9216{
9217 struct btrfs_delalloc_work *delalloc_work;
9f23e289 9218 struct inode *inode;
8ccf6f19
MX		 9219
9220 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9221 work);
9f23e289
JB		 9222 inode = delalloc_work->inode;
9223 if (delalloc_work->wait) {
9224 btrfs_wait_ordered_range(inode, 0, (u64)-1);
9225 } else {
9226 filemap_flush(inode->i_mapping);
9227 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9228 &BTRFS_I(inode)->runtime_flags))
9229 filemap_flush(inode->i_mapping);
9230 }
8ccf6f19
MX		 9231
9232 if (delalloc_work->delay_iput)
9f23e289 9233 btrfs_add_delayed_iput(inode);
8ccf6f19 9234 else
9f23e289 9235 iput(inode);
8ccf6f19
MX		 9236 complete(&delalloc_work->completion);
9237}
9238
9239struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode,
9240 int wait, int delay_iput)
9241{
9242 struct btrfs_delalloc_work *work;
9243
9244 work = kmem_cache_zalloc(btrfs_delalloc_work_cachep, GFP_NOFS);
9245 if (!work)
9246 return NULL;
9247
9248 init_completion(&work->completion);
9249 INIT_LIST_HEAD(&work->list);
9250 work->inode = inode;
9251 work->wait = wait;
9252 work->delay_iput = delay_iput;
9e0af237
LB		 9253 WARN_ON_ONCE(!inode);
9254 btrfs_init_work(&work->work, btrfs_flush_delalloc_helper,
9255 btrfs_run_delalloc_work, NULL, NULL);
8ccf6f19
MX		 9256
9257 return work;
9258}
9259
9260void btrfs_wait_and_free_delalloc_work(struct btrfs_delalloc_work *work)
9261{
9262 wait_for_completion(&work->completion);
9263 kmem_cache_free(btrfs_delalloc_work_cachep, work);
9264}
9265
d352ac68
CM		 9266/*
9267 * some fairly slow code that needs optimization. This walks the list
9268 * of all the inodes with pending delalloc and forces them to disk.
9269 */
6c255e67
MX		 9270static int __start_delalloc_inodes(struct btrfs_root *root, int delay_iput,
9271 int nr)
ea8c2819 9272{
ea8c2819 9273 struct btrfs_inode *binode;
5b21f2ed 9274 struct inode *inode;
8ccf6f19
MX		 9275 struct btrfs_delalloc_work *work, *next;
9276 struct list_head works;
1eafa6c7 9277 struct list_head splice;
8ccf6f19 9278 int ret = 0;
ea8c2819 9279
8ccf6f19 9280 INIT_LIST_HEAD(&works);
1eafa6c7 9281 INIT_LIST_HEAD(&splice);
63607cc8 9282
573bfb72 9283 mutex_lock(&root->delalloc_mutex);
eb73c1b7
MX		 9284 spin_lock(&root->delalloc_lock);
9285 list_splice_init(&root->delalloc_inodes, &splice);
1eafa6c7
MX		 9286 while (!list_empty(&splice)) {
9287 binode = list_entry(splice.next, struct btrfs_inode,
ea8c2819 9288 delalloc_inodes);
1eafa6c7 9289
eb73c1b7
MX		 9290 list_move_tail(&binode->delalloc_inodes,
9291 &root->delalloc_inodes);
5b21f2ed 9292 inode = igrab(&binode->vfs_inode);
df0af1a5 9293 if (!inode) {
eb73c1b7 9294 cond_resched_lock(&root->delalloc_lock);
1eafa6c7 9295 continue;
df0af1a5 9296 }
eb73c1b7 9297 spin_unlock(&root->delalloc_lock);
1eafa6c7
MX		 9298
9299 work = btrfs_alloc_delalloc_work(inode, 0, delay_iput);
5d99a998 9300 if (!work) {
f4ab9ea7
JB		 9301 if (delay_iput)
9302 btrfs_add_delayed_iput(inode);
9303 else
9304 iput(inode);
1eafa6c7 9305 ret = -ENOMEM;
a1ecaabb 9306 goto out;
5b21f2ed 9307 }
1eafa6c7 9308 list_add_tail(&work->list, &works);
a44903ab
QW		 9309 btrfs_queue_work(root->fs_info->flush_workers,
9310 &work->work);
6c255e67
MX		 9311 ret++;
9312 if (nr != -1 && ret >= nr)
a1ecaabb 9313 goto out;
5b21f2ed 9314 cond_resched();
eb73c1b7 9315 spin_lock(&root->delalloc_lock);
ea8c2819 9316 }
eb73c1b7 9317 spin_unlock(&root->delalloc_lock);
8c8bee1d 9318
a1ecaabb 9319out:
eb73c1b7
MX		 9320 list_for_each_entry_safe(work, next, &works, list) {
9321 list_del_init(&work->list);
9322 btrfs_wait_and_free_delalloc_work(work);
9323 }
9324
9325 if (!list_empty_careful(&splice)) {
9326 spin_lock(&root->delalloc_lock);
9327 list_splice_tail(&splice, &root->delalloc_inodes);
9328 spin_unlock(&root->delalloc_lock);
9329 }
573bfb72 9330 mutex_unlock(&root->delalloc_mutex);
eb73c1b7
MX		 9331 return ret;
9332}
1eafa6c7 9333
eb73c1b7
MX		 9334int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput)
9335{
9336 int ret;
1eafa6c7 9337
2c21b4d7 9338 if (test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state))
eb73c1b7
MX		 9339 return -EROFS;
9340
6c255e67
MX		 9341 ret = __start_delalloc_inodes(root, delay_iput, -1);
9342 if (ret > 0)
9343 ret = 0;
eb73c1b7
MX		 9344 /*
9345 * the filemap_flush will queue IO into the worker threads, but
8c8bee1d
CM		 9346 * we have to make sure the IO is actually started and that
9347 * ordered extents get created before we return
9348 */
9349 atomic_inc(&root->fs_info->async_submit_draining);
d397712b 9350 while (atomic_read(&root->fs_info->nr_async_submits) ||
771ed689 9351 atomic_read(&root->fs_info->async_delalloc_pages)) {
8c8bee1d 9352 wait_event(root->fs_info->async_submit_wait,
771ed689
CM		 9353 (atomic_read(&root->fs_info->nr_async_submits) == 0 &&
9354 atomic_read(&root->fs_info->async_delalloc_pages) == 0));
8c8bee1d
CM		 9355 }
9356 atomic_dec(&root->fs_info->async_submit_draining);
eb73c1b7
MX		 9357 return ret;
9358}
9359
6c255e67
MX		 9360int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, int delay_iput,
9361 int nr)
eb73c1b7
MX		 9362{
9363 struct btrfs_root *root;
9364 struct list_head splice;
9365 int ret;
9366
2c21b4d7 9367 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
eb73c1b7
MX		 9368 return -EROFS;
9369
9370 INIT_LIST_HEAD(&splice);
9371
573bfb72 9372 mutex_lock(&fs_info->delalloc_root_mutex);
eb73c1b7
MX		 9373 spin_lock(&fs_info->delalloc_root_lock);
9374 list_splice_init(&fs_info->delalloc_roots, &splice);
6c255e67 9375 while (!list_empty(&splice) && nr) {
eb73c1b7
MX		 9376 root = list_first_entry(&splice, struct btrfs_root,
9377 delalloc_root);
9378 root = btrfs_grab_fs_root(root);
9379 BUG_ON(!root);
9380 list_move_tail(&root->delalloc_root,
9381 &fs_info->delalloc_roots);
9382 spin_unlock(&fs_info->delalloc_root_lock);
9383
6c255e67 9384 ret = __start_delalloc_inodes(root, delay_iput, nr);
eb73c1b7 9385 btrfs_put_fs_root(root);
6c255e67 9386 if (ret < 0)
eb73c1b7
MX		 9387 goto out;
9388
6c255e67
MX		 9389 if (nr != -1) {
9390 nr -= ret;
9391 WARN_ON(nr < 0);
9392 }
eb73c1b7 9393 spin_lock(&fs_info->delalloc_root_lock);
8ccf6f19 9394 }
eb73c1b7 9395 spin_unlock(&fs_info->delalloc_root_lock);
1eafa6c7 9396
6c255e67 9397 ret = 0;
eb73c1b7
MX		 9398 atomic_inc(&fs_info->async_submit_draining);
9399 while (atomic_read(&fs_info->nr_async_submits) ||
9400 atomic_read(&fs_info->async_delalloc_pages)) {
9401 wait_event(fs_info->async_submit_wait,
9402 (atomic_read(&fs_info->nr_async_submits) == 0 &&
9403 atomic_read(&fs_info->async_delalloc_pages) == 0));
9404 }
9405 atomic_dec(&fs_info->async_submit_draining);
eb73c1b7 9406out:
1eafa6c7 9407 if (!list_empty_careful(&splice)) {
eb73c1b7
MX		 9408 spin_lock(&fs_info->delalloc_root_lock);
9409 list_splice_tail(&splice, &fs_info->delalloc_roots);
9410 spin_unlock(&fs_info->delalloc_root_lock);
1eafa6c7 9411 }
573bfb72 9412 mutex_unlock(&fs_info->delalloc_root_mutex);
8ccf6f19 9413 return ret;
ea8c2819
CM		 9414}
9415
39279cc3
CM		 9416static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
9417 const char *symname)
9418{
9419 struct btrfs_trans_handle *trans;
9420 struct btrfs_root *root = BTRFS_I(dir)->root;
9421 struct btrfs_path *path;
9422 struct btrfs_key key;
1832a6d5 9423 struct inode *inode = NULL;
39279cc3
CM		 9424 int err;
9425 int drop_inode = 0;
9426 u64 objectid;
67871254 9427 u64 index = 0;
39279cc3
CM		 9428 int name_len;
9429 int datasize;
5f39d397 9430 unsigned long ptr;
39279cc3 9431 struct btrfs_file_extent_item *ei;
5f39d397 9432 struct extent_buffer *leaf;
39279cc3 9433
f06becc4 9434 name_len = strlen(symname);
39279cc3
CM		 9435 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
9436 return -ENAMETOOLONG;
1832a6d5 9437
9ed74f2d
JB		 9438 /*
9439 * 2 items for inode item and ref
9440 * 2 items for dir items
9441 * 1 item for xattr if selinux is on
9442 */
a22285a6
YZ		 9443 trans = btrfs_start_transaction(root, 5);
9444 if (IS_ERR(trans))
9445 return PTR_ERR(trans);
1832a6d5 9446
581bb050
LZ		 9447 err = btrfs_find_free_ino(root, &objectid);
9448 if (err)
9449 goto out_unlock;
9450
aec7477b 9451 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
33345d01 9452 dentry->d_name.len, btrfs_ino(dir), objectid,
d82a6f1d 9453 S_IFLNK|S_IRWXUGO, &index);
7cf96da3
TI		 9454 if (IS_ERR(inode)) {
9455 err = PTR_ERR(inode);
39279cc3 9456 goto out_unlock;
7cf96da3 9457 }
39279cc3 9458
ad19db71
CS		 9459 /*
9460 * If the active LSM wants to access the inode during
9461 * d_instantiate it needs these. Smack checks to see
9462 * if the filesystem supports xattrs by looking at the
9463 * ops vector.
9464 */
9465 inode->i_fop = &btrfs_file_operations;
9466 inode->i_op = &btrfs_file_inode_operations;
b0d5d10f 9467 inode->i_mapping->a_ops = &btrfs_aops;
b0d5d10f
CM		 9468 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
9469
9470 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
9471 if (err)
9472 goto out_unlock_inode;
ad19db71 9473
a1b075d2 9474 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
39279cc3 9475 if (err)
b0d5d10f 9476 goto out_unlock_inode;
39279cc3
CM		 9477
9478 path = btrfs_alloc_path();
d8926bb3
MF		 9479 if (!path) {
9480 err = -ENOMEM;
b0d5d10f 9481 goto out_unlock_inode;
d8926bb3 9482 }
33345d01 9483 key.objectid = btrfs_ino(inode);
39279cc3 9484 key.offset = 0;
962a298f 9485 key.type = BTRFS_EXTENT_DATA_KEY;
39279cc3
CM		 9486 datasize = btrfs_file_extent_calc_inline_size(name_len);
9487 err = btrfs_insert_empty_item(trans, root, path, &key,
9488 datasize);
54aa1f4d 9489 if (err) {
b0839166 9490 btrfs_free_path(path);
b0d5d10f 9491 goto out_unlock_inode;
54aa1f4d 9492 }
5f39d397
CM		 9493 leaf = path->nodes[0];
9494 ei = btrfs_item_ptr(leaf, path->slots[0],
9495 struct btrfs_file_extent_item);
9496 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
9497 btrfs_set_file_extent_type(leaf, ei,
39279cc3 9498 BTRFS_FILE_EXTENT_INLINE);
c8b97818
CM		 9499 btrfs_set_file_extent_encryption(leaf, ei, 0);
9500 btrfs_set_file_extent_compression(leaf, ei, 0);
9501 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
9502 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
9503
39279cc3 9504 ptr = btrfs_file_extent_inline_start(ei);
5f39d397
CM		 9505 write_extent_buffer(leaf, symname, ptr, name_len);
9506 btrfs_mark_buffer_dirty(leaf);
39279cc3 9507 btrfs_free_path(path);
5f39d397 9508
39279cc3
CM		 9509 inode->i_op = &btrfs_symlink_inode_operations;
9510 inode->i_mapping->a_ops = &btrfs_symlink_aops;
d899e052 9511 inode_set_bytes(inode, name_len);
f06becc4 9512 btrfs_i_size_write(inode, name_len);
54aa1f4d 9513 err = btrfs_update_inode(trans, root, inode);
b0d5d10f 9514 if (err) {
54aa1f4d 9515 drop_inode = 1;
b0d5d10f
CM		 9516 goto out_unlock_inode;
9517 }
9518
9519 unlock_new_inode(inode);
9520 d_instantiate(dentry, inode);
39279cc3
CM		 9521
9522out_unlock:
7ad85bb7 9523 btrfs_end_transaction(trans, root);
39279cc3
CM		 9524 if (drop_inode) {
9525 inode_dec_link_count(inode);
9526 iput(inode);
9527 }
b53d3f5d 9528 btrfs_btree_balance_dirty(root);
39279cc3 9529 return err;
b0d5d10f
CM		 9530
9531out_unlock_inode:
9532 drop_inode = 1;
9533 unlock_new_inode(inode);
9534 goto out_unlock;
39279cc3 9535}
16432985 9536
0af3d00b
JB		 9537static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
9538 u64 start, u64 num_bytes, u64 min_size,
9539 loff_t actual_len, u64 *alloc_hint,
9540 struct btrfs_trans_handle *trans)
d899e052 9541{
5dc562c5
JB		 9542 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
9543 struct extent_map *em;
d899e052
YZ		 9544 struct btrfs_root *root = BTRFS_I(inode)->root;
9545 struct btrfs_key ins;
d899e052 9546 u64 cur_offset = start;
55a61d1d 9547 u64 i_size;
154ea289 9548 u64 cur_bytes;
d899e052 9549 int ret = 0;
0af3d00b 9550 bool own_trans = true;
d899e052 9551
0af3d00b
JB		 9552 if (trans)
9553 own_trans = false;
d899e052 9554 while (num_bytes > 0) {
0af3d00b
JB		 9555 if (own_trans) {
9556 trans = btrfs_start_transaction(root, 3);
9557 if (IS_ERR(trans)) {
9558 ret = PTR_ERR(trans);
9559 break;
9560 }
5a303d5d
YZ		 9561 }
9562
154ea289
CM		 9563 cur_bytes = min(num_bytes, 256ULL * 1024 * 1024);
9564 cur_bytes = max(cur_bytes, min_size);
00361589 9565 ret = btrfs_reserve_extent(root, cur_bytes, min_size, 0,
e570fd27 9566 *alloc_hint, &ins, 1, 0);
5a303d5d 9567 if (ret) {
0af3d00b
JB		 9568 if (own_trans)
9569 btrfs_end_transaction(trans, root);
a22285a6 9570 break;
d899e052 9571 }
5a303d5d 9572
d899e052
YZ		 9573 ret = insert_reserved_file_extent(trans, inode,
9574 cur_offset, ins.objectid,
9575 ins.offset, ins.offset,
920bbbfb 9576 ins.offset, 0, 0, 0,
d899e052 9577 BTRFS_FILE_EXTENT_PREALLOC);
79787eaa 9578 if (ret) {
857cc2fc 9579 btrfs_free_reserved_extent(root, ins.objectid,
e570fd27 9580 ins.offset, 0);
79787eaa
JM		 9581 btrfs_abort_transaction(trans, root, ret);
9582 if (own_trans)
9583 btrfs_end_transaction(trans, root);
9584 break;
9585 }
31193213 9586
a1ed835e
CM		 9587 btrfs_drop_extent_cache(inode, cur_offset,
9588 cur_offset + ins.offset -1, 0);
5a303d5d 9589
5dc562c5
JB		 9590 em = alloc_extent_map();
9591 if (!em) {
9592 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
9593 &BTRFS_I(inode)->runtime_flags);
9594 goto next;
9595 }
9596
9597 em->start = cur_offset;
9598 em->orig_start = cur_offset;
9599 em->len = ins.offset;
9600 em->block_start = ins.objectid;
9601 em->block_len = ins.offset;
b4939680 9602 em->orig_block_len = ins.offset;
cc95bef6 9603 em->ram_bytes = ins.offset;
5dc562c5
JB		 9604 em->bdev = root->fs_info->fs_devices->latest_bdev;
9605 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
9606 em->generation = trans->transid;
9607
9608 while (1) {
9609 write_lock(&em_tree->lock);
09a2a8f9 9610 ret = add_extent_mapping(em_tree, em, 1);
5dc562c5
JB		 9611 write_unlock(&em_tree->lock);
9612 if (ret != -EEXIST)
9613 break;
9614 btrfs_drop_extent_cache(inode, cur_offset,
9615 cur_offset + ins.offset - 1,
9616 0);
9617 }
9618 free_extent_map(em);
9619next:
d899e052
YZ		 9620 num_bytes -= ins.offset;
9621 cur_offset += ins.offset;
efa56464 9622 *alloc_hint = ins.objectid + ins.offset;
5a303d5d 9623
0c4d2d95 9624 inode_inc_iversion(inode);
d899e052 9625 inode->i_ctime = CURRENT_TIME;
6cbff00f 9626 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
d899e052 9627 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
efa56464
YZ		 9628 (actual_len > inode->i_size) &&
9629 (cur_offset > inode->i_size)) {
d1ea6a61 9630 if (cur_offset > actual_len)
55a61d1d 9631 i_size = actual_len;
d1ea6a61 9632 else
55a61d1d
JB		 9633 i_size = cur_offset;
9634 i_size_write(inode, i_size);
9635 btrfs_ordered_update_i_size(inode, i_size, NULL);
5a303d5d
YZ		 9636 }
9637
d899e052 9638 ret = btrfs_update_inode(trans, root, inode);
79787eaa
JM		 9639
9640 if (ret) {
9641 btrfs_abort_transaction(trans, root, ret);
9642 if (own_trans)
9643 btrfs_end_transaction(trans, root);
9644 break;
9645 }
d899e052 9646
0af3d00b
JB		 9647 if (own_trans)
9648 btrfs_end_transaction(trans, root);
5a303d5d 9649 }
d899e052
YZ		 9650 return ret;
9651}
9652
0af3d00b
JB		 9653int btrfs_prealloc_file_range(struct inode *inode, int mode,
9654 u64 start, u64 num_bytes, u64 min_size,
9655 loff_t actual_len, u64 *alloc_hint)
9656{
9657 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
9658 min_size, actual_len, alloc_hint,
9659 NULL);
9660}
9661
9662int btrfs_prealloc_file_range_trans(struct inode *inode,
9663 struct btrfs_trans_handle *trans, int mode,
9664 u64 start, u64 num_bytes, u64 min_size,
9665 loff_t actual_len, u64 *alloc_hint)
9666{
9667 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
9668 min_size, actual_len, alloc_hint, trans);
9669}
9670
e6dcd2dc
CM		 9671static int btrfs_set_page_dirty(struct page *page)
9672{
e6dcd2dc
CM		 9673 return __set_page_dirty_nobuffers(page);
9674}
9675
10556cb2 9676static int btrfs_permission(struct inode *inode, int mask)
fdebe2bd 9677{
b83cc969 9678 struct btrfs_root *root = BTRFS_I(inode)->root;
cb6db4e5 9679 umode_t mode = inode->i_mode;
b83cc969 9680
cb6db4e5
JM		 9681 if (mask & MAY_WRITE &&
9682 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
9683 if (btrfs_root_readonly(root))
9684 return -EROFS;
9685 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
9686 return -EACCES;
9687 }
2830ba7f 9688 return generic_permission(inode, mask);
fdebe2bd 9689}
39279cc3 9690
ef3b9af5
FM		 9691static int btrfs_tmpfile(struct inode *dir, struct dentry *dentry, umode_t mode)
9692{
9693 struct btrfs_trans_handle *trans;
9694 struct btrfs_root *root = BTRFS_I(dir)->root;
9695 struct inode *inode = NULL;
9696 u64 objectid;
9697 u64 index;
9698 int ret = 0;
9699
9700 /*
9701 * 5 units required for adding orphan entry
9702 */
9703 trans = btrfs_start_transaction(root, 5);
9704 if (IS_ERR(trans))
9705 return PTR_ERR(trans);
9706
9707 ret = btrfs_find_free_ino(root, &objectid);
9708 if (ret)
9709 goto out;
9710
9711 inode = btrfs_new_inode(trans, root, dir, NULL, 0,
9712 btrfs_ino(dir), objectid, mode, &index);
9713 if (IS_ERR(inode)) {
9714 ret = PTR_ERR(inode);
9715 inode = NULL;
9716 goto out;
9717 }
9718
ef3b9af5
FM		 9719 inode->i_fop = &btrfs_file_operations;
9720 inode->i_op = &btrfs_file_inode_operations;
9721
9722 inode->i_mapping->a_ops = &btrfs_aops;
ef3b9af5
FM		 9723 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
9724
b0d5d10f
CM		 9725 ret = btrfs_init_inode_security(trans, inode, dir, NULL);
9726 if (ret)
9727 goto out_inode;
9728
9729 ret = btrfs_update_inode(trans, root, inode);
9730 if (ret)
9731 goto out_inode;
ef3b9af5
FM		 9732 ret = btrfs_orphan_add(trans, inode);
9733 if (ret)
b0d5d10f 9734 goto out_inode;
ef3b9af5 9735
5762b5c9
FM		 9736 /*
9737 * We set number of links to 0 in btrfs_new_inode(), and here we set
9738 * it to 1 because d_tmpfile() will issue a warning if the count is 0,
9739 * through:
9740 *
9741 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
9742 */
9743 set_nlink(inode, 1);
b0d5d10f 9744 unlock_new_inode(inode);
ef3b9af5
FM		 9745 d_tmpfile(dentry, inode);
9746 mark_inode_dirty(inode);
9747
9748out:
9749 btrfs_end_transaction(trans, root);
9750 if (ret)
9751 iput(inode);
9752 btrfs_balance_delayed_items(root);
9753 btrfs_btree_balance_dirty(root);
ef3b9af5 9754 return ret;
b0d5d10f
CM		 9755
9756out_inode:
9757 unlock_new_inode(inode);
9758 goto out;
9759
ef3b9af5
FM		 9760}
9761
b38ef71c
FM		 9762/* Inspired by filemap_check_errors() */
9763int btrfs_inode_check_errors(struct inode *inode)
9764{
9765 int ret = 0;
9766
9767 if (test_bit(AS_ENOSPC, &inode->i_mapping->flags) &&
9768 test_and_clear_bit(AS_ENOSPC, &inode->i_mapping->flags))
9769 ret = -ENOSPC;
9770 if (test_bit(AS_EIO, &inode->i_mapping->flags) &&
9771 test_and_clear_bit(AS_EIO, &inode->i_mapping->flags))
9772 ret = -EIO;
9773
9774 return ret;
9775}
9776
6e1d5dcc 9777static const struct inode_operations btrfs_dir_inode_operations = {
3394e160 9778 .getattr = btrfs_getattr,
39279cc3
CM		 9779 .lookup = btrfs_lookup,
9780 .create = btrfs_create,
9781 .unlink = btrfs_unlink,
9782 .link = btrfs_link,
9783 .mkdir = btrfs_mkdir,
9784 .rmdir = btrfs_rmdir,
80ace85c 9785 .rename2 = btrfs_rename2,
39279cc3
CM		 9786 .symlink = btrfs_symlink,
9787 .setattr = btrfs_setattr,
618e21d5 9788 .mknod = btrfs_mknod,
95819c05
CH		 9789 .setxattr = btrfs_setxattr,
9790 .getxattr = btrfs_getxattr,
5103e947 9791 .listxattr = btrfs_listxattr,
95819c05 9792 .removexattr = btrfs_removexattr,
fdebe2bd 9793 .permission = btrfs_permission,
4e34e719 9794 .get_acl = btrfs_get_acl,
996a710d 9795 .set_acl = btrfs_set_acl,
93fd63c2 9796 .update_time = btrfs_update_time,
ef3b9af5 9797 .tmpfile = btrfs_tmpfile,
39279cc3 9798};
6e1d5dcc 9799static const struct inode_operations btrfs_dir_ro_inode_operations = {
39279cc3 9800 .lookup = btrfs_lookup,
fdebe2bd 9801 .permission = btrfs_permission,
4e34e719 9802 .get_acl = btrfs_get_acl,
996a710d 9803 .set_acl = btrfs_set_acl,
93fd63c2 9804 .update_time = btrfs_update_time,
39279cc3 9805};
76dda93c 9806
828c0950 9807static const struct file_operations btrfs_dir_file_operations = {
39279cc3
CM		 9808 .llseek = generic_file_llseek,
9809 .read = generic_read_dir,
9cdda8d3 9810 .iterate = btrfs_real_readdir,
34287aa3 9811 .unlocked_ioctl = btrfs_ioctl,
39279cc3 9812#ifdef CONFIG_COMPAT
34287aa3 9813 .compat_ioctl = btrfs_ioctl,
39279cc3 9814#endif
6bf13c0c 9815 .release = btrfs_release_file,
e02119d5 9816 .fsync = btrfs_sync_file,
39279cc3
CM		 9817};
9818
d1310b2e 9819static struct extent_io_ops btrfs_extent_io_ops = {
07157aac 9820 .fill_delalloc = run_delalloc_range,
065631f6 9821 .submit_bio_hook = btrfs_submit_bio_hook,
239b14b3 9822 .merge_bio_hook = btrfs_merge_bio_hook,
07157aac 9823 .readpage_end_io_hook = btrfs_readpage_end_io_hook,
e6dcd2dc 9824 .writepage_end_io_hook = btrfs_writepage_end_io_hook,
247e743c 9825 .writepage_start_hook = btrfs_writepage_start_hook,
b0c68f8b
CM		 9826 .set_bit_hook = btrfs_set_bit_hook,
9827 .clear_bit_hook = btrfs_clear_bit_hook,
9ed74f2d
JB		 9828 .merge_extent_hook = btrfs_merge_extent_hook,
9829 .split_extent_hook = btrfs_split_extent_hook,
07157aac
CM		 9830};
9831
35054394
CM		 9832/*
9833 * btrfs doesn't support the bmap operation because swapfiles
9834 * use bmap to make a mapping of extents in the file. They assume
9835 * these extents won't change over the life of the file and they
9836 * use the bmap result to do IO directly to the drive.
9837 *
9838 * the btrfs bmap call would return logical addresses that aren't
9839 * suitable for IO and they also will change frequently as COW
9840 * operations happen. So, swapfile + btrfs == corruption.
9841 *
9842 * For now we're avoiding this by dropping bmap.
9843 */
7f09410b 9844static const struct address_space_operations btrfs_aops = {
39279cc3
CM		 9845 .readpage = btrfs_readpage,
9846 .writepage = btrfs_writepage,
b293f02e 9847 .writepages = btrfs_writepages,
3ab2fb5a 9848 .readpages = btrfs_readpages,
16432985 9849 .direct_IO = btrfs_direct_IO,
a52d9a80
CM		 9850 .invalidatepage = btrfs_invalidatepage,
9851 .releasepage = btrfs_releasepage,
e6dcd2dc 9852 .set_page_dirty = btrfs_set_page_dirty,
465fdd97 9853 .error_remove_page = generic_error_remove_page,
39279cc3
CM		 9854};
9855
7f09410b 9856static const struct address_space_operations btrfs_symlink_aops = {
39279cc3
CM		 9857 .readpage = btrfs_readpage,
9858 .writepage = btrfs_writepage,
2bf5a725
CM		 9859 .invalidatepage = btrfs_invalidatepage,
9860 .releasepage = btrfs_releasepage,
39279cc3
CM		 9861};
9862
6e1d5dcc 9863static const struct inode_operations btrfs_file_inode_operations = {
39279cc3
CM		 9864 .getattr = btrfs_getattr,
9865 .setattr = btrfs_setattr,
95819c05
CH		 9866 .setxattr = btrfs_setxattr,
9867 .getxattr = btrfs_getxattr,
5103e947 9868 .listxattr = btrfs_listxattr,
95819c05 9869 .removexattr = btrfs_removexattr,
fdebe2bd 9870 .permission = btrfs_permission,
1506fcc8 9871 .fiemap = btrfs_fiemap,
4e34e719 9872 .get_acl = btrfs_get_acl,
996a710d 9873 .set_acl = btrfs_set_acl,
e41f941a 9874 .update_time = btrfs_update_time,
39279cc3 9875};
6e1d5dcc 9876static const struct inode_operations btrfs_special_inode_operations = {
618e21d5
JB		 9877 .getattr = btrfs_getattr,
9878 .setattr = btrfs_setattr,
fdebe2bd 9879 .permission = btrfs_permission,
95819c05
CH		 9880 .setxattr = btrfs_setxattr,
9881 .getxattr = btrfs_getxattr,
33268eaf 9882 .listxattr = btrfs_listxattr,
95819c05 9883 .removexattr = btrfs_removexattr,
4e34e719 9884 .get_acl = btrfs_get_acl,
996a710d 9885 .set_acl = btrfs_set_acl,
e41f941a 9886 .update_time = btrfs_update_time,
618e21d5 9887};
6e1d5dcc 9888static const struct inode_operations btrfs_symlink_inode_operations = {
39279cc3
CM		 9889 .readlink = generic_readlink,
9890 .follow_link = page_follow_link_light,
9891 .put_link = page_put_link,
f209561a 9892 .getattr = btrfs_getattr,
22c44fe6 9893 .setattr = btrfs_setattr,
fdebe2bd 9894 .permission = btrfs_permission,
0279b4cd
JO		 9895 .setxattr = btrfs_setxattr,
9896 .getxattr = btrfs_getxattr,
9897 .listxattr = btrfs_listxattr,
9898 .removexattr = btrfs_removexattr,
e41f941a 9899 .update_time = btrfs_update_time,
39279cc3 9900};
76dda93c 9901
82d339d9 9902const struct dentry_operations btrfs_dentry_operations = {
76dda93c 9903 .d_delete = btrfs_dentry_delete,
b4aff1f8 9904 .d_release = btrfs_dentry_release,
76dda93c 9905};
Linux 6.x block layer and io_uring tree(s)