Lines Matching refs:rt
54 range_tree_stat_verify(range_tree_t *rt)
60 for (rs = avl_first(&rt->rt_root); rs != NULL;
61 rs = AVL_NEXT(&rt->rt_root, rs)) {
70 if (hist[i] != rt->rt_histogram[i]) {
72 i, hist, hist[i], rt->rt_histogram[i]);
74 VERIFY3U(hist[i], ==, rt->rt_histogram[i]);
79 range_tree_stat_incr(range_tree_t *rt, range_seg_t *rs)
86 sizeof (rt->rt_histogram) / sizeof (*rt->rt_histogram));
88 ASSERT(MUTEX_HELD(rt->rt_lock));
89 rt->rt_histogram[idx]++;
90 ASSERT3U(rt->rt_histogram[idx], !=, 0);
94 range_tree_stat_decr(range_tree_t *rt, range_seg_t *rs)
101 sizeof (rt->rt_histogram) / sizeof (*rt->rt_histogram));
103 ASSERT(MUTEX_HELD(rt->rt_lock));
104 ASSERT3U(rt->rt_histogram[idx], !=, 0);
105 rt->rt_histogram[idx]--;
133 range_tree_t *rt;
135 rt = kmem_zalloc(sizeof (range_tree_t), KM_SLEEP);
137 avl_create(&rt->rt_root, range_tree_seg_compare,
140 rt->rt_lock = lp;
141 rt->rt_ops = ops;
142 rt->rt_arg = arg;
144 if (rt->rt_ops != NULL)
145 rt->rt_ops->rtop_create(rt, rt->rt_arg);
147 return (rt);
151 range_tree_destroy(range_tree_t *rt)
153 VERIFY0(rt->rt_space);
155 if (rt->rt_ops != NULL)
156 rt->rt_ops->rtop_destroy(rt, rt->rt_arg);
158 avl_destroy(&rt->rt_root);
159 kmem_free(rt, sizeof (*rt));
165 range_tree_t *rt = arg;
171 ASSERT(MUTEX_HELD(rt->rt_lock));
176 rs = avl_find(&rt->rt_root, &rsearch, &where);
188 rs_before = avl_nearest(&rt->rt_root, where, AVL_BEFORE);
189 rs_after = avl_nearest(&rt->rt_root, where, AVL_AFTER);
195 avl_remove(&rt->rt_root, rs_before);
196 if (rt->rt_ops != NULL) {
197 rt->rt_ops->rtop_remove(rt, rs_before, rt->rt_arg);
198 rt->rt_ops->rtop_remove(rt, rs_after, rt->rt_arg);
201 range_tree_stat_decr(rt, rs_before);
202 range_tree_stat_decr(rt, rs_after);
208 if (rt->rt_ops != NULL)
209 rt->rt_ops->rtop_remove(rt, rs_before, rt->rt_arg);
211 range_tree_stat_decr(rt, rs_before);
216 if (rt->rt_ops != NULL)
217 rt->rt_ops->rtop_remove(rt, rs_after, rt->rt_arg);
219 range_tree_stat_decr(rt, rs_after);
227 avl_insert(&rt->rt_root, rs, where);
230 if (rt->rt_ops != NULL)
231 rt->rt_ops->rtop_add(rt, rs, rt->rt_arg);
233 range_tree_stat_incr(rt, rs);
234 rt->rt_space += size;
240 range_tree_t *rt = arg;
246 ASSERT(MUTEX_HELD(rt->rt_lock));
248 VERIFY3U(size, <=, rt->rt_space);
252 rs = avl_find(&rt->rt_root, &rsearch, &where);
267 range_tree_stat_decr(rt, rs);
269 if (rt->rt_ops != NULL)
270 rt->rt_ops->rtop_remove(rt, rs, rt->rt_arg);
276 range_tree_stat_incr(rt, newseg);
280 avl_insert_here(&rt->rt_root, newseg, rs, AVL_AFTER);
281 if (rt->rt_ops != NULL)
282 rt->rt_ops->rtop_add(rt, newseg, rt->rt_arg);
288 avl_remove(&rt->rt_root, rs);
294 range_tree_stat_incr(rt, rs);
296 if (rt->rt_ops != NULL)
297 rt->rt_ops->rtop_add(rt, rs, rt->rt_arg);
300 rt->rt_space -= size;
304 range_tree_find_impl(range_tree_t *rt, uint64_t start, uint64_t size)
310 ASSERT(MUTEX_HELD(rt->rt_lock));
315 return (avl_find(&rt->rt_root, &rsearch, &where));
319 range_tree_find(range_tree_t *rt, uint64_t start, uint64_t size)
321 range_seg_t *rs = range_tree_find_impl(rt, start, size);
328 range_tree_verify(range_tree_t *rt, uint64_t off, uint64_t size)
332 mutex_enter(rt->rt_lock);
333 rs = range_tree_find(rt, off, size);
336 mutex_exit(rt->rt_lock);
340 range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size)
342 return (range_tree_find(rt, start, size) != NULL);
350 range_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size)
354 while ((rs = range_tree_find_impl(rt, start, size)) != NULL) {
357 range_tree_remove(rt, free_start, free_end - free_start);
364 range_tree_t *rt;
370 rt = *rtsrc;
372 *rtdst = rt;
376 range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg)
381 ASSERT(MUTEX_HELD(rt->rt_lock));
383 if (rt->rt_ops != NULL)
384 rt->rt_ops->rtop_vacate(rt, rt->rt_arg);
386 while ((rs = avl_destroy_nodes(&rt->rt_root, &cookie)) != NULL) {
392 bzero(rt->rt_histogram, sizeof (rt->rt_histogram));
393 rt->rt_space = 0;
397 range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg)
401 ASSERT(MUTEX_HELD(rt->rt_lock));
403 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))
408 range_tree_space(range_tree_t *rt)
410 return (rt->rt_space);