|
Packit |
c5a612 |
/*
|
|
Packit |
c5a612 |
* Red Black Trees
|
|
Packit |
c5a612 |
* (C) 1999 Andrea Arcangeli <andrea@suse.de>
|
|
Packit |
c5a612 |
*
|
|
Packit |
c5a612 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
c5a612 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
c5a612 |
* the Free Software Foundation; either version 2 of the License, or
|
|
Packit |
c5a612 |
* (at your option) any later version.
|
|
Packit |
c5a612 |
*
|
|
Packit |
c5a612 |
* This program is distributed in the hope that it will be useful,
|
|
Packit |
c5a612 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
c5a612 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Packit |
c5a612 |
* GNU General Public License for more details.
|
|
Packit |
c5a612 |
*
|
|
Packit |
c5a612 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
c5a612 |
* along with this program; if not, write to the Free Software
|
|
Packit |
c5a612 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
Packit |
c5a612 |
*
|
|
Packit |
c5a612 |
*/
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#ifndef NFTABLES_RBTREE_H
|
|
Packit |
c5a612 |
#define NFTABLES_RBTREE_H
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#include <stddef.h>
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
struct rb_node
|
|
Packit |
c5a612 |
{
|
|
Packit |
c5a612 |
unsigned long rb_parent_color;
|
|
Packit |
c5a612 |
#define RB_RED 0
|
|
Packit |
c5a612 |
#define RB_BLACK 1
|
|
Packit |
c5a612 |
struct rb_node *rb_right;
|
|
Packit |
c5a612 |
struct rb_node *rb_left;
|
|
Packit |
c5a612 |
};
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
struct rb_root
|
|
Packit |
c5a612 |
{
|
|
Packit |
c5a612 |
struct rb_node *rb_node;
|
|
Packit |
c5a612 |
};
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
|
|
Packit |
c5a612 |
#define rb_color(r) ((r)->rb_parent_color & 1)
|
|
Packit |
c5a612 |
#define rb_is_red(r) (!rb_color(r))
|
|
Packit |
c5a612 |
#define rb_is_black(r) rb_color(r)
|
|
Packit |
c5a612 |
#define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0)
|
|
Packit |
c5a612 |
#define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0)
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
|
|
Packit |
c5a612 |
{
|
|
Packit |
c5a612 |
rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p;
|
|
Packit |
c5a612 |
}
|
|
Packit |
c5a612 |
static inline void rb_set_color(struct rb_node *rb, int color)
|
|
Packit |
c5a612 |
{
|
|
Packit |
c5a612 |
rb->rb_parent_color = (rb->rb_parent_color & ~1) | color;
|
|
Packit |
c5a612 |
}
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#define RB_ROOT (struct rb_root) { NULL, }
|
|
Packit |
c5a612 |
#define rb_entry(ptr, type, member) container_of(ptr, type, member)
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
|
|
Packit |
c5a612 |
#define RB_EMPTY_NODE(node) (rb_parent(node) == node)
|
|
Packit |
c5a612 |
#define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
extern void rb_insert_color(struct rb_node *, struct rb_root *);
|
|
Packit |
c5a612 |
extern void rb_erase(struct rb_node *, struct rb_root *);
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
/* Find logical next and previous nodes in a tree */
|
|
Packit |
c5a612 |
extern struct rb_node *rb_next(struct rb_node *);
|
|
Packit |
c5a612 |
extern struct rb_node *rb_prev(struct rb_node *);
|
|
Packit |
c5a612 |
extern struct rb_node *rb_first(struct rb_root *);
|
|
Packit |
c5a612 |
extern struct rb_node *rb_last(struct rb_root *);
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
/* Fast replacement of a single node without remove/rebalance/add/rebalance */
|
|
Packit |
c5a612 |
extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
|
Packit |
c5a612 |
struct rb_root *root);
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,
|
|
Packit |
c5a612 |
struct rb_node ** rb_link)
|
|
Packit |
c5a612 |
{
|
|
Packit |
c5a612 |
node->rb_parent_color = (unsigned long )parent;
|
|
Packit |
c5a612 |
node->rb_left = node->rb_right = NULL;
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
*rb_link = node;
|
|
Packit |
c5a612 |
}
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#define rb_for_each_entry(pos, root, member) \
|
|
Packit |
c5a612 |
for ((pos) = (root)->rb_node ? \
|
|
Packit |
c5a612 |
rb_entry(rb_first(root), typeof(*pos), member) : NULL; \
|
|
Packit |
c5a612 |
(pos) != NULL; \
|
|
Packit |
c5a612 |
(pos) = rb_entry(rb_next(&(pos)->member), typeof(*pos), member))
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#define rb_for_each_entry_safe(pos, node, next, root, member) \
|
|
Packit |
c5a612 |
for ((node) = rb_first(root); \
|
|
Packit |
c5a612 |
(pos) = (node) ? rb_entry((node), typeof(*pos), member) : NULL, \
|
|
Packit |
c5a612 |
(next) = (node) ? rb_next(node) : NULL, \
|
|
Packit |
c5a612 |
(pos) != NULL; \
|
|
Packit |
c5a612 |
(node) = (next))
|
|
Packit |
c5a612 |
|
|
Packit |
c5a612 |
#endif /* NFTABLES_RBTREE_H */
|