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

/freebsd-current/sbin/routed/
H A Dradix.h42 struct radix_node { struct
44 struct radix_node *rn_p; /* parent */
55 struct radix_node *rn_Dupedkey;
59 struct radix_node *rn_L;/* progeny */
60 struct radix_node *rn_R;/* progeny */
65 struct radix_node *rn_twin;
66 struct radix_node *rn_ybro;
88 struct radix_node *rmu_leaf; /* for normal routes */
106 struct radix_node *rnh_treetop;
109 struct radix_node *(*rnh_addadd
[all...]
H A Dradix.c53 static int rn_satisfies_leaf(char *, struct radix_node *, int);
54 static struct radix_node *rn_addmask(void *n_arg, int search, int skip);
55 static struct radix_node *rn_addroute(void *v_arg, void *n_arg,
56 struct radix_node_head *head, struct radix_node treenodes[2]);
57 static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head);
93 static struct radix_node *
95 struct radix_node *head)
97 struct radix_node *x;
109 static struct radix_node *
111 struct radix_node *hea
[all...]
H A Ddefs.h160 struct radix_node rt_nodes[2]; /* radix tree glue */
591 int walk_bad(struct radix_node *, struct walkarg *);
H A Dtable.c1405 walk_kern(struct radix_node *rn,
1975 walk_bad(struct radix_node *rn,
2018 walk_age(struct radix_node *rn,
H A Dtrace.c819 walk_trace(struct radix_node *rn,
H A Doutput.c431 walk_supply(struct radix_node *rn,
/freebsd-current/sys/net/
H A Dradix.h49 struct radix_node { struct
51 struct radix_node *rn_parent; /* parent */
62 struct radix_node *rn_Dupedkey;
66 struct radix_node *rn_L;/* progeny */
67 struct radix_node *rn_R;/* progeny */
72 struct radix_node *rn_twin;
73 struct radix_node *rn_ybro;
95 struct radix_node *rmu_leaf; /* for normal routes */
105 typedef int walktree_f_t(struct radix_node *, void *);
106 typedef struct radix_node *rn_matchaddr_f_
[all...]
H A Dradix.c54 static struct radix_node
56 struct radix_node [2]),
57 *rn_newpair(void *, int, struct radix_node[2]),
58 *rn_search(const void *, struct radix_node *),
59 *rn_search_m(const void *, struct radix_node *, void *);
60 static struct radix_node *rn_addmask(const void *, struct radix_mask_head *, int,int);
76 rn_new_radix_mask(struct radix_node *tt,
78 static int rn_satisfies_leaf(const char *trial, struct radix_node *leaf,
141 static struct radix_node *
142 rn_search(const void *v_arg, struct radix_node *hea
[all...]
H A Droute.c137 rt_freeentry(struct radix_node *rn, void *arg)
140 struct radix_node *x;
142 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
H A Dpfvar.h1516 struct radix_node pfrke_node[2];
/freebsd-current/sys/netinet/
H A Din_fib.c139 struct radix_node *rn;
217 struct radix_node *rn;
285 struct radix_node *rn;
H A Din_fib_algo.c511 struct radix_node rn[2];
605 struct radix_node *rn;
682 struct radix_node *rn;
/freebsd-current/sys/netinet6/
H A Din6_fib_algo.c82 struct radix_node rn[2];
173 struct radix_node *rn;
252 struct radix_node *rn;
H A Din6_fib.c147 struct radix_node *rn;
227 struct radix_node *rn;
298 struct radix_node *rn;
/freebsd-current/sys/net/route/
H A Droute_ddb.c130 rt_dumpentry_ddb(struct radix_node *rn, void *arg __unused)
210 struct radix_node *rn;
H A Droute_helpers.c485 struct radix_node *rn;
502 rn = (struct radix_node *)rt;
557 struct radix_node *rn;
574 rn = (struct radix_node *)rt;
H A Droute_var.h60 struct radix_node rnh_nodes[3]; /* empty tree for common case */
137 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
139 * 'struct rtentry' starts with two 'struct radix_node''s, the first
141 * what the code in radix.c passes us as a 'struct radix_node'.
149 struct radix_node rt_nodes[2]; /* tree glue, and other values */
151 * XXX struct rtentry must begin with a struct radix_node (or two!)
152 * because the code does some casts of a 'struct radix_node *'
161 * 2 radix_node structurs above consists of 2x6 pointers, leaving
H A Droute_ctl.c1217 struct radix_node *rn;
1256 struct radix_node *rn;
1428 rt_checkdelroute(struct radix_node *rn, void *arg)
1530 rt_delete_unconditional(struct radix_node *rn, void *arg)
/freebsd-current/sys/kern/
H A Dvfs_export.c70 static int vfs_free_netcred(struct radix_node *rn, void *w);
80 struct radix_node netc_rnodes[2];
107 struct radix_node *rn;
231 vfs_free_netcred(struct radix_node *rn, void *w)
/freebsd-current/sys/netpfil/ipfw/
H A Dip_fw_table_algo.c328 struct radix_node rn[2];
342 struct radix_node rn[2];
385 static int flush_radix_entry(struct radix_node *rn, void *arg);
468 flush_radix_entry(struct radix_node *rn, void *arg)
719 struct radix_node *rn;
820 struct radix_node *rn;
4020 struct radix_node rn[2];
4157 struct radix_node *rn;
4239 struct radix_node *rn;
/freebsd-current/sys/netpfil/pf/
H A Dpf_table.c86 ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
153 static int pfr_walktree(struct radix_node *, void *);
954 struct radix_node *rn;
978 struct radix_node *rn;
1059 pfr_walktree(struct radix_node *rn, void *arg)
/freebsd-current/sys/dev/wg/
H A Dif_wg.c142 struct radix_node a_nodes[2];
518 struct radix_node *node;
582 struct radix_node *node;

Completed in 303 milliseconds