radix_node
int vfs_free_netcred(struct radix_node *, void *, u_int);
struct radix_node *rn;
vfs_free_netcred(struct radix_node *rn, void *w, u_int id)
struct radix_node *rn;
struct radix_node *rn;
pfr_walktree(struct radix_node *rn, void *arg, u_int id)
int pfr_walktree(struct radix_node *, void *, u_int);
struct radix_node *rn = NULL;
struct radix_node _pfrke_node[2];
struct radix_node *rn;
struct radix_node *rn;
pipex_rd_head4, (struct radix_node *)session);
struct radix_node ps4_rn[2];
struct radix_node ps4_rn[2];
rn_walktree(struct radix_node_head *h, int (*f)(struct radix_node *, void *,
struct radix_node *base, *next;
struct radix_node *rn = h->rnh_treetop;
struct radix_node *t, *tt, *ttt;
static inline struct radix_node *
rn_search(void *v_arg, struct radix_node *head)
struct radix_node *x = head;
struct radix_node *
rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
struct radix_node *x = head;
struct radix_node *
struct radix_node *x, *tm;
rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
struct radix_node *
struct radix_node *top = head->rnh_treetop;
struct radix_node *saved_t, *t;
struct radix_node *x;
struct radix_node *
rn_newpair(void *v, int b, struct radix_node nodes[2])
struct radix_node *tt = nodes, *t = nodes + 1;
struct radix_node *
int *dupentry, struct radix_node nodes[2])
struct radix_node *top = head->rnh_treetop;
struct radix_node *t, *tt;
struct radix_node *p, *x = top;
struct radix_node *
struct radix_node *tm, *saved_tm;
rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)
static inline struct radix_node *
rn_lift_node(struct radix_node *t)
struct radix_node *x = t;
rn_add_radix_mask(struct radix_node *tt, int keyduplicated)
struct radix_node *x;
struct radix_node *t;
rn_add_dupedkey(struct radix_node *saved_tt, struct radix_node_head *head,
struct radix_node *tt, u_int8_t prio)
struct radix_node *x = saved_tt, *xp;
static inline int rn_satisfies_leaf(char *, struct radix_node *, int);
static inline struct radix_mask *rn_new_radix_mask(struct radix_node *,
rn_link_dupedkey(struct radix_node *tt, struct radix_node *x, int before)
rn_fixup_nodes(struct radix_node *tt)
struct radix_node *tp, *x;
struct radix_node *rn_addmask(void *, int, int);
struct radix_node *xx = NULL;
struct radix_node *rn_insert(void *, struct radix_node_head *, int *,
struct radix_node [2]);
struct radix_node *rn_newpair(void *, int, struct radix_node[2]);
struct radix_node *
struct radix_node treenodes[2], u_int8_t prio)
void rn_link_dupedkey(struct radix_node *, struct radix_node *, int);
struct radix_node *top = head->rnh_treetop;
struct radix_node *tt, *saved_tt, *tm = NULL;
static inline struct radix_node *rn_search(void *, struct radix_node *);
struct radix_node *rn_search_m(void *, struct radix_node *, void *);
int rn_add_dupedkey(struct radix_node *, struct radix_node_head *,
struct radix_node [2], u_int8_t);
rn_del_radix_mask(struct radix_node *tt)
struct radix_node *x;
void rn_fixup_nodes(struct radix_node *);
static inline struct radix_node *rn_lift_node(struct radix_node *);
void rn_add_radix_mask(struct radix_node *, int);
int rn_del_radix_mask(struct radix_node *);
static inline void rn_swap_nodes(struct radix_node *, struct radix_node *);
rn_swap_nodes(struct radix_node *from, struct radix_node *to)
struct radix_node *
struct radix_node *rn)
struct radix_node *top = head->rnh_treetop;
struct radix_node *tt, *tp, *pp, *x;
struct radix_node *dupedkey_tt, *saved_tt;
struct radix_node *tm;
int (*)(struct radix_node *, void *, u_int), void *);
struct radix_node *rn_addroute(void *, void *, struct radix_node_head *,
struct radix_node [2], u_int8_t);
struct radix_node *rn_delete(void *, void *, struct radix_node_head *,
struct radix_node *);
struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
struct radix_node *rn_match(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 *rmu_leaf; /* for normal routes */
struct radix_node *rnh_treetop;
struct radix_node rnh_nodes[3];/* empty tree for common case */
struct radix_node ipo_nodes[2]; /* radix tree glue */
int (*walker)(struct radix_node *, void *, u_int) = (void *)func;
struct radix_node *rn;
struct radix_node *rn = (struct radix_node *)ipo;
struct radix_node netc_rnodes[2];