11 	struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb);  in interval_end()
27 	if (node->rb.rb_left) {  in compute_subtree_last()
28 		sector_t left = interval_end(node->rb.rb_left);  in compute_subtree_last()
32 	if (node->rb.rb_right) {  in compute_subtree_last()
33 		sector_t right = interval_end(node->rb.rb_right);  in compute_subtree_last()
40 static void augment_propagate(struct rb_node *rb, struct rb_node *stop)  in augment_propagate()  argument
42 	while (rb != stop) {  in augment_propagate()
43 		struct drbd_interval *node = rb_entry(rb, struct drbd_interval, rb);  in augment_propagate()
48 		rb = rb_parent(&node->rb);  in augment_propagate()
54 	struct drbd_interval *old = rb_entry(rb_old, struct drbd_interval, rb);  in augment_copy()
55 	struct drbd_interval *new = rb_entry(rb_new, struct drbd_interval, rb);  in augment_copy()
62 	struct drbd_interval *old = rb_entry(rb_old, struct drbd_interval, rb);  in augment_rotate()
63 	struct drbd_interval *new = rb_entry(rb_new, struct drbd_interval, rb);  in augment_rotate()
87 			rb_entry(*new, struct drbd_interval, rb);  in drbd_insert_interval()
102 	rb_link_node(&this->rb, parent, new);  in drbd_insert_interval()
103 	rb_insert_augmented(&this->rb, root, &augment_callbacks);  in drbd_insert_interval()
125 			rb_entry(node, struct drbd_interval, rb);  in drbd_contains_interval()
147 	rb_erase_augmented(&this->rb, root, &augment_callbacks);  in drbd_remove_interval()
172 			rb_entry(node, struct drbd_interval, rb);  in drbd_find_overlap()
198 		node = rb_next(&i->rb);  in drbd_next_overlap()
201 		i = rb_entry(node, struct drbd_interval, rb);  in drbd_next_overlap()