25 	uint64_t	bn_start;  member
36 #define START(node) ((node)->bn_start)
81 		if (bn->bn_start < start && bn->bn_last > last) {
94 			new_bn->bn_start = last + 1;
97 		} else if (bn->bn_start < start) {
105 			bn->bn_start = last + 1;
132 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap64_set()
146 	ASSERT(!right || right->bn_start == last + 1);  in xbitmap64_set()
163 		right->bn_start = start;  in xbitmap64_set()
170 		left->bn_start = start;  in xbitmap64_set()
225 		error = xbitmap64_clear(bitmap, bn->bn_start,  in xbitmap64_disunion()
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()
288 	if (bn->bn_start <= start) {  in xbitmap64_test()
293 	*len = bn->bn_start - start;  in xbitmap64_test()
303 	uint32_t	bn_start;  member
356 		if (bn->bn_start < start && bn->bn_last > last) {
369 			new_bn->bn_start = last + 1;
372 		} else if (bn->bn_start < start) {
380 			bn->bn_start = last + 1;
407 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap32_set()
421 	ASSERT(!right || right->bn_start == last + 1);  in xbitmap32_set()
438 		right->bn_start = start;  in xbitmap32_set()
445 		left->bn_start = start;  in xbitmap32_set()
500 		error = xbitmap32_clear(bitmap, bn->bn_start,  in xbitmap32_disunion()
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()
563 	if (bn->bn_start <= start) {  in xbitmap32_test()
568 	*len = bn->bn_start - start;  in xbitmap32_test()