97 			/* overlaps with the left side of the clearing range */
124 	struct xbitmap64_node	*left;  in xbitmap64_set()  local
130 	left = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last);  in xbitmap64_set()
131 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap64_set()
139 	/* Do we have a left-adjacent extent? */  in xbitmap64_set()
140 	left = xbitmap64_tree_iter_first(&bitmap->xb_root, start - 1, start - 1);  in xbitmap64_set()
141 	ASSERT(!left || left->bn_last + 1 == start);  in xbitmap64_set()
147 	if (left && right) {  in xbitmap64_set()
148 		/* combine left and right adjacent extent */  in xbitmap64_set()
149 		xbitmap64_tree_remove(left, &bitmap->xb_root);  in xbitmap64_set()
151 		left->bn_last = right->bn_last;  in xbitmap64_set()
152 		xbitmap64_tree_insert(left, &bitmap->xb_root);  in xbitmap64_set()
154 	} else if (left) {  in xbitmap64_set()
155 		/* combine with left extent */  in xbitmap64_set()
156 		xbitmap64_tree_remove(left, &bitmap->xb_root);  in xbitmap64_set()
157 		left->bn_last = last;  in xbitmap64_set()
158 		xbitmap64_tree_insert(left, &bitmap->xb_root);  in xbitmap64_set()
166 		left = kmalloc(sizeof(struct xbitmap64_node), XCHK_GFP_FLAGS);  in xbitmap64_set()
167 		if (!left)  in xbitmap64_set()
169 		left->bn_start = start;  in xbitmap64_set()
170 		left->bn_last = last;  in xbitmap64_set()
171 		xbitmap64_tree_insert(left, &bitmap->xb_root);  in xbitmap64_set()
371 			/* overlaps with the left side of the clearing range */
398 	struct xbitmap32_node	*left;  in xbitmap32_set()  local
404 	left = xbitmap32_tree_iter_first(&bitmap->xb_root, start, last);  in xbitmap32_set()
405 	if (left && left->bn_start <= start && left->bn_last >= last)  in xbitmap32_set()
413 	/* Do we have a left-adjacent extent? */  in xbitmap32_set()
414 	left = xbitmap32_tree_iter_first(&bitmap->xb_root, start - 1, start - 1);  in xbitmap32_set()
415 	ASSERT(!left || left->bn_last + 1 == start);  in xbitmap32_set()
421 	if (left && right) {  in xbitmap32_set()
422 		/* combine left and right adjacent extent */  in xbitmap32_set()
423 		xbitmap32_tree_remove(left, &bitmap->xb_root);  in xbitmap32_set()
425 		left->bn_last = right->bn_last;  in xbitmap32_set()
426 		xbitmap32_tree_insert(left, &bitmap->xb_root);  in xbitmap32_set()
428 	} else if (left) {  in xbitmap32_set()
429 		/* combine with left extent */  in xbitmap32_set()
430 		xbitmap32_tree_remove(left, &bitmap->xb_root);  in xbitmap32_set()
431 		left->bn_last = last;  in xbitmap32_set()
432 		xbitmap32_tree_insert(left, &bitmap->xb_root);  in xbitmap32_set()
440 		left = kmalloc(sizeof(struct xbitmap32_node), XCHK_GFP_FLAGS);  in xbitmap32_set()
441 		if (!left)  in xbitmap32_set()
443 		left->bn_start = start;  in xbitmap32_set()
444 		left->bn_last = last;  in xbitmap32_set()
445 		xbitmap32_tree_insert(left, &bitmap->xb_root);  in xbitmap32_set()