ITRB 28 include/linux/interval_tree_generic.h #define INTERVAL_TREE_DEFINE(ITSTRUCT, ITRB, ITTYPE, ITSUBTREE, \ ITRB 34 include/linux/interval_tree_generic.h ITSTRUCT, ITRB, ITTYPE, ITSUBTREE, ITLAST) \ ITRB 48 include/linux/interval_tree_generic.h parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ ITRB 52 include/linux/interval_tree_generic.h link = &parent->ITRB.rb_left; \ ITRB 54 include/linux/interval_tree_generic.h link = &parent->ITRB.rb_right; \ ITRB 60 include/linux/interval_tree_generic.h rb_link_node(&node->ITRB, rb_parent, link); \ ITRB 61 include/linux/interval_tree_generic.h rb_insert_augmented_cached(&node->ITRB, root, \ ITRB 68 include/linux/interval_tree_generic.h rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \ ITRB 88 include/linux/interval_tree_generic.h if (node->ITRB.rb_left) { \ ITRB 89 include/linux/interval_tree_generic.h ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \ ITRB 90 include/linux/interval_tree_generic.h ITSTRUCT, ITRB); \ ITRB 107 include/linux/interval_tree_generic.h if (node->ITRB.rb_right) { \ ITRB 108 include/linux/interval_tree_generic.h node = rb_entry(node->ITRB.rb_right, \ ITRB 109 include/linux/interval_tree_generic.h ITSTRUCT, ITRB); \ ITRB 140 include/linux/interval_tree_generic.h node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \ ITRB 144 include/linux/interval_tree_generic.h leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \ ITRB 154 include/linux/interval_tree_generic.h struct rb_node *rb = node->ITRB.rb_right, *prev; \ ITRB 165 include/linux/interval_tree_generic.h ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \ ITRB 173 include/linux/interval_tree_generic.h rb = rb_parent(&node->ITRB); \ ITRB 176 include/linux/interval_tree_generic.h prev = &node->ITRB; \ ITRB 177 include/linux/interval_tree_generic.h node = rb_entry(rb, ITSTRUCT, ITRB); \ ITRB 178 include/linux/interval_tree_generic.h rb = node->ITRB.rb_right; \