mm: limit filemap_fault readahead to VMA boundaries
Subsystems (3)
PATCH v2 1/1 mm: limit filemap_fault readahead to VMA boundaries
When a file mapping covers a strict subset of a file, an access to the mapping can trigger readahead of file pages outside the mapped region. Readahead is meant to prefetch pages likely to be accessed soon, but these pages aren't accessible via the same means, so it fair to say we don't have a good indicator they'll be accessed soon. Take an ELF file for example: An access to the end of a program's read-only segment isn't a sign that nearby file contents will be accessed next (they are likely to be mapped discontiguously, or not at all). The pressure from loading these pages into the cache can evict more useful pages.
To improve the behavior, make three changes:
* Introduce a new readahead_control field, max_index, as a hard limit on the readahead. The existing file_ra_state->size can't be used as a limit, it is more of a hint and can be increased by various heuristics.
* Set readahead_control->max_index to the end of the VMA in all of the readahead paths that can be triggered from a fault on a file mapping (both "sync" and "async" readahead).
* Limit the read-around range start to the VMA's start.
Note that these changes only affect readahead triggered in the context of a fault, they do not affect readahead triggered by read syscalls. If a user mixes the two types of accesses, the behavior is expected to be the following: if a fault causes readahead and places a PG_readahead marker and then a read(2) syscall hits the PG_readahead marker, the resulting async readahead *will not* be limited to the VMA end. Conversely, if a read(2) syscall places a PG_readahead marker and then a fault hits the marker, the async readahead *will* be limited to the VMA end.
There is an edge case that the above motivation glosses over: A single file mapping might be backed by multiple VMAs. For example, a whole file could be mapped RW, then part of the mapping made RO using mprotect. This patch would hurt performance of a sequential faulted read of such a mapping, the degree depending on how fragmented the VMAs are. A usage pattern like that is likely rare and already suffering from sub-optimal performance because, e.g., the fragmented VMAs limit the fault-around, so each VMA boundary in a sequential faulted read would cause a minor fault. Still, this patch would make it worse. See a previous discussion of this topic at [1].
Tested by mapping and reading a small subset of a large file, then using the cachestat syscall to verify the number of cached pages didn't exceed the mapping size.
In practical scenarios, the effect depends on the specific file and usage. Sometimes there is no effect at all, but, for some ELF files in Android, we see ~20% fewer pages pull into the cache.
A comprehensive performance evaluation hasn't been done, but, in addition to the anecdontal memory savings mentioned above, a benchmark was run with fio 3.38, showing neutral looking results:
/data/local/tmp/fio --version
fio --name=mmap_test --ioengine=mmap --rw=read --bs=4k \
--offset=1G --size=1G --filesize=3G --numjobs=1 \
--filename=testfile.bin
Before: 4366.6 MiB/s (avg of 3459, 4592, 4613, 4697, 4472)
After: 4444.0 MiB/s (avg of 4633, 4655, 4511, 4571, 3850)
+1.7%
Same, with --ioengine=mmap --rw=randread
Before: 445.6 MiB/s (avg of 446, 447, 442, 452, 441)
After: 447.0 MiB/s (avg of 447, 446, 446, 451, 445)
+0.3%
Same, with --ioengine=psync --rw=read
Before: 3086.6 MiB/s (avg of 3122, 3094, 3066, 3094, 3057)
After: 3084.6 MiB/s (avg of 3039, 3103, 3103, 3084, 3094)
-0.06%
Same, with --ioengine=psync --rw=randread
Before: 2226.4 MiB/s (avg of 2256, 2183, 2207, 2265, 2221)
After: 2231.4 MiB/s (avg of 2236, 2241, 2236, 2193, 2251)
+0.2%[1] https://lore.kernel.org/all/ivnv2crd3et76p2nx7oszuqhzzah756oecn5yuykzqfkqzoygw@yvnlkhjjssoz/
---
This is v2 of
https://lore.kernel.org/r/[email protected]/
In v1 of the patch, I made a mistake and accidentally mailed twice it, the first time without including get_maintainer.pl output, so the mailing lists weren't CC'd. There were replies from Andrew to the first email which aren't visible on the mailing list or lore.
Changes in v2:
- Add Jan's Reviewed-by tag.
- Tweak commit message wording, per Andrew
- Change field from unsigned long max_index to pgoff_t _max_index and move next to _index, per Andrew
- Avoid min_t, per Andrew
include/linux/pagemap.h | 2 ++ mm/filemap.c | 4 ++++ mm/readahead.c | 6 +++++- 3 files changed, 11 insertions(+), 1 deletion(-)
include/linux/pagemap.h +2 -0
@@ -1361,6 +1361,7 @@ struct readahead_control {struct file_ra_state *ra;/* private: use the readahead_* accessors instead */ pgoff_t _index; +pgoff_t _max_index;/* limit readahead to _max_index, inclusive */ unsigned int _nr_pages;unsigned int _batch_count;bool dropbehind;
@@ -1374,6 +1375,7 @@ struct readahead_control { .mapping = m, \ .ra = r, \ ._index = i, \ + ._max_index = ULONG_MAX, \ }#define VM_READAHEAD_PAGES (SZ_128K / PAGE_SIZE)
mm/filemap.c +4 -0
@@ -3314,6 +3314,8 @@ static struct file *do_sync_mmap_readahead(struct vm_fault *vmf)bool force_thp_readahead = false;unsigned short mmap_miss; + ractl._max_index = vmf->vma->vm_pgoff +vma_pages (vmf->vma) -1 ; +/* Use the readahead code, even if readahead is disabled */ if (IS_ENABLED (CONFIG_TRANSPARENT_HUGEPAGE ) && (vm_flags &VM_HUGEPAGE ) &&HPAGE_PMD_ORDER <=MAX_PAGECACHE_ORDER )
@@ -3396,6 +3398,7 @@ static struct file *do_sync_mmap_readahead(struct vm_fault *vmf)* mmap read-around */ ra->start =max_t (long,0 , vmf->pgoff - ra->ra_pages /2 ); + ra->start =max (ra->start, vmf->vma->vm_pgoff); ra->size = ra->ra_pages; ra->async_size = ra->ra_pages /4 ; ra->order =0 ;
@@ -3438,6 +3441,7 @@ static struct file *do_async_mmap_readahead(struct vm_fault *vmf, }if (folio_test_readahead (folio)) { + ractl._max_index = vmf->vma->vm_pgoff +vma_pages (vmf->vma) -1 ; fpin =maybe_unlock_mmap_for_io (vmf, fpin);page_cache_async_ra (&ractl, folio, ra->ra_pages); }
mm/readahead.c +5 -1
@@ -324,6 +324,8 @@ static void do_page_cache_ra(struct readahead_control *ractl,return ; end_index = (isize -1 ) >>PAGE_SHIFT ; +if (end_index > ractl->_max_index) + end_index = ractl->_max_index;if (index > end_index)return ;/* Don't read past the page containing the last byte of the file */
@@ -471,7 +473,7 @@ void page_cache_ra_order(struct readahead_control *ractl,pgoff_t start =readahead_index (ractl);pgoff_t index = start;unsigned int min_order =mapping_min_folio_order (mapping); -pgoff_t limit = (i_size_read (mapping->host) -1 ) >>PAGE_SHIFT ; +pgoff_t limit;pgoff_t mark = index + ra->size - ra->async_size;unsigned int nofs;int err =0 ;
@@ -484,6 +486,8 @@ void page_cache_ra_order(struct readahead_control *ractl, goto fallback; } + limit = (i_size_read (mapping->host) -1 ) >>PAGE_SHIFT ; + limit =min (limit, ractl->_max_index); limit =min (limit, index + ra->size -1 ); new_order =min (mapping_max_folio_order (mapping), new_order);
base-commit: db2a1695b2b6feb071b47b72e61d0359bf1524bf
Signature · 1 line
2.54.0.545.g6539524ca2-goog
Quoted 31 lines · Frederick Mayle
When a file mapping covers a strict subset of a file, an access to the mapping can trigger readahead of file pages outside the mapped region. Readahead is meant to prefetch pages likely to be accessed soon, but these pages aren't accessible via the same means, so it fair to say we don't have a good indicator they'll be accessed soon. Take an ELF file for example: An access to the end of a program's read-only segment isn't a sign that nearby file contents will be accessed next (they are likely to be mapped discontiguously, or not at all). The pressure from loading these pages into the cache can evict more useful pages.
To improve the behavior, make three changes:
* Introduce a new
readahead_controlfield,max_index, as a hard limit on the readahead. The existingfile_ra_state->sizecan't be used as a limit, it is more of a hint and can be increased by various heuristics.
* Setreadahead_control->max_indexto the end of the VMA in all of the readahead paths that can be triggered from a fault on a file mapping (both "sync" and "async" readahead).
* Limit the read-around range start to the VMA's start.Note that these changes only affect readahead triggered in the context of a fault, they do not affect readahead triggered by read syscalls. If a user mixes the two types of accesses, the behavior is expected to be the following: if a fault causes readahead and places a
PG_readaheadmarker and then a read(2) syscall hits thePG_readaheadmarker, the resulting async readahead *will not* be limited to the VMA end. Conversely, if a read(2) syscall places aPG_readaheadmarker and then a fault hits the marker, the async readahead *will* be limited to the VMA end.
Quoted 10 lines
There is an edge case that the above motivation glosses over: A single file mapping might be backed by multiple VMAs. For example, a whole file could be mapped RW, then part of the mapping made RO using mprotect. This patch would hurt performance of a sequential faulted read of such a mapping, the degree depending on how fragmented the VMAs are. A usage pattern like that is likely rare and already suffering from sub-optimal performance because, e.g., the fragmented VMAs limit the fault-around, so each VMA boundary in a sequential faulted read would cause a minor fault. Still, this patch would make it worse. See a previous discussion of this topic at [1].
I agree that workloads that do a lot of mprotect() magic likely do not depend on readahead optimizations.
But I'm sure we'll learn quickly if that is not the case :)
Signature · 3 lines
Cheers, David
Quoted 44 lines · David Hildenbrand (Arm)' via android-mm
Quoted 31 lines · Frederick Mayle
When a file mapping covers a strict subset of a file, an access to the mapping can trigger readahead of file pages outside the mapped region. Readahead is meant to prefetch pages likely to be accessed soon, but these pages aren't accessible via the same means, so it fair to say we don't have a good indicator they'll be accessed soon. Take an ELF file for example: An access to the end of a program's read-only segment isn't a sign that nearby file contents will be accessed next (they are likely to be mapped discontiguously, or not at all). The pressure from loading these pages into the cache can evict more useful pages.
To improve the behavior, make three changes:
* Introduce a new
readahead_controlfield,max_index, as a hard limit on the readahead. The existingfile_ra_state->sizecan't be used as a limit, it is more of a hint and can be increased by various heuristics.
* Setreadahead_control->max_indexto the end of the VMA in all of the readahead paths that can be triggered from a fault on a file mapping (both "sync" and "async" readahead).
* Limit the read-around range start to the VMA's start.Note that these changes only affect readahead triggered in the context of a fault, they do not affect readahead triggered by read syscalls. If a user mixes the two types of accesses, the behavior is expected to be the following: if a fault causes readahead and places a
PG_readaheadmarker and then a read(2) syscall hits thePG_readaheadmarker, the resulting async readahead *will not* be limited to the VMA end. Conversely, if a read(2) syscall places aPG_readaheadmarker and then a fault hits the marker, the async readahead *will* be limited to the VMA end.Quoted 10 lines
There is an edge case that the above motivation glosses over: A single file mapping might be backed by multiple VMAs. For example, a whole file could be mapped RW, then part of the mapping made RO using mprotect. This patch would hurt performance of a sequential faulted read of such a mapping, the degree depending on how fragmented the VMAs are. A usage pattern like that is likely rare and already suffering from sub-optimal performance because, e.g., the fragmented VMAs limit the fault-around, so each VMA boundary in a sequential faulted read would cause a minor fault. Still, this patch would make it worse. See a previous discussion of this topic at [1].
Quoted 4 lines
I agree that workloads that do a lot of
mprotect()magic likely do not depend on readahead optimizations.But I'm sure we'll learn quickly if that is not the case :)
Hi David,
There is already this limit for the exec VMAs, so perhaps these use cases are in fact rare enough; but we'll need to see ...
https://lore.kernel.org/all/[email protected]/
Frederick, could we also now remove that logic (EXEC mappings)? Maybe in a follow up patch.
For this patch: Reviewed-by: Kalesh Singh <[email protected]>
Thanks,
Kalesh
Quoted 10 lines
--
Cheers,David
--
You received this message because you are subscribed to the Google Groups "android-mm" group.
To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/a/google.com/d/msgid/android-mm/c7f94ce6-1dfb-420a-b073-d86abeff1f76%40kernel.org.
Quoted 54 lines · Kalesh Singh
Quoted 44 lines · David Hildenbrand (Arm)' via android-mm
Quoted 31 lines · Frederick Mayle
When a file mapping covers a strict subset of a file, an access to the mapping can trigger readahead of file pages outside the mapped region. Readahead is meant to prefetch pages likely to be accessed soon, but these pages aren't accessible via the same means, so it fair to say we don't have a good indicator they'll be accessed soon. Take an ELF file for example: An access to the end of a program's read-only segment isn't a sign that nearby file contents will be accessed next (they are likely to be mapped discontiguously, or not at all). The pressure from loading these pages into the cache can evict more useful pages.
To improve the behavior, make three changes:
* Introduce a new
readahead_controlfield,max_index, as a hard limit on the readahead. The existingfile_ra_state->sizecan't be used as a limit, it is more of a hint and can be increased by various heuristics.
* Setreadahead_control->max_indexto the end of the VMA in all of the readahead paths that can be triggered from a fault on a file mapping (both "sync" and "async" readahead).
* Limit the read-around range start to the VMA's start.Note that these changes only affect readahead triggered in the context of a fault, they do not affect readahead triggered by read syscalls. If a user mixes the two types of accesses, the behavior is expected to be the following: if a fault causes readahead and places a
PG_readaheadmarker and then a read(2) syscall hits thePG_readaheadmarker, the resulting async readahead *will not* be limited to the VMA end. Conversely, if a read(2) syscall places aPG_readaheadmarker and then a fault hits the marker, the async readahead *will* be limited to the VMA end.Quoted 10 lines
There is an edge case that the above motivation glosses over: A single file mapping might be backed by multiple VMAs. For example, a whole file could be mapped RW, then part of the mapping made RO using mprotect. This patch would hurt performance of a sequential faulted read of such a mapping, the degree depending on how fragmented the VMAs are. A usage pattern like that is likely rare and already suffering from sub-optimal performance because, e.g., the fragmented VMAs limit the fault-around, so each VMA boundary in a sequential faulted read would cause a minor fault. Still, this patch would make it worse. See a previous discussion of this topic at [1].
Quoted 4 lines
I agree that workloads that do a lot of
mprotect()magic likely do not depend on readahead optimizations.But I'm sure we'll learn quickly if that is not the case :)
Hi David,
Quoted 7 lines
There is already this limit for the exec VMAs, so perhaps these use cases are in fact rare enough; but we'll need to see ...
https://lore.kernel.org/all/[email protected]/
Frederick, could we also now remove that logic (EXEC mappings)? Maybe in a follow up patch.
The VM_EXEC branch is still meaningfully different from the read-around branch, it sets ra->order = exec_folio_order() and ra->async_size = 0, but I think most of the details could be unified. I can try that in a follow up.