radix_head
rn_walktree(struct radix_head *h, walktree_f_t *f, void *w)
rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)
rn_detachhead_internal(struct radix_head *head)
struct radix_head * const rnh = arg;
rn_lookup(const void *v_arg, const void *m_arg, struct radix_head *head)
rn_match(const void *v_arg, struct radix_head *head)
rn_insert(void *v_arg, struct radix_head *head, int *dupentry,
*rn_insert(void *, struct radix_head *, int *,
rn_addroute(void *v_arg, const void *n_arg, struct radix_head *head,
static void rn_detachhead_internal(struct radix_head *);
rn_delete(const void *v_arg, const void *netmask_arg, struct radix_head *head)
rn_walktree_from(struct radix_head *h, void *a, void *m,
struct radix_head;
typedef int rn_walktree_t(struct radix_head *head, walktree_f_t *f,
typedef int rn_walktree_from_t(struct radix_head *head,
typedef void rn_close_t(struct radix_node *rn, struct radix_head *head);
struct radix_head rh;
struct radix_head head;
void rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes,
struct radix_node *rn_addroute(void *, const void *, struct radix_head *,
struct radix_node *rn_delete(const void *, const void *, struct radix_head *);
struct radix_head *head);
struct radix_node *rn_match(const void *, struct radix_head *);
int rn_walktree_from(struct radix_head *h, void *a, void *m,
int rn_walktree(struct radix_head *, walktree_f_t *, void *);
struct radix_head * const rnh = arg;
struct radix_head head;
struct radix_head *head = NULL;
struct radix_head *head = NULL;
struct radix_head *head = NULL;