Searched refs:radix_node (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-10.2-release/sys/net/
H A Dradix_mpath.h48 struct radix_node *rn_mpath_next(struct radix_node *);
49 u_int32_t rn_mpath_count(struct radix_node *);
55 struct radix_node *rn_mpath_lookup(void *, void *,
H A Dradix.h50 struct radix_node { struct
52 struct radix_node *rn_parent; /* parent */
63 struct radix_node *rn_Dupedkey;
67 struct radix_node *rn_L;/* progeny */
68 struct radix_node *rn_R;/* progeny */
73 struct radix_node *rn_twin;
74 struct radix_node *rn_ybro;
96 struct radix_node *rmu_leaf; /* for normal routes */
104 typedef int walktree_f_t(struct radix_node *, void *);
107 struct radix_node *rnh_treeto
[all...]
H A Dradix_mpath.c66 struct radix_node *
67 rn_mpath_next(struct radix_node *rn)
69 struct radix_node *next;
81 rn_mpath_count(struct radix_node *rn)
97 struct radix_node *rn;
103 rn = (struct radix_node *)rt;
137 struct radix_node *t, *tt;
141 t = (struct radix_node *)headrt;
144 if (tt == (struct radix_node *)rt) {
152 tt = rn_mpath_next((struct radix_node *)
[all...]
H A Dradix.c62 static struct radix_node
64 struct radix_node [2]),
65 *rn_newpair(void *, int, struct radix_node[2]),
66 *rn_search(void *, struct radix_node *),
67 *rn_search_m(void *, struct radix_node *, void *);
93 rn_new_radix_mask(struct radix_node *tt,
95 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
158 static struct radix_node *
159 rn_search(void *v_arg, struct radix_node *head)
161 struct radix_node *
[all...]
H A Droute.c132 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
134 * 'struct rtentry' starts with two 'struct radix_node''s, the first
136 * what the code in radix.c passes us as a 'struct radix_node'.
405 struct radix_node *rn;
507 rnh->rnh_close((struct radix_node *)rt, rnh);
911 struct radix_node *rn;
1052 register struct radix_node *rn;
1067 rn = rn_mpath_next((struct radix_node *)rt);
1158 register struct radix_node *rn;
1583 struct radix_node *r
[all...]
H A Droute.h107 struct radix_node rt_nodes[2]; /* tree glue, and other values */
109 * XXX struct rtentry must begin with a struct radix_node (or two!)
110 * because the code does some casts of a 'struct radix_node *'
H A Dif.c171 static int if_rtdel(struct radix_node *, void *);
1446 if_rtdel(struct radix_node *rn, void *arg)
H A Drtsock.c187 static int sysctl_dumpentry(struct radix_node *rn, void *vw);
1557 sysctl_dumpentry(struct radix_node *rn, void *vw)
/freebsd-10.2-release/sbin/routed/
H A Dradix.h44 struct radix_node { struct
46 struct radix_node *rn_p; /* parent */
57 struct radix_node *rn_Dupedkey;
61 struct radix_node *rn_L;/* progeny */
62 struct radix_node *rn_R;/* progeny */
67 struct radix_node *rn_twin;
68 struct radix_node *rn_ybro;
90 struct radix_node *rmu_leaf; /* for normal routes */
108 struct radix_node *rnh_treetop;
111 struct radix_node *(*rnh_addadd
[all...]
H A Dradix.c65 static int rn_satisfies_leaf(char *, struct radix_node *, int);
66 static struct radix_node *rn_addmask(void *n_arg, int search, int skip);
67 static struct radix_node *rn_addroute(void *v_arg, void *n_arg,
68 struct radix_node_head *head, struct radix_node treenodes[2]);
69 static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head);
105 static struct radix_node *
107 struct radix_node *head)
109 struct radix_node *x;
121 static struct radix_node *
123 struct radix_node *hea
[all...]
H A Ddefs.h187 struct radix_node rt_nodes[2]; /* radix tree glue */
625 int walk_bad(struct radix_node *, struct walkarg *);
H A Dtable.c1406 walk_kern(struct radix_node *rn,
1976 walk_bad(struct radix_node *rn,
2019 walk_age(struct radix_node *rn,
H A Doutput.c441 walk_supply(struct radix_node *rn,
H A Dtrace.c831 walk_trace(struct radix_node *rn,
/freebsd-10.2-release/sys/netatalk/
H A Dat_rmx.c71 static struct radix_node *
73 struct radix_node *treenodes)
79 static struct radix_node *
86 static struct radix_node *
93 static struct radix_node *
/freebsd-10.2-release/sys/netinet/
H A Din_rmx.c62 static struct radix_node *
64 struct radix_node *treenodes)
107 static struct radix_node *
110 struct radix_node *rn = rn_match(v_arg, head);
149 in_clsroute(struct radix_node *rn, struct radix_node_head *head)
191 in_rtqkill(struct radix_node *rn, void *rock)
395 in_ifadownkill(struct radix_node *rn, void *xap)
/freebsd-10.2-release/sys/netinet6/
H A Din6_rmx.c104 static struct radix_node *
106 struct radix_node *treenodes)
110 struct radix_node *ret;
200 in6_mtuexpire(struct radix_node *rn, void *rock)
H A Dnd6_rtr.c90 static int rt6_deleteroute(struct radix_node *, void *);
2122 rt6_deleteroute(struct radix_node *rn, void *arg)
/freebsd-10.2-release/sys/netpfil/ipfw/
H A Dip_fw_table.c75 struct radix_node rn[2];
87 struct radix_node rn[2];
145 struct radix_node *rn;
396 flush_table_entry(struct radix_node *rn, void *arg)
596 count_table_entry(struct radix_node *rn, void *arg)
619 dump_table_entry(struct radix_node *rn, void *arg)
654 count_table_xentry(struct radix_node *rn, void *arg)
682 dump_table_xentry_base(struct radix_node *rn, void *arg)
706 dump_table_xentry_extended(struct radix_node *rn, void *arg)
H A Dip_fw_private.h306 struct radix_node;
319 int ipfw_dump_table_entry(struct radix_node *rn, void *arg);
/freebsd-10.2-release/sys/kern/
H A Dvfs_export.c62 static int vfs_free_netcred(struct radix_node *rn, void *w);
71 struct radix_node netc_rnodes[2];
97 struct radix_node *rn;
227 vfs_free_netcred(struct radix_node *rn, void *w)
/freebsd-10.2-release/usr.bin/netstat/
H A Droute.c134 struct radix_node rnode;
142 static void size_cols(int ef, struct radix_node *rn);
143 static void size_cols_tree(struct radix_node *rn);
148 static void p_rtree_kvm(struct radix_node *);
259 size_cols(int ef, struct radix_node *rn)
274 size_cols_tree(struct radix_node *rn)
461 p_rtree_kvm(struct radix_node *rn)
525 struct radix_node rnode_aux;
/freebsd-10.2-release/contrib/ipfilter/
H A Dipf.h17 # define radix_node ipf_radix_node macro
/freebsd-10.2-release/sys/netpfil/pf/
H A Dpf_table.c88 ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
156 static int pfr_walktree(struct radix_node *, void *);
930 struct radix_node *rn;
954 struct radix_node *rn;
991 pfr_walktree(struct radix_node *rn, void *arg)
/freebsd-10.2-release/sys/nfs/
H A Dbootp_subr.c260 void bootpboot_p_tree(struct radix_node *rn);
350 bootpboot_p_tree(struct radix_node *rn)

Completed in 421 milliseconds

12