| /freebsd/sys/net/ |
| H A D | radix.h | 49 struct radix_node { struct
51 struct radix_node *rn_parent; /* parent */ argument
62 struct radix_node *rn_Dupedkey; argument
66 struct radix_node *rn_L;/* progeny */
67 struct radix_node *rn_R;/* progeny */
72 struct radix_node *rn_twin; argument
73 struct radix_node *rn_ybro; argument
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_t(const void *v,
[all …]
|
| H A D | radix.c | 54 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 *head) in rn_search()
[all …]
|
| H A D | route.c | 140 rt_freeentry(struct radix_node *rn, void *arg) in rt_freeentry()
143 struct radix_node *x; in rt_freeentry()
145 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh); in rt_freeentry()
|
| H A D | pfvar.h | 1863 struct radix_node pfrke_node[2];
|
| /freebsd/sbin/routed/ |
| H A D | radix.h | 42 struct radix_node { struct
44 struct radix_node *rn_p; /* parent */ argument
55 struct radix_node *rn_Dupedkey; argument
59 struct radix_node *rn_L;/* progeny */
60 struct radix_node *rn_R;/* progeny */
65 struct radix_node *rn_twin; argument
66 struct radix_node *rn_ybro; argument
88 struct radix_node *rmu_leaf; /* for normal routes */
106 struct radix_node *rnh_treetop;
109 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
[all …]
|
| H A D | radix.c | 53 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) in rn_search()
97 struct radix_node *x; in rn_search()
109 static struct radix_node *
111 struct radix_node *head, in rn_search_m()
[all …]
|
| H A D | defs.h | 160 struct radix_node rt_nodes[2]; /* radix tree glue */
591 int walk_bad(struct radix_node *, struct walkarg *);
|
| H A D | table.c | 1405 walk_kern(struct radix_node *rn, in walk_kern()
1975 walk_bad(struct radix_node *rn, in walk_bad()
2018 walk_age(struct radix_node *rn, in walk_age()
|
| H A D | output.c | 431 walk_supply(struct radix_node *rn, in walk_supply()
|
| H A D | trace.c | 819 walk_trace(struct radix_node *rn, in walk_trace()
|
| /freebsd/sys/netinet/ |
| H A D | in_fib.c | 136 struct radix_node *rn; in fib4_lookup()
214 struct radix_node *rn; in lookup_nhop()
282 struct radix_node *rn; in fib4_lookup_rt()
|
| H A D | in_fib_algo.c | 510 struct radix_node rn[2];
604 struct radix_node *rn; in lradix4_add_route_cb()
681 struct radix_node *rn; in radix4_lookup()
|
| /freebsd/sys/netinet6/ |
| H A D | in6_fib.c | 144 struct radix_node *rn; in fib6_lookup()
224 struct radix_node *rn; in lookup_nhop()
295 struct radix_node *rn; in fib6_lookup_rt()
|
| H A D | in6_fib_algo.c | 81 struct radix_node rn[2];
172 struct radix_node *rn; in lradix6_add_route_cb()
251 struct radix_node *rn; in radix6_lookup()
|
| /freebsd/sys/net/route/ |
| H A D | route_ddb.c | 130 rt_dumpentry_ddb(struct radix_node *rn, void *arg __unused) in rt_dumpentry_ddb()
210 struct radix_node *rn; in DB_SHOW_COMMAND_FLAGS()
|
| H A D | route_helpers.c | 482 struct radix_node *rn; in get_inet_parent_prefix()
499 rn = (struct radix_node *)rt; in get_inet_parent_prefix()
554 struct radix_node *rn; in get_inet6_parent_prefix()
571 rn = (struct radix_node *)rt; in get_inet6_parent_prefix()
|
| H A D | route_var.h | 60 struct radix_node rnh_nodes[3]; /* empty tree for common case */
149 struct radix_node rt_nodes[2]; /* tree glue, and other values */
|
| H A D | route_ctl.c | 1191 struct radix_node *rn; in add_route()
1230 struct radix_node *rn; in delete_route()
1402 rt_checkdelroute(struct radix_node *rn, void *arg) in rt_checkdelroute()
1500 rt_delete_unconditional(struct radix_node *rn, void *arg) in rt_delete_unconditional()
|
| /freebsd/sys/kern/ |
| H A D | vfs_export.c | 71 static int vfs_free_netcred(struct radix_node *rn, void *w);
81 struct radix_node netc_rnodes[2];
108 struct radix_node *rn; in vfs_hang_addrlist()
232 vfs_free_netcred(struct radix_node *rn, void *w) in vfs_free_netcred()
|
| /freebsd/tools/debugscripts/ |
| H A D | netstat-anr.gdb | 98 set $rn = (struct radix_node *)$arg0
116 set $rn_$arg0 = (struct radix_node *)$arg1
|
| /freebsd/sys/netpfil/ipfw/ |
| H A D | ip_fw_table_algo.c | 330 struct radix_node rn[2];
344 struct radix_node rn[2];
387 static int flush_radix_entry(struct radix_node *rn, void *arg);
470 flush_radix_entry(struct radix_node *rn, void *arg) in flush_radix_entry()
721 struct radix_node *rn; in ta_add_addr_radix()
822 struct radix_node *rn; in ta_del_addr_radix()
4021 struct radix_node rn[2];
4158 struct radix_node *rn; in ta_add_mac_radix()
4240 struct radix_node *rn; in ta_del_mac_radix()
|
| /freebsd/sys/netpfil/pf/ |
| H A D | pf_table.c | 84 ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
151 static int pfr_walktree(struct radix_node *, void *);
992 struct radix_node *rn; in pfr_route_kentry()
1022 struct radix_node *rn; in pfr_unroute_kentry()
1115 pfr_walktree(struct radix_node *rn, void *arg) in pfr_walktree()
|
| /freebsd/sys/dev/wg/ |
| H A D | if_wg.c | 142 struct radix_node a_nodes[2];
574 struct radix_node *node; in wg_aip_add()
620 struct radix_node *dnode __diagused, *node; in wg_aip_del()
671 struct radix_node *node; in wg_aip_lookup()
|