radix_node 103 kern/vfs_subr.c int vfs_free_netcred(struct radix_node *, void *);
radix_node 1412 kern/vfs_subr.c struct radix_node *rn;
radix_node 1485 kern/vfs_subr.c vfs_free_netcred(struct radix_node *rn, void *w)
radix_node 1860 net/if.c struct radix_node *rn;
radix_node 4829 net/pf.c struct radix_node *rn;
radix_node 4876 net/pf.c rn = (struct radix_node *)ro.ro_rt;
radix_node 91 net/pf_table.c ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
radix_node 157 net/pf_table.c int pfr_walktree(struct radix_node *, void *);
radix_node 977 net/pf_table.c struct radix_node *rn;
radix_node 1002 net/pf_table.c struct radix_node *rn;
radix_node 1042 net/pf_table.c pfr_walktree(struct radix_node *rn, void *arg)
radix_node 966 net/pfvar.h struct radix_node pfrke_node[2];
radix_node 68 net/radix.c static int rn_satisfies_leaf(char *, struct radix_node *, int);
radix_node 70 net/radix.c static struct radix_mask *rn_new_radix_mask(struct radix_node *,
radix_node 107 net/radix.c struct radix_node *
radix_node 108 net/radix.c rn_search(void *v_arg, struct radix_node *head)
radix_node 110 net/radix.c struct radix_node *x;
radix_node 122 net/radix.c struct radix_node *
radix_node 123 net/radix.c rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
radix_node 125 net/radix.c struct radix_node *x;
radix_node 164 net/radix.c struct radix_node *
radix_node 167 net/radix.c struct radix_node *x;
radix_node 184 net/radix.c rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
radix_node 201 net/radix.c struct radix_node *
radix_node 205 net/radix.c struct radix_node *t = head->rnh_treetop, *x;
radix_node 208 net/radix.c struct radix_node *saved_t, *top = t;
radix_node 303 net/radix.c struct radix_node *rn_clist;
radix_node 308 net/radix.c struct radix_node *
radix_node 309 net/radix.c rn_newpair(void *v, int b, struct radix_node nodes[2])
radix_node 311 net/radix.c struct radix_node *tt = nodes, *t = tt + 1;
radix_node 330 net/radix.c struct radix_node *
radix_node 332 net/radix.c int *dupentry, struct radix_node nodes[2])
radix_node 335 net/radix.c struct radix_node *top = head->rnh_treetop;
radix_node 337 net/radix.c struct radix_node *t = rn_search(v_arg, top);
radix_node 340 net/radix.c struct radix_node *tt;
radix_node 361 net/radix.c struct radix_node *p, *x = top;
radix_node 396 net/radix.c struct radix_node *
radix_node 400 net/radix.c struct radix_node *x;
radix_node 404 net/radix.c struct radix_node *saved_x;
radix_node 436 net/radix.c R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
radix_node 483 net/radix.c rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)
radix_node 504 net/radix.c struct radix_node *
radix_node 506 net/radix.c struct radix_node treenodes[2])
radix_node 509 net/radix.c struct radix_node *t, *x = NULL, *tt;
radix_node 510 net/radix.c struct radix_node *saved_tt, *top = head->rnh_treetop;
radix_node 578 net/radix.c struct radix_node *xx = x;
radix_node 684 net/radix.c struct radix_node *
radix_node 686 net/radix.c struct radix_node *rn)
radix_node 688 net/radix.c struct radix_node *t, *p, *x, *tt;
radix_node 690 net/radix.c struct radix_node *dupedkey, *saved_tt, *top;
radix_node 895 net/radix.c rn_walktree(struct radix_node_head *h, int (*f)(struct radix_node *, void *),
radix_node 899 net/radix.c struct radix_node *base, *next;
radix_node 900 net/radix.c struct radix_node *rn = h->rnh_treetop;
radix_node 948 net/radix.c struct radix_node *t, *tt, *ttt;
radix_node 42 net/radix.h struct radix_node {
radix_node 44 net/radix.h struct radix_node *rn_p; /* parent */
radix_node 55 net/radix.h struct radix_node *rn_Dupedkey;
radix_node 59 net/radix.h struct radix_node *rn_L;/* progeny */
radix_node 60 net/radix.h struct radix_node *rn_R;/* progeny */
radix_node 65 net/radix.h struct radix_node *rn_twin;
radix_node 66 net/radix.h struct radix_node *rn_ybro;
radix_node 88 net/radix.h struct radix_node *rmu_leaf; /* for normal routes */
radix_node 106 net/radix.h struct radix_node *rnh_treetop;
radix_node 110 net/radix.h struct radix_node *(*rnh_addaddr)(void *v, void *mask,
radix_node 111 net/radix.h struct radix_node_head *head, struct radix_node nodes[]);
radix_node 113 net/radix.h struct radix_node *(*rnh_deladdr)(void *v, void *mask,
radix_node 114 net/radix.h struct radix_node_head *head, struct radix_node *rn);
radix_node 116 net/radix.h struct radix_node *(*rnh_matchaddr)(void *v,
radix_node 119 net/radix.h struct radix_node *(*rnh_lookup)(void *v, void *mask,
radix_node 123 net/radix.h int (*)(struct radix_node *, void *), void *);
radix_node 124 net/radix.h struct radix_node rnh_nodes[3];/* empty tree for common case */
radix_node 140 net/radix.h int (*)(struct radix_node *, void *), void *);
radix_node 142 net/radix.h struct radix_node *rn_addmask(void *, int, int);
radix_node 143 net/radix.h struct radix_node *rn_addroute(void *, void *, struct radix_node_head *,
radix_node 144 net/radix.h struct radix_node [2]);
radix_node 145 net/radix.h struct radix_node *rn_delete(void *, void *, struct radix_node_head *,
radix_node 146 net/radix.h struct radix_node *);
radix_node 147 net/radix.h struct radix_node *rn_insert(void *, struct radix_node_head *, int *,
radix_node 148 net/radix.h struct radix_node [2]);
radix_node 149 net/radix.h struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
radix_node 150 net/radix.h struct radix_node *rn_match(void *, struct radix_node_head *);
radix_node 151 net/radix.h struct radix_node *rn_newpair(void *, int, struct radix_node[2]);
radix_node 152 net/radix.h struct radix_node *rn_search(void *, struct radix_node *);
radix_node 153 net/radix.h struct radix_node *rn_search_m(void *, struct radix_node *, void *);
radix_node 67 net/radix_mpath.c struct radix_node *
radix_node 68 net/radix_mpath.c rn_mpath_next(struct radix_node *rn)
radix_node 70 net/radix_mpath.c struct radix_node *next;
radix_node 82 net/radix_mpath.c rn_mpath_count(struct radix_node *rn)
radix_node 95 net/radix_mpath.c struct radix_node *rn;
radix_node 97 net/radix_mpath.c if (!rn_mpath_next((struct radix_node *)rt))
radix_node 103 net/radix_mpath.c rn = (struct radix_node *)rt;
radix_node 123 net/radix_mpath.c struct radix_node *rn, *rn1;
radix_node 128 net/radix_mpath.c rn = (struct radix_node *)rt;
radix_node 224 net/radix_mpath.c struct radix_node *rn;
radix_node 253 net/radix_mpath.c rn = (struct radix_node *)ro->ro_rt;
radix_node 48 net/radix_mpath.h struct radix_node *rn_mpath_next(struct radix_node *);
radix_node 49 net/radix_mpath.h int rn_mpath_count(struct radix_node *);
radix_node 148 net/route.c int rtflushclone1(struct radix_node *, void *);
radix_node 150 net/route.c int rt_if_remove_rtdelete(struct radix_node *, void *);
radix_node 281 net/route.c struct radix_node *rn;
radix_node 335 net/route.c struct radix_node *rn;
radix_node 572 net/route.c rtflushclone1(struct radix_node *rn, void *arg)
radix_node 730 net/route.c struct radix_node *rn;
radix_node 756 net/route.c rn = (struct radix_node *)rt;
radix_node 1246 net/route.c struct radix_node *
radix_node 1387 net/route.c rt_if_remove_rtdelete(struct radix_node *rn, void *vifp)
radix_node 108 net/route.h struct radix_node rt_nodes[2]; /* tree glue, and other values */
radix_node 368 net/route.h struct radix_node *rt_lookup(struct sockaddr *, struct sockaddr *, int);
radix_node 165 net/rtsock.c struct radix_node *rn = NULL;
radix_node 233 net/rtsock.c struct radix_node *t;
radix_node 302 net/rtsock.c rn = (struct radix_node *)rt;
radix_node 805 net/rtsock.c sysctl_dumpentry(struct radix_node *rn, void *v)
radix_node 107 netinet/if_ether.c int db_show_radix_node(struct radix_node *, void *);
radix_node 1062 netinet/if_ether.c struct radix_node *rn;
radix_node 377 netinet/ip_carp.c struct radix_node *rn;
radix_node 76 netinet6/nd6_rtr.c static int rt6_deleteroute(struct radix_node *, void *);
radix_node 1802 netinet6/nd6_rtr.c struct radix_node *rn;
radix_node 538 sys/mount.h struct radix_node netc_rnodes[2];
radix_node 687 sys/sysctl.h struct radix_node;
radix_node 689 sys/sysctl.h int sysctl_dumpentry(struct radix_node *, void *);