10 sector_t interval_end(struct rb_node *node)  in interval_end()  argument
12 	struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb);  in interval_end()
16 #define NODE_END(node) ((node)->sector + ((node)->size >> 9))  argument
72 	struct rb_node *node = root->rb_node;  in drbd_contains_interval()  local
74 	while (node) {  in drbd_contains_interval()
76 			rb_entry(node, struct drbd_interval, rb);  in drbd_contains_interval()
79 			node = node->rb_left;  in drbd_contains_interval()
81 			node = node->rb_right;  in drbd_contains_interval()
83 			node = node->rb_left;  in drbd_contains_interval()
85 			node = node->rb_right;  in drbd_contains_interval()
120 	struct rb_node *node = root->rb_node;  in drbd_find_overlap()  local
126 	while (node) {  in drbd_find_overlap()
128 			rb_entry(node, struct drbd_interval, rb);  in drbd_find_overlap()
130 		if (node->rb_left &&  in drbd_find_overlap()
131 		    sector < interval_end(node->rb_left)) {  in drbd_find_overlap()
133 			node = node->rb_left;  in drbd_find_overlap()
140 			node = node->rb_right;  in drbd_find_overlap()
151 	struct rb_node *node;  in drbd_next_overlap()  local
154 		node = rb_next(&i->rb);  in drbd_next_overlap()
155 		if (!node)  in drbd_next_overlap()
157 		i = rb_entry(node, struct drbd_interval, rb);  in drbd_next_overlap()