HomeSort by: relevance | last modified time | path
    Searched refs:rt_root (Results 1 - 6 of 6) sorted by relevancy

  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
range_tree.c 60 for (rs = avl_first(&rt->rt_root); rs != NULL;
61 rs = AVL_NEXT(&rt->rt_root, rs)) {
137 avl_create(&rt->rt_root, range_tree_seg_compare,
158 avl_destroy(&rt->rt_root);
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);
227 avl_insert(&rt->rt_root, rs, where);
252 rs = avl_find(&rt->rt_root, &rsearch, &where)
    [all...]
space_reftree.c 122 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))
space_map.c 216 avl_tree_t *t = &rt->rt_root;
245 avl_tree_t *t = &rt->rt_root;
285 nodes = avl_numnodes(&rt->rt_root);
334 VERIFY3U(nodes, ==, avl_numnodes(&rt->rt_root));
metaslab.c 1238 avl_tree_t *t = &msp->ms_tree->rt_root;
1268 avl_tree_t *t = &rt->rt_root;
1314 ASSERT3U(avl_numnodes(t), ==, avl_numnodes(&rt->rt_root));
1357 avl_tree_t *t = &msp->ms_tree->rt_root;
2154 optimal_size = sizeof (uint64_t) * avl_numnodes(&msp->ms_tree->rt_root);
2187 space_map_length(msp->ms_sm), avl_numnodes(&msp->ms_tree->rt_root),
vdev.c 1888 rs = avl_first(&vd->vdev_dtl[DTL_MISSING]->rt_root);
1904 rs = avl_last(&vd->vdev_dtl[DTL_MISSING]->rt_root);
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/sys/
range_tree.h 45 avl_tree_t rt_root; /* offset-ordered segment AVL tree */ member in struct:range_tree

Completed in 26 milliseconds