treenode_t
print_tree(uintptr_t addr, uint_t opt_v, treenode_t *tn, char *s)
treenode_t tn;
treenode_t *node;
tree_update_change(nfs_export_t *ne, treenode_t *tnode, timespec_t *change)
tree_add_child(treenode_t *parent, treenode_t *newchild)
static treenode_t *
tree_find_child_by_vis(treenode_t *t, exp_visible_t *vis)
static treenode_t *
tree_prepend_node(treenode_t *n, exp_visible_t *v, exportinfo_t *e)
treenode_t *tnode = kmem_zalloc(sizeof (*tnode), KM_SLEEP);
tree_remove_node(nfs_export_t *ne, treenode_t *node)
treenode_t *parent = node->tree_parent;
treenode_t *s; /* s for sibling */
more_visible(struct exportinfo *exi, treenode_t *tree_head)
treenode_t *child, *curr, *connect_point;
kmem_free(curr, sizeof (treenode_t));
treenode_t *tree_head = NULL;
treenode_t *t2 = tree_head;
treenode_t *tnode, *old_nd;
treenode_t *connect_point = NULL;
treenode_t *tnode = exip->exi_tree;
vis2exi(treenode_t *tnode)
treenode_t *tnode;
treenode_t *ns_root;
extern exportinfo_t *vis2exi(treenode_t *);
extern void tree_update_change(nfs_export_t *, treenode_t *, timespec_t *);