Lines Matching defs:last

51 			uint64_t last);
55 		       uint64_t last);
78 	uint64_t		last = start + len - 1;
80 	while ((bn = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last))) {
81 		if (bn->bn_start < start && bn->bn_last > last) {
94 			new_bn->bn_start = last + 1;
102 		} else if (bn->bn_last > last) {
105 			bn->bn_start = last + 1;
127 	uint64_t		last = start + len - 1;
131 	left = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last);
132 	if (left && left->bn_start <= start && left->bn_last >= last)
145 	right = xbitmap64_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);
146 	ASSERT(!right || right->bn_start == last + 1);
158 		left->bn_last = last;
171 		left->bn_last = last;
283 	uint64_t		last = start + *len - 1;
285 	bn = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last);
289 		if (bn->bn_last < last)
326 			  uint32_t last);
330 			 uint32_t last);
353 	uint32_t		last = start + len - 1;
355 	while ((bn = xbitmap32_tree_iter_first(&bitmap->xb_root, start, last))) {
356 		if (bn->bn_start < start && bn->bn_last > last) {
369 			new_bn->bn_start = last + 1;
377 		} else if (bn->bn_last > last) {
380 			bn->bn_start = last + 1;
402 	uint32_t		last = start + len - 1;
406 	left = xbitmap32_tree_iter_first(&bitmap->xb_root, start, last);
407 	if (left && left->bn_start <= start && left->bn_last >= last)
420 	right = xbitmap32_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);
421 	ASSERT(!right || right->bn_start == last + 1);
433 		left->bn_last = last;
446 		left->bn_last = last;
558 	uint32_t		last = start + *len - 1;
560 	bn = xbitmap32_tree_iter_first(&bitmap->xb_root, start, last);
564 		if (bn->bn_last < last)