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>
6 * Copyright (c) 2016 Yotam Gigi <yotamg@mellanox.com>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
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.
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.
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.
37 #include <linux/kernel.h>
38 #include <linux/types.h>
39 #include <linux/rhashtable.h>
40 #include <linux/bitops.h>
41 #include <linux/in6.h>
42 #include <linux/notifier.h>
43 #include <net/netevent.h>
44 #include <net/neighbour.h>
51 #define mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) \
52 for_each_set_bit(prefix, (prefix_usage)->b, MLXSW_SP_PREFIX_COUNT)
55 mlxsw_sp_prefix_usage_subset(struct mlxsw_sp_prefix_usage *prefix_usage1,
56 struct mlxsw_sp_prefix_usage *prefix_usage2)
60 mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage1) {
61 if (!test_bit(prefix, prefix_usage2->b))
68 mlxsw_sp_prefix_usage_eq(struct mlxsw_sp_prefix_usage *prefix_usage1,
69 struct mlxsw_sp_prefix_usage *prefix_usage2)
71 return !memcmp(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1));
75 mlxsw_sp_prefix_usage_none(struct mlxsw_sp_prefix_usage *prefix_usage)
77 struct mlxsw_sp_prefix_usage prefix_usage_none = {{ 0 } };
79 return mlxsw_sp_prefix_usage_eq(prefix_usage, &prefix_usage_none);
83 mlxsw_sp_prefix_usage_cpy(struct mlxsw_sp_prefix_usage *prefix_usage1,
84 struct mlxsw_sp_prefix_usage *prefix_usage2)
86 memcpy(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1));
90 mlxsw_sp_prefix_usage_zero(struct mlxsw_sp_prefix_usage *prefix_usage)
92 memset(prefix_usage, 0, sizeof(*prefix_usage));
96 mlxsw_sp_prefix_usage_set(struct mlxsw_sp_prefix_usage *prefix_usage,
97 unsigned char prefix_len)
99 set_bit(prefix_len, prefix_usage->b);
103 mlxsw_sp_prefix_usage_clear(struct mlxsw_sp_prefix_usage *prefix_usage,
104 unsigned char prefix_len)
106 clear_bit(prefix_len, prefix_usage->b);
109 struct mlxsw_sp_fib_key {
110 unsigned char addr[sizeof(struct in6_addr)];
111 unsigned char prefix_len;
114 enum mlxsw_sp_fib_entry_type {
115 MLXSW_SP_FIB_ENTRY_TYPE_REMOTE,
116 MLXSW_SP_FIB_ENTRY_TYPE_LOCAL,
117 MLXSW_SP_FIB_ENTRY_TYPE_TRAP,
120 struct mlxsw_sp_nexthop_group;
122 struct mlxsw_sp_fib_entry {
123 struct rhash_head ht_node;
124 struct mlxsw_sp_fib_key key;
125 enum mlxsw_sp_fib_entry_type type;
127 u16 rif; /* used for action local */
128 struct mlxsw_sp_vr *vr;
129 struct list_head nexthop_group_node;
130 struct mlxsw_sp_nexthop_group *nh_group;
133 struct mlxsw_sp_fib {
134 struct rhashtable ht;
135 unsigned long prefix_ref_count[MLXSW_SP_PREFIX_COUNT];
136 struct mlxsw_sp_prefix_usage prefix_usage;
139 static const struct rhashtable_params mlxsw_sp_fib_ht_params = {
140 .key_offset = offsetof(struct mlxsw_sp_fib_entry, key),
141 .head_offset = offsetof(struct mlxsw_sp_fib_entry, ht_node),
142 .key_len = sizeof(struct mlxsw_sp_fib_key),
143 .automatic_shrinking = true,
146 static int mlxsw_sp_fib_entry_insert(struct mlxsw_sp_fib *fib,
147 struct mlxsw_sp_fib_entry *fib_entry)
149 unsigned char prefix_len = fib_entry->key.prefix_len;
152 err = rhashtable_insert_fast(&fib->ht, &fib_entry->ht_node,
153 mlxsw_sp_fib_ht_params);
156 if (fib->prefix_ref_count[prefix_len]++ == 0)
157 mlxsw_sp_prefix_usage_set(&fib->prefix_usage, prefix_len);
161 static void mlxsw_sp_fib_entry_remove(struct mlxsw_sp_fib *fib,
162 struct mlxsw_sp_fib_entry *fib_entry)
164 unsigned char prefix_len = fib_entry->key.prefix_len;
166 if (--fib->prefix_ref_count[prefix_len] == 0)
167 mlxsw_sp_prefix_usage_clear(&fib->prefix_usage, prefix_len);
168 rhashtable_remove_fast(&fib->ht, &fib_entry->ht_node,
169 mlxsw_sp_fib_ht_params);
172 static struct mlxsw_sp_fib_entry *
173 mlxsw_sp_fib_entry_create(struct mlxsw_sp_fib *fib, const void *addr,
174 size_t addr_len, unsigned char prefix_len)
176 struct mlxsw_sp_fib_entry *fib_entry;
178 fib_entry = kzalloc(sizeof(*fib_entry), GFP_KERNEL);
181 memcpy(fib_entry->key.addr, addr, addr_len);
182 fib_entry->key.prefix_len = prefix_len;
186 static void mlxsw_sp_fib_entry_destroy(struct mlxsw_sp_fib_entry *fib_entry)
191 static struct mlxsw_sp_fib_entry *
192 mlxsw_sp_fib_entry_lookup(struct mlxsw_sp_fib *fib, const void *addr,
193 size_t addr_len, unsigned char prefix_len)
195 struct mlxsw_sp_fib_key key = {{ 0 } };
197 memcpy(key.addr, addr, addr_len);
198 key.prefix_len = prefix_len;
199 return rhashtable_lookup_fast(&fib->ht, &key, mlxsw_sp_fib_ht_params);
202 static struct mlxsw_sp_fib *mlxsw_sp_fib_create(void)
204 struct mlxsw_sp_fib *fib;
207 fib = kzalloc(sizeof(*fib), GFP_KERNEL);
209 return ERR_PTR(-ENOMEM);
210 err = rhashtable_init(&fib->ht, &mlxsw_sp_fib_ht_params);
212 goto err_rhashtable_init;
220 static void mlxsw_sp_fib_destroy(struct mlxsw_sp_fib *fib)
222 rhashtable_destroy(&fib->ht);
226 static struct mlxsw_sp_lpm_tree *
227 mlxsw_sp_lpm_tree_find_unused(struct mlxsw_sp *mlxsw_sp, bool one_reserved)
229 static struct mlxsw_sp_lpm_tree *lpm_tree;
232 for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) {
233 lpm_tree = &mlxsw_sp->router.lpm_trees[i];
234 if (lpm_tree->ref_count == 0) {
236 one_reserved = false;
244 static int mlxsw_sp_lpm_tree_alloc(struct mlxsw_sp *mlxsw_sp,
245 struct mlxsw_sp_lpm_tree *lpm_tree)
247 char ralta_pl[MLXSW_REG_RALTA_LEN];
249 mlxsw_reg_ralta_pack(ralta_pl, true, lpm_tree->proto, lpm_tree->id);
250 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl);
253 static int mlxsw_sp_lpm_tree_free(struct mlxsw_sp *mlxsw_sp,
254 struct mlxsw_sp_lpm_tree *lpm_tree)
256 char ralta_pl[MLXSW_REG_RALTA_LEN];
258 mlxsw_reg_ralta_pack(ralta_pl, false, lpm_tree->proto, lpm_tree->id);
259 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl);
263 mlxsw_sp_lpm_tree_left_struct_set(struct mlxsw_sp *mlxsw_sp,
264 struct mlxsw_sp_prefix_usage *prefix_usage,
265 struct mlxsw_sp_lpm_tree *lpm_tree)
267 char ralst_pl[MLXSW_REG_RALST_LEN];
270 u8 last_prefix = MLXSW_REG_RALST_BIN_NO_CHILD;
272 mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage)
275 mlxsw_reg_ralst_pack(ralst_pl, root_bin, lpm_tree->id);
276 mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) {
279 mlxsw_reg_ralst_bin_pack(ralst_pl, prefix, last_prefix,
280 MLXSW_REG_RALST_BIN_NO_CHILD);
281 last_prefix = prefix;
283 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl);
286 static struct mlxsw_sp_lpm_tree *
287 mlxsw_sp_lpm_tree_create(struct mlxsw_sp *mlxsw_sp,
288 struct mlxsw_sp_prefix_usage *prefix_usage,
289 enum mlxsw_sp_l3proto proto, bool one_reserved)
291 struct mlxsw_sp_lpm_tree *lpm_tree;
294 lpm_tree = mlxsw_sp_lpm_tree_find_unused(mlxsw_sp, one_reserved);
296 return ERR_PTR(-EBUSY);
297 lpm_tree->proto = proto;
298 err = mlxsw_sp_lpm_tree_alloc(mlxsw_sp, lpm_tree);
302 err = mlxsw_sp_lpm_tree_left_struct_set(mlxsw_sp, prefix_usage,
305 goto err_left_struct_set;
309 mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree);
313 static int mlxsw_sp_lpm_tree_destroy(struct mlxsw_sp *mlxsw_sp,
314 struct mlxsw_sp_lpm_tree *lpm_tree)
316 return mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree);
319 static struct mlxsw_sp_lpm_tree *
320 mlxsw_sp_lpm_tree_get(struct mlxsw_sp *mlxsw_sp,
321 struct mlxsw_sp_prefix_usage *prefix_usage,
322 enum mlxsw_sp_l3proto proto, bool one_reserved)
324 struct mlxsw_sp_lpm_tree *lpm_tree;
327 for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) {
328 lpm_tree = &mlxsw_sp->router.lpm_trees[i];
329 if (lpm_tree->proto == proto &&
330 mlxsw_sp_prefix_usage_eq(&lpm_tree->prefix_usage,
334 lpm_tree = mlxsw_sp_lpm_tree_create(mlxsw_sp, prefix_usage,
335 proto, one_reserved);
336 if (IS_ERR(lpm_tree))
340 lpm_tree->ref_count++;
344 static int mlxsw_sp_lpm_tree_put(struct mlxsw_sp *mlxsw_sp,
345 struct mlxsw_sp_lpm_tree *lpm_tree)
347 if (--lpm_tree->ref_count == 0)
348 return mlxsw_sp_lpm_tree_destroy(mlxsw_sp, lpm_tree);
352 static void mlxsw_sp_lpm_init(struct mlxsw_sp *mlxsw_sp)
354 struct mlxsw_sp_lpm_tree *lpm_tree;
357 for (i = 0; i < MLXSW_SP_LPM_TREE_COUNT; i++) {
358 lpm_tree = &mlxsw_sp->router.lpm_trees[i];
359 lpm_tree->id = i + MLXSW_SP_LPM_TREE_MIN;
363 static struct mlxsw_sp_vr *mlxsw_sp_vr_find_unused(struct mlxsw_sp *mlxsw_sp)
365 struct mlxsw_sp_vr *vr;
368 for (i = 0; i < MLXSW_SP_VIRTUAL_ROUTER_MAX; i++) {
369 vr = &mlxsw_sp->router.vrs[i];
376 static int mlxsw_sp_vr_lpm_tree_bind(struct mlxsw_sp *mlxsw_sp,
377 struct mlxsw_sp_vr *vr)
379 char raltb_pl[MLXSW_REG_RALTB_LEN];
381 mlxsw_reg_raltb_pack(raltb_pl, vr->id, vr->proto, vr->lpm_tree->id);
382 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl);
385 static int mlxsw_sp_vr_lpm_tree_unbind(struct mlxsw_sp *mlxsw_sp,
386 struct mlxsw_sp_vr *vr)
388 char raltb_pl[MLXSW_REG_RALTB_LEN];
390 /* Bind to tree 0 which is default */
391 mlxsw_reg_raltb_pack(raltb_pl, vr->id, vr->proto, 0);
392 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl);
395 static u32 mlxsw_sp_fix_tb_id(u32 tb_id)
397 /* For our purpose, squash main and local table into one */
398 if (tb_id == RT_TABLE_LOCAL)
399 tb_id = RT_TABLE_MAIN;
403 static struct mlxsw_sp_vr *mlxsw_sp_vr_find(struct mlxsw_sp *mlxsw_sp,
405 enum mlxsw_sp_l3proto proto)
407 struct mlxsw_sp_vr *vr;
410 tb_id = mlxsw_sp_fix_tb_id(tb_id);
411 for (i = 0; i < MLXSW_SP_VIRTUAL_ROUTER_MAX; i++) {
412 vr = &mlxsw_sp->router.vrs[i];
413 if (vr->used && vr->proto == proto && vr->tb_id == tb_id)
419 static struct mlxsw_sp_vr *mlxsw_sp_vr_create(struct mlxsw_sp *mlxsw_sp,
420 unsigned char prefix_len,
422 enum mlxsw_sp_l3proto proto)
424 struct mlxsw_sp_prefix_usage req_prefix_usage;
425 struct mlxsw_sp_lpm_tree *lpm_tree;
426 struct mlxsw_sp_vr *vr;
429 vr = mlxsw_sp_vr_find_unused(mlxsw_sp);
431 return ERR_PTR(-EBUSY);
432 vr->fib = mlxsw_sp_fib_create();
434 return ERR_CAST(vr->fib);
438 mlxsw_sp_prefix_usage_zero(&req_prefix_usage);
439 mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len);
440 lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, &req_prefix_usage,
442 if (IS_ERR(lpm_tree)) {
443 err = PTR_ERR(lpm_tree);
446 vr->lpm_tree = lpm_tree;
447 err = mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr);
455 mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree);
457 mlxsw_sp_fib_destroy(vr->fib);
462 static void mlxsw_sp_vr_destroy(struct mlxsw_sp *mlxsw_sp,
463 struct mlxsw_sp_vr *vr)
465 mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr);
466 mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree);
467 mlxsw_sp_fib_destroy(vr->fib);
472 mlxsw_sp_vr_lpm_tree_check(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr,
473 struct mlxsw_sp_prefix_usage *req_prefix_usage)
475 struct mlxsw_sp_lpm_tree *lpm_tree;
477 if (mlxsw_sp_prefix_usage_eq(req_prefix_usage,
478 &vr->lpm_tree->prefix_usage))
481 lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, req_prefix_usage,
483 if (IS_ERR(lpm_tree)) {
484 /* We failed to get a tree according to the required
485 * prefix usage. However, the current tree might be still good
486 * for us if our requirement is subset of the prefixes used
489 if (mlxsw_sp_prefix_usage_subset(req_prefix_usage,
490 &vr->lpm_tree->prefix_usage))
492 return PTR_ERR(lpm_tree);
495 mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, vr);
496 mlxsw_sp_lpm_tree_put(mlxsw_sp, vr->lpm_tree);
497 vr->lpm_tree = lpm_tree;
498 return mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, vr);
501 static struct mlxsw_sp_vr *mlxsw_sp_vr_get(struct mlxsw_sp *mlxsw_sp,
502 unsigned char prefix_len,
504 enum mlxsw_sp_l3proto proto)
506 struct mlxsw_sp_vr *vr;
509 tb_id = mlxsw_sp_fix_tb_id(tb_id);
510 vr = mlxsw_sp_vr_find(mlxsw_sp, tb_id, proto);
512 vr = mlxsw_sp_vr_create(mlxsw_sp, prefix_len, tb_id, proto);
516 struct mlxsw_sp_prefix_usage req_prefix_usage;
518 mlxsw_sp_prefix_usage_cpy(&req_prefix_usage,
519 &vr->fib->prefix_usage);
520 mlxsw_sp_prefix_usage_set(&req_prefix_usage, prefix_len);
521 /* Need to replace LPM tree in case new prefix is required. */
522 err = mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr,
530 static void mlxsw_sp_vr_put(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_vr *vr)
532 /* Destroy virtual router entity in case the associated FIB is empty
533 * and allow it to be used for other tables in future. Otherwise,
534 * check if some prefix usage did not disappear and change tree if
535 * that is the case. Note that in case new, smaller tree cannot be
536 * allocated, the original one will be kept being used.
538 if (mlxsw_sp_prefix_usage_none(&vr->fib->prefix_usage))
539 mlxsw_sp_vr_destroy(mlxsw_sp, vr);
541 mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, vr,
542 &vr->fib->prefix_usage);
545 static void mlxsw_sp_vrs_init(struct mlxsw_sp *mlxsw_sp)
547 struct mlxsw_sp_vr *vr;
550 for (i = 0; i < MLXSW_SP_VIRTUAL_ROUTER_MAX; i++) {
551 vr = &mlxsw_sp->router.vrs[i];
556 struct mlxsw_sp_neigh_key {
557 unsigned char addr[sizeof(struct in6_addr)];
558 struct net_device *dev;
561 struct mlxsw_sp_neigh_entry {
562 struct rhash_head ht_node;
563 struct mlxsw_sp_neigh_key key;
567 struct delayed_work dw;
568 struct mlxsw_sp_port *mlxsw_sp_port;
569 unsigned char ha[ETH_ALEN];
570 struct list_head nexthop_list; /* list of nexthops using
573 struct list_head nexthop_neighs_list_node;
576 static const struct rhashtable_params mlxsw_sp_neigh_ht_params = {
577 .key_offset = offsetof(struct mlxsw_sp_neigh_entry, key),
578 .head_offset = offsetof(struct mlxsw_sp_neigh_entry, ht_node),
579 .key_len = sizeof(struct mlxsw_sp_neigh_key),
583 mlxsw_sp_neigh_entry_insert(struct mlxsw_sp *mlxsw_sp,
584 struct mlxsw_sp_neigh_entry *neigh_entry)
586 return rhashtable_insert_fast(&mlxsw_sp->router.neigh_ht,
587 &neigh_entry->ht_node,
588 mlxsw_sp_neigh_ht_params);
592 mlxsw_sp_neigh_entry_remove(struct mlxsw_sp *mlxsw_sp,
593 struct mlxsw_sp_neigh_entry *neigh_entry)
595 rhashtable_remove_fast(&mlxsw_sp->router.neigh_ht,
596 &neigh_entry->ht_node,
597 mlxsw_sp_neigh_ht_params);
600 static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work);
602 static struct mlxsw_sp_neigh_entry *
603 mlxsw_sp_neigh_entry_create(const void *addr, size_t addr_len,
604 struct net_device *dev, u16 rif,
607 struct mlxsw_sp_neigh_entry *neigh_entry;
609 neigh_entry = kzalloc(sizeof(*neigh_entry), GFP_ATOMIC);
612 memcpy(neigh_entry->key.addr, addr, addr_len);
613 neigh_entry->key.dev = dev;
614 neigh_entry->rif = rif;
616 INIT_DELAYED_WORK(&neigh_entry->dw, mlxsw_sp_router_neigh_update_hw);
617 INIT_LIST_HEAD(&neigh_entry->nexthop_list);
622 mlxsw_sp_neigh_entry_destroy(struct mlxsw_sp_neigh_entry *neigh_entry)
627 static struct mlxsw_sp_neigh_entry *
628 mlxsw_sp_neigh_entry_lookup(struct mlxsw_sp *mlxsw_sp, const void *addr,
629 size_t addr_len, struct net_device *dev)
631 struct mlxsw_sp_neigh_key key = {{ 0 } };
633 memcpy(key.addr, addr, addr_len);
635 return rhashtable_lookup_fast(&mlxsw_sp->router.neigh_ht,
636 &key, mlxsw_sp_neigh_ht_params);
639 int mlxsw_sp_router_neigh_construct(struct net_device *dev,
642 struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev);
643 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
644 struct mlxsw_sp_neigh_entry *neigh_entry;
645 struct mlxsw_sp_rif *r;
649 if (n->tbl != &arp_tbl)
652 dip = ntohl(*((__be32 *) n->primary_key));
653 neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &dip, sizeof(dip),
656 WARN_ON(neigh_entry->n != n);
660 r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, dev);
664 neigh_entry = mlxsw_sp_neigh_entry_create(&dip, sizeof(dip), n->dev,
668 err = mlxsw_sp_neigh_entry_insert(mlxsw_sp, neigh_entry);
670 goto err_neigh_entry_insert;
673 err_neigh_entry_insert:
674 mlxsw_sp_neigh_entry_destroy(neigh_entry);
678 void mlxsw_sp_router_neigh_destroy(struct net_device *dev,
681 struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(dev);
682 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
683 struct mlxsw_sp_neigh_entry *neigh_entry;
686 if (n->tbl != &arp_tbl)
689 dip = ntohl(*((__be32 *) n->primary_key));
690 neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &dip, sizeof(dip),
694 mlxsw_sp_neigh_entry_remove(mlxsw_sp, neigh_entry);
695 mlxsw_sp_neigh_entry_destroy(neigh_entry);
699 mlxsw_sp_router_neighs_update_interval_init(struct mlxsw_sp *mlxsw_sp)
701 unsigned long interval = NEIGH_VAR(&arp_tbl.parms, DELAY_PROBE_TIME);
703 mlxsw_sp->router.neighs_update.interval = jiffies_to_msecs(interval);
706 static void mlxsw_sp_router_neigh_ent_ipv4_process(struct mlxsw_sp *mlxsw_sp,
710 struct net_device *dev;
716 mlxsw_reg_rauhtd_ent_ipv4_unpack(rauhtd_pl, ent_index, &rif, &dip);
718 if (!mlxsw_sp->rifs[rif]) {
719 dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Incorrect RIF in neighbour entry\n");
724 dev = mlxsw_sp->rifs[rif]->dev;
725 n = neigh_lookup(&arp_tbl, &dipn, dev);
727 netdev_err(dev, "Failed to find matching neighbour for IP=%pI4h\n",
732 netdev_dbg(dev, "Updating neighbour with IP=%pI4h\n", &dip);
733 neigh_event_send(n, NULL);
737 static void mlxsw_sp_router_neigh_rec_ipv4_process(struct mlxsw_sp *mlxsw_sp,
744 num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl,
746 /* Hardware starts counting at 0, so add 1. */
749 /* Each record consists of several neighbour entries. */
750 for (i = 0; i < num_entries; i++) {
753 ent_index = rec_index * MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC + i;
754 mlxsw_sp_router_neigh_ent_ipv4_process(mlxsw_sp, rauhtd_pl,
760 static void mlxsw_sp_router_neigh_rec_process(struct mlxsw_sp *mlxsw_sp,
761 char *rauhtd_pl, int rec_index)
763 switch (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, rec_index)) {
764 case MLXSW_REG_RAUHTD_TYPE_IPV4:
765 mlxsw_sp_router_neigh_rec_ipv4_process(mlxsw_sp, rauhtd_pl,
768 case MLXSW_REG_RAUHTD_TYPE_IPV6:
774 static int mlxsw_sp_router_neighs_update_rauhtd(struct mlxsw_sp *mlxsw_sp)
780 rauhtd_pl = kmalloc(MLXSW_REG_RAUHTD_LEN, GFP_KERNEL);
784 /* Make sure the neighbour's netdev isn't removed in the
789 mlxsw_reg_rauhtd_pack(rauhtd_pl, MLXSW_REG_RAUHTD_TYPE_IPV4);
790 err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(rauhtd),
793 dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Failed to dump neighbour talbe\n");
796 num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl);
797 for (i = 0; i < num_rec; i++)
798 mlxsw_sp_router_neigh_rec_process(mlxsw_sp, rauhtd_pl,
807 static void mlxsw_sp_router_neighs_update_nh(struct mlxsw_sp *mlxsw_sp)
809 struct mlxsw_sp_neigh_entry *neigh_entry;
811 /* Take RTNL mutex here to prevent lists from changes */
813 list_for_each_entry(neigh_entry, &mlxsw_sp->router.nexthop_neighs_list,
814 nexthop_neighs_list_node) {
815 /* If this neigh have nexthops, make the kernel think this neigh
816 * is active regardless of the traffic.
818 if (!list_empty(&neigh_entry->nexthop_list))
819 neigh_event_send(neigh_entry->n, NULL);
825 mlxsw_sp_router_neighs_update_work_schedule(struct mlxsw_sp *mlxsw_sp)
827 unsigned long interval = mlxsw_sp->router.neighs_update.interval;
829 mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw,
830 msecs_to_jiffies(interval));
833 static void mlxsw_sp_router_neighs_update_work(struct work_struct *work)
835 struct mlxsw_sp *mlxsw_sp = container_of(work, struct mlxsw_sp,
836 router.neighs_update.dw.work);
839 err = mlxsw_sp_router_neighs_update_rauhtd(mlxsw_sp);
841 dev_err(mlxsw_sp->bus_info->dev, "Could not update kernel for neigh activity");
843 mlxsw_sp_router_neighs_update_nh(mlxsw_sp);
845 mlxsw_sp_router_neighs_update_work_schedule(mlxsw_sp);
849 mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp,
850 struct mlxsw_sp_neigh_entry *neigh_entry,
853 static void mlxsw_sp_router_neigh_update_hw(struct work_struct *work)
855 struct mlxsw_sp_neigh_entry *neigh_entry =
856 container_of(work, struct mlxsw_sp_neigh_entry, dw.work);
857 struct neighbour *n = neigh_entry->n;
858 struct mlxsw_sp_port *mlxsw_sp_port = neigh_entry->mlxsw_sp_port;
859 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
860 char rauht_pl[MLXSW_REG_RAUHT_LEN];
861 struct net_device *dev;
862 bool entry_connected;
870 read_lock_bh(&n->lock);
871 dip = ntohl(*((__be32 *) n->primary_key));
872 memcpy(neigh_entry->ha, n->ha, sizeof(neigh_entry->ha));
873 nud_state = n->nud_state;
875 read_unlock_bh(&n->lock);
877 entry_connected = nud_state & NUD_VALID;
878 adding = (!neigh_entry->offloaded) && entry_connected;
879 updating = neigh_entry->offloaded && entry_connected;
880 removing = neigh_entry->offloaded && !entry_connected;
882 if (adding || updating) {
883 mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_ADD,
885 neigh_entry->ha, dip);
886 err = mlxsw_reg_write(mlxsw_sp->core,
887 MLXSW_REG(rauht), rauht_pl);
889 netdev_err(dev, "Could not add neigh %pI4h\n", &dip);
890 neigh_entry->offloaded = false;
892 neigh_entry->offloaded = true;
894 mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, false);
895 } else if (removing) {
896 mlxsw_reg_rauht_pack4(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_DELETE,
898 neigh_entry->ha, dip);
899 err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rauht),
902 netdev_err(dev, "Could not delete neigh %pI4h\n", &dip);
903 neigh_entry->offloaded = true;
905 neigh_entry->offloaded = false;
907 mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, true);
911 mlxsw_sp_port_dev_put(mlxsw_sp_port);
914 static int mlxsw_sp_router_netevent_event(struct notifier_block *unused,
915 unsigned long event, void *ptr)
917 struct mlxsw_sp_neigh_entry *neigh_entry;
918 struct mlxsw_sp_port *mlxsw_sp_port;
919 struct mlxsw_sp *mlxsw_sp;
920 unsigned long interval;
921 struct net_device *dev;
922 struct neigh_parms *p;
927 case NETEVENT_DELAY_PROBE_TIME_UPDATE:
930 /* We don't care about changes in the default table. */
931 if (!p->dev || p->tbl != &arp_tbl)
934 /* We are in atomic context and can't take RTNL mutex,
935 * so use RCU variant to walk the device chain.
937 mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(p->dev);
941 mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
942 interval = jiffies_to_msecs(NEIGH_VAR(p, DELAY_PROBE_TIME));
943 mlxsw_sp->router.neighs_update.interval = interval;
945 mlxsw_sp_port_dev_put(mlxsw_sp_port);
947 case NETEVENT_NEIGH_UPDATE:
951 if (n->tbl != &arp_tbl)
954 mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(dev);
958 mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
959 dip = ntohl(*((__be32 *) n->primary_key));
960 neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp,
964 if (WARN_ON(!neigh_entry) || WARN_ON(neigh_entry->n != n)) {
965 mlxsw_sp_port_dev_put(mlxsw_sp_port);
968 neigh_entry->mlxsw_sp_port = mlxsw_sp_port;
970 /* Take a reference to ensure the neighbour won't be
971 * destructed until we drop the reference in delayed
975 if (!mlxsw_core_schedule_dw(&neigh_entry->dw, 0)) {
977 mlxsw_sp_port_dev_put(mlxsw_sp_port);
985 static struct notifier_block mlxsw_sp_router_netevent_nb __read_mostly = {
986 .notifier_call = mlxsw_sp_router_netevent_event,
989 static int mlxsw_sp_neigh_init(struct mlxsw_sp *mlxsw_sp)
993 err = rhashtable_init(&mlxsw_sp->router.neigh_ht,
994 &mlxsw_sp_neigh_ht_params);
998 /* Initialize the polling interval according to the default
1001 mlxsw_sp_router_neighs_update_interval_init(mlxsw_sp);
1003 err = register_netevent_notifier(&mlxsw_sp_router_netevent_nb);
1005 goto err_register_netevent_notifier;
1007 INIT_DELAYED_WORK(&mlxsw_sp->router.neighs_update.dw,
1008 mlxsw_sp_router_neighs_update_work);
1009 mlxsw_core_schedule_dw(&mlxsw_sp->router.neighs_update.dw, 0);
1013 err_register_netevent_notifier:
1014 rhashtable_destroy(&mlxsw_sp->router.neigh_ht);
1018 static void mlxsw_sp_neigh_fini(struct mlxsw_sp *mlxsw_sp)
1020 cancel_delayed_work_sync(&mlxsw_sp->router.neighs_update.dw);
1021 unregister_netevent_notifier(&mlxsw_sp_router_netevent_nb);
1022 rhashtable_destroy(&mlxsw_sp->router.neigh_ht);
1025 struct mlxsw_sp_nexthop {
1026 struct list_head neigh_list_node; /* member of neigh entry list */
1027 struct mlxsw_sp_nexthop_group *nh_grp; /* pointer back to the group
1030 u8 should_offload:1, /* set indicates this neigh is connected and
1031 * should be put to KVD linear area of this group.
1033 offloaded:1, /* set in case the neigh is actually put into
1034 * KVD linear area of this group.
1036 update:1; /* set indicates that MAC of this neigh should be
1039 struct mlxsw_sp_neigh_entry *neigh_entry;
1042 struct mlxsw_sp_nexthop_group {
1043 struct list_head list; /* node in mlxsw->router.nexthop_group_list */
1044 struct list_head fib_list; /* list of fib entries that use this group */
1045 u8 adj_index_valid:1;
1049 struct mlxsw_sp_nexthop nexthops[0];
1052 static int mlxsw_sp_adj_index_mass_update_vr(struct mlxsw_sp *mlxsw_sp,
1053 struct mlxsw_sp_vr *vr,
1054 u32 adj_index, u16 ecmp_size,
1058 char raleu_pl[MLXSW_REG_RALEU_LEN];
1060 mlxsw_reg_raleu_pack(raleu_pl, vr->proto, vr->id,
1061 adj_index, ecmp_size,
1062 new_adj_index, new_ecmp_size);
1063 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raleu), raleu_pl);
1066 static int mlxsw_sp_adj_index_mass_update(struct mlxsw_sp *mlxsw_sp,
1067 struct mlxsw_sp_nexthop_group *nh_grp,
1068 u32 old_adj_index, u16 old_ecmp_size)
1070 struct mlxsw_sp_fib_entry *fib_entry;
1071 struct mlxsw_sp_vr *vr = NULL;
1074 list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) {
1075 if (vr == fib_entry->vr)
1078 err = mlxsw_sp_adj_index_mass_update_vr(mlxsw_sp, vr,
1089 static int mlxsw_sp_nexthop_mac_update(struct mlxsw_sp *mlxsw_sp, u32 adj_index,
1090 struct mlxsw_sp_nexthop *nh)
1092 struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry;
1093 char ratr_pl[MLXSW_REG_RATR_LEN];
1095 mlxsw_reg_ratr_pack(ratr_pl, MLXSW_REG_RATR_OP_WRITE_WRITE_ENTRY,
1096 true, adj_index, neigh_entry->rif);
1097 mlxsw_reg_ratr_eth_entry_pack(ratr_pl, neigh_entry->ha);
1098 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ratr), ratr_pl);
1102 mlxsw_sp_nexthop_group_mac_update(struct mlxsw_sp *mlxsw_sp,
1103 struct mlxsw_sp_nexthop_group *nh_grp)
1105 u32 adj_index = nh_grp->adj_index; /* base */
1106 struct mlxsw_sp_nexthop *nh;
1110 for (i = 0; i < nh_grp->count; i++) {
1111 nh = &nh_grp->nexthops[i];
1113 if (!nh->should_offload) {
1119 err = mlxsw_sp_nexthop_mac_update(mlxsw_sp,
1131 static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp,
1132 struct mlxsw_sp_fib_entry *fib_entry);
1135 mlxsw_sp_nexthop_fib_entries_update(struct mlxsw_sp *mlxsw_sp,
1136 struct mlxsw_sp_nexthop_group *nh_grp)
1138 struct mlxsw_sp_fib_entry *fib_entry;
1141 list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) {
1142 err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry);
1150 mlxsw_sp_nexthop_group_refresh(struct mlxsw_sp *mlxsw_sp,
1151 struct mlxsw_sp_nexthop_group *nh_grp)
1153 struct mlxsw_sp_nexthop *nh;
1154 bool offload_change = false;
1157 bool old_adj_index_valid;
1164 for (i = 0; i < nh_grp->count; i++) {
1165 nh = &nh_grp->nexthops[i];
1167 if (nh->should_offload ^ nh->offloaded) {
1168 offload_change = true;
1169 if (nh->should_offload)
1172 if (nh->should_offload)
1175 if (!offload_change) {
1176 /* Nothing was added or removed, so no need to reallocate. Just
1177 * update MAC on existing adjacency indexes.
1179 err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp);
1181 dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n");
1187 /* No neigh of this group is connected so we just set
1188 * the trap and let everthing flow through kernel.
1192 ret = mlxsw_sp_kvdl_alloc(mlxsw_sp, ecmp_size);
1194 /* We ran out of KVD linear space, just set the
1195 * trap and let everything flow through kernel.
1197 dev_warn(mlxsw_sp->bus_info->dev, "Failed to allocate KVD linear area for nexthop group.\n");
1201 old_adj_index_valid = nh_grp->adj_index_valid;
1202 old_adj_index = nh_grp->adj_index;
1203 old_ecmp_size = nh_grp->ecmp_size;
1204 nh_grp->adj_index_valid = 1;
1205 nh_grp->adj_index = adj_index;
1206 nh_grp->ecmp_size = ecmp_size;
1207 err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp);
1209 dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n");
1213 if (!old_adj_index_valid) {
1214 /* The trap was set for fib entries, so we have to call
1215 * fib entry update to unset it and use adjacency index.
1217 err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp);
1219 dev_warn(mlxsw_sp->bus_info->dev, "Failed to add adjacency index to fib entries.\n");
1225 err = mlxsw_sp_adj_index_mass_update(mlxsw_sp, nh_grp,
1226 old_adj_index, old_ecmp_size);
1227 mlxsw_sp_kvdl_free(mlxsw_sp, old_adj_index);
1229 dev_warn(mlxsw_sp->bus_info->dev, "Failed to mass-update adjacency index for nexthop group.\n");
1235 old_adj_index_valid = nh_grp->adj_index_valid;
1236 nh_grp->adj_index_valid = 0;
1237 for (i = 0; i < nh_grp->count; i++) {
1238 nh = &nh_grp->nexthops[i];
1241 err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp);
1243 dev_warn(mlxsw_sp->bus_info->dev, "Failed to set traps for fib entries.\n");
1244 if (old_adj_index_valid)
1245 mlxsw_sp_kvdl_free(mlxsw_sp, nh_grp->adj_index);
1248 static void __mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp_nexthop *nh,
1251 if (!removing && !nh->should_offload)
1252 nh->should_offload = 1;
1253 else if (removing && nh->offloaded)
1254 nh->should_offload = 0;
1259 mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp,
1260 struct mlxsw_sp_neigh_entry *neigh_entry,
1263 struct mlxsw_sp_nexthop *nh;
1265 /* Take RTNL mutex here to prevent lists from changes */
1267 list_for_each_entry(nh, &neigh_entry->nexthop_list,
1269 __mlxsw_sp_nexthop_neigh_update(nh, removing);
1270 mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp);
1275 static int mlxsw_sp_nexthop_init(struct mlxsw_sp *mlxsw_sp,
1276 struct mlxsw_sp_nexthop_group *nh_grp,
1277 struct mlxsw_sp_nexthop *nh,
1278 struct fib_nh *fib_nh)
1280 struct mlxsw_sp_neigh_entry *neigh_entry;
1281 u32 gwip = ntohl(fib_nh->nh_gw);
1282 struct net_device *dev = fib_nh->nh_dev;
1283 struct neighbour *n;
1286 neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &gwip,
1289 __be32 gwipn = htonl(gwip);
1291 n = neigh_create(&arp_tbl, &gwipn, dev);
1294 neigh_event_send(n, NULL);
1295 neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, &gwip,
1302 /* Take a reference of neigh here ensuring that neigh would
1303 * not be detructed before the nexthop entry is finished.
1304 * The second branch takes the reference in neith_create()
1310 /* If that is the first nexthop connected to that neigh, add to
1311 * nexthop_neighs_list
1313 if (list_empty(&neigh_entry->nexthop_list))
1314 list_add_tail(&neigh_entry->nexthop_neighs_list_node,
1315 &mlxsw_sp->router.nexthop_neighs_list);
1317 nh->nh_grp = nh_grp;
1318 nh->neigh_entry = neigh_entry;
1319 list_add_tail(&nh->neigh_list_node, &neigh_entry->nexthop_list);
1320 read_lock_bh(&n->lock);
1321 nud_state = n->nud_state;
1322 read_unlock_bh(&n->lock);
1323 __mlxsw_sp_nexthop_neigh_update(nh, !(nud_state & NUD_VALID));
1328 static void mlxsw_sp_nexthop_fini(struct mlxsw_sp *mlxsw_sp,
1329 struct mlxsw_sp_nexthop *nh)
1331 struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry;
1333 list_del(&nh->neigh_list_node);
1335 /* If that is the last nexthop connected to that neigh, remove from
1336 * nexthop_neighs_list
1338 if (list_empty(&nh->neigh_entry->nexthop_list))
1339 list_del(&nh->neigh_entry->nexthop_neighs_list_node);
1341 neigh_release(neigh_entry->n);
1344 static struct mlxsw_sp_nexthop_group *
1345 mlxsw_sp_nexthop_group_create(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi)
1347 struct mlxsw_sp_nexthop_group *nh_grp;
1348 struct mlxsw_sp_nexthop *nh;
1349 struct fib_nh *fib_nh;
1354 alloc_size = sizeof(*nh_grp) +
1355 fi->fib_nhs * sizeof(struct mlxsw_sp_nexthop);
1356 nh_grp = kzalloc(alloc_size, GFP_KERNEL);
1358 return ERR_PTR(-ENOMEM);
1359 INIT_LIST_HEAD(&nh_grp->fib_list);
1360 nh_grp->count = fi->fib_nhs;
1361 for (i = 0; i < nh_grp->count; i++) {
1362 nh = &nh_grp->nexthops[i];
1363 fib_nh = &fi->fib_nh[i];
1364 err = mlxsw_sp_nexthop_init(mlxsw_sp, nh_grp, nh, fib_nh);
1366 goto err_nexthop_init;
1368 list_add_tail(&nh_grp->list, &mlxsw_sp->router.nexthop_group_list);
1369 mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh_grp);
1373 for (i--; i >= 0; i--)
1374 mlxsw_sp_nexthop_fini(mlxsw_sp, nh);
1376 return ERR_PTR(err);
1380 mlxsw_sp_nexthop_group_destroy(struct mlxsw_sp *mlxsw_sp,
1381 struct mlxsw_sp_nexthop_group *nh_grp)
1383 struct mlxsw_sp_nexthop *nh;
1386 list_del(&nh_grp->list);
1387 for (i = 0; i < nh_grp->count; i++) {
1388 nh = &nh_grp->nexthops[i];
1389 mlxsw_sp_nexthop_fini(mlxsw_sp, nh);
1394 static bool mlxsw_sp_nexthop_match(struct mlxsw_sp_nexthop *nh,
1395 struct fib_info *fi)
1399 for (i = 0; i < fi->fib_nhs; i++) {
1400 struct fib_nh *fib_nh = &fi->fib_nh[i];
1401 u32 gwip = ntohl(fib_nh->nh_gw);
1403 if (memcmp(nh->neigh_entry->key.addr,
1404 &gwip, sizeof(u32)) == 0 &&
1405 nh->neigh_entry->key.dev == fib_nh->nh_dev)
1411 static bool mlxsw_sp_nexthop_group_match(struct mlxsw_sp_nexthop_group *nh_grp,
1412 struct fib_info *fi)
1416 if (nh_grp->count != fi->fib_nhs)
1418 for (i = 0; i < nh_grp->count; i++) {
1419 struct mlxsw_sp_nexthop *nh = &nh_grp->nexthops[i];
1421 if (!mlxsw_sp_nexthop_match(nh, fi))
1427 static struct mlxsw_sp_nexthop_group *
1428 mlxsw_sp_nexthop_group_find(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi)
1430 struct mlxsw_sp_nexthop_group *nh_grp;
1432 list_for_each_entry(nh_grp, &mlxsw_sp->router.nexthop_group_list,
1434 if (mlxsw_sp_nexthop_group_match(nh_grp, fi))
1440 static int mlxsw_sp_nexthop_group_get(struct mlxsw_sp *mlxsw_sp,
1441 struct mlxsw_sp_fib_entry *fib_entry,
1442 struct fib_info *fi)
1444 struct mlxsw_sp_nexthop_group *nh_grp;
1446 nh_grp = mlxsw_sp_nexthop_group_find(mlxsw_sp, fi);
1448 nh_grp = mlxsw_sp_nexthop_group_create(mlxsw_sp, fi);
1450 return PTR_ERR(nh_grp);
1452 list_add_tail(&fib_entry->nexthop_group_node, &nh_grp->fib_list);
1453 fib_entry->nh_group = nh_grp;
1457 static void mlxsw_sp_nexthop_group_put(struct mlxsw_sp *mlxsw_sp,
1458 struct mlxsw_sp_fib_entry *fib_entry)
1460 struct mlxsw_sp_nexthop_group *nh_grp = fib_entry->nh_group;
1462 list_del(&fib_entry->nexthop_group_node);
1463 if (!list_empty(&nh_grp->fib_list))
1465 mlxsw_sp_nexthop_group_destroy(mlxsw_sp, nh_grp);
1468 static int __mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp)
1470 char rgcr_pl[MLXSW_REG_RGCR_LEN];
1472 mlxsw_reg_rgcr_pack(rgcr_pl, true);
1473 mlxsw_reg_rgcr_max_router_interfaces_set(rgcr_pl, MLXSW_SP_RIF_MAX);
1474 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl);
1477 static void __mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp)
1479 char rgcr_pl[MLXSW_REG_RGCR_LEN];
1481 mlxsw_reg_rgcr_pack(rgcr_pl, false);
1482 mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl);
1485 int mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp)
1489 INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_neighs_list);
1490 INIT_LIST_HEAD(&mlxsw_sp->router.nexthop_group_list);
1491 err = __mlxsw_sp_router_init(mlxsw_sp);
1494 mlxsw_sp_lpm_init(mlxsw_sp);
1495 mlxsw_sp_vrs_init(mlxsw_sp);
1496 return mlxsw_sp_neigh_init(mlxsw_sp);
1499 void mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp)
1501 mlxsw_sp_neigh_fini(mlxsw_sp);
1502 __mlxsw_sp_router_fini(mlxsw_sp);
1505 static int mlxsw_sp_fib_entry_op4_remote(struct mlxsw_sp *mlxsw_sp,
1506 struct mlxsw_sp_fib_entry *fib_entry,
1507 enum mlxsw_reg_ralue_op op)
1509 char ralue_pl[MLXSW_REG_RALUE_LEN];
1510 u32 *p_dip = (u32 *) fib_entry->key.addr;
1511 struct mlxsw_sp_vr *vr = fib_entry->vr;
1512 enum mlxsw_reg_ralue_trap_action trap_action;
1514 u32 adjacency_index = 0;
1517 /* In case the nexthop group adjacency index is valid, use it
1518 * with provided ECMP size. Otherwise, setup trap and pass
1519 * traffic to kernel.
1521 if (fib_entry->nh_group->adj_index_valid) {
1522 trap_action = MLXSW_REG_RALUE_TRAP_ACTION_NOP;
1523 adjacency_index = fib_entry->nh_group->adj_index;
1524 ecmp_size = fib_entry->nh_group->ecmp_size;
1526 trap_action = MLXSW_REG_RALUE_TRAP_ACTION_TRAP;
1527 trap_id = MLXSW_TRAP_ID_RTR_INGRESS0;
1530 mlxsw_reg_ralue_pack4(ralue_pl, vr->proto, op, vr->id,
1531 fib_entry->key.prefix_len, *p_dip);
1532 mlxsw_reg_ralue_act_remote_pack(ralue_pl, trap_action, trap_id,
1533 adjacency_index, ecmp_size);
1534 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
1537 static int mlxsw_sp_fib_entry_op4_local(struct mlxsw_sp *mlxsw_sp,
1538 struct mlxsw_sp_fib_entry *fib_entry,
1539 enum mlxsw_reg_ralue_op op)
1541 char ralue_pl[MLXSW_REG_RALUE_LEN];
1542 u32 *p_dip = (u32 *) fib_entry->key.addr;
1543 struct mlxsw_sp_vr *vr = fib_entry->vr;
1545 mlxsw_reg_ralue_pack4(ralue_pl, vr->proto, op, vr->id,
1546 fib_entry->key.prefix_len, *p_dip);
1547 mlxsw_reg_ralue_act_local_pack(ralue_pl,
1548 MLXSW_REG_RALUE_TRAP_ACTION_NOP, 0,
1550 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
1553 static int mlxsw_sp_fib_entry_op4_trap(struct mlxsw_sp *mlxsw_sp,
1554 struct mlxsw_sp_fib_entry *fib_entry,
1555 enum mlxsw_reg_ralue_op op)
1557 char ralue_pl[MLXSW_REG_RALUE_LEN];
1558 u32 *p_dip = (u32 *) fib_entry->key.addr;
1559 struct mlxsw_sp_vr *vr = fib_entry->vr;
1561 mlxsw_reg_ralue_pack4(ralue_pl, vr->proto, op, vr->id,
1562 fib_entry->key.prefix_len, *p_dip);
1563 mlxsw_reg_ralue_act_ip2me_pack(ralue_pl);
1564 return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
1567 static int mlxsw_sp_fib_entry_op4(struct mlxsw_sp *mlxsw_sp,
1568 struct mlxsw_sp_fib_entry *fib_entry,
1569 enum mlxsw_reg_ralue_op op)
1571 switch (fib_entry->type) {
1572 case MLXSW_SP_FIB_ENTRY_TYPE_REMOTE:
1573 return mlxsw_sp_fib_entry_op4_remote(mlxsw_sp, fib_entry, op);
1574 case MLXSW_SP_FIB_ENTRY_TYPE_LOCAL:
1575 return mlxsw_sp_fib_entry_op4_local(mlxsw_sp, fib_entry, op);
1576 case MLXSW_SP_FIB_ENTRY_TYPE_TRAP:
1577 return mlxsw_sp_fib_entry_op4_trap(mlxsw_sp, fib_entry, op);
1582 static int mlxsw_sp_fib_entry_op(struct mlxsw_sp *mlxsw_sp,
1583 struct mlxsw_sp_fib_entry *fib_entry,
1584 enum mlxsw_reg_ralue_op op)
1586 switch (fib_entry->vr->proto) {
1587 case MLXSW_SP_L3_PROTO_IPV4:
1588 return mlxsw_sp_fib_entry_op4(mlxsw_sp, fib_entry, op);
1589 case MLXSW_SP_L3_PROTO_IPV6:
1595 static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp,
1596 struct mlxsw_sp_fib_entry *fib_entry)
1598 enum mlxsw_reg_ralue_op op;
1600 op = !fib_entry->added ? MLXSW_REG_RALUE_OP_WRITE_WRITE :
1601 MLXSW_REG_RALUE_OP_WRITE_UPDATE;
1602 return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry, op);
1605 static int mlxsw_sp_fib_entry_del(struct mlxsw_sp *mlxsw_sp,
1606 struct mlxsw_sp_fib_entry *fib_entry)
1608 return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry,
1609 MLXSW_REG_RALUE_OP_WRITE_DELETE);
1612 struct mlxsw_sp_router_fib4_add_info {
1613 struct switchdev_trans_item tritem;
1614 struct mlxsw_sp *mlxsw_sp;
1615 struct mlxsw_sp_fib_entry *fib_entry;
1618 static void mlxsw_sp_router_fib4_add_info_destroy(void const *data)
1620 const struct mlxsw_sp_router_fib4_add_info *info = data;
1621 struct mlxsw_sp_fib_entry *fib_entry = info->fib_entry;
1622 struct mlxsw_sp *mlxsw_sp = info->mlxsw_sp;
1624 mlxsw_sp_fib_entry_destroy(fib_entry);
1625 mlxsw_sp_vr_put(mlxsw_sp, fib_entry->vr);
1630 mlxsw_sp_router_fib4_entry_init(struct mlxsw_sp *mlxsw_sp,
1631 const struct switchdev_obj_ipv4_fib *fib4,
1632 struct mlxsw_sp_fib_entry *fib_entry)
1634 struct fib_info *fi = fib4->fi;
1636 if (fib4->type == RTN_LOCAL || fib4->type == RTN_BROADCAST) {
1637 fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP;
1640 if (fib4->type != RTN_UNICAST)
1643 if (fi->fib_scope != RT_SCOPE_UNIVERSE) {
1644 struct mlxsw_sp_rif *r;
1646 fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_LOCAL;
1647 r = mlxsw_sp_rif_find_by_dev(mlxsw_sp, fi->fib_dev);
1650 fib_entry->rif = r->rif;
1653 fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_REMOTE;
1654 return mlxsw_sp_nexthop_group_get(mlxsw_sp, fib_entry, fi);
1658 mlxsw_sp_router_fib4_entry_fini(struct mlxsw_sp *mlxsw_sp,
1659 struct mlxsw_sp_fib_entry *fib_entry)
1661 if (fib_entry->type != MLXSW_SP_FIB_ENTRY_TYPE_REMOTE)
1663 mlxsw_sp_nexthop_group_put(mlxsw_sp, fib_entry);
1667 mlxsw_sp_router_fib4_add_prepare(struct mlxsw_sp_port *mlxsw_sp_port,
1668 const struct switchdev_obj_ipv4_fib *fib4,
1669 struct switchdev_trans *trans)
1671 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
1672 struct mlxsw_sp_router_fib4_add_info *info;
1673 struct mlxsw_sp_fib_entry *fib_entry;
1674 struct mlxsw_sp_vr *vr;
1677 vr = mlxsw_sp_vr_get(mlxsw_sp, fib4->dst_len, fib4->tb_id,
1678 MLXSW_SP_L3_PROTO_IPV4);
1682 fib_entry = mlxsw_sp_fib_entry_create(vr->fib, &fib4->dst,
1683 sizeof(fib4->dst), fib4->dst_len);
1686 goto err_fib_entry_create;
1690 err = mlxsw_sp_router_fib4_entry_init(mlxsw_sp, fib4, fib_entry);
1692 goto err_fib4_entry_init;
1694 info = kmalloc(sizeof(*info), GFP_KERNEL);
1697 goto err_alloc_info;
1699 info->mlxsw_sp = mlxsw_sp;
1700 info->fib_entry = fib_entry;
1701 switchdev_trans_item_enqueue(trans, info,
1702 mlxsw_sp_router_fib4_add_info_destroy,
1707 mlxsw_sp_router_fib4_entry_fini(mlxsw_sp, fib_entry);
1708 err_fib4_entry_init:
1709 mlxsw_sp_fib_entry_destroy(fib_entry);
1710 err_fib_entry_create:
1711 mlxsw_sp_vr_put(mlxsw_sp, vr);
1716 mlxsw_sp_router_fib4_add_commit(struct mlxsw_sp_port *mlxsw_sp_port,
1717 const struct switchdev_obj_ipv4_fib *fib4,
1718 struct switchdev_trans *trans)
1720 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
1721 struct mlxsw_sp_router_fib4_add_info *info;
1722 struct mlxsw_sp_fib_entry *fib_entry;
1723 struct mlxsw_sp_vr *vr;
1726 info = switchdev_trans_item_dequeue(trans);
1727 fib_entry = info->fib_entry;
1731 err = mlxsw_sp_fib_entry_insert(fib_entry->vr->fib, fib_entry);
1733 goto err_fib_entry_insert;
1734 err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry);
1736 goto err_fib_entry_add;
1740 mlxsw_sp_fib_entry_remove(vr->fib, fib_entry);
1741 err_fib_entry_insert:
1742 mlxsw_sp_router_fib4_entry_fini(mlxsw_sp, fib_entry);
1743 mlxsw_sp_fib_entry_destroy(fib_entry);
1744 mlxsw_sp_vr_put(mlxsw_sp, vr);
1748 int mlxsw_sp_router_fib4_add(struct mlxsw_sp_port *mlxsw_sp_port,
1749 const struct switchdev_obj_ipv4_fib *fib4,
1750 struct switchdev_trans *trans)
1752 if (switchdev_trans_ph_prepare(trans))
1753 return mlxsw_sp_router_fib4_add_prepare(mlxsw_sp_port,
1755 return mlxsw_sp_router_fib4_add_commit(mlxsw_sp_port,
1759 int mlxsw_sp_router_fib4_del(struct mlxsw_sp_port *mlxsw_sp_port,
1760 const struct switchdev_obj_ipv4_fib *fib4)
1762 struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
1763 struct mlxsw_sp_fib_entry *fib_entry;
1764 struct mlxsw_sp_vr *vr;
1766 vr = mlxsw_sp_vr_find(mlxsw_sp, fib4->tb_id, MLXSW_SP_L3_PROTO_IPV4);
1768 dev_warn(mlxsw_sp->bus_info->dev, "Failed to find virtual router for FIB4 entry being removed.\n");
1771 fib_entry = mlxsw_sp_fib_entry_lookup(vr->fib, &fib4->dst,
1772 sizeof(fib4->dst), fib4->dst_len);
1774 dev_warn(mlxsw_sp->bus_info->dev, "Failed to find FIB4 entry being removed.\n");
1777 mlxsw_sp_fib_entry_del(mlxsw_sp_port->mlxsw_sp, fib_entry);
1778 mlxsw_sp_fib_entry_remove(vr->fib, fib_entry);
1779 mlxsw_sp_router_fib4_entry_fini(mlxsw_sp, fib_entry);
1780 mlxsw_sp_fib_entry_destroy(fib_entry);
1781 mlxsw_sp_vr_put(mlxsw_sp, vr);