1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/*
* Copyright (c) 2015 embedded brains GmbH. All rights reserved.
*
* embedded brains GmbH
* Dornierstr. 4
* 82178 Puchheim
* Germany
* <rtems@embedded-brains.de>
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rtems.org/license/LICENSE.
*/
#ifndef _LINUX_RBTREE_H
#define _LINUX_RBTREE_H
#include <rtems/score/rbtree.h>
struct rb_node {
struct rb_node *rb_left;
struct rb_node *rb_right;
struct rb_node *rb_parent;
int rb_color;
#if defined(RTEMS_DEBUG)
const RBTree_Control *rb_tree;
#endif
};
RTEMS_STATIC_ASSERT(
sizeof( struct rb_node ) == sizeof( RBTree_Node ),
rb_node_size
);
RTEMS_STATIC_ASSERT(
offsetof( struct rb_node, rb_left ) == offsetof( RBTree_Node, Node.rbe_left ),
rb_node_left
);
RTEMS_STATIC_ASSERT(
offsetof( struct rb_node, rb_right ) == offsetof( RBTree_Node, Node.rbe_right ),
rb_node_right
);
RTEMS_STATIC_ASSERT(
offsetof( struct rb_node, rb_parent ) == offsetof( RBTree_Node, Node.rbe_parent ),
rb_node_parent
);
RTEMS_STATIC_ASSERT(
offsetof( struct rb_node, rb_color ) == offsetof( RBTree_Node, Node.rbe_color ),
rb_node_color
);
struct rb_root {
struct rb_node *rb_node;
};
RTEMS_STATIC_ASSERT(
sizeof( struct rb_root ) == sizeof( RBTree_Control ),
rb_root_size
);
RTEMS_STATIC_ASSERT(
offsetof( struct rb_root, rb_node ) == offsetof( RBTree_Control, rbh_root ),
rb_root_node
);
#undef RB_ROOT
#define RB_ROOT ( (struct rb_root) { NULL } )
#define rb_entry( p, container, field ) RTEMS_CONTAINER_OF( p, container, field )
static inline void rb_insert_color( struct rb_node *node, struct rb_root *root)
{
_RBTree_Insert_color( (RBTree_Control *) root, (RBTree_Node *) node );
}
static inline void rb_erase( struct rb_node *node, struct rb_root *root )
{
_RBTree_Extract( (RBTree_Control *) root, (RBTree_Node *) node );
}
static inline struct rb_node *rb_next( struct rb_node *node )
{
return (struct rb_node *) _RBTree_Successor( (RBTree_Node *) node );
}
static inline struct rb_node *rb_prev( struct rb_node *node )
{
return (struct rb_node *) _RBTree_Predecessor( (RBTree_Node *) node );
}
static inline struct rb_node *rb_first( struct rb_root *root )
{
return (struct rb_node *) _RBTree_Minimum( (RBTree_Control *) root );
}
static inline struct rb_node *rb_last( struct rb_root *root )
{
return (struct rb_node *) _RBTree_Maximum( (RBTree_Control *) root );
}
static inline void rb_replace_node(
struct rb_node *victim,
struct rb_node *replacement,
struct rb_root *root
)
{
_RBTree_Replace_node(
(RBTree_Control *) root,
(RBTree_Node *) victim,
(RBTree_Node *) replacement
);
}
static inline void rb_link_node(
struct rb_node *node,
struct rb_node *parent,
struct rb_node **link
)
{
_RBTree_Initialize_node( (RBTree_Node *) node );
_RBTree_Add_child(
(RBTree_Node *) node,
(RBTree_Node *) parent,
(RBTree_Node **) link
);
}
static inline struct rb_node *rb_parent( struct rb_node *node )
{
return (struct rb_node *) _RBTree_Parent( (RBTree_Node *) node );
}
#endif /* _LINUX_RBTREE_H */
|
