From: Wu Fengguang <fengguang.wu@intel.com>
To: Andrew Morton <akpm@linux-foundation.org>
Cc: Jens Axboe <jens.axboe@oracle.com>,
Nick Piggin <nickpiggin@yahoo.com.au>,
Rik van Riel <riel@redhat.com>,
Wu Fengguang <fengguang.wu@intel.com>
Cc: Chris Mason <chris.mason@oracle.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Clemens Ladisch <clemens@ladisch.de>
Cc: Olivier Galibert <galibert@pobox.com>
Cc: Vivek Goyal <vgoyal@redhat.com>
Cc: Christian Ehrhardt <ehrhardt@linux.vnet.ibm.com>
Cc: Matt Mackall <mpm@selenic.com>
Cc: Nick Piggin <npiggin@suse.de>
Cc: Linux Memory Management List <linux-mm@kvack.org>
Cc: <linux-fsdevel@vger.kernel.org>
Cc: LKML <linux-kernel@vger.kernel.org>
Subject: [PATCH 13/16] radixtree: introduce radix_tree_lookup_leaf_node()
Date: Mon, 01 Mar 2010 13:27:04 +0800 [thread overview]
Message-ID: <20100301053622.084130183@intel.com> (raw)
In-Reply-To: 20100301052651.857984880@intel.com
[-- Attachment #1: radixtree-radix_tree_lookup_leaf_node.patch --]
[-- Type: text/plain, Size: 4058 bytes --]
This will be used by the pagecache context based read-ahead/read-around
heuristic to quickly check one pagecache range:
- if there is any hole
- if there is any pages
Cc: Nick Piggin <nickpiggin@yahoo.com.au>
Acked-by: Rik van Riel <riel@redhat.com>
Signed-off-by: Wu Fengguang <fengguang.wu@intel.com>
---
include/linux/radix-tree.h | 2 +
lib/radix-tree.c | 37 ++++++++++++++++++++++++++---------
2 files changed, 30 insertions(+), 9 deletions(-)
--- linux.orig/lib/radix-tree.c 2010-02-27 12:59:22.000000000 +0800
+++ linux/lib/radix-tree.c 2010-02-27 13:00:09.000000000 +0800
@@ -359,19 +359,20 @@ EXPORT_SYMBOL(radix_tree_insert);
* is_slot == 0 : search for the node.
*/
static void *radix_tree_lookup_element(struct radix_tree_root *root,
- unsigned long index, int is_slot)
+ unsigned long index, int is_slot, int level)
{
unsigned int height, shift;
- struct radix_tree_node *node, **slot;
+ struct radix_tree_node *node;
+ struct radix_tree_node **slot = &root->rnode;
node = rcu_dereference(root->rnode);
if (node == NULL)
return NULL;
if (!radix_tree_is_indirect_ptr(node)) {
- if (index > 0)
+ if (index > 0 || level > 0)
return NULL;
- return is_slot ? (void *)&root->rnode : node;
+ goto out;
}
node = radix_tree_indirect_to_ptr(node);
@@ -381,7 +382,7 @@ static void *radix_tree_lookup_element(s
shift = (height-1) * RADIX_TREE_MAP_SHIFT;
- do {
+ while (height > level) {
slot = (struct radix_tree_node **)
(node->slots + ((index>>shift) & RADIX_TREE_MAP_MASK));
node = rcu_dereference(*slot);
@@ -390,9 +391,10 @@ static void *radix_tree_lookup_element(s
shift -= RADIX_TREE_MAP_SHIFT;
height--;
- } while (height > 0);
+ }
- return is_slot ? (void *)slot:node;
+out:
+ return is_slot ? (void *)slot : node;
}
/**
@@ -410,7 +412,7 @@ static void *radix_tree_lookup_element(s
*/
void **radix_tree_lookup_slot(struct radix_tree_root *root, unsigned long index)
{
- return (void **)radix_tree_lookup_element(root, index, 1);
+ return (void **)radix_tree_lookup_element(root, index, 1, 0);
}
EXPORT_SYMBOL(radix_tree_lookup_slot);
@@ -428,11 +430,28 @@ EXPORT_SYMBOL(radix_tree_lookup_slot);
*/
void *radix_tree_lookup(struct radix_tree_root *root, unsigned long index)
{
- return radix_tree_lookup_element(root, index, 0);
+ return radix_tree_lookup_element(root, index, 0, 0);
}
EXPORT_SYMBOL(radix_tree_lookup);
/**
+ * radix_tree_lookup_leaf_node - lookup leaf node on a radix tree
+ * @root: radix tree root
+ * @index: index key
+ *
+ * Lookup the leaf node that covers @index in the radix tree @root.
+ * Return NULL if the node does not exist, or is the special root node.
+ *
+ * The typical usage is to check the value of node->count, which shall be
+ * performed inside rcu_read_lock to prevent the node from being freed.
+ */
+struct radix_tree_node *
+radix_tree_lookup_leaf_node(struct radix_tree_root *root, unsigned long index)
+{
+ return radix_tree_lookup_element(root, index, 0, 1);
+}
+
+/**
* radix_tree_tag_set - set a tag on a radix tree node
* @root: radix tree root
* @index: index key
--- linux.orig/include/linux/radix-tree.h 2010-02-27 12:59:22.000000000 +0800
+++ linux/include/linux/radix-tree.h 2010-02-27 12:59:23.000000000 +0800
@@ -158,6 +158,8 @@ static inline void radix_tree_replace_sl
int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
+struct radix_tree_node *
+radix_tree_lookup_leaf_node(struct radix_tree_root *root, unsigned long index);
void *radix_tree_delete(struct radix_tree_root *, unsigned long);
unsigned int
radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org. For more info on Linux MM,
see: http://www.linux-mm.org/ .
Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a>
next prev parent reply other threads:[~2010-03-01 5:27 UTC|newest]
Thread overview: 17+ messages / expand[flat|nested] mbox.gz Atom feed top
2010-03-01 5:26 [PATCH 00/16] [PATCH 00/15] 512K readahead size with thrashing safe readahead v3 Wu Fengguang
2010-03-01 5:26 ` [PATCH 01/16] readahead: limit readahead size for small devices Wu Fengguang
2010-03-01 5:26 ` [PATCH 02/16] readahead: retain inactive lru pages to be accessed soon Wu Fengguang
2010-03-01 5:26 ` [PATCH 03/16] readahead: bump up the default readahead size Wu Fengguang
2010-03-01 5:26 ` [PATCH 04/16] readahead: make default readahead size a kernel parameter Wu Fengguang
2010-03-01 5:26 ` [PATCH 05/16] readahead: limit read-ahead size for small memory systems Wu Fengguang
2010-03-01 5:26 ` [PATCH 06/16] readahead: add notes on readahead size Wu Fengguang
2010-03-01 5:26 ` [PATCH 07/16] readahead: replace ra->mmap_miss with ra->ra_flags Wu Fengguang
2010-03-01 5:26 ` [PATCH 08/16] readahead: thrashing safe context readahead Wu Fengguang
2010-03-01 5:27 ` [PATCH 09/16] readahead: record readahead patterns Wu Fengguang
2010-03-01 5:27 ` [PATCH 10/16] readahead: add tracing event Wu Fengguang
2010-03-01 5:27 ` [PATCH 11/16] readahead: add /debug/readahead/stats Wu Fengguang
2010-03-01 5:27 ` [PATCH 12/16] readahead: dont do start-of-file readahead after lseek() Wu Fengguang
2010-03-01 5:27 ` Wu Fengguang [this message]
2010-03-01 5:27 ` [PATCH 14/16] radixtree: speed up the search for hole Wu Fengguang
2010-03-01 5:27 ` [PATCH 15/16] readahead: reduce MMAP_LOTSAMISS for mmap read-around Wu Fengguang
2010-03-01 5:27 ` [PATCH 16/16] readahead: pagecache context based " Wu Fengguang
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=20100301053622.084130183@intel.com \
--to=fengguang.wu@intel.com \
--cc=akpm@linux-foundation.org \
--cc=jens.axboe@oracle.com \
--cc=nickpiggin@yahoo.com.au \
--cc=riel@redhat.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).