aboutsummaryrefslogtreecommitdiffstats
path: root/mm/filemap.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2016-12-14 20:25:18 -0500
committerLinus Torvalds <torvalds@linux-foundation.org>2016-12-14 20:25:18 -0500
commita57cb1c1d7974c62a5c80f7869e35b492ace12cd (patch)
tree5a42ee9a668f171143464bc86013954c1bbe94ad /mm/filemap.c
parentcf1b3341afab9d3ad02a76b3a619ea027dcf4e28 (diff)
parente1e14ab8411df344a17687821f8f78f0a1e73cbb (diff)
Merge branch 'akpm' (patches from Andrew)
Merge more updates from Andrew Morton: - a few misc things - kexec updates - DMA-mapping updates to better support networking DMA operations - IPC updates - various MM changes to improve DAX fault handling - lots of radix-tree changes, mainly to the test suite. All leading up to reimplementing the IDA/IDR code to be a wrapper layer over the radix-tree. However the final trigger-pulling patch is held off for 4.11. * emailed patches from Andrew Morton <akpm@linux-foundation.org>: (114 commits) radix tree test suite: delete unused rcupdate.c radix tree test suite: add new tag check radix-tree: ensure counts are initialised radix tree test suite: cache recently freed objects radix tree test suite: add some more functionality idr: reduce the number of bits per level from 8 to 6 rxrpc: abstract away knowledge of IDR internals tpm: use idr_find(), not idr_find_slowpath() idr: add ida_is_empty radix tree test suite: check multiorder iteration radix-tree: fix replacement for multiorder entries radix-tree: add radix_tree_split_preload() radix-tree: add radix_tree_split radix-tree: add radix_tree_join radix-tree: delete radix_tree_range_tag_if_tagged() radix-tree: delete radix_tree_locate_item() radix-tree: improve multiorder iterators btrfs: fix race in btrfs_free_dummy_fs_info() radix-tree: improve dump output radix-tree: make radix_tree_find_next_bit more useful ...
Diffstat (limited to 'mm/filemap.c')
-rw-r--r--mm/filemap.c14
1 files changed, 7 insertions, 7 deletions
diff --git a/mm/filemap.c b/mm/filemap.c
index b06517b7f97f..32be3c8f3a11 100644
--- a/mm/filemap.c
+++ b/mm/filemap.c
@@ -2164,12 +2164,12 @@ page_not_uptodate:
2164} 2164}
2165EXPORT_SYMBOL(filemap_fault); 2165EXPORT_SYMBOL(filemap_fault);
2166 2166
2167void filemap_map_pages(struct fault_env *fe, 2167void filemap_map_pages(struct vm_fault *vmf,
2168 pgoff_t start_pgoff, pgoff_t end_pgoff) 2168 pgoff_t start_pgoff, pgoff_t end_pgoff)
2169{ 2169{
2170 struct radix_tree_iter iter; 2170 struct radix_tree_iter iter;
2171 void **slot; 2171 void **slot;
2172 struct file *file = fe->vma->vm_file; 2172 struct file *file = vmf->vma->vm_file;
2173 struct address_space *mapping = file->f_mapping; 2173 struct address_space *mapping = file->f_mapping;
2174 pgoff_t last_pgoff = start_pgoff; 2174 pgoff_t last_pgoff = start_pgoff;
2175 loff_t size; 2175 loff_t size;
@@ -2225,11 +2225,11 @@ repeat:
2225 if (file->f_ra.mmap_miss > 0) 2225 if (file->f_ra.mmap_miss > 0)
2226 file->f_ra.mmap_miss--; 2226 file->f_ra.mmap_miss--;
2227 2227
2228 fe->address += (iter.index - last_pgoff) << PAGE_SHIFT; 2228 vmf->address += (iter.index - last_pgoff) << PAGE_SHIFT;
2229 if (fe->pte) 2229 if (vmf->pte)
2230 fe->pte += iter.index - last_pgoff; 2230 vmf->pte += iter.index - last_pgoff;
2231 last_pgoff = iter.index; 2231 last_pgoff = iter.index;
2232 if (alloc_set_pte(fe, NULL, page)) 2232 if (alloc_set_pte(vmf, NULL, page))
2233 goto unlock; 2233 goto unlock;
2234 unlock_page(page); 2234 unlock_page(page);
2235 goto next; 2235 goto next;
@@ -2239,7 +2239,7 @@ skip:
2239 put_page(page); 2239 put_page(page);
2240next: 2240next:
2241 /* Huge page is mapped? No need to proceed. */ 2241 /* Huge page is mapped? No need to proceed. */
2242 if (pmd_trans_huge(*fe->pmd)) 2242 if (pmd_trans_huge(*vmf->pmd))
2243 break; 2243 break;
2244 if (iter.index == end_pgoff) 2244 if (iter.index == end_pgoff)
2245 break; 2245 break;