From: Praveen Kumar <kpraveen.lkml@gmail.com>
To: xen-devel@lists.xen.org
Cc: Andrea Arcangeli <aarcange@redhat.com>,
sstabellini@kernel.org, wei.liu2@citrix.com,
Peter Zijlstra <a.p.zijlstra@chello.nl>,
George.Dunlap@eu.citrix.com, andrew.cooper3@citrix.com,
dario.faggioli@citrix.com, ian.jackson@eu.citrix.com,
tim@xen.org, Linus Torvalds <torvalds@linux-foundation.org>,
Praveen Kumar <kpraveen.lkml@gmail.com>,
jbeulich@suse.com, Andrew Morton <akpm@linux-foundation.org>,
Michel Lespinasse <walken@google.com>,
David Woodhouse <dwmw2@infradead.org>
Subject: [PATCH 14/17] rbtree: place easiest case first in rb_erase()
Date: Thu, 1 Jun 2017 02:17:05 +0530 [thread overview]
Message-ID: <20170531204708.10470-15-kpraveen.lkml@gmail.com> (raw)
In-Reply-To: <20170531204708.10470-1-kpraveen.lkml@gmail.com>
In rb_erase, move the easy case (node to erase has no more than
1 child) first. I feel the code reads easier that way.
commit 60670b8034d6e2ba860af79c9379b7788d09db73 from Linux tree
Signed-off-by: Michel Lespinasse <walken@google.com>
Reviewed-by: Rik van Riel <riel@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: David Woodhouse <dwmw2@infradead.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
---
xen/common/rbtree.c | 36 ++++++++++++++++++------------------
1 file changed, 18 insertions(+), 18 deletions(-)
diff --git a/xen/common/rbtree.c b/xen/common/rbtree.c
index 3b54c04bea..69c7496c65 100644
--- a/xen/common/rbtree.c
+++ b/xen/common/rbtree.c
@@ -376,18 +376,29 @@ static void __rb_erase_color(struct rb_node *node, struct rb_node *parent,
void rb_erase(struct rb_node *node, struct rb_root *root)
{
- struct rb_node *child, *parent;
+ struct rb_node *child = node->rb_right, *tmp = node->rb_left;
+ struct rb_node *parent;
int color;
- if (!node->rb_left)
- child = node->rb_right;
- else if (!node->rb_right)
- child = node->rb_left;
- else
+ if (!tmp)
{
+ case1:
+ /* Case 1: node to erase has no more than 1 child (easy!) */
+
+ parent = rb_parent(node);
+ color = rb_color(node);
+
+ if (child)
+ rb_set_parent(child, parent);
+ __rb_change_child(node, child, parent, root);
+ } else if (!child) {
+ /* Still case 1, but this time the child is node->rb_left */
+ child = tmp;
+ goto case1;
+ } else {
struct rb_node *old = node, *left;
- node = node->rb_right;
+ node = child;
while ((left = node->rb_left) != NULL)
node = left;
@@ -412,19 +423,8 @@ void rb_erase(struct rb_node *node, struct rb_root *root)
node->rb_left = old->rb_left;
rb_set_parent(old->rb_left, node);
-
- goto color;
}
- parent = rb_parent(node);
- color = rb_color(node);
-
- if (child)
- rb_set_parent(child, parent);
-
- __rb_change_child(node, child, parent, root);
-
- color:
if (color == RB_BLACK)
__rb_erase_color(child, parent, root);
}
--
2.12.0
_______________________________________________
Xen-devel mailing list
Xen-devel@lists.xen.org
https://lists.xen.org/xen-devel
next prev parent reply other threads:[~2017-05-31 20:47 UTC|newest]
Thread overview: 17+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-05-31 20:46 [PATCH v2] xen: common: rbtree: ported updates from linux tree Praveen Kumar
2017-05-31 20:46 ` [PATCH 01/17] rb_tree: reorganize code in rb_erase() for additional changes Praveen Kumar
2017-05-31 20:46 ` [PATCH 02/17] rb_tree: make clear distinction between two different cases in rb_erase() Praveen Kumar
2017-05-31 20:46 ` [PATCH 03/17] rb_tree: remove redundant if()-condition " Praveen Kumar
2017-05-31 20:46 ` [PATCH 04/17] rbtree: empty nodes have no color Praveen Kumar
2017-05-31 20:46 ` [PATCH 05/17] rbtree: move some implementation details from rbtree.h to rbtree.c Praveen Kumar
2017-05-31 20:46 ` [PATCH 06/17] rbtree: break out of rb_insert_color loop after tree rotation Praveen Kumar
2017-05-31 20:46 ` [PATCH 07/17] rbtree: adjust root color in rb_insert_color() only when necessary Praveen Kumar
2017-05-31 20:46 ` [PATCH 08/17] rbtree: low level optimizations in rb_insert_color() Praveen Kumar
2017-05-31 20:47 ` [PATCH 09/17] rbtree: adjust node color in __rb_erase_color() only when necessary Praveen Kumar
2017-05-31 20:47 ` [PATCH 10/17] rbtree: optimize case selection logic in __rb_erase_color() Praveen Kumar
2017-05-31 20:47 ` [PATCH 11/17] rbtree: low level optimizations " Praveen Kumar
2017-05-31 20:47 ` [PATCH 12/17] rbtree: optimize fetching of sibling node Praveen Kumar
2017-05-31 20:47 ` [PATCH 13/17] rbtree: add __rb_change_child() helper function Praveen Kumar
2017-05-31 20:47 ` Praveen Kumar [this message]
2017-05-31 20:47 ` [PATCH 15/17] rbtree: handle 1-child recoloring in rb_erase() instead of rb_erase_color() Praveen Kumar
2017-05-31 21:09 ` Praveen Kumar
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=20170531204708.10470-15-kpraveen.lkml@gmail.com \
--to=kpraveen.lkml@gmail.com \
--cc=George.Dunlap@eu.citrix.com \
--cc=a.p.zijlstra@chello.nl \
--cc=aarcange@redhat.com \
--cc=akpm@linux-foundation.org \
--cc=andrew.cooper3@citrix.com \
--cc=dario.faggioli@citrix.com \
--cc=dwmw2@infradead.org \
--cc=ian.jackson@eu.citrix.com \
--cc=jbeulich@suse.com \
--cc=sstabellini@kernel.org \
--cc=tim@xen.org \
--cc=torvalds@linux-foundation.org \
--cc=walken@google.com \
--cc=wei.liu2@citrix.com \
--cc=xen-devel@lists.xen.org \
/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).