lib/rbtree: fix coding style of assignments

Leave blank space between the right-hand and left-hand side of the
assignment to meet the kernel coding style better.

Signed-off-by: chenqiwu <chenqiwu@xiaomi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Reviewed-by: Michel Lespinasse <walken@google.com>
Link: http://lkml.kernel.org/r/1582621140-25850-1-git-send-email-qiwuchen55@gmail.com
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>

diff --git a/lib/rbtree.c b/lib/rbtree.c
index abc86c6..8545872 100644 (file)
--- a/lib/rbtree.c
+++ b/lib/rbtree.c
@@ -503,7 +503,7 @@ struct rb_node *rb_next(const struct rb_node *node)
        if (node->rb_right) {
                node = node->rb_right;
                while (node->rb_left)
-                       node=node->rb_left;
+                       node = node->rb_left;
                return (struct rb_node *)node;
        }
 
@@ -535,7 +535,7 @@ struct rb_node *rb_prev(const struct rb_node *node)
        if (node->rb_left) {
                node = node->rb_left;
                while (node->rb_right)
-                       node=node->rb_right;
+                       node = node->rb_right;
                return (struct rb_node *)node;
        }
 

diff --git a/tools/lib/rbtree.c b/tools/lib/rbtree.c
index 2548ff8..06ac7bd 100644 (file)
--- a/tools/lib/rbtree.c
+++ b/tools/lib/rbtree.c
@@ -497,7 +497,7 @@ struct rb_node *rb_next(const struct rb_node *node)
        if (node->rb_right) {
                node = node->rb_right;
                while (node->rb_left)
-                       node=node->rb_left;
+                       node = node->rb_left;
                return (struct rb_node *)node;
        }
 
@@ -528,7 +528,7 @@ struct rb_node *rb_prev(const struct rb_node *node)
        if (node->rb_left) {
                node = node->rb_left;
                while (node->rb_right)
-                       node=node->rb_right;
+                       node = node->rb_right;
                return (struct rb_node *)node;
        }