diff options
Diffstat (limited to 'fs/btrfs')
| -rw-r--r-- | fs/btrfs/acl.c | 6 | ||||
| -rw-r--r-- | fs/btrfs/async-thread.c | 81 | ||||
| -rw-r--r-- | fs/btrfs/async-thread.h | 10 | ||||
| -rw-r--r-- | fs/btrfs/btrfs_inode.h | 18 | ||||
| -rw-r--r-- | fs/btrfs/ctree.h | 19 | ||||
| -rw-r--r-- | fs/btrfs/disk-io.c | 50 | ||||
| -rw-r--r-- | fs/btrfs/extent-tree.c | 252 | ||||
| -rw-r--r-- | fs/btrfs/extent_io.c | 42 | ||||
| -rw-r--r-- | fs/btrfs/extent_io.h | 18 | ||||
| -rw-r--r-- | fs/btrfs/file.c | 44 | ||||
| -rw-r--r-- | fs/btrfs/inode.c | 144 | ||||
| -rw-r--r-- | fs/btrfs/ioctl.c | 7 | ||||
| -rw-r--r-- | fs/btrfs/ordered-data.c | 6 | ||||
| -rw-r--r-- | fs/btrfs/relocation.c | 4 | ||||
| -rw-r--r-- | fs/btrfs/super.c | 9 | ||||
| -rw-r--r-- | fs/btrfs/transaction.c | 45 | ||||
| -rw-r--r-- | fs/btrfs/transaction.h | 5 | ||||
| -rw-r--r-- | fs/btrfs/tree-log.c | 56 | ||||
| -rw-r--r-- | fs/btrfs/tree-log.h | 3 | ||||
| -rw-r--r-- | fs/btrfs/xattr.c | 2 |
20 files changed, 624 insertions, 197 deletions
diff --git a/fs/btrfs/acl.c b/fs/btrfs/acl.c index 69b355ae7f49..361604244271 100644 --- a/fs/btrfs/acl.c +++ b/fs/btrfs/acl.c | |||
| @@ -27,7 +27,7 @@ | |||
| 27 | #include "btrfs_inode.h" | 27 | #include "btrfs_inode.h" |
| 28 | #include "xattr.h" | 28 | #include "xattr.h" |
| 29 | 29 | ||
| 30 | #ifdef CONFIG_BTRFS_POSIX_ACL | 30 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL |
| 31 | 31 | ||
| 32 | static struct posix_acl *btrfs_get_acl(struct inode *inode, int type) | 32 | static struct posix_acl *btrfs_get_acl(struct inode *inode, int type) |
| 33 | { | 33 | { |
| @@ -313,7 +313,7 @@ struct xattr_handler btrfs_xattr_acl_access_handler = { | |||
| 313 | .set = btrfs_xattr_acl_access_set, | 313 | .set = btrfs_xattr_acl_access_set, |
| 314 | }; | 314 | }; |
| 315 | 315 | ||
| 316 | #else /* CONFIG_BTRFS_POSIX_ACL */ | 316 | #else /* CONFIG_BTRFS_FS_POSIX_ACL */ |
| 317 | 317 | ||
| 318 | int btrfs_acl_chmod(struct inode *inode) | 318 | int btrfs_acl_chmod(struct inode *inode) |
| 319 | { | 319 | { |
| @@ -325,4 +325,4 @@ int btrfs_init_acl(struct inode *inode, struct inode *dir) | |||
| 325 | return 0; | 325 | return 0; |
| 326 | } | 326 | } |
| 327 | 327 | ||
| 328 | #endif /* CONFIG_BTRFS_POSIX_ACL */ | 328 | #endif /* CONFIG_BTRFS_FS_POSIX_ACL */ |
diff --git a/fs/btrfs/async-thread.c b/fs/btrfs/async-thread.c index 282ca085c2fb..c0861e781cdb 100644 --- a/fs/btrfs/async-thread.c +++ b/fs/btrfs/async-thread.c | |||
| @@ -64,6 +64,51 @@ struct btrfs_worker_thread { | |||
| 64 | }; | 64 | }; |
| 65 | 65 | ||
| 66 | /* | 66 | /* |
| 67 | * btrfs_start_workers uses kthread_run, which can block waiting for memory | ||
| 68 | * for a very long time. It will actually throttle on page writeback, | ||
| 69 | * and so it may not make progress until after our btrfs worker threads | ||
| 70 | * process all of the pending work structs in their queue | ||
| 71 | * | ||
| 72 | * This means we can't use btrfs_start_workers from inside a btrfs worker | ||
| 73 | * thread that is used as part of cleaning dirty memory, which pretty much | ||
| 74 | * involves all of the worker threads. | ||
| 75 | * | ||
| 76 | * Instead we have a helper queue who never has more than one thread | ||
| 77 | * where we scheduler thread start operations. This worker_start struct | ||
| 78 | * is used to contain the work and hold a pointer to the queue that needs | ||
| 79 | * another worker. | ||
| 80 | */ | ||
| 81 | struct worker_start { | ||
| 82 | struct btrfs_work work; | ||
| 83 | struct btrfs_workers *queue; | ||
| 84 | }; | ||
| 85 | |||
| 86 | static void start_new_worker_func(struct btrfs_work *work) | ||
| 87 | { | ||
| 88 | struct worker_start *start; | ||
| 89 | start = container_of(work, struct worker_start, work); | ||
| 90 | btrfs_start_workers(start->queue, 1); | ||
| 91 | kfree(start); | ||
| 92 | } | ||
| 93 | |||
| 94 | static int start_new_worker(struct btrfs_workers *queue) | ||
| 95 | { | ||
| 96 | struct worker_start *start; | ||
| 97 | int ret; | ||
| 98 | |||
| 99 | start = kzalloc(sizeof(*start), GFP_NOFS); | ||
| 100 | if (!start) | ||
| 101 | return -ENOMEM; | ||
| 102 | |||
| 103 | start->work.func = start_new_worker_func; | ||
| 104 | start->queue = queue; | ||
| 105 | ret = btrfs_queue_worker(queue->atomic_worker_start, &start->work); | ||
| 106 | if (ret) | ||
| 107 | kfree(start); | ||
| 108 | return ret; | ||
| 109 | } | ||
| 110 | |||
| 111 | /* | ||
| 67 | * helper function to move a thread onto the idle list after it | 112 | * helper function to move a thread onto the idle list after it |
| 68 | * has finished some requests. | 113 | * has finished some requests. |
| 69 | */ | 114 | */ |
| @@ -118,11 +163,13 @@ static void check_pending_worker_creates(struct btrfs_worker_thread *worker) | |||
| 118 | goto out; | 163 | goto out; |
| 119 | 164 | ||
| 120 | workers->atomic_start_pending = 0; | 165 | workers->atomic_start_pending = 0; |
| 121 | if (workers->num_workers >= workers->max_workers) | 166 | if (workers->num_workers + workers->num_workers_starting >= |
| 167 | workers->max_workers) | ||
| 122 | goto out; | 168 | goto out; |
| 123 | 169 | ||
| 170 | workers->num_workers_starting += 1; | ||
| 124 | spin_unlock_irqrestore(&workers->lock, flags); | 171 | spin_unlock_irqrestore(&workers->lock, flags); |
| 125 | btrfs_start_workers(workers, 1); | 172 | start_new_worker(workers); |
| 126 | return; | 173 | return; |
| 127 | 174 | ||
| 128 | out: | 175 | out: |
| @@ -390,9 +437,11 @@ int btrfs_stop_workers(struct btrfs_workers *workers) | |||
| 390 | /* | 437 | /* |
| 391 | * simple init on struct btrfs_workers | 438 | * simple init on struct btrfs_workers |
| 392 | */ | 439 | */ |
| 393 | void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max) | 440 | void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max, |
| 441 | struct btrfs_workers *async_helper) | ||
| 394 | { | 442 | { |
| 395 | workers->num_workers = 0; | 443 | workers->num_workers = 0; |
| 444 | workers->num_workers_starting = 0; | ||
| 396 | INIT_LIST_HEAD(&workers->worker_list); | 445 | INIT_LIST_HEAD(&workers->worker_list); |
| 397 | INIT_LIST_HEAD(&workers->idle_list); | 446 | INIT_LIST_HEAD(&workers->idle_list); |
| 398 | INIT_LIST_HEAD(&workers->order_list); | 447 | INIT_LIST_HEAD(&workers->order_list); |
| @@ -404,14 +453,15 @@ void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max) | |||
| 404 | workers->name = name; | 453 | workers->name = name; |
| 405 | workers->ordered = 0; | 454 | workers->ordered = 0; |
| 406 | workers->atomic_start_pending = 0; | 455 | workers->atomic_start_pending = 0; |
| 407 | workers->atomic_worker_start = 0; | 456 | workers->atomic_worker_start = async_helper; |
| 408 | } | 457 | } |
| 409 | 458 | ||
| 410 | /* | 459 | /* |
| 411 | * starts new worker threads. This does not enforce the max worker | 460 | * starts new worker threads. This does not enforce the max worker |
| 412 | * count in case you need to temporarily go past it. | 461 | * count in case you need to temporarily go past it. |
| 413 | */ | 462 | */ |
| 414 | int btrfs_start_workers(struct btrfs_workers *workers, int num_workers) | 463 | static int __btrfs_start_workers(struct btrfs_workers *workers, |
| 464 | int num_workers) | ||
| 415 | { | 465 | { |
| 416 | struct btrfs_worker_thread *worker; | 466 | struct btrfs_worker_thread *worker; |
| 417 | int ret = 0; | 467 | int ret = 0; |
| @@ -444,6 +494,8 @@ int btrfs_start_workers(struct btrfs_workers *workers, int num_workers) | |||
| 444 | list_add_tail(&worker->worker_list, &workers->idle_list); | 494 | list_add_tail(&worker->worker_list, &workers->idle_list); |
| 445 | worker->idle = 1; | 495 | worker->idle = 1; |
| 446 | workers->num_workers++; | 496 | workers->num_workers++; |
| 497 | workers->num_workers_starting--; | ||
| 498 | WARN_ON(workers->num_workers_starting < 0); | ||
| 447 | spin_unlock_irq(&workers->lock); | 499 | spin_unlock_irq(&workers->lock); |
| 448 | } | 500 | } |
| 449 | return 0; | 501 | return 0; |
| @@ -452,6 +504,14 @@ fail: | |||
| 452 | return ret; | 504 | return ret; |
| 453 | } | 505 | } |
| 454 | 506 | ||
| 507 | int btrfs_start_workers(struct btrfs_workers *workers, int num_workers) | ||
| 508 | { | ||
| 509 | spin_lock_irq(&workers->lock); | ||
| 510 | workers->num_workers_starting += num_workers; | ||
| 511 | spin_unlock_irq(&workers->lock); | ||
| 512 | return __btrfs_start_workers(workers, num_workers); | ||
| 513 | } | ||
| 514 | |||
| 455 | /* | 515 | /* |
| 456 | * run through the list and find a worker thread that doesn't have a lot | 516 | * run through the list and find a worker thread that doesn't have a lot |
| 457 | * to do right now. This can return null if we aren't yet at the thread | 517 | * to do right now. This can return null if we aren't yet at the thread |
| @@ -461,7 +521,10 @@ static struct btrfs_worker_thread *next_worker(struct btrfs_workers *workers) | |||
| 461 | { | 521 | { |
| 462 | struct btrfs_worker_thread *worker; | 522 | struct btrfs_worker_thread *worker; |
| 463 | struct list_head *next; | 523 | struct list_head *next; |
| 464 | int enforce_min = workers->num_workers < workers->max_workers; | 524 | int enforce_min; |
| 525 | |||
| 526 | enforce_min = (workers->num_workers + workers->num_workers_starting) < | ||
| 527 | workers->max_workers; | ||
| 465 | 528 | ||
| 466 | /* | 529 | /* |
| 467 | * if we find an idle thread, don't move it to the end of the | 530 | * if we find an idle thread, don't move it to the end of the |
| @@ -509,15 +572,17 @@ again: | |||
| 509 | worker = next_worker(workers); | 572 | worker = next_worker(workers); |
| 510 | 573 | ||
| 511 | if (!worker) { | 574 | if (!worker) { |
| 512 | if (workers->num_workers >= workers->max_workers) { | 575 | if (workers->num_workers + workers->num_workers_starting >= |
| 576 | workers->max_workers) { | ||
| 513 | goto fallback; | 577 | goto fallback; |
| 514 | } else if (workers->atomic_worker_start) { | 578 | } else if (workers->atomic_worker_start) { |
| 515 | workers->atomic_start_pending = 1; | 579 | workers->atomic_start_pending = 1; |
| 516 | goto fallback; | 580 | goto fallback; |
| 517 | } else { | 581 | } else { |
| 582 | workers->num_workers_starting++; | ||
| 518 | spin_unlock_irqrestore(&workers->lock, flags); | 583 | spin_unlock_irqrestore(&workers->lock, flags); |
| 519 | /* we're below the limit, start another worker */ | 584 | /* we're below the limit, start another worker */ |
| 520 | btrfs_start_workers(workers, 1); | 585 | __btrfs_start_workers(workers, 1); |
| 521 | goto again; | 586 | goto again; |
| 522 | } | 587 | } |
| 523 | } | 588 | } |
diff --git a/fs/btrfs/async-thread.h b/fs/btrfs/async-thread.h index fc089b95ec14..5077746cf85e 100644 --- a/fs/btrfs/async-thread.h +++ b/fs/btrfs/async-thread.h | |||
| @@ -64,6 +64,8 @@ struct btrfs_workers { | |||
| 64 | /* current number of running workers */ | 64 | /* current number of running workers */ |
| 65 | int num_workers; | 65 | int num_workers; |
| 66 | 66 | ||
| 67 | int num_workers_starting; | ||
| 68 | |||
| 67 | /* max number of workers allowed. changed by btrfs_start_workers */ | 69 | /* max number of workers allowed. changed by btrfs_start_workers */ |
| 68 | int max_workers; | 70 | int max_workers; |
| 69 | 71 | ||
| @@ -78,9 +80,10 @@ struct btrfs_workers { | |||
| 78 | 80 | ||
| 79 | /* | 81 | /* |
| 80 | * are we allowed to sleep while starting workers or are we required | 82 | * are we allowed to sleep while starting workers or are we required |
| 81 | * to start them at a later time? | 83 | * to start them at a later time? If we can't sleep, this indicates |
| 84 | * which queue we need to use to schedule thread creation. | ||
| 82 | */ | 85 | */ |
| 83 | int atomic_worker_start; | 86 | struct btrfs_workers *atomic_worker_start; |
| 84 | 87 | ||
| 85 | /* list with all the work threads. The workers on the idle thread | 88 | /* list with all the work threads. The workers on the idle thread |
| 86 | * may be actively servicing jobs, but they haven't yet hit the | 89 | * may be actively servicing jobs, but they haven't yet hit the |
| @@ -109,7 +112,8 @@ struct btrfs_workers { | |||
| 109 | int btrfs_queue_worker(struct btrfs_workers *workers, struct btrfs_work *work); | 112 | int btrfs_queue_worker(struct btrfs_workers *workers, struct btrfs_work *work); |
| 110 | int btrfs_start_workers(struct btrfs_workers *workers, int num_workers); | 113 | int btrfs_start_workers(struct btrfs_workers *workers, int num_workers); |
| 111 | int btrfs_stop_workers(struct btrfs_workers *workers); | 114 | int btrfs_stop_workers(struct btrfs_workers *workers); |
| 112 | void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max); | 115 | void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max, |
| 116 | struct btrfs_workers *async_starter); | ||
| 113 | int btrfs_requeue_work(struct btrfs_work *work); | 117 | int btrfs_requeue_work(struct btrfs_work *work); |
| 114 | void btrfs_set_work_high_prio(struct btrfs_work *work); | 118 | void btrfs_set_work_high_prio(struct btrfs_work *work); |
| 115 | #endif | 119 | #endif |
diff --git a/fs/btrfs/btrfs_inode.h b/fs/btrfs/btrfs_inode.h index a54d354cefcb..f6783a42f010 100644 --- a/fs/btrfs/btrfs_inode.h +++ b/fs/btrfs/btrfs_inode.h | |||
| @@ -86,6 +86,12 @@ struct btrfs_inode { | |||
| 86 | * transid of the trans_handle that last modified this inode | 86 | * transid of the trans_handle that last modified this inode |
| 87 | */ | 87 | */ |
| 88 | u64 last_trans; | 88 | u64 last_trans; |
| 89 | |||
| 90 | /* | ||
| 91 | * log transid when this inode was last modified | ||
| 92 | */ | ||
| 93 | u64 last_sub_trans; | ||
| 94 | |||
| 89 | /* | 95 | /* |
| 90 | * transid that last logged this inode | 96 | * transid that last logged this inode |
| 91 | */ | 97 | */ |
| @@ -128,12 +134,14 @@ struct btrfs_inode { | |||
| 128 | u64 last_unlink_trans; | 134 | u64 last_unlink_trans; |
| 129 | 135 | ||
| 130 | /* | 136 | /* |
| 131 | * These two counters are for delalloc metadata reservations. We keep | 137 | * Counters to keep track of the number of extent item's we may use due |
| 132 | * track of how many extents we've accounted for vs how many extents we | 138 | * to delalloc and such. outstanding_extents is the number of extent |
| 133 | * have. | 139 | * items we think we'll end up using, and reserved_extents is the number |
| 140 | * of extent items we've reserved metadata for. | ||
| 134 | */ | 141 | */ |
| 135 | int delalloc_reserved_extents; | 142 | spinlock_t accounting_lock; |
| 136 | int delalloc_extents; | 143 | int reserved_extents; |
| 144 | int outstanding_extents; | ||
| 137 | 145 | ||
| 138 | /* | 146 | /* |
| 139 | * ordered_data_close is set by truncate when a file that used | 147 | * ordered_data_close is set by truncate when a file that used |
diff --git a/fs/btrfs/ctree.h b/fs/btrfs/ctree.h index dd8ced9814c4..444b3e9b92a4 100644 --- a/fs/btrfs/ctree.h +++ b/fs/btrfs/ctree.h | |||
| @@ -691,14 +691,17 @@ struct btrfs_space_info { | |||
| 691 | 691 | ||
| 692 | struct list_head list; | 692 | struct list_head list; |
| 693 | 693 | ||
| 694 | /* for controlling how we free up space for allocations */ | ||
| 695 | wait_queue_head_t allocate_wait; | ||
| 696 | wait_queue_head_t flush_wait; | ||
| 697 | int allocating_chunk; | ||
| 698 | int flushing; | ||
| 699 | |||
| 694 | /* for block groups in our same type */ | 700 | /* for block groups in our same type */ |
| 695 | struct list_head block_groups; | 701 | struct list_head block_groups; |
| 696 | spinlock_t lock; | 702 | spinlock_t lock; |
| 697 | struct rw_semaphore groups_sem; | 703 | struct rw_semaphore groups_sem; |
| 698 | atomic_t caching_threads; | 704 | atomic_t caching_threads; |
| 699 | |||
| 700 | int allocating_chunk; | ||
| 701 | wait_queue_head_t wait; | ||
| 702 | }; | 705 | }; |
| 703 | 706 | ||
| 704 | /* | 707 | /* |
| @@ -907,6 +910,7 @@ struct btrfs_fs_info { | |||
| 907 | * A third pool does submit_bio to avoid deadlocking with the other | 910 | * A third pool does submit_bio to avoid deadlocking with the other |
| 908 | * two | 911 | * two |
| 909 | */ | 912 | */ |
| 913 | struct btrfs_workers generic_worker; | ||
| 910 | struct btrfs_workers workers; | 914 | struct btrfs_workers workers; |
| 911 | struct btrfs_workers delalloc_workers; | 915 | struct btrfs_workers delalloc_workers; |
| 912 | struct btrfs_workers endio_workers; | 916 | struct btrfs_workers endio_workers; |
| @@ -914,6 +918,7 @@ struct btrfs_fs_info { | |||
| 914 | struct btrfs_workers endio_meta_write_workers; | 918 | struct btrfs_workers endio_meta_write_workers; |
| 915 | struct btrfs_workers endio_write_workers; | 919 | struct btrfs_workers endio_write_workers; |
| 916 | struct btrfs_workers submit_workers; | 920 | struct btrfs_workers submit_workers; |
| 921 | struct btrfs_workers enospc_workers; | ||
| 917 | /* | 922 | /* |
| 918 | * fixup workers take dirty pages that didn't properly go through | 923 | * fixup workers take dirty pages that didn't properly go through |
| 919 | * the cow mechanism and make them safe to write. It happens | 924 | * the cow mechanism and make them safe to write. It happens |
| @@ -1004,7 +1009,10 @@ struct btrfs_root { | |||
| 1004 | atomic_t log_writers; | 1009 | atomic_t log_writers; |
| 1005 | atomic_t log_commit[2]; | 1010 | atomic_t log_commit[2]; |
| 1006 | unsigned long log_transid; | 1011 | unsigned long log_transid; |
| 1012 | unsigned long last_log_commit; | ||
| 1007 | unsigned long log_batch; | 1013 | unsigned long log_batch; |
| 1014 | pid_t log_start_pid; | ||
| 1015 | bool log_multiple_pids; | ||
| 1008 | 1016 | ||
| 1009 | u64 objectid; | 1017 | u64 objectid; |
| 1010 | u64 last_trans; | 1018 | u64 last_trans; |
| @@ -1145,6 +1153,7 @@ struct btrfs_root { | |||
| 1145 | #define BTRFS_MOUNT_FLUSHONCOMMIT (1 << 7) | 1153 | #define BTRFS_MOUNT_FLUSHONCOMMIT (1 << 7) |
| 1146 | #define BTRFS_MOUNT_SSD_SPREAD (1 << 8) | 1154 | #define BTRFS_MOUNT_SSD_SPREAD (1 << 8) |
| 1147 | #define BTRFS_MOUNT_NOSSD (1 << 9) | 1155 | #define BTRFS_MOUNT_NOSSD (1 << 9) |
| 1156 | #define BTRFS_MOUNT_DISCARD (1 << 10) | ||
| 1148 | 1157 | ||
| 1149 | #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt) | 1158 | #define btrfs_clear_opt(o, opt) ((o) &= ~BTRFS_MOUNT_##opt) |
| 1150 | #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt) | 1159 | #define btrfs_set_opt(o, opt) ((o) |= BTRFS_MOUNT_##opt) |
| @@ -2323,7 +2332,7 @@ int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode); | |||
| 2323 | void btrfs_orphan_cleanup(struct btrfs_root *root); | 2332 | void btrfs_orphan_cleanup(struct btrfs_root *root); |
| 2324 | int btrfs_cont_expand(struct inode *inode, loff_t size); | 2333 | int btrfs_cont_expand(struct inode *inode, loff_t size); |
| 2325 | int btrfs_invalidate_inodes(struct btrfs_root *root); | 2334 | int btrfs_invalidate_inodes(struct btrfs_root *root); |
| 2326 | extern struct dentry_operations btrfs_dentry_operations; | 2335 | extern const struct dentry_operations btrfs_dentry_operations; |
| 2327 | 2336 | ||
| 2328 | /* ioctl.c */ | 2337 | /* ioctl.c */ |
| 2329 | long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); | 2338 | long btrfs_ioctl(struct file *file, unsigned int cmd, unsigned long arg); |
| @@ -2366,7 +2375,7 @@ int btrfs_parse_options(struct btrfs_root *root, char *options); | |||
| 2366 | int btrfs_sync_fs(struct super_block *sb, int wait); | 2375 | int btrfs_sync_fs(struct super_block *sb, int wait); |
| 2367 | 2376 | ||
| 2368 | /* acl.c */ | 2377 | /* acl.c */ |
| 2369 | #ifdef CONFIG_BTRFS_POSIX_ACL | 2378 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL |
| 2370 | int btrfs_check_acl(struct inode *inode, int mask); | 2379 | int btrfs_check_acl(struct inode *inode, int mask); |
| 2371 | #else | 2380 | #else |
| 2372 | #define btrfs_check_acl NULL | 2381 | #define btrfs_check_acl NULL |
diff --git a/fs/btrfs/disk-io.c b/fs/btrfs/disk-io.c index af0435f79fa6..02b6afbd7450 100644 --- a/fs/btrfs/disk-io.c +++ b/fs/btrfs/disk-io.c | |||
| @@ -917,6 +917,7 @@ static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, | |||
| 917 | atomic_set(&root->log_writers, 0); | 917 | atomic_set(&root->log_writers, 0); |
| 918 | root->log_batch = 0; | 918 | root->log_batch = 0; |
| 919 | root->log_transid = 0; | 919 | root->log_transid = 0; |
| 920 | root->last_log_commit = 0; | ||
| 920 | extent_io_tree_init(&root->dirty_log_pages, | 921 | extent_io_tree_init(&root->dirty_log_pages, |
| 921 | fs_info->btree_inode->i_mapping, GFP_NOFS); | 922 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
| 922 | 923 | ||
| @@ -1087,6 +1088,7 @@ int btrfs_add_log_tree(struct btrfs_trans_handle *trans, | |||
| 1087 | WARN_ON(root->log_root); | 1088 | WARN_ON(root->log_root); |
| 1088 | root->log_root = log_root; | 1089 | root->log_root = log_root; |
| 1089 | root->log_transid = 0; | 1090 | root->log_transid = 0; |
| 1091 | root->last_log_commit = 0; | ||
| 1090 | return 0; | 1092 | return 0; |
| 1091 | } | 1093 | } |
| 1092 | 1094 | ||
| @@ -1746,21 +1748,25 @@ struct btrfs_root *open_ctree(struct super_block *sb, | |||
| 1746 | err = -EINVAL; | 1748 | err = -EINVAL; |
| 1747 | goto fail_iput; | 1749 | goto fail_iput; |
| 1748 | } | 1750 | } |
| 1749 | printk("thread pool is %d\n", fs_info->thread_pool_size); | 1751 | |
| 1750 | /* | 1752 | btrfs_init_workers(&fs_info->generic_worker, |
| 1751 | * we need to start all the end_io workers up front because the | 1753 | "genwork", 1, NULL); |
| 1752 | * queue work function gets called at interrupt time, and so it | 1754 | |
| 1753 | * cannot dynamically grow. | ||
| 1754 | */ | ||
| 1755 | btrfs_init_workers(&fs_info->workers, "worker", | 1755 | btrfs_init_workers(&fs_info->workers, "worker", |
| 1756 | fs_info->thread_pool_size); | 1756 | fs_info->thread_pool_size, |
| 1757 | &fs_info->generic_worker); | ||
| 1757 | 1758 | ||
| 1758 | btrfs_init_workers(&fs_info->delalloc_workers, "delalloc", | 1759 | btrfs_init_workers(&fs_info->delalloc_workers, "delalloc", |
| 1759 | fs_info->thread_pool_size); | 1760 | fs_info->thread_pool_size, |
| 1761 | &fs_info->generic_worker); | ||
| 1760 | 1762 | ||
| 1761 | btrfs_init_workers(&fs_info->submit_workers, "submit", | 1763 | btrfs_init_workers(&fs_info->submit_workers, "submit", |
| 1762 | min_t(u64, fs_devices->num_devices, | 1764 | min_t(u64, fs_devices->num_devices, |
| 1763 | fs_info->thread_pool_size)); | 1765 | fs_info->thread_pool_size), |
| 1766 | &fs_info->generic_worker); | ||
| 1767 | btrfs_init_workers(&fs_info->enospc_workers, "enospc", | ||
| 1768 | fs_info->thread_pool_size, | ||
| 1769 | &fs_info->generic_worker); | ||
| 1764 | 1770 | ||
| 1765 | /* a higher idle thresh on the submit workers makes it much more | 1771 | /* a higher idle thresh on the submit workers makes it much more |
| 1766 | * likely that bios will be send down in a sane order to the | 1772 | * likely that bios will be send down in a sane order to the |
| @@ -1774,15 +1780,20 @@ printk("thread pool is %d\n", fs_info->thread_pool_size); | |||
| 1774 | fs_info->delalloc_workers.idle_thresh = 2; | 1780 | fs_info->delalloc_workers.idle_thresh = 2; |
| 1775 | fs_info->delalloc_workers.ordered = 1; | 1781 | fs_info->delalloc_workers.ordered = 1; |
| 1776 | 1782 | ||
| 1777 | btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1); | 1783 | btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1, |
| 1784 | &fs_info->generic_worker); | ||
| 1778 | btrfs_init_workers(&fs_info->endio_workers, "endio", | 1785 | btrfs_init_workers(&fs_info->endio_workers, "endio", |
| 1779 | fs_info->thread_pool_size); | 1786 | fs_info->thread_pool_size, |
| 1787 | &fs_info->generic_worker); | ||
| 1780 | btrfs_init_workers(&fs_info->endio_meta_workers, "endio-meta", | 1788 | btrfs_init_workers(&fs_info->endio_meta_workers, "endio-meta", |
| 1781 | fs_info->thread_pool_size); | 1789 | fs_info->thread_pool_size, |
| 1790 | &fs_info->generic_worker); | ||
| 1782 | btrfs_init_workers(&fs_info->endio_meta_write_workers, | 1791 | btrfs_init_workers(&fs_info->endio_meta_write_workers, |
| 1783 | "endio-meta-write", fs_info->thread_pool_size); | 1792 | "endio-meta-write", fs_info->thread_pool_size, |
| 1793 | &fs_info->generic_worker); | ||
| 1784 | btrfs_init_workers(&fs_info->endio_write_workers, "endio-write", | 1794 | btrfs_init_workers(&fs_info->endio_write_workers, "endio-write", |
| 1785 | fs_info->thread_pool_size); | 1795 | fs_info->thread_pool_size, |
| 1796 | &fs_info->generic_worker); | ||
| 1786 | 1797 | ||
| 1787 | /* | 1798 | /* |
| 1788 | * endios are largely parallel and should have a very | 1799 | * endios are largely parallel and should have a very |
| @@ -1794,12 +1805,8 @@ printk("thread pool is %d\n", fs_info->thread_pool_size); | |||
| 1794 | fs_info->endio_write_workers.idle_thresh = 2; | 1805 | fs_info->endio_write_workers.idle_thresh = 2; |
| 1795 | fs_info->endio_meta_write_workers.idle_thresh = 2; | 1806 | fs_info->endio_meta_write_workers.idle_thresh = 2; |
| 1796 | 1807 | ||
| 1797 | fs_info->endio_workers.atomic_worker_start = 1; | ||
| 1798 | fs_info->endio_meta_workers.atomic_worker_start = 1; | ||
| 1799 | fs_info->endio_write_workers.atomic_worker_start = 1; | ||
| 1800 | fs_info->endio_meta_write_workers.atomic_worker_start = 1; | ||
| 1801 | |||
| 1802 | btrfs_start_workers(&fs_info->workers, 1); | 1808 | btrfs_start_workers(&fs_info->workers, 1); |
| 1809 | btrfs_start_workers(&fs_info->generic_worker, 1); | ||
| 1803 | btrfs_start_workers(&fs_info->submit_workers, 1); | 1810 | btrfs_start_workers(&fs_info->submit_workers, 1); |
| 1804 | btrfs_start_workers(&fs_info->delalloc_workers, 1); | 1811 | btrfs_start_workers(&fs_info->delalloc_workers, 1); |
| 1805 | btrfs_start_workers(&fs_info->fixup_workers, 1); | 1812 | btrfs_start_workers(&fs_info->fixup_workers, 1); |
| @@ -1807,6 +1814,7 @@ printk("thread pool is %d\n", fs_info->thread_pool_size); | |||
| 1807 | btrfs_start_workers(&fs_info->endio_meta_workers, 1); | 1814 | btrfs_start_workers(&fs_info->endio_meta_workers, 1); |
| 1808 | btrfs_start_workers(&fs_info->endio_meta_write_workers, 1); | 1815 | btrfs_start_workers(&fs_info->endio_meta_write_workers, 1); |
| 1809 | btrfs_start_workers(&fs_info->endio_write_workers, 1); | 1816 | btrfs_start_workers(&fs_info->endio_write_workers, 1); |
| 1817 | btrfs_start_workers(&fs_info->enospc_workers, 1); | ||
| 1810 | 1818 | ||
| 1811 | fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super); | 1819 | fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super); |
| 1812 | fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages, | 1820 | fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages, |
| @@ -2012,6 +2020,7 @@ fail_chunk_root: | |||
| 2012 | free_extent_buffer(chunk_root->node); | 2020 | free_extent_buffer(chunk_root->node); |
| 2013 | free_extent_buffer(chunk_root->commit_root); | 2021 | free_extent_buffer(chunk_root->commit_root); |
| 2014 | fail_sb_buffer: | 2022 | fail_sb_buffer: |
| 2023 | btrfs_stop_workers(&fs_info->generic_worker); | ||
| 2015 | btrfs_stop_workers(&fs_info->fixup_workers); | 2024 | btrfs_stop_workers(&fs_info->fixup_workers); |
| 2016 | btrfs_stop_workers(&fs_info->delalloc_workers); | 2025 | btrfs_stop_workers(&fs_info->delalloc_workers); |
| 2017 | btrfs_stop_workers(&fs_info->workers); | 2026 | btrfs_stop_workers(&fs_info->workers); |
| @@ -2020,6 +2029,7 @@ fail_sb_buffer: | |||
| 2020 | btrfs_stop_workers(&fs_info->endio_meta_write_workers); | 2029 | btrfs_stop_workers(&fs_info->endio_meta_write_workers); |
| 2021 | btrfs_stop_workers(&fs_info->endio_write_workers); | 2030 | btrfs_stop_workers(&fs_info->endio_write_workers); |
| 2022 | btrfs_stop_workers(&fs_info->submit_workers); | 2031 | btrfs_stop_workers(&fs_info->submit_workers); |
| 2032 | btrfs_stop_workers(&fs_info->enospc_workers); | ||
| 2023 | fail_iput: | 2033 | fail_iput: |
| 2024 | invalidate_inode_pages2(fs_info->btree_inode->i_mapping); | 2034 | invalidate_inode_pages2(fs_info->btree_inode->i_mapping); |
| 2025 | iput(fs_info->btree_inode); | 2035 | iput(fs_info->btree_inode); |
| @@ -2437,6 +2447,7 @@ int close_ctree(struct btrfs_root *root) | |||
| 2437 | 2447 | ||
| 2438 | iput(fs_info->btree_inode); | 2448 | iput(fs_info->btree_inode); |
| 2439 | 2449 | ||
| 2450 | btrfs_stop_workers(&fs_info->generic_worker); | ||
| 2440 | btrfs_stop_workers(&fs_info->fixup_workers); | 2451 | btrfs_stop_workers(&fs_info->fixup_workers); |
| 2441 | btrfs_stop_workers(&fs_info->delalloc_workers); | 2452 | btrfs_stop_workers(&fs_info->delalloc_workers); |
| 2442 | btrfs_stop_workers(&fs_info->workers); | 2453 | btrfs_stop_workers(&fs_info->workers); |
| @@ -2445,6 +2456,7 @@ int close_ctree(struct btrfs_root *root) | |||
| 2445 | btrfs_stop_workers(&fs_info->endio_meta_write_workers); | 2456 | btrfs_stop_workers(&fs_info->endio_meta_write_workers); |
| 2446 | btrfs_stop_workers(&fs_info->endio_write_workers); | 2457 | btrfs_stop_workers(&fs_info->endio_write_workers); |
| 2447 | btrfs_stop_workers(&fs_info->submit_workers); | 2458 | btrfs_stop_workers(&fs_info->submit_workers); |
| 2459 | btrfs_stop_workers(&fs_info->enospc_workers); | ||
| 2448 | 2460 | ||
| 2449 | btrfs_close_devices(fs_info->fs_devices); | 2461 | btrfs_close_devices(fs_info->fs_devices); |
| 2450 | btrfs_mapping_tree_free(&fs_info->mapping_tree); | 2462 | btrfs_mapping_tree_free(&fs_info->mapping_tree); |
diff --git a/fs/btrfs/extent-tree.c b/fs/btrfs/extent-tree.c index 359a754c782c..e238a0cdac67 100644 --- a/fs/btrfs/extent-tree.c +++ b/fs/btrfs/extent-tree.c | |||
| @@ -1568,23 +1568,23 @@ static int remove_extent_backref(struct btrfs_trans_handle *trans, | |||
| 1568 | return ret; | 1568 | return ret; |
| 1569 | } | 1569 | } |
| 1570 | 1570 | ||
| 1571 | #ifdef BIO_RW_DISCARD | ||
| 1572 | static void btrfs_issue_discard(struct block_device *bdev, | 1571 | static void btrfs_issue_discard(struct block_device *bdev, |
| 1573 | u64 start, u64 len) | 1572 | u64 start, u64 len) |
| 1574 | { | 1573 | { |
| 1575 | blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_KERNEL, | 1574 | blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_KERNEL, |
| 1576 | DISCARD_FL_BARRIER); | 1575 | DISCARD_FL_BARRIER); |
| 1577 | } | 1576 | } |
| 1578 | #endif | ||
| 1579 | 1577 | ||
| 1580 | static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr, | 1578 | static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr, |
| 1581 | u64 num_bytes) | 1579 | u64 num_bytes) |
| 1582 | { | 1580 | { |
| 1583 | #ifdef BIO_RW_DISCARD | ||
| 1584 | int ret; | 1581 | int ret; |
| 1585 | u64 map_length = num_bytes; | 1582 | u64 map_length = num_bytes; |
| 1586 | struct btrfs_multi_bio *multi = NULL; | 1583 | struct btrfs_multi_bio *multi = NULL; |
| 1587 | 1584 | ||
| 1585 | if (!btrfs_test_opt(root, DISCARD)) | ||
| 1586 | return 0; | ||
| 1587 | |||
| 1588 | /* Tell the block device(s) that the sectors can be discarded */ | 1588 | /* Tell the block device(s) that the sectors can be discarded */ |
| 1589 | ret = btrfs_map_block(&root->fs_info->mapping_tree, READ, | 1589 | ret = btrfs_map_block(&root->fs_info->mapping_tree, READ, |
| 1590 | bytenr, &map_length, &multi, 0); | 1590 | bytenr, &map_length, &multi, 0); |
| @@ -1604,9 +1604,6 @@ static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr, | |||
| 1604 | } | 1604 | } |
| 1605 | 1605 | ||
| 1606 | return ret; | 1606 | return ret; |
| 1607 | #else | ||
| 1608 | return 0; | ||
| 1609 | #endif | ||
| 1610 | } | 1607 | } |
| 1611 | 1608 | ||
| 1612 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, | 1609 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
| @@ -2824,14 +2821,17 @@ int btrfs_unreserve_metadata_for_delalloc(struct btrfs_root *root, | |||
| 2824 | num_items); | 2821 | num_items); |
| 2825 | 2822 | ||
| 2826 | spin_lock(&meta_sinfo->lock); | 2823 | spin_lock(&meta_sinfo->lock); |
| 2827 | if (BTRFS_I(inode)->delalloc_reserved_extents <= | 2824 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 2828 | BTRFS_I(inode)->delalloc_extents) { | 2825 | if (BTRFS_I(inode)->reserved_extents <= |
| 2826 | BTRFS_I(inode)->outstanding_extents) { | ||
| 2827 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 2829 | spin_unlock(&meta_sinfo->lock); | 2828 | spin_unlock(&meta_sinfo->lock); |
| 2830 | return 0; | 2829 | return 0; |
| 2831 | } | 2830 | } |
| 2831 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 2832 | 2832 | ||
| 2833 | BTRFS_I(inode)->delalloc_reserved_extents--; | 2833 | BTRFS_I(inode)->reserved_extents--; |
| 2834 | BUG_ON(BTRFS_I(inode)->delalloc_reserved_extents < 0); | 2834 | BUG_ON(BTRFS_I(inode)->reserved_extents < 0); |
| 2835 | 2835 | ||
| 2836 | if (meta_sinfo->bytes_delalloc < num_bytes) { | 2836 | if (meta_sinfo->bytes_delalloc < num_bytes) { |
| 2837 | bug = true; | 2837 | bug = true; |
| @@ -2864,6 +2864,107 @@ static void check_force_delalloc(struct btrfs_space_info *meta_sinfo) | |||
| 2864 | meta_sinfo->force_delalloc = 0; | 2864 | meta_sinfo->force_delalloc = 0; |
| 2865 | } | 2865 | } |
| 2866 | 2866 | ||
| 2867 | struct async_flush { | ||
| 2868 | struct btrfs_root *root; | ||
| 2869 | struct btrfs_space_info *info; | ||
| 2870 | struct btrfs_work work; | ||
| 2871 | }; | ||
| 2872 | |||
| 2873 | static noinline void flush_delalloc_async(struct btrfs_work *work) | ||
| 2874 | { | ||
| 2875 | struct async_flush *async; | ||
| 2876 | struct btrfs_root *root; | ||
| 2877 | struct btrfs_space_info *info; | ||
| 2878 | |||
| 2879 | async = container_of(work, struct async_flush, work); | ||
| 2880 | root = async->root; | ||
| 2881 | info = async->info; | ||
| 2882 | |||
| 2883 | btrfs_start_delalloc_inodes(root); | ||
| 2884 | wake_up(&info->flush_wait); | ||
| 2885 | btrfs_wait_ordered_extents(root, 0); | ||
| 2886 | |||
| 2887 | spin_lock(&info->lock); | ||
| 2888 | info->flushing = 0; | ||
| 2889 | spin_unlock(&info->lock); | ||
| 2890 | wake_up(&info->flush_wait); | ||
| 2891 | |||
| 2892 | kfree(async); | ||
| 2893 | } | ||
| 2894 | |||
| 2895 | static void wait_on_flush(struct btrfs_space_info *info) | ||
| 2896 | { | ||
| 2897 | DEFINE_WAIT(wait); | ||
| 2898 | u64 used; | ||
| 2899 | |||
| 2900 | while (1) { | ||
| 2901 | prepare_to_wait(&info->flush_wait, &wait, | ||
| 2902 | TASK_UNINTERRUPTIBLE); | ||
| 2903 | spin_lock(&info->lock); | ||
| 2904 | if (!info->flushing) { | ||
| 2905 | spin_unlock(&info->lock); | ||
| 2906 | break; | ||
| 2907 | } | ||
| 2908 | |||
| 2909 | used = info->bytes_used + info->bytes_reserved + | ||
| 2910 | info->bytes_pinned + info->bytes_readonly + | ||
| 2911 | info->bytes_super + info->bytes_root + | ||
| 2912 | info->bytes_may_use + info->bytes_delalloc; | ||
| 2913 | if (used < info->total_bytes) { | ||
| 2914 | spin_unlock(&info->lock); | ||
| 2915 | break; | ||
| 2916 | } | ||
| 2917 | spin_unlock(&info->lock); | ||
| 2918 | schedule(); | ||
| 2919 | } | ||
| 2920 | finish_wait(&info->flush_wait, &wait); | ||
| 2921 | } | ||
| 2922 | |||
| 2923 | static void flush_delalloc(struct btrfs_root *root, | ||
| 2924 | struct btrfs_space_info *info) | ||
| 2925 | { | ||
| 2926 | struct async_flush *async; | ||
| 2927 | bool wait = false; | ||
| 2928 | |||
| 2929 | spin_lock(&info->lock); | ||
| 2930 | |||
| 2931 | if (!info->flushing) { | ||
| 2932 | info->flushing = 1; | ||
| 2933 | init_waitqueue_head(&info->flush_wait); | ||
| 2934 | } else { | ||
| 2935 | wait = true; | ||
| 2936 | } | ||
| 2937 | |||
| 2938 | spin_unlock(&info->lock); | ||
| 2939 | |||
| 2940 | if (wait) { | ||
| 2941 | wait_on_flush(info); | ||
| 2942 | return; | ||
| 2943 | } | ||
| 2944 | |||
| 2945 | async = kzalloc(sizeof(*async), GFP_NOFS); | ||
| 2946 | if (!async) | ||
| 2947 | goto flush; | ||
| 2948 | |||
| 2949 | async->root = root; | ||
| 2950 | async->info = info; | ||
| 2951 | async->work.func = flush_delalloc_async; | ||
| 2952 | |||
| 2953 | btrfs_queue_worker(&root->fs_info->enospc_workers, | ||
| 2954 | &async->work); | ||
| 2955 | wait_on_flush(info); | ||
| 2956 | return; | ||
| 2957 | |||
| 2958 | flush: | ||
| 2959 | btrfs_start_delalloc_inodes(root); | ||
| 2960 | btrfs_wait_ordered_extents(root, 0); | ||
| 2961 | |||
| 2962 | spin_lock(&info->lock); | ||
| 2963 | info->flushing = 0; | ||
| 2964 | spin_unlock(&info->lock); | ||
| 2965 | wake_up(&info->flush_wait); | ||
| 2966 | } | ||
| 2967 | |||
| 2867 | static int maybe_allocate_chunk(struct btrfs_root *root, | 2968 | static int maybe_allocate_chunk(struct btrfs_root *root, |
| 2868 | struct btrfs_space_info *info) | 2969 | struct btrfs_space_info *info) |
| 2869 | { | 2970 | { |
| @@ -2894,7 +2995,7 @@ static int maybe_allocate_chunk(struct btrfs_root *root, | |||
| 2894 | if (!info->allocating_chunk) { | 2995 | if (!info->allocating_chunk) { |
| 2895 | info->force_alloc = 1; | 2996 | info->force_alloc = 1; |
| 2896 | info->allocating_chunk = 1; | 2997 | info->allocating_chunk = 1; |
| 2897 | init_waitqueue_head(&info->wait); | 2998 | init_waitqueue_head(&info->allocate_wait); |
| 2898 | } else { | 2999 | } else { |
| 2899 | wait = true; | 3000 | wait = true; |
| 2900 | } | 3001 | } |
| @@ -2902,7 +3003,7 @@ static int maybe_allocate_chunk(struct btrfs_root *root, | |||
| 2902 | spin_unlock(&info->lock); | 3003 | spin_unlock(&info->lock); |
| 2903 | 3004 | ||
| 2904 | if (wait) { | 3005 | if (wait) { |
| 2905 | wait_event(info->wait, | 3006 | wait_event(info->allocate_wait, |
| 2906 | !info->allocating_chunk); | 3007 | !info->allocating_chunk); |
| 2907 | return 1; | 3008 | return 1; |
| 2908 | } | 3009 | } |
| @@ -2923,7 +3024,7 @@ out: | |||
| 2923 | spin_lock(&info->lock); | 3024 | spin_lock(&info->lock); |
| 2924 | info->allocating_chunk = 0; | 3025 | info->allocating_chunk = 0; |
| 2925 | spin_unlock(&info->lock); | 3026 | spin_unlock(&info->lock); |
| 2926 | wake_up(&info->wait); | 3027 | wake_up(&info->allocate_wait); |
| 2927 | 3028 | ||
| 2928 | if (ret) | 3029 | if (ret) |
| 2929 | return 0; | 3030 | return 0; |
| @@ -2981,21 +3082,20 @@ again: | |||
| 2981 | filemap_flush(inode->i_mapping); | 3082 | filemap_flush(inode->i_mapping); |
| 2982 | goto again; | 3083 | goto again; |
| 2983 | } else if (flushed == 3) { | 3084 | } else if (flushed == 3) { |
| 2984 | btrfs_start_delalloc_inodes(root); | 3085 | flush_delalloc(root, meta_sinfo); |
| 2985 | btrfs_wait_ordered_extents(root, 0); | ||
| 2986 | goto again; | 3086 | goto again; |
| 2987 | } | 3087 | } |
| 2988 | spin_lock(&meta_sinfo->lock); | 3088 | spin_lock(&meta_sinfo->lock); |
| 2989 | meta_sinfo->bytes_delalloc -= num_bytes; | 3089 | meta_sinfo->bytes_delalloc -= num_bytes; |
| 2990 | spin_unlock(&meta_sinfo->lock); | 3090 | spin_unlock(&meta_sinfo->lock); |
| 2991 | printk(KERN_ERR "enospc, has %d, reserved %d\n", | 3091 | printk(KERN_ERR "enospc, has %d, reserved %d\n", |
| 2992 | BTRFS_I(inode)->delalloc_extents, | 3092 | BTRFS_I(inode)->outstanding_extents, |
| 2993 | BTRFS_I(inode)->delalloc_reserved_extents); | 3093 | BTRFS_I(inode)->reserved_extents); |
| 2994 | dump_space_info(meta_sinfo, 0, 0); | 3094 | dump_space_info(meta_sinfo, 0, 0); |
| 2995 | return -ENOSPC; | 3095 | return -ENOSPC; |
| 2996 | } | 3096 | } |
| 2997 | 3097 | ||
| 2998 | BTRFS_I(inode)->delalloc_reserved_extents++; | 3098 | BTRFS_I(inode)->reserved_extents++; |
| 2999 | check_force_delalloc(meta_sinfo); | 3099 | check_force_delalloc(meta_sinfo); |
| 3000 | spin_unlock(&meta_sinfo->lock); | 3100 | spin_unlock(&meta_sinfo->lock); |
| 3001 | 3101 | ||
| @@ -3094,8 +3194,7 @@ again: | |||
| 3094 | } | 3194 | } |
| 3095 | 3195 | ||
| 3096 | if (retries == 2) { | 3196 | if (retries == 2) { |
| 3097 | btrfs_start_delalloc_inodes(root); | 3197 | flush_delalloc(root, meta_sinfo); |
| 3098 | btrfs_wait_ordered_extents(root, 0); | ||
| 3099 | goto again; | 3198 | goto again; |
| 3100 | } | 3199 | } |
| 3101 | spin_lock(&meta_sinfo->lock); | 3200 | spin_lock(&meta_sinfo->lock); |
| @@ -3588,6 +3687,14 @@ static int pin_down_bytes(struct btrfs_trans_handle *trans, | |||
| 3588 | if (is_data) | 3687 | if (is_data) |
| 3589 | goto pinit; | 3688 | goto pinit; |
| 3590 | 3689 | ||
| 3690 | /* | ||
| 3691 | * discard is sloooow, and so triggering discards on | ||
| 3692 | * individual btree blocks isn't a good plan. Just | ||
| 3693 | * pin everything in discard mode. | ||
| 3694 | */ | ||
| 3695 | if (btrfs_test_opt(root, DISCARD)) | ||
| 3696 | goto pinit; | ||
| 3697 | |||
| 3591 | buf = btrfs_find_tree_block(root, bytenr, num_bytes); | 3698 | buf = btrfs_find_tree_block(root, bytenr, num_bytes); |
| 3592 | if (!buf) | 3699 | if (!buf) |
| 3593 | goto pinit; | 3700 | goto pinit; |
| @@ -4029,6 +4136,7 @@ static noinline int find_free_extent(struct btrfs_trans_handle *trans, | |||
| 4029 | int loop = 0; | 4136 | int loop = 0; |
| 4030 | bool found_uncached_bg = false; | 4137 | bool found_uncached_bg = false; |
| 4031 | bool failed_cluster_refill = false; | 4138 | bool failed_cluster_refill = false; |
| 4139 | bool failed_alloc = false; | ||
| 4032 | 4140 | ||
| 4033 | WARN_ON(num_bytes < root->sectorsize); | 4141 | WARN_ON(num_bytes < root->sectorsize); |
| 4034 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); | 4142 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); |
| @@ -4233,14 +4341,23 @@ refill_cluster: | |||
| 4233 | 4341 | ||
| 4234 | offset = btrfs_find_space_for_alloc(block_group, search_start, | 4342 | offset = btrfs_find_space_for_alloc(block_group, search_start, |
| 4235 | num_bytes, empty_size); | 4343 | num_bytes, empty_size); |
| 4236 | if (!offset && (cached || (!cached && | 4344 | /* |
| 4237 | loop == LOOP_CACHING_NOWAIT))) { | 4345 | * If we didn't find a chunk, and we haven't failed on this |
| 4238 | goto loop; | 4346 | * block group before, and this block group is in the middle of |
| 4239 | } else if (!offset && (!cached && | 4347 | * caching and we are ok with waiting, then go ahead and wait |
| 4240 | loop > LOOP_CACHING_NOWAIT)) { | 4348 | * for progress to be made, and set failed_alloc to true. |
| 4349 | * | ||
| 4350 | * If failed_alloc is true then we've already waited on this | ||
| 4351 | * block group once and should move on to the next block group. | ||
| 4352 | */ | ||
| 4353 | if (!offset && !failed_alloc && !cached && | ||
| 4354 | loop > LOOP_CACHING_NOWAIT) { | ||
| 4241 | wait_block_group_cache_progress(block_group, | 4355 | wait_block_group_cache_progress(block_group, |
| 4242 | num_bytes + empty_size); | 4356 | num_bytes + empty_size); |
| 4357 | failed_alloc = true; | ||
| 4243 | goto have_block_group; | 4358 | goto have_block_group; |
| 4359 | } else if (!offset) { | ||
| 4360 | goto loop; | ||
| 4244 | } | 4361 | } |
| 4245 | checks: | 4362 | checks: |
| 4246 | search_start = stripe_align(root, offset); | 4363 | search_start = stripe_align(root, offset); |
| @@ -4288,6 +4405,7 @@ checks: | |||
| 4288 | break; | 4405 | break; |
| 4289 | loop: | 4406 | loop: |
| 4290 | failed_cluster_refill = false; | 4407 | failed_cluster_refill = false; |
| 4408 | failed_alloc = false; | ||
| 4291 | btrfs_put_block_group(block_group); | 4409 | btrfs_put_block_group(block_group); |
| 4292 | } | 4410 | } |
| 4293 | up_read(&space_info->groups_sem); | 4411 | up_read(&space_info->groups_sem); |
| @@ -4799,6 +4917,7 @@ static noinline void reada_walk_down(struct btrfs_trans_handle *trans, | |||
| 4799 | u64 bytenr; | 4917 | u64 bytenr; |
| 4800 | u64 generation; | 4918 | u64 generation; |
| 4801 | u64 refs; | 4919 | u64 refs; |
| 4920 | u64 flags; | ||
| 4802 | u64 last = 0; | 4921 | u64 last = 0; |
| 4803 | u32 nritems; | 4922 | u32 nritems; |
| 4804 | u32 blocksize; | 4923 | u32 blocksize; |
| @@ -4836,15 +4955,19 @@ static noinline void reada_walk_down(struct btrfs_trans_handle *trans, | |||
| 4836 | generation <= root->root_key.offset) | 4955 | generation <= root->root_key.offset) |
| 4837 | continue; | 4956 | continue; |
| 4838 | 4957 | ||
| 4958 | /* We don't lock the tree block, it's OK to be racy here */ | ||
| 4959 | ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize, | ||
| 4960 | &refs, &flags); | ||
| 4961 | BUG_ON(ret); | ||
| 4962 | BUG_ON(refs == 0); | ||
| 4963 | |||
| 4839 | if (wc->stage == DROP_REFERENCE) { | 4964 | if (wc->stage == DROP_REFERENCE) { |
| 4840 | ret = btrfs_lookup_extent_info(trans, root, | ||
| 4841 | bytenr, blocksize, | ||
| 4842 | &refs, NULL); | ||
| 4843 | BUG_ON(ret); | ||
| 4844 | BUG_ON(refs == 0); | ||
| 4845 | if (refs == 1) | 4965 | if (refs == 1) |
| 4846 | goto reada; | 4966 | goto reada; |
| 4847 | 4967 | ||
| 4968 | if (wc->level == 1 && | ||
| 4969 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | ||
| 4970 | continue; | ||
| 4848 | if (!wc->update_ref || | 4971 | if (!wc->update_ref || |
| 4849 | generation <= root->root_key.offset) | 4972 | generation <= root->root_key.offset) |
| 4850 | continue; | 4973 | continue; |
| @@ -4853,6 +4976,10 @@ static noinline void reada_walk_down(struct btrfs_trans_handle *trans, | |||
| 4853 | &wc->update_progress); | 4976 | &wc->update_progress); |
| 4854 | if (ret < 0) | 4977 | if (ret < 0) |
| 4855 | continue; | 4978 | continue; |
| 4979 | } else { | ||
| 4980 | if (wc->level == 1 && | ||
| 4981 | (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | ||
| 4982 | continue; | ||
| 4856 | } | 4983 | } |
| 4857 | reada: | 4984 | reada: |
| 4858 | ret = readahead_tree_block(root, bytenr, blocksize, | 4985 | ret = readahead_tree_block(root, bytenr, blocksize, |
| @@ -4876,7 +5003,7 @@ reada: | |||
| 4876 | static noinline int walk_down_proc(struct btrfs_trans_handle *trans, | 5003 | static noinline int walk_down_proc(struct btrfs_trans_handle *trans, |
| 4877 | struct btrfs_root *root, | 5004 | struct btrfs_root *root, |
| 4878 | struct btrfs_path *path, | 5005 | struct btrfs_path *path, |
| 4879 | struct walk_control *wc) | 5006 | struct walk_control *wc, int lookup_info) |
| 4880 | { | 5007 | { |
| 4881 | int level = wc->level; | 5008 | int level = wc->level; |
| 4882 | struct extent_buffer *eb = path->nodes[level]; | 5009 | struct extent_buffer *eb = path->nodes[level]; |
| @@ -4891,8 +5018,9 @@ static noinline int walk_down_proc(struct btrfs_trans_handle *trans, | |||
| 4891 | * when reference count of tree block is 1, it won't increase | 5018 | * when reference count of tree block is 1, it won't increase |
| 4892 | * again. once full backref flag is set, we never clear it. | 5019 | * again. once full backref flag is set, we never clear it. |
| 4893 | */ | 5020 | */ |
| 4894 | if ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || | 5021 | if (lookup_info && |
| 4895 | (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag))) { | 5022 | ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) || |
| 5023 | (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) { | ||
| 4896 | BUG_ON(!path->locks[level]); | 5024 | BUG_ON(!path->locks[level]); |
| 4897 | ret = btrfs_lookup_extent_info(trans, root, | 5025 | ret = btrfs_lookup_extent_info(trans, root, |
| 4898 | eb->start, eb->len, | 5026 | eb->start, eb->len, |
| @@ -4953,7 +5081,7 @@ static noinline int walk_down_proc(struct btrfs_trans_handle *trans, | |||
| 4953 | static noinline int do_walk_down(struct btrfs_trans_handle *trans, | 5081 | static noinline int do_walk_down(struct btrfs_trans_handle *trans, |
| 4954 | struct btrfs_root *root, | 5082 | struct btrfs_root *root, |
| 4955 | struct btrfs_path *path, | 5083 | struct btrfs_path *path, |
| 4956 | struct walk_control *wc) | 5084 | struct walk_control *wc, int *lookup_info) |
| 4957 | { | 5085 | { |
| 4958 | u64 bytenr; | 5086 | u64 bytenr; |
| 4959 | u64 generation; | 5087 | u64 generation; |
| @@ -4973,8 +5101,10 @@ static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |||
| 4973 | * for the subtree | 5101 | * for the subtree |
| 4974 | */ | 5102 | */ |
| 4975 | if (wc->stage == UPDATE_BACKREF && | 5103 | if (wc->stage == UPDATE_BACKREF && |
| 4976 | generation <= root->root_key.offset) | 5104 | generation <= root->root_key.offset) { |
| 5105 | *lookup_info = 1; | ||
| 4977 | return 1; | 5106 | return 1; |
| 5107 | } | ||
| 4978 | 5108 | ||
| 4979 | bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); | 5109 | bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); |
| 4980 | blocksize = btrfs_level_size(root, level - 1); | 5110 | blocksize = btrfs_level_size(root, level - 1); |
| @@ -4987,14 +5117,19 @@ static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |||
| 4987 | btrfs_tree_lock(next); | 5117 | btrfs_tree_lock(next); |
| 4988 | btrfs_set_lock_blocking(next); | 5118 | btrfs_set_lock_blocking(next); |
| 4989 | 5119 | ||
| 4990 | if (wc->stage == DROP_REFERENCE) { | 5120 | ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize, |
| 4991 | ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize, | 5121 | &wc->refs[level - 1], |
| 4992 | &wc->refs[level - 1], | 5122 | &wc->flags[level - 1]); |
| 4993 | &wc->flags[level - 1]); | 5123 | BUG_ON(ret); |
| 4994 | BUG_ON(ret); | 5124 | BUG_ON(wc->refs[level - 1] == 0); |
| 4995 | BUG_ON(wc->refs[level - 1] == 0); | 5125 | *lookup_info = 0; |
| 4996 | 5126 | ||
| 5127 | if (wc->stage == DROP_REFERENCE) { | ||
| 4997 | if (wc->refs[level - 1] > 1) { | 5128 | if (wc->refs[level - 1] > 1) { |
| 5129 | if (level == 1 && | ||
| 5130 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | ||
| 5131 | goto skip; | ||
| 5132 | |||
| 4998 | if (!wc->update_ref || | 5133 | if (!wc->update_ref || |
| 4999 | generation <= root->root_key.offset) | 5134 | generation <= root->root_key.offset) |
| 5000 | goto skip; | 5135 | goto skip; |
| @@ -5008,12 +5143,17 @@ static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |||
| 5008 | wc->stage = UPDATE_BACKREF; | 5143 | wc->stage = UPDATE_BACKREF; |
| 5009 | wc->shared_level = level - 1; | 5144 | wc->shared_level = level - 1; |
| 5010 | } | 5145 | } |
| 5146 | } else { | ||
| 5147 | if (level == 1 && | ||
| 5148 | (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF)) | ||
| 5149 | goto skip; | ||
| 5011 | } | 5150 | } |
| 5012 | 5151 | ||
| 5013 | if (!btrfs_buffer_uptodate(next, generation)) { | 5152 | if (!btrfs_buffer_uptodate(next, generation)) { |
| 5014 | btrfs_tree_unlock(next); | 5153 | btrfs_tree_unlock(next); |
| 5015 | free_extent_buffer(next); | 5154 | free_extent_buffer(next); |
| 5016 | next = NULL; | 5155 | next = NULL; |
| 5156 | *lookup_info = 1; | ||
| 5017 | } | 5157 | } |
| 5018 | 5158 | ||
| 5019 | if (!next) { | 5159 | if (!next) { |
| @@ -5036,21 +5176,22 @@ static noinline int do_walk_down(struct btrfs_trans_handle *trans, | |||
| 5036 | skip: | 5176 | skip: |
| 5037 | wc->refs[level - 1] = 0; | 5177 | wc->refs[level - 1] = 0; |
| 5038 | wc->flags[level - 1] = 0; | 5178 | wc->flags[level - 1] = 0; |
| 5179 | if (wc->stage == DROP_REFERENCE) { | ||
| 5180 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | ||
| 5181 | parent = path->nodes[level]->start; | ||
| 5182 | } else { | ||
| 5183 | BUG_ON(root->root_key.objectid != | ||
| 5184 | btrfs_header_owner(path->nodes[level])); | ||
| 5185 | parent = 0; | ||
| 5186 | } | ||
| 5039 | 5187 | ||
| 5040 | if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) { | 5188 | ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent, |
| 5041 | parent = path->nodes[level]->start; | 5189 | root->root_key.objectid, level - 1, 0); |
| 5042 | } else { | 5190 | BUG_ON(ret); |
| 5043 | BUG_ON(root->root_key.objectid != | ||
| 5044 | btrfs_header_owner(path->nodes[level])); | ||
| 5045 | parent = 0; | ||
| 5046 | } | 5191 | } |
| 5047 | |||
| 5048 | ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent, | ||
| 5049 | root->root_key.objectid, level - 1, 0); | ||
| 5050 | BUG_ON(ret); | ||
| 5051 | |||
| 5052 | btrfs_tree_unlock(next); | 5192 | btrfs_tree_unlock(next); |
| 5053 | free_extent_buffer(next); | 5193 | free_extent_buffer(next); |
| 5194 | *lookup_info = 1; | ||
| 5054 | return 1; | 5195 | return 1; |
| 5055 | } | 5196 | } |
| 5056 | 5197 | ||
| @@ -5164,6 +5305,7 @@ static noinline int walk_down_tree(struct btrfs_trans_handle *trans, | |||
| 5164 | struct walk_control *wc) | 5305 | struct walk_control *wc) |
| 5165 | { | 5306 | { |
| 5166 | int level = wc->level; | 5307 | int level = wc->level; |
| 5308 | int lookup_info = 1; | ||
| 5167 | int ret; | 5309 | int ret; |
| 5168 | 5310 | ||
| 5169 | while (level >= 0) { | 5311 | while (level >= 0) { |
| @@ -5171,14 +5313,14 @@ static noinline int walk_down_tree(struct btrfs_trans_handle *trans, | |||
| 5171 | btrfs_header_nritems(path->nodes[level])) | 5313 | btrfs_header_nritems(path->nodes[level])) |
| 5172 | break; | 5314 | break; |
| 5173 | 5315 | ||
| 5174 | ret = walk_down_proc(trans, root, path, wc); | 5316 | ret = walk_down_proc(trans, root, path, wc, lookup_info); |
| 5175 | if (ret > 0) | 5317 | if (ret > 0) |
| 5176 | break; | 5318 | break; |
| 5177 | 5319 | ||
| 5178 | if (level == 0) | 5320 | if (level == 0) |
| 5179 | break; | 5321 | break; |
| 5180 | 5322 | ||
| 5181 | ret = do_walk_down(trans, root, path, wc); | 5323 | ret = do_walk_down(trans, root, path, wc, &lookup_info); |
| 5182 | if (ret > 0) { | 5324 | if (ret > 0) { |
| 5183 | path->slots[level]++; | 5325 | path->slots[level]++; |
| 5184 | continue; | 5326 | continue; |
diff --git a/fs/btrfs/extent_io.c b/fs/btrfs/extent_io.c index de1793ba004a..96577e8bf9fd 100644 --- a/fs/btrfs/extent_io.c +++ b/fs/btrfs/extent_io.c | |||
| @@ -460,7 +460,8 @@ static int clear_state_bit(struct extent_io_tree *tree, | |||
| 460 | struct extent_state *state, int bits, int wake, | 460 | struct extent_state *state, int bits, int wake, |
| 461 | int delete) | 461 | int delete) |
| 462 | { | 462 | { |
| 463 | int ret = state->state & bits; | 463 | int bits_to_clear = bits & ~EXTENT_DO_ACCOUNTING; |
| 464 | int ret = state->state & bits_to_clear; | ||
| 464 | 465 | ||
| 465 | if ((bits & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) { | 466 | if ((bits & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) { |
| 466 | u64 range = state->end - state->start + 1; | 467 | u64 range = state->end - state->start + 1; |
| @@ -468,7 +469,7 @@ static int clear_state_bit(struct extent_io_tree *tree, | |||
| 468 | tree->dirty_bytes -= range; | 469 | tree->dirty_bytes -= range; |
| 469 | } | 470 | } |
| 470 | clear_state_cb(tree, state, bits); | 471 | clear_state_cb(tree, state, bits); |
| 471 | state->state &= ~bits; | 472 | state->state &= ~bits_to_clear; |
| 472 | if (wake) | 473 | if (wake) |
| 473 | wake_up(&state->wq); | 474 | wake_up(&state->wq); |
| 474 | if (delete || state->state == 0) { | 475 | if (delete || state->state == 0) { |
| @@ -956,7 +957,8 @@ int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, | |||
| 956 | gfp_t mask) | 957 | gfp_t mask) |
| 957 | { | 958 | { |
| 958 | return clear_extent_bit(tree, start, end, | 959 | return clear_extent_bit(tree, start, end, |
| 959 | EXTENT_DIRTY | EXTENT_DELALLOC, 0, 0, | 960 | EXTENT_DIRTY | EXTENT_DELALLOC | |
| 961 | EXTENT_DO_ACCOUNTING, 0, 0, | ||
| 960 | NULL, mask); | 962 | NULL, mask); |
| 961 | } | 963 | } |
| 962 | 964 | ||
| @@ -1401,12 +1403,7 @@ out_failed: | |||
| 1401 | int extent_clear_unlock_delalloc(struct inode *inode, | 1403 | int extent_clear_unlock_delalloc(struct inode *inode, |
| 1402 | struct extent_io_tree *tree, | 1404 | struct extent_io_tree *tree, |
| 1403 | u64 start, u64 end, struct page *locked_page, | 1405 | u64 start, u64 end, struct page *locked_page, |
| 1404 | int unlock_pages, | 1406 | unsigned long op) |
| 1405 | int clear_unlock, | ||
| 1406 | int clear_delalloc, int clear_dirty, | ||
| 1407 | int set_writeback, | ||
| 1408 | int end_writeback, | ||
| 1409 | int set_private2) | ||
| 1410 | { | 1407 | { |
| 1411 | int ret; | 1408 | int ret; |
| 1412 | struct page *pages[16]; | 1409 | struct page *pages[16]; |
| @@ -1416,17 +1413,21 @@ int extent_clear_unlock_delalloc(struct inode *inode, | |||
| 1416 | int i; | 1413 | int i; |
| 1417 | int clear_bits = 0; | 1414 | int clear_bits = 0; |
| 1418 | 1415 | ||
| 1419 | if (clear_unlock) | 1416 | if (op & EXTENT_CLEAR_UNLOCK) |
| 1420 | clear_bits |= EXTENT_LOCKED; | 1417 | clear_bits |= EXTENT_LOCKED; |
| 1421 | if (clear_dirty) | 1418 | if (op & EXTENT_CLEAR_DIRTY) |
| 1422 | clear_bits |= EXTENT_DIRTY; | 1419 | clear_bits |= EXTENT_DIRTY; |
| 1423 | 1420 | ||
| 1424 | if (clear_delalloc) | 1421 | if (op & EXTENT_CLEAR_DELALLOC) |
| 1425 | clear_bits |= EXTENT_DELALLOC; | 1422 | clear_bits |= EXTENT_DELALLOC; |
| 1426 | 1423 | ||
| 1424 | if (op & EXTENT_CLEAR_ACCOUNTING) | ||
| 1425 | clear_bits |= EXTENT_DO_ACCOUNTING; | ||
| 1426 | |||
| 1427 | clear_extent_bit(tree, start, end, clear_bits, 1, 0, NULL, GFP_NOFS); | 1427 | clear_extent_bit(tree, start, end, clear_bits, 1, 0, NULL, GFP_NOFS); |
| 1428 | if (!(unlock_pages || clear_dirty || set_writeback || end_writeback || | 1428 | if (!(op & (EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY | |
| 1429 | set_private2)) | 1429 | EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK | |
| 1430 | EXTENT_SET_PRIVATE2))) | ||
| 1430 | return 0; | 1431 | return 0; |
| 1431 | 1432 | ||
| 1432 | while (nr_pages > 0) { | 1433 | while (nr_pages > 0) { |
| @@ -1435,20 +1436,20 @@ int extent_clear_unlock_delalloc(struct inode *inode, | |||
| 1435 | nr_pages, ARRAY_SIZE(pages)), pages); | 1436 | nr_pages, ARRAY_SIZE(pages)), pages); |
| 1436 | for (i = 0; i < ret; i++) { | 1437 | for (i = 0; i < ret; i++) { |
| 1437 | 1438 | ||
| 1438 | if (set_private2) | 1439 | if (op & EXTENT_SET_PRIVATE2) |
| 1439 | SetPagePrivate2(pages[i]); | 1440 | SetPagePrivate2(pages[i]); |
| 1440 | 1441 | ||
| 1441 | if (pages[i] == locked_page) { | 1442 | if (pages[i] == locked_page) { |
| 1442 | page_cache_release(pages[i]); | 1443 | page_cache_release(pages[i]); |
| 1443 | continue; | 1444 | continue; |
| 1444 | } | 1445 | } |
| 1445 | if (clear_dirty) | 1446 | if (op & EXTENT_CLEAR_DIRTY) |
| 1446 | clear_page_dirty_for_io(pages[i]); | 1447 | clear_page_dirty_for_io(pages[i]); |
| 1447 | if (set_writeback) | 1448 | if (op & EXTENT_SET_WRITEBACK) |
| 1448 | set_page_writeback(pages[i]); | 1449 | set_page_writeback(pages[i]); |
| 1449 | if (end_writeback) | 1450 | if (op & EXTENT_END_WRITEBACK) |
| 1450 | end_page_writeback(pages[i]); | 1451 | end_page_writeback(pages[i]); |
| 1451 | if (unlock_pages) | 1452 | if (op & EXTENT_CLEAR_UNLOCK_PAGE) |
| 1452 | unlock_page(pages[i]); | 1453 | unlock_page(pages[i]); |
| 1453 | page_cache_release(pages[i]); | 1454 | page_cache_release(pages[i]); |
| 1454 | } | 1455 | } |
| @@ -2714,7 +2715,8 @@ int extent_invalidatepage(struct extent_io_tree *tree, | |||
| 2714 | lock_extent(tree, start, end, GFP_NOFS); | 2715 | lock_extent(tree, start, end, GFP_NOFS); |
| 2715 | wait_on_page_writeback(page); | 2716 | wait_on_page_writeback(page); |
| 2716 | clear_extent_bit(tree, start, end, | 2717 | clear_extent_bit(tree, start, end, |
| 2717 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC, | 2718 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
| 2719 | EXTENT_DO_ACCOUNTING, | ||
| 2718 | 1, 1, NULL, GFP_NOFS); | 2720 | 1, 1, NULL, GFP_NOFS); |
| 2719 | return 0; | 2721 | return 0; |
| 2720 | } | 2722 | } |
diff --git a/fs/btrfs/extent_io.h b/fs/btrfs/extent_io.h index 4794ec891fed..36de250a7b2b 100644 --- a/fs/btrfs/extent_io.h +++ b/fs/btrfs/extent_io.h | |||
| @@ -15,6 +15,7 @@ | |||
| 15 | #define EXTENT_BUFFER_FILLED (1 << 8) | 15 | #define EXTENT_BUFFER_FILLED (1 << 8) |
| 16 | #define EXTENT_BOUNDARY (1 << 9) | 16 | #define EXTENT_BOUNDARY (1 << 9) |
| 17 | #define EXTENT_NODATASUM (1 << 10) | 17 | #define EXTENT_NODATASUM (1 << 10) |
| 18 | #define EXTENT_DO_ACCOUNTING (1 << 11) | ||
| 18 | #define EXTENT_IOBITS (EXTENT_LOCKED | EXTENT_WRITEBACK) | 19 | #define EXTENT_IOBITS (EXTENT_LOCKED | EXTENT_WRITEBACK) |
| 19 | 20 | ||
| 20 | /* flags for bio submission */ | 21 | /* flags for bio submission */ |
| @@ -25,6 +26,16 @@ | |||
| 25 | #define EXTENT_BUFFER_BLOCKING 1 | 26 | #define EXTENT_BUFFER_BLOCKING 1 |
| 26 | #define EXTENT_BUFFER_DIRTY 2 | 27 | #define EXTENT_BUFFER_DIRTY 2 |
| 27 | 28 | ||
| 29 | /* these are flags for extent_clear_unlock_delalloc */ | ||
| 30 | #define EXTENT_CLEAR_UNLOCK_PAGE 0x1 | ||
| 31 | #define EXTENT_CLEAR_UNLOCK 0x2 | ||
| 32 | #define EXTENT_CLEAR_DELALLOC 0x4 | ||
| 33 | #define EXTENT_CLEAR_DIRTY 0x8 | ||
| 34 | #define EXTENT_SET_WRITEBACK 0x10 | ||
| 35 | #define EXTENT_END_WRITEBACK 0x20 | ||
| 36 | #define EXTENT_SET_PRIVATE2 0x40 | ||
| 37 | #define EXTENT_CLEAR_ACCOUNTING 0x80 | ||
| 38 | |||
| 28 | /* | 39 | /* |
| 29 | * page->private values. Every page that is controlled by the extent | 40 | * page->private values. Every page that is controlled by the extent |
| 30 | * map has page->private set to one. | 41 | * map has page->private set to one. |
| @@ -288,10 +299,5 @@ int extent_range_uptodate(struct extent_io_tree *tree, | |||
| 288 | int extent_clear_unlock_delalloc(struct inode *inode, | 299 | int extent_clear_unlock_delalloc(struct inode *inode, |
| 289 | struct extent_io_tree *tree, | 300 | struct extent_io_tree *tree, |
| 290 | u64 start, u64 end, struct page *locked_page, | 301 | u64 start, u64 end, struct page *locked_page, |
| 291 | int unlock_page, | 302 | unsigned long op); |
| 292 | int clear_unlock, | ||
| 293 | int clear_delalloc, int clear_dirty, | ||
| 294 | int set_writeback, | ||
| 295 | int end_writeback, | ||
| 296 | int set_private2); | ||
| 297 | #endif | 303 | #endif |
diff --git a/fs/btrfs/file.c b/fs/btrfs/file.c index f19e1259a971..06550affbd27 100644 --- a/fs/btrfs/file.c +++ b/fs/btrfs/file.c | |||
| @@ -878,7 +878,8 @@ again: | |||
| 878 | btrfs_put_ordered_extent(ordered); | 878 | btrfs_put_ordered_extent(ordered); |
| 879 | 879 | ||
| 880 | clear_extent_bits(&BTRFS_I(inode)->io_tree, start_pos, | 880 | clear_extent_bits(&BTRFS_I(inode)->io_tree, start_pos, |
| 881 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC, | 881 | last_pos - 1, EXTENT_DIRTY | EXTENT_DELALLOC | |
| 882 | EXTENT_DO_ACCOUNTING, | ||
| 882 | GFP_NOFS); | 883 | GFP_NOFS); |
| 883 | unlock_extent(&BTRFS_I(inode)->io_tree, | 884 | unlock_extent(&BTRFS_I(inode)->io_tree, |
| 884 | start_pos, last_pos - 1, GFP_NOFS); | 885 | start_pos, last_pos - 1, GFP_NOFS); |
| @@ -1085,8 +1086,10 @@ out_nolock: | |||
| 1085 | btrfs_end_transaction(trans, root); | 1086 | btrfs_end_transaction(trans, root); |
| 1086 | else | 1087 | else |
| 1087 | btrfs_commit_transaction(trans, root); | 1088 | btrfs_commit_transaction(trans, root); |
| 1088 | } else { | 1089 | } else if (ret != BTRFS_NO_LOG_SYNC) { |
| 1089 | btrfs_commit_transaction(trans, root); | 1090 | btrfs_commit_transaction(trans, root); |
| 1091 | } else { | ||
| 1092 | btrfs_end_transaction(trans, root); | ||
| 1090 | } | 1093 | } |
| 1091 | } | 1094 | } |
| 1092 | if (file->f_flags & O_DIRECT) { | 1095 | if (file->f_flags & O_DIRECT) { |
| @@ -1136,6 +1139,13 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) | |||
| 1136 | int ret = 0; | 1139 | int ret = 0; |
| 1137 | struct btrfs_trans_handle *trans; | 1140 | struct btrfs_trans_handle *trans; |
| 1138 | 1141 | ||
| 1142 | |||
| 1143 | /* we wait first, since the writeback may change the inode */ | ||
| 1144 | root->log_batch++; | ||
| 1145 | /* the VFS called filemap_fdatawrite for us */ | ||
| 1146 | btrfs_wait_ordered_range(inode, 0, (u64)-1); | ||
| 1147 | root->log_batch++; | ||
| 1148 | |||
| 1139 | /* | 1149 | /* |
| 1140 | * check the transaction that last modified this inode | 1150 | * check the transaction that last modified this inode |
| 1141 | * and see if its already been committed | 1151 | * and see if its already been committed |
| @@ -1143,6 +1153,11 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) | |||
| 1143 | if (!BTRFS_I(inode)->last_trans) | 1153 | if (!BTRFS_I(inode)->last_trans) |
| 1144 | goto out; | 1154 | goto out; |
| 1145 | 1155 | ||
| 1156 | /* | ||
| 1157 | * if the last transaction that changed this file was before | ||
| 1158 | * the current transaction, we can bail out now without any | ||
| 1159 | * syncing | ||
| 1160 | */ | ||
| 1146 | mutex_lock(&root->fs_info->trans_mutex); | 1161 | mutex_lock(&root->fs_info->trans_mutex); |
| 1147 | if (BTRFS_I(inode)->last_trans <= | 1162 | if (BTRFS_I(inode)->last_trans <= |
| 1148 | root->fs_info->last_trans_committed) { | 1163 | root->fs_info->last_trans_committed) { |
| @@ -1152,13 +1167,6 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) | |||
| 1152 | } | 1167 | } |
| 1153 | mutex_unlock(&root->fs_info->trans_mutex); | 1168 | mutex_unlock(&root->fs_info->trans_mutex); |
| 1154 | 1169 | ||
| 1155 | root->log_batch++; | ||
| 1156 | filemap_fdatawrite(inode->i_mapping); | ||
| 1157 | btrfs_wait_ordered_range(inode, 0, (u64)-1); | ||
| 1158 | root->log_batch++; | ||
| 1159 | |||
| 1160 | if (datasync && !(inode->i_state & I_DIRTY_PAGES)) | ||
| 1161 | goto out; | ||
| 1162 | /* | 1170 | /* |
| 1163 | * ok we haven't committed the transaction yet, lets do a commit | 1171 | * ok we haven't committed the transaction yet, lets do a commit |
| 1164 | */ | 1172 | */ |
| @@ -1187,14 +1195,18 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync) | |||
| 1187 | */ | 1195 | */ |
| 1188 | mutex_unlock(&dentry->d_inode->i_mutex); | 1196 | mutex_unlock(&dentry->d_inode->i_mutex); |
| 1189 | 1197 | ||
| 1190 | if (ret > 0) { | 1198 | if (ret != BTRFS_NO_LOG_SYNC) { |
| 1191 | ret = btrfs_commit_transaction(trans, root); | 1199 | if (ret > 0) { |
| 1192 | } else { | ||
| 1193 | ret = btrfs_sync_log(trans, root); | ||
| 1194 | if (ret == 0) | ||
| 1195 | ret = btrfs_end_transaction(trans, root); | ||
| 1196 | else | ||
| 1197 | ret = btrfs_commit_transaction(trans, root); | 1200 | ret = btrfs_commit_transaction(trans, root); |
| 1201 | } else { | ||
| 1202 | ret = btrfs_sync_log(trans, root); | ||
| 1203 | if (ret == 0) | ||
| 1204 | ret = btrfs_end_transaction(trans, root); | ||
| 1205 | else | ||
| 1206 | ret = btrfs_commit_transaction(trans, root); | ||
| 1207 | } | ||
| 1208 | } else { | ||
| 1209 | ret = btrfs_end_transaction(trans, root); | ||
| 1198 | } | 1210 | } |
| 1199 | mutex_lock(&dentry->d_inode->i_mutex); | 1211 | mutex_lock(&dentry->d_inode->i_mutex); |
| 1200 | out: | 1212 | out: |
diff --git a/fs/btrfs/inode.c b/fs/btrfs/inode.c index 112e5aa85892..dae12dc7e159 100644 --- a/fs/btrfs/inode.c +++ b/fs/btrfs/inode.c | |||
| @@ -424,9 +424,12 @@ again: | |||
| 424 | * and free up our temp pages. | 424 | * and free up our temp pages. |
| 425 | */ | 425 | */ |
| 426 | extent_clear_unlock_delalloc(inode, | 426 | extent_clear_unlock_delalloc(inode, |
| 427 | &BTRFS_I(inode)->io_tree, | 427 | &BTRFS_I(inode)->io_tree, |
| 428 | start, end, NULL, 1, 0, | 428 | start, end, NULL, |
| 429 | 0, 1, 1, 1, 0); | 429 | EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY | |
| 430 | EXTENT_CLEAR_DELALLOC | | ||
| 431 | EXTENT_CLEAR_ACCOUNTING | | ||
| 432 | EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK); | ||
| 430 | ret = 0; | 433 | ret = 0; |
| 431 | goto free_pages_out; | 434 | goto free_pages_out; |
| 432 | } | 435 | } |
| @@ -637,11 +640,14 @@ static noinline int submit_compressed_extents(struct inode *inode, | |||
| 637 | * clear dirty, set writeback and unlock the pages. | 640 | * clear dirty, set writeback and unlock the pages. |
| 638 | */ | 641 | */ |
| 639 | extent_clear_unlock_delalloc(inode, | 642 | extent_clear_unlock_delalloc(inode, |
| 640 | &BTRFS_I(inode)->io_tree, | 643 | &BTRFS_I(inode)->io_tree, |
| 641 | async_extent->start, | 644 | async_extent->start, |
| 642 | async_extent->start + | 645 | async_extent->start + |
| 643 | async_extent->ram_size - 1, | 646 | async_extent->ram_size - 1, |
| 644 | NULL, 1, 1, 0, 1, 1, 0, 0); | 647 | NULL, EXTENT_CLEAR_UNLOCK_PAGE | |
| 648 | EXTENT_CLEAR_UNLOCK | | ||
| 649 | EXTENT_CLEAR_DELALLOC | | ||
| 650 | EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK); | ||
| 645 | 651 | ||
| 646 | ret = btrfs_submit_compressed_write(inode, | 652 | ret = btrfs_submit_compressed_write(inode, |
| 647 | async_extent->start, | 653 | async_extent->start, |
| @@ -712,9 +718,15 @@ static noinline int cow_file_range(struct inode *inode, | |||
| 712 | start, end, 0, NULL); | 718 | start, end, 0, NULL); |
| 713 | if (ret == 0) { | 719 | if (ret == 0) { |
| 714 | extent_clear_unlock_delalloc(inode, | 720 | extent_clear_unlock_delalloc(inode, |
| 715 | &BTRFS_I(inode)->io_tree, | 721 | &BTRFS_I(inode)->io_tree, |
| 716 | start, end, NULL, 1, 1, | 722 | start, end, NULL, |
| 717 | 1, 1, 1, 1, 0); | 723 | EXTENT_CLEAR_UNLOCK_PAGE | |
| 724 | EXTENT_CLEAR_UNLOCK | | ||
| 725 | EXTENT_CLEAR_DELALLOC | | ||
| 726 | EXTENT_CLEAR_ACCOUNTING | | ||
| 727 | EXTENT_CLEAR_DIRTY | | ||
| 728 | EXTENT_SET_WRITEBACK | | ||
| 729 | EXTENT_END_WRITEBACK); | ||
| 718 | *nr_written = *nr_written + | 730 | *nr_written = *nr_written + |
| 719 | (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE; | 731 | (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE; |
| 720 | *page_started = 1; | 732 | *page_started = 1; |
| @@ -738,6 +750,8 @@ static noinline int cow_file_range(struct inode *inode, | |||
| 738 | btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0); | 750 | btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0); |
| 739 | 751 | ||
| 740 | while (disk_num_bytes > 0) { | 752 | while (disk_num_bytes > 0) { |
| 753 | unsigned long op; | ||
| 754 | |||
| 741 | cur_alloc_size = min(disk_num_bytes, root->fs_info->max_extent); | 755 | cur_alloc_size = min(disk_num_bytes, root->fs_info->max_extent); |
| 742 | ret = btrfs_reserve_extent(trans, root, cur_alloc_size, | 756 | ret = btrfs_reserve_extent(trans, root, cur_alloc_size, |
| 743 | root->sectorsize, 0, alloc_hint, | 757 | root->sectorsize, 0, alloc_hint, |
| @@ -789,10 +803,13 @@ static noinline int cow_file_range(struct inode *inode, | |||
| 789 | * Do set the Private2 bit so we know this page was properly | 803 | * Do set the Private2 bit so we know this page was properly |
| 790 | * setup for writepage | 804 | * setup for writepage |
| 791 | */ | 805 | */ |
| 806 | op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0; | ||
| 807 | op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | ||
| 808 | EXTENT_SET_PRIVATE2; | ||
| 809 | |||
| 792 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, | 810 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
| 793 | start, start + ram_size - 1, | 811 | start, start + ram_size - 1, |
| 794 | locked_page, unlock, 1, | 812 | locked_page, op); |
| 795 | 1, 0, 0, 0, 1); | ||
| 796 | disk_num_bytes -= cur_alloc_size; | 813 | disk_num_bytes -= cur_alloc_size; |
| 797 | num_bytes -= cur_alloc_size; | 814 | num_bytes -= cur_alloc_size; |
| 798 | alloc_hint = ins.objectid + ins.offset; | 815 | alloc_hint = ins.objectid + ins.offset; |
| @@ -864,8 +881,8 @@ static int cow_file_range_async(struct inode *inode, struct page *locked_page, | |||
| 864 | u64 cur_end; | 881 | u64 cur_end; |
| 865 | int limit = 10 * 1024 * 1042; | 882 | int limit = 10 * 1024 * 1042; |
| 866 | 883 | ||
| 867 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED | | 884 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED, |
| 868 | EXTENT_DELALLOC, 1, 0, NULL, GFP_NOFS); | 885 | 1, 0, NULL, GFP_NOFS); |
| 869 | while (start < end) { | 886 | while (start < end) { |
| 870 | async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS); | 887 | async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS); |
| 871 | async_cow->inode = inode; | 888 | async_cow->inode = inode; |
| @@ -1006,6 +1023,7 @@ next_slot: | |||
| 1006 | 1023 | ||
| 1007 | if (found_key.offset > cur_offset) { | 1024 | if (found_key.offset > cur_offset) { |
| 1008 | extent_end = found_key.offset; | 1025 | extent_end = found_key.offset; |
| 1026 | extent_type = 0; | ||
| 1009 | goto out_check; | 1027 | goto out_check; |
| 1010 | } | 1028 | } |
| 1011 | 1029 | ||
| @@ -1112,8 +1130,10 @@ out_check: | |||
| 1112 | BUG_ON(ret); | 1130 | BUG_ON(ret); |
| 1113 | 1131 | ||
| 1114 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, | 1132 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
| 1115 | cur_offset, cur_offset + num_bytes - 1, | 1133 | cur_offset, cur_offset + num_bytes - 1, |
| 1116 | locked_page, 1, 1, 1, 0, 0, 0, 1); | 1134 | locked_page, EXTENT_CLEAR_UNLOCK_PAGE | |
| 1135 | EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | ||
| 1136 | EXTENT_SET_PRIVATE2); | ||
| 1117 | cur_offset = extent_end; | 1137 | cur_offset = extent_end; |
| 1118 | if (cur_offset > end) | 1138 | if (cur_offset > end) |
| 1119 | break; | 1139 | break; |
| @@ -1178,15 +1198,17 @@ static int btrfs_split_extent_hook(struct inode *inode, | |||
| 1178 | root->fs_info->max_extent); | 1198 | root->fs_info->max_extent); |
| 1179 | 1199 | ||
| 1180 | /* | 1200 | /* |
| 1181 | * if we break a large extent up then leave delalloc_extents be, | 1201 | * if we break a large extent up then leave oustanding_extents |
| 1182 | * since we've already accounted for the large extent. | 1202 | * be, since we've already accounted for the large extent. |
| 1183 | */ | 1203 | */ |
| 1184 | if (div64_u64(new_size + root->fs_info->max_extent - 1, | 1204 | if (div64_u64(new_size + root->fs_info->max_extent - 1, |
| 1185 | root->fs_info->max_extent) < num_extents) | 1205 | root->fs_info->max_extent) < num_extents) |
| 1186 | return 0; | 1206 | return 0; |
| 1187 | } | 1207 | } |
| 1188 | 1208 | ||
| 1189 | BTRFS_I(inode)->delalloc_extents++; | 1209 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 1210 | BTRFS_I(inode)->outstanding_extents++; | ||
| 1211 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 1190 | 1212 | ||
| 1191 | return 0; | 1213 | return 0; |
| 1192 | } | 1214 | } |
| @@ -1217,7 +1239,9 @@ static int btrfs_merge_extent_hook(struct inode *inode, | |||
| 1217 | 1239 | ||
| 1218 | /* we're not bigger than the max, unreserve the space and go */ | 1240 | /* we're not bigger than the max, unreserve the space and go */ |
| 1219 | if (new_size <= root->fs_info->max_extent) { | 1241 | if (new_size <= root->fs_info->max_extent) { |
| 1220 | BTRFS_I(inode)->delalloc_extents--; | 1242 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 1243 | BTRFS_I(inode)->outstanding_extents--; | ||
| 1244 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 1221 | return 0; | 1245 | return 0; |
| 1222 | } | 1246 | } |
| 1223 | 1247 | ||
| @@ -1231,7 +1255,9 @@ static int btrfs_merge_extent_hook(struct inode *inode, | |||
| 1231 | root->fs_info->max_extent) > num_extents) | 1255 | root->fs_info->max_extent) > num_extents) |
| 1232 | return 0; | 1256 | return 0; |
| 1233 | 1257 | ||
| 1234 | BTRFS_I(inode)->delalloc_extents--; | 1258 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 1259 | BTRFS_I(inode)->outstanding_extents--; | ||
| 1260 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 1235 | 1261 | ||
| 1236 | return 0; | 1262 | return 0; |
| 1237 | } | 1263 | } |
| @@ -1253,7 +1279,9 @@ static int btrfs_set_bit_hook(struct inode *inode, u64 start, u64 end, | |||
| 1253 | if (!(old & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { | 1279 | if (!(old & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
| 1254 | struct btrfs_root *root = BTRFS_I(inode)->root; | 1280 | struct btrfs_root *root = BTRFS_I(inode)->root; |
| 1255 | 1281 | ||
| 1256 | BTRFS_I(inode)->delalloc_extents++; | 1282 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 1283 | BTRFS_I(inode)->outstanding_extents++; | ||
| 1284 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 1257 | btrfs_delalloc_reserve_space(root, inode, end - start + 1); | 1285 | btrfs_delalloc_reserve_space(root, inode, end - start + 1); |
| 1258 | spin_lock(&root->fs_info->delalloc_lock); | 1286 | spin_lock(&root->fs_info->delalloc_lock); |
| 1259 | BTRFS_I(inode)->delalloc_bytes += end - start + 1; | 1287 | BTRFS_I(inode)->delalloc_bytes += end - start + 1; |
| @@ -1281,8 +1309,12 @@ static int btrfs_clear_bit_hook(struct inode *inode, | |||
| 1281 | if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { | 1309 | if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
| 1282 | struct btrfs_root *root = BTRFS_I(inode)->root; | 1310 | struct btrfs_root *root = BTRFS_I(inode)->root; |
| 1283 | 1311 | ||
| 1284 | BTRFS_I(inode)->delalloc_extents--; | 1312 | if (bits & EXTENT_DO_ACCOUNTING) { |
| 1285 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | 1313 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
| 1314 | BTRFS_I(inode)->outstanding_extents--; | ||
| 1315 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 1316 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | ||
| 1317 | } | ||
| 1286 | 1318 | ||
| 1287 | spin_lock(&root->fs_info->delalloc_lock); | 1319 | spin_lock(&root->fs_info->delalloc_lock); |
| 1288 | if (state->end - state->start + 1 > | 1320 | if (state->end - state->start + 1 > |
| @@ -3000,12 +3032,22 @@ static int btrfs_truncate_page(struct address_space *mapping, loff_t from) | |||
| 3000 | 3032 | ||
| 3001 | if ((offset & (blocksize - 1)) == 0) | 3033 | if ((offset & (blocksize - 1)) == 0) |
| 3002 | goto out; | 3034 | goto out; |
| 3035 | ret = btrfs_check_data_free_space(root, inode, PAGE_CACHE_SIZE); | ||
| 3036 | if (ret) | ||
| 3037 | goto out; | ||
| 3038 | |||
| 3039 | ret = btrfs_reserve_metadata_for_delalloc(root, inode, 1); | ||
| 3040 | if (ret) | ||
| 3041 | goto out; | ||
| 3003 | 3042 | ||
| 3004 | ret = -ENOMEM; | 3043 | ret = -ENOMEM; |
| 3005 | again: | 3044 | again: |
| 3006 | page = grab_cache_page(mapping, index); | 3045 | page = grab_cache_page(mapping, index); |
| 3007 | if (!page) | 3046 | if (!page) { |
| 3047 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); | ||
| 3048 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | ||
| 3008 | goto out; | 3049 | goto out; |
| 3050 | } | ||
| 3009 | 3051 | ||
| 3010 | page_start = page_offset(page); | 3052 | page_start = page_offset(page); |
| 3011 | page_end = page_start + PAGE_CACHE_SIZE - 1; | 3053 | page_end = page_start + PAGE_CACHE_SIZE - 1; |
| @@ -3038,6 +3080,10 @@ again: | |||
| 3038 | goto again; | 3080 | goto again; |
| 3039 | } | 3081 | } |
| 3040 | 3082 | ||
| 3083 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, | ||
| 3084 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, | ||
| 3085 | GFP_NOFS); | ||
| 3086 | |||
| 3041 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); | 3087 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); |
| 3042 | if (ret) { | 3088 | if (ret) { |
| 3043 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | 3089 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); |
| @@ -3056,6 +3102,9 @@ again: | |||
| 3056 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | 3102 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); |
| 3057 | 3103 | ||
| 3058 | out_unlock: | 3104 | out_unlock: |
| 3105 | if (ret) | ||
| 3106 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); | ||
| 3107 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | ||
| 3059 | unlock_page(page); | 3108 | unlock_page(page); |
| 3060 | page_cache_release(page); | 3109 | page_cache_release(page); |
| 3061 | out: | 3110 | out: |
| @@ -3079,7 +3128,9 @@ int btrfs_cont_expand(struct inode *inode, loff_t size) | |||
| 3079 | if (size <= hole_start) | 3128 | if (size <= hole_start) |
| 3080 | return 0; | 3129 | return 0; |
| 3081 | 3130 | ||
| 3082 | btrfs_truncate_page(inode->i_mapping, inode->i_size); | 3131 | err = btrfs_truncate_page(inode->i_mapping, inode->i_size); |
| 3132 | if (err) | ||
| 3133 | return err; | ||
| 3083 | 3134 | ||
| 3084 | while (1) { | 3135 | while (1) { |
| 3085 | struct btrfs_ordered_extent *ordered; | 3136 | struct btrfs_ordered_extent *ordered; |
| @@ -3448,6 +3499,7 @@ static noinline void init_btrfs_i(struct inode *inode) | |||
| 3448 | bi->generation = 0; | 3499 | bi->generation = 0; |
| 3449 | bi->sequence = 0; | 3500 | bi->sequence = 0; |
| 3450 | bi->last_trans = 0; | 3501 | bi->last_trans = 0; |
| 3502 | bi->last_sub_trans = 0; | ||
| 3451 | bi->logged_trans = 0; | 3503 | bi->logged_trans = 0; |
| 3452 | bi->delalloc_bytes = 0; | 3504 | bi->delalloc_bytes = 0; |
| 3453 | bi->reserved_bytes = 0; | 3505 | bi->reserved_bytes = 0; |
| @@ -3598,12 +3650,14 @@ static int btrfs_dentry_delete(struct dentry *dentry) | |||
| 3598 | { | 3650 | { |
| 3599 | struct btrfs_root *root; | 3651 | struct btrfs_root *root; |
| 3600 | 3652 | ||
| 3601 | if (!dentry->d_inode) | 3653 | if (!dentry->d_inode && !IS_ROOT(dentry)) |
| 3602 | return 0; | 3654 | dentry = dentry->d_parent; |
| 3603 | 3655 | ||
| 3604 | root = BTRFS_I(dentry->d_inode)->root; | 3656 | if (dentry->d_inode) { |
| 3605 | if (btrfs_root_refs(&root->root_item) == 0) | 3657 | root = BTRFS_I(dentry->d_inode)->root; |
| 3606 | return 1; | 3658 | if (btrfs_root_refs(&root->root_item) == 0) |
| 3659 | return 1; | ||
| 3660 | } | ||
| 3607 | return 0; | 3661 | return 0; |
| 3608 | } | 3662 | } |
| 3609 | 3663 | ||
| @@ -4808,7 +4862,8 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset) | |||
| 4808 | */ | 4862 | */ |
| 4809 | clear_extent_bit(tree, page_start, page_end, | 4863 | clear_extent_bit(tree, page_start, page_end, |
| 4810 | EXTENT_DIRTY | EXTENT_DELALLOC | | 4864 | EXTENT_DIRTY | EXTENT_DELALLOC | |
| 4811 | EXTENT_LOCKED, 1, 0, NULL, GFP_NOFS); | 4865 | EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0, |
| 4866 | NULL, GFP_NOFS); | ||
| 4812 | /* | 4867 | /* |
| 4813 | * whoever cleared the private bit is responsible | 4868 | * whoever cleared the private bit is responsible |
| 4814 | * for the finish_ordered_io | 4869 | * for the finish_ordered_io |
| @@ -4821,8 +4876,8 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset) | |||
| 4821 | lock_extent(tree, page_start, page_end, GFP_NOFS); | 4876 | lock_extent(tree, page_start, page_end, GFP_NOFS); |
| 4822 | } | 4877 | } |
| 4823 | clear_extent_bit(tree, page_start, page_end, | 4878 | clear_extent_bit(tree, page_start, page_end, |
| 4824 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC, | 4879 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
| 4825 | 1, 1, NULL, GFP_NOFS); | 4880 | EXTENT_DO_ACCOUNTING, 1, 1, NULL, GFP_NOFS); |
| 4826 | __btrfs_releasepage(page, GFP_NOFS); | 4881 | __btrfs_releasepage(page, GFP_NOFS); |
| 4827 | 4882 | ||
| 4828 | ClearPageChecked(page); | 4883 | ClearPageChecked(page); |
| @@ -4917,7 +4972,8 @@ again: | |||
| 4917 | * prepare_pages in the normal write path. | 4972 | * prepare_pages in the normal write path. |
| 4918 | */ | 4973 | */ |
| 4919 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, | 4974 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, |
| 4920 | EXTENT_DIRTY | EXTENT_DELALLOC, GFP_NOFS); | 4975 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, |
| 4976 | GFP_NOFS); | ||
| 4921 | 4977 | ||
| 4922 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); | 4978 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); |
| 4923 | if (ret) { | 4979 | if (ret) { |
| @@ -4944,7 +5000,9 @@ again: | |||
| 4944 | set_page_dirty(page); | 5000 | set_page_dirty(page); |
| 4945 | SetPageUptodate(page); | 5001 | SetPageUptodate(page); |
| 4946 | 5002 | ||
| 4947 | BTRFS_I(inode)->last_trans = root->fs_info->generation + 1; | 5003 | BTRFS_I(inode)->last_trans = root->fs_info->generation; |
| 5004 | BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid; | ||
| 5005 | |||
| 4948 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | 5006 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); |
| 4949 | 5007 | ||
| 4950 | out_unlock: | 5008 | out_unlock: |
| @@ -4969,7 +5027,9 @@ static void btrfs_truncate(struct inode *inode) | |||
| 4969 | if (IS_APPEND(inode) || IS_IMMUTABLE(inode)) | 5027 | if (IS_APPEND(inode) || IS_IMMUTABLE(inode)) |
| 4970 | return; | 5028 | return; |
| 4971 | 5029 | ||
| 4972 | btrfs_truncate_page(inode->i_mapping, inode->i_size); | 5030 | ret = btrfs_truncate_page(inode->i_mapping, inode->i_size); |
| 5031 | if (ret) | ||
| 5032 | return; | ||
| 4973 | btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1); | 5033 | btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1); |
| 4974 | 5034 | ||
| 4975 | trans = btrfs_start_transaction(root, 1); | 5035 | trans = btrfs_start_transaction(root, 1); |
| @@ -5064,9 +5124,11 @@ struct inode *btrfs_alloc_inode(struct super_block *sb) | |||
| 5064 | if (!ei) | 5124 | if (!ei) |
| 5065 | return NULL; | 5125 | return NULL; |
| 5066 | ei->last_trans = 0; | 5126 | ei->last_trans = 0; |
| 5127 | ei->last_sub_trans = 0; | ||
| 5067 | ei->logged_trans = 0; | 5128 | ei->logged_trans = 0; |
| 5068 | ei->delalloc_extents = 0; | 5129 | ei->outstanding_extents = 0; |
| 5069 | ei->delalloc_reserved_extents = 0; | 5130 | ei->reserved_extents = 0; |
| 5131 | spin_lock_init(&ei->accounting_lock); | ||
| 5070 | btrfs_ordered_inode_tree_init(&ei->ordered_tree); | 5132 | btrfs_ordered_inode_tree_init(&ei->ordered_tree); |
| 5071 | INIT_LIST_HEAD(&ei->i_orphan); | 5133 | INIT_LIST_HEAD(&ei->i_orphan); |
| 5072 | INIT_LIST_HEAD(&ei->ordered_operations); | 5134 | INIT_LIST_HEAD(&ei->ordered_operations); |
| @@ -5805,6 +5867,6 @@ static const struct inode_operations btrfs_symlink_inode_operations = { | |||
| 5805 | .removexattr = btrfs_removexattr, | 5867 | .removexattr = btrfs_removexattr, |
| 5806 | }; | 5868 | }; |
| 5807 | 5869 | ||
| 5808 | struct dentry_operations btrfs_dentry_operations = { | 5870 | const struct dentry_operations btrfs_dentry_operations = { |
| 5809 | .d_delete = btrfs_dentry_delete, | 5871 | .d_delete = btrfs_dentry_delete, |
| 5810 | }; | 5872 | }; |
diff --git a/fs/btrfs/ioctl.c b/fs/btrfs/ioctl.c index 9a780c8d0ac8..cdbb054102b9 100644 --- a/fs/btrfs/ioctl.c +++ b/fs/btrfs/ioctl.c | |||
| @@ -830,6 +830,7 @@ out_up_write: | |||
| 830 | out_unlock: | 830 | out_unlock: |
| 831 | mutex_unlock(&inode->i_mutex); | 831 | mutex_unlock(&inode->i_mutex); |
| 832 | if (!err) { | 832 | if (!err) { |
| 833 | shrink_dcache_sb(root->fs_info->sb); | ||
| 833 | btrfs_invalidate_inodes(dest); | 834 | btrfs_invalidate_inodes(dest); |
| 834 | d_delete(dentry); | 835 | d_delete(dentry); |
| 835 | } | 836 | } |
| @@ -1122,8 +1123,10 @@ static noinline long btrfs_ioctl_clone(struct file *file, unsigned long srcfd, | |||
| 1122 | datao += off - key.offset; | 1123 | datao += off - key.offset; |
| 1123 | datal -= off - key.offset; | 1124 | datal -= off - key.offset; |
| 1124 | } | 1125 | } |
| 1125 | if (key.offset + datao + datal > off + len) | 1126 | |
| 1126 | datal = off + len - key.offset - datao; | 1127 | if (key.offset + datal > off + len) |
| 1128 | datal = off + len - key.offset; | ||
| 1129 | |||
| 1127 | /* disko == 0 means it's a hole */ | 1130 | /* disko == 0 means it's a hole */ |
| 1128 | if (!disko) | 1131 | if (!disko) |
| 1129 | datao = 0; | 1132 | datao = 0; |
diff --git a/fs/btrfs/ordered-data.c b/fs/btrfs/ordered-data.c index 897fba835f89..5799bc46a309 100644 --- a/fs/btrfs/ordered-data.c +++ b/fs/btrfs/ordered-data.c | |||
| @@ -306,6 +306,12 @@ int btrfs_remove_ordered_extent(struct inode *inode, | |||
| 306 | tree->last = NULL; | 306 | tree->last = NULL; |
| 307 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); | 307 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
| 308 | 308 | ||
| 309 | spin_lock(&BTRFS_I(inode)->accounting_lock); | ||
| 310 | BTRFS_I(inode)->outstanding_extents--; | ||
| 311 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | ||
| 312 | btrfs_unreserve_metadata_for_delalloc(BTRFS_I(inode)->root, | ||
| 313 | inode, 1); | ||
| 314 | |||
| 309 | spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); | 315 | spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); |
| 310 | list_del_init(&entry->root_extent_list); | 316 | list_del_init(&entry->root_extent_list); |
| 311 | 317 | ||
diff --git a/fs/btrfs/relocation.c b/fs/btrfs/relocation.c index 361ad323faac..cfcc93c93a7b 100644 --- a/fs/btrfs/relocation.c +++ b/fs/btrfs/relocation.c | |||
| @@ -3518,7 +3518,7 @@ int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) | |||
| 3518 | BUG_ON(!rc->block_group); | 3518 | BUG_ON(!rc->block_group); |
| 3519 | 3519 | ||
| 3520 | btrfs_init_workers(&rc->workers, "relocate", | 3520 | btrfs_init_workers(&rc->workers, "relocate", |
| 3521 | fs_info->thread_pool_size); | 3521 | fs_info->thread_pool_size, NULL); |
| 3522 | 3522 | ||
| 3523 | rc->extent_root = extent_root; | 3523 | rc->extent_root = extent_root; |
| 3524 | btrfs_prepare_block_group_relocation(extent_root, rc->block_group); | 3524 | btrfs_prepare_block_group_relocation(extent_root, rc->block_group); |
| @@ -3701,7 +3701,7 @@ int btrfs_recover_relocation(struct btrfs_root *root) | |||
| 3701 | mapping_tree_init(&rc->reloc_root_tree); | 3701 | mapping_tree_init(&rc->reloc_root_tree); |
| 3702 | INIT_LIST_HEAD(&rc->reloc_roots); | 3702 | INIT_LIST_HEAD(&rc->reloc_roots); |
| 3703 | btrfs_init_workers(&rc->workers, "relocate", | 3703 | btrfs_init_workers(&rc->workers, "relocate", |
| 3704 | root->fs_info->thread_pool_size); | 3704 | root->fs_info->thread_pool_size, NULL); |
| 3705 | rc->extent_root = root->fs_info->extent_root; | 3705 | rc->extent_root = root->fs_info->extent_root; |
| 3706 | 3706 | ||
| 3707 | set_reloc_control(rc); | 3707 | set_reloc_control(rc); |
diff --git a/fs/btrfs/super.c b/fs/btrfs/super.c index 9de9b2236419..752a5463bf53 100644 --- a/fs/btrfs/super.c +++ b/fs/btrfs/super.c | |||
| @@ -66,7 +66,8 @@ enum { | |||
| 66 | Opt_degraded, Opt_subvol, Opt_device, Opt_nodatasum, Opt_nodatacow, | 66 | Opt_degraded, Opt_subvol, Opt_device, Opt_nodatasum, Opt_nodatacow, |
| 67 | Opt_max_extent, Opt_max_inline, Opt_alloc_start, Opt_nobarrier, | 67 | Opt_max_extent, Opt_max_inline, Opt_alloc_start, Opt_nobarrier, |
| 68 | Opt_ssd, Opt_nossd, Opt_ssd_spread, Opt_thread_pool, Opt_noacl, | 68 | Opt_ssd, Opt_nossd, Opt_ssd_spread, Opt_thread_pool, Opt_noacl, |
| 69 | Opt_compress, Opt_notreelog, Opt_ratio, Opt_flushoncommit, Opt_err, | 69 | Opt_compress, Opt_notreelog, Opt_ratio, Opt_flushoncommit, |
| 70 | Opt_discard, Opt_err, | ||
| 70 | }; | 71 | }; |
| 71 | 72 | ||
| 72 | static match_table_t tokens = { | 73 | static match_table_t tokens = { |
| @@ -88,6 +89,7 @@ static match_table_t tokens = { | |||
| 88 | {Opt_notreelog, "notreelog"}, | 89 | {Opt_notreelog, "notreelog"}, |
| 89 | {Opt_flushoncommit, "flushoncommit"}, | 90 | {Opt_flushoncommit, "flushoncommit"}, |
| 90 | {Opt_ratio, "metadata_ratio=%d"}, | 91 | {Opt_ratio, "metadata_ratio=%d"}, |
| 92 | {Opt_discard, "discard"}, | ||
| 91 | {Opt_err, NULL}, | 93 | {Opt_err, NULL}, |
| 92 | }; | 94 | }; |
| 93 | 95 | ||
| @@ -257,6 +259,9 @@ int btrfs_parse_options(struct btrfs_root *root, char *options) | |||
| 257 | info->metadata_ratio); | 259 | info->metadata_ratio); |
| 258 | } | 260 | } |
| 259 | break; | 261 | break; |
| 262 | case Opt_discard: | ||
| 263 | btrfs_set_opt(info->mount_opt, DISCARD); | ||
| 264 | break; | ||
| 260 | default: | 265 | default: |
| 261 | break; | 266 | break; |
| 262 | } | 267 | } |
| @@ -344,7 +349,7 @@ static int btrfs_fill_super(struct super_block *sb, | |||
| 344 | sb->s_export_op = &btrfs_export_ops; | 349 | sb->s_export_op = &btrfs_export_ops; |
| 345 | sb->s_xattr = btrfs_xattr_handlers; | 350 | sb->s_xattr = btrfs_xattr_handlers; |
| 346 | sb->s_time_gran = 1; | 351 | sb->s_time_gran = 1; |
| 347 | #ifdef CONFIG_BTRFS_POSIX_ACL | 352 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL |
| 348 | sb->s_flags |= MS_POSIXACL; | 353 | sb->s_flags |= MS_POSIXACL; |
| 349 | #endif | 354 | #endif |
| 350 | 355 | ||
diff --git a/fs/btrfs/transaction.c b/fs/btrfs/transaction.c index 0b8f36d4400a..bca82a4ca8e6 100644 --- a/fs/btrfs/transaction.c +++ b/fs/btrfs/transaction.c | |||
| @@ -344,10 +344,10 @@ int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |||
| 344 | /* | 344 | /* |
| 345 | * when btree blocks are allocated, they have some corresponding bits set for | 345 | * when btree blocks are allocated, they have some corresponding bits set for |
| 346 | * them in one of two extent_io trees. This is used to make sure all of | 346 | * them in one of two extent_io trees. This is used to make sure all of |
| 347 | * those extents are on disk for transaction or log commit | 347 | * those extents are sent to disk but does not wait on them |
| 348 | */ | 348 | */ |
| 349 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | 349 | int btrfs_write_marked_extents(struct btrfs_root *root, |
| 350 | struct extent_io_tree *dirty_pages) | 350 | struct extent_io_tree *dirty_pages) |
| 351 | { | 351 | { |
| 352 | int ret; | 352 | int ret; |
| 353 | int err = 0; | 353 | int err = 0; |
| @@ -394,6 +394,29 @@ int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | |||
| 394 | page_cache_release(page); | 394 | page_cache_release(page); |
| 395 | } | 395 | } |
| 396 | } | 396 | } |
| 397 | if (err) | ||
| 398 | werr = err; | ||
| 399 | return werr; | ||
| 400 | } | ||
| 401 | |||
| 402 | /* | ||
| 403 | * when btree blocks are allocated, they have some corresponding bits set for | ||
| 404 | * them in one of two extent_io trees. This is used to make sure all of | ||
| 405 | * those extents are on disk for transaction or log commit. We wait | ||
| 406 | * on all the pages and clear them from the dirty pages state tree | ||
| 407 | */ | ||
| 408 | int btrfs_wait_marked_extents(struct btrfs_root *root, | ||
| 409 | struct extent_io_tree *dirty_pages) | ||
| 410 | { | ||
| 411 | int ret; | ||
| 412 | int err = 0; | ||
| 413 | int werr = 0; | ||
| 414 | struct page *page; | ||
| 415 | struct inode *btree_inode = root->fs_info->btree_inode; | ||
| 416 | u64 start = 0; | ||
| 417 | u64 end; | ||
| 418 | unsigned long index; | ||
| 419 | |||
| 397 | while (1) { | 420 | while (1) { |
| 398 | ret = find_first_extent_bit(dirty_pages, 0, &start, &end, | 421 | ret = find_first_extent_bit(dirty_pages, 0, &start, &end, |
| 399 | EXTENT_DIRTY); | 422 | EXTENT_DIRTY); |
| @@ -424,6 +447,22 @@ int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | |||
| 424 | return werr; | 447 | return werr; |
| 425 | } | 448 | } |
| 426 | 449 | ||
| 450 | /* | ||
| 451 | * when btree blocks are allocated, they have some corresponding bits set for | ||
| 452 | * them in one of two extent_io trees. This is used to make sure all of | ||
| 453 | * those extents are on disk for transaction or log commit | ||
| 454 | */ | ||
| 455 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | ||
| 456 | struct extent_io_tree *dirty_pages) | ||
| 457 | { | ||
| 458 | int ret; | ||
| 459 | int ret2; | ||
| 460 | |||
| 461 | ret = btrfs_write_marked_extents(root, dirty_pages); | ||
| 462 | ret2 = btrfs_wait_marked_extents(root, dirty_pages); | ||
| 463 | return ret || ret2; | ||
| 464 | } | ||
| 465 | |||
| 427 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, | 466 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
| 428 | struct btrfs_root *root) | 467 | struct btrfs_root *root) |
| 429 | { | 468 | { |
diff --git a/fs/btrfs/transaction.h b/fs/btrfs/transaction.h index 663c67404918..d4e3e7a6938c 100644 --- a/fs/btrfs/transaction.h +++ b/fs/btrfs/transaction.h | |||
| @@ -79,6 +79,7 @@ static inline void btrfs_set_inode_last_trans(struct btrfs_trans_handle *trans, | |||
| 79 | struct inode *inode) | 79 | struct inode *inode) |
| 80 | { | 80 | { |
| 81 | BTRFS_I(inode)->last_trans = trans->transaction->transid; | 81 | BTRFS_I(inode)->last_trans = trans->transaction->transid; |
| 82 | BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid; | ||
| 82 | } | 83 | } |
| 83 | 84 | ||
| 84 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, | 85 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
| @@ -107,5 +108,9 @@ int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, | |||
| 107 | struct btrfs_root *root); | 108 | struct btrfs_root *root); |
| 108 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | 109 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, |
| 109 | struct extent_io_tree *dirty_pages); | 110 | struct extent_io_tree *dirty_pages); |
| 111 | int btrfs_write_marked_extents(struct btrfs_root *root, | ||
| 112 | struct extent_io_tree *dirty_pages); | ||
| 113 | int btrfs_wait_marked_extents(struct btrfs_root *root, | ||
| 114 | struct extent_io_tree *dirty_pages); | ||
| 110 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info); | 115 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info); |
| 111 | #endif | 116 | #endif |
diff --git a/fs/btrfs/tree-log.c b/fs/btrfs/tree-log.c index 7827841b55cb..741666a7676a 100644 --- a/fs/btrfs/tree-log.c +++ b/fs/btrfs/tree-log.c | |||
| @@ -137,11 +137,20 @@ static int start_log_trans(struct btrfs_trans_handle *trans, | |||
| 137 | 137 | ||
| 138 | mutex_lock(&root->log_mutex); | 138 | mutex_lock(&root->log_mutex); |
| 139 | if (root->log_root) { | 139 | if (root->log_root) { |
| 140 | if (!root->log_start_pid) { | ||
| 141 | root->log_start_pid = current->pid; | ||
| 142 | root->log_multiple_pids = false; | ||
| 143 | } else if (root->log_start_pid != current->pid) { | ||
| 144 | root->log_multiple_pids = true; | ||
| 145 | } | ||
| 146 | |||
| 140 | root->log_batch++; | 147 | root->log_batch++; |
| 141 | atomic_inc(&root->log_writers); | 148 | atomic_inc(&root->log_writers); |
| 142 | mutex_unlock(&root->log_mutex); | 149 | mutex_unlock(&root->log_mutex); |
| 143 | return 0; | 150 | return 0; |
| 144 | } | 151 | } |
| 152 | root->log_multiple_pids = false; | ||
| 153 | root->log_start_pid = current->pid; | ||
| 145 | mutex_lock(&root->fs_info->tree_log_mutex); | 154 | mutex_lock(&root->fs_info->tree_log_mutex); |
| 146 | if (!root->fs_info->log_root_tree) { | 155 | if (!root->fs_info->log_root_tree) { |
| 147 | ret = btrfs_init_log_root_tree(trans, root->fs_info); | 156 | ret = btrfs_init_log_root_tree(trans, root->fs_info); |
| @@ -1971,6 +1980,7 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 1971 | int ret; | 1980 | int ret; |
| 1972 | struct btrfs_root *log = root->log_root; | 1981 | struct btrfs_root *log = root->log_root; |
| 1973 | struct btrfs_root *log_root_tree = root->fs_info->log_root_tree; | 1982 | struct btrfs_root *log_root_tree = root->fs_info->log_root_tree; |
| 1983 | u64 log_transid = 0; | ||
| 1974 | 1984 | ||
| 1975 | mutex_lock(&root->log_mutex); | 1985 | mutex_lock(&root->log_mutex); |
| 1976 | index1 = root->log_transid % 2; | 1986 | index1 = root->log_transid % 2; |
| @@ -1987,10 +1997,11 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 1987 | 1997 | ||
| 1988 | while (1) { | 1998 | while (1) { |
| 1989 | unsigned long batch = root->log_batch; | 1999 | unsigned long batch = root->log_batch; |
| 1990 | mutex_unlock(&root->log_mutex); | 2000 | if (root->log_multiple_pids) { |
| 1991 | schedule_timeout_uninterruptible(1); | 2001 | mutex_unlock(&root->log_mutex); |
| 1992 | mutex_lock(&root->log_mutex); | 2002 | schedule_timeout_uninterruptible(1); |
| 1993 | 2003 | mutex_lock(&root->log_mutex); | |
| 2004 | } | ||
| 1994 | wait_for_writer(trans, root); | 2005 | wait_for_writer(trans, root); |
| 1995 | if (batch == root->log_batch) | 2006 | if (batch == root->log_batch) |
| 1996 | break; | 2007 | break; |
| @@ -2003,14 +2014,19 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 2003 | goto out; | 2014 | goto out; |
| 2004 | } | 2015 | } |
| 2005 | 2016 | ||
| 2006 | ret = btrfs_write_and_wait_marked_extents(log, &log->dirty_log_pages); | 2017 | /* we start IO on all the marked extents here, but we don't actually |
| 2018 | * wait for them until later. | ||
| 2019 | */ | ||
| 2020 | ret = btrfs_write_marked_extents(log, &log->dirty_log_pages); | ||
| 2007 | BUG_ON(ret); | 2021 | BUG_ON(ret); |
| 2008 | 2022 | ||
| 2009 | btrfs_set_root_node(&log->root_item, log->node); | 2023 | btrfs_set_root_node(&log->root_item, log->node); |
| 2010 | 2024 | ||
| 2011 | root->log_batch = 0; | 2025 | root->log_batch = 0; |
| 2026 | log_transid = root->log_transid; | ||
| 2012 | root->log_transid++; | 2027 | root->log_transid++; |
| 2013 | log->log_transid = root->log_transid; | 2028 | log->log_transid = root->log_transid; |
| 2029 | root->log_start_pid = 0; | ||
| 2014 | smp_mb(); | 2030 | smp_mb(); |
| 2015 | /* | 2031 | /* |
| 2016 | * log tree has been flushed to disk, new modifications of | 2032 | * log tree has been flushed to disk, new modifications of |
| @@ -2036,6 +2052,7 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 2036 | 2052 | ||
| 2037 | index2 = log_root_tree->log_transid % 2; | 2053 | index2 = log_root_tree->log_transid % 2; |
| 2038 | if (atomic_read(&log_root_tree->log_commit[index2])) { | 2054 | if (atomic_read(&log_root_tree->log_commit[index2])) { |
| 2055 | btrfs_wait_marked_extents(log, &log->dirty_log_pages); | ||
| 2039 | wait_log_commit(trans, log_root_tree, | 2056 | wait_log_commit(trans, log_root_tree, |
| 2040 | log_root_tree->log_transid); | 2057 | log_root_tree->log_transid); |
| 2041 | mutex_unlock(&log_root_tree->log_mutex); | 2058 | mutex_unlock(&log_root_tree->log_mutex); |
| @@ -2055,6 +2072,7 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 2055 | * check the full commit flag again | 2072 | * check the full commit flag again |
| 2056 | */ | 2073 | */ |
| 2057 | if (root->fs_info->last_trans_log_full_commit == trans->transid) { | 2074 | if (root->fs_info->last_trans_log_full_commit == trans->transid) { |
| 2075 | btrfs_wait_marked_extents(log, &log->dirty_log_pages); | ||
| 2058 | mutex_unlock(&log_root_tree->log_mutex); | 2076 | mutex_unlock(&log_root_tree->log_mutex); |
| 2059 | ret = -EAGAIN; | 2077 | ret = -EAGAIN; |
| 2060 | goto out_wake_log_root; | 2078 | goto out_wake_log_root; |
| @@ -2063,6 +2081,7 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 2063 | ret = btrfs_write_and_wait_marked_extents(log_root_tree, | 2081 | ret = btrfs_write_and_wait_marked_extents(log_root_tree, |
| 2064 | &log_root_tree->dirty_log_pages); | 2082 | &log_root_tree->dirty_log_pages); |
| 2065 | BUG_ON(ret); | 2083 | BUG_ON(ret); |
| 2084 | btrfs_wait_marked_extents(log, &log->dirty_log_pages); | ||
| 2066 | 2085 | ||
| 2067 | btrfs_set_super_log_root(&root->fs_info->super_for_commit, | 2086 | btrfs_set_super_log_root(&root->fs_info->super_for_commit, |
| 2068 | log_root_tree->node->start); | 2087 | log_root_tree->node->start); |
| @@ -2082,9 +2101,14 @@ int btrfs_sync_log(struct btrfs_trans_handle *trans, | |||
| 2082 | * the running transaction open, so a full commit can't hop | 2101 | * the running transaction open, so a full commit can't hop |
| 2083 | * in and cause problems either. | 2102 | * in and cause problems either. |
| 2084 | */ | 2103 | */ |
| 2085 | write_ctree_super(trans, root->fs_info->tree_root, 2); | 2104 | write_ctree_super(trans, root->fs_info->tree_root, 1); |
| 2086 | ret = 0; | 2105 | ret = 0; |
| 2087 | 2106 | ||
| 2107 | mutex_lock(&root->log_mutex); | ||
| 2108 | if (root->last_log_commit < log_transid) | ||
| 2109 | root->last_log_commit = log_transid; | ||
| 2110 | mutex_unlock(&root->log_mutex); | ||
| 2111 | |||
| 2088 | out_wake_log_root: | 2112 | out_wake_log_root: |
| 2089 | atomic_set(&log_root_tree->log_commit[index2], 0); | 2113 | atomic_set(&log_root_tree->log_commit[index2], 0); |
| 2090 | smp_mb(); | 2114 | smp_mb(); |
| @@ -2852,6 +2876,21 @@ out: | |||
| 2852 | return ret; | 2876 | return ret; |
| 2853 | } | 2877 | } |
| 2854 | 2878 | ||
| 2879 | static int inode_in_log(struct btrfs_trans_handle *trans, | ||
| 2880 | struct inode *inode) | ||
| 2881 | { | ||
| 2882 | struct btrfs_root *root = BTRFS_I(inode)->root; | ||
| 2883 | int ret = 0; | ||
| 2884 | |||
| 2885 | mutex_lock(&root->log_mutex); | ||
| 2886 | if (BTRFS_I(inode)->logged_trans == trans->transid && | ||
| 2887 | BTRFS_I(inode)->last_sub_trans <= root->last_log_commit) | ||
| 2888 | ret = 1; | ||
| 2889 | mutex_unlock(&root->log_mutex); | ||
| 2890 | return ret; | ||
| 2891 | } | ||
| 2892 | |||
| 2893 | |||
| 2855 | /* | 2894 | /* |
| 2856 | * helper function around btrfs_log_inode to make sure newly created | 2895 | * helper function around btrfs_log_inode to make sure newly created |
| 2857 | * parent directories also end up in the log. A minimal inode and backref | 2896 | * parent directories also end up in the log. A minimal inode and backref |
| @@ -2891,6 +2930,11 @@ int btrfs_log_inode_parent(struct btrfs_trans_handle *trans, | |||
| 2891 | if (ret) | 2930 | if (ret) |
| 2892 | goto end_no_trans; | 2931 | goto end_no_trans; |
| 2893 | 2932 | ||
| 2933 | if (inode_in_log(trans, inode)) { | ||
| 2934 | ret = BTRFS_NO_LOG_SYNC; | ||
| 2935 | goto end_no_trans; | ||
| 2936 | } | ||
| 2937 | |||
| 2894 | start_log_trans(trans, root); | 2938 | start_log_trans(trans, root); |
| 2895 | 2939 | ||
| 2896 | ret = btrfs_log_inode(trans, root, inode, inode_only); | 2940 | ret = btrfs_log_inode(trans, root, inode, inode_only); |
diff --git a/fs/btrfs/tree-log.h b/fs/btrfs/tree-log.h index d09c7609e16b..0776eacb5083 100644 --- a/fs/btrfs/tree-log.h +++ b/fs/btrfs/tree-log.h | |||
| @@ -19,6 +19,9 @@ | |||
| 19 | #ifndef __TREE_LOG_ | 19 | #ifndef __TREE_LOG_ |
| 20 | #define __TREE_LOG_ | 20 | #define __TREE_LOG_ |
| 21 | 21 | ||
| 22 | /* return value for btrfs_log_dentry_safe that means we don't need to log it at all */ | ||
| 23 | #define BTRFS_NO_LOG_SYNC 256 | ||
| 24 | |||
| 22 | int btrfs_sync_log(struct btrfs_trans_handle *trans, | 25 | int btrfs_sync_log(struct btrfs_trans_handle *trans, |
| 23 | struct btrfs_root *root); | 26 | struct btrfs_root *root); |
| 24 | int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root); | 27 | int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root); |
diff --git a/fs/btrfs/xattr.c b/fs/btrfs/xattr.c index b0fc93f95fd0..b6dd5967c48a 100644 --- a/fs/btrfs/xattr.c +++ b/fs/btrfs/xattr.c | |||
| @@ -260,7 +260,7 @@ err: | |||
| 260 | * attributes are handled directly. | 260 | * attributes are handled directly. |
| 261 | */ | 261 | */ |
| 262 | struct xattr_handler *btrfs_xattr_handlers[] = { | 262 | struct xattr_handler *btrfs_xattr_handlers[] = { |
| 263 | #ifdef CONFIG_BTRFS_POSIX_ACL | 263 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL |
| 264 | &btrfs_xattr_acl_access_handler, | 264 | &btrfs_xattr_acl_access_handler, |
| 265 | &btrfs_xattr_acl_default_handler, | 265 | &btrfs_xattr_acl_default_handler, |
| 266 | #endif | 266 | #endif |
