qla2xxx: Host reset handling in ABTS path.
[linux/fpc-iii.git] / fs / xfs / xfs_buf.c
blobcd7b8ca9b06410c5d34e92161906532a6221ef66
1 /*
2 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
3 * All Rights Reserved.
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
18 #include "xfs.h"
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_log_format.h"
38 #include "xfs_trans_resv.h"
39 #include "xfs_sb.h"
40 #include "xfs_ag.h"
41 #include "xfs_mount.h"
42 #include "xfs_trace.h"
43 #include "xfs_log.h"
45 static kmem_zone_t *xfs_buf_zone;
47 static struct workqueue_struct *xfslogd_workqueue;
49 #ifdef XFS_BUF_LOCK_TRACKING
50 # define XB_SET_OWNER(bp) ((bp)->b_last_holder = current->pid)
51 # define XB_CLEAR_OWNER(bp) ((bp)->b_last_holder = -1)
52 # define XB_GET_OWNER(bp) ((bp)->b_last_holder)
53 #else
54 # define XB_SET_OWNER(bp) do { } while (0)
55 # define XB_CLEAR_OWNER(bp) do { } while (0)
56 # define XB_GET_OWNER(bp) do { } while (0)
57 #endif
59 #define xb_to_gfp(flags) \
60 ((((flags) & XBF_READ_AHEAD) ? __GFP_NORETRY : GFP_NOFS) | __GFP_NOWARN)
63 static inline int
64 xfs_buf_is_vmapped(
65 struct xfs_buf *bp)
68 * Return true if the buffer is vmapped.
70 * b_addr is null if the buffer is not mapped, but the code is clever
71 * enough to know it doesn't have to map a single page, so the check has
72 * to be both for b_addr and bp->b_page_count > 1.
74 return bp->b_addr && bp->b_page_count > 1;
77 static inline int
78 xfs_buf_vmap_len(
79 struct xfs_buf *bp)
81 return (bp->b_page_count * PAGE_SIZE) - bp->b_offset;
85 * When we mark a buffer stale, we remove the buffer from the LRU and clear the
86 * b_lru_ref count so that the buffer is freed immediately when the buffer
87 * reference count falls to zero. If the buffer is already on the LRU, we need
88 * to remove the reference that LRU holds on the buffer.
90 * This prevents build-up of stale buffers on the LRU.
92 void
93 xfs_buf_stale(
94 struct xfs_buf *bp)
96 ASSERT(xfs_buf_islocked(bp));
98 bp->b_flags |= XBF_STALE;
101 * Clear the delwri status so that a delwri queue walker will not
102 * flush this buffer to disk now that it is stale. The delwri queue has
103 * a reference to the buffer, so this is safe to do.
105 bp->b_flags &= ~_XBF_DELWRI_Q;
107 spin_lock(&bp->b_lock);
108 atomic_set(&bp->b_lru_ref, 0);
109 if (!(bp->b_state & XFS_BSTATE_DISPOSE) &&
110 (list_lru_del(&bp->b_target->bt_lru, &bp->b_lru)))
111 atomic_dec(&bp->b_hold);
113 ASSERT(atomic_read(&bp->b_hold) >= 1);
114 spin_unlock(&bp->b_lock);
117 static int
118 xfs_buf_get_maps(
119 struct xfs_buf *bp,
120 int map_count)
122 ASSERT(bp->b_maps == NULL);
123 bp->b_map_count = map_count;
125 if (map_count == 1) {
126 bp->b_maps = &bp->__b_map;
127 return 0;
130 bp->b_maps = kmem_zalloc(map_count * sizeof(struct xfs_buf_map),
131 KM_NOFS);
132 if (!bp->b_maps)
133 return -ENOMEM;
134 return 0;
138 * Frees b_pages if it was allocated.
140 static void
141 xfs_buf_free_maps(
142 struct xfs_buf *bp)
144 if (bp->b_maps != &bp->__b_map) {
145 kmem_free(bp->b_maps);
146 bp->b_maps = NULL;
150 struct xfs_buf *
151 _xfs_buf_alloc(
152 struct xfs_buftarg *target,
153 struct xfs_buf_map *map,
154 int nmaps,
155 xfs_buf_flags_t flags)
157 struct xfs_buf *bp;
158 int error;
159 int i;
161 bp = kmem_zone_zalloc(xfs_buf_zone, KM_NOFS);
162 if (unlikely(!bp))
163 return NULL;
166 * We don't want certain flags to appear in b_flags unless they are
167 * specifically set by later operations on the buffer.
169 flags &= ~(XBF_UNMAPPED | XBF_TRYLOCK | XBF_ASYNC | XBF_READ_AHEAD);
171 atomic_set(&bp->b_hold, 1);
172 atomic_set(&bp->b_lru_ref, 1);
173 init_completion(&bp->b_iowait);
174 INIT_LIST_HEAD(&bp->b_lru);
175 INIT_LIST_HEAD(&bp->b_list);
176 RB_CLEAR_NODE(&bp->b_rbnode);
177 sema_init(&bp->b_sema, 0); /* held, no waiters */
178 spin_lock_init(&bp->b_lock);
179 XB_SET_OWNER(bp);
180 bp->b_target = target;
181 bp->b_flags = flags;
184 * Set length and io_length to the same value initially.
185 * I/O routines should use io_length, which will be the same in
186 * most cases but may be reset (e.g. XFS recovery).
188 error = xfs_buf_get_maps(bp, nmaps);
189 if (error) {
190 kmem_zone_free(xfs_buf_zone, bp);
191 return NULL;
194 bp->b_bn = map[0].bm_bn;
195 bp->b_length = 0;
196 for (i = 0; i < nmaps; i++) {
197 bp->b_maps[i].bm_bn = map[i].bm_bn;
198 bp->b_maps[i].bm_len = map[i].bm_len;
199 bp->b_length += map[i].bm_len;
201 bp->b_io_length = bp->b_length;
203 atomic_set(&bp->b_pin_count, 0);
204 init_waitqueue_head(&bp->b_waiters);
206 XFS_STATS_INC(xb_create);
207 trace_xfs_buf_init(bp, _RET_IP_);
209 return bp;
213 * Allocate a page array capable of holding a specified number
214 * of pages, and point the page buf at it.
216 STATIC int
217 _xfs_buf_get_pages(
218 xfs_buf_t *bp,
219 int page_count)
221 /* Make sure that we have a page list */
222 if (bp->b_pages == NULL) {
223 bp->b_page_count = page_count;
224 if (page_count <= XB_PAGES) {
225 bp->b_pages = bp->b_page_array;
226 } else {
227 bp->b_pages = kmem_alloc(sizeof(struct page *) *
228 page_count, KM_NOFS);
229 if (bp->b_pages == NULL)
230 return -ENOMEM;
232 memset(bp->b_pages, 0, sizeof(struct page *) * page_count);
234 return 0;
238 * Frees b_pages if it was allocated.
240 STATIC void
241 _xfs_buf_free_pages(
242 xfs_buf_t *bp)
244 if (bp->b_pages != bp->b_page_array) {
245 kmem_free(bp->b_pages);
246 bp->b_pages = NULL;
251 * Releases the specified buffer.
253 * The modification state of any associated pages is left unchanged.
254 * The buffer must not be on any hash - use xfs_buf_rele instead for
255 * hashed and refcounted buffers
257 void
258 xfs_buf_free(
259 xfs_buf_t *bp)
261 trace_xfs_buf_free(bp, _RET_IP_);
263 ASSERT(list_empty(&bp->b_lru));
265 if (bp->b_flags & _XBF_PAGES) {
266 uint i;
268 if (xfs_buf_is_vmapped(bp))
269 vm_unmap_ram(bp->b_addr - bp->b_offset,
270 bp->b_page_count);
272 for (i = 0; i < bp->b_page_count; i++) {
273 struct page *page = bp->b_pages[i];
275 __free_page(page);
277 } else if (bp->b_flags & _XBF_KMEM)
278 kmem_free(bp->b_addr);
279 _xfs_buf_free_pages(bp);
280 xfs_buf_free_maps(bp);
281 kmem_zone_free(xfs_buf_zone, bp);
285 * Allocates all the pages for buffer in question and builds it's page list.
287 STATIC int
288 xfs_buf_allocate_memory(
289 xfs_buf_t *bp,
290 uint flags)
292 size_t size;
293 size_t nbytes, offset;
294 gfp_t gfp_mask = xb_to_gfp(flags);
295 unsigned short page_count, i;
296 xfs_off_t start, end;
297 int error;
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 size = BBTOB(bp->b_length);
305 if (size < PAGE_SIZE) {
306 bp->b_addr = kmem_alloc(size, KM_NOFS);
307 if (!bp->b_addr) {
308 /* low memory - use alloc_page loop instead */
309 goto use_alloc_page;
312 if (((unsigned long)(bp->b_addr + size - 1) & PAGE_MASK) !=
313 ((unsigned long)bp->b_addr & PAGE_MASK)) {
314 /* b_addr spans two pages - use alloc_page instead */
315 kmem_free(bp->b_addr);
316 bp->b_addr = NULL;
317 goto use_alloc_page;
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_KMEM;
324 return 0;
327 use_alloc_page:
328 start = BBTOB(bp->b_maps[0].bm_bn) >> PAGE_SHIFT;
329 end = (BBTOB(bp->b_maps[0].bm_bn + bp->b_length) + PAGE_SIZE - 1)
330 >> PAGE_SHIFT;
331 page_count = end - start;
332 error = _xfs_buf_get_pages(bp, page_count);
333 if (unlikely(error))
334 return error;
336 offset = bp->b_offset;
337 bp->b_flags |= _XBF_PAGES;
339 for (i = 0; i < bp->b_page_count; i++) {
340 struct page *page;
341 uint retries = 0;
342 retry:
343 page = alloc_page(gfp_mask);
344 if (unlikely(page == NULL)) {
345 if (flags & XBF_READ_AHEAD) {
346 bp->b_page_count = i;
347 error = -ENOMEM;
348 goto out_free_pages;
352 * This could deadlock.
354 * But until all the XFS lowlevel code is revamped to
355 * handle buffer allocation failures we can't do much.
357 if (!(++retries % 100))
358 xfs_err(NULL,
359 "possible memory allocation deadlock in %s (mode:0x%x)",
360 __func__, gfp_mask);
362 XFS_STATS_INC(xb_page_retries);
363 congestion_wait(BLK_RW_ASYNC, HZ/50);
364 goto retry;
367 XFS_STATS_INC(xb_page_found);
369 nbytes = min_t(size_t, size, PAGE_SIZE - offset);
370 size -= nbytes;
371 bp->b_pages[i] = page;
372 offset = 0;
374 return 0;
376 out_free_pages:
377 for (i = 0; i < bp->b_page_count; i++)
378 __free_page(bp->b_pages[i]);
379 return error;
383 * Map buffer into kernel address-space if necessary.
385 STATIC int
386 _xfs_buf_map_pages(
387 xfs_buf_t *bp,
388 uint flags)
390 ASSERT(bp->b_flags & _XBF_PAGES);
391 if (bp->b_page_count == 1) {
392 /* A single page buffer is always mappable */
393 bp->b_addr = page_address(bp->b_pages[0]) + bp->b_offset;
394 } else if (flags & XBF_UNMAPPED) {
395 bp->b_addr = NULL;
396 } else {
397 int retried = 0;
398 unsigned noio_flag;
401 * vm_map_ram() will allocate auxillary structures (e.g.
402 * pagetables) with GFP_KERNEL, yet we are likely to be under
403 * GFP_NOFS context here. Hence we need to tell memory reclaim
404 * that we are in such a context via PF_MEMALLOC_NOIO to prevent
405 * memory reclaim re-entering the filesystem here and
406 * potentially deadlocking.
408 noio_flag = memalloc_noio_save();
409 do {
410 bp->b_addr = vm_map_ram(bp->b_pages, bp->b_page_count,
411 -1, PAGE_KERNEL);
412 if (bp->b_addr)
413 break;
414 vm_unmap_aliases();
415 } while (retried++ <= 1);
416 memalloc_noio_restore(noio_flag);
418 if (!bp->b_addr)
419 return -ENOMEM;
420 bp->b_addr += bp->b_offset;
423 return 0;
427 * Finding and Reading Buffers
431 * Look up, and creates if absent, a lockable buffer for
432 * a given range of an inode. The buffer is returned
433 * locked. No I/O is implied by this call.
435 xfs_buf_t *
436 _xfs_buf_find(
437 struct xfs_buftarg *btp,
438 struct xfs_buf_map *map,
439 int nmaps,
440 xfs_buf_flags_t flags,
441 xfs_buf_t *new_bp)
443 size_t numbytes;
444 struct xfs_perag *pag;
445 struct rb_node **rbp;
446 struct rb_node *parent;
447 xfs_buf_t *bp;
448 xfs_daddr_t blkno = map[0].bm_bn;
449 xfs_daddr_t eofs;
450 int numblks = 0;
451 int i;
453 for (i = 0; i < nmaps; i++)
454 numblks += map[i].bm_len;
455 numbytes = BBTOB(numblks);
457 /* Check for IOs smaller than the sector size / not sector aligned */
458 ASSERT(!(numbytes < btp->bt_meta_sectorsize));
459 ASSERT(!(BBTOB(blkno) & (xfs_off_t)btp->bt_meta_sectormask));
462 * Corrupted block numbers can get through to here, unfortunately, so we
463 * have to check that the buffer falls within the filesystem bounds.
465 eofs = XFS_FSB_TO_BB(btp->bt_mount, btp->bt_mount->m_sb.sb_dblocks);
466 if (blkno >= eofs) {
468 * XXX (dgc): we should really be returning -EFSCORRUPTED here,
469 * but none of the higher level infrastructure supports
470 * returning a specific error on buffer lookup failures.
472 xfs_alert(btp->bt_mount,
473 "%s: Block out of range: block 0x%llx, EOFS 0x%llx ",
474 __func__, blkno, eofs);
475 WARN_ON(1);
476 return NULL;
479 /* get tree root */
480 pag = xfs_perag_get(btp->bt_mount,
481 xfs_daddr_to_agno(btp->bt_mount, blkno));
483 /* walk tree */
484 spin_lock(&pag->pag_buf_lock);
485 rbp = &pag->pag_buf_tree.rb_node;
486 parent = NULL;
487 bp = NULL;
488 while (*rbp) {
489 parent = *rbp;
490 bp = rb_entry(parent, struct xfs_buf, b_rbnode);
492 if (blkno < bp->b_bn)
493 rbp = &(*rbp)->rb_left;
494 else if (blkno > bp->b_bn)
495 rbp = &(*rbp)->rb_right;
496 else {
498 * found a block number match. If the range doesn't
499 * match, the only way this is allowed is if the buffer
500 * in the cache is stale and the transaction that made
501 * it stale has not yet committed. i.e. we are
502 * reallocating a busy extent. Skip this buffer and
503 * continue searching to the right for an exact match.
505 if (bp->b_length != numblks) {
506 ASSERT(bp->b_flags & XBF_STALE);
507 rbp = &(*rbp)->rb_right;
508 continue;
510 atomic_inc(&bp->b_hold);
511 goto found;
515 /* No match found */
516 if (new_bp) {
517 rb_link_node(&new_bp->b_rbnode, parent, rbp);
518 rb_insert_color(&new_bp->b_rbnode, &pag->pag_buf_tree);
519 /* the buffer keeps the perag reference until it is freed */
520 new_bp->b_pag = pag;
521 spin_unlock(&pag->pag_buf_lock);
522 } else {
523 XFS_STATS_INC(xb_miss_locked);
524 spin_unlock(&pag->pag_buf_lock);
525 xfs_perag_put(pag);
527 return new_bp;
529 found:
530 spin_unlock(&pag->pag_buf_lock);
531 xfs_perag_put(pag);
533 if (!xfs_buf_trylock(bp)) {
534 if (flags & XBF_TRYLOCK) {
535 xfs_buf_rele(bp);
536 XFS_STATS_INC(xb_busy_locked);
537 return NULL;
539 xfs_buf_lock(bp);
540 XFS_STATS_INC(xb_get_locked_waited);
544 * if the buffer is stale, clear all the external state associated with
545 * it. We need to keep flags such as how we allocated the buffer memory
546 * intact here.
548 if (bp->b_flags & XBF_STALE) {
549 ASSERT((bp->b_flags & _XBF_DELWRI_Q) == 0);
550 ASSERT(bp->b_iodone == NULL);
551 bp->b_flags &= _XBF_KMEM | _XBF_PAGES;
552 bp->b_ops = NULL;
555 trace_xfs_buf_find(bp, flags, _RET_IP_);
556 XFS_STATS_INC(xb_get_locked);
557 return bp;
561 * Assembles a buffer covering the specified range. The code is optimised for
562 * cache hits, as metadata intensive workloads will see 3 orders of magnitude
563 * more hits than misses.
565 struct xfs_buf *
566 xfs_buf_get_map(
567 struct xfs_buftarg *target,
568 struct xfs_buf_map *map,
569 int nmaps,
570 xfs_buf_flags_t flags)
572 struct xfs_buf *bp;
573 struct xfs_buf *new_bp;
574 int error = 0;
576 bp = _xfs_buf_find(target, map, nmaps, flags, NULL);
577 if (likely(bp))
578 goto found;
580 new_bp = _xfs_buf_alloc(target, map, nmaps, flags);
581 if (unlikely(!new_bp))
582 return NULL;
584 error = xfs_buf_allocate_memory(new_bp, flags);
585 if (error) {
586 xfs_buf_free(new_bp);
587 return NULL;
590 bp = _xfs_buf_find(target, map, nmaps, flags, new_bp);
591 if (!bp) {
592 xfs_buf_free(new_bp);
593 return NULL;
596 if (bp != new_bp)
597 xfs_buf_free(new_bp);
599 found:
600 if (!bp->b_addr) {
601 error = _xfs_buf_map_pages(bp, flags);
602 if (unlikely(error)) {
603 xfs_warn(target->bt_mount,
604 "%s: failed to map pagesn", __func__);
605 xfs_buf_relse(bp);
606 return NULL;
610 XFS_STATS_INC(xb_get);
611 trace_xfs_buf_get(bp, flags, _RET_IP_);
612 return bp;
615 STATIC int
616 _xfs_buf_read(
617 xfs_buf_t *bp,
618 xfs_buf_flags_t flags)
620 ASSERT(!(flags & XBF_WRITE));
621 ASSERT(bp->b_maps[0].bm_bn != XFS_BUF_DADDR_NULL);
623 bp->b_flags &= ~(XBF_WRITE | XBF_ASYNC | XBF_READ_AHEAD);
624 bp->b_flags |= flags & (XBF_READ | XBF_ASYNC | XBF_READ_AHEAD);
626 xfs_buf_iorequest(bp);
627 if (flags & XBF_ASYNC)
628 return 0;
629 return xfs_buf_iowait(bp);
632 xfs_buf_t *
633 xfs_buf_read_map(
634 struct xfs_buftarg *target,
635 struct xfs_buf_map *map,
636 int nmaps,
637 xfs_buf_flags_t flags,
638 const struct xfs_buf_ops *ops)
640 struct xfs_buf *bp;
642 flags |= XBF_READ;
644 bp = xfs_buf_get_map(target, map, nmaps, flags);
645 if (bp) {
646 trace_xfs_buf_read(bp, flags, _RET_IP_);
648 if (!XFS_BUF_ISDONE(bp)) {
649 XFS_STATS_INC(xb_get_read);
650 bp->b_ops = ops;
651 _xfs_buf_read(bp, flags);
652 } else if (flags & XBF_ASYNC) {
654 * Read ahead call which is already satisfied,
655 * drop the buffer
657 xfs_buf_relse(bp);
658 return NULL;
659 } else {
660 /* We do not want read in the flags */
661 bp->b_flags &= ~XBF_READ;
665 return bp;
669 * If we are not low on memory then do the readahead in a deadlock
670 * safe manner.
672 void
673 xfs_buf_readahead_map(
674 struct xfs_buftarg *target,
675 struct xfs_buf_map *map,
676 int nmaps,
677 const struct xfs_buf_ops *ops)
679 if (bdi_read_congested(target->bt_bdi))
680 return;
682 xfs_buf_read_map(target, map, nmaps,
683 XBF_TRYLOCK|XBF_ASYNC|XBF_READ_AHEAD, ops);
687 * Read an uncached buffer from disk. Allocates and returns a locked
688 * buffer containing the disk contents or nothing.
690 struct xfs_buf *
691 xfs_buf_read_uncached(
692 struct xfs_buftarg *target,
693 xfs_daddr_t daddr,
694 size_t numblks,
695 int flags,
696 const struct xfs_buf_ops *ops)
698 struct xfs_buf *bp;
700 bp = xfs_buf_get_uncached(target, numblks, flags);
701 if (!bp)
702 return NULL;
704 /* set up the buffer for a read IO */
705 ASSERT(bp->b_map_count == 1);
706 bp->b_bn = daddr;
707 bp->b_maps[0].bm_bn = daddr;
708 bp->b_flags |= XBF_READ;
709 bp->b_ops = ops;
711 if (XFS_FORCED_SHUTDOWN(target->bt_mount)) {
712 xfs_buf_relse(bp);
713 return NULL;
715 xfs_buf_iorequest(bp);
716 xfs_buf_iowait(bp);
717 return bp;
721 * Return a buffer allocated as an empty buffer and associated to external
722 * memory via xfs_buf_associate_memory() back to it's empty state.
724 void
725 xfs_buf_set_empty(
726 struct xfs_buf *bp,
727 size_t numblks)
729 if (bp->b_pages)
730 _xfs_buf_free_pages(bp);
732 bp->b_pages = NULL;
733 bp->b_page_count = 0;
734 bp->b_addr = NULL;
735 bp->b_length = numblks;
736 bp->b_io_length = numblks;
738 ASSERT(bp->b_map_count == 1);
739 bp->b_bn = XFS_BUF_DADDR_NULL;
740 bp->b_maps[0].bm_bn = XFS_BUF_DADDR_NULL;
741 bp->b_maps[0].bm_len = bp->b_length;
744 static inline struct page *
745 mem_to_page(
746 void *addr)
748 if ((!is_vmalloc_addr(addr))) {
749 return virt_to_page(addr);
750 } else {
751 return vmalloc_to_page(addr);
756 xfs_buf_associate_memory(
757 xfs_buf_t *bp,
758 void *mem,
759 size_t len)
761 int rval;
762 int i = 0;
763 unsigned long pageaddr;
764 unsigned long offset;
765 size_t buflen;
766 int page_count;
768 pageaddr = (unsigned long)mem & PAGE_MASK;
769 offset = (unsigned long)mem - pageaddr;
770 buflen = PAGE_ALIGN(len + offset);
771 page_count = buflen >> PAGE_SHIFT;
773 /* Free any previous set of page pointers */
774 if (bp->b_pages)
775 _xfs_buf_free_pages(bp);
777 bp->b_pages = NULL;
778 bp->b_addr = mem;
780 rval = _xfs_buf_get_pages(bp, page_count);
781 if (rval)
782 return rval;
784 bp->b_offset = offset;
786 for (i = 0; i < bp->b_page_count; i++) {
787 bp->b_pages[i] = mem_to_page((void *)pageaddr);
788 pageaddr += PAGE_SIZE;
791 bp->b_io_length = BTOBB(len);
792 bp->b_length = BTOBB(buflen);
794 return 0;
797 xfs_buf_t *
798 xfs_buf_get_uncached(
799 struct xfs_buftarg *target,
800 size_t numblks,
801 int flags)
803 unsigned long page_count;
804 int error, i;
805 struct xfs_buf *bp;
806 DEFINE_SINGLE_BUF_MAP(map, XFS_BUF_DADDR_NULL, numblks);
808 bp = _xfs_buf_alloc(target, &map, 1, 0);
809 if (unlikely(bp == NULL))
810 goto fail;
812 page_count = PAGE_ALIGN(numblks << BBSHIFT) >> PAGE_SHIFT;
813 error = _xfs_buf_get_pages(bp, page_count);
814 if (error)
815 goto fail_free_buf;
817 for (i = 0; i < page_count; i++) {
818 bp->b_pages[i] = alloc_page(xb_to_gfp(flags));
819 if (!bp->b_pages[i])
820 goto fail_free_mem;
822 bp->b_flags |= _XBF_PAGES;
824 error = _xfs_buf_map_pages(bp, 0);
825 if (unlikely(error)) {
826 xfs_warn(target->bt_mount,
827 "%s: failed to map pages", __func__);
828 goto fail_free_mem;
831 trace_xfs_buf_get_uncached(bp, _RET_IP_);
832 return bp;
834 fail_free_mem:
835 while (--i >= 0)
836 __free_page(bp->b_pages[i]);
837 _xfs_buf_free_pages(bp);
838 fail_free_buf:
839 xfs_buf_free_maps(bp);
840 kmem_zone_free(xfs_buf_zone, bp);
841 fail:
842 return NULL;
846 * Increment reference count on buffer, to hold the buffer concurrently
847 * with another thread which may release (free) the buffer asynchronously.
848 * Must hold the buffer already to call this function.
850 void
851 xfs_buf_hold(
852 xfs_buf_t *bp)
854 trace_xfs_buf_hold(bp, _RET_IP_);
855 atomic_inc(&bp->b_hold);
859 * Releases a hold on the specified buffer. If the
860 * the hold count is 1, calls xfs_buf_free.
862 void
863 xfs_buf_rele(
864 xfs_buf_t *bp)
866 struct xfs_perag *pag = bp->b_pag;
868 trace_xfs_buf_rele(bp, _RET_IP_);
870 if (!pag) {
871 ASSERT(list_empty(&bp->b_lru));
872 ASSERT(RB_EMPTY_NODE(&bp->b_rbnode));
873 if (atomic_dec_and_test(&bp->b_hold))
874 xfs_buf_free(bp);
875 return;
878 ASSERT(!RB_EMPTY_NODE(&bp->b_rbnode));
880 ASSERT(atomic_read(&bp->b_hold) > 0);
881 if (atomic_dec_and_lock(&bp->b_hold, &pag->pag_buf_lock)) {
882 spin_lock(&bp->b_lock);
883 if (!(bp->b_flags & XBF_STALE) && atomic_read(&bp->b_lru_ref)) {
885 * If the buffer is added to the LRU take a new
886 * reference to the buffer for the LRU and clear the
887 * (now stale) dispose list state flag
889 if (list_lru_add(&bp->b_target->bt_lru, &bp->b_lru)) {
890 bp->b_state &= ~XFS_BSTATE_DISPOSE;
891 atomic_inc(&bp->b_hold);
893 spin_unlock(&bp->b_lock);
894 spin_unlock(&pag->pag_buf_lock);
895 } else {
897 * most of the time buffers will already be removed from
898 * the LRU, so optimise that case by checking for the
899 * XFS_BSTATE_DISPOSE flag indicating the last list the
900 * buffer was on was the disposal list
902 if (!(bp->b_state & XFS_BSTATE_DISPOSE)) {
903 list_lru_del(&bp->b_target->bt_lru, &bp->b_lru);
904 } else {
905 ASSERT(list_empty(&bp->b_lru));
907 spin_unlock(&bp->b_lock);
909 ASSERT(!(bp->b_flags & _XBF_DELWRI_Q));
910 rb_erase(&bp->b_rbnode, &pag->pag_buf_tree);
911 spin_unlock(&pag->pag_buf_lock);
912 xfs_perag_put(pag);
913 xfs_buf_free(bp);
920 * Lock a buffer object, if it is not already locked.
922 * If we come across a stale, pinned, locked buffer, we know that we are
923 * being asked to lock a buffer that has been reallocated. Because it is
924 * pinned, we know that the log has not been pushed to disk and hence it
925 * will still be locked. Rather than continuing to have trylock attempts
926 * fail until someone else pushes the log, push it ourselves before
927 * returning. This means that the xfsaild will not get stuck trying
928 * to push on stale inode buffers.
931 xfs_buf_trylock(
932 struct xfs_buf *bp)
934 int locked;
936 locked = down_trylock(&bp->b_sema) == 0;
937 if (locked)
938 XB_SET_OWNER(bp);
940 trace_xfs_buf_trylock(bp, _RET_IP_);
941 return locked;
945 * Lock a buffer object.
947 * If we come across a stale, pinned, locked buffer, we know that we
948 * are being asked to lock a buffer that has been reallocated. Because
949 * it is pinned, we know that the log has not been pushed to disk and
950 * hence it will still be locked. Rather than sleeping until someone
951 * else pushes the log, push it ourselves before trying to get the lock.
953 void
954 xfs_buf_lock(
955 struct xfs_buf *bp)
957 trace_xfs_buf_lock(bp, _RET_IP_);
959 if (atomic_read(&bp->b_pin_count) && (bp->b_flags & XBF_STALE))
960 xfs_log_force(bp->b_target->bt_mount, 0);
961 down(&bp->b_sema);
962 XB_SET_OWNER(bp);
964 trace_xfs_buf_lock_done(bp, _RET_IP_);
967 void
968 xfs_buf_unlock(
969 struct xfs_buf *bp)
971 XB_CLEAR_OWNER(bp);
972 up(&bp->b_sema);
974 trace_xfs_buf_unlock(bp, _RET_IP_);
977 STATIC void
978 xfs_buf_wait_unpin(
979 xfs_buf_t *bp)
981 DECLARE_WAITQUEUE (wait, current);
983 if (atomic_read(&bp->b_pin_count) == 0)
984 return;
986 add_wait_queue(&bp->b_waiters, &wait);
987 for (;;) {
988 set_current_state(TASK_UNINTERRUPTIBLE);
989 if (atomic_read(&bp->b_pin_count) == 0)
990 break;
991 io_schedule();
993 remove_wait_queue(&bp->b_waiters, &wait);
994 set_current_state(TASK_RUNNING);
998 * Buffer Utility Routines
1001 STATIC void
1002 xfs_buf_iodone_work(
1003 struct work_struct *work)
1005 struct xfs_buf *bp =
1006 container_of(work, xfs_buf_t, b_iodone_work);
1007 bool read = !!(bp->b_flags & XBF_READ);
1009 bp->b_flags &= ~(XBF_READ | XBF_WRITE | XBF_READ_AHEAD);
1011 /* only validate buffers that were read without errors */
1012 if (read && bp->b_ops && !bp->b_error && (bp->b_flags & XBF_DONE))
1013 bp->b_ops->verify_read(bp);
1015 if (bp->b_iodone)
1016 (*(bp->b_iodone))(bp);
1017 else if (bp->b_flags & XBF_ASYNC)
1018 xfs_buf_relse(bp);
1019 else {
1020 ASSERT(read && bp->b_ops);
1021 complete(&bp->b_iowait);
1025 void
1026 xfs_buf_ioend(
1027 struct xfs_buf *bp,
1028 int schedule)
1030 bool read = !!(bp->b_flags & XBF_READ);
1032 trace_xfs_buf_iodone(bp, _RET_IP_);
1034 if (bp->b_error == 0)
1035 bp->b_flags |= XBF_DONE;
1037 if (bp->b_iodone || (read && bp->b_ops) || (bp->b_flags & XBF_ASYNC)) {
1038 if (schedule) {
1039 INIT_WORK(&bp->b_iodone_work, xfs_buf_iodone_work);
1040 queue_work(xfslogd_workqueue, &bp->b_iodone_work);
1041 } else {
1042 xfs_buf_iodone_work(&bp->b_iodone_work);
1044 } else {
1045 bp->b_flags &= ~(XBF_READ | XBF_WRITE | XBF_READ_AHEAD);
1046 complete(&bp->b_iowait);
1050 void
1051 xfs_buf_ioerror(
1052 xfs_buf_t *bp,
1053 int error)
1055 ASSERT(error <= 0 && error >= -1000);
1056 bp->b_error = error;
1057 trace_xfs_buf_ioerror(bp, error, _RET_IP_);
1060 void
1061 xfs_buf_ioerror_alert(
1062 struct xfs_buf *bp,
1063 const char *func)
1065 xfs_alert(bp->b_target->bt_mount,
1066 "metadata I/O error: block 0x%llx (\"%s\") error %d numblks %d",
1067 (__uint64_t)XFS_BUF_ADDR(bp), func, -bp->b_error, bp->b_length);
1071 * Called when we want to stop a buffer from getting written or read.
1072 * We attach the EIO error, muck with its flags, and call xfs_buf_ioend
1073 * so that the proper iodone callbacks get called.
1075 STATIC int
1076 xfs_bioerror(
1077 xfs_buf_t *bp)
1079 #ifdef XFSERRORDEBUG
1080 ASSERT(XFS_BUF_ISREAD(bp) || bp->b_iodone);
1081 #endif
1084 * No need to wait until the buffer is unpinned, we aren't flushing it.
1086 xfs_buf_ioerror(bp, -EIO);
1089 * We're calling xfs_buf_ioend, so delete XBF_DONE flag.
1091 XFS_BUF_UNREAD(bp);
1092 XFS_BUF_UNDONE(bp);
1093 xfs_buf_stale(bp);
1095 xfs_buf_ioend(bp, 0);
1097 return -EIO;
1101 * Same as xfs_bioerror, except that we are releasing the buffer
1102 * here ourselves, and avoiding the xfs_buf_ioend call.
1103 * This is meant for userdata errors; metadata bufs come with
1104 * iodone functions attached, so that we can track down errors.
1107 xfs_bioerror_relse(
1108 struct xfs_buf *bp)
1110 int64_t fl = bp->b_flags;
1112 * No need to wait until the buffer is unpinned.
1113 * We aren't flushing it.
1115 * chunkhold expects B_DONE to be set, whether
1116 * we actually finish the I/O or not. We don't want to
1117 * change that interface.
1119 XFS_BUF_UNREAD(bp);
1120 XFS_BUF_DONE(bp);
1121 xfs_buf_stale(bp);
1122 bp->b_iodone = NULL;
1123 if (!(fl & XBF_ASYNC)) {
1125 * Mark b_error and B_ERROR _both_.
1126 * Lot's of chunkcache code assumes that.
1127 * There's no reason to mark error for
1128 * ASYNC buffers.
1130 xfs_buf_ioerror(bp, -EIO);
1131 complete(&bp->b_iowait);
1132 } else {
1133 xfs_buf_relse(bp);
1136 return -EIO;
1139 STATIC int
1140 xfs_bdstrat_cb(
1141 struct xfs_buf *bp)
1143 if (XFS_FORCED_SHUTDOWN(bp->b_target->bt_mount)) {
1144 trace_xfs_bdstrat_shut(bp, _RET_IP_);
1146 * Metadata write that didn't get logged but
1147 * written delayed anyway. These aren't associated
1148 * with a transaction, and can be ignored.
1150 if (!bp->b_iodone && !XFS_BUF_ISREAD(bp))
1151 return xfs_bioerror_relse(bp);
1152 else
1153 return xfs_bioerror(bp);
1156 xfs_buf_iorequest(bp);
1157 return 0;
1161 xfs_bwrite(
1162 struct xfs_buf *bp)
1164 int error;
1166 ASSERT(xfs_buf_islocked(bp));
1168 bp->b_flags |= XBF_WRITE;
1169 bp->b_flags &= ~(XBF_ASYNC | XBF_READ | _XBF_DELWRI_Q | XBF_WRITE_FAIL);
1171 xfs_bdstrat_cb(bp);
1173 error = xfs_buf_iowait(bp);
1174 if (error) {
1175 xfs_force_shutdown(bp->b_target->bt_mount,
1176 SHUTDOWN_META_IO_ERROR);
1178 return error;
1181 STATIC void
1182 _xfs_buf_ioend(
1183 xfs_buf_t *bp,
1184 int schedule)
1186 if (atomic_dec_and_test(&bp->b_io_remaining) == 1)
1187 xfs_buf_ioend(bp, schedule);
1190 STATIC void
1191 xfs_buf_bio_end_io(
1192 struct bio *bio,
1193 int error)
1195 xfs_buf_t *bp = (xfs_buf_t *)bio->bi_private;
1198 * don't overwrite existing errors - otherwise we can lose errors on
1199 * buffers that require multiple bios to complete.
1201 if (!bp->b_error)
1202 xfs_buf_ioerror(bp, error);
1204 if (!bp->b_error && xfs_buf_is_vmapped(bp) && (bp->b_flags & XBF_READ))
1205 invalidate_kernel_vmap_range(bp->b_addr, xfs_buf_vmap_len(bp));
1207 _xfs_buf_ioend(bp, 1);
1208 bio_put(bio);
1211 static void
1212 xfs_buf_ioapply_map(
1213 struct xfs_buf *bp,
1214 int map,
1215 int *buf_offset,
1216 int *count,
1217 int rw)
1219 int page_index;
1220 int total_nr_pages = bp->b_page_count;
1221 int nr_pages;
1222 struct bio *bio;
1223 sector_t sector = bp->b_maps[map].bm_bn;
1224 int size;
1225 int offset;
1227 total_nr_pages = bp->b_page_count;
1229 /* skip the pages in the buffer before the start offset */
1230 page_index = 0;
1231 offset = *buf_offset;
1232 while (offset >= PAGE_SIZE) {
1233 page_index++;
1234 offset -= PAGE_SIZE;
1238 * Limit the IO size to the length of the current vector, and update the
1239 * remaining IO count for the next time around.
1241 size = min_t(int, BBTOB(bp->b_maps[map].bm_len), *count);
1242 *count -= size;
1243 *buf_offset += size;
1245 next_chunk:
1246 atomic_inc(&bp->b_io_remaining);
1247 nr_pages = BIO_MAX_SECTORS >> (PAGE_SHIFT - BBSHIFT);
1248 if (nr_pages > total_nr_pages)
1249 nr_pages = total_nr_pages;
1251 bio = bio_alloc(GFP_NOIO, nr_pages);
1252 bio->bi_bdev = bp->b_target->bt_bdev;
1253 bio->bi_iter.bi_sector = sector;
1254 bio->bi_end_io = xfs_buf_bio_end_io;
1255 bio->bi_private = bp;
1258 for (; size && nr_pages; nr_pages--, page_index++) {
1259 int rbytes, nbytes = PAGE_SIZE - offset;
1261 if (nbytes > size)
1262 nbytes = size;
1264 rbytes = bio_add_page(bio, bp->b_pages[page_index], nbytes,
1265 offset);
1266 if (rbytes < nbytes)
1267 break;
1269 offset = 0;
1270 sector += BTOBB(nbytes);
1271 size -= nbytes;
1272 total_nr_pages--;
1275 if (likely(bio->bi_iter.bi_size)) {
1276 if (xfs_buf_is_vmapped(bp)) {
1277 flush_kernel_vmap_range(bp->b_addr,
1278 xfs_buf_vmap_len(bp));
1280 submit_bio(rw, bio);
1281 if (size)
1282 goto next_chunk;
1283 } else {
1285 * This is guaranteed not to be the last io reference count
1286 * because the caller (xfs_buf_iorequest) holds a count itself.
1288 atomic_dec(&bp->b_io_remaining);
1289 xfs_buf_ioerror(bp, -EIO);
1290 bio_put(bio);
1295 STATIC void
1296 _xfs_buf_ioapply(
1297 struct xfs_buf *bp)
1299 struct blk_plug plug;
1300 int rw;
1301 int offset;
1302 int size;
1303 int i;
1306 * Make sure we capture only current IO errors rather than stale errors
1307 * left over from previous use of the buffer (e.g. failed readahead).
1309 bp->b_error = 0;
1311 if (bp->b_flags & XBF_WRITE) {
1312 if (bp->b_flags & XBF_SYNCIO)
1313 rw = WRITE_SYNC;
1314 else
1315 rw = WRITE;
1316 if (bp->b_flags & XBF_FUA)
1317 rw |= REQ_FUA;
1318 if (bp->b_flags & XBF_FLUSH)
1319 rw |= REQ_FLUSH;
1322 * Run the write verifier callback function if it exists. If
1323 * this function fails it will mark the buffer with an error and
1324 * the IO should not be dispatched.
1326 if (bp->b_ops) {
1327 bp->b_ops->verify_write(bp);
1328 if (bp->b_error) {
1329 xfs_force_shutdown(bp->b_target->bt_mount,
1330 SHUTDOWN_CORRUPT_INCORE);
1331 return;
1333 } else if (bp->b_bn != XFS_BUF_DADDR_NULL) {
1334 struct xfs_mount *mp = bp->b_target->bt_mount;
1337 * non-crc filesystems don't attach verifiers during
1338 * log recovery, so don't warn for such filesystems.
1340 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1341 xfs_warn(mp,
1342 "%s: no ops on block 0x%llx/0x%x",
1343 __func__, bp->b_bn, bp->b_length);
1344 xfs_hex_dump(bp->b_addr, 64);
1345 dump_stack();
1348 } else if (bp->b_flags & XBF_READ_AHEAD) {
1349 rw = READA;
1350 } else {
1351 rw = READ;
1354 /* we only use the buffer cache for meta-data */
1355 rw |= REQ_META;
1358 * Walk all the vectors issuing IO on them. Set up the initial offset
1359 * into the buffer and the desired IO size before we start -
1360 * _xfs_buf_ioapply_vec() will modify them appropriately for each
1361 * subsequent call.
1363 offset = bp->b_offset;
1364 size = BBTOB(bp->b_io_length);
1365 blk_start_plug(&plug);
1366 for (i = 0; i < bp->b_map_count; i++) {
1367 xfs_buf_ioapply_map(bp, i, &offset, &size, rw);
1368 if (bp->b_error)
1369 break;
1370 if (size <= 0)
1371 break; /* all done */
1373 blk_finish_plug(&plug);
1376 void
1377 xfs_buf_iorequest(
1378 xfs_buf_t *bp)
1380 trace_xfs_buf_iorequest(bp, _RET_IP_);
1382 ASSERT(!(bp->b_flags & _XBF_DELWRI_Q));
1384 if (bp->b_flags & XBF_WRITE)
1385 xfs_buf_wait_unpin(bp);
1386 xfs_buf_hold(bp);
1389 * Set the count to 1 initially, this will stop an I/O
1390 * completion callout which happens before we have started
1391 * all the I/O from calling xfs_buf_ioend too early.
1393 atomic_set(&bp->b_io_remaining, 1);
1394 _xfs_buf_ioapply(bp);
1396 * If _xfs_buf_ioapply failed, we'll get back here with
1397 * only the reference we took above. _xfs_buf_ioend will
1398 * drop it to zero, so we'd better not queue it for later,
1399 * or we'll free it before it's done.
1401 _xfs_buf_ioend(bp, bp->b_error ? 0 : 1);
1403 xfs_buf_rele(bp);
1407 * Waits for I/O to complete on the buffer supplied. It returns immediately if
1408 * no I/O is pending or there is already a pending error on the buffer, in which
1409 * case nothing will ever complete. It returns the I/O error code, if any, or
1410 * 0 if there was no error.
1413 xfs_buf_iowait(
1414 xfs_buf_t *bp)
1416 trace_xfs_buf_iowait(bp, _RET_IP_);
1418 if (!bp->b_error)
1419 wait_for_completion(&bp->b_iowait);
1421 trace_xfs_buf_iowait_done(bp, _RET_IP_);
1422 return bp->b_error;
1425 xfs_caddr_t
1426 xfs_buf_offset(
1427 xfs_buf_t *bp,
1428 size_t offset)
1430 struct page *page;
1432 if (bp->b_addr)
1433 return bp->b_addr + offset;
1435 offset += bp->b_offset;
1436 page = bp->b_pages[offset >> PAGE_SHIFT];
1437 return (xfs_caddr_t)page_address(page) + (offset & (PAGE_SIZE-1));
1441 * Move data into or out of a buffer.
1443 void
1444 xfs_buf_iomove(
1445 xfs_buf_t *bp, /* buffer to process */
1446 size_t boff, /* starting buffer offset */
1447 size_t bsize, /* length to copy */
1448 void *data, /* data address */
1449 xfs_buf_rw_t mode) /* read/write/zero flag */
1451 size_t bend;
1453 bend = boff + bsize;
1454 while (boff < bend) {
1455 struct page *page;
1456 int page_index, page_offset, csize;
1458 page_index = (boff + bp->b_offset) >> PAGE_SHIFT;
1459 page_offset = (boff + bp->b_offset) & ~PAGE_MASK;
1460 page = bp->b_pages[page_index];
1461 csize = min_t(size_t, PAGE_SIZE - page_offset,
1462 BBTOB(bp->b_io_length) - boff);
1464 ASSERT((csize + page_offset) <= PAGE_SIZE);
1466 switch (mode) {
1467 case XBRW_ZERO:
1468 memset(page_address(page) + page_offset, 0, csize);
1469 break;
1470 case XBRW_READ:
1471 memcpy(data, page_address(page) + page_offset, csize);
1472 break;
1473 case XBRW_WRITE:
1474 memcpy(page_address(page) + page_offset, data, csize);
1477 boff += csize;
1478 data += csize;
1483 * Handling of buffer targets (buftargs).
1487 * Wait for any bufs with callbacks that have been submitted but have not yet
1488 * returned. These buffers will have an elevated hold count, so wait on those
1489 * while freeing all the buffers only held by the LRU.
1491 static enum lru_status
1492 xfs_buftarg_wait_rele(
1493 struct list_head *item,
1494 spinlock_t *lru_lock,
1495 void *arg)
1498 struct xfs_buf *bp = container_of(item, struct xfs_buf, b_lru);
1499 struct list_head *dispose = arg;
1501 if (atomic_read(&bp->b_hold) > 1) {
1502 /* need to wait, so skip it this pass */
1503 trace_xfs_buf_wait_buftarg(bp, _RET_IP_);
1504 return LRU_SKIP;
1506 if (!spin_trylock(&bp->b_lock))
1507 return LRU_SKIP;
1510 * clear the LRU reference count so the buffer doesn't get
1511 * ignored in xfs_buf_rele().
1513 atomic_set(&bp->b_lru_ref, 0);
1514 bp->b_state |= XFS_BSTATE_DISPOSE;
1515 list_move(item, dispose);
1516 spin_unlock(&bp->b_lock);
1517 return LRU_REMOVED;
1520 void
1521 xfs_wait_buftarg(
1522 struct xfs_buftarg *btp)
1524 LIST_HEAD(dispose);
1525 int loop = 0;
1527 /* loop until there is nothing left on the lru list. */
1528 while (list_lru_count(&btp->bt_lru)) {
1529 list_lru_walk(&btp->bt_lru, xfs_buftarg_wait_rele,
1530 &dispose, LONG_MAX);
1532 while (!list_empty(&dispose)) {
1533 struct xfs_buf *bp;
1534 bp = list_first_entry(&dispose, struct xfs_buf, b_lru);
1535 list_del_init(&bp->b_lru);
1536 if (bp->b_flags & XBF_WRITE_FAIL) {
1537 xfs_alert(btp->bt_mount,
1538 "Corruption Alert: Buffer at block 0x%llx had permanent write failures!\n"
1539 "Please run xfs_repair to determine the extent of the problem.",
1540 (long long)bp->b_bn);
1542 xfs_buf_rele(bp);
1544 if (loop++ != 0)
1545 delay(100);
1549 static enum lru_status
1550 xfs_buftarg_isolate(
1551 struct list_head *item,
1552 spinlock_t *lru_lock,
1553 void *arg)
1555 struct xfs_buf *bp = container_of(item, struct xfs_buf, b_lru);
1556 struct list_head *dispose = arg;
1559 * we are inverting the lru lock/bp->b_lock here, so use a trylock.
1560 * If we fail to get the lock, just skip it.
1562 if (!spin_trylock(&bp->b_lock))
1563 return LRU_SKIP;
1565 * Decrement the b_lru_ref count unless the value is already
1566 * zero. If the value is already zero, we need to reclaim the
1567 * buffer, otherwise it gets another trip through the LRU.
1569 if (!atomic_add_unless(&bp->b_lru_ref, -1, 0)) {
1570 spin_unlock(&bp->b_lock);
1571 return LRU_ROTATE;
1574 bp->b_state |= XFS_BSTATE_DISPOSE;
1575 list_move(item, dispose);
1576 spin_unlock(&bp->b_lock);
1577 return LRU_REMOVED;
1580 static unsigned long
1581 xfs_buftarg_shrink_scan(
1582 struct shrinker *shrink,
1583 struct shrink_control *sc)
1585 struct xfs_buftarg *btp = container_of(shrink,
1586 struct xfs_buftarg, bt_shrinker);
1587 LIST_HEAD(dispose);
1588 unsigned long freed;
1589 unsigned long nr_to_scan = sc->nr_to_scan;
1591 freed = list_lru_walk_node(&btp->bt_lru, sc->nid, xfs_buftarg_isolate,
1592 &dispose, &nr_to_scan);
1594 while (!list_empty(&dispose)) {
1595 struct xfs_buf *bp;
1596 bp = list_first_entry(&dispose, struct xfs_buf, b_lru);
1597 list_del_init(&bp->b_lru);
1598 xfs_buf_rele(bp);
1601 return freed;
1604 static unsigned long
1605 xfs_buftarg_shrink_count(
1606 struct shrinker *shrink,
1607 struct shrink_control *sc)
1609 struct xfs_buftarg *btp = container_of(shrink,
1610 struct xfs_buftarg, bt_shrinker);
1611 return list_lru_count_node(&btp->bt_lru, sc->nid);
1614 void
1615 xfs_free_buftarg(
1616 struct xfs_mount *mp,
1617 struct xfs_buftarg *btp)
1619 unregister_shrinker(&btp->bt_shrinker);
1620 list_lru_destroy(&btp->bt_lru);
1622 if (mp->m_flags & XFS_MOUNT_BARRIER)
1623 xfs_blkdev_issue_flush(btp);
1625 kmem_free(btp);
1629 xfs_setsize_buftarg(
1630 xfs_buftarg_t *btp,
1631 unsigned int sectorsize)
1633 /* Set up metadata sector size info */
1634 btp->bt_meta_sectorsize = sectorsize;
1635 btp->bt_meta_sectormask = sectorsize - 1;
1637 if (set_blocksize(btp->bt_bdev, sectorsize)) {
1638 char name[BDEVNAME_SIZE];
1640 bdevname(btp->bt_bdev, name);
1642 xfs_warn(btp->bt_mount,
1643 "Cannot set_blocksize to %u on device %s",
1644 sectorsize, name);
1645 return -EINVAL;
1648 /* Set up device logical sector size mask */
1649 btp->bt_logical_sectorsize = bdev_logical_block_size(btp->bt_bdev);
1650 btp->bt_logical_sectormask = bdev_logical_block_size(btp->bt_bdev) - 1;
1652 return 0;
1656 * When allocating the initial buffer target we have not yet
1657 * read in the superblock, so don't know what sized sectors
1658 * are being used at this early stage. Play safe.
1660 STATIC int
1661 xfs_setsize_buftarg_early(
1662 xfs_buftarg_t *btp,
1663 struct block_device *bdev)
1665 return xfs_setsize_buftarg(btp, bdev_logical_block_size(bdev));
1668 xfs_buftarg_t *
1669 xfs_alloc_buftarg(
1670 struct xfs_mount *mp,
1671 struct block_device *bdev)
1673 xfs_buftarg_t *btp;
1675 btp = kmem_zalloc(sizeof(*btp), KM_SLEEP | KM_NOFS);
1677 btp->bt_mount = mp;
1678 btp->bt_dev = bdev->bd_dev;
1679 btp->bt_bdev = bdev;
1680 btp->bt_bdi = blk_get_backing_dev_info(bdev);
1681 if (!btp->bt_bdi)
1682 goto error;
1684 if (xfs_setsize_buftarg_early(btp, bdev))
1685 goto error;
1687 if (list_lru_init(&btp->bt_lru))
1688 goto error;
1690 btp->bt_shrinker.count_objects = xfs_buftarg_shrink_count;
1691 btp->bt_shrinker.scan_objects = xfs_buftarg_shrink_scan;
1692 btp->bt_shrinker.seeks = DEFAULT_SEEKS;
1693 btp->bt_shrinker.flags = SHRINKER_NUMA_AWARE;
1694 register_shrinker(&btp->bt_shrinker);
1695 return btp;
1697 error:
1698 kmem_free(btp);
1699 return NULL;
1703 * Add a buffer to the delayed write list.
1705 * This queues a buffer for writeout if it hasn't already been. Note that
1706 * neither this routine nor the buffer list submission functions perform
1707 * any internal synchronization. It is expected that the lists are thread-local
1708 * to the callers.
1710 * Returns true if we queued up the buffer, or false if it already had
1711 * been on the buffer list.
1713 bool
1714 xfs_buf_delwri_queue(
1715 struct xfs_buf *bp,
1716 struct list_head *list)
1718 ASSERT(xfs_buf_islocked(bp));
1719 ASSERT(!(bp->b_flags & XBF_READ));
1722 * If the buffer is already marked delwri it already is queued up
1723 * by someone else for imediate writeout. Just ignore it in that
1724 * case.
1726 if (bp->b_flags & _XBF_DELWRI_Q) {
1727 trace_xfs_buf_delwri_queued(bp, _RET_IP_);
1728 return false;
1731 trace_xfs_buf_delwri_queue(bp, _RET_IP_);
1734 * If a buffer gets written out synchronously or marked stale while it
1735 * is on a delwri list we lazily remove it. To do this, the other party
1736 * clears the _XBF_DELWRI_Q flag but otherwise leaves the buffer alone.
1737 * It remains referenced and on the list. In a rare corner case it
1738 * might get readded to a delwri list after the synchronous writeout, in
1739 * which case we need just need to re-add the flag here.
1741 bp->b_flags |= _XBF_DELWRI_Q;
1742 if (list_empty(&bp->b_list)) {
1743 atomic_inc(&bp->b_hold);
1744 list_add_tail(&bp->b_list, list);
1747 return true;
1751 * Compare function is more complex than it needs to be because
1752 * the return value is only 32 bits and we are doing comparisons
1753 * on 64 bit values
1755 static int
1756 xfs_buf_cmp(
1757 void *priv,
1758 struct list_head *a,
1759 struct list_head *b)
1761 struct xfs_buf *ap = container_of(a, struct xfs_buf, b_list);
1762 struct xfs_buf *bp = container_of(b, struct xfs_buf, b_list);
1763 xfs_daddr_t diff;
1765 diff = ap->b_maps[0].bm_bn - bp->b_maps[0].bm_bn;
1766 if (diff < 0)
1767 return -1;
1768 if (diff > 0)
1769 return 1;
1770 return 0;
1773 static int
1774 __xfs_buf_delwri_submit(
1775 struct list_head *buffer_list,
1776 struct list_head *io_list,
1777 bool wait)
1779 struct blk_plug plug;
1780 struct xfs_buf *bp, *n;
1781 int pinned = 0;
1783 list_for_each_entry_safe(bp, n, buffer_list, b_list) {
1784 if (!wait) {
1785 if (xfs_buf_ispinned(bp)) {
1786 pinned++;
1787 continue;
1789 if (!xfs_buf_trylock(bp))
1790 continue;
1791 } else {
1792 xfs_buf_lock(bp);
1796 * Someone else might have written the buffer synchronously or
1797 * marked it stale in the meantime. In that case only the
1798 * _XBF_DELWRI_Q flag got cleared, and we have to drop the
1799 * reference and remove it from the list here.
1801 if (!(bp->b_flags & _XBF_DELWRI_Q)) {
1802 list_del_init(&bp->b_list);
1803 xfs_buf_relse(bp);
1804 continue;
1807 list_move_tail(&bp->b_list, io_list);
1808 trace_xfs_buf_delwri_split(bp, _RET_IP_);
1811 list_sort(NULL, io_list, xfs_buf_cmp);
1813 blk_start_plug(&plug);
1814 list_for_each_entry_safe(bp, n, io_list, b_list) {
1815 bp->b_flags &= ~(_XBF_DELWRI_Q | XBF_ASYNC | XBF_WRITE_FAIL);
1816 bp->b_flags |= XBF_WRITE;
1818 if (!wait) {
1819 bp->b_flags |= XBF_ASYNC;
1820 list_del_init(&bp->b_list);
1822 xfs_bdstrat_cb(bp);
1824 blk_finish_plug(&plug);
1826 return pinned;
1830 * Write out a buffer list asynchronously.
1832 * This will take the @buffer_list, write all non-locked and non-pinned buffers
1833 * out and not wait for I/O completion on any of the buffers. This interface
1834 * is only safely useable for callers that can track I/O completion by higher
1835 * level means, e.g. AIL pushing as the @buffer_list is consumed in this
1836 * function.
1839 xfs_buf_delwri_submit_nowait(
1840 struct list_head *buffer_list)
1842 LIST_HEAD (io_list);
1843 return __xfs_buf_delwri_submit(buffer_list, &io_list, false);
1847 * Write out a buffer list synchronously.
1849 * This will take the @buffer_list, write all buffers out and wait for I/O
1850 * completion on all of the buffers. @buffer_list is consumed by the function,
1851 * so callers must have some other way of tracking buffers if they require such
1852 * functionality.
1855 xfs_buf_delwri_submit(
1856 struct list_head *buffer_list)
1858 LIST_HEAD (io_list);
1859 int error = 0, error2;
1860 struct xfs_buf *bp;
1862 __xfs_buf_delwri_submit(buffer_list, &io_list, true);
1864 /* Wait for IO to complete. */
1865 while (!list_empty(&io_list)) {
1866 bp = list_first_entry(&io_list, struct xfs_buf, b_list);
1868 list_del_init(&bp->b_list);
1869 error2 = xfs_buf_iowait(bp);
1870 xfs_buf_relse(bp);
1871 if (!error)
1872 error = error2;
1875 return error;
1878 int __init
1879 xfs_buf_init(void)
1881 xfs_buf_zone = kmem_zone_init_flags(sizeof(xfs_buf_t), "xfs_buf",
1882 KM_ZONE_HWALIGN, NULL);
1883 if (!xfs_buf_zone)
1884 goto out;
1886 xfslogd_workqueue = alloc_workqueue("xfslogd",
1887 WQ_MEM_RECLAIM | WQ_HIGHPRI, 1);
1888 if (!xfslogd_workqueue)
1889 goto out_free_buf_zone;
1891 return 0;
1893 out_free_buf_zone:
1894 kmem_zone_destroy(xfs_buf_zone);
1895 out:
1896 return -ENOMEM;
1899 void
1900 xfs_buf_terminate(void)
1902 destroy_workqueue(xfslogd_workqueue);
1903 kmem_zone_destroy(xfs_buf_zone);