diff options
| author | Matthew Wilcox <willy@infradead.org> | 2017-11-03 13:30:42 -0400 |
|---|---|---|
| committer | Matthew Wilcox <willy@infradead.org> | 2018-09-29 22:47:49 -0400 |
| commit | 3159f943aafdbacb2f94c38fdaadabf2bbde2a14 (patch) | |
| tree | 7e06823a1ab7e90774535d17a217a939bdddda3b /mm/readahead.c | |
| parent | 66ee620f06f99d72475db6eb638559ba608c7dee (diff) | |
| download | linux-3159f943aafdbacb2f94c38fdaadabf2bbde2a14.tar.gz linux-3159f943aafdbacb2f94c38fdaadabf2bbde2a14.tar.bz2 linux-3159f943aafdbacb2f94c38fdaadabf2bbde2a14.zip | |
xarray: Replace exceptional entries
Introduce xarray value entries and tagged pointers to replace radix
tree exceptional entries. This is a slight change in encoding to allow
the use of an extra bit (we can now store BITS_PER_LONG - 1 bits in a
value entry). It is also a change in emphasis; exceptional entries are
intimidating and different. As the comment explains, you can choose
to store values or pointers in the xarray and they are both first-class
citizens.
Signed-off-by: Matthew Wilcox <willy@infradead.org>
Reviewed-by: Josef Bacik <jbacik@fb.com>
Diffstat (limited to 'mm/readahead.c')
| -rw-r--r-- | mm/readahead.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/mm/readahead.c b/mm/readahead.c index 4e630143a0ba..de657077d41d 100644 --- a/mm/readahead.c +++ b/mm/readahead.c @@ -179,7 +179,7 @@ unsigned int __do_page_cache_readahead(struct address_space *mapping, rcu_read_lock(); page = radix_tree_lookup(&mapping->i_pages, page_offset); rcu_read_unlock(); - if (page && !radix_tree_exceptional_entry(page)) { + if (page && !xa_is_value(page)) { /* * Page already present? Kick off the current batch of * contiguous pages before continuing with the next |