Home
last modified time | relevance | path

Searched refs:radix_node (Results 1 – 15 of 15) sorted by relevance

/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dradix.h53 struct radix_node { struct
55 struct radix_node *rn_p; /* parent */ argument
66 struct radix_node *rn_Dupedkey; argument
70 struct radix_node *rn_L; /* progeny */
71 struct radix_node *rn_R; /* progeny */
76 struct radix_node *rn_twin; argument
77 struct radix_node *rn_ybro; argument
99 struct radix_node *rmu_leaf; /* for normal routes */
117 struct radix_node *rnh_treetop;
120 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
[all …]
H A Dradix.c54 static boolean_t rn_satisfies_leaf(uint8_t *, struct radix_node *, int);
58 static struct radix_node
61 struct radix_node [2]),
64 struct radix_node [2]),
66 *rn_newpair(void *, uint_t, struct radix_node[2]),
67 *rn_search(void *, struct radix_node *),
68 *rn_search_m(void *, struct radix_node *, void *);
70 static struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
112 static struct radix_node *
113 rn_search(void *v_arg, struct radix_node *head) in rn_search()
[all …]
H A Ddefs.h216 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 Dtable.c1975 walk_kern(struct radix_node *rn, void *argp) in walk_kern()
2639 walk_bad(struct radix_node *rn, in walk_bad()
2688 walk_rewire(struct radix_node *rn, void *argp) in walk_rewire()
2722 walk_age(struct radix_node *rn, void *argp) in walk_age()
H A Doutput.c489 walk_supply(struct radix_node *rn, void *argp) in walk_supply()
H A Dtrace.c1044 walk_trace(struct radix_node *rn, in walk_trace()
/illumos-gate/usr/src/uts/common/inet/ipf/
H A Dradix_ipf.h51 # define radix_node ipf_radix_node macro
59 struct radix_node { struct
61 struct radix_node *rn_p; /* parent */ argument
72 struct radix_node *rn_Dupedkey; argument
76 struct radix_node *rn_L;/* progeny */
77 struct radix_node *rn_R;/* progeny */
82 struct radix_node *rn_twin; argument
83 struct radix_node *rn_ybro; argument
105 struct radix_node *rmu_leaf; /* for normal routes */
123 struct radix_node *rnh_treetop;
[all …]
H A Dip_pool.c78 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 Dipf.h17 # define radix_node ipf_radix_node macro
/illumos-gate/usr/src/uts/common/net/
H A Dradix.h58 struct radix_node { struct
60 struct radix_node *rn_parent; /* parent */ argument
71 struct radix_node *rn_Dupedkey; argument
75 struct radix_node *rn_L; /* progeny */
76 struct radix_node *rn_R; /* progeny */
100 struct radix_node *rmu_leaf; /* for normal routes */ argument
108 typedef int walktree_f_t(struct radix_node *, void *);
109 typedef boolean_t match_leaf_t(struct radix_node *, void *);
110 typedef void (*lockf_t)(struct radix_node *);
113 struct radix_node *rnh_treetop;
[all …]
/illumos-gate/usr/src/common/net/patricia/
H A Dradix.c73 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 …]
/illumos-gate/usr/src/uts/common/inet/
H A Dip_ftable.h41 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 *);
/illumos-gate/usr/src/uts/common/inet/ipf/netinet/
H A Dip_pool.h24 # define radix_node ipf_radix_node macro
36 struct radix_node ipn_nodes[2];
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_ftable.c86 static boolean_t ire_find_best_route(struct radix_node *, void *);
409 struct radix_node *rn; in ire_get_bucket()
445 ipst->ips_ip_ftable, (struct radix_node *)rt); in ire_get_bucket()
661 ire_find_best_route(struct radix_node *rn, void *arg) in ire_find_best_route()
968 irb_refhold_rn(struct radix_node *rn) in irb_refhold_rn()
975 irb_refrele_rn(struct radix_node *rn) in irb_refrele_rn()
H A Dip_ire.c978 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()