28 	uint64_t	bn_last;  member
37 #define LAST(node)  ((node)->bn_last)
81 		if (bn->bn_start < start && bn->bn_last > last) {
82 			uint64_t	old_last = bn->bn_last;
86 			bn->bn_last = start - 1;
95 			new_bn->bn_last = old_last;
100 			bn->bn_last = start - 1;
102 		} else if (bn->bn_last > last) {
132 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap64_set()
142 	ASSERT(!left || left->bn_last + 1 == start);  in xbitmap64_set()
152 		left->bn_last = right->bn_last;  in xbitmap64_set()
158 		left->bn_last = last;  in xbitmap64_set()
171 		left->bn_last = last;  in xbitmap64_set()
226 				bn->bn_last - bn->bn_start + 1);  in xbitmap64_disunion()
243 		ret += bn->bn_last - bn->bn_start + 1;  in xbitmap64_hweight()
259 		error = fn(bn->bn_start, bn->bn_last - bn->bn_start + 1, priv);  in xbitmap64_walk()
289 		if (bn->bn_last < last)  in xbitmap64_test()
290 			*len = bn->bn_last - start + 1;  in xbitmap64_test()
306 	uint32_t	bn_last;  member
356 		if (bn->bn_start < start && bn->bn_last > last) {
357 			uint32_t	old_last = bn->bn_last;
361 			bn->bn_last = start - 1;
370 			new_bn->bn_last = old_last;
375 			bn->bn_last = start - 1;
377 		} else if (bn->bn_last > last) {
407 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap32_set()
417 	ASSERT(!left || left->bn_last + 1 == start);  in xbitmap32_set()
427 		left->bn_last = right->bn_last;  in xbitmap32_set()
433 		left->bn_last = last;  in xbitmap32_set()
446 		left->bn_last = last;  in xbitmap32_set()
501 				bn->bn_last - bn->bn_start + 1);  in xbitmap32_disunion()
518 		ret += bn->bn_last - bn->bn_start + 1;  in xbitmap32_hweight()
534 		error = fn(bn->bn_start, bn->bn_last - bn->bn_start + 1, priv);  in xbitmap32_walk()
564 		if (bn->bn_last < last)  in xbitmap32_test()
565 			*len = bn->bn_last - start + 1;  in xbitmap32_test()