Lines Matching refs:ITRB
28 #define INTERVAL_TREE_DEFINE(ITSTRUCT, ITRB, ITTYPE, ITSUBTREE, \ argument
34 ITSTRUCT, ITRB, ITTYPE, ITSUBTREE, ITLAST) \
48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
52 link = &parent->ITRB.rb_left; \
54 link = &parent->ITRB.rb_right; \
60 rb_link_node(&node->ITRB, rb_parent, link); \
61 rb_insert_augmented_cached(&node->ITRB, root, \
68 rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
90 ITSTRUCT, ITRB); \
107 node = rb_entry(node->ITRB.rb_right, ITSTRUCT, ITRB); \
136 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
140 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
161 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
169 rb = rb_parent(&node->ITRB); \
172 prev = &node->ITRB; \
173 node = rb_entry(rb, ITSTRUCT, ITRB); \
174 rb = node->ITRB.rb_right; \