| range_tree.h (332547) | range_tree.h (339034) |
|---|---|
| 1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 37 unchanged lines hidden (view full) --- 46 * must provide external locking if required. 47 */ 48typedef struct range_tree { 49 avl_tree_t rt_root; /* offset-ordered segment AVL tree */ 50 uint64_t rt_space; /* sum of all segments in the map */ 51 range_tree_ops_t *rt_ops; 52 void *rt_arg; 53 | 1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 37 unchanged lines hidden (view full) --- 46 * must provide external locking if required. 47 */ 48typedef struct range_tree { 49 avl_tree_t rt_root; /* offset-ordered segment AVL tree */ 50 uint64_t rt_space; /* sum of all segments in the map */ 51 range_tree_ops_t *rt_ops; 52 void *rt_arg; 53 |
| 54 /* rt_avl_compare should only be set it rt_arg is an AVL tree */ 55 uint64_t rt_gap; /* allowable inter-segment gap */ 56 int (*rt_avl_compare)(const void *, const void *); |
|
| 54 /* 55 * The rt_histogram maintains a histogram of ranges. Each bucket, 56 * rt_histogram[i], contains the number of ranges whose size is: 57 * 2^i <= size of range in bytes < 2^(i+1) 58 */ 59 uint64_t rt_histogram[RANGE_TREE_HISTOGRAM_SIZE]; 60} range_tree_t; 61 62typedef struct range_seg { 63 avl_node_t rs_node; /* AVL node */ 64 avl_node_t rs_pp_node; /* AVL picker-private node */ 65 uint64_t rs_start; /* starting offset of this segment */ 66 uint64_t rs_end; /* ending offset (non-inclusive) */ | 57 /* 58 * The rt_histogram maintains a histogram of ranges. Each bucket, 59 * rt_histogram[i], contains the number of ranges whose size is: 60 * 2^i <= size of range in bytes < 2^(i+1) 61 */ 62 uint64_t rt_histogram[RANGE_TREE_HISTOGRAM_SIZE]; 63} range_tree_t; 64 65typedef struct range_seg { 66 avl_node_t rs_node; /* AVL node */ 67 avl_node_t rs_pp_node; /* AVL picker-private node */ 68 uint64_t rs_start; /* starting offset of this segment */ 69 uint64_t rs_end; /* ending offset (non-inclusive) */ |
| 70 uint64_t rs_fill; /* actual fill if gap mode is on */ |
|
| 67} range_seg_t; 68 69struct range_tree_ops { 70 void (*rtop_create)(range_tree_t *rt, void *arg); 71 void (*rtop_destroy)(range_tree_t *rt, void *arg); 72 void (*rtop_add)(range_tree_t *rt, range_seg_t *rs, void *arg); 73 void (*rtop_remove)(range_tree_t *rt, range_seg_t *rs, void *arg); 74 void (*rtop_vacate)(range_tree_t *rt, void *arg); 75}; 76 77typedef void range_tree_func_t(void *arg, uint64_t start, uint64_t size); 78 79void range_tree_init(void); 80void range_tree_fini(void); | 71} range_seg_t; 72 73struct range_tree_ops { 74 void (*rtop_create)(range_tree_t *rt, void *arg); 75 void (*rtop_destroy)(range_tree_t *rt, void *arg); 76 void (*rtop_add)(range_tree_t *rt, range_seg_t *rs, void *arg); 77 void (*rtop_remove)(range_tree_t *rt, range_seg_t *rs, void *arg); 78 void (*rtop_vacate)(range_tree_t *rt, void *arg); 79}; 80 81typedef void range_tree_func_t(void *arg, uint64_t start, uint64_t size); 82 83void range_tree_init(void); 84void range_tree_fini(void); |
| 81range_tree_t *range_tree_create(range_tree_ops_t *ops, void *arg); | 85range_tree_t *range_tree_create_impl(range_tree_ops_t *ops, void *arg, 86 int (*avl_compare)(const void*, const void*), uint64_t gap); 87 range_tree_t *range_tree_create(range_tree_ops_t *ops, void *arg); |
| 82void range_tree_destroy(range_tree_t *rt); 83boolean_t range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size); | 88void range_tree_destroy(range_tree_t *rt); 89boolean_t range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size); |
| 90range_seg_t *range_tree_find(range_tree_t *rt, uint64_t start, uint64_t size); 91void range_tree_resize_segment(range_tree_t *rt, range_seg_t *rs, 92 uint64_t newstart, uint64_t newsize); |
|
| 84uint64_t range_tree_space(range_tree_t *rt); 85boolean_t range_tree_is_empty(range_tree_t *rt); 86void range_tree_verify(range_tree_t *rt, uint64_t start, uint64_t size); 87void range_tree_swap(range_tree_t **rtsrc, range_tree_t **rtdst); 88void range_tree_stat_verify(range_tree_t *rt); 89 90void range_tree_add(void *arg, uint64_t start, uint64_t size); 91void range_tree_remove(void *arg, uint64_t start, uint64_t size); | 93uint64_t range_tree_space(range_tree_t *rt); 94boolean_t range_tree_is_empty(range_tree_t *rt); 95void range_tree_verify(range_tree_t *rt, uint64_t start, uint64_t size); 96void range_tree_swap(range_tree_t **rtsrc, range_tree_t **rtdst); 97void range_tree_stat_verify(range_tree_t *rt); 98 99void range_tree_add(void *arg, uint64_t start, uint64_t size); 100void range_tree_remove(void *arg, uint64_t start, uint64_t size); |
| 101void range_tree_remove_fill(range_tree_t *rt, uint64_t start, uint64_t size); 102void range_tree_adjust_fill(range_tree_t *rt, range_seg_t *rs, int64_t delta); |
|
| 92void range_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size); 93 94void range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg); 95void range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg); | 103void range_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size); 104 105void range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg); 106void range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg); |
| 107range_seg_t *range_tree_first(range_tree_t *rt); |
|
| 96 | 108 |
| 109void rt_avl_create(range_tree_t *rt, void *arg); 110void rt_avl_destroy(range_tree_t *rt, void *arg); 111void rt_avl_add(range_tree_t *rt, range_seg_t *rs, void *arg); 112void rt_avl_remove(range_tree_t *rt, range_seg_t *rs, void *arg); 113void rt_avl_vacate(range_tree_t *rt, void *arg); 114extern struct range_tree_ops rt_avl_ops; 115 116void rt_avl_create(range_tree_t *rt, void *arg); 117void rt_avl_destroy(range_tree_t *rt, void *arg); 118void rt_avl_add(range_tree_t *rt, range_seg_t *rs, void *arg); 119void rt_avl_remove(range_tree_t *rt, range_seg_t *rs, void *arg); 120void rt_avl_vacate(range_tree_t *rt, void *arg); 121extern struct range_tree_ops rt_avl_ops; 122 |
|
| 97#ifdef __cplusplus 98} 99#endif 100 101#endif /* _SYS_RANGE_TREE_H */ | 123#ifdef __cplusplus 124} 125#endif 126 127#endif /* _SYS_RANGE_TREE_H */ |