9 sector_t interval_end(struct rb_node *node)  in interval_end()  argument
11 	struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb);  in interval_end()
23 compute_subtree_last(struct drbd_interval *node)  in compute_subtree_last()  argument
25 	sector_t max = node->sector + (node->size >> 9);  in compute_subtree_last()
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()
93 	struct rb_node *node = root->rb_node;  in drbd_contains_interval()  local
95 	while (node) {  in drbd_contains_interval()
97 			rb_entry(node, struct drbd_interval, rb);  in drbd_contains_interval()
100 			node = node->rb_left;  in drbd_contains_interval()
102 			node = node->rb_right;  in drbd_contains_interval()
104 			node = node->rb_left;  in drbd_contains_interval()
106 			node = node->rb_right;  in drbd_contains_interval()
136 	struct rb_node *node = root->rb_node;  in drbd_find_overlap()  local
142 	while (node) {  in drbd_find_overlap()
144 			rb_entry(node, struct drbd_interval, rb);  in drbd_find_overlap()
146 		if (node->rb_left &&  in drbd_find_overlap()
147 		    sector < interval_end(node->rb_left)) {  in drbd_find_overlap()
149 			node = node->rb_left;  in drbd_find_overlap()
156 			node = node->rb_right;  in drbd_find_overlap()
167 	struct rb_node *node;  in drbd_next_overlap()  local
170 		node = rb_next(&i->rb);  in drbd_next_overlap()
171 		if (!node)  in drbd_next_overlap()
173 		i = rb_entry(node, struct drbd_interval, rb);  in drbd_next_overlap()