Home | History | Annotate | Download | only in routed

Lines Matching defs:radix_node

48 struct radix_node {
50 	struct	radix_node *rn_p;	/* parent */
61 			struct	radix_node *rn_Dupedkey;
65 			struct	radix_node *rn_L;/* progeny */
66 			struct	radix_node *rn_R;/* progeny */
71 	struct radix_node *rn_twin;
72 	struct radix_node *rn_ybro;
94 		struct	radix_node *rmu_leaf;	/* for normal routes */
112 	struct	radix_node *rnh_treetop;
115 	struct	radix_node *(*rnh_addaddr)	/* add based on sockaddr */
117 		     struct radix_node_head *head, struct radix_node nodes[]);
118 	struct	radix_node *(*rnh_addpkt)	/* add based on packet hdr */
120 		     struct radix_node_head *head, struct radix_node nodes[]);
121 	struct	radix_node *(*rnh_deladdr)	/* remove based on sockaddr */
123 	struct	radix_node *(*rnh_delpkt)	/* remove based on packet hdr */
125 	struct	radix_node *(*rnh_matchaddr)	/* locate based on sockaddr */
127 	struct	radix_node *(*rnh_lookup)	/* locate based on sockaddr */
129 	struct	radix_node *(*rnh_matchpkt)	/* locate based on packet hdr */
133 			 int (*f)(struct radix_node *, struct walkarg *),
135 	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
148 		     int (*)(struct radix_node *, struct walkarg *),
151 struct radix_node
154 			struct radix_node [2]),
157 			struct radix_node [2]),
159 	 *rn_newpair(void *, int, struct radix_node[2]),
160 	 *rn_search(void *, struct radix_node *),
161 	 *rn_search_m(void *, struct radix_node *, void *);
163 struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);