Lines Matching defs:tree
33 void *aw_buff; /* buffer to hold tree element */
65 * initialize a forward walk thru an avl tree.
68 * objects in the tree; either or both may be NULL (defaulting to first and
72 * "avl_tree_t" and "tree element" for use in error messages.
84 avl_tree_t *tree;
90 element_name = "tree element";
100 tree = &aw->aw_tree;
101 if (mdb_vread(tree, sizeof (avl_tree_t), wsp->walk_addr) == -1) {
105 if (tree->avl_size < tree->avl_offset + sizeof (avl_node_t)) {
107 wsp->walk_addr, tree->avl_size, tree->avl_offset);
112 * allocate a buffer to hold the mdb copy of tree's structs
115 aw->aw_buff = mdb_zalloc(tree->avl_size, UM_SLEEP);
116 aw->aw_end = (end == NULL ? NULL : end + tree->avl_offset);
123 * as avl_start() -- leftmost child in tree from root
126 addr = (uintptr_t)tree->avl_root;
131 addr = avl_leftmostchild(addr, aw->aw_buff, tree->avl_offset,
132 tree->avl_size, aw->aw_elem_name);
137 wsp->walk_addr = begin + tree->avl_offset;
144 mdb_free(aw->aw_buff, sizeof (tree->avl_size));
174 * in the AVL tree. Uses the same algorithm as avl_walk().
188 * don't walk past the end of the tree!