| /titanic_44/usr/src/cmd/cmd-inet/usr.sbin/in.routed/ |
| H A D | radix.h | 55 struct radix_node { struct
57 struct radix_node *rn_p; /* parent */ argument
68 struct radix_node *rn_Dupedkey; argument
72 struct radix_node *rn_L; /* progeny */
73 struct radix_node *rn_R; /* progeny */
78 struct radix_node *rn_twin; argument
79 struct radix_node *rn_ybro; argument
101 struct radix_node *rmu_leaf; /* for normal routes */
119 struct radix_node *rnh_treetop;
122 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
[all …]
|
| H A D | radix.c | 56 static boolean_t rn_satisfies_leaf(uint8_t *, struct radix_node *, int);
60 static struct radix_node
63 struct radix_node [2]),
66 struct radix_node [2]),
68 *rn_newpair(void *, uint_t, struct radix_node[2]),
69 *rn_search(void *, struct radix_node *),
70 *rn_search_m(void *, struct radix_node *, void *);
72 static struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
114 static struct radix_node *
115 rn_search(void *v_arg, struct radix_node *head) in rn_search()
[all …]
|
| H A D | defs.h | 216 struct radix_node rt_nodes[2]; /* radix tree glue */
779 extern int walk_bad(struct radix_node *, void *);
780 extern int walk_rewire(struct radix_node *, void *);
|
| H A D | table.c | 1976 walk_kern(struct radix_node *rn, void *argp) in walk_kern()
2640 walk_bad(struct radix_node *rn, in walk_bad()
2689 walk_rewire(struct radix_node *rn, void *argp) in walk_rewire()
2723 walk_age(struct radix_node *rn, void *argp) in walk_age()
|
| H A D | output.c | 491 walk_supply(struct radix_node *rn, void *argp) in walk_supply()
|
| H A D | trace.c | 1044 walk_trace(struct radix_node *rn, in walk_trace()
|
| /titanic_44/usr/src/uts/common/inet/ipf/ |
| H A D | radix_ipf.h | 53 # define radix_node ipf_radix_node macro
61 struct radix_node { struct
63 struct radix_node *rn_p; /* parent */ argument
74 struct radix_node *rn_Dupedkey; argument
78 struct radix_node *rn_L;/* progeny */
79 struct radix_node *rn_R;/* progeny */
84 struct radix_node *rn_twin; argument
85 struct radix_node *rn_ybro; argument
107 struct radix_node *rmu_leaf; /* for normal routes */
125 struct radix_node *rnh_treetop;
[all …]
|
| H A D | ip_pool.c | 78 static int rn_freenode __P((struct radix_node *, void *));
354 struct radix_node *n;
382 struct radix_node *rn;
444 struct radix_node *rn;
920 rn_freenode(struct radix_node *n, void *p, ipf_stack_t *ifs) in rn_freenode()
923 struct radix_node *d; in rn_freenode()
|
| H A D | ipf.h | 17 # define radix_node ipf_radix_node macro
|
| /titanic_44/usr/src/uts/common/net/ |
| H A D | radix.h | 60 struct radix_node { struct
62 struct radix_node *rn_parent; /* parent */ argument
73 struct radix_node *rn_Dupedkey; argument
77 struct radix_node *rn_L; /* progeny */
78 struct radix_node *rn_R; /* progeny */
102 struct radix_node *rmu_leaf; /* for normal routes */ argument
110 typedef int walktree_f_t(struct radix_node *, void *);
111 typedef boolean_t match_leaf_t(struct radix_node *, void *);
112 typedef void (*lockf_t)(struct radix_node *);
115 struct radix_node *rnh_treetop;
[all …]
|
| /titanic_44/usr/src/common/net/patricia/ |
| H A D | radix.c | 73 static struct radix_node
75 struct radix_node [2]),
76 *rn_newpair(void *, int, struct radix_node[2]),
77 *rn_search(void *, struct radix_node *),
78 *rn_search_m(void *, struct radix_node *, void *),
85 struct radix_node [2]),
118 rn_new_radix_mask(struct radix_node *tt,
121 rn_satisfies_leaf(char *trial, struct radix_node *leaf,
175 static struct radix_node *
178 struct radix_node *head;
[all …]
|
| /titanic_44/usr/src/uts/common/inet/ |
| H A D | ip_ftable.h | 41 struct radix_node rt_nodes[2]; /* tree glue, and other values */
72 int rtfunc(struct radix_node *, void *);
83 extern void irb_refhold_rn(struct radix_node *);
84 extern void irb_refrele_rn(struct radix_node *);
|
| /titanic_44/usr/src/uts/common/inet/ipf/netinet/ |
| H A D | ip_pool.h | 24 # define radix_node ipf_radix_node macro
36 struct radix_node ipn_nodes[2];
|
| /titanic_44/usr/src/uts/common/inet/ip/ |
| H A D | ip_ftable.c | 85 static boolean_t ire_find_best_route(struct radix_node *, void *);
408 struct radix_node *rn; in ire_get_bucket()
444 ipst->ips_ip_ftable, (struct radix_node *)rt); in ire_get_bucket()
660 ire_find_best_route(struct radix_node *rn, void *arg) in ire_find_best_route()
967 irb_refhold_rn(struct radix_node *rn) in irb_refhold_rn()
974 irb_refrele_rn(struct radix_node *rn) in irb_refrele_rn()
|
| H A D | ip_ire.c | 978 rtfunc(struct radix_node *rn, void *arg) in rtfunc()
1455 struct radix_node *rn; in irb_inactive()
1461 rn = (struct radix_node *)rt; in irb_inactive()
1741 ire_update_generation(struct radix_node *rn, void *arg) in ire_update_generation()
2088 ire_find_zoneid(struct radix_node *rn, void *arg) in ire_find_zoneid()
|