59  * is not to bridge gaps (i.e. the maximum allowed gap size is 0).
207     uint64_t gap, uint64_t flags, const char *name)  in ZFS_BTREE_FIND_IN_BUF_FUNC()
238 	rt->rt_gap = gap;  in ZFS_BTREE_FIND_IN_BUF_FUNC()
255     uint64_t gap)  in zfs_range_tree_create_gap()  argument
257 	return (zfs_range_tree_create_impl(ops, type, arg, start, shift, gap,  in zfs_range_tree_create_gap()
327 	uint64_t end = start + size, gap = rt->rt_gap;  in zfs_range_tree_add_impl()  local
340 	 * If this is a gap-supporting range tree, it is possible that we  in zfs_range_tree_add_impl()
350 		if (gap == 0) {  in zfs_range_tree_add_impl()
384 	 * If gap != 0, we might need to merge with our neighbors even if we  in zfs_range_tree_add_impl()
392 	    start - gap);  in zfs_range_tree_add_impl()
394 	    end + gap);  in zfs_range_tree_add_impl()
396 	if (merge_before && gap != 0)  in zfs_range_tree_add_impl()
398 	if (merge_after && gap != 0)  in zfs_range_tree_add_impl()
454 	if (gap != 0) {  in zfs_range_tree_add_impl()
507 	 * Range trees with gap support must only remove complete segments  in zfs_range_tree_remove_impl()
524 			    "of gap tree (offset=%llx size=%llx) of "  in zfs_range_tree_remove_impl()