提交 caca7cb7 编写于 作者: W Wu Fengguang 提交者: Linus Torvalds

readahead: remove one unnecessary radix tree lookup

(hit_readahead_marker != 0) means the page at @offset is present, so we
can search for non-present page starting from @offset+1.
Reported-by: NXu Chenfeng <xcf@ustc.edu.cn>
Signed-off-by: NWu Fengguang <fengguang.wu@intel.com>
Cc: Ying Han <yinghan@google.com>
Signed-off-by: NAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
上级 fc31d16a
...@@ -395,7 +395,7 @@ ondemand_readahead(struct address_space *mapping, ...@@ -395,7 +395,7 @@ ondemand_readahead(struct address_space *mapping,
pgoff_t start; pgoff_t start;
rcu_read_lock(); rcu_read_lock();
start = radix_tree_next_hole(&mapping->page_tree, offset,max+1); start = radix_tree_next_hole(&mapping->page_tree, offset+1,max);
rcu_read_unlock(); rcu_read_unlock();
if (!start || start - offset > max) if (!start || start - offset > max)
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册