diff options
| author | Brian Norris <computersforpeace@gmail.com> | 2011-06-27 11:27:20 -0700 |
|---|---|---|
| committer | Artem Bityutskiy <dedekind1@gmail.com> | 2011-06-29 08:42:38 +0300 |
| commit | 15f5f89995de6f10a5dc7b30ebf87d856c4e1127 (patch) | |
| tree | 8eb845b328f07685164ce8b078cf74851e74fa2e /rbtree.c | |
| parent | 6977ec0308678514ea4450e25e9d443a787da12e (diff) | |
mtd-utils: remove whitespace at end of lines
Signed-off-by: Brian Norris <computersforpeace@gmail.com>
Acked-by: Mike Frysinger <vapier@gentoo.org>
Signed-off-by: Artem Bityutskiy <dedekind1@gmail.com>
Diffstat (limited to 'rbtree.c')
| -rw-r--r-- | rbtree.c | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -2,7 +2,7 @@ Red Black Trees (C) 1999 Andrea Arcangeli <andrea@suse.de> (C) 2002 David Woodhouse <dwmw2@infradead.org> - + This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or @@ -324,7 +324,7 @@ struct rb_node *rb_next(struct rb_node *node) /* If we have a right-hand child, go down and then left as far as we can. */ if (node->rb_right) { - node = node->rb_right; + node = node->rb_right; while (node->rb_left) node=node->rb_left; return node; @@ -352,7 +352,7 @@ struct rb_node *rb_prev(struct rb_node *node) /* If we have a left-hand child, go down and then right as far as we can. */ if (node->rb_left) { - node = node->rb_left; + node = node->rb_left; while (node->rb_right) node=node->rb_right; return node; |