diff options
| author | Matthew Wilcox <willy@infradead.org> | 2017-11-21 14:07:06 -0500 |
|---|---|---|
| committer | Matthew Wilcox <willy@infradead.org> | 2018-07-26 11:50:37 -0400 |
| commit | 5ec228623ff4207d97209a5e92ba6e5ab2ea6af1 (patch) | |
| tree | 17b34def4618fd6eff16be5433a14ec9747061cb /mm/readahead.c | |
| parent | 613b59eae812665bf334af7eb940d76cfbb268d8 (diff) | |
| download | linux-next-5ec228623ff4207d97209a5e92ba6e5ab2ea6af1.tar.gz | |
page cache: Convert hole search to XArray
The page cache offers the ability to search for a miss in the previous or
next N locations. Rather than teach the XArray about the page cache's
definition of a miss, use xas_prev() and xas_next() to search the page
array. This should be more efficient as it does not have to start the
lookup from the top for each index.
Signed-off-by: Matthew Wilcox <willy@infradead.org>
Diffstat (limited to 'mm/readahead.c')
| -rw-r--r-- | mm/readahead.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/mm/readahead.c b/mm/readahead.c index 3757aa549709..59998ca31f2a 100644 --- a/mm/readahead.c +++ b/mm/readahead.c @@ -334,7 +334,7 @@ static pgoff_t count_history_pages(struct address_space *mapping, pgoff_t head; rcu_read_lock(); - head = page_cache_prev_hole(mapping, offset - 1, max); + head = page_cache_prev_gap(mapping, offset - 1, max); rcu_read_unlock(); return offset - 1 - head; @@ -422,7 +422,7 @@ ondemand_readahead(struct address_space *mapping, pgoff_t start; rcu_read_lock(); - start = page_cache_next_hole(mapping, offset + 1, max_pages); + start = page_cache_next_gap(mapping, offset + 1, max_pages); rcu_read_unlock(); if (!start || start - offset > max_pages) |