radix_node
struct radix_node rt_nodes[2]; /* radix tree glue */
extern int walk_bad(struct radix_node *, void *);
walk_supply(struct radix_node *rn, void *argp __unused)
walk_kern(struct radix_node *rn, void *argp __unused)
walk_bad(struct radix_node *rn, void *argp __unused)
walk_age(struct radix_node *rn, void *argp __unused)
walk_trace(struct radix_node *rn, void *w __unused)
struct radix_node *rn;
vfs_free_netcred(struct radix_node *rn)
static int if_rtdel(struct radix_node *, void *);
if_rtdel(struct radix_node *rn, void *arg)
struct radix_node te_nodes[2];
ipfw_table_killent(struct radix_node *rn)
ipfw_table_cntent(struct radix_node *rn __unused, void *xcnt)
ipfw_table_cpent(struct radix_node *rn, void *xcp)
struct radix_node *rn;
ipfw_table_zeroent(struct radix_node *rn, void *arg __unused)
ipfw_table_killexp(struct radix_node *rn, void *xnm)
struct radix_node *ret;
ipfw_table_markexp(struct radix_node *rn, void *xnm)
flush_table_entry(struct radix_node *rn)
dump_table_ip_entry(struct radix_node *rn, void *arg)
dump_table_mac_entry(struct radix_node *rn, void *arg)
struct radix_node rn[2];
struct radix_node rn[2];
void flush_table_entry(struct radix_node *rn);
int dump_table_ip_entry(struct radix_node *rn, void *arg);
int dump_table_mac_entry(struct radix_node *rn, void *arg);
struct radix_node *rn;
rn = (struct radix_node *)ro.ro_rt;
pfr_walktree(struct radix_node *rn, void *arg)
int pfr_walktree(struct radix_node *, void *);
((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
struct radix_node *rn;
struct radix_node *rn;
struct radix_node pfrke_node[2];
struct radix_node *rn, *base, *next, *last;
struct radix_node *rn, *base, *next;
struct radix_node *root, *left, *right;
rn_freemask(struct radix_node *rn)
rn_flush_walker(struct radix_node *rn, void *arg)
struct radix_node *node;
static struct radix_node *
rn_search(const void *_key, struct radix_node *head)
struct radix_node *x;
static struct radix_node *
rn_search_m(const void *_key, const void *_mask, struct radix_node *head)
struct radix_node *x;
struct radix_node *
struct radix_node *x;
rn_satisfies_leaf(const void *key, struct radix_node *leaf, int skip)
struct radix_node *
struct radix_node *top, *t, *saved_t;
struct radix_node *x;
static struct radix_node *
rn_newpair(const void *key, int bit, struct radix_node nodes[2])
struct radix_node *left, *parent;
static struct radix_node *
struct radix_node nodes[2])
struct radix_node *top, *t, *tt;
struct radix_node *p, *x = top;
struct radix_node *
struct radix_node *x, *saved_x;
R_Malloc(x, struct radix_node *, RN_MAXKEYLEN + 2 * (sizeof *x));
rn_new_radix_mask(struct radix_node *node, struct radix_mask *nextmask)
struct radix_node *
struct radix_node_head *head, struct radix_node nodes[2])
struct radix_node *top, *t, *x, *tt, *saved_tt;
struct radix_node *xx = x;
static struct radix_node *rn_clist;
struct radix_node *
struct radix_node *top, *t, *p, *x, *tt, *saved_tt, *dupedkey;
struct radix_node *rmu_leaf; /* for normal routes */
typedef int walktree_f_t (struct radix_node *, void *);
typedef void freenode_f_t (struct radix_node *);
struct radix_node *rnh_treetop;
struct radix_node *(*rnh_addaddr)
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node *(*rnh_deladdr)
struct radix_node *(*rnh_matchaddr)
struct radix_node *(*rnh_lookup)
(struct radix_node *rn, struct radix_node_head *head);
struct radix_node rnh_nodes[3];
struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
void rn_freemask(struct radix_node *rn);
struct radix_node *rn_addmask(const void *mask, bool search, int skip,
struct radix_node *rn_addroute(const void *key, const void *mask,
struct radix_node nodes[2]);
struct radix_node *rn_delete(const void *key, const void *mask,
struct radix_node *rn_lookup(const void *key, const void *mask,
struct radix_node *rn_match(const void *key,
struct radix_node *rn_parent; /* parent */
struct radix_node *rn_Dupedkey;
struct radix_node *rn_Left; /* progeny */
struct radix_node *rn_Right; /* progeny */
struct radix_node *rn_twin;
struct radix_node *rn_ybro;
rt_fixdelete(struct radix_node *rn, void *vp)
rt_fixchange(struct radix_node *rn, void *vp)
rt_purgecloned_callback(struct radix_node *rn, void *xap)
struct radix_node *rn;
struct radix_node *n;
rtchange_callback(struct radix_node *rn, void *xap)
rnh->rnh_close((struct radix_node *)rt, rnh);
static int rt_fixdelete (struct radix_node *, void *);
static int rt_fixchange (struct radix_node *, void *);
struct radix_node *rn;
struct radix_node rt_nodes[2]; /* tree glue, and other values */
rttable_entry_rtinfo(struct rt_addrinfo *rtinfo, struct radix_node *rn)
rttable_walk_entry(struct radix_node *rn, void *xw)
struct radix_node *rn1 = rn;
struct radix_node a_nodes[2]; /* make the first for casting */
struct radix_node *node;
struct radix_node *node;
struct radix_node *node;
static struct radix_node *
struct radix_node *rn = rn_match(key, head);
in_closeroute(struct radix_node *rn, struct radix_node_head *head)
in_rtqkill(struct radix_node *rn, void *rock)
in_ifadownkill(struct radix_node *rn, void *xap)
static struct radix_node *
struct radix_node *nodes)
struct radix_node *ret;
static struct radix_node *
struct radix_node *nodes)
struct radix_node *ret;
static struct radix_node *
struct radix_node *rn = rn_match(key, head);
in6_clsroute(struct radix_node *rn, struct radix_node_head *head)
in6_rtqkill(struct radix_node *rn, void *rock)
in6_mtuexpire(struct radix_node *rn, void *rock)
rt6_deleteroute(struct radix_node *rn, void *arg)
static int rt6_deleteroute (struct radix_node *, void *);
struct radix_node netc_rnodes[2];
void bootpboot_p_tree(struct radix_node *rn);
bootpboot_p_tree(struct radix_node *rn)
static void size_cols (int ef, struct radix_node *rn);
static void size_cols_tree (struct radix_node *rn);
static void p_tree (struct radix_node *, int);
static void p_rtnode (struct radix_node *);
size_cols(int ef, struct radix_node *rn)
size_cols_tree(struct radix_node *rn)
struct radix_node rnode;
p_tree(struct radix_node *rn, int is_rtentry)
struct radix_node rnode;
p_rtnode(struct radix_node *rnode)
struct radix_node rnode_aux;