Lines Matching refs:ITRB
40 #define INTERVAL_TREE_DEFINE(ITSTRUCT, ITRB, ITTYPE, ITSUBTREE, \ argument
48 if (node->ITRB.rb_left) { \
49 subtree_last = rb_entry(node->ITRB.rb_left, \
50 ITSTRUCT, ITRB)->ITSUBTREE; \
54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
56 ITSTRUCT, ITRB)->ITSUBTREE; \
63 RB_DECLARE_CALLBACKS(static, ITPREFIX ## _augment, ITSTRUCT, ITRB, \
78 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
82 link = &parent->ITRB.rb_left; \
84 link = &parent->ITRB.rb_right; \
90 rb_link_node(&node->ITRB, rb_parent, link); \
91 rb_insert_augmented_cached(&node->ITRB, root, \
98 rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \
118 if (node->ITRB.rb_left) { \
119 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
120 ITSTRUCT, ITRB); \
137 if (node->ITRB.rb_right) { \
138 node = rb_entry(node->ITRB.rb_right, \
139 ITSTRUCT, ITRB); \
170 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
174 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
184 struct rb_node *rb = node->ITRB.rb_right, *prev; \
195 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
203 rb = rb_parent(&node->ITRB); \
206 prev = &node->ITRB; \
207 node = rb_entry(rb, ITSTRUCT, ITRB); \
208 rb = node->ITRB.rb_right; \