1 // SPDX-License-Identifier: GPL-2.0-only
3 * fs/dax.c - Direct Access filesystem code
4 * Copyright (c) 2013-2014 Intel Corporation
5 * Author: Matthew Wilcox <matthew.r.wilcox@intel.com>
6 * Author: Ross Zwisler <ross.zwisler@linux.intel.com>
9 #include <linux/atomic.h>
10 #include <linux/blkdev.h>
11 #include <linux/buffer_head.h>
12 #include <linux/dax.h>
14 #include <linux/genhd.h>
15 #include <linux/highmem.h>
16 #include <linux/memcontrol.h>
18 #include <linux/mutex.h>
19 #include <linux/pagevec.h>
20 #include <linux/sched.h>
21 #include <linux/sched/signal.h>
22 #include <linux/uio.h>
23 #include <linux/vmstat.h>
24 #include <linux/pfn_t.h>
25 #include <linux/sizes.h>
26 #include <linux/mmu_notifier.h>
27 #include <linux/iomap.h>
28 #include <asm/pgalloc.h>
30 #define CREATE_TRACE_POINTS
31 #include <trace/events/fs_dax.h>
33 static inline unsigned int pe_order(enum page_entry_size pe_size
)
35 if (pe_size
== PE_SIZE_PTE
)
36 return PAGE_SHIFT
- PAGE_SHIFT
;
37 if (pe_size
== PE_SIZE_PMD
)
38 return PMD_SHIFT
- PAGE_SHIFT
;
39 if (pe_size
== PE_SIZE_PUD
)
40 return PUD_SHIFT
- PAGE_SHIFT
;
44 /* We choose 4096 entries - same as per-zone page wait tables */
45 #define DAX_WAIT_TABLE_BITS 12
46 #define DAX_WAIT_TABLE_ENTRIES (1 << DAX_WAIT_TABLE_BITS)
48 /* The 'colour' (ie low bits) within a PMD of a page offset. */
49 #define PG_PMD_COLOUR ((PMD_SIZE >> PAGE_SHIFT) - 1)
50 #define PG_PMD_NR (PMD_SIZE >> PAGE_SHIFT)
52 /* The order of a PMD entry */
53 #define PMD_ORDER (PMD_SHIFT - PAGE_SHIFT)
55 static wait_queue_head_t wait_table
[DAX_WAIT_TABLE_ENTRIES
];
57 static int __init
init_dax_wait_table(void)
61 for (i
= 0; i
< DAX_WAIT_TABLE_ENTRIES
; i
++)
62 init_waitqueue_head(wait_table
+ i
);
65 fs_initcall(init_dax_wait_table
);
68 * DAX pagecache entries use XArray value entries so they can't be mistaken
69 * for pages. We use one bit for locking, one bit for the entry size (PMD)
70 * and two more to tell us if the entry is a zero page or an empty entry that
71 * is just used for locking. In total four special bits.
73 * If the PMD bit isn't set the entry has size PAGE_SIZE, and if the ZERO_PAGE
74 * and EMPTY bits aren't set the entry is a normal DAX entry with a filesystem
78 #define DAX_LOCKED (1UL << 0)
79 #define DAX_PMD (1UL << 1)
80 #define DAX_ZERO_PAGE (1UL << 2)
81 #define DAX_EMPTY (1UL << 3)
83 static unsigned long dax_to_pfn(void *entry
)
85 return xa_to_value(entry
) >> DAX_SHIFT
;
88 static void *dax_make_entry(pfn_t pfn
, unsigned long flags
)
90 return xa_mk_value(flags
| (pfn_t_to_pfn(pfn
) << DAX_SHIFT
));
93 static bool dax_is_locked(void *entry
)
95 return xa_to_value(entry
) & DAX_LOCKED
;
98 static unsigned int dax_entry_order(void *entry
)
100 if (xa_to_value(entry
) & DAX_PMD
)
105 static unsigned long dax_is_pmd_entry(void *entry
)
107 return xa_to_value(entry
) & DAX_PMD
;
110 static bool dax_is_pte_entry(void *entry
)
112 return !(xa_to_value(entry
) & DAX_PMD
);
115 static int dax_is_zero_entry(void *entry
)
117 return xa_to_value(entry
) & DAX_ZERO_PAGE
;
120 static int dax_is_empty_entry(void *entry
)
122 return xa_to_value(entry
) & DAX_EMPTY
;
126 * true if the entry that was found is of a smaller order than the entry
127 * we were looking for
129 static bool dax_is_conflict(void *entry
)
131 return entry
== XA_RETRY_ENTRY
;
135 * DAX page cache entry locking
137 struct exceptional_entry_key
{
142 struct wait_exceptional_entry_queue
{
143 wait_queue_entry_t wait
;
144 struct exceptional_entry_key key
;
148 * enum dax_wake_mode: waitqueue wakeup behaviour
149 * @WAKE_ALL: wake all waiters in the waitqueue
150 * @WAKE_NEXT: wake only the first waiter in the waitqueue
157 static wait_queue_head_t
*dax_entry_waitqueue(struct xa_state
*xas
,
158 void *entry
, struct exceptional_entry_key
*key
)
161 unsigned long index
= xas
->xa_index
;
164 * If 'entry' is a PMD, align the 'index' that we use for the wait
165 * queue to the start of that PMD. This ensures that all offsets in
166 * the range covered by the PMD map to the same bit lock.
168 if (dax_is_pmd_entry(entry
))
169 index
&= ~PG_PMD_COLOUR
;
171 key
->entry_start
= index
;
173 hash
= hash_long((unsigned long)xas
->xa
^ index
, DAX_WAIT_TABLE_BITS
);
174 return wait_table
+ hash
;
177 static int wake_exceptional_entry_func(wait_queue_entry_t
*wait
,
178 unsigned int mode
, int sync
, void *keyp
)
180 struct exceptional_entry_key
*key
= keyp
;
181 struct wait_exceptional_entry_queue
*ewait
=
182 container_of(wait
, struct wait_exceptional_entry_queue
, wait
);
184 if (key
->xa
!= ewait
->key
.xa
||
185 key
->entry_start
!= ewait
->key
.entry_start
)
187 return autoremove_wake_function(wait
, mode
, sync
, NULL
);
191 * @entry may no longer be the entry at the index in the mapping.
192 * The important information it's conveying is whether the entry at
193 * this index used to be a PMD entry.
195 static void dax_wake_entry(struct xa_state
*xas
, void *entry
,
196 enum dax_wake_mode mode
)
198 struct exceptional_entry_key key
;
199 wait_queue_head_t
*wq
;
201 wq
= dax_entry_waitqueue(xas
, entry
, &key
);
204 * Checking for locked entry and prepare_to_wait_exclusive() happens
205 * under the i_pages lock, ditto for entry handling in our callers.
206 * So at this point all tasks that could have seen our entry locked
207 * must be in the waitqueue and the following check will see them.
209 if (waitqueue_active(wq
))
210 __wake_up(wq
, TASK_NORMAL
, mode
== WAKE_ALL
? 0 : 1, &key
);
214 * Look up entry in page cache, wait for it to become unlocked if it
215 * is a DAX entry and return it. The caller must subsequently call
216 * put_unlocked_entry() if it did not lock the entry or dax_unlock_entry()
217 * if it did. The entry returned may have a larger order than @order.
218 * If @order is larger than the order of the entry found in i_pages, this
219 * function returns a dax_is_conflict entry.
221 * Must be called with the i_pages lock held.
223 static void *get_unlocked_entry(struct xa_state
*xas
, unsigned int order
)
226 struct wait_exceptional_entry_queue ewait
;
227 wait_queue_head_t
*wq
;
229 init_wait(&ewait
.wait
);
230 ewait
.wait
.func
= wake_exceptional_entry_func
;
233 entry
= xas_find_conflict(xas
);
234 if (!entry
|| WARN_ON_ONCE(!xa_is_value(entry
)))
236 if (dax_entry_order(entry
) < order
)
237 return XA_RETRY_ENTRY
;
238 if (!dax_is_locked(entry
))
241 wq
= dax_entry_waitqueue(xas
, entry
, &ewait
.key
);
242 prepare_to_wait_exclusive(wq
, &ewait
.wait
,
243 TASK_UNINTERRUPTIBLE
);
247 finish_wait(wq
, &ewait
.wait
);
253 * The only thing keeping the address space around is the i_pages lock
254 * (it's cycled in clear_inode() after removing the entries from i_pages)
255 * After we call xas_unlock_irq(), we cannot touch xas->xa.
257 static void wait_entry_unlocked(struct xa_state
*xas
, void *entry
)
259 struct wait_exceptional_entry_queue ewait
;
260 wait_queue_head_t
*wq
;
262 init_wait(&ewait
.wait
);
263 ewait
.wait
.func
= wake_exceptional_entry_func
;
265 wq
= dax_entry_waitqueue(xas
, entry
, &ewait
.key
);
267 * Unlike get_unlocked_entry() there is no guarantee that this
268 * path ever successfully retrieves an unlocked entry before an
269 * inode dies. Perform a non-exclusive wait in case this path
270 * never successfully performs its own wake up.
272 prepare_to_wait(wq
, &ewait
.wait
, TASK_UNINTERRUPTIBLE
);
275 finish_wait(wq
, &ewait
.wait
);
278 static void put_unlocked_entry(struct xa_state
*xas
, void *entry
,
279 enum dax_wake_mode mode
)
281 if (entry
&& !dax_is_conflict(entry
))
282 dax_wake_entry(xas
, entry
, mode
);
286 * We used the xa_state to get the entry, but then we locked the entry and
287 * dropped the xa_lock, so we know the xa_state is stale and must be reset
290 static void dax_unlock_entry(struct xa_state
*xas
, void *entry
)
294 BUG_ON(dax_is_locked(entry
));
297 old
= xas_store(xas
, entry
);
299 BUG_ON(!dax_is_locked(old
));
300 dax_wake_entry(xas
, entry
, WAKE_NEXT
);
304 * Return: The entry stored at this location before it was locked.
306 static void *dax_lock_entry(struct xa_state
*xas
, void *entry
)
308 unsigned long v
= xa_to_value(entry
);
309 return xas_store(xas
, xa_mk_value(v
| DAX_LOCKED
));
312 static unsigned long dax_entry_size(void *entry
)
314 if (dax_is_zero_entry(entry
))
316 else if (dax_is_empty_entry(entry
))
318 else if (dax_is_pmd_entry(entry
))
324 static unsigned long dax_end_pfn(void *entry
)
326 return dax_to_pfn(entry
) + dax_entry_size(entry
) / PAGE_SIZE
;
330 * Iterate through all mapped pfns represented by an entry, i.e. skip
331 * 'empty' and 'zero' entries.
333 #define for_each_mapped_pfn(entry, pfn) \
334 for (pfn = dax_to_pfn(entry); \
335 pfn < dax_end_pfn(entry); pfn++)
338 * TODO: for reflink+dax we need a way to associate a single page with
339 * multiple address_space instances at different linear_page_index()
342 static void dax_associate_entry(void *entry
, struct address_space
*mapping
,
343 struct vm_area_struct
*vma
, unsigned long address
)
345 unsigned long size
= dax_entry_size(entry
), pfn
, index
;
348 if (IS_ENABLED(CONFIG_FS_DAX_LIMITED
))
351 index
= linear_page_index(vma
, address
& ~(size
- 1));
352 for_each_mapped_pfn(entry
, pfn
) {
353 struct page
*page
= pfn_to_page(pfn
);
355 WARN_ON_ONCE(page
->mapping
);
356 page
->mapping
= mapping
;
357 page
->index
= index
+ i
++;
361 static void dax_disassociate_entry(void *entry
, struct address_space
*mapping
,
366 if (IS_ENABLED(CONFIG_FS_DAX_LIMITED
))
369 for_each_mapped_pfn(entry
, pfn
) {
370 struct page
*page
= pfn_to_page(pfn
);
372 WARN_ON_ONCE(trunc
&& page_ref_count(page
) > 1);
373 WARN_ON_ONCE(page
->mapping
&& page
->mapping
!= mapping
);
374 page
->mapping
= NULL
;
379 static struct page
*dax_busy_page(void *entry
)
383 for_each_mapped_pfn(entry
, pfn
) {
384 struct page
*page
= pfn_to_page(pfn
);
386 if (page_ref_count(page
) > 1)
393 * dax_lock_mapping_entry - Lock the DAX entry corresponding to a page
394 * @page: The page whose entry we want to lock
396 * Context: Process context.
397 * Return: A cookie to pass to dax_unlock_page() or 0 if the entry could
400 dax_entry_t
dax_lock_page(struct page
*page
)
402 XA_STATE(xas
, NULL
, 0);
405 /* Ensure page->mapping isn't freed while we look at it */
408 struct address_space
*mapping
= READ_ONCE(page
->mapping
);
411 if (!mapping
|| !dax_mapping(mapping
))
415 * In the device-dax case there's no need to lock, a
416 * struct dev_pagemap pin is sufficient to keep the
417 * inode alive, and we assume we have dev_pagemap pin
418 * otherwise we would not have a valid pfn_to_page()
421 entry
= (void *)~0UL;
422 if (S_ISCHR(mapping
->host
->i_mode
))
425 xas
.xa
= &mapping
->i_pages
;
427 if (mapping
!= page
->mapping
) {
428 xas_unlock_irq(&xas
);
431 xas_set(&xas
, page
->index
);
432 entry
= xas_load(&xas
);
433 if (dax_is_locked(entry
)) {
435 wait_entry_unlocked(&xas
, entry
);
439 dax_lock_entry(&xas
, entry
);
440 xas_unlock_irq(&xas
);
444 return (dax_entry_t
)entry
;
447 void dax_unlock_page(struct page
*page
, dax_entry_t cookie
)
449 struct address_space
*mapping
= page
->mapping
;
450 XA_STATE(xas
, &mapping
->i_pages
, page
->index
);
452 if (S_ISCHR(mapping
->host
->i_mode
))
455 dax_unlock_entry(&xas
, (void *)cookie
);
459 * Find page cache entry at given index. If it is a DAX entry, return it
460 * with the entry locked. If the page cache doesn't contain an entry at
461 * that index, add a locked empty entry.
463 * When requesting an entry with size DAX_PMD, grab_mapping_entry() will
464 * either return that locked entry or will return VM_FAULT_FALLBACK.
465 * This will happen if there are any PTE entries within the PMD range
466 * that we are requesting.
468 * We always favor PTE entries over PMD entries. There isn't a flow where we
469 * evict PTE entries in order to 'upgrade' them to a PMD entry. A PMD
470 * insertion will fail if it finds any PTE entries already in the tree, and a
471 * PTE insertion will cause an existing PMD entry to be unmapped and
472 * downgraded to PTE entries. This happens for both PMD zero pages as
473 * well as PMD empty entries.
475 * The exception to this downgrade path is for PMD entries that have
476 * real storage backing them. We will leave these real PMD entries in
477 * the tree, and PTE writes will simply dirty the entire PMD entry.
479 * Note: Unlike filemap_fault() we don't honor FAULT_FLAG_RETRY flags. For
480 * persistent memory the benefit is doubtful. We can add that later if we can
483 * On error, this function does not return an ERR_PTR. Instead it returns
484 * a VM_FAULT code, encoded as an xarray internal entry. The ERR_PTR values
485 * overlap with xarray value entries.
487 static void *grab_mapping_entry(struct xa_state
*xas
,
488 struct address_space
*mapping
, unsigned int order
)
490 unsigned long index
= xas
->xa_index
;
491 bool pmd_downgrade
= false; /* splitting PMD entry into PTE entries? */
496 entry
= get_unlocked_entry(xas
, order
);
499 if (dax_is_conflict(entry
))
501 if (!xa_is_value(entry
)) {
502 xas_set_err(xas
, -EIO
);
507 if (dax_is_pmd_entry(entry
) &&
508 (dax_is_zero_entry(entry
) ||
509 dax_is_empty_entry(entry
))) {
510 pmd_downgrade
= true;
517 * Make sure 'entry' remains valid while we drop
520 dax_lock_entry(xas
, entry
);
523 * Besides huge zero pages the only other thing that gets
524 * downgraded are empty entries which don't need to be
527 if (dax_is_zero_entry(entry
)) {
529 unmap_mapping_pages(mapping
,
530 xas
->xa_index
& ~PG_PMD_COLOUR
,
536 dax_disassociate_entry(entry
, mapping
, false);
537 xas_store(xas
, NULL
); /* undo the PMD join */
538 dax_wake_entry(xas
, entry
, WAKE_ALL
);
539 mapping
->nrexceptional
--;
545 dax_lock_entry(xas
, entry
);
547 unsigned long flags
= DAX_EMPTY
;
551 entry
= dax_make_entry(pfn_to_pfn_t(0), flags
);
552 dax_lock_entry(xas
, entry
);
555 mapping
->nrexceptional
++;
560 if (xas_nomem(xas
, mapping_gfp_mask(mapping
) & ~__GFP_HIGHMEM
))
562 if (xas
->xa_node
== XA_ERROR(-ENOMEM
))
563 return xa_mk_internal(VM_FAULT_OOM
);
565 return xa_mk_internal(VM_FAULT_SIGBUS
);
569 return xa_mk_internal(VM_FAULT_FALLBACK
);
573 * dax_layout_busy_page_range - find first pinned page in @mapping
574 * @mapping: address space to scan for a page with ref count > 1
575 * @start: Starting offset. Page containing 'start' is included.
576 * @end: End offset. Page containing 'end' is included. If 'end' is LLONG_MAX,
577 * pages from 'start' till the end of file are included.
579 * DAX requires ZONE_DEVICE mapped pages. These pages are never
580 * 'onlined' to the page allocator so they are considered idle when
581 * page->count == 1. A filesystem uses this interface to determine if
582 * any page in the mapping is busy, i.e. for DMA, or other
583 * get_user_pages() usages.
585 * It is expected that the filesystem is holding locks to block the
586 * establishment of new mappings in this address_space. I.e. it expects
587 * to be able to run unmap_mapping_range() and subsequently not race
588 * mapping_mapped() becoming true.
590 struct page
*dax_layout_busy_page_range(struct address_space
*mapping
,
591 loff_t start
, loff_t end
)
594 unsigned int scanned
= 0;
595 struct page
*page
= NULL
;
596 pgoff_t start_idx
= start
>> PAGE_SHIFT
;
598 XA_STATE(xas
, &mapping
->i_pages
, start_idx
);
601 * In the 'limited' case get_user_pages() for dax is disabled.
603 if (IS_ENABLED(CONFIG_FS_DAX_LIMITED
))
606 if (!dax_mapping(mapping
) || !mapping_mapped(mapping
))
609 /* If end == LLONG_MAX, all pages from start to till end of file */
610 if (end
== LLONG_MAX
)
613 end_idx
= end
>> PAGE_SHIFT
;
615 * If we race get_user_pages_fast() here either we'll see the
616 * elevated page count in the iteration and wait, or
617 * get_user_pages_fast() will see that the page it took a reference
618 * against is no longer mapped in the page tables and bail to the
619 * get_user_pages() slow path. The slow path is protected by
620 * pte_lock() and pmd_lock(). New references are not taken without
621 * holding those locks, and unmap_mapping_pages() will not zero the
622 * pte or pmd without holding the respective lock, so we are
623 * guaranteed to either see new references or prevent new
624 * references from being established.
626 unmap_mapping_pages(mapping
, start_idx
, end_idx
- start_idx
+ 1, 0);
629 xas_for_each(&xas
, entry
, end_idx
) {
630 if (WARN_ON_ONCE(!xa_is_value(entry
)))
632 if (unlikely(dax_is_locked(entry
)))
633 entry
= get_unlocked_entry(&xas
, 0);
635 page
= dax_busy_page(entry
);
636 put_unlocked_entry(&xas
, entry
, WAKE_NEXT
);
639 if (++scanned
% XA_CHECK_SCHED
)
643 xas_unlock_irq(&xas
);
647 xas_unlock_irq(&xas
);
650 EXPORT_SYMBOL_GPL(dax_layout_busy_page_range
);
652 struct page
*dax_layout_busy_page(struct address_space
*mapping
)
654 return dax_layout_busy_page_range(mapping
, 0, LLONG_MAX
);
656 EXPORT_SYMBOL_GPL(dax_layout_busy_page
);
658 static int __dax_invalidate_entry(struct address_space
*mapping
,
659 pgoff_t index
, bool trunc
)
661 XA_STATE(xas
, &mapping
->i_pages
, index
);
666 entry
= get_unlocked_entry(&xas
, 0);
667 if (!entry
|| WARN_ON_ONCE(!xa_is_value(entry
)))
670 (xas_get_mark(&xas
, PAGECACHE_TAG_DIRTY
) ||
671 xas_get_mark(&xas
, PAGECACHE_TAG_TOWRITE
)))
673 dax_disassociate_entry(entry
, mapping
, trunc
);
674 xas_store(&xas
, NULL
);
675 mapping
->nrexceptional
--;
678 put_unlocked_entry(&xas
, entry
, WAKE_ALL
);
679 xas_unlock_irq(&xas
);
684 * Delete DAX entry at @index from @mapping. Wait for it
685 * to be unlocked before deleting it.
687 int dax_delete_mapping_entry(struct address_space
*mapping
, pgoff_t index
)
689 int ret
= __dax_invalidate_entry(mapping
, index
, true);
692 * This gets called from truncate / punch_hole path. As such, the caller
693 * must hold locks protecting against concurrent modifications of the
694 * page cache (usually fs-private i_mmap_sem for writing). Since the
695 * caller has seen a DAX entry for this index, we better find it
696 * at that index as well...
703 * Invalidate DAX entry if it is clean.
705 int dax_invalidate_mapping_entry_sync(struct address_space
*mapping
,
708 return __dax_invalidate_entry(mapping
, index
, false);
711 static int copy_cow_page_dax(struct block_device
*bdev
, struct dax_device
*dax_dev
,
712 sector_t sector
, struct page
*to
, unsigned long vaddr
)
719 rc
= bdev_dax_pgoff(bdev
, sector
, PAGE_SIZE
, &pgoff
);
723 id
= dax_read_lock();
724 rc
= dax_direct_access(dax_dev
, pgoff
, PHYS_PFN(PAGE_SIZE
), &kaddr
, NULL
);
729 vto
= kmap_atomic(to
);
730 copy_user_page(vto
, (void __force
*)kaddr
, vaddr
, to
);
737 * By this point grab_mapping_entry() has ensured that we have a locked entry
738 * of the appropriate size so we don't have to worry about downgrading PMDs to
739 * PTEs. If we happen to be trying to insert a PTE and there is a PMD
740 * already in the tree, we will skip the insertion and just dirty the PMD as
743 static void *dax_insert_entry(struct xa_state
*xas
,
744 struct address_space
*mapping
, struct vm_fault
*vmf
,
745 void *entry
, pfn_t pfn
, unsigned long flags
, bool dirty
)
747 void *new_entry
= dax_make_entry(pfn
, flags
);
750 __mark_inode_dirty(mapping
->host
, I_DIRTY_PAGES
);
752 if (dax_is_zero_entry(entry
) && !(flags
& DAX_ZERO_PAGE
)) {
753 unsigned long index
= xas
->xa_index
;
754 /* we are replacing a zero page with block mapping */
755 if (dax_is_pmd_entry(entry
))
756 unmap_mapping_pages(mapping
, index
& ~PG_PMD_COLOUR
,
759 unmap_mapping_pages(mapping
, index
, 1, false);
764 if (dax_is_zero_entry(entry
) || dax_is_empty_entry(entry
)) {
767 dax_disassociate_entry(entry
, mapping
, false);
768 dax_associate_entry(new_entry
, mapping
, vmf
->vma
, vmf
->address
);
770 * Only swap our new entry into the page cache if the current
771 * entry is a zero page or an empty entry. If a normal PTE or
772 * PMD entry is already in the cache, we leave it alone. This
773 * means that if we are trying to insert a PTE and the
774 * existing entry is a PMD, we will just leave the PMD in the
775 * tree and dirty it if necessary.
777 old
= dax_lock_entry(xas
, new_entry
);
778 WARN_ON_ONCE(old
!= xa_mk_value(xa_to_value(entry
) |
782 xas_load(xas
); /* Walk the xa_state */
786 xas_set_mark(xas
, PAGECACHE_TAG_DIRTY
);
793 unsigned long pgoff_address(pgoff_t pgoff
, struct vm_area_struct
*vma
)
795 unsigned long address
;
797 address
= vma
->vm_start
+ ((pgoff
- vma
->vm_pgoff
) << PAGE_SHIFT
);
798 VM_BUG_ON_VMA(address
< vma
->vm_start
|| address
>= vma
->vm_end
, vma
);
802 /* Walk all mappings of a given index of a file and writeprotect them */
803 static void dax_entry_mkclean(struct address_space
*mapping
, pgoff_t index
,
806 struct vm_area_struct
*vma
;
807 pte_t pte
, *ptep
= NULL
;
811 i_mmap_lock_read(mapping
);
812 vma_interval_tree_foreach(vma
, &mapping
->i_mmap
, index
, index
) {
813 struct mmu_notifier_range range
;
814 unsigned long address
;
818 if (!(vma
->vm_flags
& VM_SHARED
))
821 address
= pgoff_address(index
, vma
);
824 * follow_invalidate_pte() will use the range to call
825 * mmu_notifier_invalidate_range_start() on our behalf before
828 if (follow_invalidate_pte(vma
->vm_mm
, address
, &range
, &ptep
,
833 * No need to call mmu_notifier_invalidate_range() as we are
834 * downgrading page table protection not changing it to point
837 * See Documentation/vm/mmu_notifier.rst
840 #ifdef CONFIG_FS_DAX_PMD
843 if (pfn
!= pmd_pfn(*pmdp
))
845 if (!pmd_dirty(*pmdp
) && !pmd_write(*pmdp
))
848 flush_cache_page(vma
, address
, pfn
);
849 pmd
= pmdp_invalidate(vma
, address
, pmdp
);
850 pmd
= pmd_wrprotect(pmd
);
851 pmd
= pmd_mkclean(pmd
);
852 set_pmd_at(vma
->vm_mm
, address
, pmdp
, pmd
);
857 if (pfn
!= pte_pfn(*ptep
))
859 if (!pte_dirty(*ptep
) && !pte_write(*ptep
))
862 flush_cache_page(vma
, address
, pfn
);
863 pte
= ptep_clear_flush(vma
, address
, ptep
);
864 pte
= pte_wrprotect(pte
);
865 pte
= pte_mkclean(pte
);
866 set_pte_at(vma
->vm_mm
, address
, ptep
, pte
);
868 pte_unmap_unlock(ptep
, ptl
);
871 mmu_notifier_invalidate_range_end(&range
);
873 i_mmap_unlock_read(mapping
);
876 static int dax_writeback_one(struct xa_state
*xas
, struct dax_device
*dax_dev
,
877 struct address_space
*mapping
, void *entry
)
879 unsigned long pfn
, index
, count
;
883 * A page got tagged dirty in DAX mapping? Something is seriously
886 if (WARN_ON(!xa_is_value(entry
)))
889 if (unlikely(dax_is_locked(entry
))) {
890 void *old_entry
= entry
;
892 entry
= get_unlocked_entry(xas
, 0);
894 /* Entry got punched out / reallocated? */
895 if (!entry
|| WARN_ON_ONCE(!xa_is_value(entry
)))
898 * Entry got reallocated elsewhere? No need to writeback.
899 * We have to compare pfns as we must not bail out due to
900 * difference in lockbit or entry type.
902 if (dax_to_pfn(old_entry
) != dax_to_pfn(entry
))
904 if (WARN_ON_ONCE(dax_is_empty_entry(entry
) ||
905 dax_is_zero_entry(entry
))) {
910 /* Another fsync thread may have already done this entry */
911 if (!xas_get_mark(xas
, PAGECACHE_TAG_TOWRITE
))
915 /* Lock the entry to serialize with page faults */
916 dax_lock_entry(xas
, entry
);
919 * We can clear the tag now but we have to be careful so that concurrent
920 * dax_writeback_one() calls for the same index cannot finish before we
921 * actually flush the caches. This is achieved as the calls will look
922 * at the entry only under the i_pages lock and once they do that
923 * they will see the entry locked and wait for it to unlock.
925 xas_clear_mark(xas
, PAGECACHE_TAG_TOWRITE
);
929 * If dax_writeback_mapping_range() was given a wbc->range_start
930 * in the middle of a PMD, the 'index' we use needs to be
931 * aligned to the start of the PMD.
932 * This allows us to flush for PMD_SIZE and not have to worry about
933 * partial PMD writebacks.
935 pfn
= dax_to_pfn(entry
);
936 count
= 1UL << dax_entry_order(entry
);
937 index
= xas
->xa_index
& ~(count
- 1);
939 dax_entry_mkclean(mapping
, index
, pfn
);
940 dax_flush(dax_dev
, page_address(pfn_to_page(pfn
)), count
* PAGE_SIZE
);
942 * After we have flushed the cache, we can clear the dirty tag. There
943 * cannot be new dirty data in the pfn after the flush has completed as
944 * the pfn mappings are writeprotected and fault waits for mapping
949 xas_store(xas
, entry
);
950 xas_clear_mark(xas
, PAGECACHE_TAG_DIRTY
);
951 dax_wake_entry(xas
, entry
, WAKE_NEXT
);
953 trace_dax_writeback_one(mapping
->host
, index
, count
);
957 put_unlocked_entry(xas
, entry
, WAKE_NEXT
);
962 * Flush the mapping to the persistent domain within the byte range of [start,
963 * end]. This is required by data integrity operations to ensure file data is
964 * on persistent storage prior to completion of the operation.
966 int dax_writeback_mapping_range(struct address_space
*mapping
,
967 struct dax_device
*dax_dev
, struct writeback_control
*wbc
)
969 XA_STATE(xas
, &mapping
->i_pages
, wbc
->range_start
>> PAGE_SHIFT
);
970 struct inode
*inode
= mapping
->host
;
971 pgoff_t end_index
= wbc
->range_end
>> PAGE_SHIFT
;
974 unsigned int scanned
= 0;
976 if (WARN_ON_ONCE(inode
->i_blkbits
!= PAGE_SHIFT
))
979 if (!mapping
->nrexceptional
|| wbc
->sync_mode
!= WB_SYNC_ALL
)
982 trace_dax_writeback_range(inode
, xas
.xa_index
, end_index
);
984 tag_pages_for_writeback(mapping
, xas
.xa_index
, end_index
);
987 xas_for_each_marked(&xas
, entry
, end_index
, PAGECACHE_TAG_TOWRITE
) {
988 ret
= dax_writeback_one(&xas
, dax_dev
, mapping
, entry
);
990 mapping_set_error(mapping
, ret
);
993 if (++scanned
% XA_CHECK_SCHED
)
997 xas_unlock_irq(&xas
);
1001 xas_unlock_irq(&xas
);
1002 trace_dax_writeback_range_done(inode
, xas
.xa_index
, end_index
);
1005 EXPORT_SYMBOL_GPL(dax_writeback_mapping_range
);
1007 static sector_t
dax_iomap_sector(struct iomap
*iomap
, loff_t pos
)
1009 return (iomap
->addr
+ (pos
& PAGE_MASK
) - iomap
->offset
) >> 9;
1012 static int dax_iomap_pfn(struct iomap
*iomap
, loff_t pos
, size_t size
,
1015 const sector_t sector
= dax_iomap_sector(iomap
, pos
);
1020 rc
= bdev_dax_pgoff(iomap
->bdev
, sector
, size
, &pgoff
);
1023 id
= dax_read_lock();
1024 length
= dax_direct_access(iomap
->dax_dev
, pgoff
, PHYS_PFN(size
),
1031 if (PFN_PHYS(length
) < size
)
1033 if (pfn_t_to_pfn(*pfnp
) & (PHYS_PFN(size
)-1))
1035 /* For larger pages we need devmap */
1036 if (length
> 1 && !pfn_t_devmap(*pfnp
))
1040 dax_read_unlock(id
);
1045 * The user has performed a load from a hole in the file. Allocating a new
1046 * page in the file would cause excessive storage usage for workloads with
1047 * sparse files. Instead we insert a read-only mapping of the 4k zero page.
1048 * If this page is ever written to we will re-fault and change the mapping to
1049 * point to real DAX storage instead.
1051 static vm_fault_t
dax_load_hole(struct xa_state
*xas
,
1052 struct address_space
*mapping
, void **entry
,
1053 struct vm_fault
*vmf
)
1055 struct inode
*inode
= mapping
->host
;
1056 unsigned long vaddr
= vmf
->address
;
1057 pfn_t pfn
= pfn_to_pfn_t(my_zero_pfn(vaddr
));
1060 *entry
= dax_insert_entry(xas
, mapping
, vmf
, *entry
, pfn
,
1061 DAX_ZERO_PAGE
, false);
1063 ret
= vmf_insert_mixed(vmf
->vma
, vaddr
, pfn
);
1064 trace_dax_load_hole(inode
, vmf
, ret
);
1068 s64
dax_iomap_zero(loff_t pos
, u64 length
, struct iomap
*iomap
)
1070 sector_t sector
= iomap_sector(iomap
, pos
& PAGE_MASK
);
1074 bool page_aligned
= false;
1075 unsigned offset
= offset_in_page(pos
);
1076 unsigned size
= min_t(u64
, PAGE_SIZE
- offset
, length
);
1078 if (IS_ALIGNED(sector
<< SECTOR_SHIFT
, PAGE_SIZE
) &&
1079 (size
== PAGE_SIZE
))
1080 page_aligned
= true;
1082 rc
= bdev_dax_pgoff(iomap
->bdev
, sector
, PAGE_SIZE
, &pgoff
);
1086 id
= dax_read_lock();
1089 rc
= dax_zero_page_range(iomap
->dax_dev
, pgoff
, 1);
1091 rc
= dax_direct_access(iomap
->dax_dev
, pgoff
, 1, &kaddr
, NULL
);
1093 dax_read_unlock(id
);
1097 if (!page_aligned
) {
1098 memset(kaddr
+ offset
, 0, size
);
1099 dax_flush(iomap
->dax_dev
, kaddr
+ offset
, size
);
1101 dax_read_unlock(id
);
1106 dax_iomap_actor(struct inode
*inode
, loff_t pos
, loff_t length
, void *data
,
1107 struct iomap
*iomap
, struct iomap
*srcmap
)
1109 struct block_device
*bdev
= iomap
->bdev
;
1110 struct dax_device
*dax_dev
= iomap
->dax_dev
;
1111 struct iov_iter
*iter
= data
;
1112 loff_t end
= pos
+ length
, done
= 0;
1117 if (iov_iter_rw(iter
) == READ
) {
1118 end
= min(end
, i_size_read(inode
));
1122 if (iomap
->type
== IOMAP_HOLE
|| iomap
->type
== IOMAP_UNWRITTEN
)
1123 return iov_iter_zero(min(length
, end
- pos
), iter
);
1126 if (WARN_ON_ONCE(iomap
->type
!= IOMAP_MAPPED
))
1130 * Write can allocate block for an area which has a hole page mapped
1131 * into page tables. We have to tear down these mappings so that data
1132 * written by write(2) is visible in mmap.
1134 if (iomap
->flags
& IOMAP_F_NEW
) {
1135 invalidate_inode_pages2_range(inode
->i_mapping
,
1137 (end
- 1) >> PAGE_SHIFT
);
1140 id
= dax_read_lock();
1142 unsigned offset
= pos
& (PAGE_SIZE
- 1);
1143 const size_t size
= ALIGN(length
+ offset
, PAGE_SIZE
);
1144 const sector_t sector
= dax_iomap_sector(iomap
, pos
);
1149 if (fatal_signal_pending(current
)) {
1154 ret
= bdev_dax_pgoff(bdev
, sector
, size
, &pgoff
);
1158 map_len
= dax_direct_access(dax_dev
, pgoff
, PHYS_PFN(size
),
1165 map_len
= PFN_PHYS(map_len
);
1168 if (map_len
> end
- pos
)
1169 map_len
= end
- pos
;
1172 * The userspace address for the memory copy has already been
1173 * validated via access_ok() in either vfs_read() or
1174 * vfs_write(), depending on which operation we are doing.
1176 if (iov_iter_rw(iter
) == WRITE
)
1177 xfer
= dax_copy_from_iter(dax_dev
, pgoff
, kaddr
,
1180 xfer
= dax_copy_to_iter(dax_dev
, pgoff
, kaddr
,
1192 dax_read_unlock(id
);
1194 return done
? done
: ret
;
1198 * dax_iomap_rw - Perform I/O to a DAX file
1199 * @iocb: The control block for this I/O
1200 * @iter: The addresses to do I/O from or to
1201 * @ops: iomap ops passed from the file system
1203 * This function performs read and write operations to directly mapped
1204 * persistent memory. The callers needs to take care of read/write exclusion
1205 * and evicting any page cache pages in the region under I/O.
1208 dax_iomap_rw(struct kiocb
*iocb
, struct iov_iter
*iter
,
1209 const struct iomap_ops
*ops
)
1211 struct address_space
*mapping
= iocb
->ki_filp
->f_mapping
;
1212 struct inode
*inode
= mapping
->host
;
1213 loff_t pos
= iocb
->ki_pos
, ret
= 0, done
= 0;
1216 if (iov_iter_rw(iter
) == WRITE
) {
1217 lockdep_assert_held_write(&inode
->i_rwsem
);
1218 flags
|= IOMAP_WRITE
;
1220 lockdep_assert_held(&inode
->i_rwsem
);
1223 if (iocb
->ki_flags
& IOCB_NOWAIT
)
1224 flags
|= IOMAP_NOWAIT
;
1226 while (iov_iter_count(iter
)) {
1227 ret
= iomap_apply(inode
, pos
, iov_iter_count(iter
), flags
, ops
,
1228 iter
, dax_iomap_actor
);
1235 iocb
->ki_pos
+= done
;
1236 return done
? done
: ret
;
1238 EXPORT_SYMBOL_GPL(dax_iomap_rw
);
1240 static vm_fault_t
dax_fault_return(int error
)
1243 return VM_FAULT_NOPAGE
;
1244 return vmf_error(error
);
1248 * MAP_SYNC on a dax mapping guarantees dirty metadata is
1249 * flushed on write-faults (non-cow), but not read-faults.
1251 static bool dax_fault_is_synchronous(unsigned long flags
,
1252 struct vm_area_struct
*vma
, struct iomap
*iomap
)
1254 return (flags
& IOMAP_WRITE
) && (vma
->vm_flags
& VM_SYNC
)
1255 && (iomap
->flags
& IOMAP_F_DIRTY
);
1258 static vm_fault_t
dax_iomap_pte_fault(struct vm_fault
*vmf
, pfn_t
*pfnp
,
1259 int *iomap_errp
, const struct iomap_ops
*ops
)
1261 struct vm_area_struct
*vma
= vmf
->vma
;
1262 struct address_space
*mapping
= vma
->vm_file
->f_mapping
;
1263 XA_STATE(xas
, &mapping
->i_pages
, vmf
->pgoff
);
1264 struct inode
*inode
= mapping
->host
;
1265 unsigned long vaddr
= vmf
->address
;
1266 loff_t pos
= (loff_t
)vmf
->pgoff
<< PAGE_SHIFT
;
1267 struct iomap iomap
= { .type
= IOMAP_HOLE
};
1268 struct iomap srcmap
= { .type
= IOMAP_HOLE
};
1269 unsigned flags
= IOMAP_FAULT
;
1270 int error
, major
= 0;
1271 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
1277 trace_dax_pte_fault(inode
, vmf
, ret
);
1279 * Check whether offset isn't beyond end of file now. Caller is supposed
1280 * to hold locks serializing us with truncate / punch hole so this is
1283 if (pos
>= i_size_read(inode
)) {
1284 ret
= VM_FAULT_SIGBUS
;
1288 if (write
&& !vmf
->cow_page
)
1289 flags
|= IOMAP_WRITE
;
1291 entry
= grab_mapping_entry(&xas
, mapping
, 0);
1292 if (xa_is_internal(entry
)) {
1293 ret
= xa_to_internal(entry
);
1298 * It is possible, particularly with mixed reads & writes to private
1299 * mappings, that we have raced with a PMD fault that overlaps with
1300 * the PTE we need to set up. If so just return and the fault will be
1303 if (pmd_trans_huge(*vmf
->pmd
) || pmd_devmap(*vmf
->pmd
)) {
1304 ret
= VM_FAULT_NOPAGE
;
1309 * Note that we don't bother to use iomap_apply here: DAX required
1310 * the file system block size to be equal the page size, which means
1311 * that we never have to deal with more than a single extent here.
1313 error
= ops
->iomap_begin(inode
, pos
, PAGE_SIZE
, flags
, &iomap
, &srcmap
);
1315 *iomap_errp
= error
;
1317 ret
= dax_fault_return(error
);
1320 if (WARN_ON_ONCE(iomap
.offset
+ iomap
.length
< pos
+ PAGE_SIZE
)) {
1321 error
= -EIO
; /* fs corruption? */
1322 goto error_finish_iomap
;
1325 if (vmf
->cow_page
) {
1326 sector_t sector
= dax_iomap_sector(&iomap
, pos
);
1328 switch (iomap
.type
) {
1330 case IOMAP_UNWRITTEN
:
1331 clear_user_highpage(vmf
->cow_page
, vaddr
);
1334 error
= copy_cow_page_dax(iomap
.bdev
, iomap
.dax_dev
,
1335 sector
, vmf
->cow_page
, vaddr
);
1344 goto error_finish_iomap
;
1346 __SetPageUptodate(vmf
->cow_page
);
1347 ret
= finish_fault(vmf
);
1349 ret
= VM_FAULT_DONE_COW
;
1353 sync
= dax_fault_is_synchronous(flags
, vma
, &iomap
);
1355 switch (iomap
.type
) {
1357 if (iomap
.flags
& IOMAP_F_NEW
) {
1358 count_vm_event(PGMAJFAULT
);
1359 count_memcg_event_mm(vma
->vm_mm
, PGMAJFAULT
);
1360 major
= VM_FAULT_MAJOR
;
1362 error
= dax_iomap_pfn(&iomap
, pos
, PAGE_SIZE
, &pfn
);
1364 goto error_finish_iomap
;
1366 entry
= dax_insert_entry(&xas
, mapping
, vmf
, entry
, pfn
,
1370 * If we are doing synchronous page fault and inode needs fsync,
1371 * we can insert PTE into page tables only after that happens.
1372 * Skip insertion for now and return the pfn so that caller can
1373 * insert it after fsync is done.
1376 if (WARN_ON_ONCE(!pfnp
)) {
1378 goto error_finish_iomap
;
1381 ret
= VM_FAULT_NEEDDSYNC
| major
;
1384 trace_dax_insert_mapping(inode
, vmf
, entry
);
1386 ret
= vmf_insert_mixed_mkwrite(vma
, vaddr
, pfn
);
1388 ret
= vmf_insert_mixed(vma
, vaddr
, pfn
);
1391 case IOMAP_UNWRITTEN
:
1394 ret
= dax_load_hole(&xas
, mapping
, &entry
, vmf
);
1405 ret
= dax_fault_return(error
);
1407 if (ops
->iomap_end
) {
1408 int copied
= PAGE_SIZE
;
1410 if (ret
& VM_FAULT_ERROR
)
1413 * The fault is done by now and there's no way back (other
1414 * thread may be already happily using PTE we have installed).
1415 * Just ignore error from ->iomap_end since we cannot do much
1418 ops
->iomap_end(inode
, pos
, PAGE_SIZE
, copied
, flags
, &iomap
);
1421 dax_unlock_entry(&xas
, entry
);
1423 trace_dax_pte_fault_done(inode
, vmf
, ret
);
1427 #ifdef CONFIG_FS_DAX_PMD
1428 static vm_fault_t
dax_pmd_load_hole(struct xa_state
*xas
, struct vm_fault
*vmf
,
1429 struct iomap
*iomap
, void **entry
)
1431 struct address_space
*mapping
= vmf
->vma
->vm_file
->f_mapping
;
1432 unsigned long pmd_addr
= vmf
->address
& PMD_MASK
;
1433 struct vm_area_struct
*vma
= vmf
->vma
;
1434 struct inode
*inode
= mapping
->host
;
1435 pgtable_t pgtable
= NULL
;
1436 struct page
*zero_page
;
1441 zero_page
= mm_get_huge_zero_page(vmf
->vma
->vm_mm
);
1443 if (unlikely(!zero_page
))
1446 pfn
= page_to_pfn_t(zero_page
);
1447 *entry
= dax_insert_entry(xas
, mapping
, vmf
, *entry
, pfn
,
1448 DAX_PMD
| DAX_ZERO_PAGE
, false);
1450 if (arch_needs_pgtable_deposit()) {
1451 pgtable
= pte_alloc_one(vma
->vm_mm
);
1453 return VM_FAULT_OOM
;
1456 ptl
= pmd_lock(vmf
->vma
->vm_mm
, vmf
->pmd
);
1457 if (!pmd_none(*(vmf
->pmd
))) {
1463 pgtable_trans_huge_deposit(vma
->vm_mm
, vmf
->pmd
, pgtable
);
1464 mm_inc_nr_ptes(vma
->vm_mm
);
1466 pmd_entry
= mk_pmd(zero_page
, vmf
->vma
->vm_page_prot
);
1467 pmd_entry
= pmd_mkhuge(pmd_entry
);
1468 set_pmd_at(vmf
->vma
->vm_mm
, pmd_addr
, vmf
->pmd
, pmd_entry
);
1470 trace_dax_pmd_load_hole(inode
, vmf
, zero_page
, *entry
);
1471 return VM_FAULT_NOPAGE
;
1475 pte_free(vma
->vm_mm
, pgtable
);
1476 trace_dax_pmd_load_hole_fallback(inode
, vmf
, zero_page
, *entry
);
1477 return VM_FAULT_FALLBACK
;
1480 static vm_fault_t
dax_iomap_pmd_fault(struct vm_fault
*vmf
, pfn_t
*pfnp
,
1481 const struct iomap_ops
*ops
)
1483 struct vm_area_struct
*vma
= vmf
->vma
;
1484 struct address_space
*mapping
= vma
->vm_file
->f_mapping
;
1485 XA_STATE_ORDER(xas
, &mapping
->i_pages
, vmf
->pgoff
, PMD_ORDER
);
1486 unsigned long pmd_addr
= vmf
->address
& PMD_MASK
;
1487 bool write
= vmf
->flags
& FAULT_FLAG_WRITE
;
1489 unsigned int iomap_flags
= (write
? IOMAP_WRITE
: 0) | IOMAP_FAULT
;
1490 struct inode
*inode
= mapping
->host
;
1491 vm_fault_t result
= VM_FAULT_FALLBACK
;
1492 struct iomap iomap
= { .type
= IOMAP_HOLE
};
1493 struct iomap srcmap
= { .type
= IOMAP_HOLE
};
1501 * Check whether offset isn't beyond end of file now. Caller is
1502 * supposed to hold locks serializing us with truncate / punch hole so
1503 * this is a reliable test.
1505 max_pgoff
= DIV_ROUND_UP(i_size_read(inode
), PAGE_SIZE
);
1507 trace_dax_pmd_fault(inode
, vmf
, max_pgoff
, 0);
1510 * Make sure that the faulting address's PMD offset (color) matches
1511 * the PMD offset from the start of the file. This is necessary so
1512 * that a PMD range in the page table overlaps exactly with a PMD
1513 * range in the page cache.
1515 if ((vmf
->pgoff
& PG_PMD_COLOUR
) !=
1516 ((vmf
->address
>> PAGE_SHIFT
) & PG_PMD_COLOUR
))
1519 /* Fall back to PTEs if we're going to COW */
1520 if (write
&& !(vma
->vm_flags
& VM_SHARED
))
1523 /* If the PMD would extend outside the VMA */
1524 if (pmd_addr
< vma
->vm_start
)
1526 if ((pmd_addr
+ PMD_SIZE
) > vma
->vm_end
)
1529 if (xas
.xa_index
>= max_pgoff
) {
1530 result
= VM_FAULT_SIGBUS
;
1534 /* If the PMD would extend beyond the file size */
1535 if ((xas
.xa_index
| PG_PMD_COLOUR
) >= max_pgoff
)
1539 * grab_mapping_entry() will make sure we get an empty PMD entry,
1540 * a zero PMD entry or a DAX PMD. If it can't (because a PTE
1541 * entry is already in the array, for instance), it will return
1542 * VM_FAULT_FALLBACK.
1544 entry
= grab_mapping_entry(&xas
, mapping
, PMD_ORDER
);
1545 if (xa_is_internal(entry
)) {
1546 result
= xa_to_internal(entry
);
1551 * It is possible, particularly with mixed reads & writes to private
1552 * mappings, that we have raced with a PTE fault that overlaps with
1553 * the PMD we need to set up. If so just return and the fault will be
1556 if (!pmd_none(*vmf
->pmd
) && !pmd_trans_huge(*vmf
->pmd
) &&
1557 !pmd_devmap(*vmf
->pmd
)) {
1563 * Note that we don't use iomap_apply here. We aren't doing I/O, only
1564 * setting up a mapping, so really we're using iomap_begin() as a way
1565 * to look up our filesystem block.
1567 pos
= (loff_t
)xas
.xa_index
<< PAGE_SHIFT
;
1568 error
= ops
->iomap_begin(inode
, pos
, PMD_SIZE
, iomap_flags
, &iomap
,
1573 if (iomap
.offset
+ iomap
.length
< pos
+ PMD_SIZE
)
1576 sync
= dax_fault_is_synchronous(iomap_flags
, vma
, &iomap
);
1578 switch (iomap
.type
) {
1580 error
= dax_iomap_pfn(&iomap
, pos
, PMD_SIZE
, &pfn
);
1584 entry
= dax_insert_entry(&xas
, mapping
, vmf
, entry
, pfn
,
1585 DAX_PMD
, write
&& !sync
);
1588 * If we are doing synchronous page fault and inode needs fsync,
1589 * we can insert PMD into page tables only after that happens.
1590 * Skip insertion for now and return the pfn so that caller can
1591 * insert it after fsync is done.
1594 if (WARN_ON_ONCE(!pfnp
))
1597 result
= VM_FAULT_NEEDDSYNC
;
1601 trace_dax_pmd_insert_mapping(inode
, vmf
, PMD_SIZE
, pfn
, entry
);
1602 result
= vmf_insert_pfn_pmd(vmf
, pfn
, write
);
1604 case IOMAP_UNWRITTEN
:
1606 if (WARN_ON_ONCE(write
))
1608 result
= dax_pmd_load_hole(&xas
, vmf
, &iomap
, &entry
);
1616 if (ops
->iomap_end
) {
1617 int copied
= PMD_SIZE
;
1619 if (result
== VM_FAULT_FALLBACK
)
1622 * The fault is done by now and there's no way back (other
1623 * thread may be already happily using PMD we have installed).
1624 * Just ignore error from ->iomap_end since we cannot do much
1627 ops
->iomap_end(inode
, pos
, PMD_SIZE
, copied
, iomap_flags
,
1631 dax_unlock_entry(&xas
, entry
);
1633 if (result
== VM_FAULT_FALLBACK
) {
1634 split_huge_pmd(vma
, vmf
->pmd
, vmf
->address
);
1635 count_vm_event(THP_FAULT_FALLBACK
);
1638 trace_dax_pmd_fault_done(inode
, vmf
, max_pgoff
, result
);
1642 static vm_fault_t
dax_iomap_pmd_fault(struct vm_fault
*vmf
, pfn_t
*pfnp
,
1643 const struct iomap_ops
*ops
)
1645 return VM_FAULT_FALLBACK
;
1647 #endif /* CONFIG_FS_DAX_PMD */
1650 * dax_iomap_fault - handle a page fault on a DAX file
1651 * @vmf: The description of the fault
1652 * @pe_size: Size of the page to fault in
1653 * @pfnp: PFN to insert for synchronous faults if fsync is required
1654 * @iomap_errp: Storage for detailed error code in case of error
1655 * @ops: Iomap ops passed from the file system
1657 * When a page fault occurs, filesystems may call this helper in
1658 * their fault handler for DAX files. dax_iomap_fault() assumes the caller
1659 * has done all the necessary locking for page fault to proceed
1662 vm_fault_t
dax_iomap_fault(struct vm_fault
*vmf
, enum page_entry_size pe_size
,
1663 pfn_t
*pfnp
, int *iomap_errp
, const struct iomap_ops
*ops
)
1667 return dax_iomap_pte_fault(vmf
, pfnp
, iomap_errp
, ops
);
1669 return dax_iomap_pmd_fault(vmf
, pfnp
, ops
);
1671 return VM_FAULT_FALLBACK
;
1674 EXPORT_SYMBOL_GPL(dax_iomap_fault
);
1677 * dax_insert_pfn_mkwrite - insert PTE or PMD entry into page tables
1678 * @vmf: The description of the fault
1679 * @pfn: PFN to insert
1680 * @order: Order of entry to insert.
1682 * This function inserts a writeable PTE or PMD entry into the page tables
1683 * for an mmaped DAX file. It also marks the page cache entry as dirty.
1686 dax_insert_pfn_mkwrite(struct vm_fault
*vmf
, pfn_t pfn
, unsigned int order
)
1688 struct address_space
*mapping
= vmf
->vma
->vm_file
->f_mapping
;
1689 XA_STATE_ORDER(xas
, &mapping
->i_pages
, vmf
->pgoff
, order
);
1694 entry
= get_unlocked_entry(&xas
, order
);
1695 /* Did we race with someone splitting entry or so? */
1696 if (!entry
|| dax_is_conflict(entry
) ||
1697 (order
== 0 && !dax_is_pte_entry(entry
))) {
1698 put_unlocked_entry(&xas
, entry
, WAKE_NEXT
);
1699 xas_unlock_irq(&xas
);
1700 trace_dax_insert_pfn_mkwrite_no_entry(mapping
->host
, vmf
,
1702 return VM_FAULT_NOPAGE
;
1704 xas_set_mark(&xas
, PAGECACHE_TAG_DIRTY
);
1705 dax_lock_entry(&xas
, entry
);
1706 xas_unlock_irq(&xas
);
1708 ret
= vmf_insert_mixed_mkwrite(vmf
->vma
, vmf
->address
, pfn
);
1709 #ifdef CONFIG_FS_DAX_PMD
1710 else if (order
== PMD_ORDER
)
1711 ret
= vmf_insert_pfn_pmd(vmf
, pfn
, FAULT_FLAG_WRITE
);
1714 ret
= VM_FAULT_FALLBACK
;
1715 dax_unlock_entry(&xas
, entry
);
1716 trace_dax_insert_pfn_mkwrite(mapping
->host
, vmf
, ret
);
1721 * dax_finish_sync_fault - finish synchronous page fault
1722 * @vmf: The description of the fault
1723 * @pe_size: Size of entry to be inserted
1724 * @pfn: PFN to insert
1726 * This function ensures that the file range touched by the page fault is
1727 * stored persistently on the media and handles inserting of appropriate page
1730 vm_fault_t
dax_finish_sync_fault(struct vm_fault
*vmf
,
1731 enum page_entry_size pe_size
, pfn_t pfn
)
1734 loff_t start
= ((loff_t
)vmf
->pgoff
) << PAGE_SHIFT
;
1735 unsigned int order
= pe_order(pe_size
);
1736 size_t len
= PAGE_SIZE
<< order
;
1738 err
= vfs_fsync_range(vmf
->vma
->vm_file
, start
, start
+ len
- 1, 1);
1740 return VM_FAULT_SIGBUS
;
1741 return dax_insert_pfn_mkwrite(vmf
, pfn
, order
);
1743 EXPORT_SYMBOL_GPL(dax_finish_sync_fault
);