radix_node
struct radix_node rt_nodes[2]; /* radix tree glue */
int walk_bad(struct radix_node *, struct walkarg *);
walk_supply(struct radix_node *rn,
static struct radix_node *
struct radix_node *head,
struct radix_node *x;
static struct radix_node *
struct radix_node *x;
struct radix_node *leaf,
static struct radix_node *
struct radix_node *t = head->rnh_treetop, *x;
struct radix_node *saved_t, *top = t;
struct radix_node *rn_clist;
static struct radix_node *
rn_newpair(void *v, int b, struct radix_node nodes[2])
struct radix_node *tt = nodes, *t = tt + 1;
static struct radix_node *
struct radix_node nodes[2])
struct radix_node *top = head->rnh_treetop;
struct radix_node *t = rn_search(v_arg, top);
struct radix_node *tt;
struct radix_node *p, *x = top;
static struct radix_node *
struct radix_node *x;
struct radix_node *saved_x;
x = (struct radix_node *)rtmalloc(max_keylen + 2*sizeof(*x),
rn_new_radix_mask(struct radix_node *tt,
static struct radix_node *
struct radix_node treenodes[2])
struct radix_node *t, *x = NULL, *tt;
struct radix_node *saved_tt, *top = head->rnh_treetop;
static int rn_satisfies_leaf(char *, struct radix_node *, int);
static struct radix_node *rn_addmask(void *n_arg, int search, int skip);
static struct radix_node *rn_addroute(void *v_arg, void *n_arg,
struct radix_node_head *head, struct radix_node treenodes[2]);
struct radix_node *xx = x;
static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head);
static struct radix_node *
struct radix_node *t, *p, *x, *tt;
struct radix_node *dupedkey, *saved_tt, *top;
int (*f)(struct radix_node *, struct walkarg *),
struct radix_node *base, *next;
struct radix_node *rn = h->rnh_treetop;
struct radix_node *t, *tt, *ttt;
static struct radix_node *
struct radix_node *head)
struct radix_node *x;
struct radix_node *rnh_treetop;
struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
int (*f)(struct radix_node *, struct walkarg *),
struct radix_node rnh_nodes[3]; /* empty tree for common case */
int (*)(struct radix_node *, struct walkarg *),
struct radix_node *rn_p; /* parent */
struct radix_node *rn_Dupedkey;
struct radix_node *rn_L;/* progeny */
struct radix_node *rn_R;/* progeny */
struct radix_node *rn_twin;
struct radix_node *rn_ybro;
struct radix_node *rmu_leaf; /* for normal routes */
walk_kern(struct radix_node *rn,
walk_bad(struct radix_node *rn,
walk_age(struct radix_node *rn,
walk_trace(struct radix_node *rn,
struct radix_node a_nodes[2];
struct radix_node *node;
struct radix_node *dnode __diagused, *node;
struct radix_node *node;
struct radix_node *rn;
vfs_free_netcred(struct radix_node *rn, void *w)
static int vfs_free_netcred(struct radix_node *rn, void *w);
struct radix_node netc_rnodes[2];
struct radix_node pfrke_node[2];
struct radix_node *base, *next;
struct radix_node *rn = h->rnh_treetop;
rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)
struct radix_node *t, *tt, *ttt;
rn_freeentry(struct radix_node *rn, void *arg)
struct radix_node *x;
x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
static struct radix_node *
rn_search(const void *v_arg, struct radix_node *head)
struct radix_node *x;
static struct radix_node *
rn_search_m(const void *v_arg, struct radix_node *head, void *m_arg)
struct radix_node *x;
struct radix_node *
struct radix_node *x;
rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip)
struct radix_node *
struct radix_node *t = head->rnh_treetop, *x;
struct radix_node *saved_t, *top = t;
struct radix_node *
rn_nextprefix(struct radix_node *rn)
struct radix_node *rn_clist;
static struct radix_node *
rn_newpair(void *v, int b, struct radix_node nodes[2])
struct radix_node *tt = nodes, *t = tt + 1;
static struct radix_node *
struct radix_node nodes[2])
struct radix_node *top = head->rnh_treetop;
struct radix_node *t = rn_search(v_arg, top);
struct radix_node *p, *tt, *x;
static struct radix_node *
struct radix_node *x;
struct radix_node *saved_x;
R_Zalloc(x, struct radix_node *, RADIX_MAX_KEY_LEN + 2 * sizeof (*x));
static struct radix_node
struct radix_node [2]),
*rn_newpair(void *, int, struct radix_node[2]),
*rn_search(const void *, struct radix_node *),
rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)
*rn_search_m(const void *, struct radix_node *, void *);
static struct radix_node *rn_addmask(const void *, struct radix_mask_head *, int,int);
struct radix_node *
struct radix_node treenodes[2])
struct radix_node *t, *x = NULL, *tt;
struct radix_node *saved_tt, *top = head->rnh_treetop;
struct radix_node *xx = x;
rn_new_radix_mask(struct radix_node *tt,
struct radix_node *
struct radix_node *t, *p, *x, *tt;
struct radix_node *dupedkey, *saved_tt, *top;
static int rn_satisfies_leaf(const char *trial, struct radix_node *leaf,
struct radix_node *base, *next;
struct radix_node *rn, *last = NULL; /* shut up gcc */
typedef int walktree_f_t(struct radix_node *, void *);
typedef struct radix_node *rn_matchaddr_f_t(const void *v,
typedef struct radix_node *rn_addaddr_f_t(void *v, const void *mask,
typedef struct radix_node *rn_deladdr_f_t(const void *v, const void *mask,
typedef struct radix_node *rn_lookup_f_t(const void *v, const void *mask,
typedef void rn_close_t(struct radix_node *rn, struct radix_head *head);
struct radix_node *rn_nextprefix(struct radix_node *rn);
struct radix_node *rnh_treetop;
struct radix_node rnh_nodes[3]; /* empty tree for common case */
struct radix_node mask_nodes[3];
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[2]);
struct radix_node *rn_delete(const void *, const void *, struct radix_head *);
struct radix_node *rn_lookup (const void *v_arg, const void *m_arg,
struct radix_node *rn_match(const void *, struct radix_head *);
struct radix_node *rn_parent; /* parent */
struct radix_node *rn_Dupedkey;
struct radix_node *rn_L;/* progeny */
struct radix_node *rn_R;/* progeny */
struct radix_node *rn_twin;
struct radix_node *rn_ybro;
struct radix_node *rmu_leaf; /* for normal routes */
rt_freeentry(struct radix_node *rn, void *arg)
struct radix_node *x;
x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
struct radix_node *rn;
struct radix_node *rn;
rt_checkdelroute(struct radix_node *rn, void *arg)
rt_delete_unconditional(struct radix_node *rn, void *arg)
rt_dumpentry_ddb(struct radix_node *rn, void *arg __unused)
struct radix_node *rn;
struct radix_node *rn;
rn = (struct radix_node *)rt;
struct radix_node *rn;
rn = (struct radix_node *)rt;
struct radix_node rt_nodes[2]; /* tree glue, and other values */
struct radix_node rnh_nodes[3]; /* empty tree for common case */
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node rn[2];
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node rn[2];
struct radix_node rn[2];
struct radix_node rn[2];
static int flush_radix_entry(struct radix_node *rn, void *arg);
struct radix_node rn[2];
struct radix_node *rn;
struct radix_node *rn;
flush_radix_entry(struct radix_node *rn, void *arg)
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
pfr_walktree(struct radix_node *rn, void *arg)
static int pfr_walktree(struct radix_node *, void *);
((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
struct radix_node *rn;