radix_node_head
register struct radix_node_head *rnh;
rnh = (struct radix_node_head *)calloc(1, sizeof(*rnh));
rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry,
rn_walktree_from(struct radix_node_head *h, void *a, void *m, walktree_f_t *f, void *w)
rn_walktree(struct radix_node_head *h, walktree_f_t *f, void *w)
static int rn_walktree_from(struct radix_node_head *h, void *a, void *m,
rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
static struct radix_node *rn_insert(void *, struct radix_node_head *, int *,
rn_match(void *v_arg, struct radix_node_head *head)
static struct radix_node_head *mask_rnhead;
rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head)
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node_head *head, struct radix_node nodes[]);
(void *v, void *mask, struct radix_node_head *head);
(void *v, void *mask, struct radix_node_head *head);
(void *v, struct radix_node_head *head);
(void *v, void *mask, struct radix_node_head *head);
(void *v, struct radix_node_head *head);
(struct radix_node_head *head, walktree_f_t *f, void *w);
(struct radix_node_head *head, void *a, void *m,
(struct radix_node *rn, struct radix_node_head *head);
struct radix_node *rn_addroute (void *, void *, struct radix_node_head *,
struct radix_node *rn_delete(void *, void *, struct radix_node_head *);
struct radix_node_head *head);
struct radix_node *rn_match(void *, struct radix_node_head *);