2 * fs/dax.c - Direct Access filesystem code
3 * Copyright (c) 2013-2014 Intel Corporation
4 * Author: Matthew Wilcox <matthew.r.wilcox@intel.com>
5 * Author: Ross Zwisler <ross.zwisler@linux.intel.com>
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms and conditions of the GNU General Public License,
9 * version 2, as published by the Free Software Foundation.
11 * This program is distributed in the hope it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
17 #include <linux/atomic.h>
18 #include <linux/blkdev.h>
19 #include <linux/buffer_head.h>
20 #include <linux/dax.h>
22 #include <linux/genhd.h>
23 #include <linux/highmem.h>
24 #include <linux/memcontrol.h>
26 #include <linux/mutex.h>
27 #include <linux/pagevec.h>
28 #include <linux/pmem.h>
29 #include <linux/sched.h>
30 #include <linux/uio.h>
31 #include <linux/vmstat.h>
32 #include <linux/pfn_t.h>
33 #include <linux/sizes.h>
35 static long dax_map_atomic(struct block_device
*bdev
, struct blk_dax_ctl
*dax
)
37 struct request_queue
*q
= bdev
->bd_queue
;
40 dax
->addr
= (void __pmem
*) ERR_PTR(-EIO
);
41 if (blk_queue_enter(q
, true) != 0)
44 rc
= bdev_direct_access(bdev
, dax
);
46 dax
->addr
= (void __pmem
*) ERR_PTR(rc
);
53 static void dax_unmap_atomic(struct block_device
*bdev
,
54 const struct blk_dax_ctl
*dax
)
56 if (IS_ERR(dax
->addr
))
58 blk_queue_exit(bdev
->bd_queue
);
61 struct page
*read_dax_sector(struct block_device
*bdev
, sector_t n
)
63 struct page
*page
= alloc_pages(GFP_KERNEL
, 0);
64 struct blk_dax_ctl dax
= {
66 .sector
= n
& ~((((int) PAGE_SIZE
) / 512) - 1),
71 return ERR_PTR(-ENOMEM
);
73 rc
= dax_map_atomic(bdev
, &dax
);
76 memcpy_from_pmem(page_address(page
), dax
.addr
, PAGE_SIZE
);
77 dax_unmap_atomic(bdev
, &dax
);
82 * dax_clear_sectors() is called from within transaction context from XFS,
83 * and hence this means the stack from this point must follow GFP_NOFS
84 * semantics for all operations.
86 int dax_clear_sectors(struct block_device
*bdev
, sector_t _sector
, long _size
)
88 struct blk_dax_ctl dax
= {
97 count
= dax_map_atomic(bdev
, &dax
);
100 sz
= min_t(long, count
, SZ_128K
);
101 clear_pmem(dax
.addr
, sz
);
103 dax
.sector
+= sz
/ 512;
104 dax_unmap_atomic(bdev
, &dax
);
111 EXPORT_SYMBOL_GPL(dax_clear_sectors
);
113 /* the clear_pmem() calls are ordered by a wmb_pmem() in the caller */
114 static void dax_new_buf(void __pmem
*addr
, unsigned size
, unsigned first
,
115 loff_t pos
, loff_t end
)
117 loff_t final
= end
- pos
+ first
; /* The final byte of the buffer */
120 clear_pmem(addr
, first
);
122 clear_pmem(addr
+ final
, size
- final
);
125 static bool buffer_written(struct buffer_head
*bh
)
127 return buffer_mapped(bh
) && !buffer_unwritten(bh
);
131 * When ext4 encounters a hole, it returns without modifying the buffer_head
132 * which means that we can't trust b_size. To cope with this, we set b_state
133 * to 0 before calling get_block and, if any bit is set, we know we can trust
134 * b_size. Unfortunate, really, since ext4 knows precisely how long a hole is
135 * and would save us time calling get_block repeatedly.
137 static bool buffer_size_valid(struct buffer_head
*bh
)
139 return bh
->b_state
!= 0;
143 static sector_t
to_sector(const struct buffer_head
*bh
,
144 const struct inode
*inode
)
146 sector_t sector
= bh
->b_blocknr
<< (inode
->i_blkbits
- 9);
151 static ssize_t
dax_io(struct inode
*inode
, struct iov_iter
*iter
,
152 loff_t start
, loff_t end
, get_block_t get_block
,
153 struct buffer_head
*bh
)
155 loff_t pos
= start
, max
= start
, bh_max
= start
;
156 bool hole
= false, need_wmb
= false;
157 struct block_device
*bdev
= NULL
;
158 int rw
= iov_iter_rw(iter
), rc
;
160 struct blk_dax_ctl dax
= {
161 .addr
= (void __pmem
*) ERR_PTR(-EIO
),
165 end
= min(end
, i_size_read(inode
));
170 unsigned blkbits
= inode
->i_blkbits
;
171 long page
= pos
>> PAGE_SHIFT
;
172 sector_t block
= page
<< (PAGE_SHIFT
- blkbits
);
173 unsigned first
= pos
- (block
<< blkbits
);
177 bh
->b_size
= PAGE_ALIGN(end
- pos
);
179 rc
= get_block(inode
, block
, bh
, rw
== WRITE
);
182 if (!buffer_size_valid(bh
))
183 bh
->b_size
= 1 << blkbits
;
184 bh_max
= pos
- first
+ bh
->b_size
;
187 unsigned done
= bh
->b_size
-
188 (bh_max
- (pos
- first
));
189 bh
->b_blocknr
+= done
>> blkbits
;
193 hole
= rw
== READ
&& !buffer_written(bh
);
195 size
= bh
->b_size
- first
;
197 dax_unmap_atomic(bdev
, &dax
);
198 dax
.sector
= to_sector(bh
, inode
);
199 dax
.size
= bh
->b_size
;
200 map_len
= dax_map_atomic(bdev
, &dax
);
205 if (buffer_unwritten(bh
) || buffer_new(bh
)) {
206 dax_new_buf(dax
.addr
, map_len
, first
,
211 size
= map_len
- first
;
213 max
= min(pos
+ size
, end
);
216 if (iov_iter_rw(iter
) == WRITE
) {
217 len
= copy_from_iter_pmem(dax
.addr
, max
- pos
, iter
);
220 len
= copy_to_iter((void __force
*) dax
.addr
, max
- pos
,
223 len
= iov_iter_zero(max
- pos
, iter
);
231 if (!IS_ERR(dax
.addr
))
237 dax_unmap_atomic(bdev
, &dax
);
239 return (pos
== start
) ? rc
: pos
- start
;
243 * dax_do_io - Perform I/O to a DAX file
244 * @iocb: The control block for this I/O
245 * @inode: The file which the I/O is directed at
246 * @iter: The addresses to do I/O from or to
247 * @pos: The file offset where the I/O starts
248 * @get_block: The filesystem method used to translate file offsets to blocks
249 * @end_io: A filesystem callback for I/O completion
252 * This function uses the same locking scheme as do_blockdev_direct_IO:
253 * If @flags has DIO_LOCKING set, we assume that the i_mutex is held by the
254 * caller for writes. For reads, we take and release the i_mutex ourselves.
255 * If DIO_LOCKING is not set, the filesystem takes care of its own locking.
256 * As with do_blockdev_direct_IO(), we increment i_dio_count while the I/O
259 ssize_t
dax_do_io(struct kiocb
*iocb
, struct inode
*inode
,
260 struct iov_iter
*iter
, loff_t pos
, get_block_t get_block
,
261 dio_iodone_t end_io
, int flags
)
263 struct buffer_head bh
;
264 ssize_t retval
= -EINVAL
;
265 loff_t end
= pos
+ iov_iter_count(iter
);
267 memset(&bh
, 0, sizeof(bh
));
268 bh
.b_bdev
= inode
->i_sb
->s_bdev
;
270 if ((flags
& DIO_LOCKING
) && iov_iter_rw(iter
) == READ
) {
271 struct address_space
*mapping
= inode
->i_mapping
;
273 retval
= filemap_write_and_wait_range(mapping
, pos
, end
- 1);
280 /* Protects against truncate */
281 if (!(flags
& DIO_SKIP_DIO_COUNT
))
282 inode_dio_begin(inode
);
284 retval
= dax_io(inode
, iter
, pos
, end
, get_block
, &bh
);
286 if ((flags
& DIO_LOCKING
) && iov_iter_rw(iter
) == READ
)
292 err
= end_io(iocb
, pos
, retval
, bh
.b_private
);
297 if (!(flags
& DIO_SKIP_DIO_COUNT
))
298 inode_dio_end(inode
);
302 EXPORT_SYMBOL_GPL(dax_do_io
);
305 * The user has performed a load from a hole in the file. Allocating
306 * a new page in the file would cause excessive storage usage for
307 * workloads with sparse files. We allocate a page cache page instead.
308 * We'll kick it out of the page cache if it's ever written to,
309 * otherwise it will simply fall out of the page cache under memory
310 * pressure without ever having been dirtied.
312 static int dax_load_hole(struct address_space
*mapping
, struct page
*page
,
313 struct vm_fault
*vmf
)
316 struct inode
*inode
= mapping
->host
;
318 page
= find_or_create_page(mapping
, vmf
->pgoff
,
319 GFP_KERNEL
| __GFP_ZERO
);
322 /* Recheck i_size under page lock to avoid truncate race */
323 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
324 if (vmf
->pgoff
>= size
) {
327 return VM_FAULT_SIGBUS
;
331 return VM_FAULT_LOCKED
;
334 static int copy_user_bh(struct page
*to
, struct inode
*inode
,
335 struct buffer_head
*bh
, unsigned long vaddr
)
337 struct blk_dax_ctl dax
= {
338 .sector
= to_sector(bh
, inode
),
341 struct block_device
*bdev
= bh
->b_bdev
;
344 if (dax_map_atomic(bdev
, &dax
) < 0)
345 return PTR_ERR(dax
.addr
);
346 vto
= kmap_atomic(to
);
347 copy_user_page(vto
, (void __force
*)dax
.addr
, vaddr
, to
);
349 dax_unmap_atomic(bdev
, &dax
);
354 #define DAX_PMD_INDEX(page_index) (page_index & (PMD_MASK >> PAGE_SHIFT))
356 static int dax_radix_entry(struct address_space
*mapping
, pgoff_t index
,
357 sector_t sector
, bool pmd_entry
, bool dirty
)
359 struct radix_tree_root
*page_tree
= &mapping
->page_tree
;
360 pgoff_t pmd_index
= DAX_PMD_INDEX(index
);
364 WARN_ON_ONCE(pmd_entry
&& !dirty
);
366 __mark_inode_dirty(mapping
->host
, I_DIRTY_PAGES
);
368 spin_lock_irq(&mapping
->tree_lock
);
370 entry
= radix_tree_lookup(page_tree
, pmd_index
);
371 if (entry
&& RADIX_DAX_TYPE(entry
) == RADIX_DAX_PMD
) {
376 entry
= radix_tree_lookup(page_tree
, index
);
378 type
= RADIX_DAX_TYPE(entry
);
379 if (WARN_ON_ONCE(type
!= RADIX_DAX_PTE
&&
380 type
!= RADIX_DAX_PMD
)) {
385 if (!pmd_entry
|| type
== RADIX_DAX_PMD
)
389 * We only insert dirty PMD entries into the radix tree. This
390 * means we don't need to worry about removing a dirty PTE
391 * entry and inserting a clean PMD entry, thus reducing the
392 * range we would flush with a follow-up fsync/msync call.
394 radix_tree_delete(&mapping
->page_tree
, index
);
395 mapping
->nrexceptional
--;
398 if (sector
== NO_SECTOR
) {
400 * This can happen during correct operation if our pfn_mkwrite
401 * fault raced against a hole punch operation. If this
402 * happens the pte that was hole punched will have been
403 * unmapped and the radix tree entry will have been removed by
404 * the time we are called, but the call will still happen. We
405 * will return all the way up to wp_pfn_shared(), where the
406 * pte_same() check will fail, eventually causing page fault
407 * to be retried by the CPU.
412 error
= radix_tree_insert(page_tree
, index
,
413 RADIX_DAX_ENTRY(sector
, pmd_entry
));
417 mapping
->nrexceptional
++;
420 radix_tree_tag_set(page_tree
, index
, PAGECACHE_TAG_DIRTY
);
422 spin_unlock_irq(&mapping
->tree_lock
);
426 static int dax_writeback_one(struct block_device
*bdev
,
427 struct address_space
*mapping
, pgoff_t index
, void *entry
)
429 struct radix_tree_root
*page_tree
= &mapping
->page_tree
;
430 int type
= RADIX_DAX_TYPE(entry
);
431 struct radix_tree_node
*node
;
432 struct blk_dax_ctl dax
;
436 spin_lock_irq(&mapping
->tree_lock
);
438 * Regular page slots are stabilized by the page lock even
439 * without the tree itself locked. These unlocked entries
440 * need verification under the tree lock.
442 if (!__radix_tree_lookup(page_tree
, index
, &node
, &slot
))
447 /* another fsync thread may have already written back this entry */
448 if (!radix_tree_tag_get(page_tree
, index
, PAGECACHE_TAG_TOWRITE
))
451 if (WARN_ON_ONCE(type
!= RADIX_DAX_PTE
&& type
!= RADIX_DAX_PMD
)) {
456 dax
.sector
= RADIX_DAX_SECTOR(entry
);
457 dax
.size
= (type
== RADIX_DAX_PMD
? PMD_SIZE
: PAGE_SIZE
);
458 spin_unlock_irq(&mapping
->tree_lock
);
461 * We cannot hold tree_lock while calling dax_map_atomic() because it
462 * eventually calls cond_resched().
464 ret
= dax_map_atomic(bdev
, &dax
);
468 if (WARN_ON_ONCE(ret
< dax
.size
)) {
473 wb_cache_pmem(dax
.addr
, dax
.size
);
475 spin_lock_irq(&mapping
->tree_lock
);
476 radix_tree_tag_clear(page_tree
, index
, PAGECACHE_TAG_TOWRITE
);
477 spin_unlock_irq(&mapping
->tree_lock
);
479 dax_unmap_atomic(bdev
, &dax
);
483 spin_unlock_irq(&mapping
->tree_lock
);
488 * Flush the mapping to the persistent domain within the byte range of [start,
489 * end]. This is required by data integrity operations to ensure file data is
490 * on persistent storage prior to completion of the operation.
492 int dax_writeback_mapping_range(struct address_space
*mapping
,
493 struct block_device
*bdev
, struct writeback_control
*wbc
)
495 struct inode
*inode
= mapping
->host
;
496 pgoff_t start_index
, end_index
, pmd_index
;
497 pgoff_t indices
[PAGEVEC_SIZE
];
503 if (WARN_ON_ONCE(inode
->i_blkbits
!= PAGE_SHIFT
))
506 if (!mapping
->nrexceptional
|| wbc
->sync_mode
!= WB_SYNC_ALL
)
509 start_index
= wbc
->range_start
>> PAGE_SHIFT
;
510 end_index
= wbc
->range_end
>> PAGE_SHIFT
;
511 pmd_index
= DAX_PMD_INDEX(start_index
);
514 entry
= radix_tree_lookup(&mapping
->page_tree
, pmd_index
);
517 /* see if the start of our range is covered by a PMD entry */
518 if (entry
&& RADIX_DAX_TYPE(entry
) == RADIX_DAX_PMD
)
519 start_index
= pmd_index
;
521 tag_pages_for_writeback(mapping
, start_index
, end_index
);
523 pagevec_init(&pvec
, 0);
525 pvec
.nr
= find_get_entries_tag(mapping
, start_index
,
526 PAGECACHE_TAG_TOWRITE
, PAGEVEC_SIZE
,
527 pvec
.pages
, indices
);
532 for (i
= 0; i
< pvec
.nr
; i
++) {
533 if (indices
[i
] > end_index
) {
538 ret
= dax_writeback_one(bdev
, mapping
, indices
[i
],
547 EXPORT_SYMBOL_GPL(dax_writeback_mapping_range
);
549 static int dax_insert_mapping(struct inode
*inode
, struct buffer_head
*bh
,
550 struct vm_area_struct
*vma
, struct vm_fault
*vmf
)
552 unsigned long vaddr
= (unsigned long)vmf
->virtual_address
;
553 struct address_space
*mapping
= inode
->i_mapping
;
554 struct block_device
*bdev
= bh
->b_bdev
;
555 struct blk_dax_ctl dax
= {
556 .sector
= to_sector(bh
, inode
),
562 i_mmap_lock_read(mapping
);
565 * Check truncate didn't happen while we were allocating a block.
566 * If it did, this block may or may not be still allocated to the
567 * file. We can't tell the filesystem to free it because we can't
568 * take i_mutex here. In the worst case, the file still has blocks
569 * allocated past the end of the file.
571 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
572 if (unlikely(vmf
->pgoff
>= size
)) {
577 if (dax_map_atomic(bdev
, &dax
) < 0) {
578 error
= PTR_ERR(dax
.addr
);
582 if (buffer_unwritten(bh
) || buffer_new(bh
)) {
583 clear_pmem(dax
.addr
, PAGE_SIZE
);
586 dax_unmap_atomic(bdev
, &dax
);
588 error
= dax_radix_entry(mapping
, vmf
->pgoff
, dax
.sector
, false,
589 vmf
->flags
& FAULT_FLAG_WRITE
);
593 error
= vm_insert_mixed(vma
, vaddr
, dax
.pfn
);
596 i_mmap_unlock_read(mapping
);
602 * __dax_fault - handle a page fault on a DAX file
603 * @vma: The virtual memory area where the fault occurred
604 * @vmf: The description of the fault
605 * @get_block: The filesystem method used to translate file offsets to blocks
606 * @complete_unwritten: The filesystem method used to convert unwritten blocks
607 * to written so the data written to them is exposed. This is required for
608 * required by write faults for filesystems that will return unwritten
609 * extent mappings from @get_block, but it is optional for reads as
610 * dax_insert_mapping() will always zero unwritten blocks. If the fs does
611 * not support unwritten extents, the it should pass NULL.
613 * When a page fault occurs, filesystems may call this helper in their
614 * fault handler for DAX files. __dax_fault() assumes the caller has done all
615 * the necessary locking for the page fault to proceed successfully.
617 int __dax_fault(struct vm_area_struct
*vma
, struct vm_fault
*vmf
,
618 get_block_t get_block
, dax_iodone_t complete_unwritten
)
620 struct file
*file
= vma
->vm_file
;
621 struct address_space
*mapping
= file
->f_mapping
;
622 struct inode
*inode
= mapping
->host
;
624 struct buffer_head bh
;
625 unsigned long vaddr
= (unsigned long)vmf
->virtual_address
;
626 unsigned blkbits
= inode
->i_blkbits
;
632 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
633 if (vmf
->pgoff
>= size
)
634 return VM_FAULT_SIGBUS
;
636 memset(&bh
, 0, sizeof(bh
));
637 block
= (sector_t
)vmf
->pgoff
<< (PAGE_SHIFT
- blkbits
);
638 bh
.b_bdev
= inode
->i_sb
->s_bdev
;
639 bh
.b_size
= PAGE_SIZE
;
642 page
= find_get_page(mapping
, vmf
->pgoff
);
644 if (!lock_page_or_retry(page
, vma
->vm_mm
, vmf
->flags
)) {
646 return VM_FAULT_RETRY
;
648 if (unlikely(page
->mapping
!= mapping
)) {
653 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
654 if (unlikely(vmf
->pgoff
>= size
)) {
656 * We have a struct page covering a hole in the file
657 * from a read fault and we've raced with a truncate
664 error
= get_block(inode
, block
, &bh
, 0);
665 if (!error
&& (bh
.b_size
< PAGE_SIZE
))
666 error
= -EIO
; /* fs corruption? */
670 if (!buffer_mapped(&bh
) && !buffer_unwritten(&bh
) && !vmf
->cow_page
) {
671 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
672 error
= get_block(inode
, block
, &bh
, 1);
673 count_vm_event(PGMAJFAULT
);
674 mem_cgroup_count_vm_event(vma
->vm_mm
, PGMAJFAULT
);
675 major
= VM_FAULT_MAJOR
;
676 if (!error
&& (bh
.b_size
< PAGE_SIZE
))
681 return dax_load_hole(mapping
, page
, vmf
);
686 struct page
*new_page
= vmf
->cow_page
;
687 if (buffer_written(&bh
))
688 error
= copy_user_bh(new_page
, inode
, &bh
, vaddr
);
690 clear_user_highpage(new_page
, vaddr
);
695 i_mmap_lock_read(mapping
);
696 /* Check we didn't race with truncate */
697 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >>
699 if (vmf
->pgoff
>= size
) {
700 i_mmap_unlock_read(mapping
);
705 return VM_FAULT_LOCKED
;
708 /* Check we didn't race with a read fault installing a new page */
710 page
= find_lock_page(mapping
, vmf
->pgoff
);
713 unmap_mapping_range(mapping
, vmf
->pgoff
<< PAGE_SHIFT
,
715 delete_from_page_cache(page
);
722 * If we successfully insert the new mapping over an unwritten extent,
723 * we need to ensure we convert the unwritten extent. If there is an
724 * error inserting the mapping, the filesystem needs to leave it as
725 * unwritten to prevent exposure of the stale underlying data to
726 * userspace, but we still need to call the completion function so
727 * the private resources on the mapping buffer can be released. We
728 * indicate what the callback should do via the uptodate variable, same
729 * as for normal BH based IO completions.
731 error
= dax_insert_mapping(inode
, &bh
, vma
, vmf
);
732 if (buffer_unwritten(&bh
)) {
733 if (complete_unwritten
)
734 complete_unwritten(&bh
, !error
);
736 WARN_ON_ONCE(!(vmf
->flags
& FAULT_FLAG_WRITE
));
740 if (error
== -ENOMEM
)
741 return VM_FAULT_OOM
| major
;
742 /* -EBUSY is fine, somebody else faulted on the same PTE */
743 if ((error
< 0) && (error
!= -EBUSY
))
744 return VM_FAULT_SIGBUS
| major
;
745 return VM_FAULT_NOPAGE
| major
;
754 EXPORT_SYMBOL(__dax_fault
);
757 * dax_fault - handle a page fault on a DAX file
758 * @vma: The virtual memory area where the fault occurred
759 * @vmf: The description of the fault
760 * @get_block: The filesystem method used to translate file offsets to blocks
762 * When a page fault occurs, filesystems may call this helper in their
763 * fault handler for DAX files.
765 int dax_fault(struct vm_area_struct
*vma
, struct vm_fault
*vmf
,
766 get_block_t get_block
, dax_iodone_t complete_unwritten
)
769 struct super_block
*sb
= file_inode(vma
->vm_file
)->i_sb
;
771 if (vmf
->flags
& FAULT_FLAG_WRITE
) {
772 sb_start_pagefault(sb
);
773 file_update_time(vma
->vm_file
);
775 result
= __dax_fault(vma
, vmf
, get_block
, complete_unwritten
);
776 if (vmf
->flags
& FAULT_FLAG_WRITE
)
777 sb_end_pagefault(sb
);
781 EXPORT_SYMBOL_GPL(dax_fault
);
783 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
785 * The 'colour' (ie low bits) within a PMD of a page offset. This comes up
786 * more often than one might expect in the below function.
788 #define PG_PMD_COLOUR ((PMD_SIZE >> PAGE_SHIFT) - 1)
790 static void __dax_dbg(struct buffer_head
*bh
, unsigned long address
,
791 const char *reason
, const char *fn
)
794 char bname
[BDEVNAME_SIZE
];
795 bdevname(bh
->b_bdev
, bname
);
796 pr_debug("%s: %s addr: %lx dev %s state %lx start %lld "
797 "length %zd fallback: %s\n", fn
, current
->comm
,
798 address
, bname
, bh
->b_state
, (u64
)bh
->b_blocknr
,
801 pr_debug("%s: %s addr: %lx fallback: %s\n", fn
,
802 current
->comm
, address
, reason
);
806 #define dax_pmd_dbg(bh, address, reason) __dax_dbg(bh, address, reason, "dax_pmd")
808 int __dax_pmd_fault(struct vm_area_struct
*vma
, unsigned long address
,
809 pmd_t
*pmd
, unsigned int flags
, get_block_t get_block
,
810 dax_iodone_t complete_unwritten
)
812 struct file
*file
= vma
->vm_file
;
813 struct address_space
*mapping
= file
->f_mapping
;
814 struct inode
*inode
= mapping
->host
;
815 struct buffer_head bh
;
816 unsigned blkbits
= inode
->i_blkbits
;
817 unsigned long pmd_addr
= address
& PMD_MASK
;
818 bool write
= flags
& FAULT_FLAG_WRITE
;
819 struct block_device
*bdev
;
822 int error
, result
= 0;
825 /* dax pmd mappings require pfn_t_devmap() */
826 if (!IS_ENABLED(CONFIG_FS_DAX_PMD
))
827 return VM_FAULT_FALLBACK
;
829 /* Fall back to PTEs if we're going to COW */
830 if (write
&& !(vma
->vm_flags
& VM_SHARED
)) {
831 split_huge_pmd(vma
, pmd
, address
);
832 dax_pmd_dbg(NULL
, address
, "cow write");
833 return VM_FAULT_FALLBACK
;
835 /* If the PMD would extend outside the VMA */
836 if (pmd_addr
< vma
->vm_start
) {
837 dax_pmd_dbg(NULL
, address
, "vma start unaligned");
838 return VM_FAULT_FALLBACK
;
840 if ((pmd_addr
+ PMD_SIZE
) > vma
->vm_end
) {
841 dax_pmd_dbg(NULL
, address
, "vma end unaligned");
842 return VM_FAULT_FALLBACK
;
845 pgoff
= linear_page_index(vma
, pmd_addr
);
846 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
848 return VM_FAULT_SIGBUS
;
849 /* If the PMD would cover blocks out of the file */
850 if ((pgoff
| PG_PMD_COLOUR
) >= size
) {
851 dax_pmd_dbg(NULL
, address
,
852 "offset + huge page size > file size");
853 return VM_FAULT_FALLBACK
;
856 memset(&bh
, 0, sizeof(bh
));
857 bh
.b_bdev
= inode
->i_sb
->s_bdev
;
858 block
= (sector_t
)pgoff
<< (PAGE_SHIFT
- blkbits
);
860 bh
.b_size
= PMD_SIZE
;
862 if (get_block(inode
, block
, &bh
, 0) != 0)
863 return VM_FAULT_SIGBUS
;
865 if (!buffer_mapped(&bh
) && write
) {
866 if (get_block(inode
, block
, &bh
, 1) != 0)
867 return VM_FAULT_SIGBUS
;
874 * If the filesystem isn't willing to tell us the length of a hole,
875 * just fall back to PTEs. Calling get_block 512 times in a loop
878 if (!buffer_size_valid(&bh
) || bh
.b_size
< PMD_SIZE
) {
879 dax_pmd_dbg(&bh
, address
, "allocated block too small");
880 return VM_FAULT_FALLBACK
;
884 * If we allocated new storage, make sure no process has any
885 * zero pages covering this hole
888 loff_t lstart
= pgoff
<< PAGE_SHIFT
;
889 loff_t lend
= lstart
+ PMD_SIZE
- 1; /* inclusive */
891 truncate_pagecache_range(inode
, lstart
, lend
);
894 i_mmap_lock_read(mapping
);
897 * If a truncate happened while we were allocating blocks, we may
898 * leave blocks allocated to the file that are beyond EOF. We can't
899 * take i_mutex here, so just leave them hanging; they'll be freed
900 * when the file is deleted.
902 size
= (i_size_read(inode
) + PAGE_SIZE
- 1) >> PAGE_SHIFT
;
904 result
= VM_FAULT_SIGBUS
;
907 if ((pgoff
| PG_PMD_COLOUR
) >= size
) {
908 dax_pmd_dbg(&bh
, address
,
909 "offset + huge page size > file size");
913 if (!write
&& !buffer_mapped(&bh
) && buffer_uptodate(&bh
)) {
916 struct page
*zero_page
= get_huge_zero_page();
918 if (unlikely(!zero_page
)) {
919 dax_pmd_dbg(&bh
, address
, "no zero page");
923 ptl
= pmd_lock(vma
->vm_mm
, pmd
);
924 if (!pmd_none(*pmd
)) {
926 dax_pmd_dbg(&bh
, address
, "pmd already present");
930 dev_dbg(part_to_dev(bdev
->bd_part
),
931 "%s: %s addr: %lx pfn: <zero> sect: %llx\n",
932 __func__
, current
->comm
, address
,
933 (unsigned long long) to_sector(&bh
, inode
));
935 entry
= mk_pmd(zero_page
, vma
->vm_page_prot
);
936 entry
= pmd_mkhuge(entry
);
937 set_pmd_at(vma
->vm_mm
, pmd_addr
, pmd
, entry
);
938 result
= VM_FAULT_NOPAGE
;
941 struct blk_dax_ctl dax
= {
942 .sector
= to_sector(&bh
, inode
),
945 long length
= dax_map_atomic(bdev
, &dax
);
948 result
= VM_FAULT_SIGBUS
;
951 if (length
< PMD_SIZE
) {
952 dax_pmd_dbg(&bh
, address
, "dax-length too small");
953 dax_unmap_atomic(bdev
, &dax
);
956 if (pfn_t_to_pfn(dax
.pfn
) & PG_PMD_COLOUR
) {
957 dax_pmd_dbg(&bh
, address
, "pfn unaligned");
958 dax_unmap_atomic(bdev
, &dax
);
962 if (!pfn_t_devmap(dax
.pfn
)) {
963 dax_unmap_atomic(bdev
, &dax
);
964 dax_pmd_dbg(&bh
, address
, "pfn not in memmap");
968 if (buffer_unwritten(&bh
) || buffer_new(&bh
)) {
969 clear_pmem(dax
.addr
, PMD_SIZE
);
971 count_vm_event(PGMAJFAULT
);
972 mem_cgroup_count_vm_event(vma
->vm_mm
, PGMAJFAULT
);
973 result
|= VM_FAULT_MAJOR
;
975 dax_unmap_atomic(bdev
, &dax
);
978 * For PTE faults we insert a radix tree entry for reads, and
979 * leave it clean. Then on the first write we dirty the radix
980 * tree entry via the dax_pfn_mkwrite() path. This sequence
981 * allows the dax_pfn_mkwrite() call to be simpler and avoid a
982 * call into get_block() to translate the pgoff to a sector in
983 * order to be able to create a new radix tree entry.
985 * The PMD path doesn't have an equivalent to
986 * dax_pfn_mkwrite(), though, so for a read followed by a
987 * write we traverse all the way through __dax_pmd_fault()
988 * twice. This means we can just skip inserting a radix tree
989 * entry completely on the initial read and just wait until
990 * the write to insert a dirty entry.
993 error
= dax_radix_entry(mapping
, pgoff
, dax
.sector
,
996 dax_pmd_dbg(&bh
, address
,
997 "PMD radix insertion failed");
1002 dev_dbg(part_to_dev(bdev
->bd_part
),
1003 "%s: %s addr: %lx pfn: %lx sect: %llx\n",
1004 __func__
, current
->comm
, address
,
1005 pfn_t_to_pfn(dax
.pfn
),
1006 (unsigned long long) dax
.sector
);
1007 result
|= vmf_insert_pfn_pmd(vma
, address
, pmd
,
1012 i_mmap_unlock_read(mapping
);
1014 if (buffer_unwritten(&bh
))
1015 complete_unwritten(&bh
, !(result
& VM_FAULT_ERROR
));
1020 count_vm_event(THP_FAULT_FALLBACK
);
1021 result
= VM_FAULT_FALLBACK
;
1024 EXPORT_SYMBOL_GPL(__dax_pmd_fault
);
1027 * dax_pmd_fault - handle a PMD fault on a DAX file
1028 * @vma: The virtual memory area where the fault occurred
1029 * @vmf: The description of the fault
1030 * @get_block: The filesystem method used to translate file offsets to blocks
1032 * When a page fault occurs, filesystems may call this helper in their
1033 * pmd_fault handler for DAX files.
1035 int dax_pmd_fault(struct vm_area_struct
*vma
, unsigned long address
,
1036 pmd_t
*pmd
, unsigned int flags
, get_block_t get_block
,
1037 dax_iodone_t complete_unwritten
)
1040 struct super_block
*sb
= file_inode(vma
->vm_file
)->i_sb
;
1042 if (flags
& FAULT_FLAG_WRITE
) {
1043 sb_start_pagefault(sb
);
1044 file_update_time(vma
->vm_file
);
1046 result
= __dax_pmd_fault(vma
, address
, pmd
, flags
, get_block
,
1047 complete_unwritten
);
1048 if (flags
& FAULT_FLAG_WRITE
)
1049 sb_end_pagefault(sb
);
1053 EXPORT_SYMBOL_GPL(dax_pmd_fault
);
1054 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1057 * dax_pfn_mkwrite - handle first write to DAX page
1058 * @vma: The virtual memory area where the fault occurred
1059 * @vmf: The description of the fault
1061 int dax_pfn_mkwrite(struct vm_area_struct
*vma
, struct vm_fault
*vmf
)
1063 struct file
*file
= vma
->vm_file
;
1067 * We pass NO_SECTOR to dax_radix_entry() because we expect that a
1068 * RADIX_DAX_PTE entry already exists in the radix tree from a
1069 * previous call to __dax_fault(). We just want to look up that PTE
1070 * entry using vmf->pgoff and make sure the dirty tag is set. This
1071 * saves us from having to make a call to get_block() here to look
1074 error
= dax_radix_entry(file
->f_mapping
, vmf
->pgoff
, NO_SECTOR
, false,
1077 if (error
== -ENOMEM
)
1078 return VM_FAULT_OOM
;
1080 return VM_FAULT_SIGBUS
;
1081 return VM_FAULT_NOPAGE
;
1083 EXPORT_SYMBOL_GPL(dax_pfn_mkwrite
);
1086 * dax_zero_page_range - zero a range within a page of a DAX file
1087 * @inode: The file being truncated
1088 * @from: The file offset that is being truncated to
1089 * @length: The number of bytes to zero
1090 * @get_block: The filesystem method used to translate file offsets to blocks
1092 * This function can be called by a filesystem when it is zeroing part of a
1093 * page in a DAX file. This is intended for hole-punch operations. If
1094 * you are truncating a file, the helper function dax_truncate_page() may be
1097 * We work in terms of PAGE_SIZE here for commonality with
1098 * block_truncate_page(), but we could go down to PAGE_SIZE if the filesystem
1099 * took care of disposing of the unnecessary blocks. Even if the filesystem
1100 * block size is smaller than PAGE_SIZE, we have to zero the rest of the page
1101 * since the file might be mmapped.
1103 int dax_zero_page_range(struct inode
*inode
, loff_t from
, unsigned length
,
1104 get_block_t get_block
)
1106 struct buffer_head bh
;
1107 pgoff_t index
= from
>> PAGE_SHIFT
;
1108 unsigned offset
= from
& (PAGE_SIZE
-1);
1111 /* Block boundary? Nothing to do */
1114 BUG_ON((offset
+ length
) > PAGE_SIZE
);
1116 memset(&bh
, 0, sizeof(bh
));
1117 bh
.b_bdev
= inode
->i_sb
->s_bdev
;
1118 bh
.b_size
= PAGE_SIZE
;
1119 err
= get_block(inode
, index
, &bh
, 0);
1122 if (buffer_written(&bh
)) {
1123 struct block_device
*bdev
= bh
.b_bdev
;
1124 struct blk_dax_ctl dax
= {
1125 .sector
= to_sector(&bh
, inode
),
1129 if (dax_map_atomic(bdev
, &dax
) < 0)
1130 return PTR_ERR(dax
.addr
);
1131 clear_pmem(dax
.addr
+ offset
, length
);
1133 dax_unmap_atomic(bdev
, &dax
);
1138 EXPORT_SYMBOL_GPL(dax_zero_page_range
);
1141 * dax_truncate_page - handle a partial page being truncated in a DAX file
1142 * @inode: The file being truncated
1143 * @from: The file offset that is being truncated to
1144 * @get_block: The filesystem method used to translate file offsets to blocks
1146 * Similar to block_truncate_page(), this function can be called by a
1147 * filesystem when it is truncating a DAX file to handle the partial page.
1149 * We work in terms of PAGE_SIZE here for commonality with
1150 * block_truncate_page(), but we could go down to PAGE_SIZE if the filesystem
1151 * took care of disposing of the unnecessary blocks. Even if the filesystem
1152 * block size is smaller than PAGE_SIZE, we have to zero the rest of the page
1153 * since the file might be mmapped.
1155 int dax_truncate_page(struct inode
*inode
, loff_t from
, get_block_t get_block
)
1157 unsigned length
= PAGE_ALIGN(from
) - from
;
1158 return dax_zero_page_range(inode
, from
, length
, get_block
);
1160 EXPORT_SYMBOL_GPL(dax_truncate_page
);