radix_node
struct radix_node rt_nodes[2]; /* radix tree glue */
extern int walk_bad(struct radix_node *, struct walkarg *);
walk_supply(struct radix_node *rn,
struct radix_node *
struct radix_node *head)
struct radix_node *x;
struct radix_node *
struct radix_node *head,
struct radix_node *x;
struct radix_node *
struct radix_node *x;
struct radix_node *leaf,
struct radix_node *
struct radix_node *t = head->rnh_treetop, *x;
struct radix_node *saved_t, *top = t;
struct radix_node *rn_clist;
struct radix_node *
rn_newpair(void *v, int b, struct radix_node nodes[2])
struct radix_node *tt = nodes, *t = tt + 1;
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;
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,
struct radix_node *
struct radix_node treenodes[2])
struct radix_node *t, *x = 0, *tt;
struct radix_node *saved_tt, *top = head->rnh_treetop;
struct radix_node *xx = x;
struct radix_node *
struct radix_node *t, *p, *x, *tt;
struct radix_node *dupedkey, *saved_tt, *top;
static int rn_satisfies_leaf(char *, struct radix_node *, int);
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;
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
struct radix_node [2]),
struct radix_node [2]),
*rn_newpair(void *, int, struct radix_node[2]),
*rn_search(void *, struct radix_node *),
*rn_search_m(void *, struct radix_node *, void *);
struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
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 *rn;
struct radix_node *rn;
rn = (struct radix_node *)ro.ro_rt;
struct radix_node *rn;
((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
struct radix_node *rn;
pfr_walktree(struct radix_node *rn, void *arg)
int pfr_walktree(struct radix_node *, void *);
struct radix_node pfrke_node[2];
void bootpboot_p_tree(struct radix_node *rn);
bootpboot_p_tree(struct radix_node *rn)
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node wga_nodes[2];
struct radix_node wgr_nodes[2];
struct radix_node *
int (*matcher)(struct radix_node *, void *), void *w)
struct radix_node *base, *next, *rn;
struct radix_node *t;
struct radix_node *tt;
struct radix_node *ttt;
struct radix_node *
struct radix_node *head)
struct radix_node *x;
struct radix_node *
struct radix_node *head,
struct radix_node *x;
struct radix_node *
struct radix_node *x;
struct radix_node *leaf,
struct radix_node *
struct radix_node *t = head->rnh_treetop;
struct radix_node *top = t;
struct radix_node *x;
struct radix_node *saved_t;
rn_nodeprint(struct radix_node *rn, rn_printer_t printer, void *arg,
struct radix_node *dup, *rn;
struct radix_node *
struct radix_node nodes[2])
struct radix_node *tt = nodes;
struct radix_node *t = tt + 1;
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;
struct radix_node *
struct radix_node *x;
struct radix_node *saved_x;
R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
struct radix_node *tt,
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;
static int rn_satisfies_leaf(const char *, struct radix_node *, int);
static struct radix_mask *rn_new_radix_mask(struct radix_node *,
struct radix_node *
struct radix_node *rn)
struct radix_node *t, *p, *x, *tt;
struct radix_node *dupedkey, *saved_tt, *top;
static struct radix_node *rn_walknext(struct radix_node *, rn_printer_t,
static struct radix_node *rn_walkfirst(struct radix_node *, rn_printer_t,
static void rn_nodeprint(struct radix_node *, rn_printer_t, void *,
struct radix_node *
static struct radix_node *
rn_walknext(struct radix_node *rn, rn_printer_t printer, void *arg)
static struct radix_node *
rn_walkfirst(struct radix_node *rn, rn_printer_t printer, void *arg)
int (*f)(struct radix_node *, void *),
struct radix_node *base, *next, *rn;
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 */
struct radix_node rnh_nodes[3]; /* empty tree for common case */
int (*)(struct radix_node *, void *),
struct radix_node *
int (*)(struct radix_node *, void *),
struct radix_node
struct radix_node [2]),
struct radix_node *),
struct radix_node [2]),
*rn_newpair(const void *, int, struct radix_node[2]),
*rn_search(const void *, struct radix_node *),
*rn_search_m(const void *, struct radix_node *, const void *);
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 */
struct radix_node rt_nodes[2]; /* tree glue, and other values */
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
struct radix_node *rn;
rt_walktree_visitor(struct radix_node *rn, void *v)
struct radix_node *rn;
static struct radix_node *
struct radix_node *rn;
static struct radix_node *
struct radix_node *rn;
static struct radix_node *
struct radix_node * treenodes)
struct radix_node *rn;
static struct radix_node *
struct radix_node netc_rnodes[2];
static int free_netcred(struct radix_node *, void *);
free_netcred(struct radix_node *rn, void *w)
p_tree(struct radix_node *rn)
struct radix_node rnode_aux;
struct radix_node rnode;
static void p_tree(struct radix_node *);