Commit | Line | Data |
---|---|---|
464dce18 IS |
1 | /* |
2 | * drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c | |
3 | * Copyright (c) 2016 Mellanox Technologies. All rights reserved. | |
4 | * Copyright (c) 2016 Jiri Pirko <jiri@mellanox.com> | |
5 | * Copyright (c) 2016 Ido Schimmel <idosch@mellanox.com> | |
c723c735 | 6 | * Copyright (c) 2016 Yotam Gigi <yotamg@mellanox.com> |
464dce18 IS |
7 | * |
8 | * Redistribution and use in source and binary forms, with or without | |
9 | * modification, are permitted provided that the following conditions are met: | |
10 | * | |
11 | * 1. Redistributions of source code must retain the above copyright | |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3. Neither the names of the copyright holders nor the names of its | |
17 | * contributors may be used to endorse or promote products derived from | |
18 | * this software without specific prior written permission. | |
19 | * | |
20 | * Alternatively, this software may be distributed under the terms of the | |
21 | * GNU General Public License ("GPL") version 2 as published by the Free | |
22 | * Software Foundation. | |
23 | * | |
24 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
25 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
28 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
29 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
30 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
31 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
32 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
33 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
34 | * POSSIBILITY OF SUCH DAMAGE. | |
35 | */ | |
36 | ||
37 | #include <linux/kernel.h> | |
38 | #include <linux/types.h> | |
5e9c16cc JP |
39 | #include <linux/rhashtable.h> |
40 | #include <linux/bitops.h> | |
41 | #include <linux/in6.h> | |
c723c735 YG |
42 | #include <linux/notifier.h> |
43 | #include <net/netevent.h> | |
6cf3c971 JP |
44 | #include <net/neighbour.h> |
45 | #include <net/arp.h> | |
b45f64d1 | 46 | #include <net/ip_fib.h> |
464dce18 IS |
47 | |
48 | #include "spectrum.h" | |
49 | #include "core.h" | |
50 | #include "reg.h" | |
51 | ||
53342023 JP |
52 | #define mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) \ |
53 | for_each_set_bit(prefix, (prefix_usage)->b, MLXSW_SP_PREFIX_COUNT) | |
54 | ||
6b75c480 JP |
55 | static bool |
56 | mlxsw_sp_prefix_usage_subset(struct mlxsw_sp_prefix_usage *prefix_usage1, | |
57 | struct mlxsw_sp_prefix_usage *prefix_usage2) | |
58 | { | |
59 | unsigned char prefix; | |
60 | ||
61 | mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage1) { | |
62 | if (!test_bit(prefix, prefix_usage2->b)) | |
63 | return false; | |
64 | } | |
65 | return true; | |
66 | } | |
67 | ||
53342023 JP |
68 | static bool |
69 | mlxsw_sp_prefix_usage_eq(struct mlxsw_sp_prefix_usage *prefix_usage1, | |
70 | struct mlxsw_sp_prefix_usage *prefix_usage2) | |
71 | { | |
72 | return !memcmp(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1)); | |
73 | } | |
74 | ||
6b75c480 JP |
75 | static bool |
76 | mlxsw_sp_prefix_usage_none(struct mlxsw_sp_prefix_usage *prefix_usage) | |
77 | { | |
78 | struct mlxsw_sp_prefix_usage prefix_usage_none = {{ 0 } }; | |
79 | ||
80 | return mlxsw_sp_prefix_usage_eq(prefix_usage, &prefix_usage_none); | |
81 | } | |
82 | ||
83 | static void | |
84 | mlxsw_sp_prefix_usage_cpy(struct mlxsw_sp_prefix_usage *prefix_usage1, | |
85 | struct mlxsw_sp_prefix_usage *prefix_usage2) | |
86 | { | |
87 | memcpy(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1)); | |
88 | } | |
89 | ||
90 | static void | |
91 | mlxsw_sp_prefix_usage_zero(struct mlxsw_sp_prefix_usage *prefix_usage) | |
92 | { | |
93 | memset(prefix_usage, 0, sizeof(*prefix_usage)); | |
94 | } | |
95 | ||
5e9c16cc JP |
96 | static void |
97 | mlxsw_sp_prefix_usage_set(struct mlxsw_sp_prefix_usage *prefix_usage, | |
98 | unsigned char prefix_len) | |
99 | { | |
100 | set_bit(prefix_len, prefix_usage->b); | |
101 | } | |
102 | ||
103 | static void | |
104 | mlxsw_sp_prefix_usage_clear(struct mlxsw_sp_prefix_usage *prefix_usage, | |
105 | unsigned char prefix_len) | |
106 | { | |
107 | clear_bit(prefix_len, prefix_usage->b); | |
108 | } | |
109 | ||
110 | struct mlxsw_sp_fib_key { | |
5b004412 | 111 | struct net_device *dev; |
5e9c16cc JP |
112 | unsigned char addr[sizeof(struct in6_addr)]; |
113 | unsigned char prefix_len; | |
114 | }; | |
115 | ||
61c503f9 JP |
116 | enum mlxsw_sp_fib_entry_type { |
117 | MLXSW_SP_FIB_ENTRY_TYPE_REMOTE, | |
118 | MLXSW_SP_FIB_ENTRY_TYPE_LOCAL, | |
119 | MLXSW_SP_FIB_ENTRY_TYPE_TRAP, | |
120 | }; | |
121 | ||
a7ff87ac JP |
122 | struct mlxsw_sp_nexthop_group; |
123 | ||
5e9c16cc JP |
124 | struct mlxsw_sp_fib_entry { |
125 | struct rhash_head ht_node; | |
b45f64d1 | 126 | struct list_head list; |
5e9c16cc | 127 | struct mlxsw_sp_fib_key key; |
61c503f9 | 128 | enum mlxsw_sp_fib_entry_type type; |
5b004412 | 129 | unsigned int ref_count; |
61c503f9 JP |
130 | u16 rif; /* used for action local */ |
131 | struct mlxsw_sp_vr *vr; | |
b45f64d1 | 132 | struct fib_info *fi; |
a7ff87ac JP |
133 | struct list_head nexthop_group_node; |
134 | struct mlxsw_sp_nexthop_group *nh_group; | |
5e9c16cc JP |
135 | }; |
136 | ||
137 | struct mlxsw_sp_fib { | |
138 | struct rhashtable ht; | |
b45f64d1 | 139 | struct list_head entry_list; |
5e9c16cc JP |
140 | unsigned long prefix_ref_count[MLXSW_SP_PREFIX_COUNT]; |
141 | struct mlxsw_sp_prefix_usage prefix_usage; | |
142 | }; | |
143 | ||
144 | static const struct rhashtable_params mlxsw_sp_fib_ht_params = { | |
145 | .key_offset = offsetof(struct mlxsw_sp_fib_entry, key), | |
146 | .head_offset = offsetof(struct mlxsw_sp_fib_entry, ht_node), | |
147 | .key_len = sizeof(struct mlxsw_sp_fib_key), | |
148 | .automatic_shrinking = true, | |
149 | }; | |
150 | ||
151 | static int mlxsw_sp_fib_entry_insert(struct mlxsw_sp_fib *fib, | |
152 | struct mlxsw_sp_fib_entry *fib_entry) | |
153 | { | |
154 | unsigned char prefix_len = fib_entry->key.prefix_len; | |
155 | int err; | |
156 | ||
157 | err = rhashtable_insert_fast(&fib->ht, &fib_entry->ht_node, | |
158 | mlxsw_sp_fib_ht_params); | |
159 | if (err) | |
160 | return err; | |
b45f64d1 | 161 | list_add_tail(&fib_entry->list, &fib->entry_list); |
5e9c16cc JP |
162 | if (fib->prefix_ref_count[prefix_len]++ == 0) |
163 | mlxsw_sp_prefix_usage_set(&fib->prefix_usage, prefix_len); | |
164 | return 0; | |
165 | } | |
166 | ||
167 | static void mlxsw_sp_fib_entry_remove(struct mlxsw_sp_fib *fib, | |
168 | struct mlxsw_sp_fib_entry *fib_entry) | |
169 | { | |
170 | unsigned char prefix_len = fib_entry->key.prefix_len; | |
171 | ||
172 | if (--fib->prefix_ref_count[prefix_len] == 0) | |
173 | mlxsw_sp_prefix_usage_clear(&fib->prefix_usage, prefix_len); | |
b45f64d1 | 174 | list_del(&fib_entry->list); |
5e9c16cc JP |
175 | rhashtable_remove_fast(&fib->ht, &fib_entry->ht_node, |
176 | mlxsw_sp_fib_ht_params); | |
177 | } | |
178 | ||
179 | static struct mlxsw_sp_fib_entry * | |
180 | mlxsw_sp_fib_entry_create(struct mlxsw_sp_fib *fib, const void *addr, | |
5b004412 JP |
181 | size_t addr_len, unsigned char prefix_len, |
182 | struct net_device *dev) | |
5e9c16cc JP |
183 | { |
184 | struct mlxsw_sp_fib_entry *fib_entry; | |
185 | ||
186 | fib_entry = kzalloc(sizeof(*fib_entry), GFP_KERNEL); | |
187 | if (!fib_entry) | |
188 | return NULL; | |
5b004412 | 189 | fib_entry->key.dev = dev; |
5e9c16cc JP |
190 | memcpy(fib_entry->key.addr, addr, addr_len); |
191 | fib_entry->key.prefix_len = prefix_len; | |
192 | return fib_entry; | |
193 | } | |
194 | ||
195 | static void mlxsw_sp_fib_entry_destroy(struct mlxsw_sp_fib_entry *fib_entry) | |
196 | { | |
197 | kfree(fib_entry); | |
198 | } | |
199 | ||
200 | static struct mlxsw_sp_fib_entry * | |
201 | mlxsw_sp_fib_entry_lookup(struct mlxsw_sp_fib *fib, const void *addr, | |
5b004412 JP |
202 | size_t addr_len, unsigned char prefix_len, |
203 | struct net_device *dev) | |
5e9c16cc | 204 | { |
5b004412 | 205 | struct mlxsw_sp_fib_key key; |
5e9c16cc | 206 | |
5b004412 JP |
207 | memset(&key, 0, sizeof(key)); |
208 | key.dev = dev; | |
5e9c16cc JP |
209 | memcpy(key.addr, addr, addr_len); |
210 | key.prefix_len = prefix_len; | |
211 | return rhashtable_lookup_fast(&fib->ht, &key, mlxsw_sp_fib_ht_params); | |
212 | } | |
213 | ||
214 | static struct mlxsw_sp_fib *mlxsw_sp_fib_create(void) | |
215 | { | |
216 | struct mlxsw_sp_fib *fib; | |
217 | int err; | |
218 | ||
219 | fib = kzalloc(sizeof(*fib), GFP_KERNEL); | |
220 | if (!fib) | |
221 | return ERR_PTR(-ENOMEM); | |
222 | err = rhashtable_init(&fib->ht, &mlxsw_sp_fib_ht_params); | |
223 | if (err) | |
224 | goto err_rhashtable_init; | |
b45f64d1 | 225 | INIT_LIST_HEAD(&fib->entry_list); |
5e9c16cc JP |
226 | return fib; |
227 | ||
228 | err_rhashtable_init: | |
229 | kfree(fib); | |
230 | return ERR_PTR(err); | |
231 | } | |
232 | ||
233 | static void mlxsw_sp_fib_destroy(struct mlxsw_sp_fib *fib) | |
234 | { | |
235 | rhashtable_destroy(&fib->ht); | |
236 | kfree(fib); | |
237 | } | |
238 | ||
53342023 JP |
239 | static struct mlxsw_sp_lpm_tree * |
240 | mlxsw_sp_lpm_tree_find_unused(struct mlxsw_sp *mlxsw_sp, bool one_reserved) | |
241 | { | |
242 | static struct mlxsw_sp_lpm_tree *lpm_tree; | |
243 | int i; | |
244 | ||
245 | for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) { | |
246 | lpm_tree = &mlxsw_sp->router.lpm_trees[i]; | |
247 | if (lpm_tree->ref_count == 0) { | |
248 | if (one_reserved) | |
249 | one_reserved = false; | |
250 | else | |
251 | return lpm_tree; | |
252 | } | |
253 | } | |
254 | return NULL; | |
255 | } | |
256 | ||
257 | static int mlxsw_sp_lpm_tree_alloc(struct mlxsw_sp *mlxsw_sp, | |
258 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
259 | { | |
260 | char ralta_pl[MLXSW_REG_RALTA_LEN]; | |
261 | ||
1a9234e6 IS |
262 | mlxsw_reg_ralta_pack(ralta_pl, true, |
263 | (enum mlxsw_reg_ralxx_protocol) lpm_tree->proto, | |
264 | lpm_tree->id); | |
53342023 JP |
265 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl); |
266 | } | |
267 | ||
268 | static int mlxsw_sp_lpm_tree_free(struct mlxsw_sp *mlxsw_sp, | |
269 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
270 | { | |
271 | char ralta_pl[MLXSW_REG_RALTA_LEN]; | |
272 | ||
1a9234e6 IS |
273 | mlxsw_reg_ralta_pack(ralta_pl, false, |
274 | (enum mlxsw_reg_ralxx_protocol) lpm_tree->proto, | |
275 | lpm_tree->id); | |
53342023 JP |
276 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl); |
277 | } | |
278 | ||
279 | static int | |
280 | mlxsw_sp_lpm_tree_left_struct_set(struct mlxsw_sp *mlxsw_sp, | |
281 | struct mlxsw_sp_prefix_usage *prefix_usage, | |
282 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
283 | { | |
284 | char ralst_pl[MLXSW_REG_RALST_LEN]; | |
285 | u8 root_bin = 0; | |
286 | u8 prefix; | |
287 | u8 last_prefix = MLXSW_REG_RALST_BIN_NO_CHILD; | |
288 | ||
289 | mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) | |
290 | root_bin = prefix; | |
291 | ||
292 | mlxsw_reg_ralst_pack(ralst_pl, root_bin, lpm_tree->id); | |
293 | mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) { | |
294 | if (prefix == 0) | |
295 | continue; | |
296 | mlxsw_reg_ralst_bin_pack(ralst_pl, prefix, last_prefix, | |
297 | MLXSW_REG_RALST_BIN_NO_CHILD); | |
298 | last_prefix = prefix; | |
299 | } | |
300 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl); | |
301 | } | |
302 | ||
303 | static struct mlxsw_sp_lpm_tree * | |
304 | mlxsw_sp_lpm_tree_create(struct mlxsw_sp *mlxsw_sp, | |
305 | struct mlxsw_sp_prefix_usage *prefix_usage, | |
306 | enum mlxsw_sp_l3proto proto, bool one_reserved) | |
307 | { | |
308 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
309 | int err; | |
310 | ||
311 | lpm_tree = mlxsw_sp_lpm_tree_find_unused(mlxsw_sp, one_reserved); | |
312 | if (!lpm_tree) | |
313 | return ERR_PTR(-EBUSY); | |
314 | lpm_tree->proto = proto; | |
315 | err = mlxsw_sp_lpm_tree_alloc(mlxsw_sp, lpm_tree); | |
316 | if (err) | |
317 | return ERR_PTR(err); | |
318 | ||
319 | err = mlxsw_sp_lpm_tree_left_struct_set(mlxsw_sp, prefix_usage, | |
320 | lpm_tree); | |
321 | if (err) | |
322 | goto err_left_struct_set; | |
2083d367 JP |
323 | memcpy(&lpm_tree->prefix_usage, prefix_usage, |
324 | sizeof(lpm_tree->prefix_usage)); | |
53342023 JP |
325 | return lpm_tree; |
326 | ||
327 | err_left_struct_set: | |
328 | mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree); | |
329 | return ERR_PTR(err); | |
330 | } | |
331 | ||
332 | static int mlxsw_sp_lpm_tree_destroy(struct mlxsw_sp *mlxsw_sp, | |
333 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
334 | { | |
335 | return mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree); | |
336 | } | |
337 | ||
338 | static struct mlxsw_sp_lpm_tree * | |
339 | mlxsw_sp_lpm_tree_get(struct mlxsw_sp *mlxsw_sp, | |
340 | struct mlxsw_sp_prefix_usage *prefix_usage, | |
341 | enum mlxsw_sp_l3proto proto, bool one_reserved) | |
342 | { | |
343 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
344 | int i; | |
345 | ||
346 | for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) { | |
347 | lpm_tree = &mlxsw_sp->router.lpm_trees[i]; | |
8b99becd JP |
348 | if (lpm_tree->ref_count != 0 && |
349 | lpm_tree->proto == proto && | |
53342023 JP |
350 | mlxsw_sp_prefix_usage_eq(&lpm_tree->prefix_usage, |
351 | prefix_usage)) | |
352 | goto inc_ref_count; | |
353 | } | |
354 | lpm_tree = mlxsw_sp_lpm_tree_create(mlxsw_sp, prefix_usage, | |
355 | proto, one_reserved); | |
356 | if (IS_ERR(lpm_tree)) | |
357 | return lpm_tree; | |
358 | ||
359 | inc_ref_count: | |
360 | lpm_tree->ref_count++; | |
361 | return lpm_tree; | |
362 | } | |
363 | ||
364 | static int mlxsw_sp_lpm_tree_put(struct mlxsw_sp *mlxsw_sp, | |
365 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
366 | { | |
367 | if (--lpm_tree->ref_count == 0) | |
368 | return mlxsw_sp_lpm_tree_destroy(mlxsw_sp, lpm_tree); | |
369 | return 0; | |
370 | } | |
371 | ||
372 | static void mlxsw_sp_lpm_init(struct mlxsw_sp *mlxsw_sp) | |
373 | { | |
374 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
375 | int i; | |
376 | ||
377 | for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) { | |
378 | lpm_tree = &mlxsw_sp->router.lpm_trees[i]; | |
379 | lpm_tree->id = i + MLXSW_SP_LPM_TREE_MIN; | |
380 | } | |
381 | } | |
382 | ||
6b75c480 JP |
383 | static struct mlxsw_sp_vr *mlxsw_sp_vr_find_unused(struct mlxsw_sp *mlxsw_sp) |
384 | { | |
385 | struct mlxsw_sp_vr *vr; | |
386 | int i; | |
387 | ||
c1a38311 | 388 | for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) { |
6b75c480 JP |
389 | vr = &mlxsw_sp->router.vrs[i]; |
390 | if (!vr->used) | |
391 | return vr; | |
392 | } | |
393 | return NULL; | |
394 | } | |
395 | ||
396 | static int mlxsw_sp_vr_lpm_tree_bind(struct mlxsw_sp *mlxsw_sp, | |
397 | struct mlxsw_sp_vr *vr) | |
398 | { | |
399 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
400 | ||
1a9234e6 IS |
401 | mlxsw_reg_raltb_pack(raltb_pl, vr->id, |
402 | (enum mlxsw_reg_ralxx_protocol) vr->proto, | |
403 | vr->lpm_tree->id); | |
6b75c480 JP |
404 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
405 | } | |
406 | ||
407 | static int mlxsw_sp_vr_lpm_tree_unbind(struct mlxsw_sp *mlxsw_sp, | |
408 | struct mlxsw_sp_vr *vr) | |
409 | { | |
410 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
411 | ||
412 | /* Bind to tree 0 which is default */ | |
1a9234e6 IS |
413 | mlxsw_reg_raltb_pack(raltb_pl, vr->id, |
414 | (enum mlxsw_reg_ralxx_protocol) vr->proto, 0); | |
6b75c480 JP |
415 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
416 | } | |
417 | ||
418 | static u32 mlxsw_sp_fix_tb_id(u32 tb_id) | |
419 | { | |
420 | /* For our purpose, squash main and local table into one */ | |
421 | if (tb_id == RT_TABLE_LOCAL) | |
422 | tb_id = RT_TABLE_MAIN; | |
423 | return tb_id; | |
424 | } | |
425 | ||
426 | static struct mlxsw_sp_vr *mlxsw_sp_vr_find(struct mlxsw_sp *mlxsw_sp, | |
427 | u32 tb_id, | |
428 | enum mlxsw_sp_l3proto proto) | |
429 | { | |
430 | struct mlxsw_sp_vr *vr; | |
431 | int i; | |
432 | ||
433 | tb_id = mlxsw_sp_fix_tb_id(tb_id); | |
9497c042 | 434 | |
c1a38311 | 435 | for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) { |
6b75c480 JP |
436 | vr = &mlxsw_sp->router.vrs[i]; |
437 | if (vr->used && vr->proto == proto && vr->tb_id == tb_id) | |
438 | return vr; | |
439 | } | |
440 | return NULL; | |
441 | } | |
442 | ||
443 | static struct mlxsw_sp_vr *mlxsw_sp_vr_create(struct mlxsw_sp *mlxsw_sp, | |
444 | unsigned char prefix_len, | |
445 | u32 tb_id, | |
446 | enum mlxsw_sp_l3proto proto) | |
447 | { | |
448 | struct mlxsw_sp_prefix_usage req_prefix_usage; | |
449 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
450 | struct mlxsw_sp_vr *vr; | |
451 | int err; | |
452 | ||
453 | vr = mlxsw_sp_vr_find_unused(mlxsw_sp); | |
454 | if (!vr) | |
455 | return ERR_PTR(-EBUSY); | |
456 | vr->fib = mlxsw_sp_fib_create(); | |
457 | if (IS_ERR(vr->fib)) | |
458 | return ERR_CAST(vr->fib); | |
459 | ||
460 | vr->proto = proto; | |
461 | vr->tb_id = tb_id; | |
462 | mlxsw_sp_prefix_usage_zero(&req_prefix_usage); | |
463 | mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len); | |
464 | lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, &req_prefix_usage, | |
465 | proto, true); | |
466 | if (IS_ERR(lpm_tree)) { | |
467 | err = PTR_ERR(lpm_tree); | |
468 | goto err_tree_get; | |
469 | } | |
470 | vr->lpm_tree = lpm_tree; | |
471 | err = mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr); | |
472 | if (err) | |
473 | goto err_tree_bind; | |
474 | ||
475 | vr->used = true; | |
476 | return vr; | |
477 | ||
478 | err_tree_bind: | |
479 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
480 | err_tree_get: | |
481 | mlxsw_sp_fib_destroy(vr->fib); | |
482 | ||
483 | return ERR_PTR(err); | |
484 | } | |
485 | ||
486 | static void mlxsw_sp_vr_destroy(struct mlxsw_sp *mlxsw_sp, | |
487 | struct mlxsw_sp_vr *vr) | |
488 | { | |
489 | mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr); | |
490 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
491 | mlxsw_sp_fib_destroy(vr->fib); | |
492 | vr->used = false; | |
493 | } | |
494 | ||
495 | static int | |
496 | mlxsw_sp_vr_lpm_tree_check(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr, | |
497 | struct mlxsw_sp_prefix_usage *req_prefix_usage) | |
498 | { | |
499 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
500 | ||
501 | if (mlxsw_sp_prefix_usage_eq(req_prefix_usage, | |
502 | &vr->lpm_tree->prefix_usage)) | |
503 | return 0; | |
504 | ||
505 | lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, req_prefix_usage, | |
506 | vr->proto, false); | |
507 | if (IS_ERR(lpm_tree)) { | |
508 | /* We failed to get a tree according to the required | |
509 | * prefix usage. However, the current tree might be still good | |
510 | * for us if our requirement is subset of the prefixes used | |
511 | * in the tree. | |
512 | */ | |
513 | if (mlxsw_sp_prefix_usage_subset(req_prefix_usage, | |
514 | &vr->lpm_tree->prefix_usage)) | |
515 | return 0; | |
516 | return PTR_ERR(lpm_tree); | |
517 | } | |
518 | ||
519 | mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr); | |
520 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
521 | vr->lpm_tree = lpm_tree; | |
522 | return mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr); | |
523 | } | |
524 | ||
525 | static struct mlxsw_sp_vr *mlxsw_sp_vr_get(struct mlxsw_sp *mlxsw_sp, | |
526 | unsigned char prefix_len, | |
527 | u32 tb_id, | |
528 | enum mlxsw_sp_l3proto proto) | |
529 | { | |
530 | struct mlxsw_sp_vr *vr; | |
531 | int err; | |
532 | ||
533 | tb_id = mlxsw_sp_fix_tb_id(tb_id); | |
534 | vr = mlxsw_sp_vr_find(mlxsw_sp, tb_id, proto); | |
535 | if (!vr) { | |
536 | vr = mlxsw_sp_vr_create(mlxsw_sp, prefix_len, tb_id, proto); | |
537 | if (IS_ERR(vr)) | |
538 | return vr; | |
539 | } else { | |
540 | struct mlxsw_sp_prefix_usage req_prefix_usage; | |
541 | ||
542 | mlxsw_sp_prefix_usage_cpy(&req_prefix_usage, | |
543 | &vr->fib->prefix_usage); | |
544 | mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len); | |
545 | /* Need to replace LPM tree in case new prefix is required. */ | |
546 | err = mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr, | |
547 | &req_prefix_usage); | |
548 | if (err) | |
549 | return ERR_PTR(err); | |
550 | } | |
551 | return vr; | |
552 | } | |
553 | ||
554 | static void mlxsw_sp_vr_put(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr) | |
555 | { | |
556 | /* Destroy virtual router entity in case the associated FIB is empty | |
557 | * and allow it to be used for other tables in future. Otherwise, | |
558 | * check if some prefix usage did not disappear and change tree if | |
559 | * that is the case. Note that in case new, smaller tree cannot be | |
560 | * allocated, the original one will be kept being used. | |
561 | */ | |
562 | if (mlxsw_sp_prefix_usage_none(&vr->fib->prefix_usage)) | |
563 | mlxsw_sp_vr_destroy(mlxsw_sp, vr); | |
564 | else | |
565 | mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr, | |
566 | &vr->fib->prefix_usage); | |
567 | } | |
568 | ||
9497c042 | 569 | static int mlxsw_sp_vrs_init(struct mlxsw_sp *mlxsw_sp) |
6b75c480 JP |
570 | { |
571 | struct mlxsw_sp_vr *vr; | |
c1a38311 | 572 | u64 max_vrs; |
6b75c480 JP |
573 | int i; |
574 | ||
c1a38311 | 575 | if (!MLXSW_CORE_RES_VALID(mlxsw_sp->core, MAX_VRS)) |
9497c042 NF |
576 | return -EIO; |
577 | ||
c1a38311 JP |
578 | max_vrs = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); |
579 | mlxsw_sp->router.vrs = kcalloc(max_vrs, sizeof(struct mlxsw_sp_vr), | |
9497c042 NF |
580 | GFP_KERNEL); |
581 | if (!mlxsw_sp->router.vrs) | |
582 | return -ENOMEM; | |
583 | ||
c1a38311 | 584 | for (i = 0; i < max_vrs; i++) { |
6b75c480 JP |
585 | vr = &mlxsw_sp->router.vrs[i]; |
586 | vr->id = i; | |
587 | } | |
9497c042 NF |
588 | |
589 | return 0; | |
590 | } | |
591 | ||
ac571de9 IS |
592 | static void mlxsw_sp_router_fib_flush(struct mlxsw_sp *mlxsw_sp); |
593 | ||
9497c042 NF |
594 | static void mlxsw_sp_vrs_fini(struct mlxsw_sp *mlxsw_sp) |
595 | { | |
3057224e IS |
596 | /* At this stage we're guaranteed not to have new incoming |
597 | * FIB notifications and the work queue is free from FIBs | |
598 | * sitting on top of mlxsw netdevs. However, we can still | |
599 | * have other FIBs queued. Flush the queue before flushing | |
600 | * the device's tables. No need for locks, as we're the only | |
601 | * writer. | |
602 | */ | |
603 | mlxsw_core_flush_owq(); | |
ac571de9 | 604 | mlxsw_sp_router_fib_flush(mlxsw_sp); |
9497c042 | 605 | kfree(mlxsw_sp->router.vrs); |
6b75c480 JP |
606 | } |
607 | ||
6cf3c971 | 608 | struct mlxsw_sp_neigh_key { |
33b1341c | 609 | struct neighbour *n; |
6cf3c971 JP |
610 | }; |
611 | ||
612 | struct mlxsw_sp_neigh_entry { | |
613 | struct rhash_head ht_node; | |
614 | struct mlxsw_sp_neigh_key key; | |
615 | u16 rif; | |
a6bf9e93 YG |
616 | bool offloaded; |
617 | struct delayed_work dw; | |
618 | struct mlxsw_sp_port *mlxsw_sp_port; | |
619 | unsigned char ha[ETH_ALEN]; | |
a7ff87ac JP |
620 | struct list_head nexthop_list; /* list of nexthops using |
621 | * this neigh entry | |
622 | */ | |
b2157149 | 623 | struct list_head nexthop_neighs_list_node; |
6cf3c971 JP |
624 | }; |
625 | ||
626 | static const struct rhashtable_params mlxsw_sp_neigh_ht_params = { | |
627 | .key_offset = offsetof(struct mlxsw_sp_neigh_entry, key), | |
628 | .head_offset = offsetof(struct mlxsw_sp_neigh_entry, ht_node), | |
629 | .key_len = sizeof(struct mlxsw_sp_neigh_key), | |
630 | }; | |
631 | ||
632 | static int | |
633 | mlxsw_sp_neigh_entry_insert(struct mlxsw_sp *mlxsw_sp, | |
634 | struct mlxsw_sp_neigh_entry *neigh_entry) | |
635 | { | |
636 | return rhashtable_insert_fast(&mlxsw_sp->router.neigh_ht, | |
637 | &neigh_entry->ht_node, | |
638 | mlxsw_sp_neigh_ht_params); | |
639 | } | |
640 | ||
641 | static void | |
642 | mlxsw_sp_neigh_entry_remove(struct mlxsw_sp *mlxsw_sp, | |
643 | struct mlxsw_sp_neigh_entry *neigh_entry) | |
644 | { | |
645 | rhashtable_remove_fast(&mlxsw_sp->router.neigh_ht, | |
646 | &neigh_entry->ht_node, | |
647 | mlxsw_sp_neigh_ht_params); | |
648 | } | |
649 | ||
a6bf9e93 YG |
650 | static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work); |
651 | ||
6cf3c971 | 652 | static struct mlxsw_sp_neigh_entry * |
33b1341c | 653 | mlxsw_sp_neigh_entry_create(struct neighbour *n, u16 rif) |
6cf3c971 JP |
654 | { |
655 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
656 | ||
657 | neigh_entry = kzalloc(sizeof(*neigh_entry), GFP_ATOMIC); | |
658 | if (!neigh_entry) | |
659 | return NULL; | |
33b1341c | 660 | neigh_entry->key.n = n; |
6cf3c971 | 661 | neigh_entry->rif = rif; |
a6bf9e93 | 662 | INIT_DELAYED_WORK(&neigh_entry->dw, mlxsw_sp_router_neigh_update_hw); |
a7ff87ac | 663 | INIT_LIST_HEAD(&neigh_entry->nexthop_list); |
6cf3c971 JP |
664 | return neigh_entry; |
665 | } | |
666 | ||
667 | static void | |
668 | mlxsw_sp_neigh_entry_destroy(struct mlxsw_sp_neigh_entry *neigh_entry) | |
669 | { | |
670 | kfree(neigh_entry); | |
671 | } | |
672 | ||
673 | static struct mlxsw_sp_neigh_entry * | |
33b1341c | 674 | mlxsw_sp_neigh_entry_lookup(struct mlxsw_sp *mlxsw_sp, struct neighbour *n) |
6cf3c971 | 675 | { |
33b1341c | 676 | struct mlxsw_sp_neigh_key key; |
6cf3c971 | 677 | |
33b1341c | 678 | key.n = n; |
6cf3c971 JP |
679 | return rhashtable_lookup_fast(&mlxsw_sp->router.neigh_ht, |
680 | &key, mlxsw_sp_neigh_ht_params); | |
681 | } | |
682 | ||
683 | int mlxsw_sp_router_neigh_construct(struct net_device *dev, | |
684 | struct neighbour *n) | |
685 | { | |
686 | struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev); | |
687 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
688 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
689 | struct mlxsw_sp_rif *r; | |
6cf3c971 JP |
690 | int err; |
691 | ||
692 | if (n->tbl != &arp_tbl) | |
693 | return 0; | |
694 | ||
33b1341c JP |
695 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n); |
696 | if (neigh_entry) | |
6cf3c971 | 697 | return 0; |
6cf3c971 | 698 | |
51af96b5 | 699 | r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, n->dev); |
6cf3c971 JP |
700 | if (WARN_ON(!r)) |
701 | return -EINVAL; | |
702 | ||
33b1341c | 703 | neigh_entry = mlxsw_sp_neigh_entry_create(n, r->rif); |
6cf3c971 JP |
704 | if (!neigh_entry) |
705 | return -ENOMEM; | |
706 | err = mlxsw_sp_neigh_entry_insert(mlxsw_sp, neigh_entry); | |
707 | if (err) | |
708 | goto err_neigh_entry_insert; | |
709 | return 0; | |
710 | ||
711 | err_neigh_entry_insert: | |
712 | mlxsw_sp_neigh_entry_destroy(neigh_entry); | |
713 | return err; | |
714 | } | |
715 | ||
716 | void mlxsw_sp_router_neigh_destroy(struct net_device *dev, | |
717 | struct neighbour *n) | |
718 | { | |
719 | struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev); | |
720 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
721 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
6cf3c971 JP |
722 | |
723 | if (n->tbl != &arp_tbl) | |
724 | return; | |
725 | ||
33b1341c | 726 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n); |
6cf3c971 JP |
727 | if (!neigh_entry) |
728 | return; | |
729 | mlxsw_sp_neigh_entry_remove(mlxsw_sp, neigh_entry); | |
730 | mlxsw_sp_neigh_entry_destroy(neigh_entry); | |
731 | } | |
732 | ||
c723c735 YG |
733 | static void |
734 | mlxsw_sp_router_neighs_update_interval_init(struct mlxsw_sp *mlxsw_sp) | |
735 | { | |
736 | unsigned long interval = NEIGH_VAR(&arp_tbl.parms, DELAY_PROBE_TIME); | |
737 | ||
738 | mlxsw_sp->router.neighs_update.interval = jiffies_to_msecs(interval); | |
739 | } | |
740 | ||
741 | static void mlxsw_sp_router_neigh_ent_ipv4_process(struct mlxsw_sp *mlxsw_sp, | |
742 | char *rauhtd_pl, | |
743 | int ent_index) | |
744 | { | |
745 | struct net_device *dev; | |
746 | struct neighbour *n; | |
747 | __be32 dipn; | |
748 | u32 dip; | |
749 | u16 rif; | |
750 | ||
751 | mlxsw_reg_rauhtd_ent_ipv4_unpack(rauhtd_pl, ent_index, &rif, &dip); | |
752 | ||
753 | if (!mlxsw_sp->rifs[rif]) { | |
754 | dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Incorrect RIF in neighbour entry\n"); | |
755 | return; | |
756 | } | |
757 | ||
758 | dipn = htonl(dip); | |
759 | dev = mlxsw_sp->rifs[rif]->dev; | |
760 | n = neigh_lookup(&arp_tbl, &dipn, dev); | |
761 | if (!n) { | |
762 | netdev_err(dev, "Failed to find matching neighbour for IP=%pI4h\n", | |
763 | &dip); | |
764 | return; | |
765 | } | |
766 | ||
767 | netdev_dbg(dev, "Updating neighbour with IP=%pI4h\n", &dip); | |
768 | neigh_event_send(n, NULL); | |
769 | neigh_release(n); | |
770 | } | |
771 | ||
772 | static void mlxsw_sp_router_neigh_rec_ipv4_process(struct mlxsw_sp *mlxsw_sp, | |
773 | char *rauhtd_pl, | |
774 | int rec_index) | |
775 | { | |
776 | u8 num_entries; | |
777 | int i; | |
778 | ||
779 | num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl, | |
780 | rec_index); | |
781 | /* Hardware starts counting at 0, so add 1. */ | |
782 | num_entries++; | |
783 | ||
784 | /* Each record consists of several neighbour entries. */ | |
785 | for (i = 0; i < num_entries; i++) { | |
786 | int ent_index; | |
787 | ||
788 | ent_index = rec_index * MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC + i; | |
789 | mlxsw_sp_router_neigh_ent_ipv4_process(mlxsw_sp, rauhtd_pl, | |
790 | ent_index); | |
791 | } | |
792 | ||
793 | } | |
794 | ||
795 | static void mlxsw_sp_router_neigh_rec_process(struct mlxsw_sp *mlxsw_sp, | |
796 | char *rauhtd_pl, int rec_index) | |
797 | { | |
798 | switch (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, rec_index)) { | |
799 | case MLXSW_REG_RAUHTD_TYPE_IPV4: | |
800 | mlxsw_sp_router_neigh_rec_ipv4_process(mlxsw_sp, rauhtd_pl, | |
801 | rec_index); | |
802 | break; | |
803 | case MLXSW_REG_RAUHTD_TYPE_IPV6: | |
804 | WARN_ON_ONCE(1); | |
805 | break; | |
806 | } | |
807 | } | |
808 | ||
42cdb338 AS |
809 | static bool mlxsw_sp_router_rauhtd_is_full(char *rauhtd_pl) |
810 | { | |
811 | u8 num_rec, last_rec_index, num_entries; | |
812 | ||
813 | num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl); | |
814 | last_rec_index = num_rec - 1; | |
815 | ||
816 | if (num_rec < MLXSW_REG_RAUHTD_REC_MAX_NUM) | |
817 | return false; | |
818 | if (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, last_rec_index) == | |
819 | MLXSW_REG_RAUHTD_TYPE_IPV6) | |
820 | return true; | |
821 | ||
822 | num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl, | |
823 | last_rec_index); | |
824 | if (++num_entries == MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC) | |
825 | return true; | |
826 | return false; | |
827 | } | |
828 | ||
b2157149 | 829 | static int mlxsw_sp_router_neighs_update_rauhtd(struct mlxsw_sp *mlxsw_sp) |
c723c735 | 830 | { |
c723c735 YG |
831 | char *rauhtd_pl; |
832 | u8 num_rec; | |
833 | int i, err; | |
834 | ||
835 | rauhtd_pl = kmalloc(MLXSW_REG_RAUHTD_LEN, GFP_KERNEL); | |
836 | if (!rauhtd_pl) | |
b2157149 | 837 | return -ENOMEM; |
c723c735 YG |
838 | |
839 | /* Make sure the neighbour's netdev isn't removed in the | |
840 | * process. | |
841 | */ | |
842 | rtnl_lock(); | |
843 | do { | |
844 | mlxsw_reg_rauhtd_pack(rauhtd_pl, MLXSW_REG_RAUHTD_TYPE_IPV4); | |
845 | err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(rauhtd), | |
846 | rauhtd_pl); | |
847 | if (err) { | |
848 | dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Failed to dump neighbour talbe\n"); | |
849 | break; | |
850 | } | |
851 | num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl); | |
852 | for (i = 0; i < num_rec; i++) | |
853 | mlxsw_sp_router_neigh_rec_process(mlxsw_sp, rauhtd_pl, | |
854 | i); | |
42cdb338 | 855 | } while (mlxsw_sp_router_rauhtd_is_full(rauhtd_pl)); |
c723c735 YG |
856 | rtnl_unlock(); |
857 | ||
858 | kfree(rauhtd_pl); | |
b2157149 YG |
859 | return err; |
860 | } | |
861 | ||
862 | static void mlxsw_sp_router_neighs_update_nh(struct mlxsw_sp *mlxsw_sp) | |
863 | { | |
864 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
865 | ||
866 | /* Take RTNL mutex here to prevent lists from changes */ | |
867 | rtnl_lock(); | |
868 | list_for_each_entry(neigh_entry, &mlxsw_sp->router.nexthop_neighs_list, | |
869 | nexthop_neighs_list_node) { | |
870 | /* If this neigh have nexthops, make the kernel think this neigh | |
871 | * is active regardless of the traffic. | |
872 | */ | |
873 | if (!list_empty(&neigh_entry->nexthop_list)) | |
33b1341c | 874 | neigh_event_send(neigh_entry->key.n, NULL); |
b2157149 YG |
875 | } |
876 | rtnl_unlock(); | |
877 | } | |
878 | ||
879 | static void | |
880 | mlxsw_sp_router_neighs_update_work_schedule(struct mlxsw_sp *mlxsw_sp) | |
881 | { | |
882 | unsigned long interval = mlxsw_sp->router.neighs_update.interval; | |
883 | ||
884 | mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw, | |
885 | msecs_to_jiffies(interval)); | |
886 | } | |
887 | ||
888 | static void mlxsw_sp_router_neighs_update_work(struct work_struct *work) | |
889 | { | |
890 | struct mlxsw_sp *mlxsw_sp = container_of(work, struct mlxsw_sp, | |
891 | router.neighs_update.dw.work); | |
892 | int err; | |
893 | ||
894 | err = mlxsw_sp_router_neighs_update_rauhtd(mlxsw_sp); | |
895 | if (err) | |
896 | dev_err(mlxsw_sp->bus_info->dev, "Could not update kernel for neigh activity"); | |
897 | ||
898 | mlxsw_sp_router_neighs_update_nh(mlxsw_sp); | |
899 | ||
c723c735 YG |
900 | mlxsw_sp_router_neighs_update_work_schedule(mlxsw_sp); |
901 | } | |
902 | ||
0b2361d9 YG |
903 | static void mlxsw_sp_router_probe_unresolved_nexthops(struct work_struct *work) |
904 | { | |
905 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
906 | struct mlxsw_sp *mlxsw_sp = container_of(work, struct mlxsw_sp, | |
907 | router.nexthop_probe_dw.work); | |
908 | ||
909 | /* Iterate over nexthop neighbours, find those who are unresolved and | |
910 | * send arp on them. This solves the chicken-egg problem when | |
911 | * the nexthop wouldn't get offloaded until the neighbor is resolved | |
912 | * but it wouldn't get resolved ever in case traffic is flowing in HW | |
913 | * using different nexthop. | |
914 | * | |
915 | * Take RTNL mutex here to prevent lists from changes. | |
916 | */ | |
917 | rtnl_lock(); | |
918 | list_for_each_entry(neigh_entry, &mlxsw_sp->router.nexthop_neighs_list, | |
919 | nexthop_neighs_list_node) { | |
33b1341c | 920 | if (!(neigh_entry->key.n->nud_state & NUD_VALID) && |
0b2361d9 | 921 | !list_empty(&neigh_entry->nexthop_list)) |
33b1341c | 922 | neigh_event_send(neigh_entry->key.n, NULL); |
0b2361d9 YG |
923 | } |
924 | rtnl_unlock(); | |
925 | ||
926 | mlxsw_core_schedule_dw(&mlxsw_sp->router.nexthop_probe_dw, | |
927 | MLXSW_SP_UNRESOLVED_NH_PROBE_INTERVAL); | |
928 | } | |
929 | ||
a7ff87ac JP |
930 | static void |
931 | mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp, | |
932 | struct mlxsw_sp_neigh_entry *neigh_entry, | |
933 | bool removing); | |
934 | ||
a6bf9e93 YG |
935 | static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work) |
936 | { | |
937 | struct mlxsw_sp_neigh_entry *neigh_entry = | |
938 | container_of(work, struct mlxsw_sp_neigh_entry, dw.work); | |
33b1341c | 939 | struct neighbour *n = neigh_entry->key.n; |
a6bf9e93 YG |
940 | struct mlxsw_sp_port *mlxsw_sp_port = neigh_entry->mlxsw_sp_port; |
941 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
942 | char rauht_pl[MLXSW_REG_RAUHT_LEN]; | |
943 | struct net_device *dev; | |
944 | bool entry_connected; | |
93a87e5e | 945 | u8 nud_state, dead; |
a6bf9e93 YG |
946 | bool updating; |
947 | bool removing; | |
948 | bool adding; | |
949 | u32 dip; | |
950 | int err; | |
951 | ||
952 | read_lock_bh(&n->lock); | |
953 | dip = ntohl(*((__be32 *) n->primary_key)); | |
954 | memcpy(neigh_entry->ha, n->ha, sizeof(neigh_entry->ha)); | |
955 | nud_state = n->nud_state; | |
93a87e5e | 956 | dead = n->dead; |
a6bf9e93 YG |
957 | dev = n->dev; |
958 | read_unlock_bh(&n->lock); | |
959 | ||
93a87e5e | 960 | entry_connected = nud_state & NUD_VALID && !dead; |
a6bf9e93 YG |
961 | adding = (!neigh_entry->offloaded) && entry_connected; |
962 | updating = neigh_entry->offloaded && entry_connected; | |
963 | removing = neigh_entry->offloaded && !entry_connected; | |
964 | ||
965 | if (adding || updating) { | |
966 | mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_ADD, | |
967 | neigh_entry->rif, | |
968 | neigh_entry->ha, dip); | |
969 | err = mlxsw_reg_write(mlxsw_sp->core, | |
970 | MLXSW_REG(rauht), rauht_pl); | |
971 | if (err) { | |
972 | netdev_err(dev, "Could not add neigh %pI4h\n", &dip); | |
973 | neigh_entry->offloaded = false; | |
974 | } else { | |
975 | neigh_entry->offloaded = true; | |
976 | } | |
a7ff87ac | 977 | mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, false); |
a6bf9e93 YG |
978 | } else if (removing) { |
979 | mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_DELETE, | |
980 | neigh_entry->rif, | |
981 | neigh_entry->ha, dip); | |
982 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rauht), | |
983 | rauht_pl); | |
984 | if (err) { | |
985 | netdev_err(dev, "Could not delete neigh %pI4h\n", &dip); | |
986 | neigh_entry->offloaded = true; | |
987 | } else { | |
988 | neigh_entry->offloaded = false; | |
989 | } | |
a7ff87ac | 990 | mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, true); |
a6bf9e93 YG |
991 | } |
992 | ||
993 | neigh_release(n); | |
994 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
995 | } | |
996 | ||
e7322638 JP |
997 | int mlxsw_sp_router_netevent_event(struct notifier_block *unused, |
998 | unsigned long event, void *ptr) | |
c723c735 | 999 | { |
a6bf9e93 | 1000 | struct mlxsw_sp_neigh_entry *neigh_entry; |
c723c735 YG |
1001 | struct mlxsw_sp_port *mlxsw_sp_port; |
1002 | struct mlxsw_sp *mlxsw_sp; | |
1003 | unsigned long interval; | |
a6bf9e93 | 1004 | struct net_device *dev; |
c723c735 | 1005 | struct neigh_parms *p; |
a6bf9e93 YG |
1006 | struct neighbour *n; |
1007 | u32 dip; | |
c723c735 YG |
1008 | |
1009 | switch (event) { | |
1010 | case NETEVENT_DELAY_PROBE_TIME_UPDATE: | |
1011 | p = ptr; | |
1012 | ||
1013 | /* We don't care about changes in the default table. */ | |
1014 | if (!p->dev || p->tbl != &arp_tbl) | |
1015 | return NOTIFY_DONE; | |
1016 | ||
1017 | /* We are in atomic context and can't take RTNL mutex, | |
1018 | * so use RCU variant to walk the device chain. | |
1019 | */ | |
1020 | mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(p->dev); | |
1021 | if (!mlxsw_sp_port) | |
1022 | return NOTIFY_DONE; | |
1023 | ||
1024 | mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
1025 | interval = jiffies_to_msecs(NEIGH_VAR(p, DELAY_PROBE_TIME)); | |
1026 | mlxsw_sp->router.neighs_update.interval = interval; | |
1027 | ||
1028 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
1029 | break; | |
a6bf9e93 YG |
1030 | case NETEVENT_NEIGH_UPDATE: |
1031 | n = ptr; | |
1032 | dev = n->dev; | |
1033 | ||
1034 | if (n->tbl != &arp_tbl) | |
1035 | return NOTIFY_DONE; | |
1036 | ||
1037 | mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(dev); | |
1038 | if (!mlxsw_sp_port) | |
1039 | return NOTIFY_DONE; | |
1040 | ||
1041 | mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
1042 | dip = ntohl(*((__be32 *) n->primary_key)); | |
33b1341c JP |
1043 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n); |
1044 | if (WARN_ON(!neigh_entry)) { | |
a6bf9e93 YG |
1045 | mlxsw_sp_port_dev_put(mlxsw_sp_port); |
1046 | return NOTIFY_DONE; | |
1047 | } | |
1048 | neigh_entry->mlxsw_sp_port = mlxsw_sp_port; | |
1049 | ||
1050 | /* Take a reference to ensure the neighbour won't be | |
1051 | * destructed until we drop the reference in delayed | |
1052 | * work. | |
1053 | */ | |
1054 | neigh_clone(n); | |
1055 | if (!mlxsw_core_schedule_dw(&neigh_entry->dw, 0)) { | |
1056 | neigh_release(n); | |
1057 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
1058 | } | |
1059 | break; | |
c723c735 YG |
1060 | } |
1061 | ||
1062 | return NOTIFY_DONE; | |
1063 | } | |
1064 | ||
6cf3c971 JP |
1065 | static int mlxsw_sp_neigh_init(struct mlxsw_sp *mlxsw_sp) |
1066 | { | |
c723c735 YG |
1067 | int err; |
1068 | ||
1069 | err = rhashtable_init(&mlxsw_sp->router.neigh_ht, | |
1070 | &mlxsw_sp_neigh_ht_params); | |
1071 | if (err) | |
1072 | return err; | |
1073 | ||
1074 | /* Initialize the polling interval according to the default | |
1075 | * table. | |
1076 | */ | |
1077 | mlxsw_sp_router_neighs_update_interval_init(mlxsw_sp); | |
1078 | ||
0b2361d9 | 1079 | /* Create the delayed works for the activity_update */ |
c723c735 YG |
1080 | INIT_DELAYED_WORK(&mlxsw_sp->router.neighs_update.dw, |
1081 | mlxsw_sp_router_neighs_update_work); | |
0b2361d9 YG |
1082 | INIT_DELAYED_WORK(&mlxsw_sp->router.nexthop_probe_dw, |
1083 | mlxsw_sp_router_probe_unresolved_nexthops); | |
c723c735 | 1084 | mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw, 0); |
0b2361d9 | 1085 | mlxsw_core_schedule_dw(&mlxsw_sp->router.nexthop_probe_dw, 0); |
c723c735 | 1086 | return 0; |
6cf3c971 JP |
1087 | } |
1088 | ||
1089 | static void mlxsw_sp_neigh_fini(struct mlxsw_sp *mlxsw_sp) | |
1090 | { | |
c723c735 | 1091 | cancel_delayed_work_sync(&mlxsw_sp->router.neighs_update.dw); |
0b2361d9 | 1092 | cancel_delayed_work_sync(&mlxsw_sp->router.nexthop_probe_dw); |
6cf3c971 JP |
1093 | rhashtable_destroy(&mlxsw_sp->router.neigh_ht); |
1094 | } | |
1095 | ||
a7ff87ac JP |
1096 | struct mlxsw_sp_nexthop { |
1097 | struct list_head neigh_list_node; /* member of neigh entry list */ | |
1098 | struct mlxsw_sp_nexthop_group *nh_grp; /* pointer back to the group | |
1099 | * this belongs to | |
1100 | */ | |
1101 | u8 should_offload:1, /* set indicates this neigh is connected and | |
1102 | * should be put to KVD linear area of this group. | |
1103 | */ | |
1104 | offloaded:1, /* set in case the neigh is actually put into | |
1105 | * KVD linear area of this group. | |
1106 | */ | |
1107 | update:1; /* set indicates that MAC of this neigh should be | |
1108 | * updated in HW | |
1109 | */ | |
1110 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
1111 | }; | |
1112 | ||
1113 | struct mlxsw_sp_nexthop_group { | |
1114 | struct list_head list; /* node in mlxsw->router.nexthop_group_list */ | |
1115 | struct list_head fib_list; /* list of fib entries that use this group */ | |
1116 | u8 adj_index_valid:1; | |
1117 | u32 adj_index; | |
1118 | u16 ecmp_size; | |
1119 | u16 count; | |
1120 | struct mlxsw_sp_nexthop nexthops[0]; | |
1121 | }; | |
1122 | ||
1123 | static int mlxsw_sp_adj_index_mass_update_vr(struct mlxsw_sp *mlxsw_sp, | |
1124 | struct mlxsw_sp_vr *vr, | |
1125 | u32 adj_index, u16 ecmp_size, | |
1126 | u32 new_adj_index, | |
1127 | u16 new_ecmp_size) | |
1128 | { | |
1129 | char raleu_pl[MLXSW_REG_RALEU_LEN]; | |
1130 | ||
1a9234e6 IS |
1131 | mlxsw_reg_raleu_pack(raleu_pl, |
1132 | (enum mlxsw_reg_ralxx_protocol) vr->proto, vr->id, | |
1133 | adj_index, ecmp_size, new_adj_index, | |
1134 | new_ecmp_size); | |
a7ff87ac JP |
1135 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raleu), raleu_pl); |
1136 | } | |
1137 | ||
1138 | static int mlxsw_sp_adj_index_mass_update(struct mlxsw_sp *mlxsw_sp, | |
1139 | struct mlxsw_sp_nexthop_group *nh_grp, | |
1140 | u32 old_adj_index, u16 old_ecmp_size) | |
1141 | { | |
1142 | struct mlxsw_sp_fib_entry *fib_entry; | |
1143 | struct mlxsw_sp_vr *vr = NULL; | |
1144 | int err; | |
1145 | ||
1146 | list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) { | |
1147 | if (vr == fib_entry->vr) | |
1148 | continue; | |
1149 | vr = fib_entry->vr; | |
1150 | err = mlxsw_sp_adj_index_mass_update_vr(mlxsw_sp, vr, | |
1151 | old_adj_index, | |
1152 | old_ecmp_size, | |
1153 | nh_grp->adj_index, | |
1154 | nh_grp->ecmp_size); | |
1155 | if (err) | |
1156 | return err; | |
1157 | } | |
1158 | return 0; | |
1159 | } | |
1160 | ||
1161 | static int mlxsw_sp_nexthop_mac_update(struct mlxsw_sp *mlxsw_sp, u32 adj_index, | |
1162 | struct mlxsw_sp_nexthop *nh) | |
1163 | { | |
1164 | struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry; | |
1165 | char ratr_pl[MLXSW_REG_RATR_LEN]; | |
1166 | ||
1167 | mlxsw_reg_ratr_pack(ratr_pl, MLXSW_REG_RATR_OP_WRITE_WRITE_ENTRY, | |
1168 | true, adj_index, neigh_entry->rif); | |
1169 | mlxsw_reg_ratr_eth_entry_pack(ratr_pl, neigh_entry->ha); | |
1170 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ratr), ratr_pl); | |
1171 | } | |
1172 | ||
1173 | static int | |
1174 | mlxsw_sp_nexthop_group_mac_update(struct mlxsw_sp *mlxsw_sp, | |
1175 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1176 | { | |
1177 | u32 adj_index = nh_grp->adj_index; /* base */ | |
1178 | struct mlxsw_sp_nexthop *nh; | |
1179 | int i; | |
1180 | int err; | |
1181 | ||
1182 | for (i = 0; i < nh_grp->count; i++) { | |
1183 | nh = &nh_grp->nexthops[i]; | |
1184 | ||
1185 | if (!nh->should_offload) { | |
1186 | nh->offloaded = 0; | |
1187 | continue; | |
1188 | } | |
1189 | ||
1190 | if (nh->update) { | |
1191 | err = mlxsw_sp_nexthop_mac_update(mlxsw_sp, | |
1192 | adj_index, nh); | |
1193 | if (err) | |
1194 | return err; | |
1195 | nh->update = 0; | |
1196 | nh->offloaded = 1; | |
1197 | } | |
1198 | adj_index++; | |
1199 | } | |
1200 | return 0; | |
1201 | } | |
1202 | ||
1203 | static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp, | |
1204 | struct mlxsw_sp_fib_entry *fib_entry); | |
1205 | ||
1206 | static int | |
1207 | mlxsw_sp_nexthop_fib_entries_update(struct mlxsw_sp *mlxsw_sp, | |
1208 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1209 | { | |
1210 | struct mlxsw_sp_fib_entry *fib_entry; | |
1211 | int err; | |
1212 | ||
1213 | list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) { | |
1214 | err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry); | |
1215 | if (err) | |
1216 | return err; | |
1217 | } | |
1218 | return 0; | |
1219 | } | |
1220 | ||
1221 | static void | |
1222 | mlxsw_sp_nexthop_group_refresh(struct mlxsw_sp *mlxsw_sp, | |
1223 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1224 | { | |
1225 | struct mlxsw_sp_nexthop *nh; | |
1226 | bool offload_change = false; | |
1227 | u32 adj_index; | |
1228 | u16 ecmp_size = 0; | |
1229 | bool old_adj_index_valid; | |
1230 | u32 old_adj_index; | |
1231 | u16 old_ecmp_size; | |
1232 | int ret; | |
1233 | int i; | |
1234 | int err; | |
1235 | ||
1236 | for (i = 0; i < nh_grp->count; i++) { | |
1237 | nh = &nh_grp->nexthops[i]; | |
1238 | ||
1239 | if (nh->should_offload ^ nh->offloaded) { | |
1240 | offload_change = true; | |
1241 | if (nh->should_offload) | |
1242 | nh->update = 1; | |
1243 | } | |
1244 | if (nh->should_offload) | |
1245 | ecmp_size++; | |
1246 | } | |
1247 | if (!offload_change) { | |
1248 | /* Nothing was added or removed, so no need to reallocate. Just | |
1249 | * update MAC on existing adjacency indexes. | |
1250 | */ | |
1251 | err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp); | |
1252 | if (err) { | |
1253 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n"); | |
1254 | goto set_trap; | |
1255 | } | |
1256 | return; | |
1257 | } | |
1258 | if (!ecmp_size) | |
1259 | /* No neigh of this group is connected so we just set | |
1260 | * the trap and let everthing flow through kernel. | |
1261 | */ | |
1262 | goto set_trap; | |
1263 | ||
1264 | ret = mlxsw_sp_kvdl_alloc(mlxsw_sp, ecmp_size); | |
1265 | if (ret < 0) { | |
1266 | /* We ran out of KVD linear space, just set the | |
1267 | * trap and let everything flow through kernel. | |
1268 | */ | |
1269 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to allocate KVD linear area for nexthop group.\n"); | |
1270 | goto set_trap; | |
1271 | } | |
1272 | adj_index = ret; | |
1273 | old_adj_index_valid = nh_grp->adj_index_valid; | |
1274 | old_adj_index = nh_grp->adj_index; | |
1275 | old_ecmp_size = nh_grp->ecmp_size; | |
1276 | nh_grp->adj_index_valid = 1; | |
1277 | nh_grp->adj_index = adj_index; | |
1278 | nh_grp->ecmp_size = ecmp_size; | |
1279 | err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp); | |
1280 | if (err) { | |
1281 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n"); | |
1282 | goto set_trap; | |
1283 | } | |
1284 | ||
1285 | if (!old_adj_index_valid) { | |
1286 | /* The trap was set for fib entries, so we have to call | |
1287 | * fib entry update to unset it and use adjacency index. | |
1288 | */ | |
1289 | err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp); | |
1290 | if (err) { | |
1291 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to add adjacency index to fib entries.\n"); | |
1292 | goto set_trap; | |
1293 | } | |
1294 | return; | |
1295 | } | |
1296 | ||
1297 | err = mlxsw_sp_adj_index_mass_update(mlxsw_sp, nh_grp, | |
1298 | old_adj_index, old_ecmp_size); | |
1299 | mlxsw_sp_kvdl_free(mlxsw_sp, old_adj_index); | |
1300 | if (err) { | |
1301 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to mass-update adjacency index for nexthop group.\n"); | |
1302 | goto set_trap; | |
1303 | } | |
1304 | return; | |
1305 | ||
1306 | set_trap: | |
1307 | old_adj_index_valid = nh_grp->adj_index_valid; | |
1308 | nh_grp->adj_index_valid = 0; | |
1309 | for (i = 0; i < nh_grp->count; i++) { | |
1310 | nh = &nh_grp->nexthops[i]; | |
1311 | nh->offloaded = 0; | |
1312 | } | |
1313 | err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp); | |
1314 | if (err) | |
1315 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to set traps for fib entries.\n"); | |
1316 | if (old_adj_index_valid) | |
1317 | mlxsw_sp_kvdl_free(mlxsw_sp, nh_grp->adj_index); | |
1318 | } | |
1319 | ||
1320 | static void __mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp_nexthop *nh, | |
1321 | bool removing) | |
1322 | { | |
1323 | if (!removing && !nh->should_offload) | |
1324 | nh->should_offload = 1; | |
1325 | else if (removing && nh->offloaded) | |
1326 | nh->should_offload = 0; | |
1327 | nh->update = 1; | |
1328 | } | |
1329 | ||
1330 | static void | |
1331 | mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp, | |
1332 | struct mlxsw_sp_neigh_entry *neigh_entry, | |
1333 | bool removing) | |
1334 | { | |
1335 | struct mlxsw_sp_nexthop *nh; | |
1336 | ||
1337 | /* Take RTNL mutex here to prevent lists from changes */ | |
1338 | rtnl_lock(); | |
1339 | list_for_each_entry(nh, &neigh_entry->nexthop_list, | |
1340 | neigh_list_node) { | |
1341 | __mlxsw_sp_nexthop_neigh_update(nh, removing); | |
1342 | mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp); | |
1343 | } | |
1344 | rtnl_unlock(); | |
1345 | } | |
1346 | ||
1347 | static int mlxsw_sp_nexthop_init(struct mlxsw_sp *mlxsw_sp, | |
1348 | struct mlxsw_sp_nexthop_group *nh_grp, | |
1349 | struct mlxsw_sp_nexthop *nh, | |
1350 | struct fib_nh *fib_nh) | |
1351 | { | |
1352 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
a7ff87ac JP |
1353 | struct net_device *dev = fib_nh->nh_dev; |
1354 | struct neighbour *n; | |
93a87e5e | 1355 | u8 nud_state, dead; |
a7ff87ac | 1356 | |
33b1341c JP |
1357 | /* Take a reference of neigh here ensuring that neigh would |
1358 | * not be detructed before the nexthop entry is finished. | |
1359 | * The reference is taken either in neigh_lookup() or | |
1360 | * in neith_create() in case n is not found. | |
1361 | */ | |
1362 | n = neigh_lookup(&arp_tbl, &fib_nh->nh_gw, dev); | |
1363 | if (!n) { | |
1364 | n = neigh_create(&arp_tbl, &fib_nh->nh_gw, dev); | |
a7ff87ac JP |
1365 | if (IS_ERR(n)) |
1366 | return PTR_ERR(n); | |
1367 | neigh_event_send(n, NULL); | |
33b1341c JP |
1368 | } |
1369 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n); | |
1370 | if (!neigh_entry) { | |
1371 | neigh_release(n); | |
1372 | return -EINVAL; | |
a7ff87ac | 1373 | } |
b2157149 YG |
1374 | |
1375 | /* If that is the first nexthop connected to that neigh, add to | |
1376 | * nexthop_neighs_list | |
1377 | */ | |
1378 | if (list_empty(&neigh_entry->nexthop_list)) | |
1379 | list_add_tail(&neigh_entry->nexthop_neighs_list_node, | |
1380 | &mlxsw_sp->router.nexthop_neighs_list); | |
1381 | ||
a7ff87ac JP |
1382 | nh->nh_grp = nh_grp; |
1383 | nh->neigh_entry = neigh_entry; | |
1384 | list_add_tail(&nh->neigh_list_node, &neigh_entry->nexthop_list); | |
1385 | read_lock_bh(&n->lock); | |
1386 | nud_state = n->nud_state; | |
93a87e5e | 1387 | dead = n->dead; |
a7ff87ac | 1388 | read_unlock_bh(&n->lock); |
93a87e5e | 1389 | __mlxsw_sp_nexthop_neigh_update(nh, !(nud_state & NUD_VALID && !dead)); |
a7ff87ac JP |
1390 | |
1391 | return 0; | |
1392 | } | |
1393 | ||
1394 | static void mlxsw_sp_nexthop_fini(struct mlxsw_sp *mlxsw_sp, | |
1395 | struct mlxsw_sp_nexthop *nh) | |
1396 | { | |
1397 | struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry; | |
1398 | ||
1399 | list_del(&nh->neigh_list_node); | |
b2157149 YG |
1400 | |
1401 | /* If that is the last nexthop connected to that neigh, remove from | |
1402 | * nexthop_neighs_list | |
1403 | */ | |
1404 | if (list_empty(&nh->neigh_entry->nexthop_list)) | |
1405 | list_del(&nh->neigh_entry->nexthop_neighs_list_node); | |
1406 | ||
33b1341c | 1407 | neigh_release(neigh_entry->key.n); |
a7ff87ac JP |
1408 | } |
1409 | ||
1410 | static struct mlxsw_sp_nexthop_group * | |
1411 | mlxsw_sp_nexthop_group_create(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi) | |
1412 | { | |
1413 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1414 | struct mlxsw_sp_nexthop *nh; | |
1415 | struct fib_nh *fib_nh; | |
1416 | size_t alloc_size; | |
1417 | int i; | |
1418 | int err; | |
1419 | ||
1420 | alloc_size = sizeof(*nh_grp) + | |
1421 | fi->fib_nhs * sizeof(struct mlxsw_sp_nexthop); | |
1422 | nh_grp = kzalloc(alloc_size, GFP_KERNEL); | |
1423 | if (!nh_grp) | |
1424 | return ERR_PTR(-ENOMEM); | |
1425 | INIT_LIST_HEAD(&nh_grp->fib_list); | |
1426 | nh_grp->count = fi->fib_nhs; | |
1427 | for (i = 0; i < nh_grp->count; i++) { | |
1428 | nh = &nh_grp->nexthops[i]; | |
1429 | fib_nh = &fi->fib_nh[i]; | |
1430 | err = mlxsw_sp_nexthop_init(mlxsw_sp, nh_grp, nh, fib_nh); | |
1431 | if (err) | |
1432 | goto err_nexthop_init; | |
1433 | } | |
1434 | list_add_tail(&nh_grp->list, &mlxsw_sp->router.nexthop_group_list); | |
1435 | mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh_grp); | |
1436 | return nh_grp; | |
1437 | ||
1438 | err_nexthop_init: | |
1439 | for (i--; i >= 0; i--) | |
1440 | mlxsw_sp_nexthop_fini(mlxsw_sp, nh); | |
1441 | kfree(nh_grp); | |
1442 | return ERR_PTR(err); | |
1443 | } | |
1444 | ||
1445 | static void | |
1446 | mlxsw_sp_nexthop_group_destroy(struct mlxsw_sp *mlxsw_sp, | |
1447 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1448 | { | |
1449 | struct mlxsw_sp_nexthop *nh; | |
1450 | int i; | |
1451 | ||
1452 | list_del(&nh_grp->list); | |
1453 | for (i = 0; i < nh_grp->count; i++) { | |
1454 | nh = &nh_grp->nexthops[i]; | |
1455 | mlxsw_sp_nexthop_fini(mlxsw_sp, nh); | |
1456 | } | |
1457 | kfree(nh_grp); | |
1458 | } | |
1459 | ||
1460 | static bool mlxsw_sp_nexthop_match(struct mlxsw_sp_nexthop *nh, | |
1461 | struct fib_info *fi) | |
1462 | { | |
1463 | int i; | |
1464 | ||
1465 | for (i = 0; i < fi->fib_nhs; i++) { | |
1466 | struct fib_nh *fib_nh = &fi->fib_nh[i]; | |
33b1341c | 1467 | struct neighbour *n = nh->neigh_entry->key.n; |
a7ff87ac | 1468 | |
33b1341c JP |
1469 | if (memcmp(n->primary_key, &fib_nh->nh_gw, |
1470 | sizeof(fib_nh->nh_gw)) == 0 && | |
1471 | n->dev == fib_nh->nh_dev) | |
a7ff87ac JP |
1472 | return true; |
1473 | } | |
1474 | return false; | |
1475 | } | |
1476 | ||
1477 | static bool mlxsw_sp_nexthop_group_match(struct mlxsw_sp_nexthop_group *nh_grp, | |
1478 | struct fib_info *fi) | |
1479 | { | |
1480 | int i; | |
1481 | ||
1482 | if (nh_grp->count != fi->fib_nhs) | |
1483 | return false; | |
1484 | for (i = 0; i < nh_grp->count; i++) { | |
1485 | struct mlxsw_sp_nexthop *nh = &nh_grp->nexthops[i]; | |
1486 | ||
1487 | if (!mlxsw_sp_nexthop_match(nh, fi)) | |
1488 | return false; | |
1489 | } | |
1490 | return true; | |
1491 | } | |
1492 | ||
1493 | static struct mlxsw_sp_nexthop_group * | |
1494 | mlxsw_sp_nexthop_group_find(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi) | |
1495 | { | |
1496 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1497 | ||
1498 | list_for_each_entry(nh_grp, &mlxsw_sp->router.nexthop_group_list, | |
1499 | list) { | |
1500 | if (mlxsw_sp_nexthop_group_match(nh_grp, fi)) | |
1501 | return nh_grp; | |
1502 | } | |
1503 | return NULL; | |
1504 | } | |
1505 | ||
1506 | static int mlxsw_sp_nexthop_group_get(struct mlxsw_sp *mlxsw_sp, | |
1507 | struct mlxsw_sp_fib_entry *fib_entry, | |
1508 | struct fib_info *fi) | |
1509 | { | |
1510 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1511 | ||
1512 | nh_grp = mlxsw_sp_nexthop_group_find(mlxsw_sp, fi); | |
1513 | if (!nh_grp) { | |
1514 | nh_grp = mlxsw_sp_nexthop_group_create(mlxsw_sp, fi); | |
1515 | if (IS_ERR(nh_grp)) | |
1516 | return PTR_ERR(nh_grp); | |
1517 | } | |
1518 | list_add_tail(&fib_entry->nexthop_group_node, &nh_grp->fib_list); | |
1519 | fib_entry->nh_group = nh_grp; | |
1520 | return 0; | |
1521 | } | |
1522 | ||
1523 | static void mlxsw_sp_nexthop_group_put(struct mlxsw_sp *mlxsw_sp, | |
1524 | struct mlxsw_sp_fib_entry *fib_entry) | |
1525 | { | |
1526 | struct mlxsw_sp_nexthop_group *nh_grp = fib_entry->nh_group; | |
1527 | ||
1528 | list_del(&fib_entry->nexthop_group_node); | |
1529 | if (!list_empty(&nh_grp->fib_list)) | |
1530 | return; | |
1531 | mlxsw_sp_nexthop_group_destroy(mlxsw_sp, nh_grp); | |
1532 | } | |
1533 | ||
a7ff87ac JP |
1534 | static int mlxsw_sp_fib_entry_op4_remote(struct mlxsw_sp *mlxsw_sp, |
1535 | struct mlxsw_sp_fib_entry *fib_entry, | |
1536 | enum mlxsw_reg_ralue_op op) | |
1537 | { | |
1538 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1539 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1540 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1541 | enum mlxsw_reg_ralue_trap_action trap_action; | |
1542 | u16 trap_id = 0; | |
1543 | u32 adjacency_index = 0; | |
1544 | u16 ecmp_size = 0; | |
1545 | ||
1546 | /* In case the nexthop group adjacency index is valid, use it | |
1547 | * with provided ECMP size. Otherwise, setup trap and pass | |
1548 | * traffic to kernel. | |
1549 | */ | |
1550 | if (fib_entry->nh_group->adj_index_valid) { | |
1551 | trap_action = MLXSW_REG_RALUE_TRAP_ACTION_NOP; | |
1552 | adjacency_index = fib_entry->nh_group->adj_index; | |
1553 | ecmp_size = fib_entry->nh_group->ecmp_size; | |
1554 | } else { | |
1555 | trap_action = MLXSW_REG_RALUE_TRAP_ACTION_TRAP; | |
1556 | trap_id = MLXSW_TRAP_ID_RTR_INGRESS0; | |
1557 | } | |
1558 | ||
1a9234e6 IS |
1559 | mlxsw_reg_ralue_pack4(ralue_pl, |
1560 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1561 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
a7ff87ac JP |
1562 | mlxsw_reg_ralue_act_remote_pack(ralue_pl, trap_action, trap_id, |
1563 | adjacency_index, ecmp_size); | |
1564 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1565 | } | |
1566 | ||
61c503f9 JP |
1567 | static int mlxsw_sp_fib_entry_op4_local(struct mlxsw_sp *mlxsw_sp, |
1568 | struct mlxsw_sp_fib_entry *fib_entry, | |
1569 | enum mlxsw_reg_ralue_op op) | |
1570 | { | |
1571 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1572 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1573 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1574 | ||
1a9234e6 IS |
1575 | mlxsw_reg_ralue_pack4(ralue_pl, |
1576 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1577 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
61c503f9 JP |
1578 | mlxsw_reg_ralue_act_local_pack(ralue_pl, |
1579 | MLXSW_REG_RALUE_TRAP_ACTION_NOP, 0, | |
1580 | fib_entry->rif); | |
1581 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1582 | } | |
1583 | ||
1584 | static int mlxsw_sp_fib_entry_op4_trap(struct mlxsw_sp *mlxsw_sp, | |
1585 | struct mlxsw_sp_fib_entry *fib_entry, | |
1586 | enum mlxsw_reg_ralue_op op) | |
1587 | { | |
1588 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1589 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1590 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1591 | ||
1a9234e6 IS |
1592 | mlxsw_reg_ralue_pack4(ralue_pl, |
1593 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1594 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
61c503f9 JP |
1595 | mlxsw_reg_ralue_act_ip2me_pack(ralue_pl); |
1596 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1597 | } | |
1598 | ||
1599 | static int mlxsw_sp_fib_entry_op4(struct mlxsw_sp *mlxsw_sp, | |
1600 | struct mlxsw_sp_fib_entry *fib_entry, | |
1601 | enum mlxsw_reg_ralue_op op) | |
1602 | { | |
1603 | switch (fib_entry->type) { | |
1604 | case MLXSW_SP_FIB_ENTRY_TYPE_REMOTE: | |
a7ff87ac | 1605 | return mlxsw_sp_fib_entry_op4_remote(mlxsw_sp, fib_entry, op); |
61c503f9 JP |
1606 | case MLXSW_SP_FIB_ENTRY_TYPE_LOCAL: |
1607 | return mlxsw_sp_fib_entry_op4_local(mlxsw_sp, fib_entry, op); | |
1608 | case MLXSW_SP_FIB_ENTRY_TYPE_TRAP: | |
1609 | return mlxsw_sp_fib_entry_op4_trap(mlxsw_sp, fib_entry, op); | |
1610 | } | |
1611 | return -EINVAL; | |
1612 | } | |
1613 | ||
1614 | static int mlxsw_sp_fib_entry_op(struct mlxsw_sp *mlxsw_sp, | |
1615 | struct mlxsw_sp_fib_entry *fib_entry, | |
1616 | enum mlxsw_reg_ralue_op op) | |
1617 | { | |
1618 | switch (fib_entry->vr->proto) { | |
1619 | case MLXSW_SP_L3_PROTO_IPV4: | |
1620 | return mlxsw_sp_fib_entry_op4(mlxsw_sp, fib_entry, op); | |
1621 | case MLXSW_SP_L3_PROTO_IPV6: | |
1622 | return -EINVAL; | |
1623 | } | |
1624 | return -EINVAL; | |
1625 | } | |
1626 | ||
1627 | static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp, | |
1628 | struct mlxsw_sp_fib_entry *fib_entry) | |
1629 | { | |
7146da31 JP |
1630 | return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry, |
1631 | MLXSW_REG_RALUE_OP_WRITE_WRITE); | |
61c503f9 JP |
1632 | } |
1633 | ||
1634 | static int mlxsw_sp_fib_entry_del(struct mlxsw_sp *mlxsw_sp, | |
1635 | struct mlxsw_sp_fib_entry *fib_entry) | |
1636 | { | |
1637 | return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry, | |
1638 | MLXSW_REG_RALUE_OP_WRITE_DELETE); | |
1639 | } | |
1640 | ||
61c503f9 JP |
1641 | static int |
1642 | mlxsw_sp_router_fib4_entry_init(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1643 | const struct fib_entry_notifier_info *fen_info, |
61c503f9 JP |
1644 | struct mlxsw_sp_fib_entry *fib_entry) |
1645 | { | |
b45f64d1 | 1646 | struct fib_info *fi = fen_info->fi; |
ab580705 | 1647 | struct mlxsw_sp_rif *r = NULL; |
b45f64d1 JP |
1648 | int nhsel; |
1649 | int err; | |
61c503f9 | 1650 | |
b45f64d1 | 1651 | if (fen_info->type == RTN_LOCAL || fen_info->type == RTN_BROADCAST) { |
61c503f9 JP |
1652 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP; |
1653 | return 0; | |
1654 | } | |
b45f64d1 | 1655 | if (fen_info->type != RTN_UNICAST) |
61c503f9 JP |
1656 | return -EINVAL; |
1657 | ||
b45f64d1 JP |
1658 | for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) { |
1659 | const struct fib_nh *nh = &fi->fib_nh[nhsel]; | |
1660 | ||
1661 | if (!nh->nh_dev) | |
1662 | continue; | |
1663 | r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, nh->nh_dev); | |
1664 | if (!r) { | |
1665 | /* In case router interface is not found for | |
1666 | * at least one of the nexthops, that means | |
1667 | * the nexthop points to some device unrelated | |
1668 | * to us. Set trap and pass the packets for | |
1669 | * this prefix to kernel. | |
1670 | */ | |
ab580705 | 1671 | break; |
b45f64d1 JP |
1672 | } |
1673 | } | |
61c503f9 | 1674 | |
ab580705 AB |
1675 | if (!r) { |
1676 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP; | |
1677 | return 0; | |
1678 | } | |
1679 | ||
b45f64d1 | 1680 | if (fi->fib_scope != RT_SCOPE_UNIVERSE) { |
61c503f9 | 1681 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_LOCAL; |
61c503f9 | 1682 | fib_entry->rif = r->rif; |
b45f64d1 JP |
1683 | } else { |
1684 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_REMOTE; | |
1685 | err = mlxsw_sp_nexthop_group_get(mlxsw_sp, fib_entry, fi); | |
1686 | if (err) | |
1687 | return err; | |
61c503f9 | 1688 | } |
b45f64d1 JP |
1689 | fib_info_offload_inc(fen_info->fi); |
1690 | return 0; | |
a7ff87ac JP |
1691 | } |
1692 | ||
1693 | static void | |
1694 | mlxsw_sp_router_fib4_entry_fini(struct mlxsw_sp *mlxsw_sp, | |
1695 | struct mlxsw_sp_fib_entry *fib_entry) | |
1696 | { | |
b45f64d1 JP |
1697 | if (fib_entry->type != MLXSW_SP_FIB_ENTRY_TYPE_TRAP) |
1698 | fib_info_offload_dec(fib_entry->fi); | |
1699 | if (fib_entry->type == MLXSW_SP_FIB_ENTRY_TYPE_REMOTE) | |
1700 | mlxsw_sp_nexthop_group_put(mlxsw_sp, fib_entry); | |
61c503f9 JP |
1701 | } |
1702 | ||
5b004412 JP |
1703 | static struct mlxsw_sp_fib_entry * |
1704 | mlxsw_sp_fib_entry_get(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1705 | const struct fib_entry_notifier_info *fen_info) |
61c503f9 | 1706 | { |
61c503f9 | 1707 | struct mlxsw_sp_fib_entry *fib_entry; |
b45f64d1 | 1708 | struct fib_info *fi = fen_info->fi; |
61c503f9 JP |
1709 | struct mlxsw_sp_vr *vr; |
1710 | int err; | |
1711 | ||
b45f64d1 | 1712 | vr = mlxsw_sp_vr_get(mlxsw_sp, fen_info->dst_len, fen_info->tb_id, |
61c503f9 JP |
1713 | MLXSW_SP_L3_PROTO_IPV4); |
1714 | if (IS_ERR(vr)) | |
5b004412 | 1715 | return ERR_CAST(vr); |
61c503f9 | 1716 | |
b45f64d1 JP |
1717 | fib_entry = mlxsw_sp_fib_entry_lookup(vr->fib, &fen_info->dst, |
1718 | sizeof(fen_info->dst), | |
1719 | fen_info->dst_len, fi->fib_dev); | |
5b004412 JP |
1720 | if (fib_entry) { |
1721 | /* Already exists, just take a reference */ | |
1722 | fib_entry->ref_count++; | |
1723 | return fib_entry; | |
1724 | } | |
b45f64d1 JP |
1725 | fib_entry = mlxsw_sp_fib_entry_create(vr->fib, &fen_info->dst, |
1726 | sizeof(fen_info->dst), | |
1727 | fen_info->dst_len, fi->fib_dev); | |
61c503f9 JP |
1728 | if (!fib_entry) { |
1729 | err = -ENOMEM; | |
1730 | goto err_fib_entry_create; | |
1731 | } | |
1732 | fib_entry->vr = vr; | |
b45f64d1 | 1733 | fib_entry->fi = fi; |
5b004412 | 1734 | fib_entry->ref_count = 1; |
61c503f9 | 1735 | |
b45f64d1 | 1736 | err = mlxsw_sp_router_fib4_entry_init(mlxsw_sp, fen_info, fib_entry); |
61c503f9 JP |
1737 | if (err) |
1738 | goto err_fib4_entry_init; | |
1739 | ||
5b004412 JP |
1740 | return fib_entry; |
1741 | ||
1742 | err_fib4_entry_init: | |
1743 | mlxsw_sp_fib_entry_destroy(fib_entry); | |
1744 | err_fib_entry_create: | |
1745 | mlxsw_sp_vr_put(mlxsw_sp, vr); | |
1746 | ||
1747 | return ERR_PTR(err); | |
1748 | } | |
1749 | ||
1750 | static struct mlxsw_sp_fib_entry * | |
1751 | mlxsw_sp_fib_entry_find(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1752 | const struct fib_entry_notifier_info *fen_info) |
5b004412 JP |
1753 | { |
1754 | struct mlxsw_sp_vr *vr; | |
1755 | ||
b45f64d1 JP |
1756 | vr = mlxsw_sp_vr_find(mlxsw_sp, fen_info->tb_id, |
1757 | MLXSW_SP_L3_PROTO_IPV4); | |
5b004412 JP |
1758 | if (!vr) |
1759 | return NULL; | |
1760 | ||
b45f64d1 JP |
1761 | return mlxsw_sp_fib_entry_lookup(vr->fib, &fen_info->dst, |
1762 | sizeof(fen_info->dst), | |
1763 | fen_info->dst_len, | |
1764 | fen_info->fi->fib_dev); | |
5b004412 JP |
1765 | } |
1766 | ||
1a9234e6 IS |
1767 | static void mlxsw_sp_fib_entry_put(struct mlxsw_sp *mlxsw_sp, |
1768 | struct mlxsw_sp_fib_entry *fib_entry) | |
5b004412 JP |
1769 | { |
1770 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1771 | ||
1772 | if (--fib_entry->ref_count == 0) { | |
1773 | mlxsw_sp_router_fib4_entry_fini(mlxsw_sp, fib_entry); | |
1774 | mlxsw_sp_fib_entry_destroy(fib_entry); | |
1775 | } | |
1776 | mlxsw_sp_vr_put(mlxsw_sp, vr); | |
1777 | } | |
1778 | ||
b45f64d1 JP |
1779 | static void mlxsw_sp_fib_entry_put_all(struct mlxsw_sp *mlxsw_sp, |
1780 | struct mlxsw_sp_fib_entry *fib_entry) | |
5b004412 | 1781 | { |
b45f64d1 | 1782 | unsigned int last_ref_count; |
5b004412 | 1783 | |
b45f64d1 JP |
1784 | do { |
1785 | last_ref_count = fib_entry->ref_count; | |
1786 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); | |
1787 | } while (last_ref_count != 1); | |
61c503f9 JP |
1788 | } |
1789 | ||
b45f64d1 JP |
1790 | static int mlxsw_sp_router_fib4_add(struct mlxsw_sp *mlxsw_sp, |
1791 | struct fib_entry_notifier_info *fen_info) | |
61c503f9 | 1792 | { |
61c503f9 JP |
1793 | struct mlxsw_sp_fib_entry *fib_entry; |
1794 | struct mlxsw_sp_vr *vr; | |
1795 | int err; | |
1796 | ||
b45f64d1 JP |
1797 | if (mlxsw_sp->router.aborted) |
1798 | return 0; | |
1799 | ||
1800 | fib_entry = mlxsw_sp_fib_entry_get(mlxsw_sp, fen_info); | |
1801 | if (IS_ERR(fib_entry)) { | |
1802 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to get FIB4 entry being added.\n"); | |
1803 | return PTR_ERR(fib_entry); | |
1804 | } | |
61c503f9 | 1805 | |
5b004412 JP |
1806 | if (fib_entry->ref_count != 1) |
1807 | return 0; | |
1808 | ||
61c503f9 | 1809 | vr = fib_entry->vr; |
5b004412 | 1810 | err = mlxsw_sp_fib_entry_insert(vr->fib, fib_entry); |
b45f64d1 JP |
1811 | if (err) { |
1812 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to insert FIB4 entry being added.\n"); | |
61c503f9 | 1813 | goto err_fib_entry_insert; |
b45f64d1 JP |
1814 | } |
1815 | err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry); | |
61c503f9 JP |
1816 | if (err) |
1817 | goto err_fib_entry_add; | |
1818 | return 0; | |
1819 | ||
1820 | err_fib_entry_add: | |
1821 | mlxsw_sp_fib_entry_remove(vr->fib, fib_entry); | |
1822 | err_fib_entry_insert: | |
5b004412 | 1823 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); |
61c503f9 JP |
1824 | return err; |
1825 | } | |
1826 | ||
37956d78 JP |
1827 | static void mlxsw_sp_router_fib4_del(struct mlxsw_sp *mlxsw_sp, |
1828 | struct fib_entry_notifier_info *fen_info) | |
61c503f9 | 1829 | { |
61c503f9 | 1830 | struct mlxsw_sp_fib_entry *fib_entry; |
61c503f9 | 1831 | |
b45f64d1 | 1832 | if (mlxsw_sp->router.aborted) |
37956d78 | 1833 | return; |
b45f64d1 JP |
1834 | |
1835 | fib_entry = mlxsw_sp_fib_entry_find(mlxsw_sp, fen_info); | |
37956d78 JP |
1836 | if (!fib_entry) |
1837 | return; | |
5b004412 JP |
1838 | |
1839 | if (fib_entry->ref_count == 1) { | |
1840 | mlxsw_sp_fib_entry_del(mlxsw_sp, fib_entry); | |
1841 | mlxsw_sp_fib_entry_remove(fib_entry->vr->fib, fib_entry); | |
1842 | } | |
1843 | ||
1844 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); | |
61c503f9 | 1845 | } |
b45f64d1 JP |
1846 | |
1847 | static int mlxsw_sp_router_set_abort_trap(struct mlxsw_sp *mlxsw_sp) | |
1848 | { | |
1849 | char ralta_pl[MLXSW_REG_RALTA_LEN]; | |
1850 | char ralst_pl[MLXSW_REG_RALST_LEN]; | |
1851 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
1852 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1853 | int err; | |
1854 | ||
1855 | mlxsw_reg_ralta_pack(ralta_pl, true, MLXSW_REG_RALXX_PROTOCOL_IPV4, | |
1856 | MLXSW_SP_LPM_TREE_MIN); | |
1857 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl); | |
1858 | if (err) | |
1859 | return err; | |
1860 | ||
1861 | mlxsw_reg_ralst_pack(ralst_pl, 0xff, MLXSW_SP_LPM_TREE_MIN); | |
1862 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl); | |
1863 | if (err) | |
1864 | return err; | |
1865 | ||
19271c1a JP |
1866 | mlxsw_reg_raltb_pack(raltb_pl, 0, MLXSW_REG_RALXX_PROTOCOL_IPV4, |
1867 | MLXSW_SP_LPM_TREE_MIN); | |
b45f64d1 JP |
1868 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
1869 | if (err) | |
1870 | return err; | |
1871 | ||
1872 | mlxsw_reg_ralue_pack4(ralue_pl, MLXSW_SP_L3_PROTO_IPV4, | |
1873 | MLXSW_REG_RALUE_OP_WRITE_WRITE, 0, 0, 0); | |
1874 | mlxsw_reg_ralue_act_ip2me_pack(ralue_pl); | |
1875 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1876 | } | |
1877 | ||
ac571de9 | 1878 | static void mlxsw_sp_router_fib_flush(struct mlxsw_sp *mlxsw_sp) |
b45f64d1 | 1879 | { |
b45f64d1 JP |
1880 | struct mlxsw_sp_fib_entry *fib_entry; |
1881 | struct mlxsw_sp_fib_entry *tmp; | |
1882 | struct mlxsw_sp_vr *vr; | |
1883 | int i; | |
b45f64d1 | 1884 | |
c1a38311 | 1885 | for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) { |
b45f64d1 | 1886 | vr = &mlxsw_sp->router.vrs[i]; |
ac571de9 | 1887 | |
b45f64d1 JP |
1888 | if (!vr->used) |
1889 | continue; | |
1890 | ||
1891 | list_for_each_entry_safe(fib_entry, tmp, | |
1892 | &vr->fib->entry_list, list) { | |
1893 | bool do_break = &tmp->list == &vr->fib->entry_list; | |
1894 | ||
1895 | mlxsw_sp_fib_entry_del(mlxsw_sp, fib_entry); | |
1896 | mlxsw_sp_fib_entry_remove(fib_entry->vr->fib, | |
1897 | fib_entry); | |
1898 | mlxsw_sp_fib_entry_put_all(mlxsw_sp, fib_entry); | |
1899 | if (do_break) | |
1900 | break; | |
1901 | } | |
1902 | } | |
ac571de9 IS |
1903 | } |
1904 | ||
1905 | static void mlxsw_sp_router_fib4_abort(struct mlxsw_sp *mlxsw_sp) | |
1906 | { | |
1907 | int err; | |
1908 | ||
d331d303 IS |
1909 | if (mlxsw_sp->router.aborted) |
1910 | return; | |
1911 | dev_warn(mlxsw_sp->bus_info->dev, "FIB abort triggered. Note that FIB entries are no longer being offloaded to this device.\n"); | |
ac571de9 | 1912 | mlxsw_sp_router_fib_flush(mlxsw_sp); |
b45f64d1 JP |
1913 | mlxsw_sp->router.aborted = true; |
1914 | err = mlxsw_sp_router_set_abort_trap(mlxsw_sp); | |
1915 | if (err) | |
1916 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to set abort trap.\n"); | |
1917 | } | |
1918 | ||
1919 | static int __mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp) | |
1920 | { | |
b45f64d1 | 1921 | char rgcr_pl[MLXSW_REG_RGCR_LEN]; |
c1a38311 | 1922 | u64 max_rifs; |
b45f64d1 JP |
1923 | int err; |
1924 | ||
c1a38311 | 1925 | if (!MLXSW_CORE_RES_VALID(mlxsw_sp->core, MAX_RIFS)) |
b45f64d1 JP |
1926 | return -EIO; |
1927 | ||
c1a38311 JP |
1928 | max_rifs = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS); |
1929 | mlxsw_sp->rifs = kcalloc(max_rifs, sizeof(struct mlxsw_sp_rif *), | |
1930 | GFP_KERNEL); | |
b45f64d1 JP |
1931 | if (!mlxsw_sp->rifs) |
1932 | return -ENOMEM; | |
1933 | ||
1934 | mlxsw_reg_rgcr_pack(rgcr_pl, true); | |
c1a38311 | 1935 | mlxsw_reg_rgcr_max_router_interfaces_set(rgcr_pl, max_rifs); |
b45f64d1 JP |
1936 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl); |
1937 | if (err) | |
1938 | goto err_rgcr_fail; | |
1939 | ||
1940 | return 0; | |
1941 | ||
1942 | err_rgcr_fail: | |
1943 | kfree(mlxsw_sp->rifs); | |
1944 | return err; | |
1945 | } | |
1946 | ||
1947 | static void __mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp) | |
1948 | { | |
b45f64d1 JP |
1949 | char rgcr_pl[MLXSW_REG_RGCR_LEN]; |
1950 | int i; | |
1951 | ||
1952 | mlxsw_reg_rgcr_pack(rgcr_pl, false); | |
1953 | mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl); | |
1954 | ||
c1a38311 | 1955 | for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS); i++) |
b45f64d1 JP |
1956 | WARN_ON_ONCE(mlxsw_sp->rifs[i]); |
1957 | ||
1958 | kfree(mlxsw_sp->rifs); | |
1959 | } | |
1960 | ||
3057224e IS |
1961 | struct mlxsw_sp_fib_event_work { |
1962 | struct delayed_work dw; | |
1963 | struct fib_entry_notifier_info fen_info; | |
1964 | struct mlxsw_sp *mlxsw_sp; | |
1965 | unsigned long event; | |
1966 | }; | |
1967 | ||
1968 | static void mlxsw_sp_router_fib_event_work(struct work_struct *work) | |
b45f64d1 | 1969 | { |
3057224e IS |
1970 | struct mlxsw_sp_fib_event_work *fib_work = |
1971 | container_of(work, struct mlxsw_sp_fib_event_work, dw.work); | |
1972 | struct mlxsw_sp *mlxsw_sp = fib_work->mlxsw_sp; | |
b45f64d1 JP |
1973 | int err; |
1974 | ||
3057224e IS |
1975 | /* Protect internal structures from changes */ |
1976 | rtnl_lock(); | |
1977 | switch (fib_work->event) { | |
b45f64d1 | 1978 | case FIB_EVENT_ENTRY_ADD: |
3057224e | 1979 | err = mlxsw_sp_router_fib4_add(mlxsw_sp, &fib_work->fen_info); |
b45f64d1 JP |
1980 | if (err) |
1981 | mlxsw_sp_router_fib4_abort(mlxsw_sp); | |
3057224e | 1982 | fib_info_put(fib_work->fen_info.fi); |
b45f64d1 JP |
1983 | break; |
1984 | case FIB_EVENT_ENTRY_DEL: | |
3057224e IS |
1985 | mlxsw_sp_router_fib4_del(mlxsw_sp, &fib_work->fen_info); |
1986 | fib_info_put(fib_work->fen_info.fi); | |
b45f64d1 JP |
1987 | break; |
1988 | case FIB_EVENT_RULE_ADD: /* fall through */ | |
1989 | case FIB_EVENT_RULE_DEL: | |
1990 | mlxsw_sp_router_fib4_abort(mlxsw_sp); | |
1991 | break; | |
1992 | } | |
3057224e IS |
1993 | rtnl_unlock(); |
1994 | kfree(fib_work); | |
1995 | } | |
1996 | ||
1997 | /* Called with rcu_read_lock() */ | |
1998 | static int mlxsw_sp_router_fib_event(struct notifier_block *nb, | |
1999 | unsigned long event, void *ptr) | |
2000 | { | |
2001 | struct mlxsw_sp *mlxsw_sp = container_of(nb, struct mlxsw_sp, fib_nb); | |
2002 | struct mlxsw_sp_fib_event_work *fib_work; | |
2003 | struct fib_notifier_info *info = ptr; | |
2004 | ||
2005 | if (!net_eq(info->net, &init_net)) | |
2006 | return NOTIFY_DONE; | |
2007 | ||
2008 | fib_work = kzalloc(sizeof(*fib_work), GFP_ATOMIC); | |
2009 | if (WARN_ON(!fib_work)) | |
2010 | return NOTIFY_BAD; | |
2011 | ||
2012 | INIT_DELAYED_WORK(&fib_work->dw, mlxsw_sp_router_fib_event_work); | |
2013 | fib_work->mlxsw_sp = mlxsw_sp; | |
2014 | fib_work->event = event; | |
2015 | ||
2016 | switch (event) { | |
2017 | case FIB_EVENT_ENTRY_ADD: /* fall through */ | |
2018 | case FIB_EVENT_ENTRY_DEL: | |
2019 | memcpy(&fib_work->fen_info, ptr, sizeof(fib_work->fen_info)); | |
2020 | /* Take referece on fib_info to prevent it from being | |
2021 | * freed while work is queued. Release it afterwards. | |
2022 | */ | |
2023 | fib_info_hold(fib_work->fen_info.fi); | |
2024 | break; | |
2025 | } | |
2026 | ||
2027 | mlxsw_core_schedule_odw(&fib_work->dw, 0); | |
2028 | ||
b45f64d1 JP |
2029 | return NOTIFY_DONE; |
2030 | } | |
2031 | ||
c3852ef7 IS |
2032 | static void mlxsw_sp_router_fib_dump_flush(struct notifier_block *nb) |
2033 | { | |
2034 | struct mlxsw_sp *mlxsw_sp = container_of(nb, struct mlxsw_sp, fib_nb); | |
2035 | ||
2036 | /* Flush pending FIB notifications and then flush the device's | |
2037 | * table before requesting another dump. The FIB notification | |
2038 | * block is unregistered, so no need to take RTNL. | |
2039 | */ | |
2040 | mlxsw_core_flush_owq(); | |
2041 | mlxsw_sp_router_fib_flush(mlxsw_sp); | |
2042 | } | |
2043 | ||
b45f64d1 JP |
2044 | int mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp) |
2045 | { | |
2046 | int err; | |
2047 | ||
2048 | INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_neighs_list); | |
2049 | INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_group_list); | |
2050 | err = __mlxsw_sp_router_init(mlxsw_sp); | |
2051 | if (err) | |
2052 | return err; | |
2053 | ||
2054 | mlxsw_sp_lpm_init(mlxsw_sp); | |
2055 | err = mlxsw_sp_vrs_init(mlxsw_sp); | |
2056 | if (err) | |
2057 | goto err_vrs_init; | |
2058 | ||
8c9583a8 | 2059 | err = mlxsw_sp_neigh_init(mlxsw_sp); |
b45f64d1 JP |
2060 | if (err) |
2061 | goto err_neigh_init; | |
2062 | ||
2063 | mlxsw_sp->fib_nb.notifier_call = mlxsw_sp_router_fib_event; | |
c3852ef7 IS |
2064 | err = register_fib_notifier(&mlxsw_sp->fib_nb, |
2065 | mlxsw_sp_router_fib_dump_flush); | |
2066 | if (err) | |
2067 | goto err_register_fib_notifier; | |
2068 | ||
b45f64d1 JP |
2069 | return 0; |
2070 | ||
c3852ef7 IS |
2071 | err_register_fib_notifier: |
2072 | mlxsw_sp_neigh_fini(mlxsw_sp); | |
b45f64d1 JP |
2073 | err_neigh_init: |
2074 | mlxsw_sp_vrs_fini(mlxsw_sp); | |
2075 | err_vrs_init: | |
2076 | __mlxsw_sp_router_fini(mlxsw_sp); | |
2077 | return err; | |
2078 | } | |
2079 | ||
2080 | void mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp) | |
2081 | { | |
2082 | unregister_fib_notifier(&mlxsw_sp->fib_nb); | |
2083 | mlxsw_sp_neigh_fini(mlxsw_sp); | |
2084 | mlxsw_sp_vrs_fini(mlxsw_sp); | |
2085 | __mlxsw_sp_router_fini(mlxsw_sp); | |
2086 | } |