radix_node_head
extern struct radix_node_head *rhead;
rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
rn_match(void *v_arg, struct radix_node_head *head)
rn_insert(void* v_arg, struct radix_node_head *head, boolean_t *dupentry,
static struct radix_node_head *mask_rnhead;
rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
*rn_addroute(void *, void *, struct radix_node_head *,
*rn_delete(void *, void *, struct radix_node_head *),
*rn_insert(void *, struct radix_node_head *, boolean_t *,
*rn_match(void *, struct radix_node_head *),
static struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head)
rn_walktree(struct radix_node_head *h,
struct radix_node_head *rnh;
(void *v, void *mask, struct radix_node_head *head,
(void *v, void *mask, struct radix_node_head *head,
(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);
int (*rnh_walktree)(struct radix_node_head *head,
int rn_walktree(struct radix_node_head *,
struct radix_node_head *rhead; /* root of the radix tree */
static struct radix_node_head *mask_rnhead;
struct radix_node_head *h;
struct radix_node_head *h;
struct radix_node_head *rnh;
R_ZallocSleep(rnh, struct radix_node_head *, sizeof (*rnh));
struct radix_node_head *rnh = p;
struct radix_node_head *rnh;
struct radix_node_head *head;
struct radix_node_head *head;
struct radix_node_head *head;
struct radix_node_head *head;
struct radix_node_head *head;
static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
static int rn_walktree_mt(struct radix_node_head *, walktree_f_t *,
*rn_insert(void *, struct radix_node_head *, int *,
*rn_lookup(void *, void *, struct radix_node_head *),
*rn_match(void *, struct radix_node_head *),
*rn_match_args(void *, struct radix_node_head *, match_leaf_t *,
*rn_addroute(void *, void *, struct radix_node_head *,
*rn_delete(void *, void *, struct radix_node_head *);
struct radix_node_head *head;
struct radix_node_head *ips_ip_ftable;
struct radix_node_head *rnh = p;
struct radix_node_head *rnh;
extern void rn_freehead __P((struct radix_node_head *));
struct radix_node_head *ipo_head;
struct radix_node_head *ifs_mask_rnhead;
struct radix_node_head *head, struct radix_node nodes[]));
struct radix_node_head *head, struct radix_node nodes[]));
__P((void *v, void *mask, struct radix_node_head *head));
__P((void *v, void *mask, struct radix_node_head *head));
__P((void *v, struct radix_node_head *head));
__P((void *v, void *mask, struct radix_node_head *head));
__P((void *v, struct radix_node_head *head));
__P((struct radix_node_head *,
void rn_freehead __P((struct radix_node_head *));
int rn_inithead0 __P((struct radix_node_head *, int));
int rn_walktree __P((struct radix_node_head *,
*rn_addroute __P((void *, void *, struct radix_node_head *,
*rn_delete __P((void *, void *, struct radix_node_head *)),
*rn_insert __P((void *, struct radix_node_head *, int *,
*rn_lookup __P((void *, void *, struct radix_node_head *)),
*rn_match __P((void *, struct radix_node_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, 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, walktree_f_t *f, void *w,
(struct radix_node_head *head, void *a, void *m,
(struct radix_node *rn, struct radix_node_head *head);
typedef struct radix_node_head rnh_t;
void rn_freehead(struct radix_node_head *);