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>
37 #include "xfs_format.h"
38 #include "xfs_log_format.h"
39 #include "xfs_trans_resv.h"
41 #include "xfs_mount.h"
42 #include "xfs_trace.h"
45 static kmem_zone_t
*xfs_buf_zone
;
47 #ifdef XFS_BUF_LOCK_TRACKING
48 # define XB_SET_OWNER(bp) ((bp)->b_last_holder = current->pid)
49 # define XB_CLEAR_OWNER(bp) ((bp)->b_last_holder = -1)
50 # define XB_GET_OWNER(bp) ((bp)->b_last_holder)
52 # define XB_SET_OWNER(bp) do { } while (0)
53 # define XB_CLEAR_OWNER(bp) do { } while (0)
54 # define XB_GET_OWNER(bp) do { } while (0)
57 #define xb_to_gfp(flags) \
58 ((((flags) & XBF_READ_AHEAD) ? __GFP_NORETRY : GFP_NOFS) | __GFP_NOWARN)
66 * Return true if the buffer is vmapped.
68 * b_addr is null if the buffer is not mapped, but the code is clever
69 * enough to know it doesn't have to map a single page, so the check has
70 * to be both for b_addr and bp->b_page_count > 1.
72 return bp
->b_addr
&& bp
->b_page_count
> 1;
79 return (bp
->b_page_count
* PAGE_SIZE
) - bp
->b_offset
;
83 * When we mark a buffer stale, we remove the buffer from the LRU and clear the
84 * b_lru_ref count so that the buffer is freed immediately when the buffer
85 * reference count falls to zero. If the buffer is already on the LRU, we need
86 * to remove the reference that LRU holds on the buffer.
88 * This prevents build-up of stale buffers on the LRU.
94 ASSERT(xfs_buf_islocked(bp
));
96 bp
->b_flags
|= XBF_STALE
;
99 * Clear the delwri status so that a delwri queue walker will not
100 * flush this buffer to disk now that it is stale. The delwri queue has
101 * a reference to the buffer, so this is safe to do.
103 bp
->b_flags
&= ~_XBF_DELWRI_Q
;
105 spin_lock(&bp
->b_lock
);
106 atomic_set(&bp
->b_lru_ref
, 0);
107 if (!(bp
->b_state
& XFS_BSTATE_DISPOSE
) &&
108 (list_lru_del(&bp
->b_target
->bt_lru
, &bp
->b_lru
)))
109 atomic_dec(&bp
->b_hold
);
111 ASSERT(atomic_read(&bp
->b_hold
) >= 1);
112 spin_unlock(&bp
->b_lock
);
120 ASSERT(bp
->b_maps
== NULL
);
121 bp
->b_map_count
= map_count
;
123 if (map_count
== 1) {
124 bp
->b_maps
= &bp
->__b_map
;
128 bp
->b_maps
= kmem_zalloc(map_count
* sizeof(struct xfs_buf_map
),
136 * Frees b_pages if it was allocated.
142 if (bp
->b_maps
!= &bp
->__b_map
) {
143 kmem_free(bp
->b_maps
);
150 struct xfs_buftarg
*target
,
151 struct xfs_buf_map
*map
,
153 xfs_buf_flags_t flags
)
159 bp
= kmem_zone_zalloc(xfs_buf_zone
, KM_NOFS
);
164 * We don't want certain flags to appear in b_flags unless they are
165 * specifically set by later operations on the buffer.
167 flags
&= ~(XBF_UNMAPPED
| XBF_TRYLOCK
| XBF_ASYNC
| XBF_READ_AHEAD
);
169 atomic_set(&bp
->b_hold
, 1);
170 atomic_set(&bp
->b_lru_ref
, 1);
171 init_completion(&bp
->b_iowait
);
172 INIT_LIST_HEAD(&bp
->b_lru
);
173 INIT_LIST_HEAD(&bp
->b_list
);
174 RB_CLEAR_NODE(&bp
->b_rbnode
);
175 sema_init(&bp
->b_sema
, 0); /* held, no waiters */
176 spin_lock_init(&bp
->b_lock
);
178 bp
->b_target
= target
;
182 * Set length and io_length to the same value initially.
183 * I/O routines should use io_length, which will be the same in
184 * most cases but may be reset (e.g. XFS recovery).
186 error
= xfs_buf_get_maps(bp
, nmaps
);
188 kmem_zone_free(xfs_buf_zone
, bp
);
192 bp
->b_bn
= map
[0].bm_bn
;
194 for (i
= 0; i
< nmaps
; i
++) {
195 bp
->b_maps
[i
].bm_bn
= map
[i
].bm_bn
;
196 bp
->b_maps
[i
].bm_len
= map
[i
].bm_len
;
197 bp
->b_length
+= map
[i
].bm_len
;
199 bp
->b_io_length
= bp
->b_length
;
201 atomic_set(&bp
->b_pin_count
, 0);
202 init_waitqueue_head(&bp
->b_waiters
);
204 XFS_STATS_INC(target
->bt_mount
, xb_create
);
205 trace_xfs_buf_init(bp
, _RET_IP_
);
211 * Allocate a page array capable of holding a specified number
212 * of pages, and point the page buf at it.
219 /* Make sure that we have a page list */
220 if (bp
->b_pages
== NULL
) {
221 bp
->b_page_count
= page_count
;
222 if (page_count
<= XB_PAGES
) {
223 bp
->b_pages
= bp
->b_page_array
;
225 bp
->b_pages
= kmem_alloc(sizeof(struct page
*) *
226 page_count
, KM_NOFS
);
227 if (bp
->b_pages
== NULL
)
230 memset(bp
->b_pages
, 0, sizeof(struct page
*) * page_count
);
236 * Frees b_pages if it was allocated.
242 if (bp
->b_pages
!= bp
->b_page_array
) {
243 kmem_free(bp
->b_pages
);
249 * Releases the specified buffer.
251 * The modification state of any associated pages is left unchanged.
252 * The buffer must not be on any hash - use xfs_buf_rele instead for
253 * hashed and refcounted buffers
259 trace_xfs_buf_free(bp
, _RET_IP_
);
261 ASSERT(list_empty(&bp
->b_lru
));
263 if (bp
->b_flags
& _XBF_PAGES
) {
266 if (xfs_buf_is_vmapped(bp
))
267 vm_unmap_ram(bp
->b_addr
- bp
->b_offset
,
270 for (i
= 0; i
< bp
->b_page_count
; i
++) {
271 struct page
*page
= bp
->b_pages
[i
];
275 } else if (bp
->b_flags
& _XBF_KMEM
)
276 kmem_free(bp
->b_addr
);
277 _xfs_buf_free_pages(bp
);
278 xfs_buf_free_maps(bp
);
279 kmem_zone_free(xfs_buf_zone
, bp
);
283 * Allocates all the pages for buffer in question and builds it's page list.
286 xfs_buf_allocate_memory(
291 size_t nbytes
, offset
;
292 gfp_t gfp_mask
= xb_to_gfp(flags
);
293 unsigned short page_count
, i
;
294 xfs_off_t start
, end
;
298 * for buffers that are contained within a single page, just allocate
299 * the memory from the heap - there's no need for the complexity of
300 * page arrays to keep allocation down to order 0.
302 size
= BBTOB(bp
->b_length
);
303 if (size
< PAGE_SIZE
) {
304 bp
->b_addr
= kmem_alloc(size
, KM_NOFS
);
306 /* low memory - use alloc_page loop instead */
310 if (((unsigned long)(bp
->b_addr
+ size
- 1) & PAGE_MASK
) !=
311 ((unsigned long)bp
->b_addr
& PAGE_MASK
)) {
312 /* b_addr spans two pages - use alloc_page instead */
313 kmem_free(bp
->b_addr
);
317 bp
->b_offset
= offset_in_page(bp
->b_addr
);
318 bp
->b_pages
= bp
->b_page_array
;
319 bp
->b_pages
[0] = virt_to_page(bp
->b_addr
);
320 bp
->b_page_count
= 1;
321 bp
->b_flags
|= _XBF_KMEM
;
326 start
= BBTOB(bp
->b_maps
[0].bm_bn
) >> PAGE_SHIFT
;
327 end
= (BBTOB(bp
->b_maps
[0].bm_bn
+ bp
->b_length
) + PAGE_SIZE
- 1)
329 page_count
= end
- start
;
330 error
= _xfs_buf_get_pages(bp
, page_count
);
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 "%s(%u) possible memory allocation deadlock in %s (mode:0x%x)",
358 current
->comm
, current
->pid
,
361 XFS_STATS_INC(bp
->b_target
->bt_mount
, xb_page_retries
);
362 congestion_wait(BLK_RW_ASYNC
, HZ
/50);
366 XFS_STATS_INC(bp
->b_target
->bt_mount
, xb_page_found
);
368 nbytes
= min_t(size_t, size
, PAGE_SIZE
- offset
);
370 bp
->b_pages
[i
] = page
;
376 for (i
= 0; i
< bp
->b_page_count
; i
++)
377 __free_page(bp
->b_pages
[i
]);
382 * Map buffer into kernel address-space if necessary.
389 ASSERT(bp
->b_flags
& _XBF_PAGES
);
390 if (bp
->b_page_count
== 1) {
391 /* A single page buffer is always mappable */
392 bp
->b_addr
= page_address(bp
->b_pages
[0]) + bp
->b_offset
;
393 } else if (flags
& XBF_UNMAPPED
) {
400 * vm_map_ram() will allocate auxillary structures (e.g.
401 * pagetables) with GFP_KERNEL, yet we are likely to be under
402 * GFP_NOFS context here. Hence we need to tell memory reclaim
403 * that we are in such a context via PF_MEMALLOC_NOIO to prevent
404 * memory reclaim re-entering the filesystem here and
405 * potentially deadlocking.
407 noio_flag
= memalloc_noio_save();
409 bp
->b_addr
= vm_map_ram(bp
->b_pages
, bp
->b_page_count
,
414 } while (retried
++ <= 1);
415 memalloc_noio_restore(noio_flag
);
419 bp
->b_addr
+= bp
->b_offset
;
426 * Finding and Reading Buffers
430 * Look up, and creates if absent, a lockable buffer for
431 * a given range of an inode. The buffer is returned
432 * locked. No I/O is implied by this call.
436 struct xfs_buftarg
*btp
,
437 struct xfs_buf_map
*map
,
439 xfs_buf_flags_t flags
,
442 struct xfs_perag
*pag
;
443 struct rb_node
**rbp
;
444 struct rb_node
*parent
;
446 xfs_daddr_t blkno
= map
[0].bm_bn
;
451 for (i
= 0; i
< nmaps
; i
++)
452 numblks
+= map
[i
].bm_len
;
454 /* Check for IOs smaller than the sector size / not sector aligned */
455 ASSERT(!(BBTOB(numblks
) < btp
->bt_meta_sectorsize
));
456 ASSERT(!(BBTOB(blkno
) & (xfs_off_t
)btp
->bt_meta_sectormask
));
459 * Corrupted block numbers can get through to here, unfortunately, so we
460 * have to check that the buffer falls within the filesystem bounds.
462 eofs
= XFS_FSB_TO_BB(btp
->bt_mount
, btp
->bt_mount
->m_sb
.sb_dblocks
);
463 if (blkno
< 0 || blkno
>= eofs
) {
465 * XXX (dgc): we should really be returning -EFSCORRUPTED here,
466 * but none of the higher level infrastructure supports
467 * returning a specific error on buffer lookup failures.
469 xfs_alert(btp
->bt_mount
,
470 "%s: Block out of range: block 0x%llx, EOFS 0x%llx ",
471 __func__
, blkno
, eofs
);
477 pag
= xfs_perag_get(btp
->bt_mount
,
478 xfs_daddr_to_agno(btp
->bt_mount
, blkno
));
481 spin_lock(&pag
->pag_buf_lock
);
482 rbp
= &pag
->pag_buf_tree
.rb_node
;
487 bp
= rb_entry(parent
, struct xfs_buf
, b_rbnode
);
489 if (blkno
< bp
->b_bn
)
490 rbp
= &(*rbp
)->rb_left
;
491 else if (blkno
> bp
->b_bn
)
492 rbp
= &(*rbp
)->rb_right
;
495 * found a block number match. If the range doesn't
496 * match, the only way this is allowed is if the buffer
497 * in the cache is stale and the transaction that made
498 * it stale has not yet committed. i.e. we are
499 * reallocating a busy extent. Skip this buffer and
500 * continue searching to the right for an exact match.
502 if (bp
->b_length
!= numblks
) {
503 ASSERT(bp
->b_flags
& XBF_STALE
);
504 rbp
= &(*rbp
)->rb_right
;
507 atomic_inc(&bp
->b_hold
);
514 rb_link_node(&new_bp
->b_rbnode
, parent
, rbp
);
515 rb_insert_color(&new_bp
->b_rbnode
, &pag
->pag_buf_tree
);
516 /* the buffer keeps the perag reference until it is freed */
518 spin_unlock(&pag
->pag_buf_lock
);
520 XFS_STATS_INC(btp
->bt_mount
, xb_miss_locked
);
521 spin_unlock(&pag
->pag_buf_lock
);
527 spin_unlock(&pag
->pag_buf_lock
);
530 if (!xfs_buf_trylock(bp
)) {
531 if (flags
& XBF_TRYLOCK
) {
533 XFS_STATS_INC(btp
->bt_mount
, xb_busy_locked
);
537 XFS_STATS_INC(btp
->bt_mount
, xb_get_locked_waited
);
541 * if the buffer is stale, clear all the external state associated with
542 * it. We need to keep flags such as how we allocated the buffer memory
545 if (bp
->b_flags
& XBF_STALE
) {
546 ASSERT((bp
->b_flags
& _XBF_DELWRI_Q
) == 0);
547 ASSERT(bp
->b_iodone
== NULL
);
548 bp
->b_flags
&= _XBF_KMEM
| _XBF_PAGES
;
552 trace_xfs_buf_find(bp
, flags
, _RET_IP_
);
553 XFS_STATS_INC(btp
->bt_mount
, xb_get_locked
);
558 * Assembles a buffer covering the specified range. The code is optimised for
559 * cache hits, as metadata intensive workloads will see 3 orders of magnitude
560 * more hits than misses.
564 struct xfs_buftarg
*target
,
565 struct xfs_buf_map
*map
,
567 xfs_buf_flags_t flags
)
570 struct xfs_buf
*new_bp
;
573 bp
= _xfs_buf_find(target
, map
, nmaps
, flags
, NULL
);
577 new_bp
= _xfs_buf_alloc(target
, map
, nmaps
, flags
);
578 if (unlikely(!new_bp
))
581 error
= xfs_buf_allocate_memory(new_bp
, flags
);
583 xfs_buf_free(new_bp
);
587 bp
= _xfs_buf_find(target
, map
, nmaps
, flags
, new_bp
);
589 xfs_buf_free(new_bp
);
594 xfs_buf_free(new_bp
);
598 error
= _xfs_buf_map_pages(bp
, flags
);
599 if (unlikely(error
)) {
600 xfs_warn(target
->bt_mount
,
601 "%s: failed to map pagesn", __func__
);
608 * Clear b_error if this is a lookup from a caller that doesn't expect
609 * valid data to be found in the buffer.
611 if (!(flags
& XBF_READ
))
612 xfs_buf_ioerror(bp
, 0);
614 XFS_STATS_INC(target
->bt_mount
, xb_get
);
615 trace_xfs_buf_get(bp
, flags
, _RET_IP_
);
622 xfs_buf_flags_t flags
)
624 ASSERT(!(flags
& XBF_WRITE
));
625 ASSERT(bp
->b_maps
[0].bm_bn
!= XFS_BUF_DADDR_NULL
);
627 bp
->b_flags
&= ~(XBF_WRITE
| XBF_ASYNC
| XBF_READ_AHEAD
);
628 bp
->b_flags
|= flags
& (XBF_READ
| XBF_ASYNC
| XBF_READ_AHEAD
);
630 if (flags
& XBF_ASYNC
) {
634 return xfs_buf_submit_wait(bp
);
639 struct xfs_buftarg
*target
,
640 struct xfs_buf_map
*map
,
642 xfs_buf_flags_t flags
,
643 const struct xfs_buf_ops
*ops
)
649 bp
= xfs_buf_get_map(target
, map
, nmaps
, flags
);
651 trace_xfs_buf_read(bp
, flags
, _RET_IP_
);
653 if (!(bp
->b_flags
& XBF_DONE
)) {
654 XFS_STATS_INC(target
->bt_mount
, xb_get_read
);
656 _xfs_buf_read(bp
, flags
);
657 } else if (flags
& XBF_ASYNC
) {
659 * Read ahead call which is already satisfied,
665 /* We do not want read in the flags */
666 bp
->b_flags
&= ~XBF_READ
;
674 * If we are not low on memory then do the readahead in a deadlock
678 xfs_buf_readahead_map(
679 struct xfs_buftarg
*target
,
680 struct xfs_buf_map
*map
,
682 const struct xfs_buf_ops
*ops
)
684 if (bdi_read_congested(target
->bt_bdi
))
687 xfs_buf_read_map(target
, map
, nmaps
,
688 XBF_TRYLOCK
|XBF_ASYNC
|XBF_READ_AHEAD
, ops
);
692 * Read an uncached buffer from disk. Allocates and returns a locked
693 * buffer containing the disk contents or nothing.
696 xfs_buf_read_uncached(
697 struct xfs_buftarg
*target
,
701 struct xfs_buf
**bpp
,
702 const struct xfs_buf_ops
*ops
)
708 bp
= xfs_buf_get_uncached(target
, numblks
, flags
);
712 /* set up the buffer for a read IO */
713 ASSERT(bp
->b_map_count
== 1);
714 bp
->b_bn
= XFS_BUF_DADDR_NULL
; /* always null for uncached buffers */
715 bp
->b_maps
[0].bm_bn
= daddr
;
716 bp
->b_flags
|= XBF_READ
;
719 xfs_buf_submit_wait(bp
);
721 int error
= bp
->b_error
;
731 * Return a buffer allocated as an empty buffer and associated to external
732 * memory via xfs_buf_associate_memory() back to it's empty state.
740 _xfs_buf_free_pages(bp
);
743 bp
->b_page_count
= 0;
745 bp
->b_length
= numblks
;
746 bp
->b_io_length
= numblks
;
748 ASSERT(bp
->b_map_count
== 1);
749 bp
->b_bn
= XFS_BUF_DADDR_NULL
;
750 bp
->b_maps
[0].bm_bn
= XFS_BUF_DADDR_NULL
;
751 bp
->b_maps
[0].bm_len
= bp
->b_length
;
754 static inline struct page
*
758 if ((!is_vmalloc_addr(addr
))) {
759 return virt_to_page(addr
);
761 return vmalloc_to_page(addr
);
766 xfs_buf_associate_memory(
773 unsigned long pageaddr
;
774 unsigned long offset
;
778 pageaddr
= (unsigned long)mem
& PAGE_MASK
;
779 offset
= (unsigned long)mem
- pageaddr
;
780 buflen
= PAGE_ALIGN(len
+ offset
);
781 page_count
= buflen
>> PAGE_SHIFT
;
783 /* Free any previous set of page pointers */
785 _xfs_buf_free_pages(bp
);
790 rval
= _xfs_buf_get_pages(bp
, page_count
);
794 bp
->b_offset
= offset
;
796 for (i
= 0; i
< bp
->b_page_count
; i
++) {
797 bp
->b_pages
[i
] = mem_to_page((void *)pageaddr
);
798 pageaddr
+= PAGE_SIZE
;
801 bp
->b_io_length
= BTOBB(len
);
802 bp
->b_length
= BTOBB(buflen
);
808 xfs_buf_get_uncached(
809 struct xfs_buftarg
*target
,
813 unsigned long page_count
;
816 DEFINE_SINGLE_BUF_MAP(map
, XFS_BUF_DADDR_NULL
, numblks
);
818 bp
= _xfs_buf_alloc(target
, &map
, 1, 0);
819 if (unlikely(bp
== NULL
))
822 page_count
= PAGE_ALIGN(numblks
<< BBSHIFT
) >> PAGE_SHIFT
;
823 error
= _xfs_buf_get_pages(bp
, page_count
);
827 for (i
= 0; i
< page_count
; i
++) {
828 bp
->b_pages
[i
] = alloc_page(xb_to_gfp(flags
));
832 bp
->b_flags
|= _XBF_PAGES
;
834 error
= _xfs_buf_map_pages(bp
, 0);
835 if (unlikely(error
)) {
836 xfs_warn(target
->bt_mount
,
837 "%s: failed to map pages", __func__
);
841 trace_xfs_buf_get_uncached(bp
, _RET_IP_
);
846 __free_page(bp
->b_pages
[i
]);
847 _xfs_buf_free_pages(bp
);
849 xfs_buf_free_maps(bp
);
850 kmem_zone_free(xfs_buf_zone
, bp
);
856 * Increment reference count on buffer, to hold the buffer concurrently
857 * with another thread which may release (free) the buffer asynchronously.
858 * Must hold the buffer already to call this function.
864 trace_xfs_buf_hold(bp
, _RET_IP_
);
865 atomic_inc(&bp
->b_hold
);
869 * Releases a hold on the specified buffer. If the
870 * the hold count is 1, calls xfs_buf_free.
876 struct xfs_perag
*pag
= bp
->b_pag
;
878 trace_xfs_buf_rele(bp
, _RET_IP_
);
881 ASSERT(list_empty(&bp
->b_lru
));
882 ASSERT(RB_EMPTY_NODE(&bp
->b_rbnode
));
883 if (atomic_dec_and_test(&bp
->b_hold
))
888 ASSERT(!RB_EMPTY_NODE(&bp
->b_rbnode
));
890 ASSERT(atomic_read(&bp
->b_hold
) > 0);
891 if (atomic_dec_and_lock(&bp
->b_hold
, &pag
->pag_buf_lock
)) {
892 spin_lock(&bp
->b_lock
);
893 if (!(bp
->b_flags
& XBF_STALE
) && atomic_read(&bp
->b_lru_ref
)) {
895 * If the buffer is added to the LRU take a new
896 * reference to the buffer for the LRU and clear the
897 * (now stale) dispose list state flag
899 if (list_lru_add(&bp
->b_target
->bt_lru
, &bp
->b_lru
)) {
900 bp
->b_state
&= ~XFS_BSTATE_DISPOSE
;
901 atomic_inc(&bp
->b_hold
);
903 spin_unlock(&bp
->b_lock
);
904 spin_unlock(&pag
->pag_buf_lock
);
907 * most of the time buffers will already be removed from
908 * the LRU, so optimise that case by checking for the
909 * XFS_BSTATE_DISPOSE flag indicating the last list the
910 * buffer was on was the disposal list
912 if (!(bp
->b_state
& XFS_BSTATE_DISPOSE
)) {
913 list_lru_del(&bp
->b_target
->bt_lru
, &bp
->b_lru
);
915 ASSERT(list_empty(&bp
->b_lru
));
917 spin_unlock(&bp
->b_lock
);
919 ASSERT(!(bp
->b_flags
& _XBF_DELWRI_Q
));
920 rb_erase(&bp
->b_rbnode
, &pag
->pag_buf_tree
);
921 spin_unlock(&pag
->pag_buf_lock
);
930 * Lock a buffer object, if it is not already locked.
932 * If we come across a stale, pinned, locked buffer, we know that we are
933 * being asked to lock a buffer that has been reallocated. Because it is
934 * pinned, we know that the log has not been pushed to disk and hence it
935 * will still be locked. Rather than continuing to have trylock attempts
936 * fail until someone else pushes the log, push it ourselves before
937 * returning. This means that the xfsaild will not get stuck trying
938 * to push on stale inode buffers.
946 locked
= down_trylock(&bp
->b_sema
) == 0;
950 trace_xfs_buf_trylock(bp
, _RET_IP_
);
955 * Lock a buffer object.
957 * If we come across a stale, pinned, locked buffer, we know that we
958 * are being asked to lock a buffer that has been reallocated. Because
959 * it is pinned, we know that the log has not been pushed to disk and
960 * hence it will still be locked. Rather than sleeping until someone
961 * else pushes the log, push it ourselves before trying to get the lock.
967 trace_xfs_buf_lock(bp
, _RET_IP_
);
969 if (atomic_read(&bp
->b_pin_count
) && (bp
->b_flags
& XBF_STALE
))
970 xfs_log_force(bp
->b_target
->bt_mount
, 0);
974 trace_xfs_buf_lock_done(bp
, _RET_IP_
);
984 trace_xfs_buf_unlock(bp
, _RET_IP_
);
991 DECLARE_WAITQUEUE (wait
, current
);
993 if (atomic_read(&bp
->b_pin_count
) == 0)
996 add_wait_queue(&bp
->b_waiters
, &wait
);
998 set_current_state(TASK_UNINTERRUPTIBLE
);
999 if (atomic_read(&bp
->b_pin_count
) == 0)
1003 remove_wait_queue(&bp
->b_waiters
, &wait
);
1004 set_current_state(TASK_RUNNING
);
1008 * Buffer Utility Routines
1015 bool read
= bp
->b_flags
& XBF_READ
;
1017 trace_xfs_buf_iodone(bp
, _RET_IP_
);
1019 bp
->b_flags
&= ~(XBF_READ
| XBF_WRITE
| XBF_READ_AHEAD
);
1022 * Pull in IO completion errors now. We are guaranteed to be running
1023 * single threaded, so we don't need the lock to read b_io_error.
1025 if (!bp
->b_error
&& bp
->b_io_error
)
1026 xfs_buf_ioerror(bp
, bp
->b_io_error
);
1028 /* Only validate buffers that were read without errors */
1029 if (read
&& !bp
->b_error
&& bp
->b_ops
) {
1030 ASSERT(!bp
->b_iodone
);
1031 bp
->b_ops
->verify_read(bp
);
1035 bp
->b_flags
|= XBF_DONE
;
1038 (*(bp
->b_iodone
))(bp
);
1039 else if (bp
->b_flags
& XBF_ASYNC
)
1042 complete(&bp
->b_iowait
);
1047 struct work_struct
*work
)
1049 struct xfs_buf
*bp
=
1050 container_of(work
, xfs_buf_t
, b_ioend_work
);
1056 xfs_buf_ioend_async(
1059 INIT_WORK(&bp
->b_ioend_work
, xfs_buf_ioend_work
);
1060 queue_work(bp
->b_ioend_wq
, &bp
->b_ioend_work
);
1068 ASSERT(error
<= 0 && error
>= -1000);
1069 bp
->b_error
= error
;
1070 trace_xfs_buf_ioerror(bp
, error
, _RET_IP_
);
1074 xfs_buf_ioerror_alert(
1078 xfs_alert(bp
->b_target
->bt_mount
,
1079 "metadata I/O error: block 0x%llx (\"%s\") error %d numblks %d",
1080 (__uint64_t
)XFS_BUF_ADDR(bp
), func
, -bp
->b_error
, bp
->b_length
);
1089 ASSERT(xfs_buf_islocked(bp
));
1091 bp
->b_flags
|= XBF_WRITE
;
1092 bp
->b_flags
&= ~(XBF_ASYNC
| XBF_READ
| _XBF_DELWRI_Q
|
1093 XBF_WRITE_FAIL
| XBF_DONE
);
1095 error
= xfs_buf_submit_wait(bp
);
1097 xfs_force_shutdown(bp
->b_target
->bt_mount
,
1098 SHUTDOWN_META_IO_ERROR
);
1107 xfs_buf_t
*bp
= (xfs_buf_t
*)bio
->bi_private
;
1110 * don't overwrite existing errors - otherwise we can lose errors on
1111 * buffers that require multiple bios to complete.
1113 if (bio
->bi_error
) {
1114 spin_lock(&bp
->b_lock
);
1115 if (!bp
->b_io_error
)
1116 bp
->b_io_error
= bio
->bi_error
;
1117 spin_unlock(&bp
->b_lock
);
1120 if (!bp
->b_error
&& xfs_buf_is_vmapped(bp
) && (bp
->b_flags
& XBF_READ
))
1121 invalidate_kernel_vmap_range(bp
->b_addr
, xfs_buf_vmap_len(bp
));
1123 if (atomic_dec_and_test(&bp
->b_io_remaining
) == 1)
1124 xfs_buf_ioend_async(bp
);
1129 xfs_buf_ioapply_map(
1137 int total_nr_pages
= bp
->b_page_count
;
1140 sector_t sector
= bp
->b_maps
[map
].bm_bn
;
1144 total_nr_pages
= bp
->b_page_count
;
1146 /* skip the pages in the buffer before the start offset */
1148 offset
= *buf_offset
;
1149 while (offset
>= PAGE_SIZE
) {
1151 offset
-= PAGE_SIZE
;
1155 * Limit the IO size to the length of the current vector, and update the
1156 * remaining IO count for the next time around.
1158 size
= min_t(int, BBTOB(bp
->b_maps
[map
].bm_len
), *count
);
1160 *buf_offset
+= size
;
1163 atomic_inc(&bp
->b_io_remaining
);
1164 nr_pages
= BIO_MAX_SECTORS
>> (PAGE_SHIFT
- BBSHIFT
);
1165 if (nr_pages
> total_nr_pages
)
1166 nr_pages
= total_nr_pages
;
1168 bio
= bio_alloc(GFP_NOIO
, nr_pages
);
1169 bio
->bi_bdev
= bp
->b_target
->bt_bdev
;
1170 bio
->bi_iter
.bi_sector
= sector
;
1171 bio
->bi_end_io
= xfs_buf_bio_end_io
;
1172 bio
->bi_private
= bp
;
1175 for (; size
&& nr_pages
; nr_pages
--, page_index
++) {
1176 int rbytes
, nbytes
= PAGE_SIZE
- offset
;
1181 rbytes
= bio_add_page(bio
, bp
->b_pages
[page_index
], nbytes
,
1183 if (rbytes
< nbytes
)
1187 sector
+= BTOBB(nbytes
);
1192 if (likely(bio
->bi_iter
.bi_size
)) {
1193 if (xfs_buf_is_vmapped(bp
)) {
1194 flush_kernel_vmap_range(bp
->b_addr
,
1195 xfs_buf_vmap_len(bp
));
1197 submit_bio(rw
, bio
);
1202 * This is guaranteed not to be the last io reference count
1203 * because the caller (xfs_buf_submit) holds a count itself.
1205 atomic_dec(&bp
->b_io_remaining
);
1206 xfs_buf_ioerror(bp
, -EIO
);
1216 struct blk_plug plug
;
1223 * Make sure we capture only current IO errors rather than stale errors
1224 * left over from previous use of the buffer (e.g. failed readahead).
1229 * Initialize the I/O completion workqueue if we haven't yet or the
1230 * submitter has not opted to specify a custom one.
1232 if (!bp
->b_ioend_wq
)
1233 bp
->b_ioend_wq
= bp
->b_target
->bt_mount
->m_buf_workqueue
;
1235 if (bp
->b_flags
& XBF_WRITE
) {
1236 if (bp
->b_flags
& XBF_SYNCIO
)
1240 if (bp
->b_flags
& XBF_FUA
)
1242 if (bp
->b_flags
& XBF_FLUSH
)
1246 * Run the write verifier callback function if it exists. If
1247 * this function fails it will mark the buffer with an error and
1248 * the IO should not be dispatched.
1251 bp
->b_ops
->verify_write(bp
);
1253 xfs_force_shutdown(bp
->b_target
->bt_mount
,
1254 SHUTDOWN_CORRUPT_INCORE
);
1257 } else if (bp
->b_bn
!= XFS_BUF_DADDR_NULL
) {
1258 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
1261 * non-crc filesystems don't attach verifiers during
1262 * log recovery, so don't warn for such filesystems.
1264 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
1266 "%s: no ops on block 0x%llx/0x%x",
1267 __func__
, bp
->b_bn
, bp
->b_length
);
1268 xfs_hex_dump(bp
->b_addr
, 64);
1272 } else if (bp
->b_flags
& XBF_READ_AHEAD
) {
1278 /* we only use the buffer cache for meta-data */
1282 * Walk all the vectors issuing IO on them. Set up the initial offset
1283 * into the buffer and the desired IO size before we start -
1284 * _xfs_buf_ioapply_vec() will modify them appropriately for each
1287 offset
= bp
->b_offset
;
1288 size
= BBTOB(bp
->b_io_length
);
1289 blk_start_plug(&plug
);
1290 for (i
= 0; i
< bp
->b_map_count
; i
++) {
1291 xfs_buf_ioapply_map(bp
, i
, &offset
, &size
, rw
);
1295 break; /* all done */
1297 blk_finish_plug(&plug
);
1301 * Asynchronous IO submission path. This transfers the buffer lock ownership and
1302 * the current reference to the IO. It is not safe to reference the buffer after
1303 * a call to this function unless the caller holds an additional reference
1310 trace_xfs_buf_submit(bp
, _RET_IP_
);
1312 ASSERT(!(bp
->b_flags
& _XBF_DELWRI_Q
));
1313 ASSERT(bp
->b_flags
& XBF_ASYNC
);
1315 /* on shutdown we stale and complete the buffer immediately */
1316 if (XFS_FORCED_SHUTDOWN(bp
->b_target
->bt_mount
)) {
1317 xfs_buf_ioerror(bp
, -EIO
);
1318 bp
->b_flags
&= ~XBF_DONE
;
1324 if (bp
->b_flags
& XBF_WRITE
)
1325 xfs_buf_wait_unpin(bp
);
1327 /* clear the internal error state to avoid spurious errors */
1331 * The caller's reference is released during I/O completion.
1332 * This occurs some time after the last b_io_remaining reference is
1333 * released, so after we drop our Io reference we have to have some
1334 * other reference to ensure the buffer doesn't go away from underneath
1335 * us. Take a direct reference to ensure we have safe access to the
1336 * buffer until we are finished with it.
1341 * Set the count to 1 initially, this will stop an I/O completion
1342 * callout which happens before we have started all the I/O from calling
1343 * xfs_buf_ioend too early.
1345 atomic_set(&bp
->b_io_remaining
, 1);
1346 _xfs_buf_ioapply(bp
);
1349 * If _xfs_buf_ioapply failed, we can get back here with only the IO
1350 * reference we took above. If we drop it to zero, run completion so
1351 * that we don't return to the caller with completion still pending.
1353 if (atomic_dec_and_test(&bp
->b_io_remaining
) == 1) {
1357 xfs_buf_ioend_async(bp
);
1361 /* Note: it is not safe to reference bp now we've dropped our ref */
1365 * Synchronous buffer IO submission path, read or write.
1368 xfs_buf_submit_wait(
1373 trace_xfs_buf_submit_wait(bp
, _RET_IP_
);
1375 ASSERT(!(bp
->b_flags
& (_XBF_DELWRI_Q
| XBF_ASYNC
)));
1377 if (XFS_FORCED_SHUTDOWN(bp
->b_target
->bt_mount
)) {
1378 xfs_buf_ioerror(bp
, -EIO
);
1380 bp
->b_flags
&= ~XBF_DONE
;
1384 if (bp
->b_flags
& XBF_WRITE
)
1385 xfs_buf_wait_unpin(bp
);
1387 /* clear the internal error state to avoid spurious errors */
1391 * For synchronous IO, the IO does not inherit the submitters reference
1392 * count, nor the buffer lock. Hence we cannot release the reference we
1393 * are about to take until we've waited for all IO completion to occur,
1394 * including any xfs_buf_ioend_async() work that may be pending.
1399 * Set the count to 1 initially, this will stop an I/O completion
1400 * callout which happens before we have started all the I/O from calling
1401 * xfs_buf_ioend too early.
1403 atomic_set(&bp
->b_io_remaining
, 1);
1404 _xfs_buf_ioapply(bp
);
1407 * make sure we run completion synchronously if it raced with us and is
1410 if (atomic_dec_and_test(&bp
->b_io_remaining
) == 1)
1413 /* wait for completion before gathering the error from the buffer */
1414 trace_xfs_buf_iowait(bp
, _RET_IP_
);
1415 wait_for_completion(&bp
->b_iowait
);
1416 trace_xfs_buf_iowait_done(bp
, _RET_IP_
);
1417 error
= bp
->b_error
;
1420 * all done now, we can release the hold that keeps the buffer
1421 * referenced for the entire IO.
1435 return bp
->b_addr
+ offset
;
1437 offset
+= bp
->b_offset
;
1438 page
= bp
->b_pages
[offset
>> PAGE_SHIFT
];
1439 return page_address(page
) + (offset
& (PAGE_SIZE
-1));
1443 * Move data into or out of a buffer.
1447 xfs_buf_t
*bp
, /* buffer to process */
1448 size_t boff
, /* starting buffer offset */
1449 size_t bsize
, /* length to copy */
1450 void *data
, /* data address */
1451 xfs_buf_rw_t mode
) /* read/write/zero flag */
1455 bend
= boff
+ bsize
;
1456 while (boff
< bend
) {
1458 int page_index
, page_offset
, csize
;
1460 page_index
= (boff
+ bp
->b_offset
) >> PAGE_SHIFT
;
1461 page_offset
= (boff
+ bp
->b_offset
) & ~PAGE_MASK
;
1462 page
= bp
->b_pages
[page_index
];
1463 csize
= min_t(size_t, PAGE_SIZE
- page_offset
,
1464 BBTOB(bp
->b_io_length
) - boff
);
1466 ASSERT((csize
+ page_offset
) <= PAGE_SIZE
);
1470 memset(page_address(page
) + page_offset
, 0, csize
);
1473 memcpy(data
, page_address(page
) + page_offset
, csize
);
1476 memcpy(page_address(page
) + page_offset
, data
, csize
);
1485 * Handling of buffer targets (buftargs).
1489 * Wait for any bufs with callbacks that have been submitted but have not yet
1490 * returned. These buffers will have an elevated hold count, so wait on those
1491 * while freeing all the buffers only held by the LRU.
1493 static enum lru_status
1494 xfs_buftarg_wait_rele(
1495 struct list_head
*item
,
1496 struct list_lru_one
*lru
,
1497 spinlock_t
*lru_lock
,
1501 struct xfs_buf
*bp
= container_of(item
, struct xfs_buf
, b_lru
);
1502 struct list_head
*dispose
= arg
;
1504 if (atomic_read(&bp
->b_hold
) > 1) {
1505 /* need to wait, so skip it this pass */
1506 trace_xfs_buf_wait_buftarg(bp
, _RET_IP_
);
1509 if (!spin_trylock(&bp
->b_lock
))
1513 * clear the LRU reference count so the buffer doesn't get
1514 * ignored in xfs_buf_rele().
1516 atomic_set(&bp
->b_lru_ref
, 0);
1517 bp
->b_state
|= XFS_BSTATE_DISPOSE
;
1518 list_lru_isolate_move(lru
, item
, dispose
);
1519 spin_unlock(&bp
->b_lock
);
1525 struct xfs_buftarg
*btp
)
1531 * We need to flush the buffer workqueue to ensure that all IO
1532 * completion processing is 100% done. Just waiting on buffer locks is
1533 * not sufficient for async IO as the reference count held over IO is
1534 * not released until after the buffer lock is dropped. Hence we need to
1535 * ensure here that all reference counts have been dropped before we
1536 * start walking the LRU list.
1538 drain_workqueue(btp
->bt_mount
->m_buf_workqueue
);
1540 /* loop until there is nothing left on the lru list. */
1541 while (list_lru_count(&btp
->bt_lru
)) {
1542 list_lru_walk(&btp
->bt_lru
, xfs_buftarg_wait_rele
,
1543 &dispose
, LONG_MAX
);
1545 while (!list_empty(&dispose
)) {
1547 bp
= list_first_entry(&dispose
, struct xfs_buf
, b_lru
);
1548 list_del_init(&bp
->b_lru
);
1549 if (bp
->b_flags
& XBF_WRITE_FAIL
) {
1550 xfs_alert(btp
->bt_mount
,
1551 "Corruption Alert: Buffer at block 0x%llx had permanent write failures!",
1552 (long long)bp
->b_bn
);
1553 xfs_alert(btp
->bt_mount
,
1554 "Please run xfs_repair to determine the extent of the problem.");
1563 static enum lru_status
1564 xfs_buftarg_isolate(
1565 struct list_head
*item
,
1566 struct list_lru_one
*lru
,
1567 spinlock_t
*lru_lock
,
1570 struct xfs_buf
*bp
= container_of(item
, struct xfs_buf
, b_lru
);
1571 struct list_head
*dispose
= arg
;
1574 * we are inverting the lru lock/bp->b_lock here, so use a trylock.
1575 * If we fail to get the lock, just skip it.
1577 if (!spin_trylock(&bp
->b_lock
))
1580 * Decrement the b_lru_ref count unless the value is already
1581 * zero. If the value is already zero, we need to reclaim the
1582 * buffer, otherwise it gets another trip through the LRU.
1584 if (!atomic_add_unless(&bp
->b_lru_ref
, -1, 0)) {
1585 spin_unlock(&bp
->b_lock
);
1589 bp
->b_state
|= XFS_BSTATE_DISPOSE
;
1590 list_lru_isolate_move(lru
, item
, dispose
);
1591 spin_unlock(&bp
->b_lock
);
1595 static unsigned long
1596 xfs_buftarg_shrink_scan(
1597 struct shrinker
*shrink
,
1598 struct shrink_control
*sc
)
1600 struct xfs_buftarg
*btp
= container_of(shrink
,
1601 struct xfs_buftarg
, bt_shrinker
);
1603 unsigned long freed
;
1605 freed
= list_lru_shrink_walk(&btp
->bt_lru
, sc
,
1606 xfs_buftarg_isolate
, &dispose
);
1608 while (!list_empty(&dispose
)) {
1610 bp
= list_first_entry(&dispose
, struct xfs_buf
, b_lru
);
1611 list_del_init(&bp
->b_lru
);
1618 static unsigned long
1619 xfs_buftarg_shrink_count(
1620 struct shrinker
*shrink
,
1621 struct shrink_control
*sc
)
1623 struct xfs_buftarg
*btp
= container_of(shrink
,
1624 struct xfs_buftarg
, bt_shrinker
);
1625 return list_lru_shrink_count(&btp
->bt_lru
, sc
);
1630 struct xfs_mount
*mp
,
1631 struct xfs_buftarg
*btp
)
1633 unregister_shrinker(&btp
->bt_shrinker
);
1634 list_lru_destroy(&btp
->bt_lru
);
1636 if (mp
->m_flags
& XFS_MOUNT_BARRIER
)
1637 xfs_blkdev_issue_flush(btp
);
1643 xfs_setsize_buftarg(
1645 unsigned int sectorsize
)
1647 /* Set up metadata sector size info */
1648 btp
->bt_meta_sectorsize
= sectorsize
;
1649 btp
->bt_meta_sectormask
= sectorsize
- 1;
1651 if (set_blocksize(btp
->bt_bdev
, sectorsize
)) {
1652 xfs_warn(btp
->bt_mount
,
1653 "Cannot set_blocksize to %u on device %pg",
1654 sectorsize
, btp
->bt_bdev
);
1658 /* Set up device logical sector size mask */
1659 btp
->bt_logical_sectorsize
= bdev_logical_block_size(btp
->bt_bdev
);
1660 btp
->bt_logical_sectormask
= bdev_logical_block_size(btp
->bt_bdev
) - 1;
1666 * When allocating the initial buffer target we have not yet
1667 * read in the superblock, so don't know what sized sectors
1668 * are being used at this early stage. Play safe.
1671 xfs_setsize_buftarg_early(
1673 struct block_device
*bdev
)
1675 return xfs_setsize_buftarg(btp
, bdev_logical_block_size(bdev
));
1680 struct xfs_mount
*mp
,
1681 struct block_device
*bdev
)
1685 btp
= kmem_zalloc(sizeof(*btp
), KM_SLEEP
| KM_NOFS
);
1688 btp
->bt_dev
= bdev
->bd_dev
;
1689 btp
->bt_bdev
= bdev
;
1690 btp
->bt_bdi
= blk_get_backing_dev_info(bdev
);
1692 if (xfs_setsize_buftarg_early(btp
, bdev
))
1695 if (list_lru_init(&btp
->bt_lru
))
1698 btp
->bt_shrinker
.count_objects
= xfs_buftarg_shrink_count
;
1699 btp
->bt_shrinker
.scan_objects
= xfs_buftarg_shrink_scan
;
1700 btp
->bt_shrinker
.seeks
= DEFAULT_SEEKS
;
1701 btp
->bt_shrinker
.flags
= SHRINKER_NUMA_AWARE
;
1702 register_shrinker(&btp
->bt_shrinker
);
1711 * Add a buffer to the delayed write list.
1713 * This queues a buffer for writeout if it hasn't already been. Note that
1714 * neither this routine nor the buffer list submission functions perform
1715 * any internal synchronization. It is expected that the lists are thread-local
1718 * Returns true if we queued up the buffer, or false if it already had
1719 * been on the buffer list.
1722 xfs_buf_delwri_queue(
1724 struct list_head
*list
)
1726 ASSERT(xfs_buf_islocked(bp
));
1727 ASSERT(!(bp
->b_flags
& XBF_READ
));
1730 * If the buffer is already marked delwri it already is queued up
1731 * by someone else for imediate writeout. Just ignore it in that
1734 if (bp
->b_flags
& _XBF_DELWRI_Q
) {
1735 trace_xfs_buf_delwri_queued(bp
, _RET_IP_
);
1739 trace_xfs_buf_delwri_queue(bp
, _RET_IP_
);
1742 * If a buffer gets written out synchronously or marked stale while it
1743 * is on a delwri list we lazily remove it. To do this, the other party
1744 * clears the _XBF_DELWRI_Q flag but otherwise leaves the buffer alone.
1745 * It remains referenced and on the list. In a rare corner case it
1746 * might get readded to a delwri list after the synchronous writeout, in
1747 * which case we need just need to re-add the flag here.
1749 bp
->b_flags
|= _XBF_DELWRI_Q
;
1750 if (list_empty(&bp
->b_list
)) {
1751 atomic_inc(&bp
->b_hold
);
1752 list_add_tail(&bp
->b_list
, list
);
1759 * Compare function is more complex than it needs to be because
1760 * the return value is only 32 bits and we are doing comparisons
1766 struct list_head
*a
,
1767 struct list_head
*b
)
1769 struct xfs_buf
*ap
= container_of(a
, struct xfs_buf
, b_list
);
1770 struct xfs_buf
*bp
= container_of(b
, struct xfs_buf
, b_list
);
1773 diff
= ap
->b_maps
[0].bm_bn
- bp
->b_maps
[0].bm_bn
;
1782 __xfs_buf_delwri_submit(
1783 struct list_head
*buffer_list
,
1784 struct list_head
*io_list
,
1787 struct blk_plug plug
;
1788 struct xfs_buf
*bp
, *n
;
1791 list_for_each_entry_safe(bp
, n
, buffer_list
, b_list
) {
1793 if (xfs_buf_ispinned(bp
)) {
1797 if (!xfs_buf_trylock(bp
))
1804 * Someone else might have written the buffer synchronously or
1805 * marked it stale in the meantime. In that case only the
1806 * _XBF_DELWRI_Q flag got cleared, and we have to drop the
1807 * reference and remove it from the list here.
1809 if (!(bp
->b_flags
& _XBF_DELWRI_Q
)) {
1810 list_del_init(&bp
->b_list
);
1815 list_move_tail(&bp
->b_list
, io_list
);
1816 trace_xfs_buf_delwri_split(bp
, _RET_IP_
);
1819 list_sort(NULL
, io_list
, xfs_buf_cmp
);
1821 blk_start_plug(&plug
);
1822 list_for_each_entry_safe(bp
, n
, io_list
, b_list
) {
1823 bp
->b_flags
&= ~(_XBF_DELWRI_Q
| XBF_ASYNC
| XBF_WRITE_FAIL
);
1824 bp
->b_flags
|= XBF_WRITE
| XBF_ASYNC
;
1827 * we do all Io submission async. This means if we need to wait
1828 * for IO completion we need to take an extra reference so the
1829 * buffer is still valid on the other side.
1834 list_del_init(&bp
->b_list
);
1838 blk_finish_plug(&plug
);
1844 * Write out a buffer list asynchronously.
1846 * This will take the @buffer_list, write all non-locked and non-pinned buffers
1847 * out and not wait for I/O completion on any of the buffers. This interface
1848 * is only safely useable for callers that can track I/O completion by higher
1849 * level means, e.g. AIL pushing as the @buffer_list is consumed in this
1853 xfs_buf_delwri_submit_nowait(
1854 struct list_head
*buffer_list
)
1856 LIST_HEAD (io_list
);
1857 return __xfs_buf_delwri_submit(buffer_list
, &io_list
, false);
1861 * Write out a buffer list synchronously.
1863 * This will take the @buffer_list, write all buffers out and wait for I/O
1864 * completion on all of the buffers. @buffer_list is consumed by the function,
1865 * so callers must have some other way of tracking buffers if they require such
1869 xfs_buf_delwri_submit(
1870 struct list_head
*buffer_list
)
1872 LIST_HEAD (io_list
);
1873 int error
= 0, error2
;
1876 __xfs_buf_delwri_submit(buffer_list
, &io_list
, true);
1878 /* Wait for IO to complete. */
1879 while (!list_empty(&io_list
)) {
1880 bp
= list_first_entry(&io_list
, struct xfs_buf
, b_list
);
1882 list_del_init(&bp
->b_list
);
1884 /* locking the buffer will wait for async IO completion. */
1886 error2
= bp
->b_error
;
1898 xfs_buf_zone
= kmem_zone_init_flags(sizeof(xfs_buf_t
), "xfs_buf",
1899 KM_ZONE_HWALIGN
, NULL
);
1910 xfs_buf_terminate(void)
1912 kmem_zone_destroy(xfs_buf_zone
);