58  * is not to bridge gaps (i.e. the maximum allowed gap size is 0).
204     void *arg, uint64_t start, uint64_t shift, uint64_t gap)  in ZFS_BTREE_FIND_IN_BUF_FUNC()
235 	rt->rt_gap = gap;  in ZFS_BTREE_FIND_IN_BUF_FUNC()
297 	uint64_t end = start + size, gap = rt->rt_gap;  in range_tree_add_impl()  local
310 	 * If this is a gap-supporting range tree, it is possible that we  in range_tree_add_impl()
318 		if (gap == 0) {  in range_tree_add_impl()
351 	 * If gap != 0, we might need to merge with our neighbors even if we  in range_tree_add_impl()
359 	    start - gap);  in range_tree_add_impl()
361 	    gap);  in range_tree_add_impl()
363 	if (merge_before && gap != 0)  in range_tree_add_impl()
365 	if (merge_after && gap != 0)  in range_tree_add_impl()
421 	if (gap != 0) {  in range_tree_add_impl()
470 	 * Range trees with gap support must only remove complete segments  in range_tree_remove_impl()
488 			    "gap tree (offset=%llx size=%llx) of "  in range_tree_remove_impl()