diff options
| author | Marek Vasut <marek.vasut+renesas@mailbox.org> | 2024-07-23 01:28:26 +0200 |
|---|---|---|
| committer | Tom Rini <trini@konsulko.com> | 2024-07-29 15:01:04 -0600 |
| commit | 9fb4be152b01dda3a221bf5e015dc3ee76378896 (patch) | |
| tree | 3958e7c793ba806a4a9cd3192bb911b383629fb5 /include/linux/rbtree.h | |
| parent | b66890164811318ddc4d824cafb5c2d3891cd164 (diff) | |
include: linux: Remove duplicate newlines
Drop all duplicate newlines. No functional change.
Signed-off-by: Marek Vasut <marek.vasut+renesas@mailbox.org>
Diffstat (limited to 'include/linux/rbtree.h')
| -rw-r--r-- | include/linux/rbtree.h | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h index 1d2b1768c17..3809c3fb8ef 100644 --- a/include/linux/rbtree.h +++ b/include/linux/rbtree.h @@ -32,7 +32,6 @@ struct rb_root { struct rb_node *rb_node; }; - #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) #define RB_ROOT (struct rb_root) { NULL, } @@ -46,11 +45,9 @@ struct rb_root { #define RB_CLEAR_NODE(node) \ ((node)->__rb_parent_color = (unsigned long)(node)) - extern void rb_insert_color(struct rb_node *, struct rb_root *); extern void rb_erase(struct rb_node *, struct rb_root *); - /* Find logical next and previous nodes in a tree */ extern struct rb_node *rb_next(const struct rb_node *); extern struct rb_node *rb_prev(const struct rb_node *); |