Home | History | Annotate | Download | only in net

Lines Matching defs:radix_node

41 struct radix_node {
43 	struct	radix_node *rn_p;	/* parent */
54 			struct	radix_node *rn_Dupedkey;
58 			struct	radix_node *rn_L;/* progeny */
59 			struct	radix_node *rn_R;/* progeny */
64 	struct radix_node *rn_twin;
65 	struct radix_node *rn_ybro;
87 		struct	radix_node *rmu_leaf;	/* for normal routes */
105 	struct	radix_node *rnh_treetop;
108 	struct	radix_node *(*rnh_addaddr)	/* add based on sockaddr */
110 		     struct radix_node_head *head, struct radix_node nodes[]);
111 	struct	radix_node *(*rnh_addpkt)	/* add based on packet hdr */
113 		     struct radix_node_head *head, struct radix_node nodes[]);
114 	struct	radix_node *(*rnh_deladdr)	/* remove based on sockaddr */
116 	struct	radix_node *(*rnh_delpkt)	/* remove based on packet hdr */
118 	struct	radix_node *(*rnh_matchaddr)	/* locate based on sockaddr */
120 	struct	radix_node *(*rnh_lookup)	/* locate based on sockaddr */
122 	struct	radix_node *(*rnh_matchpkt)	/* locate based on packet hdr */
124 	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
140 	            int (*)(struct radix_node *, void *),
142 struct radix_node *
144 	                  int (*)(struct radix_node *, void *),
146 struct radix_node
149 			struct radix_node [2]),
151 			struct radix_node *),
154 			struct radix_node [2]),
157 	 *rn_newpair(const void *, int, struct radix_node[2]),
158 	 *rn_search(const void *, struct radix_node *),
159 	 *rn_search_m(const void *, struct radix_node *, const void *);