Lines Matching defs:head
176 rn_search(v_arg, head)
178 struct radix_node *head;
183 for (x = head, v = v_arg; x->rn_bit >= 0; ) {
196 rn_search_m(v_arg, head, m_arg)
197 struct radix_node *head;
203 for (x = head; x->rn_bit >= 0; ) {
247 rn_lookup(v_arg, m_arg, head)
249 struct radix_node_head *head;
255 x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_offset);
260 x = rn_match(v_arg, head);
304 rn_match(v_arg, head)
306 struct radix_node_head *head;
308 return (rn_match_args(v_arg, head, NULL, NULL));
312 rn_match_args(v_arg, head, rn_leaf_fn, rn_leaf_arg)
314 struct radix_node_head *head;
319 struct radix_node *t = head->rnh_treetop, *x;
482 rn_insert(v_arg, head, dupentry, nodes)
484 struct radix_node_head *head;
489 struct radix_node *top = head->rnh_treetop;
688 rn_addroute(v_arg, n_arg, head, treenodes)
690 struct radix_node_head *head;
695 struct radix_node *saved_tt, *top = head->rnh_treetop;
718 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
741 * the head of the list.
748 /* link in at head of list */
884 rn_delete(v_arg, netmask_arg, head)
886 struct radix_node_head *head;
896 x = head->rnh_treetop;
976 * saved_tt is the head of the dupekey chain.
979 /* remove from head of chain */
1188 rn_inithead(head, off)
1189 void **head;
1194 if (*head)
1202 *head = rnh;