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 * Page Region interfaces.
99 * For pages in filesystems where the blocksize is smaller than the
100 * pagesize, we use the page->private field (long) to hold a bitmap
101 * of uptodate regions within the page.
103 * Each such region is "bytes per page / bits per long" bytes long.
105 * NBPPR == number-of-bytes-per-page-region
106 * BTOPR == bytes-to-page-region (rounded up)
107 * BTOPRT == bytes-to-page-region-truncated (rounded down)
109 #if (BITS_PER_LONG == 32)
110 #define PRSHIFT (PAGE_CACHE_SHIFT - 5) /* (32 == 1<<5) */
111 #elif (BITS_PER_LONG == 64)
112 #define PRSHIFT (PAGE_CACHE_SHIFT - 6) /* (64 == 1<<6) */
114 #error BITS_PER_LONG must be 32 or 64
116 #define NBPPR (PAGE_CACHE_SIZE/BITS_PER_LONG)
117 #define BTOPR(b) (((unsigned int)(b) + (NBPPR - 1)) >> PRSHIFT)
118 #define BTOPRT(b) (((unsigned int)(b) >> PRSHIFT))
128 first
= BTOPR(offset
);
129 final
= BTOPRT(offset
+ length
- 1);
130 first
= min(first
, final
);
133 mask
<<= BITS_PER_LONG
- (final
- first
);
134 mask
>>= BITS_PER_LONG
- (final
);
136 ASSERT(offset
+ length
<= PAGE_CACHE_SIZE
);
137 ASSERT((final
- first
) < BITS_PER_LONG
&& (final
- first
) >= 0);
148 set_page_private(page
,
149 page_private(page
) | page_region_mask(offset
, length
));
150 if (page_private(page
) == ~0UL)
151 SetPageUptodate(page
);
160 unsigned long mask
= page_region_mask(offset
, length
);
162 return (mask
&& (page_private(page
) & mask
) == mask
);
166 * xfs_buf_lru_add - add a buffer to the LRU.
168 * The LRU takes a new reference to the buffer so that it will only be freed
169 * once the shrinker takes the buffer off the LRU.
175 struct xfs_buftarg
*btp
= bp
->b_target
;
177 spin_lock(&btp
->bt_lru_lock
);
178 if (list_empty(&bp
->b_lru
)) {
179 atomic_inc(&bp
->b_hold
);
180 list_add_tail(&bp
->b_lru
, &btp
->bt_lru
);
183 spin_unlock(&btp
->bt_lru_lock
);
187 * xfs_buf_lru_del - remove a buffer from the LRU
189 * The unlocked check is safe here because it only occurs when there are not
190 * b_lru_ref counts left on the inode under the pag->pag_buf_lock. it is there
191 * to optimise the shrinker removing the buffer from the LRU and calling
192 * xfs_buf_free(). i.e. it removes an unneccessary round trip on the
199 struct xfs_buftarg
*btp
= bp
->b_target
;
201 if (list_empty(&bp
->b_lru
))
204 spin_lock(&btp
->bt_lru_lock
);
205 if (!list_empty(&bp
->b_lru
)) {
206 list_del_init(&bp
->b_lru
);
209 spin_unlock(&btp
->bt_lru_lock
);
213 * When we mark a buffer stale, we remove the buffer from the LRU and clear the
214 * b_lru_ref count so that the buffer is freed immediately when the buffer
215 * reference count falls to zero. If the buffer is already on the LRU, we need
216 * to remove the reference that LRU holds on the buffer.
218 * This prevents build-up of stale buffers on the LRU.
224 bp
->b_flags
|= XBF_STALE
;
225 atomic_set(&(bp
)->b_lru_ref
, 0);
226 if (!list_empty(&bp
->b_lru
)) {
227 struct xfs_buftarg
*btp
= bp
->b_target
;
229 spin_lock(&btp
->bt_lru_lock
);
230 if (!list_empty(&bp
->b_lru
)) {
231 list_del_init(&bp
->b_lru
);
233 atomic_dec(&bp
->b_hold
);
235 spin_unlock(&btp
->bt_lru_lock
);
237 ASSERT(atomic_read(&bp
->b_hold
) >= 1);
243 xfs_buftarg_t
*target
,
244 xfs_off_t range_base
,
246 xfs_buf_flags_t flags
)
249 * We don't want certain flags to appear in b_flags.
251 flags
&= ~(XBF_LOCK
|XBF_MAPPED
|XBF_DONT_BLOCK
|XBF_READ_AHEAD
);
253 memset(bp
, 0, sizeof(xfs_buf_t
));
254 atomic_set(&bp
->b_hold
, 1);
255 atomic_set(&bp
->b_lru_ref
, 1);
256 init_completion(&bp
->b_iowait
);
257 INIT_LIST_HEAD(&bp
->b_lru
);
258 INIT_LIST_HEAD(&bp
->b_list
);
259 RB_CLEAR_NODE(&bp
->b_rbnode
);
260 sema_init(&bp
->b_sema
, 0); /* held, no waiters */
262 bp
->b_target
= target
;
263 bp
->b_file_offset
= range_base
;
265 * Set buffer_length and count_desired to the same value initially.
266 * I/O routines should use count_desired, which will be the same in
267 * most cases but may be reset (e.g. XFS recovery).
269 bp
->b_buffer_length
= bp
->b_count_desired
= range_length
;
271 bp
->b_bn
= XFS_BUF_DADDR_NULL
;
272 atomic_set(&bp
->b_pin_count
, 0);
273 init_waitqueue_head(&bp
->b_waiters
);
275 XFS_STATS_INC(xb_create
);
277 trace_xfs_buf_init(bp
, _RET_IP_
);
281 * Allocate a page array capable of holding a specified number
282 * of pages, and point the page buf at it.
288 xfs_buf_flags_t flags
)
290 /* Make sure that we have a page list */
291 if (bp
->b_pages
== NULL
) {
292 bp
->b_offset
= xfs_buf_poff(bp
->b_file_offset
);
293 bp
->b_page_count
= page_count
;
294 if (page_count
<= XB_PAGES
) {
295 bp
->b_pages
= bp
->b_page_array
;
297 bp
->b_pages
= kmem_alloc(sizeof(struct page
*) *
298 page_count
, xb_to_km(flags
));
299 if (bp
->b_pages
== NULL
)
302 memset(bp
->b_pages
, 0, sizeof(struct page
*) * page_count
);
308 * Frees b_pages if it was allocated.
314 if (bp
->b_pages
!= bp
->b_page_array
) {
315 kmem_free(bp
->b_pages
);
321 * Releases the specified buffer.
323 * The modification state of any associated pages is left unchanged.
324 * The buffer most not be on any hash - use xfs_buf_rele instead for
325 * hashed and refcounted buffers
331 trace_xfs_buf_free(bp
, _RET_IP_
);
333 ASSERT(list_empty(&bp
->b_lru
));
335 if (bp
->b_flags
& (_XBF_PAGE_CACHE
|_XBF_PAGES
)) {
338 if (xfs_buf_is_vmapped(bp
))
339 vm_unmap_ram(bp
->b_addr
- bp
->b_offset
,
342 for (i
= 0; i
< bp
->b_page_count
; i
++) {
343 struct page
*page
= bp
->b_pages
[i
];
345 if (bp
->b_flags
& _XBF_PAGE_CACHE
)
346 ASSERT(!PagePrivate(page
));
347 page_cache_release(page
);
350 _xfs_buf_free_pages(bp
);
351 xfs_buf_deallocate(bp
);
355 * Finds all pages for buffer in question and builds it's page list.
358 _xfs_buf_lookup_pages(
362 struct address_space
*mapping
= bp
->b_target
->bt_mapping
;
363 size_t blocksize
= bp
->b_target
->bt_bsize
;
364 size_t size
= bp
->b_count_desired
;
365 size_t nbytes
, offset
;
366 gfp_t gfp_mask
= xb_to_gfp(flags
);
367 unsigned short page_count
, i
;
372 end
= bp
->b_file_offset
+ bp
->b_buffer_length
;
373 page_count
= xfs_buf_btoc(end
) - xfs_buf_btoct(bp
->b_file_offset
);
375 error
= _xfs_buf_get_pages(bp
, page_count
, flags
);
378 bp
->b_flags
|= _XBF_PAGE_CACHE
;
380 offset
= bp
->b_offset
;
381 first
= bp
->b_file_offset
>> PAGE_CACHE_SHIFT
;
383 for (i
= 0; i
< bp
->b_page_count
; i
++) {
388 page
= find_or_create_page(mapping
, first
+ i
, gfp_mask
);
389 if (unlikely(page
== NULL
)) {
390 if (flags
& XBF_READ_AHEAD
) {
391 bp
->b_page_count
= i
;
392 for (i
= 0; i
< bp
->b_page_count
; i
++)
393 unlock_page(bp
->b_pages
[i
]);
398 * This could deadlock.
400 * But until all the XFS lowlevel code is revamped to
401 * handle buffer allocation failures we can't do much.
403 if (!(++retries
% 100))
405 "possible memory allocation deadlock in %s (mode:0x%x)",
408 XFS_STATS_INC(xb_page_retries
);
409 congestion_wait(BLK_RW_ASYNC
, HZ
/50);
413 XFS_STATS_INC(xb_page_found
);
415 nbytes
= min_t(size_t, size
, PAGE_CACHE_SIZE
- offset
);
418 ASSERT(!PagePrivate(page
));
419 if (!PageUptodate(page
)) {
421 if (blocksize
>= PAGE_CACHE_SIZE
) {
422 if (flags
& XBF_READ
)
423 bp
->b_flags
|= _XBF_PAGE_LOCKED
;
424 } else if (!PagePrivate(page
)) {
425 if (test_page_region(page
, offset
, nbytes
))
430 bp
->b_pages
[i
] = page
;
434 if (!(bp
->b_flags
& _XBF_PAGE_LOCKED
)) {
435 for (i
= 0; i
< bp
->b_page_count
; i
++)
436 unlock_page(bp
->b_pages
[i
]);
439 if (page_count
== bp
->b_page_count
)
440 bp
->b_flags
|= XBF_DONE
;
446 * Map buffer into kernel address-space if nessecary.
453 /* A single page buffer is always mappable */
454 if (bp
->b_page_count
== 1) {
455 bp
->b_addr
= page_address(bp
->b_pages
[0]) + bp
->b_offset
;
456 bp
->b_flags
|= XBF_MAPPED
;
457 } else if (flags
& XBF_MAPPED
) {
458 bp
->b_addr
= vm_map_ram(bp
->b_pages
, bp
->b_page_count
,
460 if (unlikely(bp
->b_addr
== NULL
))
462 bp
->b_addr
+= bp
->b_offset
;
463 bp
->b_flags
|= XBF_MAPPED
;
470 * Finding and Reading Buffers
474 * Look up, and creates if absent, a lockable buffer for
475 * a given range of an inode. The buffer is returned
476 * locked. If other overlapping buffers exist, they are
477 * released before the new buffer is created and locked,
478 * which may imply that this call will block until those buffers
479 * are unlocked. No I/O is implied by this call.
483 xfs_buftarg_t
*btp
, /* block device target */
484 xfs_off_t ioff
, /* starting offset of range */
485 size_t isize
, /* length of range */
486 xfs_buf_flags_t flags
,
489 xfs_off_t range_base
;
491 struct xfs_perag
*pag
;
492 struct rb_node
**rbp
;
493 struct rb_node
*parent
;
496 range_base
= (ioff
<< BBSHIFT
);
497 range_length
= (isize
<< BBSHIFT
);
499 /* Check for IOs smaller than the sector size / not sector aligned */
500 ASSERT(!(range_length
< (1 << btp
->bt_sshift
)));
501 ASSERT(!(range_base
& (xfs_off_t
)btp
->bt_smask
));
504 pag
= xfs_perag_get(btp
->bt_mount
,
505 xfs_daddr_to_agno(btp
->bt_mount
, ioff
));
508 spin_lock(&pag
->pag_buf_lock
);
509 rbp
= &pag
->pag_buf_tree
.rb_node
;
514 bp
= rb_entry(parent
, struct xfs_buf
, b_rbnode
);
516 if (range_base
< bp
->b_file_offset
)
517 rbp
= &(*rbp
)->rb_left
;
518 else if (range_base
> bp
->b_file_offset
)
519 rbp
= &(*rbp
)->rb_right
;
522 * found a block offset match. If the range doesn't
523 * match, the only way this is allowed is if the buffer
524 * in the cache is stale and the transaction that made
525 * it stale has not yet committed. i.e. we are
526 * reallocating a busy extent. Skip this buffer and
527 * continue searching to the right for an exact match.
529 if (bp
->b_buffer_length
!= range_length
) {
530 ASSERT(bp
->b_flags
& XBF_STALE
);
531 rbp
= &(*rbp
)->rb_right
;
534 atomic_inc(&bp
->b_hold
);
541 _xfs_buf_initialize(new_bp
, btp
, range_base
,
542 range_length
, flags
);
543 rb_link_node(&new_bp
->b_rbnode
, parent
, rbp
);
544 rb_insert_color(&new_bp
->b_rbnode
, &pag
->pag_buf_tree
);
545 /* the buffer keeps the perag reference until it is freed */
547 spin_unlock(&pag
->pag_buf_lock
);
549 XFS_STATS_INC(xb_miss_locked
);
550 spin_unlock(&pag
->pag_buf_lock
);
556 spin_unlock(&pag
->pag_buf_lock
);
559 if (xfs_buf_cond_lock(bp
)) {
560 /* failed, so wait for the lock if requested. */
561 if (!(flags
& XBF_TRYLOCK
)) {
563 XFS_STATS_INC(xb_get_locked_waited
);
566 XFS_STATS_INC(xb_busy_locked
);
571 if (bp
->b_flags
& XBF_STALE
) {
572 ASSERT((bp
->b_flags
& _XBF_DELWRI_Q
) == 0);
573 bp
->b_flags
&= XBF_MAPPED
;
576 trace_xfs_buf_find(bp
, flags
, _RET_IP_
);
577 XFS_STATS_INC(xb_get_locked
);
582 * Assembles a buffer covering the specified range.
583 * Storage in memory for all portions of the buffer will be allocated,
584 * although backing storage may not be.
588 xfs_buftarg_t
*target
,/* target for buffer */
589 xfs_off_t ioff
, /* starting offset of range */
590 size_t isize
, /* length of range */
591 xfs_buf_flags_t flags
)
593 xfs_buf_t
*bp
, *new_bp
;
596 new_bp
= xfs_buf_allocate(flags
);
597 if (unlikely(!new_bp
))
600 bp
= _xfs_buf_find(target
, ioff
, isize
, flags
, new_bp
);
602 error
= _xfs_buf_lookup_pages(bp
, flags
);
606 xfs_buf_deallocate(new_bp
);
607 if (unlikely(bp
== NULL
))
611 for (i
= 0; i
< bp
->b_page_count
; i
++)
612 mark_page_accessed(bp
->b_pages
[i
]);
614 if (!(bp
->b_flags
& XBF_MAPPED
)) {
615 error
= _xfs_buf_map_pages(bp
, flags
);
616 if (unlikely(error
)) {
617 xfs_warn(target
->bt_mount
,
618 "%s: failed to map pages\n", __func__
);
623 XFS_STATS_INC(xb_get
);
626 * Always fill in the block number now, the mapped cases can do
627 * their own overlay of this later.
630 bp
->b_count_desired
= bp
->b_buffer_length
;
632 trace_xfs_buf_get(bp
, flags
, _RET_IP_
);
636 if (flags
& (XBF_LOCK
| XBF_TRYLOCK
))
645 xfs_buf_flags_t flags
)
649 ASSERT(!(flags
& (XBF_DELWRI
|XBF_WRITE
)));
650 ASSERT(bp
->b_bn
!= XFS_BUF_DADDR_NULL
);
652 bp
->b_flags
&= ~(XBF_WRITE
| XBF_ASYNC
| XBF_DELWRI
| \
653 XBF_READ_AHEAD
| _XBF_RUN_QUEUES
);
654 bp
->b_flags
|= flags
& (XBF_READ
| XBF_ASYNC
| \
655 XBF_READ_AHEAD
| _XBF_RUN_QUEUES
);
657 status
= xfs_buf_iorequest(bp
);
658 if (status
|| XFS_BUF_ISERROR(bp
) || (flags
& XBF_ASYNC
))
660 return xfs_buf_iowait(bp
);
665 xfs_buftarg_t
*target
,
668 xfs_buf_flags_t flags
)
674 bp
= xfs_buf_get(target
, ioff
, isize
, flags
);
676 trace_xfs_buf_read(bp
, flags
, _RET_IP_
);
678 if (!XFS_BUF_ISDONE(bp
)) {
679 XFS_STATS_INC(xb_get_read
);
680 _xfs_buf_read(bp
, flags
);
681 } else if (flags
& XBF_ASYNC
) {
683 * Read ahead call which is already satisfied,
688 /* We do not want read in the flags */
689 bp
->b_flags
&= ~XBF_READ
;
696 if (flags
& (XBF_LOCK
| XBF_TRYLOCK
))
703 * If we are not low on memory then do the readahead in a deadlock
708 xfs_buftarg_t
*target
,
712 struct backing_dev_info
*bdi
;
714 bdi
= target
->bt_mapping
->backing_dev_info
;
715 if (bdi_read_congested(bdi
))
718 xfs_buf_read(target
, ioff
, isize
,
719 XBF_TRYLOCK
|XBF_ASYNC
|XBF_READ_AHEAD
|XBF_DONT_BLOCK
);
723 * Read an uncached buffer from disk. Allocates and returns a locked
724 * buffer containing the disk contents or nothing.
727 xfs_buf_read_uncached(
728 struct xfs_mount
*mp
,
729 struct xfs_buftarg
*target
,
737 bp
= xfs_buf_get_uncached(target
, length
, flags
);
741 /* set up the buffer for a read IO */
743 XFS_BUF_SET_ADDR(bp
, daddr
);
748 error
= xfs_buf_iowait(bp
);
749 if (error
|| bp
->b_error
) {
759 xfs_buftarg_t
*target
)
763 bp
= xfs_buf_allocate(0);
765 _xfs_buf_initialize(bp
, target
, 0, len
, 0);
769 static inline struct page
*
773 if ((!is_vmalloc_addr(addr
))) {
774 return virt_to_page(addr
);
776 return vmalloc_to_page(addr
);
781 xfs_buf_associate_memory(
788 unsigned long pageaddr
;
789 unsigned long offset
;
793 pageaddr
= (unsigned long)mem
& PAGE_CACHE_MASK
;
794 offset
= (unsigned long)mem
- pageaddr
;
795 buflen
= PAGE_CACHE_ALIGN(len
+ offset
);
796 page_count
= buflen
>> PAGE_CACHE_SHIFT
;
798 /* Free any previous set of page pointers */
800 _xfs_buf_free_pages(bp
);
805 rval
= _xfs_buf_get_pages(bp
, page_count
, XBF_DONT_BLOCK
);
809 bp
->b_offset
= offset
;
811 for (i
= 0; i
< bp
->b_page_count
; i
++) {
812 bp
->b_pages
[i
] = mem_to_page((void *)pageaddr
);
813 pageaddr
+= PAGE_CACHE_SIZE
;
816 bp
->b_count_desired
= len
;
817 bp
->b_buffer_length
= buflen
;
818 bp
->b_flags
|= XBF_MAPPED
;
819 bp
->b_flags
&= ~_XBF_PAGE_LOCKED
;
825 xfs_buf_get_uncached(
826 struct xfs_buftarg
*target
,
830 unsigned long page_count
= PAGE_ALIGN(len
) >> PAGE_SHIFT
;
834 bp
= xfs_buf_allocate(0);
835 if (unlikely(bp
== NULL
))
837 _xfs_buf_initialize(bp
, target
, 0, len
, 0);
839 error
= _xfs_buf_get_pages(bp
, page_count
, 0);
843 for (i
= 0; i
< page_count
; i
++) {
844 bp
->b_pages
[i
] = alloc_page(xb_to_gfp(flags
));
848 bp
->b_flags
|= _XBF_PAGES
;
850 error
= _xfs_buf_map_pages(bp
, XBF_MAPPED
);
851 if (unlikely(error
)) {
852 xfs_warn(target
->bt_mount
,
853 "%s: failed to map pages\n", __func__
);
859 trace_xfs_buf_get_uncached(bp
, _RET_IP_
);
864 __free_page(bp
->b_pages
[i
]);
865 _xfs_buf_free_pages(bp
);
867 xfs_buf_deallocate(bp
);
873 * Increment reference count on buffer, to hold the buffer concurrently
874 * with another thread which may release (free) the buffer asynchronously.
875 * Must hold the buffer already to call this function.
881 trace_xfs_buf_hold(bp
, _RET_IP_
);
882 atomic_inc(&bp
->b_hold
);
886 * Releases a hold on the specified buffer. If the
887 * the hold count is 1, calls xfs_buf_free.
893 struct xfs_perag
*pag
= bp
->b_pag
;
895 trace_xfs_buf_rele(bp
, _RET_IP_
);
898 ASSERT(list_empty(&bp
->b_lru
));
899 ASSERT(RB_EMPTY_NODE(&bp
->b_rbnode
));
900 if (atomic_dec_and_test(&bp
->b_hold
))
905 ASSERT(!RB_EMPTY_NODE(&bp
->b_rbnode
));
907 ASSERT(atomic_read(&bp
->b_hold
) > 0);
908 if (atomic_dec_and_lock(&bp
->b_hold
, &pag
->pag_buf_lock
)) {
909 if (!(bp
->b_flags
& XBF_STALE
) &&
910 atomic_read(&bp
->b_lru_ref
)) {
912 spin_unlock(&pag
->pag_buf_lock
);
915 ASSERT(!(bp
->b_flags
& (XBF_DELWRI
|_XBF_DELWRI_Q
)));
916 rb_erase(&bp
->b_rbnode
, &pag
->pag_buf_tree
);
917 spin_unlock(&pag
->pag_buf_lock
);
926 * Mutual exclusion on buffers. Locking model:
928 * Buffers associated with inodes for which buffer locking
929 * is not enabled are not protected by semaphores, and are
930 * assumed to be exclusively owned by the caller. There is a
931 * spinlock in the buffer, used by the caller when concurrent
932 * access is possible.
936 * Locks a buffer object, if it is not already locked. Note that this in
937 * no way locks the underlying pages, so it is only useful for
938 * synchronizing concurrent use of buffer objects, not for synchronizing
939 * independent access to the underlying pages.
941 * If we come across a stale, pinned, locked buffer, we know that we are
942 * being asked to lock a buffer that has been reallocated. Because it is
943 * pinned, we know that the log has not been pushed to disk and hence it
944 * will still be locked. Rather than continuing to have trylock attempts
945 * fail until someone else pushes the log, push it ourselves before
946 * returning. This means that the xfsaild will not get stuck trying
947 * to push on stale inode buffers.
955 locked
= down_trylock(&bp
->b_sema
) == 0;
958 else if (atomic_read(&bp
->b_pin_count
) && (bp
->b_flags
& XBF_STALE
))
959 xfs_log_force(bp
->b_target
->bt_mount
, 0);
961 trace_xfs_buf_cond_lock(bp
, _RET_IP_
);
962 return locked
? 0 : -EBUSY
;
969 return bp
->b_sema
.count
;
973 * Locks a buffer object.
974 * Note that this in no way locks the underlying pages, so it is only
975 * useful for synchronizing concurrent use of buffer objects, not for
976 * synchronizing independent access to the underlying pages.
978 * If we come across a stale, pinned, locked buffer, we know that we
979 * are being asked to lock a buffer that has been reallocated. Because
980 * it is pinned, we know that the log has not been pushed to disk and
981 * hence it will still be locked. Rather than sleeping until someone
982 * else pushes the log, push it ourselves before trying to get the lock.
988 trace_xfs_buf_lock(bp
, _RET_IP_
);
990 if (atomic_read(&bp
->b_pin_count
) && (bp
->b_flags
& XBF_STALE
))
991 xfs_log_force(bp
->b_target
->bt_mount
, 0);
992 if (atomic_read(&bp
->b_io_remaining
))
993 blk_flush_plug(current
);
997 trace_xfs_buf_lock_done(bp
, _RET_IP_
);
1001 * Releases the lock on the buffer object.
1002 * If the buffer is marked delwri but is not queued, do so before we
1003 * unlock the buffer as we need to set flags correctly. We also need to
1004 * take a reference for the delwri queue because the unlocker is going to
1005 * drop their's and they don't know we just queued it.
1011 if ((bp
->b_flags
& (XBF_DELWRI
|_XBF_DELWRI_Q
)) == XBF_DELWRI
) {
1012 atomic_inc(&bp
->b_hold
);
1013 bp
->b_flags
|= XBF_ASYNC
;
1014 xfs_buf_delwri_queue(bp
, 0);
1020 trace_xfs_buf_unlock(bp
, _RET_IP_
);
1027 DECLARE_WAITQUEUE (wait
, current
);
1029 if (atomic_read(&bp
->b_pin_count
) == 0)
1032 add_wait_queue(&bp
->b_waiters
, &wait
);
1034 set_current_state(TASK_UNINTERRUPTIBLE
);
1035 if (atomic_read(&bp
->b_pin_count
) == 0)
1039 remove_wait_queue(&bp
->b_waiters
, &wait
);
1040 set_current_state(TASK_RUNNING
);
1044 * Buffer Utility Routines
1048 xfs_buf_iodone_work(
1049 struct work_struct
*work
)
1052 container_of(work
, xfs_buf_t
, b_iodone_work
);
1055 (*(bp
->b_iodone
))(bp
);
1056 else if (bp
->b_flags
& XBF_ASYNC
)
1065 trace_xfs_buf_iodone(bp
, _RET_IP_
);
1067 bp
->b_flags
&= ~(XBF_READ
| XBF_WRITE
| XBF_READ_AHEAD
);
1068 if (bp
->b_error
== 0)
1069 bp
->b_flags
|= XBF_DONE
;
1071 if ((bp
->b_iodone
) || (bp
->b_flags
& XBF_ASYNC
)) {
1073 INIT_WORK(&bp
->b_iodone_work
, xfs_buf_iodone_work
);
1074 queue_work(xfslogd_workqueue
, &bp
->b_iodone_work
);
1076 xfs_buf_iodone_work(&bp
->b_iodone_work
);
1079 complete(&bp
->b_iowait
);
1088 ASSERT(error
>= 0 && error
<= 0xffff);
1089 bp
->b_error
= (unsigned short)error
;
1090 trace_xfs_buf_ioerror(bp
, error
, _RET_IP_
);
1095 struct xfs_mount
*mp
,
1100 bp
->b_flags
|= XBF_WRITE
;
1101 bp
->b_flags
&= ~(XBF_ASYNC
| XBF_READ
);
1103 xfs_buf_delwri_dequeue(bp
);
1106 error
= xfs_buf_iowait(bp
);
1108 xfs_force_shutdown(mp
, SHUTDOWN_META_IO_ERROR
);
1118 trace_xfs_buf_bdwrite(bp
, _RET_IP_
);
1120 bp
->b_flags
&= ~XBF_READ
;
1121 bp
->b_flags
|= (XBF_DELWRI
| XBF_ASYNC
);
1123 xfs_buf_delwri_queue(bp
, 1);
1127 * Called when we want to stop a buffer from getting written or read.
1128 * We attach the EIO error, muck with its flags, and call xfs_buf_ioend
1129 * so that the proper iodone callbacks get called.
1135 #ifdef XFSERRORDEBUG
1136 ASSERT(XFS_BUF_ISREAD(bp
) || bp
->b_iodone
);
1140 * No need to wait until the buffer is unpinned, we aren't flushing it.
1142 XFS_BUF_ERROR(bp
, EIO
);
1145 * We're calling xfs_buf_ioend, so delete XBF_DONE flag.
1148 XFS_BUF_UNDELAYWRITE(bp
);
1152 xfs_buf_ioend(bp
, 0);
1158 * Same as xfs_bioerror, except that we are releasing the buffer
1159 * here ourselves, and avoiding the xfs_buf_ioend call.
1160 * This is meant for userdata errors; metadata bufs come with
1161 * iodone functions attached, so that we can track down errors.
1167 int64_t fl
= XFS_BUF_BFLAGS(bp
);
1169 * No need to wait until the buffer is unpinned.
1170 * We aren't flushing it.
1172 * chunkhold expects B_DONE to be set, whether
1173 * we actually finish the I/O or not. We don't want to
1174 * change that interface.
1177 XFS_BUF_UNDELAYWRITE(bp
);
1180 XFS_BUF_CLR_IODONE_FUNC(bp
);
1181 if (!(fl
& XBF_ASYNC
)) {
1183 * Mark b_error and B_ERROR _both_.
1184 * Lot's of chunkcache code assumes that.
1185 * There's no reason to mark error for
1188 XFS_BUF_ERROR(bp
, EIO
);
1189 XFS_BUF_FINISH_IOWAIT(bp
);
1199 * All xfs metadata buffers except log state machine buffers
1200 * get this attached as their b_bdstrat callback function.
1201 * This is so that we can catch a buffer
1202 * after prematurely unpinning it to forcibly shutdown the filesystem.
1208 if (XFS_FORCED_SHUTDOWN(bp
->b_target
->bt_mount
)) {
1209 trace_xfs_bdstrat_shut(bp
, _RET_IP_
);
1211 * Metadata write that didn't get logged but
1212 * written delayed anyway. These aren't associated
1213 * with a transaction, and can be ignored.
1215 if (!bp
->b_iodone
&& !XFS_BUF_ISREAD(bp
))
1216 return xfs_bioerror_relse(bp
);
1218 return xfs_bioerror(bp
);
1221 xfs_buf_iorequest(bp
);
1226 * Wrapper around bdstrat so that we can stop data from going to disk in case
1227 * we are shutting down the filesystem. Typically user data goes thru this
1228 * path; one of the exceptions is the superblock.
1232 struct xfs_mount
*mp
,
1235 if (XFS_FORCED_SHUTDOWN(mp
)) {
1236 trace_xfs_bdstrat_shut(bp
, _RET_IP_
);
1237 xfs_bioerror_relse(bp
);
1241 xfs_buf_iorequest(bp
);
1249 if (atomic_dec_and_test(&bp
->b_io_remaining
) == 1) {
1250 bp
->b_flags
&= ~_XBF_PAGE_LOCKED
;
1251 xfs_buf_ioend(bp
, schedule
);
1260 xfs_buf_t
*bp
= (xfs_buf_t
*)bio
->bi_private
;
1261 unsigned int blocksize
= bp
->b_target
->bt_bsize
;
1262 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
1264 xfs_buf_ioerror(bp
, -error
);
1266 if (!error
&& xfs_buf_is_vmapped(bp
) && (bp
->b_flags
& XBF_READ
))
1267 invalidate_kernel_vmap_range(bp
->b_addr
, xfs_buf_vmap_len(bp
));
1270 struct page
*page
= bvec
->bv_page
;
1272 ASSERT(!PagePrivate(page
));
1273 if (unlikely(bp
->b_error
)) {
1274 if (bp
->b_flags
& XBF_READ
)
1275 ClearPageUptodate(page
);
1276 } else if (blocksize
>= PAGE_CACHE_SIZE
) {
1277 SetPageUptodate(page
);
1278 } else if (!PagePrivate(page
) &&
1279 (bp
->b_flags
& _XBF_PAGE_CACHE
)) {
1280 set_page_region(page
, bvec
->bv_offset
, bvec
->bv_len
);
1283 if (--bvec
>= bio
->bi_io_vec
)
1284 prefetchw(&bvec
->bv_page
->flags
);
1286 if (bp
->b_flags
& _XBF_PAGE_LOCKED
)
1288 } while (bvec
>= bio
->bi_io_vec
);
1290 _xfs_buf_ioend(bp
, 1);
1298 int rw
, map_i
, total_nr_pages
, nr_pages
;
1300 int offset
= bp
->b_offset
;
1301 int size
= bp
->b_count_desired
;
1302 sector_t sector
= bp
->b_bn
;
1303 unsigned int blocksize
= bp
->b_target
->bt_bsize
;
1305 total_nr_pages
= bp
->b_page_count
;
1308 if (bp
->b_flags
& XBF_ORDERED
) {
1309 ASSERT(!(bp
->b_flags
& XBF_READ
));
1310 rw
= WRITE_FLUSH_FUA
;
1311 } else if (bp
->b_flags
& XBF_LOG_BUFFER
) {
1312 ASSERT(!(bp
->b_flags
& XBF_READ_AHEAD
));
1313 bp
->b_flags
&= ~_XBF_RUN_QUEUES
;
1314 rw
= (bp
->b_flags
& XBF_WRITE
) ? WRITE_SYNC
: READ_SYNC
;
1315 } else if (bp
->b_flags
& _XBF_RUN_QUEUES
) {
1316 ASSERT(!(bp
->b_flags
& XBF_READ_AHEAD
));
1317 bp
->b_flags
&= ~_XBF_RUN_QUEUES
;
1318 rw
= (bp
->b_flags
& XBF_WRITE
) ? WRITE_META
: READ_META
;
1320 rw
= (bp
->b_flags
& XBF_WRITE
) ? WRITE
:
1321 (bp
->b_flags
& XBF_READ_AHEAD
) ? READA
: READ
;
1324 /* Special code path for reading a sub page size buffer in --
1325 * we populate up the whole page, and hence the other metadata
1326 * in the same page. This optimization is only valid when the
1327 * filesystem block size is not smaller than the page size.
1329 if ((bp
->b_buffer_length
< PAGE_CACHE_SIZE
) &&
1330 ((bp
->b_flags
& (XBF_READ
|_XBF_PAGE_LOCKED
)) ==
1331 (XBF_READ
|_XBF_PAGE_LOCKED
)) &&
1332 (blocksize
>= PAGE_CACHE_SIZE
)) {
1333 bio
= bio_alloc(GFP_NOIO
, 1);
1335 bio
->bi_bdev
= bp
->b_target
->bt_bdev
;
1336 bio
->bi_sector
= sector
- (offset
>> BBSHIFT
);
1337 bio
->bi_end_io
= xfs_buf_bio_end_io
;
1338 bio
->bi_private
= bp
;
1340 bio_add_page(bio
, bp
->b_pages
[0], PAGE_CACHE_SIZE
, 0);
1343 atomic_inc(&bp
->b_io_remaining
);
1349 atomic_inc(&bp
->b_io_remaining
);
1350 nr_pages
= BIO_MAX_SECTORS
>> (PAGE_SHIFT
- BBSHIFT
);
1351 if (nr_pages
> total_nr_pages
)
1352 nr_pages
= total_nr_pages
;
1354 bio
= bio_alloc(GFP_NOIO
, nr_pages
);
1355 bio
->bi_bdev
= bp
->b_target
->bt_bdev
;
1356 bio
->bi_sector
= sector
;
1357 bio
->bi_end_io
= xfs_buf_bio_end_io
;
1358 bio
->bi_private
= bp
;
1360 for (; size
&& nr_pages
; nr_pages
--, map_i
++) {
1361 int rbytes
, nbytes
= PAGE_CACHE_SIZE
- offset
;
1366 rbytes
= bio_add_page(bio
, bp
->b_pages
[map_i
], nbytes
, offset
);
1367 if (rbytes
< nbytes
)
1371 sector
+= nbytes
>> BBSHIFT
;
1377 if (likely(bio
->bi_size
)) {
1378 if (xfs_buf_is_vmapped(bp
)) {
1379 flush_kernel_vmap_range(bp
->b_addr
,
1380 xfs_buf_vmap_len(bp
));
1382 submit_bio(rw
, bio
);
1387 * if we get here, no pages were added to the bio. However,
1388 * we can't just error out here - if the pages are locked then
1389 * we have to unlock them otherwise we can hang on a later
1390 * access to the page.
1392 xfs_buf_ioerror(bp
, EIO
);
1393 if (bp
->b_flags
& _XBF_PAGE_LOCKED
) {
1395 for (i
= 0; i
< bp
->b_page_count
; i
++)
1396 unlock_page(bp
->b_pages
[i
]);
1406 trace_xfs_buf_iorequest(bp
, _RET_IP_
);
1408 if (bp
->b_flags
& XBF_DELWRI
) {
1409 xfs_buf_delwri_queue(bp
, 1);
1413 if (bp
->b_flags
& XBF_WRITE
) {
1414 xfs_buf_wait_unpin(bp
);
1419 /* Set the count to 1 initially, this will stop an I/O
1420 * completion callout which happens before we have started
1421 * all the I/O from calling xfs_buf_ioend too early.
1423 atomic_set(&bp
->b_io_remaining
, 1);
1424 _xfs_buf_ioapply(bp
);
1425 _xfs_buf_ioend(bp
, 0);
1432 * Waits for I/O to complete on the buffer supplied.
1433 * It returns immediately if no I/O is pending.
1434 * It returns the I/O error code, if any, or 0 if there was no error.
1440 trace_xfs_buf_iowait(bp
, _RET_IP_
);
1442 if (atomic_read(&bp
->b_io_remaining
))
1443 blk_flush_plug(current
);
1444 wait_for_completion(&bp
->b_iowait
);
1446 trace_xfs_buf_iowait_done(bp
, _RET_IP_
);
1457 if (bp
->b_flags
& XBF_MAPPED
)
1458 return XFS_BUF_PTR(bp
) + offset
;
1460 offset
+= bp
->b_offset
;
1461 page
= bp
->b_pages
[offset
>> PAGE_CACHE_SHIFT
];
1462 return (xfs_caddr_t
)page_address(page
) + (offset
& (PAGE_CACHE_SIZE
-1));
1466 * Move data into or out of a buffer.
1470 xfs_buf_t
*bp
, /* buffer to process */
1471 size_t boff
, /* starting buffer offset */
1472 size_t bsize
, /* length to copy */
1473 void *data
, /* data address */
1474 xfs_buf_rw_t mode
) /* read/write/zero flag */
1476 size_t bend
, cpoff
, csize
;
1479 bend
= boff
+ bsize
;
1480 while (boff
< bend
) {
1481 page
= bp
->b_pages
[xfs_buf_btoct(boff
+ bp
->b_offset
)];
1482 cpoff
= xfs_buf_poff(boff
+ bp
->b_offset
);
1483 csize
= min_t(size_t,
1484 PAGE_CACHE_SIZE
-cpoff
, bp
->b_count_desired
-boff
);
1486 ASSERT(((csize
+ cpoff
) <= PAGE_CACHE_SIZE
));
1490 memset(page_address(page
) + cpoff
, 0, csize
);
1493 memcpy(data
, page_address(page
) + cpoff
, csize
);
1496 memcpy(page_address(page
) + cpoff
, data
, csize
);
1505 * Handling of buffer targets (buftargs).
1509 * Wait for any bufs with callbacks that have been submitted but have not yet
1510 * returned. These buffers will have an elevated hold count, so wait on those
1511 * while freeing all the buffers only held by the LRU.
1515 struct xfs_buftarg
*btp
)
1520 spin_lock(&btp
->bt_lru_lock
);
1521 while (!list_empty(&btp
->bt_lru
)) {
1522 bp
= list_first_entry(&btp
->bt_lru
, struct xfs_buf
, b_lru
);
1523 if (atomic_read(&bp
->b_hold
) > 1) {
1524 spin_unlock(&btp
->bt_lru_lock
);
1529 * clear the LRU reference count so the bufer doesn't get
1530 * ignored in xfs_buf_rele().
1532 atomic_set(&bp
->b_lru_ref
, 0);
1533 spin_unlock(&btp
->bt_lru_lock
);
1535 spin_lock(&btp
->bt_lru_lock
);
1537 spin_unlock(&btp
->bt_lru_lock
);
1542 struct shrinker
*shrink
,
1546 struct xfs_buftarg
*btp
= container_of(shrink
,
1547 struct xfs_buftarg
, bt_shrinker
);
1552 return btp
->bt_lru_nr
;
1554 spin_lock(&btp
->bt_lru_lock
);
1555 while (!list_empty(&btp
->bt_lru
)) {
1556 if (nr_to_scan
-- <= 0)
1559 bp
= list_first_entry(&btp
->bt_lru
, struct xfs_buf
, b_lru
);
1562 * Decrement the b_lru_ref count unless the value is already
1563 * zero. If the value is already zero, we need to reclaim the
1564 * buffer, otherwise it gets another trip through the LRU.
1566 if (!atomic_add_unless(&bp
->b_lru_ref
, -1, 0)) {
1567 list_move_tail(&bp
->b_lru
, &btp
->bt_lru
);
1572 * remove the buffer from the LRU now to avoid needing another
1573 * lock round trip inside xfs_buf_rele().
1575 list_move(&bp
->b_lru
, &dispose
);
1578 spin_unlock(&btp
->bt_lru_lock
);
1580 while (!list_empty(&dispose
)) {
1581 bp
= list_first_entry(&dispose
, struct xfs_buf
, b_lru
);
1582 list_del_init(&bp
->b_lru
);
1586 return btp
->bt_lru_nr
;
1591 struct xfs_mount
*mp
,
1592 struct xfs_buftarg
*btp
)
1594 unregister_shrinker(&btp
->bt_shrinker
);
1596 xfs_flush_buftarg(btp
, 1);
1597 if (mp
->m_flags
& XFS_MOUNT_BARRIER
)
1598 xfs_blkdev_issue_flush(btp
);
1599 iput(btp
->bt_mapping
->host
);
1601 kthread_stop(btp
->bt_task
);
1606 xfs_setsize_buftarg_flags(
1608 unsigned int blocksize
,
1609 unsigned int sectorsize
,
1612 btp
->bt_bsize
= blocksize
;
1613 btp
->bt_sshift
= ffs(sectorsize
) - 1;
1614 btp
->bt_smask
= sectorsize
- 1;
1616 if (set_blocksize(btp
->bt_bdev
, sectorsize
)) {
1617 xfs_warn(btp
->bt_mount
,
1618 "Cannot set_blocksize to %u on device %s\n",
1619 sectorsize
, XFS_BUFTARG_NAME(btp
));
1624 (PAGE_CACHE_SIZE
/ BITS_PER_LONG
) > sectorsize
) {
1626 "XFS: %u byte sectors in use on device %s. "
1627 "This is suboptimal; %u or greater is ideal.\n",
1628 sectorsize
, XFS_BUFTARG_NAME(btp
),
1629 (unsigned int)PAGE_CACHE_SIZE
/ BITS_PER_LONG
);
1636 * When allocating the initial buffer target we have not yet
1637 * read in the superblock, so don't know what sized sectors
1638 * are being used is at this early stage. Play safe.
1641 xfs_setsize_buftarg_early(
1643 struct block_device
*bdev
)
1645 return xfs_setsize_buftarg_flags(btp
,
1646 PAGE_CACHE_SIZE
, bdev_logical_block_size(bdev
), 0);
1650 xfs_setsize_buftarg(
1652 unsigned int blocksize
,
1653 unsigned int sectorsize
)
1655 return xfs_setsize_buftarg_flags(btp
, blocksize
, sectorsize
, 1);
1659 xfs_mapping_buftarg(
1661 struct block_device
*bdev
)
1663 struct backing_dev_info
*bdi
;
1664 struct inode
*inode
;
1665 struct address_space
*mapping
;
1666 static const struct address_space_operations mapping_aops
= {
1667 .migratepage
= fail_migrate_page
,
1670 inode
= new_inode(bdev
->bd_inode
->i_sb
);
1673 "XFS: Cannot allocate mapping inode for device %s\n",
1674 XFS_BUFTARG_NAME(btp
));
1677 inode
->i_ino
= get_next_ino();
1678 inode
->i_mode
= S_IFBLK
;
1679 inode
->i_bdev
= bdev
;
1680 inode
->i_rdev
= bdev
->bd_dev
;
1681 bdi
= blk_get_backing_dev_info(bdev
);
1683 bdi
= &default_backing_dev_info
;
1684 mapping
= &inode
->i_data
;
1685 mapping
->a_ops
= &mapping_aops
;
1686 mapping
->backing_dev_info
= bdi
;
1687 mapping_set_gfp_mask(mapping
, GFP_NOFS
);
1688 btp
->bt_mapping
= mapping
;
1693 xfs_alloc_delwrite_queue(
1697 INIT_LIST_HEAD(&btp
->bt_delwrite_queue
);
1698 spin_lock_init(&btp
->bt_delwrite_lock
);
1700 btp
->bt_task
= kthread_run(xfsbufd
, btp
, "xfsbufd/%s", fsname
);
1701 if (IS_ERR(btp
->bt_task
))
1702 return PTR_ERR(btp
->bt_task
);
1708 struct xfs_mount
*mp
,
1709 struct block_device
*bdev
,
1715 btp
= kmem_zalloc(sizeof(*btp
), KM_SLEEP
);
1718 btp
->bt_dev
= bdev
->bd_dev
;
1719 btp
->bt_bdev
= bdev
;
1720 INIT_LIST_HEAD(&btp
->bt_lru
);
1721 spin_lock_init(&btp
->bt_lru_lock
);
1722 if (xfs_setsize_buftarg_early(btp
, bdev
))
1724 if (xfs_mapping_buftarg(btp
, bdev
))
1726 if (xfs_alloc_delwrite_queue(btp
, fsname
))
1728 btp
->bt_shrinker
.shrink
= xfs_buftarg_shrink
;
1729 btp
->bt_shrinker
.seeks
= DEFAULT_SEEKS
;
1730 register_shrinker(&btp
->bt_shrinker
);
1740 * Delayed write buffer handling
1743 xfs_buf_delwri_queue(
1747 struct list_head
*dwq
= &bp
->b_target
->bt_delwrite_queue
;
1748 spinlock_t
*dwlk
= &bp
->b_target
->bt_delwrite_lock
;
1750 trace_xfs_buf_delwri_queue(bp
, _RET_IP_
);
1752 ASSERT((bp
->b_flags
&(XBF_DELWRI
|XBF_ASYNC
)) == (XBF_DELWRI
|XBF_ASYNC
));
1755 /* If already in the queue, dequeue and place at tail */
1756 if (!list_empty(&bp
->b_list
)) {
1757 ASSERT(bp
->b_flags
& _XBF_DELWRI_Q
);
1759 atomic_dec(&bp
->b_hold
);
1760 list_del(&bp
->b_list
);
1763 if (list_empty(dwq
)) {
1764 /* start xfsbufd as it is about to have something to do */
1765 wake_up_process(bp
->b_target
->bt_task
);
1768 bp
->b_flags
|= _XBF_DELWRI_Q
;
1769 list_add_tail(&bp
->b_list
, dwq
);
1770 bp
->b_queuetime
= jiffies
;
1778 xfs_buf_delwri_dequeue(
1781 spinlock_t
*dwlk
= &bp
->b_target
->bt_delwrite_lock
;
1785 if ((bp
->b_flags
& XBF_DELWRI
) && !list_empty(&bp
->b_list
)) {
1786 ASSERT(bp
->b_flags
& _XBF_DELWRI_Q
);
1787 list_del_init(&bp
->b_list
);
1790 bp
->b_flags
&= ~(XBF_DELWRI
|_XBF_DELWRI_Q
);
1796 trace_xfs_buf_delwri_dequeue(bp
, _RET_IP_
);
1800 * If a delwri buffer needs to be pushed before it has aged out, then promote
1801 * it to the head of the delwri queue so that it will be flushed on the next
1802 * xfsbufd run. We do this by resetting the queuetime of the buffer to be older
1803 * than the age currently needed to flush the buffer. Hence the next time the
1804 * xfsbufd sees it is guaranteed to be considered old enough to flush.
1807 xfs_buf_delwri_promote(
1810 struct xfs_buftarg
*btp
= bp
->b_target
;
1811 long age
= xfs_buf_age_centisecs
* msecs_to_jiffies(10) + 1;
1813 ASSERT(bp
->b_flags
& XBF_DELWRI
);
1814 ASSERT(bp
->b_flags
& _XBF_DELWRI_Q
);
1817 * Check the buffer age before locking the delayed write queue as we
1818 * don't need to promote buffers that are already past the flush age.
1820 if (bp
->b_queuetime
< jiffies
- age
)
1822 bp
->b_queuetime
= jiffies
- age
;
1823 spin_lock(&btp
->bt_delwrite_lock
);
1824 list_move(&bp
->b_list
, &btp
->bt_delwrite_queue
);
1825 spin_unlock(&btp
->bt_delwrite_lock
);
1829 xfs_buf_runall_queues(
1830 struct workqueue_struct
*queue
)
1832 flush_workqueue(queue
);
1836 * Move as many buffers as specified to the supplied list
1837 * idicating if we skipped any buffers to prevent deadlocks.
1840 xfs_buf_delwri_split(
1841 xfs_buftarg_t
*target
,
1842 struct list_head
*list
,
1846 struct list_head
*dwq
= &target
->bt_delwrite_queue
;
1847 spinlock_t
*dwlk
= &target
->bt_delwrite_lock
;
1851 force
= test_and_clear_bit(XBT_FORCE_FLUSH
, &target
->bt_flags
);
1852 INIT_LIST_HEAD(list
);
1854 list_for_each_entry_safe(bp
, n
, dwq
, b_list
) {
1855 ASSERT(bp
->b_flags
& XBF_DELWRI
);
1857 if (!XFS_BUF_ISPINNED(bp
) && !xfs_buf_cond_lock(bp
)) {
1859 time_before(jiffies
, bp
->b_queuetime
+ age
)) {
1864 bp
->b_flags
&= ~(XBF_DELWRI
|_XBF_DELWRI_Q
|
1866 bp
->b_flags
|= XBF_WRITE
;
1867 list_move_tail(&bp
->b_list
, list
);
1868 trace_xfs_buf_delwri_split(bp
, _RET_IP_
);
1879 * Compare function is more complex than it needs to be because
1880 * the return value is only 32 bits and we are doing comparisons
1886 struct list_head
*a
,
1887 struct list_head
*b
)
1889 struct xfs_buf
*ap
= container_of(a
, struct xfs_buf
, b_list
);
1890 struct xfs_buf
*bp
= container_of(b
, struct xfs_buf
, b_list
);
1893 diff
= ap
->b_bn
- bp
->b_bn
;
1902 xfs_buf_delwri_sort(
1903 xfs_buftarg_t
*target
,
1904 struct list_head
*list
)
1906 list_sort(NULL
, list
, xfs_buf_cmp
);
1913 xfs_buftarg_t
*target
= (xfs_buftarg_t
*)data
;
1915 current
->flags
|= PF_MEMALLOC
;
1920 long age
= xfs_buf_age_centisecs
* msecs_to_jiffies(10);
1921 long tout
= xfs_buf_timer_centisecs
* msecs_to_jiffies(10);
1923 struct list_head tmp
;
1925 if (unlikely(freezing(current
))) {
1926 set_bit(XBT_FORCE_SLEEP
, &target
->bt_flags
);
1929 clear_bit(XBT_FORCE_SLEEP
, &target
->bt_flags
);
1932 /* sleep for a long time if there is nothing to do. */
1933 if (list_empty(&target
->bt_delwrite_queue
))
1934 tout
= MAX_SCHEDULE_TIMEOUT
;
1935 schedule_timeout_interruptible(tout
);
1937 xfs_buf_delwri_split(target
, &tmp
, age
);
1938 list_sort(NULL
, &tmp
, xfs_buf_cmp
);
1939 while (!list_empty(&tmp
)) {
1941 bp
= list_first_entry(&tmp
, struct xfs_buf
, b_list
);
1942 list_del_init(&bp
->b_list
);
1947 blk_flush_plug(current
);
1949 } while (!kthread_should_stop());
1955 * Go through all incore buffers, and release buffers if they belong to
1956 * the given device. This is used in filesystem error handling to
1957 * preserve the consistency of its metadata.
1961 xfs_buftarg_t
*target
,
1966 LIST_HEAD(tmp_list
);
1967 LIST_HEAD(wait_list
);
1969 xfs_buf_runall_queues(xfsconvertd_workqueue
);
1970 xfs_buf_runall_queues(xfsdatad_workqueue
);
1971 xfs_buf_runall_queues(xfslogd_workqueue
);
1973 set_bit(XBT_FORCE_FLUSH
, &target
->bt_flags
);
1974 pincount
= xfs_buf_delwri_split(target
, &tmp_list
, 0);
1977 * Dropped the delayed write list lock, now walk the temporary list.
1978 * All I/O is issued async and then if we need to wait for completion
1979 * we do that after issuing all the IO.
1981 list_sort(NULL
, &tmp_list
, xfs_buf_cmp
);
1982 while (!list_empty(&tmp_list
)) {
1983 bp
= list_first_entry(&tmp_list
, struct xfs_buf
, b_list
);
1984 ASSERT(target
== bp
->b_target
);
1985 list_del_init(&bp
->b_list
);
1987 bp
->b_flags
&= ~XBF_ASYNC
;
1988 list_add(&bp
->b_list
, &wait_list
);
1994 /* Expedite and wait for IO to complete. */
1995 blk_flush_plug(current
);
1996 while (!list_empty(&wait_list
)) {
1997 bp
= list_first_entry(&wait_list
, struct xfs_buf
, b_list
);
1999 list_del_init(&bp
->b_list
);
2011 xfs_buf_zone
= kmem_zone_init_flags(sizeof(xfs_buf_t
), "xfs_buf",
2012 KM_ZONE_HWALIGN
, NULL
);
2016 xfslogd_workqueue
= alloc_workqueue("xfslogd",
2017 WQ_MEM_RECLAIM
| WQ_HIGHPRI
, 1);
2018 if (!xfslogd_workqueue
)
2019 goto out_free_buf_zone
;
2021 xfsdatad_workqueue
= alloc_workqueue("xfsdatad", WQ_MEM_RECLAIM
, 1);
2022 if (!xfsdatad_workqueue
)
2023 goto out_destroy_xfslogd_workqueue
;
2025 xfsconvertd_workqueue
= alloc_workqueue("xfsconvertd",
2027 if (!xfsconvertd_workqueue
)
2028 goto out_destroy_xfsdatad_workqueue
;
2032 out_destroy_xfsdatad_workqueue
:
2033 destroy_workqueue(xfsdatad_workqueue
);
2034 out_destroy_xfslogd_workqueue
:
2035 destroy_workqueue(xfslogd_workqueue
);
2037 kmem_zone_destroy(xfs_buf_zone
);
2043 xfs_buf_terminate(void)
2045 destroy_workqueue(xfsconvertd_workqueue
);
2046 destroy_workqueue(xfsdatad_workqueue
);
2047 destroy_workqueue(xfslogd_workqueue
);
2048 kmem_zone_destroy(xfs_buf_zone
);
2051 #ifdef CONFIG_KDB_MODULES
2053 xfs_get_buftarg_list(void)
2055 return &xfs_buftarg_list
;