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