16 #define NODE_END(node) ((node)->sector + ((node)->size >> 9))
28 	sector_t this_end = this->sector + (this->size >> 9);  in drbd_insert_interval()
39 		if (this->sector < here->sector)  in drbd_insert_interval()
41 		else if (this->sector > here->sector)  in drbd_insert_interval()
60  * @sector:	start sector of @interval
63  * Returns if the tree contains the node @interval with start sector @start.
66  * sector number.
69 drbd_contains_interval(struct rb_root *root, sector_t sector,  in drbd_contains_interval()  argument
78 		if (sector < here->sector)  in drbd_contains_interval()
80 		else if (sector > here->sector)  in drbd_contains_interval()
106  * drbd_find_overlap  - search for an interval overlapping with [sector, sector + size)
108  * @sector:	start sector
111  * Returns an interval overlapping with [sector, sector + size), or NULL if
113  * tree, the interval with the lowest start sector is returned, and all other
118 drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size)  in drbd_find_overlap()  argument
122 	sector_t end = sector + (size >> 9);  in drbd_find_overlap()
131 		    sector < interval_end(node->rb_left)) {  in drbd_find_overlap()
134 		} else if (here->sector < end &&  in drbd_find_overlap()
135 			   sector < here->sector + (here->size >> 9)) {  in drbd_find_overlap()
138 		} else if (sector >= here->sector) {  in drbd_find_overlap()
148 drbd_next_overlap(struct drbd_interval *i, sector_t sector, unsigned int size)  in drbd_next_overlap()  argument
150 	sector_t end = sector + (size >> 9);  in drbd_next_overlap()
158 		if (i->sector >= end)  in drbd_next_overlap()
160 		if (sector < i->sector + (i->size >> 9))  in drbd_next_overlap()