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]; | |
348 | if (lpm_tree->proto == proto && | |
349 | mlxsw_sp_prefix_usage_eq(&lpm_tree->prefix_usage, | |
350 | prefix_usage)) | |
351 | goto inc_ref_count; | |
352 | } | |
353 | lpm_tree = mlxsw_sp_lpm_tree_create(mlxsw_sp, prefix_usage, | |
354 | proto, one_reserved); | |
355 | if (IS_ERR(lpm_tree)) | |
356 | return lpm_tree; | |
357 | ||
358 | inc_ref_count: | |
359 | lpm_tree->ref_count++; | |
360 | return lpm_tree; | |
361 | } | |
362 | ||
363 | static int mlxsw_sp_lpm_tree_put(struct mlxsw_sp *mlxsw_sp, | |
364 | struct mlxsw_sp_lpm_tree *lpm_tree) | |
365 | { | |
366 | if (--lpm_tree->ref_count == 0) | |
367 | return mlxsw_sp_lpm_tree_destroy(mlxsw_sp, lpm_tree); | |
368 | return 0; | |
369 | } | |
370 | ||
371 | static void mlxsw_sp_lpm_init(struct mlxsw_sp *mlxsw_sp) | |
372 | { | |
373 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
374 | int i; | |
375 | ||
376 | for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) { | |
377 | lpm_tree = &mlxsw_sp->router.lpm_trees[i]; | |
378 | lpm_tree->id = i + MLXSW_SP_LPM_TREE_MIN; | |
379 | } | |
380 | } | |
381 | ||
6b75c480 JP |
382 | static struct mlxsw_sp_vr *mlxsw_sp_vr_find_unused(struct mlxsw_sp *mlxsw_sp) |
383 | { | |
9497c042 | 384 | struct mlxsw_resources *resources; |
6b75c480 JP |
385 | struct mlxsw_sp_vr *vr; |
386 | int i; | |
387 | ||
9497c042 NF |
388 | resources = mlxsw_core_resources_get(mlxsw_sp->core); |
389 | for (i = 0; i < resources->max_virtual_routers; i++) { | |
6b75c480 JP |
390 | vr = &mlxsw_sp->router.vrs[i]; |
391 | if (!vr->used) | |
392 | return vr; | |
393 | } | |
394 | return NULL; | |
395 | } | |
396 | ||
397 | static int mlxsw_sp_vr_lpm_tree_bind(struct mlxsw_sp *mlxsw_sp, | |
398 | struct mlxsw_sp_vr *vr) | |
399 | { | |
400 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
401 | ||
1a9234e6 IS |
402 | mlxsw_reg_raltb_pack(raltb_pl, vr->id, |
403 | (enum mlxsw_reg_ralxx_protocol) vr->proto, | |
404 | vr->lpm_tree->id); | |
6b75c480 JP |
405 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
406 | } | |
407 | ||
408 | static int mlxsw_sp_vr_lpm_tree_unbind(struct mlxsw_sp *mlxsw_sp, | |
409 | struct mlxsw_sp_vr *vr) | |
410 | { | |
411 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
412 | ||
413 | /* Bind to tree 0 which is default */ | |
1a9234e6 IS |
414 | mlxsw_reg_raltb_pack(raltb_pl, vr->id, |
415 | (enum mlxsw_reg_ralxx_protocol) vr->proto, 0); | |
6b75c480 JP |
416 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
417 | } | |
418 | ||
419 | static u32 mlxsw_sp_fix_tb_id(u32 tb_id) | |
420 | { | |
421 | /* For our purpose, squash main and local table into one */ | |
422 | if (tb_id == RT_TABLE_LOCAL) | |
423 | tb_id = RT_TABLE_MAIN; | |
424 | return tb_id; | |
425 | } | |
426 | ||
427 | static struct mlxsw_sp_vr *mlxsw_sp_vr_find(struct mlxsw_sp *mlxsw_sp, | |
428 | u32 tb_id, | |
429 | enum mlxsw_sp_l3proto proto) | |
430 | { | |
9497c042 | 431 | struct mlxsw_resources *resources; |
6b75c480 JP |
432 | struct mlxsw_sp_vr *vr; |
433 | int i; | |
434 | ||
435 | tb_id = mlxsw_sp_fix_tb_id(tb_id); | |
9497c042 NF |
436 | |
437 | resources = mlxsw_core_resources_get(mlxsw_sp->core); | |
438 | for (i = 0; i < resources->max_virtual_routers; i++) { | |
6b75c480 JP |
439 | vr = &mlxsw_sp->router.vrs[i]; |
440 | if (vr->used && vr->proto == proto && vr->tb_id == tb_id) | |
441 | return vr; | |
442 | } | |
443 | return NULL; | |
444 | } | |
445 | ||
446 | static struct mlxsw_sp_vr *mlxsw_sp_vr_create(struct mlxsw_sp *mlxsw_sp, | |
447 | unsigned char prefix_len, | |
448 | u32 tb_id, | |
449 | enum mlxsw_sp_l3proto proto) | |
450 | { | |
451 | struct mlxsw_sp_prefix_usage req_prefix_usage; | |
452 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
453 | struct mlxsw_sp_vr *vr; | |
454 | int err; | |
455 | ||
456 | vr = mlxsw_sp_vr_find_unused(mlxsw_sp); | |
457 | if (!vr) | |
458 | return ERR_PTR(-EBUSY); | |
459 | vr->fib = mlxsw_sp_fib_create(); | |
460 | if (IS_ERR(vr->fib)) | |
461 | return ERR_CAST(vr->fib); | |
462 | ||
463 | vr->proto = proto; | |
464 | vr->tb_id = tb_id; | |
465 | mlxsw_sp_prefix_usage_zero(&req_prefix_usage); | |
466 | mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len); | |
467 | lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, &req_prefix_usage, | |
468 | proto, true); | |
469 | if (IS_ERR(lpm_tree)) { | |
470 | err = PTR_ERR(lpm_tree); | |
471 | goto err_tree_get; | |
472 | } | |
473 | vr->lpm_tree = lpm_tree; | |
474 | err = mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr); | |
475 | if (err) | |
476 | goto err_tree_bind; | |
477 | ||
478 | vr->used = true; | |
479 | return vr; | |
480 | ||
481 | err_tree_bind: | |
482 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
483 | err_tree_get: | |
484 | mlxsw_sp_fib_destroy(vr->fib); | |
485 | ||
486 | return ERR_PTR(err); | |
487 | } | |
488 | ||
489 | static void mlxsw_sp_vr_destroy(struct mlxsw_sp *mlxsw_sp, | |
490 | struct mlxsw_sp_vr *vr) | |
491 | { | |
492 | mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr); | |
493 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
494 | mlxsw_sp_fib_destroy(vr->fib); | |
495 | vr->used = false; | |
496 | } | |
497 | ||
498 | static int | |
499 | mlxsw_sp_vr_lpm_tree_check(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr, | |
500 | struct mlxsw_sp_prefix_usage *req_prefix_usage) | |
501 | { | |
502 | struct mlxsw_sp_lpm_tree *lpm_tree; | |
503 | ||
504 | if (mlxsw_sp_prefix_usage_eq(req_prefix_usage, | |
505 | &vr->lpm_tree->prefix_usage)) | |
506 | return 0; | |
507 | ||
508 | lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, req_prefix_usage, | |
509 | vr->proto, false); | |
510 | if (IS_ERR(lpm_tree)) { | |
511 | /* We failed to get a tree according to the required | |
512 | * prefix usage. However, the current tree might be still good | |
513 | * for us if our requirement is subset of the prefixes used | |
514 | * in the tree. | |
515 | */ | |
516 | if (mlxsw_sp_prefix_usage_subset(req_prefix_usage, | |
517 | &vr->lpm_tree->prefix_usage)) | |
518 | return 0; | |
519 | return PTR_ERR(lpm_tree); | |
520 | } | |
521 | ||
522 | mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr); | |
523 | mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree); | |
524 | vr->lpm_tree = lpm_tree; | |
525 | return mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr); | |
526 | } | |
527 | ||
528 | static struct mlxsw_sp_vr *mlxsw_sp_vr_get(struct mlxsw_sp *mlxsw_sp, | |
529 | unsigned char prefix_len, | |
530 | u32 tb_id, | |
531 | enum mlxsw_sp_l3proto proto) | |
532 | { | |
533 | struct mlxsw_sp_vr *vr; | |
534 | int err; | |
535 | ||
536 | tb_id = mlxsw_sp_fix_tb_id(tb_id); | |
537 | vr = mlxsw_sp_vr_find(mlxsw_sp, tb_id, proto); | |
538 | if (!vr) { | |
539 | vr = mlxsw_sp_vr_create(mlxsw_sp, prefix_len, tb_id, proto); | |
540 | if (IS_ERR(vr)) | |
541 | return vr; | |
542 | } else { | |
543 | struct mlxsw_sp_prefix_usage req_prefix_usage; | |
544 | ||
545 | mlxsw_sp_prefix_usage_cpy(&req_prefix_usage, | |
546 | &vr->fib->prefix_usage); | |
547 | mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len); | |
548 | /* Need to replace LPM tree in case new prefix is required. */ | |
549 | err = mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr, | |
550 | &req_prefix_usage); | |
551 | if (err) | |
552 | return ERR_PTR(err); | |
553 | } | |
554 | return vr; | |
555 | } | |
556 | ||
557 | static void mlxsw_sp_vr_put(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr) | |
558 | { | |
559 | /* Destroy virtual router entity in case the associated FIB is empty | |
560 | * and allow it to be used for other tables in future. Otherwise, | |
561 | * check if some prefix usage did not disappear and change tree if | |
562 | * that is the case. Note that in case new, smaller tree cannot be | |
563 | * allocated, the original one will be kept being used. | |
564 | */ | |
565 | if (mlxsw_sp_prefix_usage_none(&vr->fib->prefix_usage)) | |
566 | mlxsw_sp_vr_destroy(mlxsw_sp, vr); | |
567 | else | |
568 | mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr, | |
569 | &vr->fib->prefix_usage); | |
570 | } | |
571 | ||
9497c042 | 572 | static int mlxsw_sp_vrs_init(struct mlxsw_sp *mlxsw_sp) |
6b75c480 | 573 | { |
9497c042 | 574 | struct mlxsw_resources *resources; |
6b75c480 JP |
575 | struct mlxsw_sp_vr *vr; |
576 | int i; | |
577 | ||
9497c042 NF |
578 | resources = mlxsw_core_resources_get(mlxsw_sp->core); |
579 | if (!resources->max_virtual_routers_valid) | |
580 | return -EIO; | |
581 | ||
582 | mlxsw_sp->router.vrs = kcalloc(resources->max_virtual_routers, | |
583 | sizeof(struct mlxsw_sp_vr), | |
584 | GFP_KERNEL); | |
585 | if (!mlxsw_sp->router.vrs) | |
586 | return -ENOMEM; | |
587 | ||
588 | for (i = 0; i < resources->max_virtual_routers; i++) { | |
6b75c480 JP |
589 | vr = &mlxsw_sp->router.vrs[i]; |
590 | vr->id = i; | |
591 | } | |
9497c042 NF |
592 | |
593 | return 0; | |
594 | } | |
595 | ||
596 | static void mlxsw_sp_vrs_fini(struct mlxsw_sp *mlxsw_sp) | |
597 | { | |
598 | kfree(mlxsw_sp->router.vrs); | |
6b75c480 JP |
599 | } |
600 | ||
6cf3c971 JP |
601 | struct mlxsw_sp_neigh_key { |
602 | unsigned char addr[sizeof(struct in6_addr)]; | |
603 | struct net_device *dev; | |
604 | }; | |
605 | ||
606 | struct mlxsw_sp_neigh_entry { | |
607 | struct rhash_head ht_node; | |
608 | struct mlxsw_sp_neigh_key key; | |
609 | u16 rif; | |
610 | struct neighbour *n; | |
a6bf9e93 YG |
611 | bool offloaded; |
612 | struct delayed_work dw; | |
613 | struct mlxsw_sp_port *mlxsw_sp_port; | |
614 | unsigned char ha[ETH_ALEN]; | |
a7ff87ac JP |
615 | struct list_head nexthop_list; /* list of nexthops using |
616 | * this neigh entry | |
617 | */ | |
b2157149 | 618 | struct list_head nexthop_neighs_list_node; |
6cf3c971 JP |
619 | }; |
620 | ||
621 | static const struct rhashtable_params mlxsw_sp_neigh_ht_params = { | |
622 | .key_offset = offsetof(struct mlxsw_sp_neigh_entry, key), | |
623 | .head_offset = offsetof(struct mlxsw_sp_neigh_entry, ht_node), | |
624 | .key_len = sizeof(struct mlxsw_sp_neigh_key), | |
625 | }; | |
626 | ||
627 | static int | |
628 | mlxsw_sp_neigh_entry_insert(struct mlxsw_sp *mlxsw_sp, | |
629 | struct mlxsw_sp_neigh_entry *neigh_entry) | |
630 | { | |
631 | return rhashtable_insert_fast(&mlxsw_sp->router.neigh_ht, | |
632 | &neigh_entry->ht_node, | |
633 | mlxsw_sp_neigh_ht_params); | |
634 | } | |
635 | ||
636 | static void | |
637 | mlxsw_sp_neigh_entry_remove(struct mlxsw_sp *mlxsw_sp, | |
638 | struct mlxsw_sp_neigh_entry *neigh_entry) | |
639 | { | |
640 | rhashtable_remove_fast(&mlxsw_sp->router.neigh_ht, | |
641 | &neigh_entry->ht_node, | |
642 | mlxsw_sp_neigh_ht_params); | |
643 | } | |
644 | ||
a6bf9e93 YG |
645 | static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work); |
646 | ||
6cf3c971 JP |
647 | static struct mlxsw_sp_neigh_entry * |
648 | mlxsw_sp_neigh_entry_create(const void *addr, size_t addr_len, | |
649 | struct net_device *dev, u16 rif, | |
650 | struct neighbour *n) | |
651 | { | |
652 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
653 | ||
654 | neigh_entry = kzalloc(sizeof(*neigh_entry), GFP_ATOMIC); | |
655 | if (!neigh_entry) | |
656 | return NULL; | |
657 | memcpy(neigh_entry->key.addr, addr, addr_len); | |
658 | neigh_entry->key.dev = dev; | |
659 | neigh_entry->rif = rif; | |
660 | neigh_entry->n = n; | |
a6bf9e93 | 661 | INIT_DELAYED_WORK(&neigh_entry->dw, mlxsw_sp_router_neigh_update_hw); |
a7ff87ac | 662 | INIT_LIST_HEAD(&neigh_entry->nexthop_list); |
6cf3c971 JP |
663 | return neigh_entry; |
664 | } | |
665 | ||
666 | static void | |
667 | mlxsw_sp_neigh_entry_destroy(struct mlxsw_sp_neigh_entry *neigh_entry) | |
668 | { | |
669 | kfree(neigh_entry); | |
670 | } | |
671 | ||
672 | static struct mlxsw_sp_neigh_entry * | |
673 | mlxsw_sp_neigh_entry_lookup(struct mlxsw_sp *mlxsw_sp, const void *addr, | |
674 | size_t addr_len, struct net_device *dev) | |
675 | { | |
676 | struct mlxsw_sp_neigh_key key = {{ 0 } }; | |
677 | ||
678 | memcpy(key.addr, addr, addr_len); | |
679 | key.dev = dev; | |
680 | return rhashtable_lookup_fast(&mlxsw_sp->router.neigh_ht, | |
681 | &key, mlxsw_sp_neigh_ht_params); | |
682 | } | |
683 | ||
684 | int mlxsw_sp_router_neigh_construct(struct net_device *dev, | |
685 | struct neighbour *n) | |
686 | { | |
687 | struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev); | |
688 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
689 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
690 | struct mlxsw_sp_rif *r; | |
691 | u32 dip; | |
692 | int err; | |
693 | ||
694 | if (n->tbl != &arp_tbl) | |
695 | return 0; | |
696 | ||
697 | dip = ntohl(*((__be32 *) n->primary_key)); | |
698 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &dip, sizeof(dip), | |
699 | n->dev); | |
700 | if (neigh_entry) { | |
701 | WARN_ON(neigh_entry->n != n); | |
702 | return 0; | |
703 | } | |
704 | ||
51af96b5 | 705 | r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, n->dev); |
6cf3c971 JP |
706 | if (WARN_ON(!r)) |
707 | return -EINVAL; | |
708 | ||
709 | neigh_entry = mlxsw_sp_neigh_entry_create(&dip, sizeof(dip), n->dev, | |
710 | r->rif, n); | |
711 | if (!neigh_entry) | |
712 | return -ENOMEM; | |
713 | err = mlxsw_sp_neigh_entry_insert(mlxsw_sp, neigh_entry); | |
714 | if (err) | |
715 | goto err_neigh_entry_insert; | |
716 | return 0; | |
717 | ||
718 | err_neigh_entry_insert: | |
719 | mlxsw_sp_neigh_entry_destroy(neigh_entry); | |
720 | return err; | |
721 | } | |
722 | ||
723 | void mlxsw_sp_router_neigh_destroy(struct net_device *dev, | |
724 | struct neighbour *n) | |
725 | { | |
726 | struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev); | |
727 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
728 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
729 | u32 dip; | |
730 | ||
731 | if (n->tbl != &arp_tbl) | |
732 | return; | |
733 | ||
734 | dip = ntohl(*((__be32 *) n->primary_key)); | |
735 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &dip, sizeof(dip), | |
736 | n->dev); | |
737 | if (!neigh_entry) | |
738 | return; | |
739 | mlxsw_sp_neigh_entry_remove(mlxsw_sp, neigh_entry); | |
740 | mlxsw_sp_neigh_entry_destroy(neigh_entry); | |
741 | } | |
742 | ||
c723c735 YG |
743 | static void |
744 | mlxsw_sp_router_neighs_update_interval_init(struct mlxsw_sp *mlxsw_sp) | |
745 | { | |
746 | unsigned long interval = NEIGH_VAR(&arp_tbl.parms, DELAY_PROBE_TIME); | |
747 | ||
748 | mlxsw_sp->router.neighs_update.interval = jiffies_to_msecs(interval); | |
749 | } | |
750 | ||
751 | static void mlxsw_sp_router_neigh_ent_ipv4_process(struct mlxsw_sp *mlxsw_sp, | |
752 | char *rauhtd_pl, | |
753 | int ent_index) | |
754 | { | |
755 | struct net_device *dev; | |
756 | struct neighbour *n; | |
757 | __be32 dipn; | |
758 | u32 dip; | |
759 | u16 rif; | |
760 | ||
761 | mlxsw_reg_rauhtd_ent_ipv4_unpack(rauhtd_pl, ent_index, &rif, &dip); | |
762 | ||
763 | if (!mlxsw_sp->rifs[rif]) { | |
764 | dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Incorrect RIF in neighbour entry\n"); | |
765 | return; | |
766 | } | |
767 | ||
768 | dipn = htonl(dip); | |
769 | dev = mlxsw_sp->rifs[rif]->dev; | |
770 | n = neigh_lookup(&arp_tbl, &dipn, dev); | |
771 | if (!n) { | |
772 | netdev_err(dev, "Failed to find matching neighbour for IP=%pI4h\n", | |
773 | &dip); | |
774 | return; | |
775 | } | |
776 | ||
777 | netdev_dbg(dev, "Updating neighbour with IP=%pI4h\n", &dip); | |
778 | neigh_event_send(n, NULL); | |
779 | neigh_release(n); | |
780 | } | |
781 | ||
782 | static void mlxsw_sp_router_neigh_rec_ipv4_process(struct mlxsw_sp *mlxsw_sp, | |
783 | char *rauhtd_pl, | |
784 | int rec_index) | |
785 | { | |
786 | u8 num_entries; | |
787 | int i; | |
788 | ||
789 | num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl, | |
790 | rec_index); | |
791 | /* Hardware starts counting at 0, so add 1. */ | |
792 | num_entries++; | |
793 | ||
794 | /* Each record consists of several neighbour entries. */ | |
795 | for (i = 0; i < num_entries; i++) { | |
796 | int ent_index; | |
797 | ||
798 | ent_index = rec_index * MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC + i; | |
799 | mlxsw_sp_router_neigh_ent_ipv4_process(mlxsw_sp, rauhtd_pl, | |
800 | ent_index); | |
801 | } | |
802 | ||
803 | } | |
804 | ||
805 | static void mlxsw_sp_router_neigh_rec_process(struct mlxsw_sp *mlxsw_sp, | |
806 | char *rauhtd_pl, int rec_index) | |
807 | { | |
808 | switch (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, rec_index)) { | |
809 | case MLXSW_REG_RAUHTD_TYPE_IPV4: | |
810 | mlxsw_sp_router_neigh_rec_ipv4_process(mlxsw_sp, rauhtd_pl, | |
811 | rec_index); | |
812 | break; | |
813 | case MLXSW_REG_RAUHTD_TYPE_IPV6: | |
814 | WARN_ON_ONCE(1); | |
815 | break; | |
816 | } | |
817 | } | |
818 | ||
b2157149 | 819 | static int mlxsw_sp_router_neighs_update_rauhtd(struct mlxsw_sp *mlxsw_sp) |
c723c735 | 820 | { |
c723c735 YG |
821 | char *rauhtd_pl; |
822 | u8 num_rec; | |
823 | int i, err; | |
824 | ||
825 | rauhtd_pl = kmalloc(MLXSW_REG_RAUHTD_LEN, GFP_KERNEL); | |
826 | if (!rauhtd_pl) | |
b2157149 | 827 | return -ENOMEM; |
c723c735 YG |
828 | |
829 | /* Make sure the neighbour's netdev isn't removed in the | |
830 | * process. | |
831 | */ | |
832 | rtnl_lock(); | |
833 | do { | |
834 | mlxsw_reg_rauhtd_pack(rauhtd_pl, MLXSW_REG_RAUHTD_TYPE_IPV4); | |
835 | err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(rauhtd), | |
836 | rauhtd_pl); | |
837 | if (err) { | |
838 | dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Failed to dump neighbour talbe\n"); | |
839 | break; | |
840 | } | |
841 | num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl); | |
842 | for (i = 0; i < num_rec; i++) | |
843 | mlxsw_sp_router_neigh_rec_process(mlxsw_sp, rauhtd_pl, | |
844 | i); | |
845 | } while (num_rec); | |
846 | rtnl_unlock(); | |
847 | ||
848 | kfree(rauhtd_pl); | |
b2157149 YG |
849 | return err; |
850 | } | |
851 | ||
852 | static void mlxsw_sp_router_neighs_update_nh(struct mlxsw_sp *mlxsw_sp) | |
853 | { | |
854 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
855 | ||
856 | /* Take RTNL mutex here to prevent lists from changes */ | |
857 | rtnl_lock(); | |
858 | list_for_each_entry(neigh_entry, &mlxsw_sp->router.nexthop_neighs_list, | |
859 | nexthop_neighs_list_node) { | |
860 | /* If this neigh have nexthops, make the kernel think this neigh | |
861 | * is active regardless of the traffic. | |
862 | */ | |
863 | if (!list_empty(&neigh_entry->nexthop_list)) | |
864 | neigh_event_send(neigh_entry->n, NULL); | |
865 | } | |
866 | rtnl_unlock(); | |
867 | } | |
868 | ||
869 | static void | |
870 | mlxsw_sp_router_neighs_update_work_schedule(struct mlxsw_sp *mlxsw_sp) | |
871 | { | |
872 | unsigned long interval = mlxsw_sp->router.neighs_update.interval; | |
873 | ||
874 | mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw, | |
875 | msecs_to_jiffies(interval)); | |
876 | } | |
877 | ||
878 | static void mlxsw_sp_router_neighs_update_work(struct work_struct *work) | |
879 | { | |
880 | struct mlxsw_sp *mlxsw_sp = container_of(work, struct mlxsw_sp, | |
881 | router.neighs_update.dw.work); | |
882 | int err; | |
883 | ||
884 | err = mlxsw_sp_router_neighs_update_rauhtd(mlxsw_sp); | |
885 | if (err) | |
886 | dev_err(mlxsw_sp->bus_info->dev, "Could not update kernel for neigh activity"); | |
887 | ||
888 | mlxsw_sp_router_neighs_update_nh(mlxsw_sp); | |
889 | ||
c723c735 YG |
890 | mlxsw_sp_router_neighs_update_work_schedule(mlxsw_sp); |
891 | } | |
892 | ||
0b2361d9 YG |
893 | static void mlxsw_sp_router_probe_unresolved_nexthops(struct work_struct *work) |
894 | { | |
895 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
896 | struct mlxsw_sp *mlxsw_sp = container_of(work, struct mlxsw_sp, | |
897 | router.nexthop_probe_dw.work); | |
898 | ||
899 | /* Iterate over nexthop neighbours, find those who are unresolved and | |
900 | * send arp on them. This solves the chicken-egg problem when | |
901 | * the nexthop wouldn't get offloaded until the neighbor is resolved | |
902 | * but it wouldn't get resolved ever in case traffic is flowing in HW | |
903 | * using different nexthop. | |
904 | * | |
905 | * Take RTNL mutex here to prevent lists from changes. | |
906 | */ | |
907 | rtnl_lock(); | |
908 | list_for_each_entry(neigh_entry, &mlxsw_sp->router.nexthop_neighs_list, | |
909 | nexthop_neighs_list_node) { | |
910 | if (!(neigh_entry->n->nud_state & NUD_VALID) && | |
911 | !list_empty(&neigh_entry->nexthop_list)) | |
912 | neigh_event_send(neigh_entry->n, NULL); | |
913 | } | |
914 | rtnl_unlock(); | |
915 | ||
916 | mlxsw_core_schedule_dw(&mlxsw_sp->router.nexthop_probe_dw, | |
917 | MLXSW_SP_UNRESOLVED_NH_PROBE_INTERVAL); | |
918 | } | |
919 | ||
a7ff87ac JP |
920 | static void |
921 | mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp, | |
922 | struct mlxsw_sp_neigh_entry *neigh_entry, | |
923 | bool removing); | |
924 | ||
a6bf9e93 YG |
925 | static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work) |
926 | { | |
927 | struct mlxsw_sp_neigh_entry *neigh_entry = | |
928 | container_of(work, struct mlxsw_sp_neigh_entry, dw.work); | |
929 | struct neighbour *n = neigh_entry->n; | |
930 | struct mlxsw_sp_port *mlxsw_sp_port = neigh_entry->mlxsw_sp_port; | |
931 | struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
932 | char rauht_pl[MLXSW_REG_RAUHT_LEN]; | |
933 | struct net_device *dev; | |
934 | bool entry_connected; | |
935 | u8 nud_state; | |
936 | bool updating; | |
937 | bool removing; | |
938 | bool adding; | |
939 | u32 dip; | |
940 | int err; | |
941 | ||
942 | read_lock_bh(&n->lock); | |
943 | dip = ntohl(*((__be32 *) n->primary_key)); | |
944 | memcpy(neigh_entry->ha, n->ha, sizeof(neigh_entry->ha)); | |
945 | nud_state = n->nud_state; | |
946 | dev = n->dev; | |
947 | read_unlock_bh(&n->lock); | |
948 | ||
949 | entry_connected = nud_state & NUD_VALID; | |
950 | adding = (!neigh_entry->offloaded) && entry_connected; | |
951 | updating = neigh_entry->offloaded && entry_connected; | |
952 | removing = neigh_entry->offloaded && !entry_connected; | |
953 | ||
954 | if (adding || updating) { | |
955 | mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_ADD, | |
956 | neigh_entry->rif, | |
957 | neigh_entry->ha, dip); | |
958 | err = mlxsw_reg_write(mlxsw_sp->core, | |
959 | MLXSW_REG(rauht), rauht_pl); | |
960 | if (err) { | |
961 | netdev_err(dev, "Could not add neigh %pI4h\n", &dip); | |
962 | neigh_entry->offloaded = false; | |
963 | } else { | |
964 | neigh_entry->offloaded = true; | |
965 | } | |
a7ff87ac | 966 | mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, false); |
a6bf9e93 YG |
967 | } else if (removing) { |
968 | mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_DELETE, | |
969 | neigh_entry->rif, | |
970 | neigh_entry->ha, dip); | |
971 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rauht), | |
972 | rauht_pl); | |
973 | if (err) { | |
974 | netdev_err(dev, "Could not delete neigh %pI4h\n", &dip); | |
975 | neigh_entry->offloaded = true; | |
976 | } else { | |
977 | neigh_entry->offloaded = false; | |
978 | } | |
a7ff87ac | 979 | mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, true); |
a6bf9e93 YG |
980 | } |
981 | ||
982 | neigh_release(n); | |
983 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
984 | } | |
985 | ||
e7322638 JP |
986 | int mlxsw_sp_router_netevent_event(struct notifier_block *unused, |
987 | unsigned long event, void *ptr) | |
c723c735 | 988 | { |
a6bf9e93 | 989 | struct mlxsw_sp_neigh_entry *neigh_entry; |
c723c735 YG |
990 | struct mlxsw_sp_port *mlxsw_sp_port; |
991 | struct mlxsw_sp *mlxsw_sp; | |
992 | unsigned long interval; | |
a6bf9e93 | 993 | struct net_device *dev; |
c723c735 | 994 | struct neigh_parms *p; |
a6bf9e93 YG |
995 | struct neighbour *n; |
996 | u32 dip; | |
c723c735 YG |
997 | |
998 | switch (event) { | |
999 | case NETEVENT_DELAY_PROBE_TIME_UPDATE: | |
1000 | p = ptr; | |
1001 | ||
1002 | /* We don't care about changes in the default table. */ | |
1003 | if (!p->dev || p->tbl != &arp_tbl) | |
1004 | return NOTIFY_DONE; | |
1005 | ||
1006 | /* We are in atomic context and can't take RTNL mutex, | |
1007 | * so use RCU variant to walk the device chain. | |
1008 | */ | |
1009 | mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(p->dev); | |
1010 | if (!mlxsw_sp_port) | |
1011 | return NOTIFY_DONE; | |
1012 | ||
1013 | mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
1014 | interval = jiffies_to_msecs(NEIGH_VAR(p, DELAY_PROBE_TIME)); | |
1015 | mlxsw_sp->router.neighs_update.interval = interval; | |
1016 | ||
1017 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
1018 | break; | |
a6bf9e93 YG |
1019 | case NETEVENT_NEIGH_UPDATE: |
1020 | n = ptr; | |
1021 | dev = n->dev; | |
1022 | ||
1023 | if (n->tbl != &arp_tbl) | |
1024 | return NOTIFY_DONE; | |
1025 | ||
1026 | mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(dev); | |
1027 | if (!mlxsw_sp_port) | |
1028 | return NOTIFY_DONE; | |
1029 | ||
1030 | mlxsw_sp = mlxsw_sp_port->mlxsw_sp; | |
1031 | dip = ntohl(*((__be32 *) n->primary_key)); | |
1032 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, | |
1033 | &dip, | |
1034 | sizeof(__be32), | |
1035 | dev); | |
1036 | if (WARN_ON(!neigh_entry) || WARN_ON(neigh_entry->n != n)) { | |
1037 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
1038 | return NOTIFY_DONE; | |
1039 | } | |
1040 | neigh_entry->mlxsw_sp_port = mlxsw_sp_port; | |
1041 | ||
1042 | /* Take a reference to ensure the neighbour won't be | |
1043 | * destructed until we drop the reference in delayed | |
1044 | * work. | |
1045 | */ | |
1046 | neigh_clone(n); | |
1047 | if (!mlxsw_core_schedule_dw(&neigh_entry->dw, 0)) { | |
1048 | neigh_release(n); | |
1049 | mlxsw_sp_port_dev_put(mlxsw_sp_port); | |
1050 | } | |
1051 | break; | |
c723c735 YG |
1052 | } |
1053 | ||
1054 | return NOTIFY_DONE; | |
1055 | } | |
1056 | ||
6cf3c971 JP |
1057 | static int mlxsw_sp_neigh_init(struct mlxsw_sp *mlxsw_sp) |
1058 | { | |
c723c735 YG |
1059 | int err; |
1060 | ||
1061 | err = rhashtable_init(&mlxsw_sp->router.neigh_ht, | |
1062 | &mlxsw_sp_neigh_ht_params); | |
1063 | if (err) | |
1064 | return err; | |
1065 | ||
1066 | /* Initialize the polling interval according to the default | |
1067 | * table. | |
1068 | */ | |
1069 | mlxsw_sp_router_neighs_update_interval_init(mlxsw_sp); | |
1070 | ||
0b2361d9 | 1071 | /* Create the delayed works for the activity_update */ |
c723c735 YG |
1072 | INIT_DELAYED_WORK(&mlxsw_sp->router.neighs_update.dw, |
1073 | mlxsw_sp_router_neighs_update_work); | |
0b2361d9 YG |
1074 | INIT_DELAYED_WORK(&mlxsw_sp->router.nexthop_probe_dw, |
1075 | mlxsw_sp_router_probe_unresolved_nexthops); | |
c723c735 | 1076 | mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw, 0); |
0b2361d9 | 1077 | mlxsw_core_schedule_dw(&mlxsw_sp->router.nexthop_probe_dw, 0); |
c723c735 | 1078 | return 0; |
6cf3c971 JP |
1079 | } |
1080 | ||
1081 | static void mlxsw_sp_neigh_fini(struct mlxsw_sp *mlxsw_sp) | |
1082 | { | |
c723c735 | 1083 | cancel_delayed_work_sync(&mlxsw_sp->router.neighs_update.dw); |
0b2361d9 | 1084 | cancel_delayed_work_sync(&mlxsw_sp->router.nexthop_probe_dw); |
6cf3c971 JP |
1085 | rhashtable_destroy(&mlxsw_sp->router.neigh_ht); |
1086 | } | |
1087 | ||
a7ff87ac JP |
1088 | struct mlxsw_sp_nexthop { |
1089 | struct list_head neigh_list_node; /* member of neigh entry list */ | |
1090 | struct mlxsw_sp_nexthop_group *nh_grp; /* pointer back to the group | |
1091 | * this belongs to | |
1092 | */ | |
1093 | u8 should_offload:1, /* set indicates this neigh is connected and | |
1094 | * should be put to KVD linear area of this group. | |
1095 | */ | |
1096 | offloaded:1, /* set in case the neigh is actually put into | |
1097 | * KVD linear area of this group. | |
1098 | */ | |
1099 | update:1; /* set indicates that MAC of this neigh should be | |
1100 | * updated in HW | |
1101 | */ | |
1102 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
1103 | }; | |
1104 | ||
1105 | struct mlxsw_sp_nexthop_group { | |
1106 | struct list_head list; /* node in mlxsw->router.nexthop_group_list */ | |
1107 | struct list_head fib_list; /* list of fib entries that use this group */ | |
1108 | u8 adj_index_valid:1; | |
1109 | u32 adj_index; | |
1110 | u16 ecmp_size; | |
1111 | u16 count; | |
1112 | struct mlxsw_sp_nexthop nexthops[0]; | |
1113 | }; | |
1114 | ||
1115 | static int mlxsw_sp_adj_index_mass_update_vr(struct mlxsw_sp *mlxsw_sp, | |
1116 | struct mlxsw_sp_vr *vr, | |
1117 | u32 adj_index, u16 ecmp_size, | |
1118 | u32 new_adj_index, | |
1119 | u16 new_ecmp_size) | |
1120 | { | |
1121 | char raleu_pl[MLXSW_REG_RALEU_LEN]; | |
1122 | ||
1a9234e6 IS |
1123 | mlxsw_reg_raleu_pack(raleu_pl, |
1124 | (enum mlxsw_reg_ralxx_protocol) vr->proto, vr->id, | |
1125 | adj_index, ecmp_size, new_adj_index, | |
1126 | new_ecmp_size); | |
a7ff87ac JP |
1127 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raleu), raleu_pl); |
1128 | } | |
1129 | ||
1130 | static int mlxsw_sp_adj_index_mass_update(struct mlxsw_sp *mlxsw_sp, | |
1131 | struct mlxsw_sp_nexthop_group *nh_grp, | |
1132 | u32 old_adj_index, u16 old_ecmp_size) | |
1133 | { | |
1134 | struct mlxsw_sp_fib_entry *fib_entry; | |
1135 | struct mlxsw_sp_vr *vr = NULL; | |
1136 | int err; | |
1137 | ||
1138 | list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) { | |
1139 | if (vr == fib_entry->vr) | |
1140 | continue; | |
1141 | vr = fib_entry->vr; | |
1142 | err = mlxsw_sp_adj_index_mass_update_vr(mlxsw_sp, vr, | |
1143 | old_adj_index, | |
1144 | old_ecmp_size, | |
1145 | nh_grp->adj_index, | |
1146 | nh_grp->ecmp_size); | |
1147 | if (err) | |
1148 | return err; | |
1149 | } | |
1150 | return 0; | |
1151 | } | |
1152 | ||
1153 | static int mlxsw_sp_nexthop_mac_update(struct mlxsw_sp *mlxsw_sp, u32 adj_index, | |
1154 | struct mlxsw_sp_nexthop *nh) | |
1155 | { | |
1156 | struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry; | |
1157 | char ratr_pl[MLXSW_REG_RATR_LEN]; | |
1158 | ||
1159 | mlxsw_reg_ratr_pack(ratr_pl, MLXSW_REG_RATR_OP_WRITE_WRITE_ENTRY, | |
1160 | true, adj_index, neigh_entry->rif); | |
1161 | mlxsw_reg_ratr_eth_entry_pack(ratr_pl, neigh_entry->ha); | |
1162 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ratr), ratr_pl); | |
1163 | } | |
1164 | ||
1165 | static int | |
1166 | mlxsw_sp_nexthop_group_mac_update(struct mlxsw_sp *mlxsw_sp, | |
1167 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1168 | { | |
1169 | u32 adj_index = nh_grp->adj_index; /* base */ | |
1170 | struct mlxsw_sp_nexthop *nh; | |
1171 | int i; | |
1172 | int err; | |
1173 | ||
1174 | for (i = 0; i < nh_grp->count; i++) { | |
1175 | nh = &nh_grp->nexthops[i]; | |
1176 | ||
1177 | if (!nh->should_offload) { | |
1178 | nh->offloaded = 0; | |
1179 | continue; | |
1180 | } | |
1181 | ||
1182 | if (nh->update) { | |
1183 | err = mlxsw_sp_nexthop_mac_update(mlxsw_sp, | |
1184 | adj_index, nh); | |
1185 | if (err) | |
1186 | return err; | |
1187 | nh->update = 0; | |
1188 | nh->offloaded = 1; | |
1189 | } | |
1190 | adj_index++; | |
1191 | } | |
1192 | return 0; | |
1193 | } | |
1194 | ||
1195 | static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp, | |
1196 | struct mlxsw_sp_fib_entry *fib_entry); | |
1197 | ||
1198 | static int | |
1199 | mlxsw_sp_nexthop_fib_entries_update(struct mlxsw_sp *mlxsw_sp, | |
1200 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1201 | { | |
1202 | struct mlxsw_sp_fib_entry *fib_entry; | |
1203 | int err; | |
1204 | ||
1205 | list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) { | |
1206 | err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry); | |
1207 | if (err) | |
1208 | return err; | |
1209 | } | |
1210 | return 0; | |
1211 | } | |
1212 | ||
1213 | static void | |
1214 | mlxsw_sp_nexthop_group_refresh(struct mlxsw_sp *mlxsw_sp, | |
1215 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1216 | { | |
1217 | struct mlxsw_sp_nexthop *nh; | |
1218 | bool offload_change = false; | |
1219 | u32 adj_index; | |
1220 | u16 ecmp_size = 0; | |
1221 | bool old_adj_index_valid; | |
1222 | u32 old_adj_index; | |
1223 | u16 old_ecmp_size; | |
1224 | int ret; | |
1225 | int i; | |
1226 | int err; | |
1227 | ||
1228 | for (i = 0; i < nh_grp->count; i++) { | |
1229 | nh = &nh_grp->nexthops[i]; | |
1230 | ||
1231 | if (nh->should_offload ^ nh->offloaded) { | |
1232 | offload_change = true; | |
1233 | if (nh->should_offload) | |
1234 | nh->update = 1; | |
1235 | } | |
1236 | if (nh->should_offload) | |
1237 | ecmp_size++; | |
1238 | } | |
1239 | if (!offload_change) { | |
1240 | /* Nothing was added or removed, so no need to reallocate. Just | |
1241 | * update MAC on existing adjacency indexes. | |
1242 | */ | |
1243 | err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp); | |
1244 | if (err) { | |
1245 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n"); | |
1246 | goto set_trap; | |
1247 | } | |
1248 | return; | |
1249 | } | |
1250 | if (!ecmp_size) | |
1251 | /* No neigh of this group is connected so we just set | |
1252 | * the trap and let everthing flow through kernel. | |
1253 | */ | |
1254 | goto set_trap; | |
1255 | ||
1256 | ret = mlxsw_sp_kvdl_alloc(mlxsw_sp, ecmp_size); | |
1257 | if (ret < 0) { | |
1258 | /* We ran out of KVD linear space, just set the | |
1259 | * trap and let everything flow through kernel. | |
1260 | */ | |
1261 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to allocate KVD linear area for nexthop group.\n"); | |
1262 | goto set_trap; | |
1263 | } | |
1264 | adj_index = ret; | |
1265 | old_adj_index_valid = nh_grp->adj_index_valid; | |
1266 | old_adj_index = nh_grp->adj_index; | |
1267 | old_ecmp_size = nh_grp->ecmp_size; | |
1268 | nh_grp->adj_index_valid = 1; | |
1269 | nh_grp->adj_index = adj_index; | |
1270 | nh_grp->ecmp_size = ecmp_size; | |
1271 | err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp); | |
1272 | if (err) { | |
1273 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n"); | |
1274 | goto set_trap; | |
1275 | } | |
1276 | ||
1277 | if (!old_adj_index_valid) { | |
1278 | /* The trap was set for fib entries, so we have to call | |
1279 | * fib entry update to unset it and use adjacency index. | |
1280 | */ | |
1281 | err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp); | |
1282 | if (err) { | |
1283 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to add adjacency index to fib entries.\n"); | |
1284 | goto set_trap; | |
1285 | } | |
1286 | return; | |
1287 | } | |
1288 | ||
1289 | err = mlxsw_sp_adj_index_mass_update(mlxsw_sp, nh_grp, | |
1290 | old_adj_index, old_ecmp_size); | |
1291 | mlxsw_sp_kvdl_free(mlxsw_sp, old_adj_index); | |
1292 | if (err) { | |
1293 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to mass-update adjacency index for nexthop group.\n"); | |
1294 | goto set_trap; | |
1295 | } | |
1296 | return; | |
1297 | ||
1298 | set_trap: | |
1299 | old_adj_index_valid = nh_grp->adj_index_valid; | |
1300 | nh_grp->adj_index_valid = 0; | |
1301 | for (i = 0; i < nh_grp->count; i++) { | |
1302 | nh = &nh_grp->nexthops[i]; | |
1303 | nh->offloaded = 0; | |
1304 | } | |
1305 | err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp); | |
1306 | if (err) | |
1307 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to set traps for fib entries.\n"); | |
1308 | if (old_adj_index_valid) | |
1309 | mlxsw_sp_kvdl_free(mlxsw_sp, nh_grp->adj_index); | |
1310 | } | |
1311 | ||
1312 | static void __mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp_nexthop *nh, | |
1313 | bool removing) | |
1314 | { | |
1315 | if (!removing && !nh->should_offload) | |
1316 | nh->should_offload = 1; | |
1317 | else if (removing && nh->offloaded) | |
1318 | nh->should_offload = 0; | |
1319 | nh->update = 1; | |
1320 | } | |
1321 | ||
1322 | static void | |
1323 | mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp, | |
1324 | struct mlxsw_sp_neigh_entry *neigh_entry, | |
1325 | bool removing) | |
1326 | { | |
1327 | struct mlxsw_sp_nexthop *nh; | |
1328 | ||
1329 | /* Take RTNL mutex here to prevent lists from changes */ | |
1330 | rtnl_lock(); | |
1331 | list_for_each_entry(nh, &neigh_entry->nexthop_list, | |
1332 | neigh_list_node) { | |
1333 | __mlxsw_sp_nexthop_neigh_update(nh, removing); | |
1334 | mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp); | |
1335 | } | |
1336 | rtnl_unlock(); | |
1337 | } | |
1338 | ||
1339 | static int mlxsw_sp_nexthop_init(struct mlxsw_sp *mlxsw_sp, | |
1340 | struct mlxsw_sp_nexthop_group *nh_grp, | |
1341 | struct mlxsw_sp_nexthop *nh, | |
1342 | struct fib_nh *fib_nh) | |
1343 | { | |
1344 | struct mlxsw_sp_neigh_entry *neigh_entry; | |
1345 | u32 gwip = ntohl(fib_nh->nh_gw); | |
1346 | struct net_device *dev = fib_nh->nh_dev; | |
1347 | struct neighbour *n; | |
1348 | u8 nud_state; | |
1349 | ||
1350 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &gwip, | |
1351 | sizeof(gwip), dev); | |
1352 | if (!neigh_entry) { | |
1353 | __be32 gwipn = htonl(gwip); | |
1354 | ||
1355 | n = neigh_create(&arp_tbl, &gwipn, dev); | |
1356 | if (IS_ERR(n)) | |
1357 | return PTR_ERR(n); | |
1358 | neigh_event_send(n, NULL); | |
1359 | neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &gwip, | |
1360 | sizeof(gwip), dev); | |
1361 | if (!neigh_entry) { | |
1362 | neigh_release(n); | |
1363 | return -EINVAL; | |
1364 | } | |
1365 | } else { | |
1366 | /* Take a reference of neigh here ensuring that neigh would | |
1367 | * not be detructed before the nexthop entry is finished. | |
1368 | * The second branch takes the reference in neith_create() | |
1369 | */ | |
1370 | n = neigh_entry->n; | |
1371 | neigh_clone(n); | |
1372 | } | |
b2157149 YG |
1373 | |
1374 | /* If that is the first nexthop connected to that neigh, add to | |
1375 | * nexthop_neighs_list | |
1376 | */ | |
1377 | if (list_empty(&neigh_entry->nexthop_list)) | |
1378 | list_add_tail(&neigh_entry->nexthop_neighs_list_node, | |
1379 | &mlxsw_sp->router.nexthop_neighs_list); | |
1380 | ||
a7ff87ac JP |
1381 | nh->nh_grp = nh_grp; |
1382 | nh->neigh_entry = neigh_entry; | |
1383 | list_add_tail(&nh->neigh_list_node, &neigh_entry->nexthop_list); | |
1384 | read_lock_bh(&n->lock); | |
1385 | nud_state = n->nud_state; | |
1386 | read_unlock_bh(&n->lock); | |
1387 | __mlxsw_sp_nexthop_neigh_update(nh, !(nud_state & NUD_VALID)); | |
1388 | ||
1389 | return 0; | |
1390 | } | |
1391 | ||
1392 | static void mlxsw_sp_nexthop_fini(struct mlxsw_sp *mlxsw_sp, | |
1393 | struct mlxsw_sp_nexthop *nh) | |
1394 | { | |
1395 | struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry; | |
1396 | ||
1397 | list_del(&nh->neigh_list_node); | |
b2157149 YG |
1398 | |
1399 | /* If that is the last nexthop connected to that neigh, remove from | |
1400 | * nexthop_neighs_list | |
1401 | */ | |
1402 | if (list_empty(&nh->neigh_entry->nexthop_list)) | |
1403 | list_del(&nh->neigh_entry->nexthop_neighs_list_node); | |
1404 | ||
a7ff87ac JP |
1405 | neigh_release(neigh_entry->n); |
1406 | } | |
1407 | ||
1408 | static struct mlxsw_sp_nexthop_group * | |
1409 | mlxsw_sp_nexthop_group_create(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi) | |
1410 | { | |
1411 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1412 | struct mlxsw_sp_nexthop *nh; | |
1413 | struct fib_nh *fib_nh; | |
1414 | size_t alloc_size; | |
1415 | int i; | |
1416 | int err; | |
1417 | ||
1418 | alloc_size = sizeof(*nh_grp) + | |
1419 | fi->fib_nhs * sizeof(struct mlxsw_sp_nexthop); | |
1420 | nh_grp = kzalloc(alloc_size, GFP_KERNEL); | |
1421 | if (!nh_grp) | |
1422 | return ERR_PTR(-ENOMEM); | |
1423 | INIT_LIST_HEAD(&nh_grp->fib_list); | |
1424 | nh_grp->count = fi->fib_nhs; | |
1425 | for (i = 0; i < nh_grp->count; i++) { | |
1426 | nh = &nh_grp->nexthops[i]; | |
1427 | fib_nh = &fi->fib_nh[i]; | |
1428 | err = mlxsw_sp_nexthop_init(mlxsw_sp, nh_grp, nh, fib_nh); | |
1429 | if (err) | |
1430 | goto err_nexthop_init; | |
1431 | } | |
1432 | list_add_tail(&nh_grp->list, &mlxsw_sp->router.nexthop_group_list); | |
1433 | mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh_grp); | |
1434 | return nh_grp; | |
1435 | ||
1436 | err_nexthop_init: | |
1437 | for (i--; i >= 0; i--) | |
1438 | mlxsw_sp_nexthop_fini(mlxsw_sp, nh); | |
1439 | kfree(nh_grp); | |
1440 | return ERR_PTR(err); | |
1441 | } | |
1442 | ||
1443 | static void | |
1444 | mlxsw_sp_nexthop_group_destroy(struct mlxsw_sp *mlxsw_sp, | |
1445 | struct mlxsw_sp_nexthop_group *nh_grp) | |
1446 | { | |
1447 | struct mlxsw_sp_nexthop *nh; | |
1448 | int i; | |
1449 | ||
1450 | list_del(&nh_grp->list); | |
1451 | for (i = 0; i < nh_grp->count; i++) { | |
1452 | nh = &nh_grp->nexthops[i]; | |
1453 | mlxsw_sp_nexthop_fini(mlxsw_sp, nh); | |
1454 | } | |
1455 | kfree(nh_grp); | |
1456 | } | |
1457 | ||
1458 | static bool mlxsw_sp_nexthop_match(struct mlxsw_sp_nexthop *nh, | |
1459 | struct fib_info *fi) | |
1460 | { | |
1461 | int i; | |
1462 | ||
1463 | for (i = 0; i < fi->fib_nhs; i++) { | |
1464 | struct fib_nh *fib_nh = &fi->fib_nh[i]; | |
1465 | u32 gwip = ntohl(fib_nh->nh_gw); | |
1466 | ||
1467 | if (memcmp(nh->neigh_entry->key.addr, | |
1468 | &gwip, sizeof(u32)) == 0 && | |
1469 | nh->neigh_entry->key.dev == fib_nh->nh_dev) | |
1470 | return true; | |
1471 | } | |
1472 | return false; | |
1473 | } | |
1474 | ||
1475 | static bool mlxsw_sp_nexthop_group_match(struct mlxsw_sp_nexthop_group *nh_grp, | |
1476 | struct fib_info *fi) | |
1477 | { | |
1478 | int i; | |
1479 | ||
1480 | if (nh_grp->count != fi->fib_nhs) | |
1481 | return false; | |
1482 | for (i = 0; i < nh_grp->count; i++) { | |
1483 | struct mlxsw_sp_nexthop *nh = &nh_grp->nexthops[i]; | |
1484 | ||
1485 | if (!mlxsw_sp_nexthop_match(nh, fi)) | |
1486 | return false; | |
1487 | } | |
1488 | return true; | |
1489 | } | |
1490 | ||
1491 | static struct mlxsw_sp_nexthop_group * | |
1492 | mlxsw_sp_nexthop_group_find(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi) | |
1493 | { | |
1494 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1495 | ||
1496 | list_for_each_entry(nh_grp, &mlxsw_sp->router.nexthop_group_list, | |
1497 | list) { | |
1498 | if (mlxsw_sp_nexthop_group_match(nh_grp, fi)) | |
1499 | return nh_grp; | |
1500 | } | |
1501 | return NULL; | |
1502 | } | |
1503 | ||
1504 | static int mlxsw_sp_nexthop_group_get(struct mlxsw_sp *mlxsw_sp, | |
1505 | struct mlxsw_sp_fib_entry *fib_entry, | |
1506 | struct fib_info *fi) | |
1507 | { | |
1508 | struct mlxsw_sp_nexthop_group *nh_grp; | |
1509 | ||
1510 | nh_grp = mlxsw_sp_nexthop_group_find(mlxsw_sp, fi); | |
1511 | if (!nh_grp) { | |
1512 | nh_grp = mlxsw_sp_nexthop_group_create(mlxsw_sp, fi); | |
1513 | if (IS_ERR(nh_grp)) | |
1514 | return PTR_ERR(nh_grp); | |
1515 | } | |
1516 | list_add_tail(&fib_entry->nexthop_group_node, &nh_grp->fib_list); | |
1517 | fib_entry->nh_group = nh_grp; | |
1518 | return 0; | |
1519 | } | |
1520 | ||
1521 | static void mlxsw_sp_nexthop_group_put(struct mlxsw_sp *mlxsw_sp, | |
1522 | struct mlxsw_sp_fib_entry *fib_entry) | |
1523 | { | |
1524 | struct mlxsw_sp_nexthop_group *nh_grp = fib_entry->nh_group; | |
1525 | ||
1526 | list_del(&fib_entry->nexthop_group_node); | |
1527 | if (!list_empty(&nh_grp->fib_list)) | |
1528 | return; | |
1529 | mlxsw_sp_nexthop_group_destroy(mlxsw_sp, nh_grp); | |
1530 | } | |
1531 | ||
a7ff87ac JP |
1532 | static int mlxsw_sp_fib_entry_op4_remote(struct mlxsw_sp *mlxsw_sp, |
1533 | struct mlxsw_sp_fib_entry *fib_entry, | |
1534 | enum mlxsw_reg_ralue_op op) | |
1535 | { | |
1536 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1537 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1538 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1539 | enum mlxsw_reg_ralue_trap_action trap_action; | |
1540 | u16 trap_id = 0; | |
1541 | u32 adjacency_index = 0; | |
1542 | u16 ecmp_size = 0; | |
1543 | ||
1544 | /* In case the nexthop group adjacency index is valid, use it | |
1545 | * with provided ECMP size. Otherwise, setup trap and pass | |
1546 | * traffic to kernel. | |
1547 | */ | |
1548 | if (fib_entry->nh_group->adj_index_valid) { | |
1549 | trap_action = MLXSW_REG_RALUE_TRAP_ACTION_NOP; | |
1550 | adjacency_index = fib_entry->nh_group->adj_index; | |
1551 | ecmp_size = fib_entry->nh_group->ecmp_size; | |
1552 | } else { | |
1553 | trap_action = MLXSW_REG_RALUE_TRAP_ACTION_TRAP; | |
1554 | trap_id = MLXSW_TRAP_ID_RTR_INGRESS0; | |
1555 | } | |
1556 | ||
1a9234e6 IS |
1557 | mlxsw_reg_ralue_pack4(ralue_pl, |
1558 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1559 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
a7ff87ac JP |
1560 | mlxsw_reg_ralue_act_remote_pack(ralue_pl, trap_action, trap_id, |
1561 | adjacency_index, ecmp_size); | |
1562 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1563 | } | |
1564 | ||
61c503f9 JP |
1565 | static int mlxsw_sp_fib_entry_op4_local(struct mlxsw_sp *mlxsw_sp, |
1566 | struct mlxsw_sp_fib_entry *fib_entry, | |
1567 | enum mlxsw_reg_ralue_op op) | |
1568 | { | |
1569 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1570 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1571 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1572 | ||
1a9234e6 IS |
1573 | mlxsw_reg_ralue_pack4(ralue_pl, |
1574 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1575 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
61c503f9 JP |
1576 | mlxsw_reg_ralue_act_local_pack(ralue_pl, |
1577 | MLXSW_REG_RALUE_TRAP_ACTION_NOP, 0, | |
1578 | fib_entry->rif); | |
1579 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1580 | } | |
1581 | ||
1582 | static int mlxsw_sp_fib_entry_op4_trap(struct mlxsw_sp *mlxsw_sp, | |
1583 | struct mlxsw_sp_fib_entry *fib_entry, | |
1584 | enum mlxsw_reg_ralue_op op) | |
1585 | { | |
1586 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1587 | u32 *p_dip = (u32 *) fib_entry->key.addr; | |
1588 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1589 | ||
1a9234e6 IS |
1590 | mlxsw_reg_ralue_pack4(ralue_pl, |
1591 | (enum mlxsw_reg_ralxx_protocol) vr->proto, op, | |
1592 | vr->id, fib_entry->key.prefix_len, *p_dip); | |
61c503f9 JP |
1593 | mlxsw_reg_ralue_act_ip2me_pack(ralue_pl); |
1594 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1595 | } | |
1596 | ||
1597 | static int mlxsw_sp_fib_entry_op4(struct mlxsw_sp *mlxsw_sp, | |
1598 | struct mlxsw_sp_fib_entry *fib_entry, | |
1599 | enum mlxsw_reg_ralue_op op) | |
1600 | { | |
1601 | switch (fib_entry->type) { | |
1602 | case MLXSW_SP_FIB_ENTRY_TYPE_REMOTE: | |
a7ff87ac | 1603 | return mlxsw_sp_fib_entry_op4_remote(mlxsw_sp, fib_entry, op); |
61c503f9 JP |
1604 | case MLXSW_SP_FIB_ENTRY_TYPE_LOCAL: |
1605 | return mlxsw_sp_fib_entry_op4_local(mlxsw_sp, fib_entry, op); | |
1606 | case MLXSW_SP_FIB_ENTRY_TYPE_TRAP: | |
1607 | return mlxsw_sp_fib_entry_op4_trap(mlxsw_sp, fib_entry, op); | |
1608 | } | |
1609 | return -EINVAL; | |
1610 | } | |
1611 | ||
1612 | static int mlxsw_sp_fib_entry_op(struct mlxsw_sp *mlxsw_sp, | |
1613 | struct mlxsw_sp_fib_entry *fib_entry, | |
1614 | enum mlxsw_reg_ralue_op op) | |
1615 | { | |
1616 | switch (fib_entry->vr->proto) { | |
1617 | case MLXSW_SP_L3_PROTO_IPV4: | |
1618 | return mlxsw_sp_fib_entry_op4(mlxsw_sp, fib_entry, op); | |
1619 | case MLXSW_SP_L3_PROTO_IPV6: | |
1620 | return -EINVAL; | |
1621 | } | |
1622 | return -EINVAL; | |
1623 | } | |
1624 | ||
1625 | static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp, | |
1626 | struct mlxsw_sp_fib_entry *fib_entry) | |
1627 | { | |
7146da31 JP |
1628 | return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry, |
1629 | MLXSW_REG_RALUE_OP_WRITE_WRITE); | |
61c503f9 JP |
1630 | } |
1631 | ||
1632 | static int mlxsw_sp_fib_entry_del(struct mlxsw_sp *mlxsw_sp, | |
1633 | struct mlxsw_sp_fib_entry *fib_entry) | |
1634 | { | |
1635 | return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry, | |
1636 | MLXSW_REG_RALUE_OP_WRITE_DELETE); | |
1637 | } | |
1638 | ||
61c503f9 JP |
1639 | static int |
1640 | mlxsw_sp_router_fib4_entry_init(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1641 | const struct fib_entry_notifier_info *fen_info, |
61c503f9 JP |
1642 | struct mlxsw_sp_fib_entry *fib_entry) |
1643 | { | |
b45f64d1 | 1644 | struct fib_info *fi = fen_info->fi; |
ab580705 | 1645 | struct mlxsw_sp_rif *r = NULL; |
b45f64d1 JP |
1646 | int nhsel; |
1647 | int err; | |
61c503f9 | 1648 | |
b45f64d1 | 1649 | if (fen_info->type == RTN_LOCAL || fen_info->type == RTN_BROADCAST) { |
61c503f9 JP |
1650 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP; |
1651 | return 0; | |
1652 | } | |
b45f64d1 | 1653 | if (fen_info->type != RTN_UNICAST) |
61c503f9 JP |
1654 | return -EINVAL; |
1655 | ||
b45f64d1 JP |
1656 | for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) { |
1657 | const struct fib_nh *nh = &fi->fib_nh[nhsel]; | |
1658 | ||
1659 | if (!nh->nh_dev) | |
1660 | continue; | |
1661 | r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, nh->nh_dev); | |
1662 | if (!r) { | |
1663 | /* In case router interface is not found for | |
1664 | * at least one of the nexthops, that means | |
1665 | * the nexthop points to some device unrelated | |
1666 | * to us. Set trap and pass the packets for | |
1667 | * this prefix to kernel. | |
1668 | */ | |
ab580705 | 1669 | break; |
b45f64d1 JP |
1670 | } |
1671 | } | |
61c503f9 | 1672 | |
ab580705 AB |
1673 | if (!r) { |
1674 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP; | |
1675 | return 0; | |
1676 | } | |
1677 | ||
b45f64d1 | 1678 | if (fi->fib_scope != RT_SCOPE_UNIVERSE) { |
61c503f9 | 1679 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_LOCAL; |
61c503f9 | 1680 | fib_entry->rif = r->rif; |
b45f64d1 JP |
1681 | } else { |
1682 | fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_REMOTE; | |
1683 | err = mlxsw_sp_nexthop_group_get(mlxsw_sp, fib_entry, fi); | |
1684 | if (err) | |
1685 | return err; | |
61c503f9 | 1686 | } |
b45f64d1 JP |
1687 | fib_info_offload_inc(fen_info->fi); |
1688 | return 0; | |
a7ff87ac JP |
1689 | } |
1690 | ||
1691 | static void | |
1692 | mlxsw_sp_router_fib4_entry_fini(struct mlxsw_sp *mlxsw_sp, | |
1693 | struct mlxsw_sp_fib_entry *fib_entry) | |
1694 | { | |
b45f64d1 JP |
1695 | if (fib_entry->type != MLXSW_SP_FIB_ENTRY_TYPE_TRAP) |
1696 | fib_info_offload_dec(fib_entry->fi); | |
1697 | if (fib_entry->type == MLXSW_SP_FIB_ENTRY_TYPE_REMOTE) | |
1698 | mlxsw_sp_nexthop_group_put(mlxsw_sp, fib_entry); | |
61c503f9 JP |
1699 | } |
1700 | ||
5b004412 JP |
1701 | static struct mlxsw_sp_fib_entry * |
1702 | mlxsw_sp_fib_entry_get(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1703 | const struct fib_entry_notifier_info *fen_info) |
61c503f9 | 1704 | { |
61c503f9 | 1705 | struct mlxsw_sp_fib_entry *fib_entry; |
b45f64d1 | 1706 | struct fib_info *fi = fen_info->fi; |
61c503f9 JP |
1707 | struct mlxsw_sp_vr *vr; |
1708 | int err; | |
1709 | ||
b45f64d1 | 1710 | vr = mlxsw_sp_vr_get(mlxsw_sp, fen_info->dst_len, fen_info->tb_id, |
61c503f9 JP |
1711 | MLXSW_SP_L3_PROTO_IPV4); |
1712 | if (IS_ERR(vr)) | |
5b004412 | 1713 | return ERR_CAST(vr); |
61c503f9 | 1714 | |
b45f64d1 JP |
1715 | fib_entry = mlxsw_sp_fib_entry_lookup(vr->fib, &fen_info->dst, |
1716 | sizeof(fen_info->dst), | |
1717 | fen_info->dst_len, fi->fib_dev); | |
5b004412 JP |
1718 | if (fib_entry) { |
1719 | /* Already exists, just take a reference */ | |
1720 | fib_entry->ref_count++; | |
1721 | return fib_entry; | |
1722 | } | |
b45f64d1 JP |
1723 | fib_entry = mlxsw_sp_fib_entry_create(vr->fib, &fen_info->dst, |
1724 | sizeof(fen_info->dst), | |
1725 | fen_info->dst_len, fi->fib_dev); | |
61c503f9 JP |
1726 | if (!fib_entry) { |
1727 | err = -ENOMEM; | |
1728 | goto err_fib_entry_create; | |
1729 | } | |
1730 | fib_entry->vr = vr; | |
b45f64d1 | 1731 | fib_entry->fi = fi; |
5b004412 | 1732 | fib_entry->ref_count = 1; |
61c503f9 | 1733 | |
b45f64d1 | 1734 | err = mlxsw_sp_router_fib4_entry_init(mlxsw_sp, fen_info, fib_entry); |
61c503f9 JP |
1735 | if (err) |
1736 | goto err_fib4_entry_init; | |
1737 | ||
5b004412 JP |
1738 | return fib_entry; |
1739 | ||
1740 | err_fib4_entry_init: | |
1741 | mlxsw_sp_fib_entry_destroy(fib_entry); | |
1742 | err_fib_entry_create: | |
1743 | mlxsw_sp_vr_put(mlxsw_sp, vr); | |
1744 | ||
1745 | return ERR_PTR(err); | |
1746 | } | |
1747 | ||
1748 | static struct mlxsw_sp_fib_entry * | |
1749 | mlxsw_sp_fib_entry_find(struct mlxsw_sp *mlxsw_sp, | |
b45f64d1 | 1750 | const struct fib_entry_notifier_info *fen_info) |
5b004412 JP |
1751 | { |
1752 | struct mlxsw_sp_vr *vr; | |
1753 | ||
b45f64d1 JP |
1754 | vr = mlxsw_sp_vr_find(mlxsw_sp, fen_info->tb_id, |
1755 | MLXSW_SP_L3_PROTO_IPV4); | |
5b004412 JP |
1756 | if (!vr) |
1757 | return NULL; | |
1758 | ||
b45f64d1 JP |
1759 | return mlxsw_sp_fib_entry_lookup(vr->fib, &fen_info->dst, |
1760 | sizeof(fen_info->dst), | |
1761 | fen_info->dst_len, | |
1762 | fen_info->fi->fib_dev); | |
5b004412 JP |
1763 | } |
1764 | ||
1a9234e6 IS |
1765 | static void mlxsw_sp_fib_entry_put(struct mlxsw_sp *mlxsw_sp, |
1766 | struct mlxsw_sp_fib_entry *fib_entry) | |
5b004412 JP |
1767 | { |
1768 | struct mlxsw_sp_vr *vr = fib_entry->vr; | |
1769 | ||
1770 | if (--fib_entry->ref_count == 0) { | |
1771 | mlxsw_sp_router_fib4_entry_fini(mlxsw_sp, fib_entry); | |
1772 | mlxsw_sp_fib_entry_destroy(fib_entry); | |
1773 | } | |
1774 | mlxsw_sp_vr_put(mlxsw_sp, vr); | |
1775 | } | |
1776 | ||
b45f64d1 JP |
1777 | static void mlxsw_sp_fib_entry_put_all(struct mlxsw_sp *mlxsw_sp, |
1778 | struct mlxsw_sp_fib_entry *fib_entry) | |
5b004412 | 1779 | { |
b45f64d1 | 1780 | unsigned int last_ref_count; |
5b004412 | 1781 | |
b45f64d1 JP |
1782 | do { |
1783 | last_ref_count = fib_entry->ref_count; | |
1784 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); | |
1785 | } while (last_ref_count != 1); | |
61c503f9 JP |
1786 | } |
1787 | ||
b45f64d1 JP |
1788 | static int mlxsw_sp_router_fib4_add(struct mlxsw_sp *mlxsw_sp, |
1789 | struct fib_entry_notifier_info *fen_info) | |
61c503f9 | 1790 | { |
61c503f9 JP |
1791 | struct mlxsw_sp_fib_entry *fib_entry; |
1792 | struct mlxsw_sp_vr *vr; | |
1793 | int err; | |
1794 | ||
b45f64d1 JP |
1795 | if (mlxsw_sp->router.aborted) |
1796 | return 0; | |
1797 | ||
1798 | fib_entry = mlxsw_sp_fib_entry_get(mlxsw_sp, fen_info); | |
1799 | if (IS_ERR(fib_entry)) { | |
1800 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to get FIB4 entry being added.\n"); | |
1801 | return PTR_ERR(fib_entry); | |
1802 | } | |
61c503f9 | 1803 | |
5b004412 JP |
1804 | if (fib_entry->ref_count != 1) |
1805 | return 0; | |
1806 | ||
61c503f9 | 1807 | vr = fib_entry->vr; |
5b004412 | 1808 | err = mlxsw_sp_fib_entry_insert(vr->fib, fib_entry); |
b45f64d1 JP |
1809 | if (err) { |
1810 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to insert FIB4 entry being added.\n"); | |
61c503f9 | 1811 | goto err_fib_entry_insert; |
b45f64d1 JP |
1812 | } |
1813 | err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry); | |
61c503f9 JP |
1814 | if (err) |
1815 | goto err_fib_entry_add; | |
1816 | return 0; | |
1817 | ||
1818 | err_fib_entry_add: | |
1819 | mlxsw_sp_fib_entry_remove(vr->fib, fib_entry); | |
1820 | err_fib_entry_insert: | |
5b004412 | 1821 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); |
61c503f9 JP |
1822 | return err; |
1823 | } | |
1824 | ||
37956d78 JP |
1825 | static void mlxsw_sp_router_fib4_del(struct mlxsw_sp *mlxsw_sp, |
1826 | struct fib_entry_notifier_info *fen_info) | |
61c503f9 | 1827 | { |
61c503f9 | 1828 | struct mlxsw_sp_fib_entry *fib_entry; |
61c503f9 | 1829 | |
b45f64d1 | 1830 | if (mlxsw_sp->router.aborted) |
37956d78 | 1831 | return; |
b45f64d1 JP |
1832 | |
1833 | fib_entry = mlxsw_sp_fib_entry_find(mlxsw_sp, fen_info); | |
37956d78 JP |
1834 | if (!fib_entry) |
1835 | return; | |
5b004412 JP |
1836 | |
1837 | if (fib_entry->ref_count == 1) { | |
1838 | mlxsw_sp_fib_entry_del(mlxsw_sp, fib_entry); | |
1839 | mlxsw_sp_fib_entry_remove(fib_entry->vr->fib, fib_entry); | |
1840 | } | |
1841 | ||
1842 | mlxsw_sp_fib_entry_put(mlxsw_sp, fib_entry); | |
61c503f9 | 1843 | } |
b45f64d1 JP |
1844 | |
1845 | static int mlxsw_sp_router_set_abort_trap(struct mlxsw_sp *mlxsw_sp) | |
1846 | { | |
1847 | char ralta_pl[MLXSW_REG_RALTA_LEN]; | |
1848 | char ralst_pl[MLXSW_REG_RALST_LEN]; | |
1849 | char raltb_pl[MLXSW_REG_RALTB_LEN]; | |
1850 | char ralue_pl[MLXSW_REG_RALUE_LEN]; | |
1851 | int err; | |
1852 | ||
1853 | mlxsw_reg_ralta_pack(ralta_pl, true, MLXSW_REG_RALXX_PROTOCOL_IPV4, | |
1854 | MLXSW_SP_LPM_TREE_MIN); | |
1855 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl); | |
1856 | if (err) | |
1857 | return err; | |
1858 | ||
1859 | mlxsw_reg_ralst_pack(ralst_pl, 0xff, MLXSW_SP_LPM_TREE_MIN); | |
1860 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl); | |
1861 | if (err) | |
1862 | return err; | |
1863 | ||
19271c1a JP |
1864 | mlxsw_reg_raltb_pack(raltb_pl, 0, MLXSW_REG_RALXX_PROTOCOL_IPV4, |
1865 | MLXSW_SP_LPM_TREE_MIN); | |
b45f64d1 JP |
1866 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl); |
1867 | if (err) | |
1868 | return err; | |
1869 | ||
1870 | mlxsw_reg_ralue_pack4(ralue_pl, MLXSW_SP_L3_PROTO_IPV4, | |
1871 | MLXSW_REG_RALUE_OP_WRITE_WRITE, 0, 0, 0); | |
1872 | mlxsw_reg_ralue_act_ip2me_pack(ralue_pl); | |
1873 | return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl); | |
1874 | } | |
1875 | ||
1876 | static void mlxsw_sp_router_fib4_abort(struct mlxsw_sp *mlxsw_sp) | |
1877 | { | |
1878 | struct mlxsw_resources *resources; | |
1879 | struct mlxsw_sp_fib_entry *fib_entry; | |
1880 | struct mlxsw_sp_fib_entry *tmp; | |
1881 | struct mlxsw_sp_vr *vr; | |
1882 | int i; | |
1883 | int err; | |
1884 | ||
1885 | resources = mlxsw_core_resources_get(mlxsw_sp->core); | |
1886 | for (i = 0; i < resources->max_virtual_routers; i++) { | |
1887 | vr = &mlxsw_sp->router.vrs[i]; | |
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 | } | |
1903 | mlxsw_sp->router.aborted = true; | |
1904 | err = mlxsw_sp_router_set_abort_trap(mlxsw_sp); | |
1905 | if (err) | |
1906 | dev_warn(mlxsw_sp->bus_info->dev, "Failed to set abort trap.\n"); | |
1907 | } | |
1908 | ||
1909 | static int __mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp) | |
1910 | { | |
1911 | struct mlxsw_resources *resources; | |
1912 | char rgcr_pl[MLXSW_REG_RGCR_LEN]; | |
1913 | int err; | |
1914 | ||
1915 | resources = mlxsw_core_resources_get(mlxsw_sp->core); | |
1916 | if (!resources->max_rif_valid) | |
1917 | return -EIO; | |
1918 | ||
1919 | mlxsw_sp->rifs = kcalloc(resources->max_rif, | |
1920 | sizeof(struct mlxsw_sp_rif *), GFP_KERNEL); | |
1921 | if (!mlxsw_sp->rifs) | |
1922 | return -ENOMEM; | |
1923 | ||
1924 | mlxsw_reg_rgcr_pack(rgcr_pl, true); | |
1925 | mlxsw_reg_rgcr_max_router_interfaces_set(rgcr_pl, resources->max_rif); | |
1926 | err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl); | |
1927 | if (err) | |
1928 | goto err_rgcr_fail; | |
1929 | ||
1930 | return 0; | |
1931 | ||
1932 | err_rgcr_fail: | |
1933 | kfree(mlxsw_sp->rifs); | |
1934 | return err; | |
1935 | } | |
1936 | ||
1937 | static void __mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp) | |
1938 | { | |
1939 | struct mlxsw_resources *resources; | |
1940 | char rgcr_pl[MLXSW_REG_RGCR_LEN]; | |
1941 | int i; | |
1942 | ||
1943 | mlxsw_reg_rgcr_pack(rgcr_pl, false); | |
1944 | mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl); | |
1945 | ||
1946 | resources = mlxsw_core_resources_get(mlxsw_sp->core); | |
1947 | for (i = 0; i < resources->max_rif; i++) | |
1948 | WARN_ON_ONCE(mlxsw_sp->rifs[i]); | |
1949 | ||
1950 | kfree(mlxsw_sp->rifs); | |
1951 | } | |
1952 | ||
1953 | static int mlxsw_sp_router_fib_event(struct notifier_block *nb, | |
1954 | unsigned long event, void *ptr) | |
1955 | { | |
1956 | struct mlxsw_sp *mlxsw_sp = container_of(nb, struct mlxsw_sp, fib_nb); | |
1957 | struct fib_entry_notifier_info *fen_info = ptr; | |
1958 | int err; | |
1959 | ||
1960 | switch (event) { | |
1961 | case FIB_EVENT_ENTRY_ADD: | |
1962 | err = mlxsw_sp_router_fib4_add(mlxsw_sp, fen_info); | |
1963 | if (err) | |
1964 | mlxsw_sp_router_fib4_abort(mlxsw_sp); | |
1965 | break; | |
1966 | case FIB_EVENT_ENTRY_DEL: | |
1967 | mlxsw_sp_router_fib4_del(mlxsw_sp, fen_info); | |
1968 | break; | |
1969 | case FIB_EVENT_RULE_ADD: /* fall through */ | |
1970 | case FIB_EVENT_RULE_DEL: | |
1971 | mlxsw_sp_router_fib4_abort(mlxsw_sp); | |
1972 | break; | |
1973 | } | |
1974 | return NOTIFY_DONE; | |
1975 | } | |
1976 | ||
1977 | int mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp) | |
1978 | { | |
1979 | int err; | |
1980 | ||
1981 | INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_neighs_list); | |
1982 | INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_group_list); | |
1983 | err = __mlxsw_sp_router_init(mlxsw_sp); | |
1984 | if (err) | |
1985 | return err; | |
1986 | ||
1987 | mlxsw_sp_lpm_init(mlxsw_sp); | |
1988 | err = mlxsw_sp_vrs_init(mlxsw_sp); | |
1989 | if (err) | |
1990 | goto err_vrs_init; | |
1991 | ||
1992 | err = mlxsw_sp_neigh_init(mlxsw_sp); | |
1993 | if (err) | |
1994 | goto err_neigh_init; | |
1995 | ||
1996 | mlxsw_sp->fib_nb.notifier_call = mlxsw_sp_router_fib_event; | |
1997 | register_fib_notifier(&mlxsw_sp->fib_nb); | |
1998 | return 0; | |
1999 | ||
2000 | err_neigh_init: | |
2001 | mlxsw_sp_vrs_fini(mlxsw_sp); | |
2002 | err_vrs_init: | |
2003 | __mlxsw_sp_router_fini(mlxsw_sp); | |
2004 | return err; | |
2005 | } | |
2006 | ||
2007 | void mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp) | |
2008 | { | |
2009 | unregister_fib_notifier(&mlxsw_sp->fib_nb); | |
2010 | mlxsw_sp_neigh_fini(mlxsw_sp); | |
2011 | mlxsw_sp_vrs_fini(mlxsw_sp); | |
2012 | __mlxsw_sp_router_fini(mlxsw_sp); | |
2013 | } |