dist/server/leasechain.c

163 	size_t mid_index = ((max - min)/2) + min;
165 	if ((lc->list[mid_index]->sort_time > lp->sort_time) ||
166 	    ((lc->list[mid_index]->sort_time == lp->sort_time) &&
167 	     (lc->list[mid_index]->sort_tiebreaker > lp->sort_tiebreaker))) {
168 		if (mid_index == min) {
174 						      min, mid_index - 1));
175 	} else  if ((lc->list[mid_index]->sort_time < lp->sort_time) ||
176 		    ((lc->list[mid_index]->sort_time == lp->sort_time) &&
177 		     (lc->list[mid_index]->sort_tiebreaker < lp->sort_tiebreaker))) {
178 		if (mid_index == max) {
179 			/* insert in mid_index + 1 as sort_time is smaller */
180 			return (mid_index+1);
184 						      mid_index + 1, max));
188 	return (mid_index);
212 	size_t mid_index;
220 	mid_index = ((max - min)/2) + min;
222 	if ((lc->list[mid_index]->sort_time > lp->sort_time) ||
223 	    ((lc->list[mid_index]->sort_time == lp->sort_time) &&
224 	     (lc->list[mid_index]->sort_tiebreaker > lp->sort_tiebreaker))) {
225 		if (mid_index == min) {
230 		return (lc_binary_search_lease(lc, lp, min, mid_index - 1));
231 	} else if ((lc->list[mid_index]->sort_time < lp->sort_time) ||
232 		   ((lc->list[mid_index]->sort_time == lp->sort_time) &&
233 		    (lc->list[mid_index]->sort_tiebreaker < lp->sort_tiebreaker))) {
235 		return (lc_binary_search_lease(lc, lp, mid_index + 1, max));
244 	if (lp == lc->list[mid_index]) {
245 		return (mid_index);
248 	/* Check out entries below the mid_index */
249 	if (mid_index > min) {
254 		for (i = mid_index - 1; ; i--) {
269 	/* Check out entries above the mid_index */
270 	if (mid_index < max) {
274 		for (i = mid_index + 1; i <= max; i++) {