Home
last modified time | relevance | path

Searched refs:rt_root (Results 1 – 6 of 6) sorted by relevance

/titanic_41/usr/src/uts/common/fs/zfs/
H A Drange_tree.c60 for (rs = avl_first(&rt->rt_root); rs != NULL; in range_tree_stat_verify()
61 rs = AVL_NEXT(&rt->rt_root, rs)) { in range_tree_stat_verify()
137 avl_create(&rt->rt_root, range_tree_seg_compare, in range_tree_create()
158 avl_destroy(&rt->rt_root); in range_tree_destroy()
176 rs = avl_find(&rt->rt_root, &rsearch, &where); in range_tree_add()
188 rs_before = avl_nearest(&rt->rt_root, where, AVL_BEFORE); in range_tree_add()
189 rs_after = avl_nearest(&rt->rt_root, where, AVL_AFTER); in range_tree_add()
195 avl_remove(&rt->rt_root, rs_before); in range_tree_add()
227 avl_insert(&rt->rt_root, rs, where); in range_tree_add()
252 rs = avl_find(&rt->rt_root, &rsearch, &where); in range_tree_remove()
[all …]
H A Dspace_reftree.c122 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs)) in space_reftree_add_map()
H A Dspace_map.c213 avl_tree_t *t = &rt->rt_root; in space_map_entries()
242 avl_tree_t *t = &rt->rt_root; in space_map_write()
282 nodes = avl_numnodes(&rt->rt_root); in space_map_write()
331 VERIFY3U(nodes, ==, avl_numnodes(&rt->rt_root)); in space_map_write()
H A Dmetaslab.c987 avl_tree_t *t = &msp->ms_tree->rt_root; in metaslab_ff_alloc()
1017 avl_tree_t *t = &rt->rt_root; in metaslab_df_alloc()
1063 ASSERT3U(avl_numnodes(t), ==, avl_numnodes(&rt->rt_root)); in metaslab_cf_alloc()
1106 avl_tree_t *t = &msp->ms_tree->rt_root; in metaslab_ndf_alloc()
1679 optimal_size = sizeof (uint64_t) * avl_numnodes(&msp->ms_tree->rt_root); in metaslab_should_condense()
1711 avl_numnodes(&msp->ms_tree->rt_root), in metaslab_condense()
H A Dvdev.c1730 rs = avl_first(&vd->vdev_dtl[DTL_MISSING]->rt_root); in vdev_dtl_min()
1746 rs = avl_last(&vd->vdev_dtl[DTL_MISSING]->rt_root); in vdev_dtl_max()
/titanic_41/usr/src/uts/common/fs/zfs/sys/
H A Drange_tree.h45 avl_tree_t rt_root; /* offset-ordered segment AVL tree */ member