1*0713e232SGeorge Wilson /* 2*0713e232SGeorge Wilson * CDDL HEADER START 3*0713e232SGeorge Wilson * 4*0713e232SGeorge Wilson * The contents of this file are subject to the terms of the 5*0713e232SGeorge Wilson * Common Development and Distribution License (the "License"). 6*0713e232SGeorge Wilson * You may not use this file except in compliance with the License. 7*0713e232SGeorge Wilson * 8*0713e232SGeorge Wilson * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9*0713e232SGeorge Wilson * or http://www.opensolaris.org/os/licensing. 10*0713e232SGeorge Wilson * See the License for the specific language governing permissions 11*0713e232SGeorge Wilson * and limitations under the License. 12*0713e232SGeorge Wilson * 13*0713e232SGeorge Wilson * When distributing Covered Code, include this CDDL HEADER in each 14*0713e232SGeorge Wilson * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15*0713e232SGeorge Wilson * If applicable, add the following below this CDDL HEADER, with the 16*0713e232SGeorge Wilson * fields enclosed by brackets "[]" replaced with your own identifying 17*0713e232SGeorge Wilson * information: Portions Copyright [yyyy] [name of copyright owner] 18*0713e232SGeorge Wilson * 19*0713e232SGeorge Wilson * CDDL HEADER END 20*0713e232SGeorge Wilson */ 21*0713e232SGeorge Wilson /* 22*0713e232SGeorge Wilson * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 23*0713e232SGeorge Wilson * Use is subject to license terms. 24*0713e232SGeorge Wilson */ 25*0713e232SGeorge Wilson 26*0713e232SGeorge Wilson /* 27*0713e232SGeorge Wilson * Copyright (c) 2013 by Delphix. All rights reserved. 28*0713e232SGeorge Wilson */ 29*0713e232SGeorge Wilson 30*0713e232SGeorge Wilson #ifndef _SYS_RANGE_TREE_H 31*0713e232SGeorge Wilson #define _SYS_RANGE_TREE_H 32*0713e232SGeorge Wilson 33*0713e232SGeorge Wilson #include <sys/avl.h> 34*0713e232SGeorge Wilson #include <sys/dmu.h> 35*0713e232SGeorge Wilson 36*0713e232SGeorge Wilson #ifdef __cplusplus 37*0713e232SGeorge Wilson extern "C" { 38*0713e232SGeorge Wilson #endif 39*0713e232SGeorge Wilson 40*0713e232SGeorge Wilson #define RANGE_TREE_HISTOGRAM_SIZE 64 41*0713e232SGeorge Wilson 42*0713e232SGeorge Wilson typedef struct range_tree_ops range_tree_ops_t; 43*0713e232SGeorge Wilson 44*0713e232SGeorge Wilson typedef struct range_tree { 45*0713e232SGeorge Wilson avl_tree_t rt_root; /* offset-ordered segment AVL tree */ 46*0713e232SGeorge Wilson uint64_t rt_space; /* sum of all segments in the map */ 47*0713e232SGeorge Wilson range_tree_ops_t *rt_ops; 48*0713e232SGeorge Wilson void *rt_arg; 49*0713e232SGeorge Wilson 50*0713e232SGeorge Wilson /* 51*0713e232SGeorge Wilson * The rt_histogram maintains a histogram of ranges. Each bucket, 52*0713e232SGeorge Wilson * rt_histogram[i], contains the number of ranges whose size is: 53*0713e232SGeorge Wilson * 2^i <= size of range in bytes < 2^(i+1) 54*0713e232SGeorge Wilson */ 55*0713e232SGeorge Wilson uint64_t rt_histogram[RANGE_TREE_HISTOGRAM_SIZE]; 56*0713e232SGeorge Wilson kmutex_t *rt_lock; /* pointer to lock that protects map */ 57*0713e232SGeorge Wilson } range_tree_t; 58*0713e232SGeorge Wilson 59*0713e232SGeorge Wilson typedef struct range_seg { 60*0713e232SGeorge Wilson avl_node_t rs_node; /* AVL node */ 61*0713e232SGeorge Wilson avl_node_t rs_pp_node; /* AVL picker-private node */ 62*0713e232SGeorge Wilson uint64_t rs_start; /* starting offset of this segment */ 63*0713e232SGeorge Wilson uint64_t rs_end; /* ending offset (non-inclusive) */ 64*0713e232SGeorge Wilson } range_seg_t; 65*0713e232SGeorge Wilson 66*0713e232SGeorge Wilson struct range_tree_ops { 67*0713e232SGeorge Wilson void (*rtop_create)(range_tree_t *rt, void *arg); 68*0713e232SGeorge Wilson void (*rtop_destroy)(range_tree_t *rt, void *arg); 69*0713e232SGeorge Wilson void (*rtop_add)(range_tree_t *rt, range_seg_t *rs, void *arg); 70*0713e232SGeorge Wilson void (*rtop_remove)(range_tree_t *rt, range_seg_t *rs, void *arg); 71*0713e232SGeorge Wilson void (*rtop_vacate)(range_tree_t *rt, void *arg); 72*0713e232SGeorge Wilson }; 73*0713e232SGeorge Wilson 74*0713e232SGeorge Wilson typedef void range_tree_func_t(void *arg, uint64_t start, uint64_t size); 75*0713e232SGeorge Wilson 76*0713e232SGeorge Wilson void range_tree_init(void); 77*0713e232SGeorge Wilson void range_tree_fini(void); 78*0713e232SGeorge Wilson range_tree_t *range_tree_create(range_tree_ops_t *ops, void *arg, kmutex_t *lp); 79*0713e232SGeorge Wilson void range_tree_destroy(range_tree_t *rt); 80*0713e232SGeorge Wilson boolean_t range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size); 81*0713e232SGeorge Wilson uint64_t range_tree_space(range_tree_t *rt); 82*0713e232SGeorge Wilson void range_tree_verify(range_tree_t *rt, uint64_t start, uint64_t size); 83*0713e232SGeorge Wilson void range_tree_swap(range_tree_t **rtsrc, range_tree_t **rtdst); 84*0713e232SGeorge Wilson void range_tree_stat_verify(range_tree_t *rt); 85*0713e232SGeorge Wilson 86*0713e232SGeorge Wilson void range_tree_add(void *arg, uint64_t start, uint64_t size); 87*0713e232SGeorge Wilson void range_tree_remove(void *arg, uint64_t start, uint64_t size); 88*0713e232SGeorge Wilson 89*0713e232SGeorge Wilson void range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg); 90*0713e232SGeorge Wilson void range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg); 91*0713e232SGeorge Wilson 92*0713e232SGeorge Wilson #ifdef __cplusplus 93*0713e232SGeorge Wilson } 94*0713e232SGeorge Wilson #endif 95*0713e232SGeorge Wilson 96*0713e232SGeorge Wilson #endif /* _SYS_RANGE_TREE_H */ 97