0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * CDDL HEADER START
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * The contents of this file are subject to the terms of the
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * Common Development and Distribution License (the "License").
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * You may not use this file except in compliance with the License.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * See the License for the specific language governing permissions
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * and limitations under the License.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * When distributing Covered Code, include this CDDL HEADER in each
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * If applicable, add the following below this CDDL HEADER, with the
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * fields enclosed by brackets "[]" replaced with your own identifying
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * information: Portions Copyright [yyyy] [name of copyright owner]
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * CDDL HEADER END
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * Copyright 2009 Sun Microsystems, Inc. All rights reserved.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * Use is subject to license terms.
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens * Copyright (c) 2013, 2014 by Delphix. All rights reserved.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson range_seg_cache = kmem_cache_create("range_seg_cache",
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson sizeof (range_seg_t), 0, NULL, NULL, NULL, NULL, NULL, 0);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson uint64_t hist[RANGE_TREE_HISTOGRAM_SIZE] = { 0 };
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson for (rs = avl_first(&rt->rt_root); rs != NULL;
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson for (i = 0; i < RANGE_TREE_HISTOGRAM_SIZE; i++) {
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson zfs_dbgmsg("i=%d, hist=%p, hist=%llu, rt_hist=%llu",
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_stat_incr(range_tree_t *rt, range_seg_t *rs)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson sizeof (rt->rt_histogram) / sizeof (*rt->rt_histogram));
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_stat_decr(range_tree_t *rt, range_seg_t *rs)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson sizeof (rt->rt_histogram) / sizeof (*rt->rt_histogram));
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson * NOTE: caller is responsible for all locking.
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_seg_compare(const void *x1, const void *x2)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_create(range_tree_ops_t *ops, void *arg, kmutex_t *lp)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rt = kmem_zalloc(sizeof (range_tree_t), KM_SLEEP);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson avl_create(&rt->rt_root, range_tree_seg_compare,
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson sizeof (range_seg_t), offsetof(range_seg_t, rs_node));
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_add(void *arg, uint64_t start, uint64_t size)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson range_seg_t rsearch, *rs_before, *rs_after, *rs;
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rs = avl_find(&rt->rt_root, &rsearch, &where);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson if (rs != NULL && rs->rs_start <= start && rs->rs_end >= end) {
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson zfs_panic_recover("zfs: allocating allocated segment"
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson "(offset=%llu size=%llu)\n",
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson /* Make sure we don't overlap with either of our neighbors */
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rs_before = avl_nearest(&rt->rt_root, where, AVL_BEFORE);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rs_after = avl_nearest(&rt->rt_root, where, AVL_AFTER);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson merge_before = (rs_before != NULL && rs_before->rs_end == start);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson merge_after = (rs_after != NULL && rs_after->rs_start == end);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rt->rt_ops->rtop_remove(rt, rs_before, rt->rt_arg);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rt->rt_ops->rtop_remove(rt, rs_after, rt->rt_arg);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rt->rt_ops->rtop_remove(rt, rs_before, rt->rt_arg);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rt->rt_ops->rtop_remove(rt, rs_after, rt->rt_arg);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rs = kmem_cache_alloc(range_seg_cache, KM_SLEEP);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_remove(void *arg, uint64_t start, uint64_t size)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson rs = avl_find(&rt->rt_root, &rsearch, &where);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson /* Make sure we completely overlap with someone */
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson zfs_panic_recover("zfs: freeing free segment "
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson "(offset=%llu size=%llu)",
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson newseg = kmem_cache_alloc(range_seg_cache, KM_SLEEP);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson avl_insert_here(&rt->rt_root, newseg, rs, AVL_AFTER);
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrensrange_tree_find_impl(range_tree_t *rt, uint64_t start, uint64_t size)
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens return (avl_find(&rt->rt_root, &rsearch, &where));
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrensrange_tree_find(range_tree_t *rt, uint64_t start, uint64_t size)
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens range_seg_t *rs = range_tree_find_impl(rt, start, size);
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens if (rs != NULL && rs->rs_start <= start && rs->rs_end >= start + size)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_verify(range_tree_t *rt, uint64_t off, uint64_t size)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson panic("freeing free block; rs=%p", (void *)rs);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size)
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens return (range_tree_find(rt, start, size) != NULL);
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens * Ensure that this range is not in the tree, regardless of whether
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens * it is currently in the tree.
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrensrange_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size)
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens while ((rs = range_tree_find_impl(rt, start, size)) != NULL) {
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens uint64_t free_start = MAX(rs->rs_start, start);
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens uint64_t free_end = MIN(rs->rs_end, start + size);
bf16b11e8deb633dd6c4296d46e92399d1582df4Matthew Ahrens range_tree_remove(rt, free_start, free_end - free_start);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_swap(range_tree_t **rtsrc, range_tree_t **rtdst)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson while ((rs = avl_destroy_nodes(&rt->rt_root, &cookie)) != NULL) {
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson func(arg, rs->rs_start, rs->rs_end - rs->rs_start);
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson bzero(rt->rt_histogram, sizeof (rt->rt_histogram));
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilsonrange_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg)
0713e232b7712cd27d99e1e935ebb8d5de61c57dGeorge Wilson for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))