126 	struct xbitmap64_node	*right;  in xbitmap64_set()  local
145 	right = xbitmap64_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);  in xbitmap64_set()
146 	ASSERT(!right || right->bn_start == last + 1);  in xbitmap64_set()
148 	if (left && right) {  in xbitmap64_set()
151 		xbitmap64_tree_remove(right, &bitmap->xb_root);  in xbitmap64_set()
152 		left->bn_last = right->bn_last;  in xbitmap64_set()
154 		kfree(right);  in xbitmap64_set()
160 	} else if (right) {  in xbitmap64_set()
162 		xbitmap64_tree_remove(right, &bitmap->xb_root);  in xbitmap64_set()
163 		right->bn_start = start;  in xbitmap64_set()
164 		xbitmap64_tree_insert(right, &bitmap->xb_root);  in xbitmap64_set()
401 	struct xbitmap32_node	*right;  in xbitmap32_set()  local
420 	right = xbitmap32_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);  in xbitmap32_set()
421 	ASSERT(!right || right->bn_start == last + 1);  in xbitmap32_set()
423 	if (left && right) {  in xbitmap32_set()
426 		xbitmap32_tree_remove(right, &bitmap->xb_root);  in xbitmap32_set()
427 		left->bn_last = right->bn_last;  in xbitmap32_set()
429 		kfree(right);  in xbitmap32_set()
435 	} else if (right) {  in xbitmap32_set()
437 		xbitmap32_tree_remove(right, &bitmap->xb_root);  in xbitmap32_set()
438 		right->bn_start = start;  in xbitmap32_set()
439 		xbitmap32_tree_insert(right, &bitmap->xb_root);  in xbitmap32_set()