25 	sector_t max = node->sector + (node->size >> 9);  in compute_subtree_last()
50 	sector_t this_end = this->sector + (this->size >> 9);  in drbd_insert_interval()
61 		if (this->sector < here->sector)  in drbd_insert_interval()
63 		else if (this->sector > here->sector)  in drbd_insert_interval()
90 drbd_contains_interval(struct rb_root *root, sector_t sector,  in drbd_contains_interval()  argument
99 		if (sector < here->sector)  in drbd_contains_interval()
101 		else if (sector > here->sector)  in drbd_contains_interval()
134 drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size)  in drbd_find_overlap()  argument
138 	sector_t end = sector + (size >> 9);  in drbd_find_overlap()
147 		    sector < interval_end(node->rb_left)) {  in drbd_find_overlap()
150 		} else if (here->sector < end &&  in drbd_find_overlap()
151 			   sector < here->sector + (here->size >> 9)) {  in drbd_find_overlap()
154 		} else if (sector >= here->sector) {  in drbd_find_overlap()
164 drbd_next_overlap(struct drbd_interval *i, sector_t sector, unsigned int size)  in drbd_next_overlap()  argument
166 	sector_t end = sector + (size >> 9);  in drbd_next_overlap()
174 		if (i->sector >= end)  in drbd_next_overlap()
176 		if (sector < i->sector + (i->size >> 9))  in drbd_next_overlap()