1 /*-
2 * Copyright (c) 2015-2016
3 * Alexander V. Chernikov <[email protected]>
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * $FreeBSD$
30 */
31
32 #ifndef _NET_ROUTE_VAR_H_
33 #define _NET_ROUTE_VAR_H_
34
35 #ifndef RNF_NORMAL
36 #include <net/radix.h>
37 #endif
38 #include <sys/ck.h>
39 #include <sys/epoch.h>
40 #include <netinet/in.h> /* struct sockaddr_in */
41 #include <sys/counter.h>
42 #include <net/route/nhop.h>
43
44 #ifdef RTDEBUG
45 #define DPRINTF(_fmt, ...) printf("%s: " _fmt "\n", __func__ , ## __VA_ARGS__)
46 #else
47 #define DPRINTF(_fmt, ...)
48 #endif
49
50 struct nh_control;
51 typedef int rnh_preadd_entry_f_t(u_int fibnum, const struct sockaddr *addr,
52 const struct sockaddr *mask, struct nhop_object *nh);
53
54 struct rib_head {
55 struct radix_head head;
56 rn_matchaddr_f_t *rnh_matchaddr; /* longest match for sockaddr */
57 rn_addaddr_f_t *rnh_addaddr; /* add based on sockaddr*/
58 rn_deladdr_f_t *rnh_deladdr; /* remove based on sockaddr */
59 rn_lookup_f_t *rnh_lookup; /* exact match for sockaddr */
60 rn_walktree_t *rnh_walktree; /* traverse tree */
61 rn_walktree_from_t *rnh_walktree_from; /* traverse tree below a */
62 rnh_preadd_entry_f_t *rnh_preadd; /* hook to alter record prior to insertion */
63 rt_gen_t rnh_gen; /* generation counter */
64 int rnh_multipath; /* multipath capable ? */
65 struct radix_node rnh_nodes[3]; /* empty tree for common case */
66 struct rmlock rib_lock; /* config/data path lock */
67 struct radix_mask_head rmhead; /* masks radix head */
68 struct vnet *rib_vnet; /* vnet pointer */
69 int rib_family; /* AF of the rtable */
70 u_int rib_fibnum; /* fib number */
71 struct callout expire_callout; /* Callout for expiring dynamic routes */
72 time_t next_expire; /* Next expire run ts */
73 uint32_t rnh_prefixes; /* Number of prefixes */
74 uint32_t rib_dying:1; /* rib is detaching */
75 uint32_t rib_algo_fixed:1;/* fixed algorithm */
76 struct nh_control *nh_control; /* nexthop subsystem data */
77 CK_STAILQ_HEAD(, rib_subscription) rnh_subscribers;/* notification subscribers */
78 };
79
80 #define RIB_RLOCK_TRACKER struct rm_priotracker _rib_tracker
81 #define RIB_LOCK_INIT(rh) rm_init(&(rh)->rib_lock, "rib head lock")
82 #define RIB_LOCK_DESTROY(rh) rm_destroy(&(rh)->rib_lock)
83 #define RIB_RLOCK(rh) rm_rlock(&(rh)->rib_lock, &_rib_tracker)
84 #define RIB_RUNLOCK(rh) rm_runlock(&(rh)->rib_lock, &_rib_tracker)
85 #define RIB_WLOCK(rh) rm_wlock(&(rh)->rib_lock)
86 #define RIB_WUNLOCK(rh) rm_wunlock(&(rh)->rib_lock)
87 #define RIB_LOCK_ASSERT(rh) rm_assert(&(rh)->rib_lock, RA_LOCKED)
88 #define RIB_WLOCK_ASSERT(rh) rm_assert(&(rh)->rib_lock, RA_WLOCKED)
89
90 /* Constants */
91 #define RIB_MAX_RETRIES 3
92 #define RT_MAXFIBS UINT16_MAX
93 #define RIB_MAX_MPATH_WIDTH 64
94
95 /* Macro for verifying fields in af-specific 'struct route' structures */
96 #define CHK_STRUCT_FIELD_GENERIC(_s1, _f1, _s2, _f2) \
97 _Static_assert(sizeof(((_s1 *)0)->_f1) == sizeof(((_s2 *)0)->_f2), \
98 "Fields " #_f1 " and " #_f2 " size differs"); \
99 _Static_assert(__offsetof(_s1, _f1) == __offsetof(_s2, _f2), \
100 "Fields " #_f1 " and " #_f2 " offset differs");
101
102 #define _CHK_ROUTE_FIELD(_route_new, _field) \
103 CHK_STRUCT_FIELD_GENERIC(struct route, _field, _route_new, _field)
104
105 #define CHK_STRUCT_ROUTE_FIELDS(_route_new) \
106 _CHK_ROUTE_FIELD(_route_new, ro_nh) \
107 _CHK_ROUTE_FIELD(_route_new, ro_lle) \
108 _CHK_ROUTE_FIELD(_route_new, ro_prepend)\
109 _CHK_ROUTE_FIELD(_route_new, ro_plen) \
110 _CHK_ROUTE_FIELD(_route_new, ro_flags) \
111 _CHK_ROUTE_FIELD(_route_new, ro_mtu) \
112 _CHK_ROUTE_FIELD(_route_new, spare)
113
114 #define CHK_STRUCT_ROUTE_COMPAT(_ro_new, _dst_new) \
115 CHK_STRUCT_ROUTE_FIELDS(_ro_new); \
116 _Static_assert(__offsetof(struct route, ro_dst) == __offsetof(_ro_new, _dst_new),\
117 "ro_dst and " #_dst_new " are at different offset")
118
119 struct rib_head *rt_tables_get_rnh(uint32_t table, sa_family_t family);
120 int rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum);
121 struct rib_cmd_info;
122
123 VNET_PCPUSTAT_DECLARE(struct rtstat, rtstat);
124 #define RTSTAT_ADD(name, val) \
125 VNET_PCPUSTAT_ADD(struct rtstat, rtstat, name, (val))
126 #define RTSTAT_INC(name) RTSTAT_ADD(name, 1)
127
128 /*
129 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
130 * The operation can be done safely (in this code) because a
131 * 'struct rtentry' starts with two 'struct radix_node''s, the first
132 * one representing leaf nodes in the routing tree, which is
133 * what the code in radix.c passes us as a 'struct radix_node'.
134 *
135 * But because there are a lot of assumptions in this conversion,
136 * do not cast explicitly, but always use the macro below.
137 */
138 #define RNTORT(p) ((struct rtentry *)(p))
139
140 struct rtentry {
141 struct radix_node rt_nodes[2]; /* tree glue, and other values */
142 /*
143 * XXX struct rtentry must begin with a struct radix_node (or two!)
144 * because the code does some casts of a 'struct radix_node *'
145 * to a 'struct rtentry *'
146 */
147 #define rt_key(r) (*((struct sockaddr **)(&(r)->rt_nodes->rn_key)))
148 #define rt_mask(r) (*((struct sockaddr **)(&(r)->rt_nodes->rn_mask)))
149 #define rt_key_const(r) (*((const struct sockaddr * const *)(&(r)->rt_nodes->rn_key)))
150 #define rt_mask_const(r) (*((const struct sockaddr * const *)(&(r)->rt_nodes->rn_mask)))
151
152 /*
153 * 2 radix_node structurs above consists of 2x6 pointers, leaving
154 * 4 pointers (32 bytes) of the second cache line on amd64.
155 *
156 */
157 struct nhop_object *rt_nhop; /* nexthop data */
158 union {
159 /*
160 * Destination address storage.
161 * sizeof(struct sockaddr_in6) == 28, however
162 * the dataplane-relevant part (e.g. address) lies
163 * at offset 8..24, making the address not crossing
164 * cacheline boundary.
165 */
166 struct sockaddr_in rt_dst4;
167 struct sockaddr_in6 rt_dst6;
168 struct sockaddr rt_dst;
169 char rt_dstb[28];
170 };
171
172 int rte_flags; /* up/down?, host/net */
173 u_long rt_weight; /* absolute weight */
174 u_long rt_expire; /* lifetime for route, e.g. redirect */
175 struct rtentry *rt_chain; /* pointer to next rtentry to delete */
176 struct epoch_context rt_epoch_ctx; /* net epoch tracker */
177 };
178
179 /*
180 * With the split between the routing entry and the nexthop,
181 * rt_flags has to be split between these 2 entries. As rtentry
182 * mostly contains prefix data and is thought to be generic enough
183 * so one can transparently change the nexthop pointer w/o requiring
184 * any other rtentry changes, most of rt_flags shifts to the particular nexthop.
185 * /
186 *
187 * RTF_UP: rtentry, as an indication that it is linked.
188 * RTF_HOST: rtentry, nhop. The latter indication is needed for the datapath
189 * RTF_DYNAMIC: nhop, to make rtentry generic.
190 * RTF_MODIFIED: nhop, to make rtentry generic. (legacy)
191 * -- "native" path (nhop) properties:
192 * RTF_GATEWAY, RTF_STATIC, RTF_PROTO1, RTF_PROTO2, RTF_PROTO3, RTF_FIXEDMTU,
193 * RTF_PINNED, RTF_REJECT, RTF_BLACKHOLE, RTF_BROADCAST
194 */
195
196 /* Nexthop rt flags mask */
197 #define NHOP_RT_FLAG_MASK (RTF_GATEWAY | RTF_HOST | RTF_REJECT | RTF_DYNAMIC | \
198 RTF_MODIFIED | RTF_STATIC | RTF_BLACKHOLE | RTF_PROTO1 | RTF_PROTO2 | \
199 RTF_PROTO3 | RTF_FIXEDMTU | RTF_PINNED | RTF_BROADCAST)
200
201 /* rtentry rt flag mask */
202 #define RTE_RT_FLAG_MASK (RTF_UP | RTF_HOST)
203
204 /* route_temporal.c */
205 void tmproutes_update(struct rib_head *rnh, struct rtentry *rt);
206 void tmproutes_init(struct rib_head *rh);
207 void tmproutes_destroy(struct rib_head *rh);
208
209 /* route_ctl.c */
210 struct route_nhop_data;
211 int change_route_nhop(struct rib_head *rnh, struct rtentry *rt,
212 struct rt_addrinfo *info, struct route_nhop_data *rnd,
213 struct rib_cmd_info *rc);
214 int change_route_conditional(struct rib_head *rnh, struct rtentry *rt,
215 struct rt_addrinfo *info, struct route_nhop_data *nhd_orig,
216 struct route_nhop_data *nhd_new, struct rib_cmd_info *rc);
217 struct rtentry *lookup_prefix(struct rib_head *rnh,
218 const struct rt_addrinfo *info, struct route_nhop_data *rnd);
219
220 bool nhop_can_multipath(const struct nhop_object *nh);
221 bool match_nhop_gw(const struct nhop_object *nh, const struct sockaddr *gw);
222 int check_info_match_nhop(const struct rt_addrinfo *info,
223 const struct rtentry *rt, const struct nhop_object *nh);
224 int can_override_nhop(const struct rt_addrinfo *info,
225 const struct nhop_object *nh);
226
227 void vnet_rtzone_init(void);
228 void vnet_rtzone_destroy(void);
229
230 /* subscriptions */
231 void rib_init_subscriptions(struct rib_head *rnh);
232 void rib_destroy_subscriptions(struct rib_head *rnh);
233
234 /* Nexhops */
235 void nhops_init(void);
236 int nhops_init_rib(struct rib_head *rh);
237 void nhops_destroy_rib(struct rib_head *rh);
238 void nhop_ref_object(struct nhop_object *nh);
239 int nhop_try_ref_object(struct nhop_object *nh);
240 void nhop_ref_any(struct nhop_object *nh);
241 void nhop_free_any(struct nhop_object *nh);
242
243 void nhop_set_type(struct nhop_object *nh, enum nhop_type nh_type);
244 void nhop_set_rtflags(struct nhop_object *nh, int rt_flags);
245
246 int nhop_create_from_info(struct rib_head *rnh, struct rt_addrinfo *info,
247 struct nhop_object **nh_ret);
248 int nhop_create_from_nhop(struct rib_head *rnh, const struct nhop_object *nh_orig,
249 struct rt_addrinfo *info, struct nhop_object **pnh_priv);
250
251 void nhops_update_ifmtu(struct rib_head *rh, struct ifnet *ifp, uint32_t mtu);
252 int nhops_dump_sysctl(struct rib_head *rh, struct sysctl_req *w);
253
254 /* MULTIPATH */
255 #define MPF_MULTIPATH 0x08 /* need to be consistent with NHF_MULTIPATH */
256
257 struct nhgrp_object {
258 uint16_t nhg_flags; /* nexthop group flags */
259 uint8_t nhg_size; /* dataplain group size */
260 uint8_t spare;
261 struct nhop_object *nhops[0]; /* nhops */
262 };
263
264 static inline struct nhop_object *
nhop_select(struct nhop_object * nh,uint32_t flowid)265 nhop_select(struct nhop_object *nh, uint32_t flowid)
266 {
267
268 #ifdef ROUTE_MPATH
269 if (NH_IS_NHGRP(nh)) {
270 struct nhgrp_object *nhg = (struct nhgrp_object *)nh;
271 nh = nhg->nhops[flowid % nhg->nhg_size];
272 }
273 #endif
274 return (nh);
275 }
276
277
278 struct weightened_nhop;
279
280 /* mpath_ctl.c */
281 int add_route_mpath(struct rib_head *rnh, struct rt_addrinfo *info,
282 struct rtentry *rt, struct route_nhop_data *rnd_add,
283 struct route_nhop_data *rnd_orig, struct rib_cmd_info *rc);
284 int del_route_mpath(struct rib_head *rh, struct rt_addrinfo *info,
285 struct rtentry *rt, struct nhgrp_object *nhg, struct rib_cmd_info *rc);
286
287 /* nhgrp.c */
288 int nhgrp_ctl_init(struct nh_control *ctl);
289 void nhgrp_ctl_free(struct nh_control *ctl);
290 void nhgrp_ctl_unlink_all(struct nh_control *ctl);
291
292
293 /* nhgrp_ctl.c */
294 int nhgrp_dump_sysctl(struct rib_head *rh, struct sysctl_req *w);
295
296 int nhgrp_get_group(struct rib_head *rh, struct weightened_nhop *wn,
297 int num_nhops, struct route_nhop_data *rnd);
298 typedef bool nhgrp_filter_cb_t(const struct nhop_object *nh, void *data);
299 int nhgrp_get_filtered_group(struct rib_head *rh, const struct nhgrp_object *src,
300 nhgrp_filter_cb_t flt_func, void *flt_data, struct route_nhop_data *rnd);
301 int nhgrp_get_addition_group(struct rib_head *rnh,
302 struct route_nhop_data *rnd_orig, struct route_nhop_data *rnd_add,
303 struct route_nhop_data *rnd_new);
304
305 void nhgrp_ref_object(struct nhgrp_object *nhg);
306 uint32_t nhgrp_get_idx(const struct nhgrp_object *nhg);
307 void nhgrp_free(struct nhgrp_object *nhg);
308
309 /* rtsock */
310 int rtsock_routemsg(int cmd, struct rtentry *rt, struct nhop_object *nh,
311 int fibnum);
312 int rtsock_routemsg_info(int cmd, struct rt_addrinfo *info, int fibnum);
313 int rtsock_addrmsg(int cmd, struct ifaddr *ifa, int fibnum);
314
315
316 /* lookup_framework.c */
317 void fib_grow_rtables(uint32_t new_num_tables);
318 int fib_select_algo_initial(struct rib_head *rh);
319 void fib_destroy_rib(struct rib_head *rh);
320 void vnet_fib_init(void);
321 void vnet_fib_destroy(void);
322
323 /* Entropy data used for outbound hashing */
324 #define MPATH_ENTROPY_KEY_LEN 40
325 extern uint8_t mpath_entropy_key[MPATH_ENTROPY_KEY_LEN];
326
327 #endif
328