2 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 #include <linux/stddef.h>
20 #include <linux/errno.h>
21 #include <linux/gfp.h>
22 #include <linux/pagemap.h>
23 #include <linux/init.h>
24 #include <linux/vmalloc.h>
25 #include <linux/bio.h>
26 #include <linux/sysctl.h>
27 #include <linux/proc_fs.h>
28 #include <linux/workqueue.h>
29 #include <linux/percpu.h>
30 #include <linux/blkdev.h>
31 #include <linux/hash.h>
32 #include <linux/kthread.h>
33 #include <linux/migrate.h>
34 #include <linux/backing-dev.h>
35 #include <linux/freezer.h>
36 #include <linux/list_sort.h>
42 #include "xfs_mount.h"
43 #include "xfs_trace.h"
45 static kmem_zone_t *xfs_buf_zone;
46 STATIC int xfsbufd(void *);
47 STATIC void xfs_buf_delwri_queue(xfs_buf_t *, int);
49 static struct workqueue_struct *xfslogd_workqueue;
50 struct workqueue_struct *xfsdatad_workqueue;
51 struct workqueue_struct *xfsconvertd_workqueue;
53 #ifdef XFS_BUF_LOCK_TRACKING
54 # define XB_SET_OWNER(bp) ((bp)->b_last_holder = current->pid)
55 # define XB_CLEAR_OWNER(bp) ((bp)->b_last_holder = -1)
56 # define XB_GET_OWNER(bp) ((bp)->b_last_holder)
58 # define XB_SET_OWNER(bp) do { } while (0)
59 # define XB_CLEAR_OWNER(bp) do { } while (0)
60 # define XB_GET_OWNER(bp) do { } while (0)
63 #define xb_to_gfp(flags) \
64 ((((flags) & XBF_READ_AHEAD) ? __GFP_NORETRY : \
65 ((flags) & XBF_DONT_BLOCK) ? GFP_NOFS : GFP_KERNEL) | __GFP_NOWARN)
67 #define xb_to_km(flags) \
68 (((flags) & XBF_DONT_BLOCK) ? KM_NOFS : KM_SLEEP)
70 #define xfs_buf_allocate(flags) \
71 kmem_zone_alloc(xfs_buf_zone, xb_to_km(flags))
72 #define xfs_buf_deallocate(bp) \
73 kmem_zone_free(xfs_buf_zone, (bp));
80 * Return true if the buffer is vmapped.
82 * The XBF_MAPPED flag is set if the buffer should be mapped, but the
83 * code is clever enough to know it doesn't have to map a single page,
84 * so the check has to be both for XBF_MAPPED and bp->b_page_count > 1.
86 return (bp->b_flags & XBF_MAPPED) && bp->b_page_count > 1;
93 return (bp->b_page_count * PAGE_SIZE) - bp->b_offset;
97 * xfs_buf_lru_add - add a buffer to the LRU.
99 * The LRU takes a new reference to the buffer so that it will only be freed
100 * once the shrinker takes the buffer off the LRU.
106 struct xfs_buftarg *btp = bp->b_target;
108 spin_lock(&btp->bt_lru_lock);
109 if (list_empty(&bp->b_lru)) {
110 atomic_inc(&bp->b_hold);
111 list_add_tail(&bp->b_lru, &btp->bt_lru);
114 spin_unlock(&btp->bt_lru_lock);
118 * xfs_buf_lru_del - remove a buffer from the LRU
120 * The unlocked check is safe here because it only occurs when there are not
121 * b_lru_ref counts left on the inode under the pag->pag_buf_lock. it is there
122 * to optimise the shrinker removing the buffer from the LRU and calling
123 * xfs_buf_free(). i.e. it removes an unnecessary round trip on the
130 struct xfs_buftarg *btp = bp->b_target;
132 if (list_empty(&bp->b_lru))
135 spin_lock(&btp->bt_lru_lock);
136 if (!list_empty(&bp->b_lru)) {
137 list_del_init(&bp->b_lru);
140 spin_unlock(&btp->bt_lru_lock);
144 * When we mark a buffer stale, we remove the buffer from the LRU and clear the
145 * b_lru_ref count so that the buffer is freed immediately when the buffer
146 * reference count falls to zero. If the buffer is already on the LRU, we need
147 * to remove the reference that LRU holds on the buffer.
149 * This prevents build-up of stale buffers on the LRU.
155 bp->b_flags |= XBF_STALE;
156 atomic_set(&(bp)->b_lru_ref, 0);
157 if (!list_empty(&bp->b_lru)) {
158 struct xfs_buftarg *btp = bp->b_target;
160 spin_lock(&btp->bt_lru_lock);
161 if (!list_empty(&bp->b_lru)) {
162 list_del_init(&bp->b_lru);
164 atomic_dec(&bp->b_hold);
166 spin_unlock(&btp->bt_lru_lock);
168 ASSERT(atomic_read(&bp->b_hold) >= 1);
174 xfs_buftarg_t *target,
175 xfs_off_t range_base,
177 xfs_buf_flags_t flags)
180 * We don't want certain flags to appear in b_flags.
182 flags &= ~(XBF_LOCK|XBF_MAPPED|XBF_DONT_BLOCK|XBF_READ_AHEAD);
184 memset(bp, 0, sizeof(xfs_buf_t));
185 atomic_set(&bp->b_hold, 1);
186 atomic_set(&bp->b_lru_ref, 1);
187 init_completion(&bp->b_iowait);
188 INIT_LIST_HEAD(&bp->b_lru);
189 INIT_LIST_HEAD(&bp->b_list);
190 RB_CLEAR_NODE(&bp->b_rbnode);
191 sema_init(&bp->b_sema, 0); /* held, no waiters */
193 bp->b_target = target;
194 bp->b_file_offset = range_base;
196 * Set buffer_length and count_desired to the same value initially.
197 * I/O routines should use count_desired, which will be the same in
198 * most cases but may be reset (e.g. XFS recovery).
200 bp->b_buffer_length = bp->b_count_desired = range_length;
202 bp->b_bn = XFS_BUF_DADDR_NULL;
203 atomic_set(&bp->b_pin_count, 0);
204 init_waitqueue_head(&bp->b_waiters);
206 XFS_STATS_INC(xb_create);
208 trace_xfs_buf_init(bp, _RET_IP_);
212 * Allocate a page array capable of holding a specified number
213 * of pages, and point the page buf at it.
219 xfs_buf_flags_t flags)
221 /* Make sure that we have a page list */
222 if (bp->b_pages == NULL) {
223 bp->b_offset = xfs_buf_poff(bp->b_file_offset);
224 bp->b_page_count = page_count;
225 if (page_count <= XB_PAGES) {
226 bp->b_pages = bp->b_page_array;
228 bp->b_pages = kmem_alloc(sizeof(struct page *) *
229 page_count, xb_to_km(flags));
230 if (bp->b_pages == NULL)
233 memset(bp->b_pages, 0, sizeof(struct page *) * page_count);
239 * Frees b_pages if it was allocated.
245 if (bp->b_pages != bp->b_page_array) {
246 kmem_free(bp->b_pages);
252 * Releases the specified buffer.
254 * The modification state of any associated pages is left unchanged.
255 * The buffer most not be on any hash - use xfs_buf_rele instead for
256 * hashed and refcounted buffers
262 trace_xfs_buf_free(bp, _RET_IP_);
264 ASSERT(list_empty(&bp->b_lru));
266 if (bp->b_flags & _XBF_PAGES) {
269 if (xfs_buf_is_vmapped(bp))
270 vm_unmap_ram(bp->b_addr - bp->b_offset,
273 for (i = 0; i < bp->b_page_count; i++) {
274 struct page *page = bp->b_pages[i];
278 } else if (bp->b_flags & _XBF_KMEM)
279 kmem_free(bp->b_addr);
280 _xfs_buf_free_pages(bp);
281 xfs_buf_deallocate(bp);
285 * Allocates all the pages for buffer in question and builds it's page list.
288 xfs_buf_allocate_memory(
292 size_t size = bp->b_count_desired;
293 size_t nbytes, offset;
294 gfp_t gfp_mask = xb_to_gfp(flags);
295 unsigned short page_count, i;
300 * for buffers that are contained within a single page, just allocate
301 * the memory from the heap - there's no need for the complexity of
302 * page arrays to keep allocation down to order 0.
304 if (bp->b_buffer_length < PAGE_SIZE) {
305 bp->b_addr = kmem_alloc(bp->b_buffer_length, xb_to_km(flags));
307 /* low memory - use alloc_page loop instead */
311 if (((unsigned long)(bp->b_addr + bp->b_buffer_length - 1) &
313 ((unsigned long)bp->b_addr & PAGE_MASK)) {
314 /* b_addr spans two pages - use alloc_page instead */
315 kmem_free(bp->b_addr);
319 bp->b_offset = offset_in_page(bp->b_addr);
320 bp->b_pages = bp->b_page_array;
321 bp->b_pages[0] = virt_to_page(bp->b_addr);
322 bp->b_page_count = 1;
323 bp->b_flags |= XBF_MAPPED | _XBF_KMEM;
328 end = bp->b_file_offset + bp->b_buffer_length;
329 page_count = xfs_buf_btoc(end) - xfs_buf_btoct(bp->b_file_offset);
330 error = _xfs_buf_get_pages(bp, page_count, flags);
334 offset = bp->b_offset;
335 bp->b_flags |= _XBF_PAGES;
337 for (i = 0; i < bp->b_page_count; i++) {
341 page = alloc_page(gfp_mask);
342 if (unlikely(page == NULL)) {
343 if (flags & XBF_READ_AHEAD) {
344 bp->b_page_count = i;
350 * This could deadlock.
352 * But until all the XFS lowlevel code is revamped to
353 * handle buffer allocation failures we can't do much.
355 if (!(++retries % 100))
357 "possible memory allocation deadlock in %s (mode:0x%x)",
360 XFS_STATS_INC(xb_page_retries);
361 congestion_wait(BLK_RW_ASYNC, HZ/50);
365 XFS_STATS_INC(xb_page_found);
367 nbytes = min_t(size_t, size, PAGE_SIZE - offset);
369 bp->b_pages[i] = page;
375 for (i = 0; i < bp->b_page_count; i++)
376 __free_page(bp->b_pages[i]);
381 * Map buffer into kernel address-space if necessary.
388 ASSERT(bp->b_flags & _XBF_PAGES);
389 if (bp->b_page_count == 1) {
390 /* A single page buffer is always mappable */
391 bp->b_addr = page_address(bp->b_pages[0]) + bp->b_offset;
392 bp->b_flags |= XBF_MAPPED;
393 } else if (flags & XBF_MAPPED) {
397 bp->b_addr = vm_map_ram(bp->b_pages, bp->b_page_count,
402 } while (retried++ <= 1);
406 bp->b_addr += bp->b_offset;
407 bp->b_flags |= XBF_MAPPED;
414 * Finding and Reading Buffers
418 * Look up, and creates if absent, a lockable buffer for
419 * a given range of an inode. The buffer is returned
420 * locked. If other overlapping buffers exist, they are
421 * released before the new buffer is created and locked,
422 * which may imply that this call will block until those buffers
423 * are unlocked. No I/O is implied by this call.
427 xfs_buftarg_t *btp, /* block device target */
428 xfs_off_t ioff, /* starting offset of range */
429 size_t isize, /* length of range */
430 xfs_buf_flags_t flags,
433 xfs_off_t range_base;
435 struct xfs_perag *pag;
436 struct rb_node **rbp;
437 struct rb_node *parent;
440 range_base = (ioff << BBSHIFT);
441 range_length = (isize << BBSHIFT);
443 /* Check for IOs smaller than the sector size / not sector aligned */
444 ASSERT(!(range_length < (1 << btp->bt_sshift)));
445 ASSERT(!(range_base & (xfs_off_t)btp->bt_smask));
448 pag = xfs_perag_get(btp->bt_mount,
449 xfs_daddr_to_agno(btp->bt_mount, ioff));
452 spin_lock(&pag->pag_buf_lock);
453 rbp = &pag->pag_buf_tree.rb_node;
458 bp = rb_entry(parent, struct xfs_buf, b_rbnode);
460 if (range_base < bp->b_file_offset)
461 rbp = &(*rbp)->rb_left;
462 else if (range_base > bp->b_file_offset)
463 rbp = &(*rbp)->rb_right;
466 * found a block offset match. If the range doesn't
467 * match, the only way this is allowed is if the buffer
468 * in the cache is stale and the transaction that made
469 * it stale has not yet committed. i.e. we are
470 * reallocating a busy extent. Skip this buffer and
471 * continue searching to the right for an exact match.
473 if (bp->b_buffer_length != range_length) {
474 ASSERT(bp->b_flags & XBF_STALE);
475 rbp = &(*rbp)->rb_right;
478 atomic_inc(&bp->b_hold);
485 _xfs_buf_initialize(new_bp, btp, range_base,
486 range_length, flags);
487 rb_link_node(&new_bp->b_rbnode, parent, rbp);
488 rb_insert_color(&new_bp->b_rbnode, &pag->pag_buf_tree);
489 /* the buffer keeps the perag reference until it is freed */
491 spin_unlock(&pag->pag_buf_lock);
493 XFS_STATS_INC(xb_miss_locked);
494 spin_unlock(&pag->pag_buf_lock);
500 spin_unlock(&pag->pag_buf_lock);
503 if (xfs_buf_cond_lock(bp)) {
504 /* failed, so wait for the lock if requested. */
505 if (!(flags & XBF_TRYLOCK)) {
507 XFS_STATS_INC(xb_get_locked_waited);
510 XFS_STATS_INC(xb_busy_locked);
516 * if the buffer is stale, clear all the external state associated with
517 * it. We need to keep flags such as how we allocated the buffer memory
520 if (bp->b_flags & XBF_STALE) {
521 ASSERT((bp->b_flags & _XBF_DELWRI_Q) == 0);
522 bp->b_flags &= XBF_MAPPED | _XBF_KMEM | _XBF_PAGES;
525 trace_xfs_buf_find(bp, flags, _RET_IP_);
526 XFS_STATS_INC(xb_get_locked);
531 * Assembles a buffer covering the specified range.
532 * Storage in memory for all portions of the buffer will be allocated,
533 * although backing storage may not be.
537 xfs_buftarg_t *target,/* target for buffer */
538 xfs_off_t ioff, /* starting offset of range */
539 size_t isize, /* length of range */
540 xfs_buf_flags_t flags)
542 xfs_buf_t *bp, *new_bp;
545 new_bp = xfs_buf_allocate(flags);
546 if (unlikely(!new_bp))
549 bp = _xfs_buf_find(target, ioff, isize, flags, new_bp);
551 error = xfs_buf_allocate_memory(bp, flags);
555 xfs_buf_deallocate(new_bp);
556 if (unlikely(bp == NULL))
560 if (!(bp->b_flags & XBF_MAPPED)) {
561 error = _xfs_buf_map_pages(bp, flags);
562 if (unlikely(error)) {
563 xfs_warn(target->bt_mount,
564 "%s: failed to map pages\n", __func__);
569 XFS_STATS_INC(xb_get);
572 * Always fill in the block number now, the mapped cases can do
573 * their own overlay of this later.
576 bp->b_count_desired = bp->b_buffer_length;
578 trace_xfs_buf_get(bp, flags, _RET_IP_);
582 if (flags & (XBF_LOCK | XBF_TRYLOCK))
591 xfs_buf_flags_t flags)
595 ASSERT(!(flags & (XBF_DELWRI|XBF_WRITE)));
596 ASSERT(bp->b_bn != XFS_BUF_DADDR_NULL);
598 bp->b_flags &= ~(XBF_WRITE | XBF_ASYNC | XBF_DELWRI | \
599 XBF_READ_AHEAD | _XBF_RUN_QUEUES);
600 bp->b_flags |= flags & (XBF_READ | XBF_ASYNC | \
601 XBF_READ_AHEAD | _XBF_RUN_QUEUES);
603 status = xfs_buf_iorequest(bp);
604 if (status || XFS_BUF_ISERROR(bp) || (flags & XBF_ASYNC))
606 return xfs_buf_iowait(bp);
611 xfs_buftarg_t *target,
614 xfs_buf_flags_t flags)
620 bp = xfs_buf_get(target, ioff, isize, flags);
622 trace_xfs_buf_read(bp, flags, _RET_IP_);
624 if (!XFS_BUF_ISDONE(bp)) {
625 XFS_STATS_INC(xb_get_read);
626 _xfs_buf_read(bp, flags);
627 } else if (flags & XBF_ASYNC) {
629 * Read ahead call which is already satisfied,
634 /* We do not want read in the flags */
635 bp->b_flags &= ~XBF_READ;
642 if (flags & (XBF_LOCK | XBF_TRYLOCK))
649 * If we are not low on memory then do the readahead in a deadlock
654 xfs_buftarg_t *target,
658 if (bdi_read_congested(target->bt_bdi))
661 xfs_buf_read(target, ioff, isize,
662 XBF_TRYLOCK|XBF_ASYNC|XBF_READ_AHEAD|XBF_DONT_BLOCK);
666 * Read an uncached buffer from disk. Allocates and returns a locked
667 * buffer containing the disk contents or nothing.
670 xfs_buf_read_uncached(
671 struct xfs_mount *mp,
672 struct xfs_buftarg *target,
680 bp = xfs_buf_get_uncached(target, length, flags);
684 /* set up the buffer for a read IO */
686 XFS_BUF_SET_ADDR(bp, daddr);
691 error = xfs_buf_iowait(bp);
692 if (error || bp->b_error) {
702 xfs_buftarg_t *target)
706 bp = xfs_buf_allocate(0);
708 _xfs_buf_initialize(bp, target, 0, len, 0);
712 static inline struct page *
716 if ((!is_vmalloc_addr(addr))) {
717 return virt_to_page(addr);
719 return vmalloc_to_page(addr);
724 xfs_buf_associate_memory(
731 unsigned long pageaddr;
732 unsigned long offset;
736 pageaddr = (unsigned long)mem & PAGE_MASK;
737 offset = (unsigned long)mem - pageaddr;
738 buflen = PAGE_ALIGN(len + offset);
739 page_count = buflen >> PAGE_SHIFT;
741 /* Free any previous set of page pointers */
743 _xfs_buf_free_pages(bp);
748 rval = _xfs_buf_get_pages(bp, page_count, XBF_DONT_BLOCK);
752 bp->b_offset = offset;
754 for (i = 0; i < bp->b_page_count; i++) {
755 bp->b_pages[i] = mem_to_page((void *)pageaddr);
756 pageaddr += PAGE_SIZE;
759 bp->b_count_desired = len;
760 bp->b_buffer_length = buflen;
761 bp->b_flags |= XBF_MAPPED;
767 xfs_buf_get_uncached(
768 struct xfs_buftarg *target,
772 unsigned long page_count = PAGE_ALIGN(len) >> PAGE_SHIFT;
776 bp = xfs_buf_allocate(0);
777 if (unlikely(bp == NULL))
779 _xfs_buf_initialize(bp, target, 0, len, 0);
781 error = _xfs_buf_get_pages(bp, page_count, 0);
785 for (i = 0; i < page_count; i++) {
786 bp->b_pages[i] = alloc_page(xb_to_gfp(flags));
790 bp->b_flags |= _XBF_PAGES;
792 error = _xfs_buf_map_pages(bp, XBF_MAPPED);
793 if (unlikely(error)) {
794 xfs_warn(target->bt_mount,
795 "%s: failed to map pages\n", __func__);
801 trace_xfs_buf_get_uncached(bp, _RET_IP_);
806 __free_page(bp->b_pages[i]);
807 _xfs_buf_free_pages(bp);
809 xfs_buf_deallocate(bp);
815 * Increment reference count on buffer, to hold the buffer concurrently
816 * with another thread which may release (free) the buffer asynchronously.
817 * Must hold the buffer already to call this function.
823 trace_xfs_buf_hold(bp, _RET_IP_);
824 atomic_inc(&bp->b_hold);
828 * Releases a hold on the specified buffer. If the
829 * the hold count is 1, calls xfs_buf_free.
835 struct xfs_perag *pag = bp->b_pag;
837 trace_xfs_buf_rele(bp, _RET_IP_);
840 ASSERT(list_empty(&bp->b_lru));
841 ASSERT(RB_EMPTY_NODE(&bp->b_rbnode));
842 if (atomic_dec_and_test(&bp->b_hold))
847 ASSERT(!RB_EMPTY_NODE(&bp->b_rbnode));
849 ASSERT(atomic_read(&bp->b_hold) > 0);
850 if (atomic_dec_and_lock(&bp->b_hold, &pag->pag_buf_lock)) {
851 if (!(bp->b_flags & XBF_STALE) &&
852 atomic_read(&bp->b_lru_ref)) {
854 spin_unlock(&pag->pag_buf_lock);
857 ASSERT(!(bp->b_flags & (XBF_DELWRI|_XBF_DELWRI_Q)));
858 rb_erase(&bp->b_rbnode, &pag->pag_buf_tree);
859 spin_unlock(&pag->pag_buf_lock);
868 * Lock a buffer object, if it is not already locked.
870 * If we come across a stale, pinned, locked buffer, we know that we are
871 * being asked to lock a buffer that has been reallocated. Because it is
872 * pinned, we know that the log has not been pushed to disk and hence it
873 * will still be locked. Rather than continuing to have trylock attempts
874 * fail until someone else pushes the log, push it ourselves before
875 * returning. This means that the xfsaild will not get stuck trying
876 * to push on stale inode buffers.
884 locked = down_trylock(&bp->b_sema) == 0;
887 else if (atomic_read(&bp->b_pin_count) && (bp->b_flags & XBF_STALE))
888 xfs_log_force(bp->b_target->bt_mount, 0);
890 trace_xfs_buf_cond_lock(bp, _RET_IP_);
891 return locked ? 0 : -EBUSY;
898 return bp->b_sema.count;
902 * Lock a buffer object.
904 * If we come across a stale, pinned, locked buffer, we know that we
905 * are being asked to lock a buffer that has been reallocated. Because
906 * it is pinned, we know that the log has not been pushed to disk and
907 * hence it will still be locked. Rather than sleeping until someone
908 * else pushes the log, push it ourselves before trying to get the lock.
914 trace_xfs_buf_lock(bp, _RET_IP_);
916 if (atomic_read(&bp->b_pin_count) && (bp->b_flags & XBF_STALE))
917 xfs_log_force(bp->b_target->bt_mount, 0);
921 trace_xfs_buf_lock_done(bp, _RET_IP_);
925 * Releases the lock on the buffer object.
926 * If the buffer is marked delwri but is not queued, do so before we
927 * unlock the buffer as we need to set flags correctly. We also need to
928 * take a reference for the delwri queue because the unlocker is going to
929 * drop their's and they don't know we just queued it.
935 if ((bp->b_flags & (XBF_DELWRI|_XBF_DELWRI_Q)) == XBF_DELWRI) {
936 atomic_inc(&bp->b_hold);
937 bp->b_flags |= XBF_ASYNC;
938 xfs_buf_delwri_queue(bp, 0);
944 trace_xfs_buf_unlock(bp, _RET_IP_);
951 DECLARE_WAITQUEUE (wait, current);
953 if (atomic_read(&bp->b_pin_count) == 0)
956 add_wait_queue(&bp->b_waiters, &wait);
958 set_current_state(TASK_UNINTERRUPTIBLE);
959 if (atomic_read(&bp->b_pin_count) == 0)
963 remove_wait_queue(&bp->b_waiters, &wait);
964 set_current_state(TASK_RUNNING);
968 * Buffer Utility Routines
973 struct work_struct *work)
976 container_of(work, xfs_buf_t, b_iodone_work);
979 (*(bp->b_iodone))(bp);
980 else if (bp->b_flags & XBF_ASYNC)
989 trace_xfs_buf_iodone(bp, _RET_IP_);
991 bp->b_flags &= ~(XBF_READ | XBF_WRITE | XBF_READ_AHEAD);
992 if (bp->b_error == 0)
993 bp->b_flags |= XBF_DONE;
995 if ((bp->b_iodone) || (bp->b_flags & XBF_ASYNC)) {
997 INIT_WORK(&bp->b_iodone_work, xfs_buf_iodone_work);
998 queue_work(xfslogd_workqueue, &bp->b_iodone_work);
1000 xfs_buf_iodone_work(&bp->b_iodone_work);
1003 complete(&bp->b_iowait);
1012 ASSERT(error >= 0 && error <= 0xffff);
1013 bp->b_error = (unsigned short)error;
1014 trace_xfs_buf_ioerror(bp, error, _RET_IP_);
1019 struct xfs_mount *mp,
1024 bp->b_flags |= XBF_WRITE;
1025 bp->b_flags &= ~(XBF_ASYNC | XBF_READ);
1027 xfs_buf_delwri_dequeue(bp);
1030 error = xfs_buf_iowait(bp);
1032 xfs_force_shutdown(mp, SHUTDOWN_META_IO_ERROR);
1042 trace_xfs_buf_bdwrite(bp, _RET_IP_);
1044 bp->b_flags &= ~XBF_READ;
1045 bp->b_flags |= (XBF_DELWRI | XBF_ASYNC);
1047 xfs_buf_delwri_queue(bp, 1);
1051 * Called when we want to stop a buffer from getting written or read.
1052 * We attach the EIO error, muck with its flags, and call xfs_buf_ioend
1053 * so that the proper iodone callbacks get called.
1059 #ifdef XFSERRORDEBUG
1060 ASSERT(XFS_BUF_ISREAD(bp) || bp->b_iodone);
1064 * No need to wait until the buffer is unpinned, we aren't flushing it.
1066 XFS_BUF_ERROR(bp, EIO);
1069 * We're calling xfs_buf_ioend, so delete XBF_DONE flag.
1072 XFS_BUF_UNDELAYWRITE(bp);
1076 xfs_buf_ioend(bp, 0);
1082 * Same as xfs_bioerror, except that we are releasing the buffer
1083 * here ourselves, and avoiding the xfs_buf_ioend call.
1084 * This is meant for userdata errors; metadata bufs come with
1085 * iodone functions attached, so that we can track down errors.
1091 int64_t fl = XFS_BUF_BFLAGS(bp);
1093 * No need to wait until the buffer is unpinned.
1094 * We aren't flushing it.
1096 * chunkhold expects B_DONE to be set, whether
1097 * we actually finish the I/O or not. We don't want to
1098 * change that interface.
1101 XFS_BUF_UNDELAYWRITE(bp);
1104 XFS_BUF_CLR_IODONE_FUNC(bp);
1105 if (!(fl & XBF_ASYNC)) {
1107 * Mark b_error and B_ERROR _both_.
1108 * Lot's of chunkcache code assumes that.
1109 * There's no reason to mark error for
1112 XFS_BUF_ERROR(bp, EIO);
1113 XFS_BUF_FINISH_IOWAIT(bp);
1123 * All xfs metadata buffers except log state machine buffers
1124 * get this attached as their b_bdstrat callback function.
1125 * This is so that we can catch a buffer
1126 * after prematurely unpinning it to forcibly shutdown the filesystem.
1132 if (XFS_FORCED_SHUTDOWN(bp->b_target->bt_mount)) {
1133 trace_xfs_bdstrat_shut(bp, _RET_IP_);
1135 * Metadata write that didn't get logged but
1136 * written delayed anyway. These aren't associated
1137 * with a transaction, and can be ignored.
1139 if (!bp->b_iodone && !XFS_BUF_ISREAD(bp))
1140 return xfs_bioerror_relse(bp);
1142 return xfs_bioerror(bp);
1145 xfs_buf_iorequest(bp);
1150 * Wrapper around bdstrat so that we can stop data from going to disk in case
1151 * we are shutting down the filesystem. Typically user data goes thru this
1152 * path; one of the exceptions is the superblock.
1156 struct xfs_mount *mp,
1159 if (XFS_FORCED_SHUTDOWN(mp)) {
1160 trace_xfs_bdstrat_shut(bp, _RET_IP_);
1161 xfs_bioerror_relse(bp);
1165 xfs_buf_iorequest(bp);
1173 if (atomic_dec_and_test(&bp->b_io_remaining) == 1)
1174 xfs_buf_ioend(bp, schedule);
1182 xfs_buf_t *bp = (xfs_buf_t *)bio->bi_private;
1184 xfs_buf_ioerror(bp, -error);
1186 if (!error && xfs_buf_is_vmapped(bp) && (bp->b_flags & XBF_READ))
1187 invalidate_kernel_vmap_range(bp->b_addr, xfs_buf_vmap_len(bp));
1189 _xfs_buf_ioend(bp, 1);
1197 int rw, map_i, total_nr_pages, nr_pages;
1199 int offset = bp->b_offset;
1200 int size = bp->b_count_desired;
1201 sector_t sector = bp->b_bn;
1203 total_nr_pages = bp->b_page_count;
1206 if (bp->b_flags & XBF_ORDERED) {
1207 ASSERT(!(bp->b_flags & XBF_READ));
1208 rw = WRITE_FLUSH_FUA;
1209 } else if (bp->b_flags & XBF_LOG_BUFFER) {
1210 ASSERT(!(bp->b_flags & XBF_READ_AHEAD));
1211 bp->b_flags &= ~_XBF_RUN_QUEUES;
1212 rw = (bp->b_flags & XBF_WRITE) ? WRITE_SYNC : READ_SYNC;
1213 } else if (bp->b_flags & _XBF_RUN_QUEUES) {
1214 ASSERT(!(bp->b_flags & XBF_READ_AHEAD));
1215 bp->b_flags &= ~_XBF_RUN_QUEUES;
1216 rw = (bp->b_flags & XBF_WRITE) ? WRITE_META : READ_META;
1218 rw = (bp->b_flags & XBF_WRITE) ? WRITE :
1219 (bp->b_flags & XBF_READ_AHEAD) ? READA : READ;
1224 atomic_inc(&bp->b_io_remaining);
1225 nr_pages = BIO_MAX_SECTORS >> (PAGE_SHIFT - BBSHIFT);
1226 if (nr_pages > total_nr_pages)
1227 nr_pages = total_nr_pages;
1229 bio = bio_alloc(GFP_NOIO, nr_pages);
1230 bio->bi_bdev = bp->b_target->bt_bdev;
1231 bio->bi_sector = sector;
1232 bio->bi_end_io = xfs_buf_bio_end_io;
1233 bio->bi_private = bp;
1236 for (; size && nr_pages; nr_pages--, map_i++) {
1237 int rbytes, nbytes = PAGE_SIZE - offset;
1242 rbytes = bio_add_page(bio, bp->b_pages[map_i], nbytes, offset);
1243 if (rbytes < nbytes)
1247 sector += nbytes >> BBSHIFT;
1252 if (likely(bio->bi_size)) {
1253 if (xfs_buf_is_vmapped(bp)) {
1254 flush_kernel_vmap_range(bp->b_addr,
1255 xfs_buf_vmap_len(bp));
1257 submit_bio(rw, bio);
1261 xfs_buf_ioerror(bp, EIO);
1270 trace_xfs_buf_iorequest(bp, _RET_IP_);
1272 if (bp->b_flags & XBF_DELWRI) {
1273 xfs_buf_delwri_queue(bp, 1);
1277 if (bp->b_flags & XBF_WRITE) {
1278 xfs_buf_wait_unpin(bp);
1283 /* Set the count to 1 initially, this will stop an I/O
1284 * completion callout which happens before we have started
1285 * all the I/O from calling xfs_buf_ioend too early.
1287 atomic_set(&bp->b_io_remaining, 1);
1288 _xfs_buf_ioapply(bp);
1289 _xfs_buf_ioend(bp, 0);
1296 * Waits for I/O to complete on the buffer supplied.
1297 * It returns immediately if no I/O is pending.
1298 * It returns the I/O error code, if any, or 0 if there was no error.
1304 trace_xfs_buf_iowait(bp, _RET_IP_);
1306 wait_for_completion(&bp->b_iowait);
1308 trace_xfs_buf_iowait_done(bp, _RET_IP_);
1319 if (bp->b_flags & XBF_MAPPED)
1320 return XFS_BUF_PTR(bp) + offset;
1322 offset += bp->b_offset;
1323 page = bp->b_pages[offset >> PAGE_SHIFT];
1324 return (xfs_caddr_t)page_address(page) + (offset & (PAGE_SIZE-1));
1328 * Move data into or out of a buffer.
1332 xfs_buf_t *bp, /* buffer to process */
1333 size_t boff, /* starting buffer offset */
1334 size_t bsize, /* length to copy */
1335 void *data, /* data address */
1336 xfs_buf_rw_t mode) /* read/write/zero flag */
1338 size_t bend, cpoff, csize;
1341 bend = boff + bsize;
1342 while (boff < bend) {
1343 page = bp->b_pages[xfs_buf_btoct(boff + bp->b_offset)];
1344 cpoff = xfs_buf_poff(boff + bp->b_offset);
1345 csize = min_t(size_t,
1346 PAGE_SIZE-cpoff, bp->b_count_desired-boff);
1348 ASSERT(((csize + cpoff) <= PAGE_SIZE));
1352 memset(page_address(page) + cpoff, 0, csize);
1355 memcpy(data, page_address(page) + cpoff, csize);
1358 memcpy(page_address(page) + cpoff, data, csize);
1367 * Handling of buffer targets (buftargs).
1371 * Wait for any bufs with callbacks that have been submitted but have not yet
1372 * returned. These buffers will have an elevated hold count, so wait on those
1373 * while freeing all the buffers only held by the LRU.
1377 struct xfs_buftarg *btp)
1382 spin_lock(&btp->bt_lru_lock);
1383 while (!list_empty(&btp->bt_lru)) {
1384 bp = list_first_entry(&btp->bt_lru, struct xfs_buf, b_lru);
1385 if (atomic_read(&bp->b_hold) > 1) {
1386 spin_unlock(&btp->bt_lru_lock);
1391 * clear the LRU reference count so the bufer doesn't get
1392 * ignored in xfs_buf_rele().
1394 atomic_set(&bp->b_lru_ref, 0);
1395 spin_unlock(&btp->bt_lru_lock);
1397 spin_lock(&btp->bt_lru_lock);
1399 spin_unlock(&btp->bt_lru_lock);
1404 struct shrinker *shrink,
1408 struct xfs_buftarg *btp = container_of(shrink,
1409 struct xfs_buftarg, bt_shrinker);
1414 return btp->bt_lru_nr;
1416 spin_lock(&btp->bt_lru_lock);
1417 while (!list_empty(&btp->bt_lru)) {
1418 if (nr_to_scan-- <= 0)
1421 bp = list_first_entry(&btp->bt_lru, struct xfs_buf, b_lru);
1424 * Decrement the b_lru_ref count unless the value is already
1425 * zero. If the value is already zero, we need to reclaim the
1426 * buffer, otherwise it gets another trip through the LRU.
1428 if (!atomic_add_unless(&bp->b_lru_ref, -1, 0)) {
1429 list_move_tail(&bp->b_lru, &btp->bt_lru);
1434 * remove the buffer from the LRU now to avoid needing another
1435 * lock round trip inside xfs_buf_rele().
1437 list_move(&bp->b_lru, &dispose);
1440 spin_unlock(&btp->bt_lru_lock);
1442 while (!list_empty(&dispose)) {
1443 bp = list_first_entry(&dispose, struct xfs_buf, b_lru);
1444 list_del_init(&bp->b_lru);
1448 return btp->bt_lru_nr;
1453 struct xfs_mount *mp,
1454 struct xfs_buftarg *btp)
1456 unregister_shrinker(&btp->bt_shrinker);
1458 xfs_flush_buftarg(btp, 1);
1459 if (mp->m_flags & XFS_MOUNT_BARRIER)
1460 xfs_blkdev_issue_flush(btp);
1462 kthread_stop(btp->bt_task);
1467 xfs_setsize_buftarg_flags(
1469 unsigned int blocksize,
1470 unsigned int sectorsize,
1473 btp->bt_bsize = blocksize;
1474 btp->bt_sshift = ffs(sectorsize) - 1;
1475 btp->bt_smask = sectorsize - 1;
1477 if (set_blocksize(btp->bt_bdev, sectorsize)) {
1478 xfs_warn(btp->bt_mount,
1479 "Cannot set_blocksize to %u on device %s\n",
1480 sectorsize, XFS_BUFTARG_NAME(btp));
1488 * When allocating the initial buffer target we have not yet
1489 * read in the superblock, so don't know what sized sectors
1490 * are being used is at this early stage. Play safe.
1493 xfs_setsize_buftarg_early(
1495 struct block_device *bdev)
1497 return xfs_setsize_buftarg_flags(btp,
1498 PAGE_SIZE, bdev_logical_block_size(bdev), 0);
1502 xfs_setsize_buftarg(
1504 unsigned int blocksize,
1505 unsigned int sectorsize)
1507 return xfs_setsize_buftarg_flags(btp, blocksize, sectorsize, 1);
1511 xfs_alloc_delwrite_queue(
1515 INIT_LIST_HEAD(&btp->bt_delwrite_queue);
1516 spin_lock_init(&btp->bt_delwrite_lock);
1518 btp->bt_task = kthread_run(xfsbufd, btp, "xfsbufd/%s", fsname);
1519 if (IS_ERR(btp->bt_task))
1520 return PTR_ERR(btp->bt_task);
1526 struct xfs_mount *mp,
1527 struct block_device *bdev,
1533 btp = kmem_zalloc(sizeof(*btp), KM_SLEEP);
1536 btp->bt_dev = bdev->bd_dev;
1537 btp->bt_bdev = bdev;
1538 btp->bt_bdi = blk_get_backing_dev_info(bdev);
1542 INIT_LIST_HEAD(&btp->bt_lru);
1543 spin_lock_init(&btp->bt_lru_lock);
1544 if (xfs_setsize_buftarg_early(btp, bdev))
1546 if (xfs_alloc_delwrite_queue(btp, fsname))
1548 btp->bt_shrinker.shrink = xfs_buftarg_shrink;
1549 btp->bt_shrinker.seeks = DEFAULT_SEEKS;
1550 register_shrinker(&btp->bt_shrinker);
1560 * Delayed write buffer handling
1563 xfs_buf_delwri_queue(
1567 struct list_head *dwq = &bp->b_target->bt_delwrite_queue;
1568 spinlock_t *dwlk = &bp->b_target->bt_delwrite_lock;
1570 trace_xfs_buf_delwri_queue(bp, _RET_IP_);
1572 ASSERT((bp->b_flags&(XBF_DELWRI|XBF_ASYNC)) == (XBF_DELWRI|XBF_ASYNC));
1575 /* If already in the queue, dequeue and place at tail */
1576 if (!list_empty(&bp->b_list)) {
1577 ASSERT(bp->b_flags & _XBF_DELWRI_Q);
1579 atomic_dec(&bp->b_hold);
1580 list_del(&bp->b_list);
1583 if (list_empty(dwq)) {
1584 /* start xfsbufd as it is about to have something to do */
1585 wake_up_process(bp->b_target->bt_task);
1588 bp->b_flags |= _XBF_DELWRI_Q;
1589 list_add_tail(&bp->b_list, dwq);
1590 bp->b_queuetime = jiffies;
1598 xfs_buf_delwri_dequeue(
1601 spinlock_t *dwlk = &bp->b_target->bt_delwrite_lock;
1605 if ((bp->b_flags & XBF_DELWRI) && !list_empty(&bp->b_list)) {
1606 ASSERT(bp->b_flags & _XBF_DELWRI_Q);
1607 list_del_init(&bp->b_list);
1610 bp->b_flags &= ~(XBF_DELWRI|_XBF_DELWRI_Q);
1616 trace_xfs_buf_delwri_dequeue(bp, _RET_IP_);
1620 * If a delwri buffer needs to be pushed before it has aged out, then promote
1621 * it to the head of the delwri queue so that it will be flushed on the next
1622 * xfsbufd run. We do this by resetting the queuetime of the buffer to be older
1623 * than the age currently needed to flush the buffer. Hence the next time the
1624 * xfsbufd sees it is guaranteed to be considered old enough to flush.
1627 xfs_buf_delwri_promote(
1630 struct xfs_buftarg *btp = bp->b_target;
1631 long age = xfs_buf_age_centisecs * msecs_to_jiffies(10) + 1;
1633 ASSERT(bp->b_flags & XBF_DELWRI);
1634 ASSERT(bp->b_flags & _XBF_DELWRI_Q);
1637 * Check the buffer age before locking the delayed write queue as we
1638 * don't need to promote buffers that are already past the flush age.
1640 if (bp->b_queuetime < jiffies - age)
1642 bp->b_queuetime = jiffies - age;
1643 spin_lock(&btp->bt_delwrite_lock);
1644 list_move(&bp->b_list, &btp->bt_delwrite_queue);
1645 spin_unlock(&btp->bt_delwrite_lock);
1649 xfs_buf_runall_queues(
1650 struct workqueue_struct *queue)
1652 flush_workqueue(queue);
1656 * Move as many buffers as specified to the supplied list
1657 * idicating if we skipped any buffers to prevent deadlocks.
1660 xfs_buf_delwri_split(
1661 xfs_buftarg_t *target,
1662 struct list_head *list,
1666 struct list_head *dwq = &target->bt_delwrite_queue;
1667 spinlock_t *dwlk = &target->bt_delwrite_lock;
1671 force = test_and_clear_bit(XBT_FORCE_FLUSH, &target->bt_flags);
1672 INIT_LIST_HEAD(list);
1674 list_for_each_entry_safe(bp, n, dwq, b_list) {
1675 ASSERT(bp->b_flags & XBF_DELWRI);
1677 if (!XFS_BUF_ISPINNED(bp) && !xfs_buf_cond_lock(bp)) {
1679 time_before(jiffies, bp->b_queuetime + age)) {
1684 bp->b_flags &= ~(XBF_DELWRI|_XBF_DELWRI_Q|
1686 bp->b_flags |= XBF_WRITE;
1687 list_move_tail(&bp->b_list, list);
1688 trace_xfs_buf_delwri_split(bp, _RET_IP_);
1699 * Compare function is more complex than it needs to be because
1700 * the return value is only 32 bits and we are doing comparisons
1706 struct list_head *a,
1707 struct list_head *b)
1709 struct xfs_buf *ap = container_of(a, struct xfs_buf, b_list);
1710 struct xfs_buf *bp = container_of(b, struct xfs_buf, b_list);
1713 diff = ap->b_bn - bp->b_bn;
1722 xfs_buf_delwri_sort(
1723 xfs_buftarg_t *target,
1724 struct list_head *list)
1726 list_sort(NULL, list, xfs_buf_cmp);
1733 xfs_buftarg_t *target = (xfs_buftarg_t *)data;
1735 current->flags |= PF_MEMALLOC;
1740 long age = xfs_buf_age_centisecs * msecs_to_jiffies(10);
1741 long tout = xfs_buf_timer_centisecs * msecs_to_jiffies(10);
1742 struct list_head tmp;
1743 struct blk_plug plug;
1745 if (unlikely(freezing(current))) {
1746 set_bit(XBT_FORCE_SLEEP, &target->bt_flags);
1749 clear_bit(XBT_FORCE_SLEEP, &target->bt_flags);
1752 /* sleep for a long time if there is nothing to do. */
1753 if (list_empty(&target->bt_delwrite_queue))
1754 tout = MAX_SCHEDULE_TIMEOUT;
1755 schedule_timeout_interruptible(tout);
1757 xfs_buf_delwri_split(target, &tmp, age);
1758 list_sort(NULL, &tmp, xfs_buf_cmp);
1760 blk_start_plug(&plug);
1761 while (!list_empty(&tmp)) {
1763 bp = list_first_entry(&tmp, struct xfs_buf, b_list);
1764 list_del_init(&bp->b_list);
1767 blk_finish_plug(&plug);
1768 } while (!kthread_should_stop());
1774 * Go through all incore buffers, and release buffers if they belong to
1775 * the given device. This is used in filesystem error handling to
1776 * preserve the consistency of its metadata.
1780 xfs_buftarg_t *target,
1785 LIST_HEAD(tmp_list);
1786 LIST_HEAD(wait_list);
1787 struct blk_plug plug;
1789 xfs_buf_runall_queues(xfsconvertd_workqueue);
1790 xfs_buf_runall_queues(xfsdatad_workqueue);
1791 xfs_buf_runall_queues(xfslogd_workqueue);
1793 set_bit(XBT_FORCE_FLUSH, &target->bt_flags);
1794 pincount = xfs_buf_delwri_split(target, &tmp_list, 0);
1797 * Dropped the delayed write list lock, now walk the temporary list.
1798 * All I/O is issued async and then if we need to wait for completion
1799 * we do that after issuing all the IO.
1801 list_sort(NULL, &tmp_list, xfs_buf_cmp);
1803 blk_start_plug(&plug);
1804 while (!list_empty(&tmp_list)) {
1805 bp = list_first_entry(&tmp_list, struct xfs_buf, b_list);
1806 ASSERT(target == bp->b_target);
1807 list_del_init(&bp->b_list);
1809 bp->b_flags &= ~XBF_ASYNC;
1810 list_add(&bp->b_list, &wait_list);
1814 blk_finish_plug(&plug);
1817 /* Wait for IO to complete. */
1818 while (!list_empty(&wait_list)) {
1819 bp = list_first_entry(&wait_list, struct xfs_buf, b_list);
1821 list_del_init(&bp->b_list);
1833 xfs_buf_zone = kmem_zone_init_flags(sizeof(xfs_buf_t), "xfs_buf",
1834 KM_ZONE_HWALIGN, NULL);
1838 xfslogd_workqueue = alloc_workqueue("xfslogd",
1839 WQ_MEM_RECLAIM | WQ_HIGHPRI, 1);
1840 if (!xfslogd_workqueue)
1841 goto out_free_buf_zone;
1843 xfsdatad_workqueue = alloc_workqueue("xfsdatad", WQ_MEM_RECLAIM, 1);
1844 if (!xfsdatad_workqueue)
1845 goto out_destroy_xfslogd_workqueue;
1847 xfsconvertd_workqueue = alloc_workqueue("xfsconvertd",
1849 if (!xfsconvertd_workqueue)
1850 goto out_destroy_xfsdatad_workqueue;
1854 out_destroy_xfsdatad_workqueue:
1855 destroy_workqueue(xfsdatad_workqueue);
1856 out_destroy_xfslogd_workqueue:
1857 destroy_workqueue(xfslogd_workqueue);
1859 kmem_zone_destroy(xfs_buf_zone);
1865 xfs_buf_terminate(void)
1867 destroy_workqueue(xfsconvertd_workqueue);
1868 destroy_workqueue(xfsdatad_workqueue);
1869 destroy_workqueue(xfslogd_workqueue);
1870 kmem_zone_destroy(xfs_buf_zone);
1873 #ifdef CONFIG_KDB_MODULES
1875 xfs_get_buftarg_list(void)
1877 return &xfs_buftarg_list;