Linux C 内核rbtree算法（支持用户态）

rbtree算法实现(由内核代码获得并部分修改使其可以应用于用户态并增加增删查函数)。

//rbtree.h


#ifndef	_LINUX_RBTREE_H
#define	_LINUX_RBTREE_H

#undef NULL  
#if defined(__cplusplus)  
#define NULL 0  
#else  
#define NULL ((void *)0)  
#endif  

#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)  

#define container_of(ptr, type, member) ({          \
    const typeof( ((type *)0)->member ) *__mptr = (ptr); \
    (type *)( (char *)__mptr - offsetof(type,member) );}) 

struct rb_node
{
	unsigned long  rb_parent_color;
#define	RB_RED		0
#define	RB_BLACK	1
	struct rb_node* rb_right;
	struct rb_node* rb_left;
} __attribute__((aligned(sizeof(long))));
/* The alignment might seem pointless, but allegedly CRIS needs it */

struct rb_root
{
	struct rb_node* rb_node;
};


#define rb_parent(r)   ((struct rb_node *)((r)->rb_parent_color & ~3))
#define rb_color(r)   ((r)->rb_parent_color & 1)
#define rb_is_red(r)   (!rb_color(r))
#define rb_is_black(r) rb