node_t
node_t object_type;
#define sgfrunode_t node_t
if ((node = lmalloc(sizeof (node_t))) == NULL)
lfree(node, sizeof (node_t));
lfree(node, sizeof (node_t));
lfree(node, sizeof (node_t));
lfree(node, sizeof (node_t));
lfree(node, sizeof (node_t));
lfree(node, sizeof (node_t));
_insert_nolock(pid_t pid, int fd, node_t *new)
node_t *prev;
node_t *curr;
lfree(new, sizeof (node_t));
node_t *node;
if ((node = lmalloc(sizeof (node_t))) == NULL)
node_t *prev;
node_t *curr;
lfree(curr, sizeof (node_t));
static node_t *head = NULL;
static void _insert_nolock(pid_t, int, node_t *);
node_t *curr;
node_t *node;
static void freetriev6nodes(node_t **);
freetriev6nodes(node_t **inNode)
node_t *anode = *inNode;
node_t *tnode;
node_t *s[130]; /* stack of previous nodes */
node_t *root = *inNode; /* pointer to root node */
sizeof (node_t), 0, NULL, NULL, NULL, NULL, NULL, 0);
t_split(node_t **c_node, uint8_t pos, uint8_t key_len)
node_t *nodep = *c_node;
node_t *tnodep = NULL;
node_t *c_node;
node_t *c_node;
static void t_split(node_t **, uint8_t, uint8_t);
t_traverse_delete(node_t **in_node, uint8_t pos, key_t id, uint32_t key,
static boolean_t t_traverse_delete(node_t **, uint8_t, key_t, uint32_t,
node_t *c_node = *in_node;
node_t *t_node;
node_t *
node_t *buf = kmem_cache_alloc(trie_node_cache, flag);
node_t *c_node;
node_t *c_node;
node_t *c_node;
node_t *c_node;
extern node_t *create_node(int);
const node_t *nodep)
size_t size = (size_t)(frup->fru_cnt * sizeof (node_t));
node_t *nodep)
node_t *np;
node_t *clistp;
ssize = (size_t)(max_cnt * sizeof (node_t));
clistp = (node_t *)kmem_zalloc(ssize, KM_SLEEP);
node_t node;
fru_info_t *fru, node_t *nodep);
const frup_info_t *frup, const node_t *nodep);
int fru_get_children(fru_hdl_t parent, node_t *children, int max_children);
int fru_get_node_info(fru_hdl_t node_hdl, node_t *node);