Lines Matching refs:head
115 rn_search(void *v_arg, struct radix_node *head)
120 for (x = head, v = v_arg; x->rn_b >= 0; ) {
130 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
135 for (x = head; x->rn_b >= 0; ) {
169 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
175 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) ==
182 x = rn_match(v_arg, head);
218 rn_match(void *v_arg, struct radix_node_head *head)
221 struct radix_node *t = head->rnh_treetop, *x;
358 rn_insert(void* v_arg, struct radix_node_head *head, boolean_t *dupentry,
362 struct radix_node *top = head->rnh_treetop;
544 rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
549 struct radix_node *saved_tt, *top = head->rnh_treetop;
574 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
597 * the head of the list.
601 /* link in at head of list */
709 rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head)
720 x = head->rnh_treetop;
954 rn_inithead(void **head, uint_t off)
958 if (*head)
962 *head = rnh;