spectrum_router.c 98.2 KB
Newer Older
1 2 3 4 5
/*
 * drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c
 * Copyright (c) 2016 Mellanox Technologies. All rights reserved.
 * Copyright (c) 2016 Jiri Pirko <jiri@mellanox.com>
 * Copyright (c) 2016 Ido Schimmel <idosch@mellanox.com>
6
 * Copyright (c) 2016 Yotam Gigi <yotamg@mellanox.com>
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
 *
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include <linux/kernel.h>
#include <linux/types.h>
39 40 41
#include <linux/rhashtable.h>
#include <linux/bitops.h>
#include <linux/in6.h>
42
#include <linux/notifier.h>
43
#include <linux/inetdevice.h>
44
#include <linux/netdevice.h>
45
#include <linux/if_bridge.h>
46
#include <net/netevent.h>
47 48
#include <net/neighbour.h>
#include <net/arp.h>
49
#include <net/ip_fib.h>
50
#include <net/fib_rules.h>
51
#include <net/l3mdev.h>
52 53 54 55

#include "spectrum.h"
#include "core.h"
#include "reg.h"
56 57 58
#include "spectrum_cnt.h"
#include "spectrum_dpipe.h"
#include "spectrum_router.h"
59

60 61 62 63 64
struct mlxsw_sp_vr;
struct mlxsw_sp_lpm_tree;

struct mlxsw_sp_router {
	struct mlxsw_sp *mlxsw_sp;
65
	struct mlxsw_sp_rif **rifs;
66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
	struct mlxsw_sp_vr *vrs;
	struct rhashtable neigh_ht;
	struct rhashtable nexthop_group_ht;
	struct rhashtable nexthop_ht;
	struct {
		struct mlxsw_sp_lpm_tree *trees;
		unsigned int tree_count;
	} lpm;
	struct {
		struct delayed_work dw;
		unsigned long interval;	/* ms */
	} neighs_update;
	struct delayed_work nexthop_probe_dw;
#define MLXSW_SP_UNRESOLVED_NH_PROBE_INTERVAL 5000 /* ms */
	struct list_head nexthop_neighs_list;
	bool aborted;
82
	struct notifier_block fib_nb;
83 84
};

85 86 87 88 89 90 91
struct mlxsw_sp_rif {
	struct list_head nexthop_list;
	struct list_head neigh_list;
	struct net_device *dev;
	struct mlxsw_sp_fid *f;
	unsigned char addr[ETH_ALEN];
	int mtu;
92
	u16 rif_index;
93
	u16 vr_id;
94 95 96 97
	unsigned int counter_ingress;
	bool counter_ingress_valid;
	unsigned int counter_egress;
	bool counter_egress_valid;
98 99
};

100 101 102 103 104 105 106 107 108 109
struct mlxsw_sp_rif_subport {
	struct mlxsw_sp_rif common;
	union {
		u16 system_port;
		u16 lag_id;
	};
	u16 vid;
	bool lag;
};

110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
static unsigned int *
mlxsw_sp_rif_p_counter_get(struct mlxsw_sp_rif *rif,
			   enum mlxsw_sp_rif_counter_dir dir)
{
	switch (dir) {
	case MLXSW_SP_RIF_COUNTER_EGRESS:
		return &rif->counter_egress;
	case MLXSW_SP_RIF_COUNTER_INGRESS:
		return &rif->counter_ingress;
	}
	return NULL;
}

static bool
mlxsw_sp_rif_counter_valid_get(struct mlxsw_sp_rif *rif,
			       enum mlxsw_sp_rif_counter_dir dir)
{
	switch (dir) {
	case MLXSW_SP_RIF_COUNTER_EGRESS:
		return rif->counter_egress_valid;
	case MLXSW_SP_RIF_COUNTER_INGRESS:
		return rif->counter_ingress_valid;
	}
	return false;
}

static void
mlxsw_sp_rif_counter_valid_set(struct mlxsw_sp_rif *rif,
			       enum mlxsw_sp_rif_counter_dir dir,
			       bool valid)
{
	switch (dir) {
	case MLXSW_SP_RIF_COUNTER_EGRESS:
		rif->counter_egress_valid = valid;
		break;
	case MLXSW_SP_RIF_COUNTER_INGRESS:
		rif->counter_ingress_valid = valid;
		break;
	}
}

static int mlxsw_sp_rif_counter_edit(struct mlxsw_sp *mlxsw_sp, u16 rif_index,
				     unsigned int counter_index, bool enable,
				     enum mlxsw_sp_rif_counter_dir dir)
{
	char ritr_pl[MLXSW_REG_RITR_LEN];
	bool is_egress = false;
	int err;

	if (dir == MLXSW_SP_RIF_COUNTER_EGRESS)
		is_egress = true;
	mlxsw_reg_ritr_rif_pack(ritr_pl, rif_index);
	err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
	if (err)
		return err;

	mlxsw_reg_ritr_counter_pack(ritr_pl, counter_index, enable,
				    is_egress);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
}

int mlxsw_sp_rif_counter_value_get(struct mlxsw_sp *mlxsw_sp,
				   struct mlxsw_sp_rif *rif,
				   enum mlxsw_sp_rif_counter_dir dir, u64 *cnt)
{
	char ricnt_pl[MLXSW_REG_RICNT_LEN];
	unsigned int *p_counter_index;
	bool valid;
	int err;

	valid = mlxsw_sp_rif_counter_valid_get(rif, dir);
	if (!valid)
		return -EINVAL;

	p_counter_index = mlxsw_sp_rif_p_counter_get(rif, dir);
	if (!p_counter_index)
		return -EINVAL;
	mlxsw_reg_ricnt_pack(ricnt_pl, *p_counter_index,
			     MLXSW_REG_RICNT_OPCODE_NOP);
	err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(ricnt), ricnt_pl);
	if (err)
		return err;
	*cnt = mlxsw_reg_ricnt_good_unicast_packets_get(ricnt_pl);
	return 0;
}

static int mlxsw_sp_rif_counter_clear(struct mlxsw_sp *mlxsw_sp,
				      unsigned int counter_index)
{
	char ricnt_pl[MLXSW_REG_RICNT_LEN];

	mlxsw_reg_ricnt_pack(ricnt_pl, counter_index,
			     MLXSW_REG_RICNT_OPCODE_CLEAR);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ricnt), ricnt_pl);
}

int mlxsw_sp_rif_counter_alloc(struct mlxsw_sp *mlxsw_sp,
			       struct mlxsw_sp_rif *rif,
			       enum mlxsw_sp_rif_counter_dir dir)
{
	unsigned int *p_counter_index;
	int err;

	p_counter_index = mlxsw_sp_rif_p_counter_get(rif, dir);
	if (!p_counter_index)
		return -EINVAL;
	err = mlxsw_sp_counter_alloc(mlxsw_sp, MLXSW_SP_COUNTER_SUB_POOL_RIF,
				     p_counter_index);
	if (err)
		return err;

	err = mlxsw_sp_rif_counter_clear(mlxsw_sp, *p_counter_index);
	if (err)
		goto err_counter_clear;

	err = mlxsw_sp_rif_counter_edit(mlxsw_sp, rif->rif_index,
					*p_counter_index, true, dir);
	if (err)
		goto err_counter_edit;
	mlxsw_sp_rif_counter_valid_set(rif, dir, true);
	return 0;

err_counter_edit:
err_counter_clear:
	mlxsw_sp_counter_free(mlxsw_sp, MLXSW_SP_COUNTER_SUB_POOL_RIF,
			      *p_counter_index);
	return err;
}

void mlxsw_sp_rif_counter_free(struct mlxsw_sp *mlxsw_sp,
			       struct mlxsw_sp_rif *rif,
			       enum mlxsw_sp_rif_counter_dir dir)
{
	unsigned int *p_counter_index;

245 246 247
	if (!mlxsw_sp_rif_counter_valid_get(rif, dir))
		return;

248 249 250 251 252 253 254 255 256 257
	p_counter_index = mlxsw_sp_rif_p_counter_get(rif, dir);
	if (WARN_ON(!p_counter_index))
		return;
	mlxsw_sp_rif_counter_edit(mlxsw_sp, rif->rif_index,
				  *p_counter_index, false, dir);
	mlxsw_sp_counter_free(mlxsw_sp, MLXSW_SP_COUNTER_SUB_POOL_RIF,
			      *p_counter_index);
	mlxsw_sp_rif_counter_valid_set(rif, dir, false);
}

258 259 260 261
static struct mlxsw_sp_rif *
mlxsw_sp_rif_find_by_dev(const struct mlxsw_sp *mlxsw_sp,
			 const struct net_device *dev);

262 263 264 265 266 267
#define MLXSW_SP_PREFIX_COUNT (sizeof(struct in6_addr) * BITS_PER_BYTE)

struct mlxsw_sp_prefix_usage {
	DECLARE_BITMAP(b, MLXSW_SP_PREFIX_COUNT);
};

268 269 270
#define mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) \
	for_each_set_bit(prefix, (prefix_usage)->b, MLXSW_SP_PREFIX_COUNT)

271 272 273 274 275 276 277 278 279 280 281 282 283
static bool
mlxsw_sp_prefix_usage_subset(struct mlxsw_sp_prefix_usage *prefix_usage1,
			     struct mlxsw_sp_prefix_usage *prefix_usage2)
{
	unsigned char prefix;

	mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage1) {
		if (!test_bit(prefix, prefix_usage2->b))
			return false;
	}
	return true;
}

284 285 286 287 288 289 290
static bool
mlxsw_sp_prefix_usage_eq(struct mlxsw_sp_prefix_usage *prefix_usage1,
			 struct mlxsw_sp_prefix_usage *prefix_usage2)
{
	return !memcmp(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1));
}

291 292 293 294 295 296 297 298 299 300 301 302 303 304 305
static bool
mlxsw_sp_prefix_usage_none(struct mlxsw_sp_prefix_usage *prefix_usage)
{
	struct mlxsw_sp_prefix_usage prefix_usage_none = {{ 0 } };

	return mlxsw_sp_prefix_usage_eq(prefix_usage, &prefix_usage_none);
}

static void
mlxsw_sp_prefix_usage_cpy(struct mlxsw_sp_prefix_usage *prefix_usage1,
			  struct mlxsw_sp_prefix_usage *prefix_usage2)
{
	memcpy(prefix_usage1, prefix_usage2, sizeof(*prefix_usage1));
}

306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
static void
mlxsw_sp_prefix_usage_set(struct mlxsw_sp_prefix_usage *prefix_usage,
			  unsigned char prefix_len)
{
	set_bit(prefix_len, prefix_usage->b);
}

static void
mlxsw_sp_prefix_usage_clear(struct mlxsw_sp_prefix_usage *prefix_usage,
			    unsigned char prefix_len)
{
	clear_bit(prefix_len, prefix_usage->b);
}

struct mlxsw_sp_fib_key {
	unsigned char addr[sizeof(struct in6_addr)];
	unsigned char prefix_len;
};

325 326 327 328 329 330
enum mlxsw_sp_fib_entry_type {
	MLXSW_SP_FIB_ENTRY_TYPE_REMOTE,
	MLXSW_SP_FIB_ENTRY_TYPE_LOCAL,
	MLXSW_SP_FIB_ENTRY_TYPE_TRAP,
};

331
struct mlxsw_sp_nexthop_group;
332
struct mlxsw_sp_fib;
333

334 335
struct mlxsw_sp_fib_node {
	struct list_head entry_list;
336
	struct list_head list;
337
	struct rhash_head ht_node;
338
	struct mlxsw_sp_fib *fib;
339
	struct mlxsw_sp_fib_key key;
340 341 342 343 344 345 346 347 348 349 350 351
};

struct mlxsw_sp_fib_entry_params {
	u32 tb_id;
	u32 prio;
	u8 tos;
	u8 type;
};

struct mlxsw_sp_fib_entry {
	struct list_head list;
	struct mlxsw_sp_fib_node *fib_node;
352
	enum mlxsw_sp_fib_entry_type type;
353 354
	struct list_head nexthop_group_node;
	struct mlxsw_sp_nexthop_group *nh_group;
355
	struct mlxsw_sp_fib_entry_params params;
356
	bool offloaded;
357 358
};

359 360 361 362 363 364 365 366 367 368 369 370
enum mlxsw_sp_l3proto {
	MLXSW_SP_L3_PROTO_IPV4,
	MLXSW_SP_L3_PROTO_IPV6,
};

struct mlxsw_sp_lpm_tree {
	u8 id; /* tree ID */
	unsigned int ref_count;
	enum mlxsw_sp_l3proto proto;
	struct mlxsw_sp_prefix_usage prefix_usage;
};

371 372
struct mlxsw_sp_fib {
	struct rhashtable ht;
373
	struct list_head node_list;
374 375
	struct mlxsw_sp_vr *vr;
	struct mlxsw_sp_lpm_tree *lpm_tree;
376 377
	unsigned long prefix_ref_count[MLXSW_SP_PREFIX_COUNT];
	struct mlxsw_sp_prefix_usage prefix_usage;
378
	enum mlxsw_sp_l3proto proto;
379 380
};

381 382 383 384 385 386 387
struct mlxsw_sp_vr {
	u16 id; /* virtual router ID */
	u32 tb_id; /* kernel fib table id */
	unsigned int rif_count;
	struct mlxsw_sp_fib *fib4;
};

388
static const struct rhashtable_params mlxsw_sp_fib_ht_params;
389

390 391
static struct mlxsw_sp_fib *mlxsw_sp_fib_create(struct mlxsw_sp_vr *vr,
						enum mlxsw_sp_l3proto proto)
392 393 394 395 396 397 398 399 400 401
{
	struct mlxsw_sp_fib *fib;
	int err;

	fib = kzalloc(sizeof(*fib), GFP_KERNEL);
	if (!fib)
		return ERR_PTR(-ENOMEM);
	err = rhashtable_init(&fib->ht, &mlxsw_sp_fib_ht_params);
	if (err)
		goto err_rhashtable_init;
402
	INIT_LIST_HEAD(&fib->node_list);
403 404
	fib->proto = proto;
	fib->vr = vr;
405 406 407 408 409 410 411 412 413
	return fib;

err_rhashtable_init:
	kfree(fib);
	return ERR_PTR(err);
}

static void mlxsw_sp_fib_destroy(struct mlxsw_sp_fib *fib)
{
414
	WARN_ON(!list_empty(&fib->node_list));
415
	WARN_ON(fib->lpm_tree);
416 417 418 419
	rhashtable_destroy(&fib->ht);
	kfree(fib);
}

420
static struct mlxsw_sp_lpm_tree *
421
mlxsw_sp_lpm_tree_find_unused(struct mlxsw_sp *mlxsw_sp)
422 423 424 425
{
	static struct mlxsw_sp_lpm_tree *lpm_tree;
	int i;

426 427
	for (i = 0; i < mlxsw_sp->router->lpm.tree_count; i++) {
		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
428 429
		if (lpm_tree->ref_count == 0)
			return lpm_tree;
430 431 432 433 434 435 436 437 438
	}
	return NULL;
}

static int mlxsw_sp_lpm_tree_alloc(struct mlxsw_sp *mlxsw_sp,
				   struct mlxsw_sp_lpm_tree *lpm_tree)
{
	char ralta_pl[MLXSW_REG_RALTA_LEN];

439 440 441
	mlxsw_reg_ralta_pack(ralta_pl, true,
			     (enum mlxsw_reg_ralxx_protocol) lpm_tree->proto,
			     lpm_tree->id);
442 443 444 445 446 447 448 449
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl);
}

static int mlxsw_sp_lpm_tree_free(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_lpm_tree *lpm_tree)
{
	char ralta_pl[MLXSW_REG_RALTA_LEN];

450 451 452
	mlxsw_reg_ralta_pack(ralta_pl, false,
			     (enum mlxsw_reg_ralxx_protocol) lpm_tree->proto,
			     lpm_tree->id);
453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl);
}

static int
mlxsw_sp_lpm_tree_left_struct_set(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_prefix_usage *prefix_usage,
				  struct mlxsw_sp_lpm_tree *lpm_tree)
{
	char ralst_pl[MLXSW_REG_RALST_LEN];
	u8 root_bin = 0;
	u8 prefix;
	u8 last_prefix = MLXSW_REG_RALST_BIN_NO_CHILD;

	mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage)
		root_bin = prefix;

	mlxsw_reg_ralst_pack(ralst_pl, root_bin, lpm_tree->id);
	mlxsw_sp_prefix_usage_for_each(prefix, prefix_usage) {
		if (prefix == 0)
			continue;
		mlxsw_reg_ralst_bin_pack(ralst_pl, prefix, last_prefix,
					 MLXSW_REG_RALST_BIN_NO_CHILD);
		last_prefix = prefix;
	}
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl);
}

static struct mlxsw_sp_lpm_tree *
mlxsw_sp_lpm_tree_create(struct mlxsw_sp *mlxsw_sp,
			 struct mlxsw_sp_prefix_usage *prefix_usage,
483
			 enum mlxsw_sp_l3proto proto)
484 485 486 487
{
	struct mlxsw_sp_lpm_tree *lpm_tree;
	int err;

488
	lpm_tree = mlxsw_sp_lpm_tree_find_unused(mlxsw_sp);
489 490 491 492 493 494 495 496 497 498 499
	if (!lpm_tree)
		return ERR_PTR(-EBUSY);
	lpm_tree->proto = proto;
	err = mlxsw_sp_lpm_tree_alloc(mlxsw_sp, lpm_tree);
	if (err)
		return ERR_PTR(err);

	err = mlxsw_sp_lpm_tree_left_struct_set(mlxsw_sp, prefix_usage,
						lpm_tree);
	if (err)
		goto err_left_struct_set;
500 501
	memcpy(&lpm_tree->prefix_usage, prefix_usage,
	       sizeof(lpm_tree->prefix_usage));
502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
	return lpm_tree;

err_left_struct_set:
	mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree);
	return ERR_PTR(err);
}

static int mlxsw_sp_lpm_tree_destroy(struct mlxsw_sp *mlxsw_sp,
				     struct mlxsw_sp_lpm_tree *lpm_tree)
{
	return mlxsw_sp_lpm_tree_free(mlxsw_sp, lpm_tree);
}

static struct mlxsw_sp_lpm_tree *
mlxsw_sp_lpm_tree_get(struct mlxsw_sp *mlxsw_sp,
		      struct mlxsw_sp_prefix_usage *prefix_usage,
518
		      enum mlxsw_sp_l3proto proto)
519 520 521 522
{
	struct mlxsw_sp_lpm_tree *lpm_tree;
	int i;

523 524
	for (i = 0; i < mlxsw_sp->router->lpm.tree_count; i++) {
		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
525 526
		if (lpm_tree->ref_count != 0 &&
		    lpm_tree->proto == proto &&
527 528 529 530 531
		    mlxsw_sp_prefix_usage_eq(&lpm_tree->prefix_usage,
					     prefix_usage))
			goto inc_ref_count;
	}
	lpm_tree = mlxsw_sp_lpm_tree_create(mlxsw_sp, prefix_usage,
532
					    proto);
533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548
	if (IS_ERR(lpm_tree))
		return lpm_tree;

inc_ref_count:
	lpm_tree->ref_count++;
	return lpm_tree;
}

static int mlxsw_sp_lpm_tree_put(struct mlxsw_sp *mlxsw_sp,
				 struct mlxsw_sp_lpm_tree *lpm_tree)
{
	if (--lpm_tree->ref_count == 0)
		return mlxsw_sp_lpm_tree_destroy(mlxsw_sp, lpm_tree);
	return 0;
}

549 550 551
#define MLXSW_SP_LPM_TREE_MIN 2 /* trees 0 and 1 are reserved */

static int mlxsw_sp_lpm_init(struct mlxsw_sp *mlxsw_sp)
552 553
{
	struct mlxsw_sp_lpm_tree *lpm_tree;
554
	u64 max_trees;
555 556
	int i;

557 558 559 560
	if (!MLXSW_CORE_RES_VALID(mlxsw_sp->core, MAX_LPM_TREES))
		return -EIO;

	max_trees = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_LPM_TREES);
561 562
	mlxsw_sp->router->lpm.tree_count = max_trees - MLXSW_SP_LPM_TREE_MIN;
	mlxsw_sp->router->lpm.trees = kcalloc(mlxsw_sp->router->lpm.tree_count,
563 564
					     sizeof(struct mlxsw_sp_lpm_tree),
					     GFP_KERNEL);
565
	if (!mlxsw_sp->router->lpm.trees)
566 567
		return -ENOMEM;

568 569
	for (i = 0; i < mlxsw_sp->router->lpm.tree_count; i++) {
		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
570 571
		lpm_tree->id = i + MLXSW_SP_LPM_TREE_MIN;
	}
572 573 574 575 576 577

	return 0;
}

static void mlxsw_sp_lpm_fini(struct mlxsw_sp *mlxsw_sp)
{
578
	kfree(mlxsw_sp->router->lpm.trees);
579 580
}

581 582 583 584 585
static bool mlxsw_sp_vr_is_used(const struct mlxsw_sp_vr *vr)
{
	return !!vr->fib4;
}

586 587 588 589 590
static struct mlxsw_sp_vr *mlxsw_sp_vr_find_unused(struct mlxsw_sp *mlxsw_sp)
{
	struct mlxsw_sp_vr *vr;
	int i;

J
Jiri Pirko 已提交
591
	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) {
592
		vr = &mlxsw_sp->router->vrs[i];
593
		if (!mlxsw_sp_vr_is_used(vr))
594 595 596 597 598 599
			return vr;
	}
	return NULL;
}

static int mlxsw_sp_vr_lpm_tree_bind(struct mlxsw_sp *mlxsw_sp,
600
				     const struct mlxsw_sp_fib *fib)
601 602 603
{
	char raltb_pl[MLXSW_REG_RALTB_LEN];

604 605 606
	mlxsw_reg_raltb_pack(raltb_pl, fib->vr->id,
			     (enum mlxsw_reg_ralxx_protocol) fib->proto,
			     fib->lpm_tree->id);
607 608 609 610
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl);
}

static int mlxsw_sp_vr_lpm_tree_unbind(struct mlxsw_sp *mlxsw_sp,
611
				       const struct mlxsw_sp_fib *fib)
612 613 614 615
{
	char raltb_pl[MLXSW_REG_RALTB_LEN];

	/* Bind to tree 0 which is default */
616 617
	mlxsw_reg_raltb_pack(raltb_pl, fib->vr->id,
			     (enum mlxsw_reg_ralxx_protocol) fib->proto, 0);
618 619 620 621 622 623 624 625 626 627 628 629
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb), raltb_pl);
}

static u32 mlxsw_sp_fix_tb_id(u32 tb_id)
{
	/* For our purpose, squash main and local table into one */
	if (tb_id == RT_TABLE_LOCAL)
		tb_id = RT_TABLE_MAIN;
	return tb_id;
}

static struct mlxsw_sp_vr *mlxsw_sp_vr_find(struct mlxsw_sp *mlxsw_sp,
630
					    u32 tb_id)
631 632 633 634 635
{
	struct mlxsw_sp_vr *vr;
	int i;

	tb_id = mlxsw_sp_fix_tb_id(tb_id);
636

J
Jiri Pirko 已提交
637
	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) {
638
		vr = &mlxsw_sp->router->vrs[i];
639
		if (mlxsw_sp_vr_is_used(vr) && vr->tb_id == tb_id)
640 641 642 643 644
			return vr;
	}
	return NULL;
}

645 646 647 648 649 650 651 652 653 654 655 656
static struct mlxsw_sp_fib *mlxsw_sp_vr_fib(const struct mlxsw_sp_vr *vr,
					    enum mlxsw_sp_l3proto proto)
{
	switch (proto) {
	case MLXSW_SP_L3_PROTO_IPV4:
		return vr->fib4;
	case MLXSW_SP_L3_PROTO_IPV6:
		BUG_ON(1);
	}
	return NULL;
}

657
static struct mlxsw_sp_vr *mlxsw_sp_vr_create(struct mlxsw_sp *mlxsw_sp,
658
					      u32 tb_id)
659 660 661 662 663 664
{
	struct mlxsw_sp_vr *vr;

	vr = mlxsw_sp_vr_find_unused(mlxsw_sp);
	if (!vr)
		return ERR_PTR(-EBUSY);
665 666 667
	vr->fib4 = mlxsw_sp_fib_create(vr, MLXSW_SP_L3_PROTO_IPV4);
	if (IS_ERR(vr->fib4))
		return ERR_CAST(vr->fib4);
668 669 670 671
	vr->tb_id = tb_id;
	return vr;
}

672
static void mlxsw_sp_vr_destroy(struct mlxsw_sp_vr *vr)
673
{
674 675
	mlxsw_sp_fib_destroy(vr->fib4);
	vr->fib4 = NULL;
676 677 678
}

static int
679
mlxsw_sp_vr_lpm_tree_check(struct mlxsw_sp *mlxsw_sp, struct mlxsw_sp_fib *fib,
680 681
			   struct mlxsw_sp_prefix_usage *req_prefix_usage)
{
682
	struct mlxsw_sp_lpm_tree *lpm_tree = fib->lpm_tree;
683 684
	struct mlxsw_sp_lpm_tree *new_tree;
	int err;
685

686
	if (mlxsw_sp_prefix_usage_eq(req_prefix_usage, &lpm_tree->prefix_usage))
687 688
		return 0;

689
	new_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, req_prefix_usage,
690
					 fib->proto);
691
	if (IS_ERR(new_tree)) {
692 693 694 695 696 697
		/* We failed to get a tree according to the required
		 * prefix usage. However, the current tree might be still good
		 * for us if our requirement is subset of the prefixes used
		 * in the tree.
		 */
		if (mlxsw_sp_prefix_usage_subset(req_prefix_usage,
698
						 &lpm_tree->prefix_usage))
699
			return 0;
700
		return PTR_ERR(new_tree);
701 702
	}

703
	/* Prevent packet loss by overwriting existing binding */
704 705
	fib->lpm_tree = new_tree;
	err = mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, fib);
706 707 708 709 710 711 712
	if (err)
		goto err_tree_bind;
	mlxsw_sp_lpm_tree_put(mlxsw_sp, lpm_tree);

	return 0;

err_tree_bind:
713
	fib->lpm_tree = lpm_tree;
714 715
	mlxsw_sp_lpm_tree_put(mlxsw_sp, new_tree);
	return err;
716 717
}

718
static struct mlxsw_sp_vr *mlxsw_sp_vr_get(struct mlxsw_sp *mlxsw_sp, u32 tb_id)
719 720 721 722
{
	struct mlxsw_sp_vr *vr;

	tb_id = mlxsw_sp_fix_tb_id(tb_id);
723 724 725
	vr = mlxsw_sp_vr_find(mlxsw_sp, tb_id);
	if (!vr)
		vr = mlxsw_sp_vr_create(mlxsw_sp, tb_id);
726 727 728
	return vr;
}

729
static void mlxsw_sp_vr_put(struct mlxsw_sp_vr *vr)
730
{
731
	if (!vr->rif_count && list_empty(&vr->fib4->node_list))
732
		mlxsw_sp_vr_destroy(vr);
733 734
}

735
static int mlxsw_sp_vrs_init(struct mlxsw_sp *mlxsw_sp)
736 737
{
	struct mlxsw_sp_vr *vr;
J
Jiri Pirko 已提交
738
	u64 max_vrs;
739 740
	int i;

J
Jiri Pirko 已提交
741
	if (!MLXSW_CORE_RES_VALID(mlxsw_sp->core, MAX_VRS))
742 743
		return -EIO;

J
Jiri Pirko 已提交
744
	max_vrs = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS);
745 746 747
	mlxsw_sp->router->vrs = kcalloc(max_vrs, sizeof(struct mlxsw_sp_vr),
					GFP_KERNEL);
	if (!mlxsw_sp->router->vrs)
748 749
		return -ENOMEM;

J
Jiri Pirko 已提交
750
	for (i = 0; i < max_vrs; i++) {
751
		vr = &mlxsw_sp->router->vrs[i];
752 753
		vr->id = i;
	}
754 755 756 757

	return 0;
}

758 759
static void mlxsw_sp_router_fib_flush(struct mlxsw_sp *mlxsw_sp);

760 761
static void mlxsw_sp_vrs_fini(struct mlxsw_sp *mlxsw_sp)
{
762 763 764 765 766 767 768 769
	/* At this stage we're guaranteed not to have new incoming
	 * FIB notifications and the work queue is free from FIBs
	 * sitting on top of mlxsw netdevs. However, we can still
	 * have other FIBs queued. Flush the queue before flushing
	 * the device's tables. No need for locks, as we're the only
	 * writer.
	 */
	mlxsw_core_flush_owq();
770
	mlxsw_sp_router_fib_flush(mlxsw_sp);
771
	kfree(mlxsw_sp->router->vrs);
772 773
}

774
struct mlxsw_sp_neigh_key {
775
	struct neighbour *n;
776 777 778
};

struct mlxsw_sp_neigh_entry {
779
	struct list_head rif_list_node;
780 781 782
	struct rhash_head ht_node;
	struct mlxsw_sp_neigh_key key;
	u16 rif;
783
	bool connected;
784
	unsigned char ha[ETH_ALEN];
785 786 787
	struct list_head nexthop_list; /* list of nexthops using
					* this neigh entry
					*/
788
	struct list_head nexthop_neighs_list_node;
789 790 791 792 793 794 795 796 797
};

static const struct rhashtable_params mlxsw_sp_neigh_ht_params = {
	.key_offset = offsetof(struct mlxsw_sp_neigh_entry, key),
	.head_offset = offsetof(struct mlxsw_sp_neigh_entry, ht_node),
	.key_len = sizeof(struct mlxsw_sp_neigh_key),
};

static struct mlxsw_sp_neigh_entry *
798 799
mlxsw_sp_neigh_entry_alloc(struct mlxsw_sp *mlxsw_sp, struct neighbour *n,
			   u16 rif)
800 801 802
{
	struct mlxsw_sp_neigh_entry *neigh_entry;

803
	neigh_entry = kzalloc(sizeof(*neigh_entry), GFP_KERNEL);
804 805
	if (!neigh_entry)
		return NULL;
806

807
	neigh_entry->key.n = n;
808
	neigh_entry->rif = rif;
809
	INIT_LIST_HEAD(&neigh_entry->nexthop_list);
810

811 812 813
	return neigh_entry;
}

814
static void mlxsw_sp_neigh_entry_free(struct mlxsw_sp_neigh_entry *neigh_entry)
815 816 817 818
{
	kfree(neigh_entry);
}

819 820 821
static int
mlxsw_sp_neigh_entry_insert(struct mlxsw_sp *mlxsw_sp,
			    struct mlxsw_sp_neigh_entry *neigh_entry)
822
{
823
	return rhashtable_insert_fast(&mlxsw_sp->router->neigh_ht,
824 825 826
				      &neigh_entry->ht_node,
				      mlxsw_sp_neigh_ht_params);
}
827

828 829 830 831
static void
mlxsw_sp_neigh_entry_remove(struct mlxsw_sp *mlxsw_sp,
			    struct mlxsw_sp_neigh_entry *neigh_entry)
{
832
	rhashtable_remove_fast(&mlxsw_sp->router->neigh_ht,
833 834
			       &neigh_entry->ht_node,
			       mlxsw_sp_neigh_ht_params);
835 836
}

837 838
static struct mlxsw_sp_neigh_entry *
mlxsw_sp_neigh_entry_create(struct mlxsw_sp *mlxsw_sp, struct neighbour *n)
839 840
{
	struct mlxsw_sp_neigh_entry *neigh_entry;
841
	struct mlxsw_sp_rif *rif;
842 843
	int err;

844 845
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, n->dev);
	if (!rif)
846
		return ERR_PTR(-EINVAL);
847

848
	neigh_entry = mlxsw_sp_neigh_entry_alloc(mlxsw_sp, n, rif->rif_index);
849
	if (!neigh_entry)
850 851
		return ERR_PTR(-ENOMEM);

852 853 854
	err = mlxsw_sp_neigh_entry_insert(mlxsw_sp, neigh_entry);
	if (err)
		goto err_neigh_entry_insert;
855

856
	list_add(&neigh_entry->rif_list_node, &rif->neigh_list);
857

858
	return neigh_entry;
859 860

err_neigh_entry_insert:
861 862
	mlxsw_sp_neigh_entry_free(neigh_entry);
	return ERR_PTR(err);
863 864
}

865 866 867
static void
mlxsw_sp_neigh_entry_destroy(struct mlxsw_sp *mlxsw_sp,
			     struct mlxsw_sp_neigh_entry *neigh_entry)
868
{
869
	list_del(&neigh_entry->rif_list_node);
870 871 872
	mlxsw_sp_neigh_entry_remove(mlxsw_sp, neigh_entry);
	mlxsw_sp_neigh_entry_free(neigh_entry);
}
873

874 875 876 877
static struct mlxsw_sp_neigh_entry *
mlxsw_sp_neigh_entry_lookup(struct mlxsw_sp *mlxsw_sp, struct neighbour *n)
{
	struct mlxsw_sp_neigh_key key;
878

879
	key.n = n;
880
	return rhashtable_lookup_fast(&mlxsw_sp->router->neigh_ht,
881
				      &key, mlxsw_sp_neigh_ht_params);
882 883
}

884 885 886 887 888
static void
mlxsw_sp_router_neighs_update_interval_init(struct mlxsw_sp *mlxsw_sp)
{
	unsigned long interval = NEIGH_VAR(&arp_tbl.parms, DELAY_PROBE_TIME);

889
	mlxsw_sp->router->neighs_update.interval = jiffies_to_msecs(interval);
890 891 892 893 894 895 896 897 898 899 900 901 902 903
}

static void mlxsw_sp_router_neigh_ent_ipv4_process(struct mlxsw_sp *mlxsw_sp,
						   char *rauhtd_pl,
						   int ent_index)
{
	struct net_device *dev;
	struct neighbour *n;
	__be32 dipn;
	u32 dip;
	u16 rif;

	mlxsw_reg_rauhtd_ent_ipv4_unpack(rauhtd_pl, ent_index, &rif, &dip);

904
	if (!mlxsw_sp->router->rifs[rif]) {
905 906 907 908 909
		dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Incorrect RIF in neighbour entry\n");
		return;
	}

	dipn = htonl(dip);
910
	dev = mlxsw_sp->router->rifs[rif]->dev;
911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959
	n = neigh_lookup(&arp_tbl, &dipn, dev);
	if (!n) {
		netdev_err(dev, "Failed to find matching neighbour for IP=%pI4h\n",
			   &dip);
		return;
	}

	netdev_dbg(dev, "Updating neighbour with IP=%pI4h\n", &dip);
	neigh_event_send(n, NULL);
	neigh_release(n);
}

static void mlxsw_sp_router_neigh_rec_ipv4_process(struct mlxsw_sp *mlxsw_sp,
						   char *rauhtd_pl,
						   int rec_index)
{
	u8 num_entries;
	int i;

	num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl,
								rec_index);
	/* Hardware starts counting at 0, so add 1. */
	num_entries++;

	/* Each record consists of several neighbour entries. */
	for (i = 0; i < num_entries; i++) {
		int ent_index;

		ent_index = rec_index * MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC + i;
		mlxsw_sp_router_neigh_ent_ipv4_process(mlxsw_sp, rauhtd_pl,
						       ent_index);
	}

}

static void mlxsw_sp_router_neigh_rec_process(struct mlxsw_sp *mlxsw_sp,
					      char *rauhtd_pl, int rec_index)
{
	switch (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, rec_index)) {
	case MLXSW_REG_RAUHTD_TYPE_IPV4:
		mlxsw_sp_router_neigh_rec_ipv4_process(mlxsw_sp, rauhtd_pl,
						       rec_index);
		break;
	case MLXSW_REG_RAUHTD_TYPE_IPV6:
		WARN_ON_ONCE(1);
		break;
	}
}

960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979
static bool mlxsw_sp_router_rauhtd_is_full(char *rauhtd_pl)
{
	u8 num_rec, last_rec_index, num_entries;

	num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl);
	last_rec_index = num_rec - 1;

	if (num_rec < MLXSW_REG_RAUHTD_REC_MAX_NUM)
		return false;
	if (mlxsw_reg_rauhtd_rec_type_get(rauhtd_pl, last_rec_index) ==
	    MLXSW_REG_RAUHTD_TYPE_IPV6)
		return true;

	num_entries = mlxsw_reg_rauhtd_ipv4_rec_num_entries_get(rauhtd_pl,
								last_rec_index);
	if (++num_entries == MLXSW_REG_RAUHTD_IPV4_ENT_PER_REC)
		return true;
	return false;
}

980
static int mlxsw_sp_router_neighs_update_rauhtd(struct mlxsw_sp *mlxsw_sp)
981 982 983 984 985 986 987
{
	char *rauhtd_pl;
	u8 num_rec;
	int i, err;

	rauhtd_pl = kmalloc(MLXSW_REG_RAUHTD_LEN, GFP_KERNEL);
	if (!rauhtd_pl)
988
		return -ENOMEM;
989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005

	/* Make sure the neighbour's netdev isn't removed in the
	 * process.
	 */
	rtnl_lock();
	do {
		mlxsw_reg_rauhtd_pack(rauhtd_pl, MLXSW_REG_RAUHTD_TYPE_IPV4);
		err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(rauhtd),
				      rauhtd_pl);
		if (err) {
			dev_err_ratelimited(mlxsw_sp->bus_info->dev, "Failed to dump neighbour talbe\n");
			break;
		}
		num_rec = mlxsw_reg_rauhtd_num_rec_get(rauhtd_pl);
		for (i = 0; i < num_rec; i++)
			mlxsw_sp_router_neigh_rec_process(mlxsw_sp, rauhtd_pl,
							  i);
1006
	} while (mlxsw_sp_router_rauhtd_is_full(rauhtd_pl));
1007 1008 1009
	rtnl_unlock();

	kfree(rauhtd_pl);
1010 1011 1012 1013 1014 1015 1016 1017 1018
	return err;
}

static void mlxsw_sp_router_neighs_update_nh(struct mlxsw_sp *mlxsw_sp)
{
	struct mlxsw_sp_neigh_entry *neigh_entry;

	/* Take RTNL mutex here to prevent lists from changes */
	rtnl_lock();
1019
	list_for_each_entry(neigh_entry, &mlxsw_sp->router->nexthop_neighs_list,
1020
			    nexthop_neighs_list_node)
1021 1022 1023
		/* If this neigh have nexthops, make the kernel think this neigh
		 * is active regardless of the traffic.
		 */
1024
		neigh_event_send(neigh_entry->key.n, NULL);
1025 1026 1027 1028 1029 1030
	rtnl_unlock();
}

static void
mlxsw_sp_router_neighs_update_work_schedule(struct mlxsw_sp *mlxsw_sp)
{
1031
	unsigned long interval = mlxsw_sp->router->neighs_update.interval;
1032

1033
	mlxsw_core_schedule_dw(&mlxsw_sp->router->neighs_update.dw,
1034 1035 1036 1037 1038
			       msecs_to_jiffies(interval));
}

static void mlxsw_sp_router_neighs_update_work(struct work_struct *work)
{
1039
	struct mlxsw_sp_router *router;
1040 1041
	int err;

1042 1043 1044
	router = container_of(work, struct mlxsw_sp_router,
			      neighs_update.dw.work);
	err = mlxsw_sp_router_neighs_update_rauhtd(router->mlxsw_sp);
1045
	if (err)
1046
		dev_err(router->mlxsw_sp->bus_info->dev, "Could not update kernel for neigh activity");
1047

1048
	mlxsw_sp_router_neighs_update_nh(router->mlxsw_sp);
1049

1050
	mlxsw_sp_router_neighs_update_work_schedule(router->mlxsw_sp);
1051 1052
}

1053 1054 1055
static void mlxsw_sp_router_probe_unresolved_nexthops(struct work_struct *work)
{
	struct mlxsw_sp_neigh_entry *neigh_entry;
1056
	struct mlxsw_sp_router *router;
1057

1058 1059
	router = container_of(work, struct mlxsw_sp_router,
			      nexthop_probe_dw.work);
1060 1061 1062 1063 1064 1065 1066 1067 1068
	/* Iterate over nexthop neighbours, find those who are unresolved and
	 * send arp on them. This solves the chicken-egg problem when
	 * the nexthop wouldn't get offloaded until the neighbor is resolved
	 * but it wouldn't get resolved ever in case traffic is flowing in HW
	 * using different nexthop.
	 *
	 * Take RTNL mutex here to prevent lists from changes.
	 */
	rtnl_lock();
1069
	list_for_each_entry(neigh_entry, &router->nexthop_neighs_list,
1070
			    nexthop_neighs_list_node)
1071
		if (!neigh_entry->connected)
1072
			neigh_event_send(neigh_entry->key.n, NULL);
1073 1074
	rtnl_unlock();

1075
	mlxsw_core_schedule_dw(&router->nexthop_probe_dw,
1076 1077 1078
			       MLXSW_SP_UNRESOLVED_NH_PROBE_INTERVAL);
}

1079 1080 1081 1082 1083
static void
mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp,
			      struct mlxsw_sp_neigh_entry *neigh_entry,
			      bool removing);

1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
static enum mlxsw_reg_rauht_op mlxsw_sp_rauht_op(bool adding)
{
	return adding ? MLXSW_REG_RAUHT_OP_WRITE_ADD :
			MLXSW_REG_RAUHT_OP_WRITE_DELETE;
}

static void
mlxsw_sp_router_neigh_entry_op4(struct mlxsw_sp *mlxsw_sp,
				struct mlxsw_sp_neigh_entry *neigh_entry,
				enum mlxsw_reg_rauht_op op)
1094
{
1095
	struct neighbour *n = neigh_entry->key.n;
1096
	u32 dip = ntohl(*((__be32 *) n->primary_key));
1097
	char rauht_pl[MLXSW_REG_RAUHT_LEN];
1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132

	mlxsw_reg_rauht_pack4(rauht_pl, op, neigh_entry->rif, neigh_entry->ha,
			      dip);
	mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rauht), rauht_pl);
}

static void
mlxsw_sp_neigh_entry_update(struct mlxsw_sp *mlxsw_sp,
			    struct mlxsw_sp_neigh_entry *neigh_entry,
			    bool adding)
{
	if (!adding && !neigh_entry->connected)
		return;
	neigh_entry->connected = adding;
	if (neigh_entry->key.n->tbl == &arp_tbl)
		mlxsw_sp_router_neigh_entry_op4(mlxsw_sp, neigh_entry,
						mlxsw_sp_rauht_op(adding));
	else
		WARN_ON_ONCE(1);
}

struct mlxsw_sp_neigh_event_work {
	struct work_struct work;
	struct mlxsw_sp *mlxsw_sp;
	struct neighbour *n;
};

static void mlxsw_sp_router_neigh_event_work(struct work_struct *work)
{
	struct mlxsw_sp_neigh_event_work *neigh_work =
		container_of(work, struct mlxsw_sp_neigh_event_work, work);
	struct mlxsw_sp *mlxsw_sp = neigh_work->mlxsw_sp;
	struct mlxsw_sp_neigh_entry *neigh_entry;
	struct neighbour *n = neigh_work->n;
	unsigned char ha[ETH_ALEN];
1133
	bool entry_connected;
1134
	u8 nud_state, dead;
1135

1136 1137 1138 1139
	/* If these parameters are changed after we release the lock,
	 * then we are guaranteed to receive another event letting us
	 * know about it.
	 */
1140
	read_lock_bh(&n->lock);
1141
	memcpy(ha, n->ha, ETH_ALEN);
1142
	nud_state = n->nud_state;
1143
	dead = n->dead;
1144 1145
	read_unlock_bh(&n->lock);

1146
	rtnl_lock();
1147
	entry_connected = nud_state & NUD_VALID && !dead;
1148 1149 1150 1151 1152 1153 1154
	neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n);
	if (!entry_connected && !neigh_entry)
		goto out;
	if (!neigh_entry) {
		neigh_entry = mlxsw_sp_neigh_entry_create(mlxsw_sp, n);
		if (IS_ERR(neigh_entry))
			goto out;
1155 1156
	}

1157 1158 1159 1160 1161 1162 1163 1164 1165
	memcpy(neigh_entry->ha, ha, ETH_ALEN);
	mlxsw_sp_neigh_entry_update(mlxsw_sp, neigh_entry, entry_connected);
	mlxsw_sp_nexthop_neigh_update(mlxsw_sp, neigh_entry, !entry_connected);

	if (!neigh_entry->connected && list_empty(&neigh_entry->nexthop_list))
		mlxsw_sp_neigh_entry_destroy(mlxsw_sp, neigh_entry);

out:
	rtnl_unlock();
1166
	neigh_release(n);
1167
	kfree(neigh_work);
1168 1169
}

1170 1171
int mlxsw_sp_router_netevent_event(struct notifier_block *unused,
				   unsigned long event, void *ptr)
1172
{
1173
	struct mlxsw_sp_neigh_event_work *neigh_work;
1174 1175 1176 1177
	struct mlxsw_sp_port *mlxsw_sp_port;
	struct mlxsw_sp *mlxsw_sp;
	unsigned long interval;
	struct neigh_parms *p;
1178
	struct neighbour *n;
1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196

	switch (event) {
	case NETEVENT_DELAY_PROBE_TIME_UPDATE:
		p = ptr;

		/* We don't care about changes in the default table. */
		if (!p->dev || p->tbl != &arp_tbl)
			return NOTIFY_DONE;

		/* We are in atomic context and can't take RTNL mutex,
		 * so use RCU variant to walk the device chain.
		 */
		mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(p->dev);
		if (!mlxsw_sp_port)
			return NOTIFY_DONE;

		mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
		interval = jiffies_to_msecs(NEIGH_VAR(p, DELAY_PROBE_TIME));
1197
		mlxsw_sp->router->neighs_update.interval = interval;
1198 1199 1200

		mlxsw_sp_port_dev_put(mlxsw_sp_port);
		break;
1201 1202 1203 1204 1205 1206
	case NETEVENT_NEIGH_UPDATE:
		n = ptr;

		if (n->tbl != &arp_tbl)
			return NOTIFY_DONE;

1207
		mlxsw_sp_port = mlxsw_sp_port_lower_dev_hold(n->dev);
1208 1209 1210
		if (!mlxsw_sp_port)
			return NOTIFY_DONE;

1211 1212
		neigh_work = kzalloc(sizeof(*neigh_work), GFP_ATOMIC);
		if (!neigh_work) {
1213
			mlxsw_sp_port_dev_put(mlxsw_sp_port);
1214
			return NOTIFY_BAD;
1215
		}
1216 1217 1218 1219

		INIT_WORK(&neigh_work->work, mlxsw_sp_router_neigh_event_work);
		neigh_work->mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
		neigh_work->n = n;
1220 1221 1222 1223 1224 1225

		/* Take a reference to ensure the neighbour won't be
		 * destructed until we drop the reference in delayed
		 * work.
		 */
		neigh_clone(n);
1226 1227
		mlxsw_core_schedule_work(&neigh_work->work);
		mlxsw_sp_port_dev_put(mlxsw_sp_port);
1228
		break;
1229 1230 1231 1232 1233
	}

	return NOTIFY_DONE;
}

1234 1235
static int mlxsw_sp_neigh_init(struct mlxsw_sp *mlxsw_sp)
{
1236 1237
	int err;

1238
	err = rhashtable_init(&mlxsw_sp->router->neigh_ht,
1239 1240 1241 1242 1243 1244 1245 1246 1247
			      &mlxsw_sp_neigh_ht_params);
	if (err)
		return err;

	/* Initialize the polling interval according to the default
	 * table.
	 */
	mlxsw_sp_router_neighs_update_interval_init(mlxsw_sp);

1248
	/* Create the delayed works for the activity_update */
1249
	INIT_DELAYED_WORK(&mlxsw_sp->router->neighs_update.dw,
1250
			  mlxsw_sp_router_neighs_update_work);
1251
	INIT_DELAYED_WORK(&mlxsw_sp->router->nexthop_probe_dw,
1252
			  mlxsw_sp_router_probe_unresolved_nexthops);
1253 1254
	mlxsw_core_schedule_dw(&mlxsw_sp->router->neighs_update.dw, 0);
	mlxsw_core_schedule_dw(&mlxsw_sp->router->nexthop_probe_dw, 0);
1255
	return 0;
1256 1257 1258 1259
}

static void mlxsw_sp_neigh_fini(struct mlxsw_sp *mlxsw_sp)
{
1260 1261 1262
	cancel_delayed_work_sync(&mlxsw_sp->router->neighs_update.dw);
	cancel_delayed_work_sync(&mlxsw_sp->router->nexthop_probe_dw);
	rhashtable_destroy(&mlxsw_sp->router->neigh_ht);
1263 1264
}

1265
static int mlxsw_sp_neigh_rif_flush(struct mlxsw_sp *mlxsw_sp,
1266
				    const struct mlxsw_sp_rif *rif)
1267 1268 1269 1270
{
	char rauht_pl[MLXSW_REG_RAUHT_LEN];

	mlxsw_reg_rauht_pack(rauht_pl, MLXSW_REG_RAUHT_OP_WRITE_DELETE_ALL,
1271
			     rif->rif_index, rif->addr);
1272 1273 1274 1275
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rauht), rauht_pl);
}

static void mlxsw_sp_neigh_rif_gone_sync(struct mlxsw_sp *mlxsw_sp,
1276
					 struct mlxsw_sp_rif *rif)
1277 1278 1279
{
	struct mlxsw_sp_neigh_entry *neigh_entry, *tmp;

1280 1281
	mlxsw_sp_neigh_rif_flush(mlxsw_sp, rif);
	list_for_each_entry_safe(neigh_entry, tmp, &rif->neigh_list,
1282 1283 1284 1285
				 rif_list_node)
		mlxsw_sp_neigh_entry_destroy(mlxsw_sp, neigh_entry);
}

1286 1287 1288 1289
struct mlxsw_sp_nexthop_key {
	struct fib_nh *fib_nh;
};

1290 1291
struct mlxsw_sp_nexthop {
	struct list_head neigh_list_node; /* member of neigh entry list */
1292
	struct list_head rif_list_node;
1293 1294 1295
	struct mlxsw_sp_nexthop_group *nh_grp; /* pointer back to the group
						* this belongs to
						*/
1296 1297
	struct rhash_head ht_node;
	struct mlxsw_sp_nexthop_key key;
1298
	struct mlxsw_sp_rif *rif;
1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310
	u8 should_offload:1, /* set indicates this neigh is connected and
			      * should be put to KVD linear area of this group.
			      */
	   offloaded:1, /* set in case the neigh is actually put into
			 * KVD linear area of this group.
			 */
	   update:1; /* set indicates that MAC of this neigh should be
		      * updated in HW
		      */
	struct mlxsw_sp_neigh_entry *neigh_entry;
};

1311 1312 1313 1314
struct mlxsw_sp_nexthop_group_key {
	struct fib_info *fi;
};

1315
struct mlxsw_sp_nexthop_group {
1316
	struct rhash_head ht_node;
1317
	struct list_head fib_list; /* list of fib entries that use this group */
1318
	struct mlxsw_sp_nexthop_group_key key;
1319 1320
	u8 adj_index_valid:1,
	   gateway:1; /* routes using the group use a gateway */
1321 1322 1323 1324
	u32 adj_index;
	u16 ecmp_size;
	u16 count;
	struct mlxsw_sp_nexthop nexthops[0];
1325
#define nh_rif	nexthops[0].rif
1326 1327
};

1328 1329 1330 1331 1332 1333 1334 1335 1336
static const struct rhashtable_params mlxsw_sp_nexthop_group_ht_params = {
	.key_offset = offsetof(struct mlxsw_sp_nexthop_group, key),
	.head_offset = offsetof(struct mlxsw_sp_nexthop_group, ht_node),
	.key_len = sizeof(struct mlxsw_sp_nexthop_group_key),
};

static int mlxsw_sp_nexthop_group_insert(struct mlxsw_sp *mlxsw_sp,
					 struct mlxsw_sp_nexthop_group *nh_grp)
{
1337
	return rhashtable_insert_fast(&mlxsw_sp->router->nexthop_group_ht,
1338 1339 1340 1341 1342 1343 1344
				      &nh_grp->ht_node,
				      mlxsw_sp_nexthop_group_ht_params);
}

static void mlxsw_sp_nexthop_group_remove(struct mlxsw_sp *mlxsw_sp,
					  struct mlxsw_sp_nexthop_group *nh_grp)
{
1345
	rhashtable_remove_fast(&mlxsw_sp->router->nexthop_group_ht,
1346 1347 1348 1349 1350 1351 1352 1353
			       &nh_grp->ht_node,
			       mlxsw_sp_nexthop_group_ht_params);
}

static struct mlxsw_sp_nexthop_group *
mlxsw_sp_nexthop_group_lookup(struct mlxsw_sp *mlxsw_sp,
			      struct mlxsw_sp_nexthop_group_key key)
{
1354
	return rhashtable_lookup_fast(&mlxsw_sp->router->nexthop_group_ht, &key,
1355 1356 1357
				      mlxsw_sp_nexthop_group_ht_params);
}

1358 1359 1360 1361 1362 1363 1364 1365 1366
static const struct rhashtable_params mlxsw_sp_nexthop_ht_params = {
	.key_offset = offsetof(struct mlxsw_sp_nexthop, key),
	.head_offset = offsetof(struct mlxsw_sp_nexthop, ht_node),
	.key_len = sizeof(struct mlxsw_sp_nexthop_key),
};

static int mlxsw_sp_nexthop_insert(struct mlxsw_sp *mlxsw_sp,
				   struct mlxsw_sp_nexthop *nh)
{
1367
	return rhashtable_insert_fast(&mlxsw_sp->router->nexthop_ht,
1368 1369 1370 1371 1372 1373
				      &nh->ht_node, mlxsw_sp_nexthop_ht_params);
}

static void mlxsw_sp_nexthop_remove(struct mlxsw_sp *mlxsw_sp,
				    struct mlxsw_sp_nexthop *nh)
{
1374
	rhashtable_remove_fast(&mlxsw_sp->router->nexthop_ht, &nh->ht_node,
1375 1376 1377
			       mlxsw_sp_nexthop_ht_params);
}

1378 1379 1380 1381
static struct mlxsw_sp_nexthop *
mlxsw_sp_nexthop_lookup(struct mlxsw_sp *mlxsw_sp,
			struct mlxsw_sp_nexthop_key key)
{
1382
	return rhashtable_lookup_fast(&mlxsw_sp->router->nexthop_ht, &key,
1383 1384 1385
				      mlxsw_sp_nexthop_ht_params);
}

1386
static int mlxsw_sp_adj_index_mass_update_vr(struct mlxsw_sp *mlxsw_sp,
1387
					     const struct mlxsw_sp_fib *fib,
1388 1389 1390 1391 1392 1393
					     u32 adj_index, u16 ecmp_size,
					     u32 new_adj_index,
					     u16 new_ecmp_size)
{
	char raleu_pl[MLXSW_REG_RALEU_LEN];

1394
	mlxsw_reg_raleu_pack(raleu_pl,
1395 1396
			     (enum mlxsw_reg_ralxx_protocol) fib->proto,
			     fib->vr->id, adj_index, ecmp_size, new_adj_index,
1397
			     new_ecmp_size);
1398 1399 1400 1401 1402 1403 1404 1405
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raleu), raleu_pl);
}

static int mlxsw_sp_adj_index_mass_update(struct mlxsw_sp *mlxsw_sp,
					  struct mlxsw_sp_nexthop_group *nh_grp,
					  u32 old_adj_index, u16 old_ecmp_size)
{
	struct mlxsw_sp_fib_entry *fib_entry;
1406
	struct mlxsw_sp_fib *fib = NULL;
1407 1408 1409
	int err;

	list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) {
1410
		if (fib == fib_entry->fib_node->fib)
1411
			continue;
1412 1413
		fib = fib_entry->fib_node->fib;
		err = mlxsw_sp_adj_index_mass_update_vr(mlxsw_sp, fib,
1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437
							old_adj_index,
							old_ecmp_size,
							nh_grp->adj_index,
							nh_grp->ecmp_size);
		if (err)
			return err;
	}
	return 0;
}

static int mlxsw_sp_nexthop_mac_update(struct mlxsw_sp *mlxsw_sp, u32 adj_index,
				       struct mlxsw_sp_nexthop *nh)
{
	struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry;
	char ratr_pl[MLXSW_REG_RATR_LEN];

	mlxsw_reg_ratr_pack(ratr_pl, MLXSW_REG_RATR_OP_WRITE_WRITE_ENTRY,
			    true, adj_index, neigh_entry->rif);
	mlxsw_reg_ratr_eth_entry_pack(ratr_pl, neigh_entry->ha);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ratr), ratr_pl);
}

static int
mlxsw_sp_nexthop_group_mac_update(struct mlxsw_sp *mlxsw_sp,
1438 1439
				  struct mlxsw_sp_nexthop_group *nh_grp,
				  bool reallocate)
1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453
{
	u32 adj_index = nh_grp->adj_index; /* base */
	struct mlxsw_sp_nexthop *nh;
	int i;
	int err;

	for (i = 0; i < nh_grp->count; i++) {
		nh = &nh_grp->nexthops[i];

		if (!nh->should_offload) {
			nh->offloaded = 0;
			continue;
		}

1454
		if (nh->update || reallocate) {
1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498
			err = mlxsw_sp_nexthop_mac_update(mlxsw_sp,
							  adj_index, nh);
			if (err)
				return err;
			nh->update = 0;
			nh->offloaded = 1;
		}
		adj_index++;
	}
	return 0;
}

static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp,
				     struct mlxsw_sp_fib_entry *fib_entry);

static int
mlxsw_sp_nexthop_fib_entries_update(struct mlxsw_sp *mlxsw_sp,
				    struct mlxsw_sp_nexthop_group *nh_grp)
{
	struct mlxsw_sp_fib_entry *fib_entry;
	int err;

	list_for_each_entry(fib_entry, &nh_grp->fib_list, nexthop_group_node) {
		err = mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry);
		if (err)
			return err;
	}
	return 0;
}

static void
mlxsw_sp_nexthop_group_refresh(struct mlxsw_sp *mlxsw_sp,
			       struct mlxsw_sp_nexthop_group *nh_grp)
{
	struct mlxsw_sp_nexthop *nh;
	bool offload_change = false;
	u32 adj_index;
	u16 ecmp_size = 0;
	bool old_adj_index_valid;
	u32 old_adj_index;
	u16 old_ecmp_size;
	int i;
	int err;

1499 1500 1501 1502 1503
	if (!nh_grp->gateway) {
		mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp);
		return;
	}

1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518
	for (i = 0; i < nh_grp->count; i++) {
		nh = &nh_grp->nexthops[i];

		if (nh->should_offload ^ nh->offloaded) {
			offload_change = true;
			if (nh->should_offload)
				nh->update = 1;
		}
		if (nh->should_offload)
			ecmp_size++;
	}
	if (!offload_change) {
		/* Nothing was added or removed, so no need to reallocate. Just
		 * update MAC on existing adjacency indexes.
		 */
1519 1520
		err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp,
							false);
1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532
		if (err) {
			dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n");
			goto set_trap;
		}
		return;
	}
	if (!ecmp_size)
		/* No neigh of this group is connected so we just set
		 * the trap and let everthing flow through kernel.
		 */
		goto set_trap;

1533 1534
	err = mlxsw_sp_kvdl_alloc(mlxsw_sp, ecmp_size, &adj_index);
	if (err) {
1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
		/* We ran out of KVD linear space, just set the
		 * trap and let everything flow through kernel.
		 */
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to allocate KVD linear area for nexthop group.\n");
		goto set_trap;
	}
	old_adj_index_valid = nh_grp->adj_index_valid;
	old_adj_index = nh_grp->adj_index;
	old_ecmp_size = nh_grp->ecmp_size;
	nh_grp->adj_index_valid = 1;
	nh_grp->adj_index = adj_index;
	nh_grp->ecmp_size = ecmp_size;
1547
	err = mlxsw_sp_nexthop_group_mac_update(mlxsw_sp, nh_grp, true);
1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611
	if (err) {
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to update neigh MAC in adjacency table.\n");
		goto set_trap;
	}

	if (!old_adj_index_valid) {
		/* The trap was set for fib entries, so we have to call
		 * fib entry update to unset it and use adjacency index.
		 */
		err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp);
		if (err) {
			dev_warn(mlxsw_sp->bus_info->dev, "Failed to add adjacency index to fib entries.\n");
			goto set_trap;
		}
		return;
	}

	err = mlxsw_sp_adj_index_mass_update(mlxsw_sp, nh_grp,
					     old_adj_index, old_ecmp_size);
	mlxsw_sp_kvdl_free(mlxsw_sp, old_adj_index);
	if (err) {
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to mass-update adjacency index for nexthop group.\n");
		goto set_trap;
	}
	return;

set_trap:
	old_adj_index_valid = nh_grp->adj_index_valid;
	nh_grp->adj_index_valid = 0;
	for (i = 0; i < nh_grp->count; i++) {
		nh = &nh_grp->nexthops[i];
		nh->offloaded = 0;
	}
	err = mlxsw_sp_nexthop_fib_entries_update(mlxsw_sp, nh_grp);
	if (err)
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to set traps for fib entries.\n");
	if (old_adj_index_valid)
		mlxsw_sp_kvdl_free(mlxsw_sp, nh_grp->adj_index);
}

static void __mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp_nexthop *nh,
					    bool removing)
{
	if (!removing && !nh->should_offload)
		nh->should_offload = 1;
	else if (removing && nh->offloaded)
		nh->should_offload = 0;
	nh->update = 1;
}

static void
mlxsw_sp_nexthop_neigh_update(struct mlxsw_sp *mlxsw_sp,
			      struct mlxsw_sp_neigh_entry *neigh_entry,
			      bool removing)
{
	struct mlxsw_sp_nexthop *nh;

	list_for_each_entry(nh, &neigh_entry->nexthop_list,
			    neigh_list_node) {
		__mlxsw_sp_nexthop_neigh_update(nh, removing);
		mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp);
	}
}

1612
static void mlxsw_sp_nexthop_rif_init(struct mlxsw_sp_nexthop *nh,
1613
				      struct mlxsw_sp_rif *rif)
1614
{
1615
	if (nh->rif)
1616 1617
		return;

1618 1619
	nh->rif = rif;
	list_add(&nh->rif_list_node, &rif->nexthop_list);
1620 1621 1622 1623
}

static void mlxsw_sp_nexthop_rif_fini(struct mlxsw_sp_nexthop *nh)
{
1624
	if (!nh->rif)
1625 1626 1627
		return;

	list_del(&nh->rif_list_node);
1628
	nh->rif = NULL;
1629 1630
}

1631 1632
static int mlxsw_sp_nexthop_neigh_init(struct mlxsw_sp *mlxsw_sp,
				       struct mlxsw_sp_nexthop *nh)
1633 1634
{
	struct mlxsw_sp_neigh_entry *neigh_entry;
1635
	struct fib_nh *fib_nh = nh->key.fib_nh;
1636
	struct neighbour *n;
1637
	u8 nud_state, dead;
1638 1639
	int err;

1640
	if (!nh->nh_grp->gateway || nh->neigh_entry)
1641 1642
		return 0;

1643 1644 1645
	/* Take a reference of neigh here ensuring that neigh would
	 * not be detructed before the nexthop entry is finished.
	 * The reference is taken either in neigh_lookup() or
1646
	 * in neigh_create() in case n is not found.
1647
	 */
1648
	n = neigh_lookup(&arp_tbl, &fib_nh->nh_gw, fib_nh->nh_dev);
1649
	if (!n) {
1650 1651 1652
		n = neigh_create(&arp_tbl, &fib_nh->nh_gw, fib_nh->nh_dev);
		if (IS_ERR(n))
			return PTR_ERR(n);
1653
		neigh_event_send(n, NULL);
1654 1655 1656
	}
	neigh_entry = mlxsw_sp_neigh_entry_lookup(mlxsw_sp, n);
	if (!neigh_entry) {
1657 1658
		neigh_entry = mlxsw_sp_neigh_entry_create(mlxsw_sp, n);
		if (IS_ERR(neigh_entry)) {
1659 1660
			err = -EINVAL;
			goto err_neigh_entry_create;
1661
		}
1662
	}
1663 1664 1665 1666 1667 1668

	/* If that is the first nexthop connected to that neigh, add to
	 * nexthop_neighs_list
	 */
	if (list_empty(&neigh_entry->nexthop_list))
		list_add_tail(&neigh_entry->nexthop_neighs_list_node,
1669
			      &mlxsw_sp->router->nexthop_neighs_list);
1670

1671 1672 1673 1674
	nh->neigh_entry = neigh_entry;
	list_add_tail(&nh->neigh_list_node, &neigh_entry->nexthop_list);
	read_lock_bh(&n->lock);
	nud_state = n->nud_state;
1675
	dead = n->dead;
1676
	read_unlock_bh(&n->lock);
1677
	__mlxsw_sp_nexthop_neigh_update(nh, !(nud_state & NUD_VALID && !dead));
1678 1679

	return 0;
1680 1681 1682 1683

err_neigh_entry_create:
	neigh_release(n);
	return err;
1684 1685
}

1686 1687
static void mlxsw_sp_nexthop_neigh_fini(struct mlxsw_sp *mlxsw_sp,
					struct mlxsw_sp_nexthop *nh)
1688 1689
{
	struct mlxsw_sp_neigh_entry *neigh_entry = nh->neigh_entry;
1690
	struct neighbour *n;
1691

1692
	if (!neigh_entry)
1693 1694
		return;
	n = neigh_entry->key.n;
1695

1696
	__mlxsw_sp_nexthop_neigh_update(nh, true);
1697
	list_del(&nh->neigh_list_node);
1698
	nh->neigh_entry = NULL;
1699 1700 1701 1702

	/* If that is the last nexthop connected to that neigh, remove from
	 * nexthop_neighs_list
	 */
1703 1704
	if (list_empty(&neigh_entry->nexthop_list))
		list_del(&neigh_entry->nexthop_neighs_list_node);
1705

1706 1707 1708 1709
	if (!neigh_entry->connected && list_empty(&neigh_entry->nexthop_list))
		mlxsw_sp_neigh_entry_destroy(mlxsw_sp, neigh_entry);

	neigh_release(n);
1710
}
1711

1712 1713 1714 1715 1716 1717
static int mlxsw_sp_nexthop_init(struct mlxsw_sp *mlxsw_sp,
				 struct mlxsw_sp_nexthop_group *nh_grp,
				 struct mlxsw_sp_nexthop *nh,
				 struct fib_nh *fib_nh)
{
	struct net_device *dev = fib_nh->nh_dev;
1718
	struct in_device *in_dev;
1719
	struct mlxsw_sp_rif *rif;
1720 1721 1722 1723 1724 1725 1726 1727
	int err;

	nh->nh_grp = nh_grp;
	nh->key.fib_nh = fib_nh;
	err = mlxsw_sp_nexthop_insert(mlxsw_sp, nh);
	if (err)
		return err;

1728 1729 1730
	if (!dev)
		return 0;

1731 1732 1733 1734 1735
	in_dev = __in_dev_get_rtnl(dev);
	if (in_dev && IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
	    fib_nh->nh_flags & RTNH_F_LINKDOWN)
		return 0;

1736 1737
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, dev);
	if (!rif)
1738
		return 0;
1739
	mlxsw_sp_nexthop_rif_init(nh, rif);
1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755

	err = mlxsw_sp_nexthop_neigh_init(mlxsw_sp, nh);
	if (err)
		goto err_nexthop_neigh_init;

	return 0;

err_nexthop_neigh_init:
	mlxsw_sp_nexthop_remove(mlxsw_sp, nh);
	return err;
}

static void mlxsw_sp_nexthop_fini(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_nexthop *nh)
{
	mlxsw_sp_nexthop_neigh_fini(mlxsw_sp, nh);
1756
	mlxsw_sp_nexthop_rif_fini(nh);
1757
	mlxsw_sp_nexthop_remove(mlxsw_sp, nh);
1758 1759
}

1760 1761 1762 1763 1764
static void mlxsw_sp_nexthop_event(struct mlxsw_sp *mlxsw_sp,
				   unsigned long event, struct fib_nh *fib_nh)
{
	struct mlxsw_sp_nexthop_key key;
	struct mlxsw_sp_nexthop *nh;
1765
	struct mlxsw_sp_rif *rif;
1766

1767
	if (mlxsw_sp->router->aborted)
1768 1769 1770 1771 1772 1773 1774
		return;

	key.fib_nh = fib_nh;
	nh = mlxsw_sp_nexthop_lookup(mlxsw_sp, key);
	if (WARN_ON_ONCE(!nh))
		return;

1775 1776
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, fib_nh->nh_dev);
	if (!rif)
1777 1778 1779 1780
		return;

	switch (event) {
	case FIB_EVENT_NH_ADD:
1781
		mlxsw_sp_nexthop_rif_init(nh, rif);
1782 1783 1784 1785
		mlxsw_sp_nexthop_neigh_init(mlxsw_sp, nh);
		break;
	case FIB_EVENT_NH_DEL:
		mlxsw_sp_nexthop_neigh_fini(mlxsw_sp, nh);
1786
		mlxsw_sp_nexthop_rif_fini(nh);
1787 1788 1789 1790 1791 1792
		break;
	}

	mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp);
}

1793
static void mlxsw_sp_nexthop_rif_gone_sync(struct mlxsw_sp *mlxsw_sp,
1794
					   struct mlxsw_sp_rif *rif)
1795 1796 1797
{
	struct mlxsw_sp_nexthop *nh, *tmp;

1798
	list_for_each_entry_safe(nh, tmp, &rif->nexthop_list, rif_list_node) {
1799 1800 1801 1802 1803 1804
		mlxsw_sp_nexthop_neigh_fini(mlxsw_sp, nh);
		mlxsw_sp_nexthop_rif_fini(nh);
		mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh->nh_grp);
	}
}

1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820
static struct mlxsw_sp_nexthop_group *
mlxsw_sp_nexthop_group_create(struct mlxsw_sp *mlxsw_sp, struct fib_info *fi)
{
	struct mlxsw_sp_nexthop_group *nh_grp;
	struct mlxsw_sp_nexthop *nh;
	struct fib_nh *fib_nh;
	size_t alloc_size;
	int i;
	int err;

	alloc_size = sizeof(*nh_grp) +
		     fi->fib_nhs * sizeof(struct mlxsw_sp_nexthop);
	nh_grp = kzalloc(alloc_size, GFP_KERNEL);
	if (!nh_grp)
		return ERR_PTR(-ENOMEM);
	INIT_LIST_HEAD(&nh_grp->fib_list);
1821
	nh_grp->gateway = fi->fib_nh->nh_scope == RT_SCOPE_LINK;
1822
	nh_grp->count = fi->fib_nhs;
1823
	nh_grp->key.fi = fi;
1824 1825 1826 1827 1828 1829 1830
	for (i = 0; i < nh_grp->count; i++) {
		nh = &nh_grp->nexthops[i];
		fib_nh = &fi->fib_nh[i];
		err = mlxsw_sp_nexthop_init(mlxsw_sp, nh_grp, nh, fib_nh);
		if (err)
			goto err_nexthop_init;
	}
1831 1832 1833
	err = mlxsw_sp_nexthop_group_insert(mlxsw_sp, nh_grp);
	if (err)
		goto err_nexthop_group_insert;
1834 1835 1836
	mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh_grp);
	return nh_grp;

1837
err_nexthop_group_insert:
1838
err_nexthop_init:
1839 1840
	for (i--; i >= 0; i--) {
		nh = &nh_grp->nexthops[i];
1841
		mlxsw_sp_nexthop_fini(mlxsw_sp, nh);
1842
	}
1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853
	kfree(nh_grp);
	return ERR_PTR(err);
}

static void
mlxsw_sp_nexthop_group_destroy(struct mlxsw_sp *mlxsw_sp,
			       struct mlxsw_sp_nexthop_group *nh_grp)
{
	struct mlxsw_sp_nexthop *nh;
	int i;

1854
	mlxsw_sp_nexthop_group_remove(mlxsw_sp, nh_grp);
1855 1856 1857 1858
	for (i = 0; i < nh_grp->count; i++) {
		nh = &nh_grp->nexthops[i];
		mlxsw_sp_nexthop_fini(mlxsw_sp, nh);
	}
1859 1860
	mlxsw_sp_nexthop_group_refresh(mlxsw_sp, nh_grp);
	WARN_ON_ONCE(nh_grp->adj_index_valid);
1861 1862 1863 1864 1865 1866 1867
	kfree(nh_grp);
}

static int mlxsw_sp_nexthop_group_get(struct mlxsw_sp *mlxsw_sp,
				      struct mlxsw_sp_fib_entry *fib_entry,
				      struct fib_info *fi)
{
1868
	struct mlxsw_sp_nexthop_group_key key;
1869 1870
	struct mlxsw_sp_nexthop_group *nh_grp;

1871 1872
	key.fi = fi;
	nh_grp = mlxsw_sp_nexthop_group_lookup(mlxsw_sp, key);
1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893
	if (!nh_grp) {
		nh_grp = mlxsw_sp_nexthop_group_create(mlxsw_sp, fi);
		if (IS_ERR(nh_grp))
			return PTR_ERR(nh_grp);
	}
	list_add_tail(&fib_entry->nexthop_group_node, &nh_grp->fib_list);
	fib_entry->nh_group = nh_grp;
	return 0;
}

static void mlxsw_sp_nexthop_group_put(struct mlxsw_sp *mlxsw_sp,
				       struct mlxsw_sp_fib_entry *fib_entry)
{
	struct mlxsw_sp_nexthop_group *nh_grp = fib_entry->nh_group;

	list_del(&fib_entry->nexthop_group_node);
	if (!list_empty(&nh_grp->fib_list))
		return;
	mlxsw_sp_nexthop_group_destroy(mlxsw_sp, nh_grp);
}

1894 1895 1896 1897 1898
static bool
mlxsw_sp_fib_entry_should_offload(const struct mlxsw_sp_fib_entry *fib_entry)
{
	struct mlxsw_sp_nexthop_group *nh_group = fib_entry->nh_group;

1899 1900 1901
	if (fib_entry->params.tos)
		return false;

1902 1903 1904 1905
	switch (fib_entry->type) {
	case MLXSW_SP_FIB_ENTRY_TYPE_REMOTE:
		return !!nh_group->adj_index_valid;
	case MLXSW_SP_FIB_ENTRY_TYPE_LOCAL:
1906
		return !!nh_group->nh_rif;
1907 1908 1909 1910 1911 1912 1913 1914 1915
	default:
		return false;
	}
}

static void mlxsw_sp_fib_entry_offload_set(struct mlxsw_sp_fib_entry *fib_entry)
{
	fib_entry->offloaded = true;

1916
	switch (fib_entry->fib_node->fib->proto) {
1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927
	case MLXSW_SP_L3_PROTO_IPV4:
		fib_info_offload_inc(fib_entry->nh_group->key.fi);
		break;
	case MLXSW_SP_L3_PROTO_IPV6:
		WARN_ON_ONCE(1);
	}
}

static void
mlxsw_sp_fib_entry_offload_unset(struct mlxsw_sp_fib_entry *fib_entry)
{
1928
	switch (fib_entry->fib_node->fib->proto) {
1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
	case MLXSW_SP_L3_PROTO_IPV4:
		fib_info_offload_dec(fib_entry->nh_group->key.fi);
		break;
	case MLXSW_SP_L3_PROTO_IPV6:
		WARN_ON_ONCE(1);
	}

	fib_entry->offloaded = false;
}

static void
mlxsw_sp_fib_entry_offload_refresh(struct mlxsw_sp_fib_entry *fib_entry,
				   enum mlxsw_reg_ralue_op op, int err)
{
	switch (op) {
	case MLXSW_REG_RALUE_OP_WRITE_DELETE:
		if (!fib_entry->offloaded)
			return;
		return mlxsw_sp_fib_entry_offload_unset(fib_entry);
	case MLXSW_REG_RALUE_OP_WRITE_WRITE:
		if (err)
			return;
		if (mlxsw_sp_fib_entry_should_offload(fib_entry) &&
		    !fib_entry->offloaded)
			mlxsw_sp_fib_entry_offload_set(fib_entry);
		else if (!mlxsw_sp_fib_entry_should_offload(fib_entry) &&
			 fib_entry->offloaded)
			mlxsw_sp_fib_entry_offload_unset(fib_entry);
		return;
	default:
		return;
	}
}

1963 1964 1965 1966 1967
static int mlxsw_sp_fib_entry_op4_remote(struct mlxsw_sp *mlxsw_sp,
					 struct mlxsw_sp_fib_entry *fib_entry,
					 enum mlxsw_reg_ralue_op op)
{
	char ralue_pl[MLXSW_REG_RALUE_LEN];
1968
	struct mlxsw_sp_fib *fib = fib_entry->fib_node->fib;
1969
	u32 *p_dip = (u32 *) fib_entry->fib_node->key.addr;
1970 1971 1972 1973 1974 1975 1976 1977 1978
	enum mlxsw_reg_ralue_trap_action trap_action;
	u16 trap_id = 0;
	u32 adjacency_index = 0;
	u16 ecmp_size = 0;

	/* In case the nexthop group adjacency index is valid, use it
	 * with provided ECMP size. Otherwise, setup trap and pass
	 * traffic to kernel.
	 */
1979
	if (mlxsw_sp_fib_entry_should_offload(fib_entry)) {
1980 1981 1982 1983 1984 1985 1986 1987
		trap_action = MLXSW_REG_RALUE_TRAP_ACTION_NOP;
		adjacency_index = fib_entry->nh_group->adj_index;
		ecmp_size = fib_entry->nh_group->ecmp_size;
	} else {
		trap_action = MLXSW_REG_RALUE_TRAP_ACTION_TRAP;
		trap_id = MLXSW_TRAP_ID_RTR_INGRESS0;
	}

1988
	mlxsw_reg_ralue_pack4(ralue_pl,
1989 1990
			      (enum mlxsw_reg_ralxx_protocol) fib->proto, op,
			      fib->vr->id, fib_entry->fib_node->key.prefix_len,
1991
			      *p_dip);
1992 1993 1994 1995 1996
	mlxsw_reg_ralue_act_remote_pack(ralue_pl, trap_action, trap_id,
					adjacency_index, ecmp_size);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
}

1997 1998 1999 2000
static int mlxsw_sp_fib_entry_op4_local(struct mlxsw_sp *mlxsw_sp,
					struct mlxsw_sp_fib_entry *fib_entry,
					enum mlxsw_reg_ralue_op op)
{
2001
	struct mlxsw_sp_rif *rif = fib_entry->nh_group->nh_rif;
2002
	struct mlxsw_sp_fib *fib = fib_entry->fib_node->fib;
2003
	enum mlxsw_reg_ralue_trap_action trap_action;
2004
	char ralue_pl[MLXSW_REG_RALUE_LEN];
2005
	u32 *p_dip = (u32 *) fib_entry->fib_node->key.addr;
2006
	u16 trap_id = 0;
2007
	u16 rif_index = 0;
2008 2009 2010

	if (mlxsw_sp_fib_entry_should_offload(fib_entry)) {
		trap_action = MLXSW_REG_RALUE_TRAP_ACTION_NOP;
2011
		rif_index = rif->rif_index;
2012 2013 2014 2015
	} else {
		trap_action = MLXSW_REG_RALUE_TRAP_ACTION_TRAP;
		trap_id = MLXSW_TRAP_ID_RTR_INGRESS0;
	}
2016

2017
	mlxsw_reg_ralue_pack4(ralue_pl,
2018 2019
			      (enum mlxsw_reg_ralxx_protocol) fib->proto, op,
			      fib->vr->id, fib_entry->fib_node->key.prefix_len,
2020
			      *p_dip);
2021 2022
	mlxsw_reg_ralue_act_local_pack(ralue_pl, trap_action, trap_id,
				       rif_index);
2023 2024 2025 2026 2027 2028 2029
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
}

static int mlxsw_sp_fib_entry_op4_trap(struct mlxsw_sp *mlxsw_sp,
				       struct mlxsw_sp_fib_entry *fib_entry,
				       enum mlxsw_reg_ralue_op op)
{
2030
	struct mlxsw_sp_fib *fib = fib_entry->fib_node->fib;
2031
	char ralue_pl[MLXSW_REG_RALUE_LEN];
2032
	u32 *p_dip = (u32 *) fib_entry->fib_node->key.addr;
2033

2034
	mlxsw_reg_ralue_pack4(ralue_pl,
2035 2036
			      (enum mlxsw_reg_ralxx_protocol) fib->proto, op,
			      fib->vr->id, fib_entry->fib_node->key.prefix_len,
2037
			      *p_dip);
2038 2039 2040 2041 2042 2043 2044 2045 2046 2047
	mlxsw_reg_ralue_act_ip2me_pack(ralue_pl);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue), ralue_pl);
}

static int mlxsw_sp_fib_entry_op4(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_fib_entry *fib_entry,
				  enum mlxsw_reg_ralue_op op)
{
	switch (fib_entry->type) {
	case MLXSW_SP_FIB_ENTRY_TYPE_REMOTE:
2048
		return mlxsw_sp_fib_entry_op4_remote(mlxsw_sp, fib_entry, op);
2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060
	case MLXSW_SP_FIB_ENTRY_TYPE_LOCAL:
		return mlxsw_sp_fib_entry_op4_local(mlxsw_sp, fib_entry, op);
	case MLXSW_SP_FIB_ENTRY_TYPE_TRAP:
		return mlxsw_sp_fib_entry_op4_trap(mlxsw_sp, fib_entry, op);
	}
	return -EINVAL;
}

static int mlxsw_sp_fib_entry_op(struct mlxsw_sp *mlxsw_sp,
				 struct mlxsw_sp_fib_entry *fib_entry,
				 enum mlxsw_reg_ralue_op op)
{
2061 2062
	int err = -EINVAL;

2063
	switch (fib_entry->fib_node->fib->proto) {
2064
	case MLXSW_SP_L3_PROTO_IPV4:
2065 2066
		err = mlxsw_sp_fib_entry_op4(mlxsw_sp, fib_entry, op);
		break;
2067
	case MLXSW_SP_L3_PROTO_IPV6:
2068
		return err;
2069
	}
2070 2071
	mlxsw_sp_fib_entry_offload_refresh(fib_entry, op, err);
	return err;
2072 2073 2074 2075 2076
}

static int mlxsw_sp_fib_entry_update(struct mlxsw_sp *mlxsw_sp,
				     struct mlxsw_sp_fib_entry *fib_entry)
{
2077 2078
	return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry,
				     MLXSW_REG_RALUE_OP_WRITE_WRITE);
2079 2080 2081 2082 2083 2084 2085 2086 2087 2088
}

static int mlxsw_sp_fib_entry_del(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_fib_entry *fib_entry)
{
	return mlxsw_sp_fib_entry_op(mlxsw_sp, fib_entry,
				     MLXSW_REG_RALUE_OP_WRITE_DELETE);
}

static int
2089 2090 2091
mlxsw_sp_fib4_entry_type_set(struct mlxsw_sp *mlxsw_sp,
			     const struct fib_entry_notifier_info *fen_info,
			     struct mlxsw_sp_fib_entry *fib_entry)
2092
{
2093
	struct fib_info *fi = fen_info->fi;
2094

2095 2096 2097
	switch (fen_info->type) {
	case RTN_BROADCAST: /* fall through */
	case RTN_LOCAL:
2098 2099
		fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_TRAP;
		return 0;
2100 2101 2102 2103 2104 2105 2106
	case RTN_UNREACHABLE: /* fall through */
	case RTN_BLACKHOLE: /* fall through */
	case RTN_PROHIBIT:
		/* Packets hitting these routes need to be trapped, but
		 * can do so with a lower priority than packets directed
		 * at the host, so use action type local instead of trap.
		 */
2107
		fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_LOCAL;
2108 2109 2110 2111 2112 2113 2114 2115 2116 2117
		return 0;
	case RTN_UNICAST:
		if (fi->fib_nh->nh_scope != RT_SCOPE_LINK)
			fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_LOCAL;
		else
			fib_entry->type = MLXSW_SP_FIB_ENTRY_TYPE_REMOTE;
		return 0;
	default:
		return -EINVAL;
	}
2118 2119
}

2120
static struct mlxsw_sp_fib_entry *
2121 2122 2123
mlxsw_sp_fib4_entry_create(struct mlxsw_sp *mlxsw_sp,
			   struct mlxsw_sp_fib_node *fib_node,
			   const struct fib_entry_notifier_info *fen_info)
2124 2125 2126 2127
{
	struct mlxsw_sp_fib_entry *fib_entry;
	int err;

2128
	fib_entry = kzalloc(sizeof(*fib_entry), GFP_KERNEL);
2129 2130
	if (!fib_entry) {
		err = -ENOMEM;
2131
		goto err_fib_entry_alloc;
2132 2133
	}

2134
	err = mlxsw_sp_fib4_entry_type_set(mlxsw_sp, fen_info, fib_entry);
2135
	if (err)
2136
		goto err_fib4_entry_type_set;
2137

2138
	err = mlxsw_sp_nexthop_group_get(mlxsw_sp, fib_entry, fen_info->fi);
2139 2140 2141
	if (err)
		goto err_nexthop_group_get;

2142 2143 2144 2145 2146 2147 2148
	fib_entry->params.prio = fen_info->fi->fib_priority;
	fib_entry->params.tb_id = fen_info->tb_id;
	fib_entry->params.type = fen_info->type;
	fib_entry->params.tos = fen_info->tos;

	fib_entry->fib_node = fib_node;

2149 2150
	return fib_entry;

2151
err_nexthop_group_get:
2152
err_fib4_entry_type_set:
2153 2154
	kfree(fib_entry);
err_fib_entry_alloc:
2155 2156 2157
	return ERR_PTR(err);
}

2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168
static void mlxsw_sp_fib4_entry_destroy(struct mlxsw_sp *mlxsw_sp,
					struct mlxsw_sp_fib_entry *fib_entry)
{
	mlxsw_sp_nexthop_group_put(mlxsw_sp, fib_entry);
	kfree(fib_entry);
}

static struct mlxsw_sp_fib_node *
mlxsw_sp_fib4_node_get(struct mlxsw_sp *mlxsw_sp,
		       const struct fib_entry_notifier_info *fen_info);

2169
static struct mlxsw_sp_fib_entry *
2170 2171
mlxsw_sp_fib4_entry_lookup(struct mlxsw_sp *mlxsw_sp,
			   const struct fib_entry_notifier_info *fen_info)
2172
{
2173 2174
	struct mlxsw_sp_fib_entry *fib_entry;
	struct mlxsw_sp_fib_node *fib_node;
2175

2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225
	fib_node = mlxsw_sp_fib4_node_get(mlxsw_sp, fen_info);
	if (IS_ERR(fib_node))
		return NULL;

	list_for_each_entry(fib_entry, &fib_node->entry_list, list) {
		if (fib_entry->params.tb_id == fen_info->tb_id &&
		    fib_entry->params.tos == fen_info->tos &&
		    fib_entry->params.type == fen_info->type &&
		    fib_entry->nh_group->key.fi == fen_info->fi) {
			return fib_entry;
		}
	}

	return NULL;
}

static const struct rhashtable_params mlxsw_sp_fib_ht_params = {
	.key_offset = offsetof(struct mlxsw_sp_fib_node, key),
	.head_offset = offsetof(struct mlxsw_sp_fib_node, ht_node),
	.key_len = sizeof(struct mlxsw_sp_fib_key),
	.automatic_shrinking = true,
};

static int mlxsw_sp_fib_node_insert(struct mlxsw_sp_fib *fib,
				    struct mlxsw_sp_fib_node *fib_node)
{
	return rhashtable_insert_fast(&fib->ht, &fib_node->ht_node,
				      mlxsw_sp_fib_ht_params);
}

static void mlxsw_sp_fib_node_remove(struct mlxsw_sp_fib *fib,
				     struct mlxsw_sp_fib_node *fib_node)
{
	rhashtable_remove_fast(&fib->ht, &fib_node->ht_node,
			       mlxsw_sp_fib_ht_params);
}

static struct mlxsw_sp_fib_node *
mlxsw_sp_fib_node_lookup(struct mlxsw_sp_fib *fib, const void *addr,
			 size_t addr_len, unsigned char prefix_len)
{
	struct mlxsw_sp_fib_key key;

	memset(&key, 0, sizeof(key));
	memcpy(key.addr, addr, addr_len);
	key.prefix_len = prefix_len;
	return rhashtable_lookup_fast(&fib->ht, &key, mlxsw_sp_fib_ht_params);
}

static struct mlxsw_sp_fib_node *
2226
mlxsw_sp_fib_node_create(struct mlxsw_sp_fib *fib, const void *addr,
2227 2228 2229 2230 2231 2232
			 size_t addr_len, unsigned char prefix_len)
{
	struct mlxsw_sp_fib_node *fib_node;

	fib_node = kzalloc(sizeof(*fib_node), GFP_KERNEL);
	if (!fib_node)
2233 2234
		return NULL;

2235
	INIT_LIST_HEAD(&fib_node->entry_list);
2236
	list_add(&fib_node->list, &fib->node_list);
2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260
	memcpy(fib_node->key.addr, addr, addr_len);
	fib_node->key.prefix_len = prefix_len;

	return fib_node;
}

static void mlxsw_sp_fib_node_destroy(struct mlxsw_sp_fib_node *fib_node)
{
	list_del(&fib_node->list);
	WARN_ON(!list_empty(&fib_node->entry_list));
	kfree(fib_node);
}

static bool
mlxsw_sp_fib_node_entry_is_first(const struct mlxsw_sp_fib_node *fib_node,
				 const struct mlxsw_sp_fib_entry *fib_entry)
{
	return list_first_entry(&fib_node->entry_list,
				struct mlxsw_sp_fib_entry, list) == fib_entry;
}

static void mlxsw_sp_fib_node_prefix_inc(struct mlxsw_sp_fib_node *fib_node)
{
	unsigned char prefix_len = fib_node->key.prefix_len;
2261
	struct mlxsw_sp_fib *fib = fib_node->fib;
2262 2263 2264 2265 2266 2267 2268 2269

	if (fib->prefix_ref_count[prefix_len]++ == 0)
		mlxsw_sp_prefix_usage_set(&fib->prefix_usage, prefix_len);
}

static void mlxsw_sp_fib_node_prefix_dec(struct mlxsw_sp_fib_node *fib_node)
{
	unsigned char prefix_len = fib_node->key.prefix_len;
2270
	struct mlxsw_sp_fib *fib = fib_node->fib;
2271 2272 2273

	if (--fib->prefix_ref_count[prefix_len] == 0)
		mlxsw_sp_prefix_usage_clear(&fib->prefix_usage, prefix_len);
2274 2275
}

2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340
static int mlxsw_sp_fib_node_init(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_fib_node *fib_node,
				  struct mlxsw_sp_fib *fib)
{
	struct mlxsw_sp_prefix_usage req_prefix_usage;
	struct mlxsw_sp_lpm_tree *lpm_tree;
	int err;

	err = mlxsw_sp_fib_node_insert(fib, fib_node);
	if (err)
		return err;
	fib_node->fib = fib;

	mlxsw_sp_prefix_usage_cpy(&req_prefix_usage, &fib->prefix_usage);
	mlxsw_sp_prefix_usage_set(&req_prefix_usage, fib_node->key.prefix_len);

	if (!mlxsw_sp_prefix_usage_none(&fib->prefix_usage)) {
		err = mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, fib,
						 &req_prefix_usage);
		if (err)
			goto err_tree_check;
	} else {
		lpm_tree = mlxsw_sp_lpm_tree_get(mlxsw_sp, &req_prefix_usage,
						 fib->proto);
		if (IS_ERR(lpm_tree))
			return PTR_ERR(lpm_tree);
		fib->lpm_tree = lpm_tree;
		err = mlxsw_sp_vr_lpm_tree_bind(mlxsw_sp, fib);
		if (err)
			goto err_tree_bind;
	}

	mlxsw_sp_fib_node_prefix_inc(fib_node);

	return 0;

err_tree_bind:
	fib->lpm_tree = NULL;
	mlxsw_sp_lpm_tree_put(mlxsw_sp, lpm_tree);
err_tree_check:
	fib_node->fib = NULL;
	mlxsw_sp_fib_node_remove(fib, fib_node);
	return err;
}

static void mlxsw_sp_fib_node_fini(struct mlxsw_sp *mlxsw_sp,
				   struct mlxsw_sp_fib_node *fib_node)
{
	struct mlxsw_sp_lpm_tree *lpm_tree = fib_node->fib->lpm_tree;
	struct mlxsw_sp_fib *fib = fib_node->fib;

	mlxsw_sp_fib_node_prefix_dec(fib_node);

	if (mlxsw_sp_prefix_usage_none(&fib->prefix_usage)) {
		mlxsw_sp_vr_lpm_tree_unbind(mlxsw_sp, fib);
		fib->lpm_tree = NULL;
		mlxsw_sp_lpm_tree_put(mlxsw_sp, lpm_tree);
	} else {
		mlxsw_sp_vr_lpm_tree_check(mlxsw_sp, fib, &fib->prefix_usage);
	}

	fib_node->fib = NULL;
	mlxsw_sp_fib_node_remove(fib, fib_node);
}

2341 2342 2343
static struct mlxsw_sp_fib_node *
mlxsw_sp_fib4_node_get(struct mlxsw_sp *mlxsw_sp,
		       const struct fib_entry_notifier_info *fen_info)
2344
{
2345
	struct mlxsw_sp_fib_node *fib_node;
2346
	struct mlxsw_sp_fib *fib;
2347 2348 2349
	struct mlxsw_sp_vr *vr;
	int err;

2350
	vr = mlxsw_sp_vr_get(mlxsw_sp, fen_info->tb_id);
2351 2352
	if (IS_ERR(vr))
		return ERR_CAST(vr);
2353
	fib = mlxsw_sp_vr_fib(vr, MLXSW_SP_L3_PROTO_IPV4);
2354

2355
	fib_node = mlxsw_sp_fib_node_lookup(fib, &fen_info->dst,
2356 2357 2358 2359
					    sizeof(fen_info->dst),
					    fen_info->dst_len);
	if (fib_node)
		return fib_node;
2360

2361
	fib_node = mlxsw_sp_fib_node_create(fib, &fen_info->dst,
2362 2363 2364 2365 2366
					    sizeof(fen_info->dst),
					    fen_info->dst_len);
	if (!fib_node) {
		err = -ENOMEM;
		goto err_fib_node_create;
2367
	}
2368

2369 2370 2371 2372
	err = mlxsw_sp_fib_node_init(mlxsw_sp, fib_node, fib);
	if (err)
		goto err_fib_node_init;

2373 2374
	return fib_node;

2375 2376
err_fib_node_init:
	mlxsw_sp_fib_node_destroy(fib_node);
2377
err_fib_node_create:
2378
	mlxsw_sp_vr_put(vr);
2379
	return ERR_PTR(err);
2380 2381
}

2382 2383
static void mlxsw_sp_fib4_node_put(struct mlxsw_sp *mlxsw_sp,
				   struct mlxsw_sp_fib_node *fib_node)
2384
{
2385
	struct mlxsw_sp_vr *vr = fib_node->fib->vr;
2386

2387 2388
	if (!list_empty(&fib_node->entry_list))
		return;
2389
	mlxsw_sp_fib_node_fini(mlxsw_sp, fib_node);
2390
	mlxsw_sp_fib_node_destroy(fib_node);
2391
	mlxsw_sp_vr_put(vr);
2392 2393
}

2394 2395 2396
static struct mlxsw_sp_fib_entry *
mlxsw_sp_fib4_node_entry_find(const struct mlxsw_sp_fib_node *fib_node,
			      const struct mlxsw_sp_fib_entry_params *params)
2397 2398
{
	struct mlxsw_sp_fib_entry *fib_entry;
2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414

	list_for_each_entry(fib_entry, &fib_node->entry_list, list) {
		if (fib_entry->params.tb_id > params->tb_id)
			continue;
		if (fib_entry->params.tb_id != params->tb_id)
			break;
		if (fib_entry->params.tos > params->tos)
			continue;
		if (fib_entry->params.prio >= params->prio ||
		    fib_entry->params.tos < params->tos)
			return fib_entry;
	}

	return NULL;
}

2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434
static int mlxsw_sp_fib4_node_list_append(struct mlxsw_sp_fib_entry *fib_entry,
					  struct mlxsw_sp_fib_entry *new_entry)
{
	struct mlxsw_sp_fib_node *fib_node;

	if (WARN_ON(!fib_entry))
		return -EINVAL;

	fib_node = fib_entry->fib_node;
	list_for_each_entry_from(fib_entry, &fib_node->entry_list, list) {
		if (fib_entry->params.tb_id != new_entry->params.tb_id ||
		    fib_entry->params.tos != new_entry->params.tos ||
		    fib_entry->params.prio != new_entry->params.prio)
			break;
	}

	list_add_tail(&new_entry->list, &fib_entry->list);
	return 0;
}

2435 2436
static int
mlxsw_sp_fib4_node_list_insert(struct mlxsw_sp_fib_node *fib_node,
2437
			       struct mlxsw_sp_fib_entry *new_entry,
2438
			       bool replace, bool append)
2439 2440 2441 2442 2443
{
	struct mlxsw_sp_fib_entry *fib_entry;

	fib_entry = mlxsw_sp_fib4_node_entry_find(fib_node, &new_entry->params);

2444 2445
	if (append)
		return mlxsw_sp_fib4_node_list_append(fib_entry, new_entry);
2446 2447
	if (replace && WARN_ON(!fib_entry))
		return -EINVAL;
2448

2449 2450 2451
	/* Insert new entry before replaced one, so that we can later
	 * remove the second.
	 */
2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520
	if (fib_entry) {
		list_add_tail(&new_entry->list, &fib_entry->list);
	} else {
		struct mlxsw_sp_fib_entry *last;

		list_for_each_entry(last, &fib_node->entry_list, list) {
			if (new_entry->params.tb_id > last->params.tb_id)
				break;
			fib_entry = last;
		}

		if (fib_entry)
			list_add(&new_entry->list, &fib_entry->list);
		else
			list_add(&new_entry->list, &fib_node->entry_list);
	}

	return 0;
}

static void
mlxsw_sp_fib4_node_list_remove(struct mlxsw_sp_fib_entry *fib_entry)
{
	list_del(&fib_entry->list);
}

static int
mlxsw_sp_fib4_node_entry_add(struct mlxsw_sp *mlxsw_sp,
			     const struct mlxsw_sp_fib_node *fib_node,
			     struct mlxsw_sp_fib_entry *fib_entry)
{
	if (!mlxsw_sp_fib_node_entry_is_first(fib_node, fib_entry))
		return 0;

	/* To prevent packet loss, overwrite the previously offloaded
	 * entry.
	 */
	if (!list_is_singular(&fib_node->entry_list)) {
		enum mlxsw_reg_ralue_op op = MLXSW_REG_RALUE_OP_WRITE_DELETE;
		struct mlxsw_sp_fib_entry *n = list_next_entry(fib_entry, list);

		mlxsw_sp_fib_entry_offload_refresh(n, op, 0);
	}

	return mlxsw_sp_fib_entry_update(mlxsw_sp, fib_entry);
}

static void
mlxsw_sp_fib4_node_entry_del(struct mlxsw_sp *mlxsw_sp,
			     const struct mlxsw_sp_fib_node *fib_node,
			     struct mlxsw_sp_fib_entry *fib_entry)
{
	if (!mlxsw_sp_fib_node_entry_is_first(fib_node, fib_entry))
		return;

	/* Promote the next entry by overwriting the deleted entry */
	if (!list_is_singular(&fib_node->entry_list)) {
		struct mlxsw_sp_fib_entry *n = list_next_entry(fib_entry, list);
		enum mlxsw_reg_ralue_op op = MLXSW_REG_RALUE_OP_WRITE_DELETE;

		mlxsw_sp_fib_entry_update(mlxsw_sp, n);
		mlxsw_sp_fib_entry_offload_refresh(fib_entry, op, 0);
		return;
	}

	mlxsw_sp_fib_entry_del(mlxsw_sp, fib_entry);
}

static int mlxsw_sp_fib4_node_entry_link(struct mlxsw_sp *mlxsw_sp,
2521
					 struct mlxsw_sp_fib_entry *fib_entry,
2522
					 bool replace, bool append)
2523 2524 2525 2526
{
	struct mlxsw_sp_fib_node *fib_node = fib_entry->fib_node;
	int err;

2527 2528
	err = mlxsw_sp_fib4_node_list_insert(fib_node, fib_entry, replace,
					     append);
2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552
	if (err)
		return err;

	err = mlxsw_sp_fib4_node_entry_add(mlxsw_sp, fib_node, fib_entry);
	if (err)
		goto err_fib4_node_entry_add;

	return 0;

err_fib4_node_entry_add:
	mlxsw_sp_fib4_node_list_remove(fib_entry);
	return err;
}

static void
mlxsw_sp_fib4_node_entry_unlink(struct mlxsw_sp *mlxsw_sp,
				struct mlxsw_sp_fib_entry *fib_entry)
{
	struct mlxsw_sp_fib_node *fib_node = fib_entry->fib_node;

	mlxsw_sp_fib4_node_entry_del(mlxsw_sp, fib_node, fib_entry);
	mlxsw_sp_fib4_node_list_remove(fib_entry);
}

2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570
static void mlxsw_sp_fib4_entry_replace(struct mlxsw_sp *mlxsw_sp,
					struct mlxsw_sp_fib_entry *fib_entry,
					bool replace)
{
	struct mlxsw_sp_fib_node *fib_node = fib_entry->fib_node;
	struct mlxsw_sp_fib_entry *replaced;

	if (!replace)
		return;

	/* We inserted the new entry before replaced one */
	replaced = list_next_entry(fib_entry, list);

	mlxsw_sp_fib4_node_entry_unlink(mlxsw_sp, replaced);
	mlxsw_sp_fib4_entry_destroy(mlxsw_sp, replaced);
	mlxsw_sp_fib4_node_put(mlxsw_sp, fib_node);
}

2571 2572
static int
mlxsw_sp_router_fib4_add(struct mlxsw_sp *mlxsw_sp,
2573
			 const struct fib_entry_notifier_info *fen_info,
2574
			 bool replace, bool append)
2575 2576 2577
{
	struct mlxsw_sp_fib_entry *fib_entry;
	struct mlxsw_sp_fib_node *fib_node;
2578 2579
	int err;

2580
	if (mlxsw_sp->router->aborted)
2581 2582
		return 0;

2583 2584 2585 2586
	fib_node = mlxsw_sp_fib4_node_get(mlxsw_sp, fen_info);
	if (IS_ERR(fib_node)) {
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to get FIB node\n");
		return PTR_ERR(fib_node);
2587
	}
2588

2589 2590 2591 2592 2593 2594
	fib_entry = mlxsw_sp_fib4_entry_create(mlxsw_sp, fib_node, fen_info);
	if (IS_ERR(fib_entry)) {
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to create FIB entry\n");
		err = PTR_ERR(fib_entry);
		goto err_fib4_entry_create;
	}
2595

2596 2597
	err = mlxsw_sp_fib4_node_entry_link(mlxsw_sp, fib_entry, replace,
					    append);
2598
	if (err) {
2599 2600
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to link FIB entry to node\n");
		goto err_fib4_node_entry_link;
2601
	}
2602

2603 2604
	mlxsw_sp_fib4_entry_replace(mlxsw_sp, fib_entry, replace);

2605 2606
	return 0;

2607 2608 2609 2610
err_fib4_node_entry_link:
	mlxsw_sp_fib4_entry_destroy(mlxsw_sp, fib_entry);
err_fib4_entry_create:
	mlxsw_sp_fib4_node_put(mlxsw_sp, fib_node);
2611 2612 2613
	return err;
}

2614 2615
static void mlxsw_sp_router_fib4_del(struct mlxsw_sp *mlxsw_sp,
				     struct fib_entry_notifier_info *fen_info)
2616 2617
{
	struct mlxsw_sp_fib_entry *fib_entry;
2618
	struct mlxsw_sp_fib_node *fib_node;
2619

2620
	if (mlxsw_sp->router->aborted)
2621
		return;
2622

2623 2624
	fib_entry = mlxsw_sp_fib4_entry_lookup(mlxsw_sp, fen_info);
	if (WARN_ON(!fib_entry))
2625
		return;
2626
	fib_node = fib_entry->fib_node;
2627

2628 2629 2630
	mlxsw_sp_fib4_node_entry_unlink(mlxsw_sp, fib_entry);
	mlxsw_sp_fib4_entry_destroy(mlxsw_sp, fib_entry);
	mlxsw_sp_fib4_node_put(mlxsw_sp, fib_node);
2631
}
2632 2633 2634 2635 2636

static int mlxsw_sp_router_set_abort_trap(struct mlxsw_sp *mlxsw_sp)
{
	char ralta_pl[MLXSW_REG_RALTA_LEN];
	char ralst_pl[MLXSW_REG_RALST_LEN];
2637
	int i, err;
2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649

	mlxsw_reg_ralta_pack(ralta_pl, true, MLXSW_REG_RALXX_PROTOCOL_IPV4,
			     MLXSW_SP_LPM_TREE_MIN);
	err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralta), ralta_pl);
	if (err)
		return err;

	mlxsw_reg_ralst_pack(ralst_pl, 0xff, MLXSW_SP_LPM_TREE_MIN);
	err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralst), ralst_pl);
	if (err)
		return err;

2650
	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) {
2651
		struct mlxsw_sp_vr *vr = &mlxsw_sp->router->vrs[i];
2652 2653
		char raltb_pl[MLXSW_REG_RALTB_LEN];
		char ralue_pl[MLXSW_REG_RALUE_LEN];
2654

2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676
		if (!mlxsw_sp_vr_is_used(vr))
			continue;

		mlxsw_reg_raltb_pack(raltb_pl, vr->id,
				     MLXSW_REG_RALXX_PROTOCOL_IPV4,
				     MLXSW_SP_LPM_TREE_MIN);
		err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(raltb),
				      raltb_pl);
		if (err)
			return err;

		mlxsw_reg_ralue_pack4(ralue_pl, MLXSW_SP_L3_PROTO_IPV4,
				      MLXSW_REG_RALUE_OP_WRITE_WRITE, vr->id, 0,
				      0);
		mlxsw_reg_ralue_act_ip2me_pack(ralue_pl);
		err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ralue),
				      ralue_pl);
		if (err)
			return err;
	}

	return 0;
2677 2678
}

2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701
static void mlxsw_sp_fib4_node_flush(struct mlxsw_sp *mlxsw_sp,
				     struct mlxsw_sp_fib_node *fib_node)
{
	struct mlxsw_sp_fib_entry *fib_entry, *tmp;

	list_for_each_entry_safe(fib_entry, tmp, &fib_node->entry_list, list) {
		bool do_break = &tmp->list == &fib_node->entry_list;

		mlxsw_sp_fib4_node_entry_unlink(mlxsw_sp, fib_entry);
		mlxsw_sp_fib4_entry_destroy(mlxsw_sp, fib_entry);
		mlxsw_sp_fib4_node_put(mlxsw_sp, fib_node);
		/* Break when entry list is empty and node was freed.
		 * Otherwise, we'll access freed memory in the next
		 * iteration.
		 */
		if (do_break)
			break;
	}
}

static void mlxsw_sp_fib_node_flush(struct mlxsw_sp *mlxsw_sp,
				    struct mlxsw_sp_fib_node *fib_node)
{
2702
	switch (fib_node->fib->proto) {
2703 2704 2705 2706 2707 2708 2709 2710 2711
	case MLXSW_SP_L3_PROTO_IPV4:
		mlxsw_sp_fib4_node_flush(mlxsw_sp, fib_node);
		break;
	case MLXSW_SP_L3_PROTO_IPV6:
		WARN_ON_ONCE(1);
		break;
	}
}

2712 2713 2714
static void mlxsw_sp_vr_fib_flush(struct mlxsw_sp *mlxsw_sp,
				  struct mlxsw_sp_vr *vr,
				  enum mlxsw_sp_l3proto proto)
2715
{
2716
	struct mlxsw_sp_fib *fib = mlxsw_sp_vr_fib(vr, proto);
2717
	struct mlxsw_sp_fib_node *fib_node, *tmp;
2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729

	list_for_each_entry_safe(fib_node, tmp, &fib->node_list, list) {
		bool do_break = &tmp->list == &fib->node_list;

		mlxsw_sp_fib_node_flush(mlxsw_sp, fib_node);
		if (do_break)
			break;
	}
}

static void mlxsw_sp_router_fib_flush(struct mlxsw_sp *mlxsw_sp)
{
2730 2731
	int i;

J
Jiri Pirko 已提交
2732
	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_VRS); i++) {
2733
		struct mlxsw_sp_vr *vr = &mlxsw_sp->router->vrs[i];
2734

2735
		if (!mlxsw_sp_vr_is_used(vr))
2736
			continue;
2737
		mlxsw_sp_vr_fib_flush(mlxsw_sp, vr, MLXSW_SP_L3_PROTO_IPV4);
2738
	}
2739 2740 2741 2742 2743 2744
}

static void mlxsw_sp_router_fib4_abort(struct mlxsw_sp *mlxsw_sp)
{
	int err;

2745
	if (mlxsw_sp->router->aborted)
2746 2747
		return;
	dev_warn(mlxsw_sp->bus_info->dev, "FIB abort triggered. Note that FIB entries are no longer being offloaded to this device.\n");
2748
	mlxsw_sp_router_fib_flush(mlxsw_sp);
2749
	mlxsw_sp->router->aborted = true;
2750 2751 2752 2753 2754
	err = mlxsw_sp_router_set_abort_trap(mlxsw_sp);
	if (err)
		dev_warn(mlxsw_sp->bus_info->dev, "Failed to set abort trap.\n");
}

2755
struct mlxsw_sp_fib_event_work {
2756
	struct work_struct work;
2757 2758
	union {
		struct fib_entry_notifier_info fen_info;
2759
		struct fib_rule_notifier_info fr_info;
2760 2761
		struct fib_nh_notifier_info fnh_info;
	};
2762 2763 2764 2765 2766
	struct mlxsw_sp *mlxsw_sp;
	unsigned long event;
};

static void mlxsw_sp_router_fib_event_work(struct work_struct *work)
2767
{
2768
	struct mlxsw_sp_fib_event_work *fib_work =
2769
		container_of(work, struct mlxsw_sp_fib_event_work, work);
2770
	struct mlxsw_sp *mlxsw_sp = fib_work->mlxsw_sp;
2771
	struct fib_rule *rule;
2772
	bool replace, append;
2773 2774
	int err;

2775 2776 2777
	/* Protect internal structures from changes */
	rtnl_lock();
	switch (fib_work->event) {
2778
	case FIB_EVENT_ENTRY_REPLACE: /* fall through */
2779
	case FIB_EVENT_ENTRY_APPEND: /* fall through */
2780
	case FIB_EVENT_ENTRY_ADD:
2781
		replace = fib_work->event == FIB_EVENT_ENTRY_REPLACE;
2782 2783
		append = fib_work->event == FIB_EVENT_ENTRY_APPEND;
		err = mlxsw_sp_router_fib4_add(mlxsw_sp, &fib_work->fen_info,
2784
					       replace, append);
2785 2786
		if (err)
			mlxsw_sp_router_fib4_abort(mlxsw_sp);
2787
		fib_info_put(fib_work->fen_info.fi);
2788 2789
		break;
	case FIB_EVENT_ENTRY_DEL:
2790 2791
		mlxsw_sp_router_fib4_del(mlxsw_sp, &fib_work->fen_info);
		fib_info_put(fib_work->fen_info.fi);
2792 2793 2794
		break;
	case FIB_EVENT_RULE_ADD: /* fall through */
	case FIB_EVENT_RULE_DEL:
2795
		rule = fib_work->fr_info.rule;
2796
		if (!fib4_rule_default(rule) && !rule->l3mdev)
2797 2798
			mlxsw_sp_router_fib4_abort(mlxsw_sp);
		fib_rule_put(rule);
2799
		break;
2800 2801 2802 2803 2804 2805
	case FIB_EVENT_NH_ADD: /* fall through */
	case FIB_EVENT_NH_DEL:
		mlxsw_sp_nexthop_event(mlxsw_sp, fib_work->event,
				       fib_work->fnh_info.fib_nh);
		fib_info_put(fib_work->fnh_info.fib_nh->nh_parent);
		break;
2806
	}
2807 2808 2809 2810 2811 2812 2813 2814 2815 2816
	rtnl_unlock();
	kfree(fib_work);
}

/* Called with rcu_read_lock() */
static int mlxsw_sp_router_fib_event(struct notifier_block *nb,
				     unsigned long event, void *ptr)
{
	struct mlxsw_sp_fib_event_work *fib_work;
	struct fib_notifier_info *info = ptr;
2817
	struct mlxsw_sp_router *router;
2818 2819 2820 2821 2822 2823 2824 2825

	if (!net_eq(info->net, &init_net))
		return NOTIFY_DONE;

	fib_work = kzalloc(sizeof(*fib_work), GFP_ATOMIC);
	if (WARN_ON(!fib_work))
		return NOTIFY_BAD;

2826
	INIT_WORK(&fib_work->work, mlxsw_sp_router_fib_event_work);
2827 2828
	router = container_of(nb, struct mlxsw_sp_router, fib_nb);
	fib_work->mlxsw_sp = router->mlxsw_sp;
2829 2830 2831
	fib_work->event = event;

	switch (event) {
2832
	case FIB_EVENT_ENTRY_REPLACE: /* fall through */
2833
	case FIB_EVENT_ENTRY_APPEND: /* fall through */
2834 2835 2836 2837 2838 2839 2840 2841
	case FIB_EVENT_ENTRY_ADD: /* fall through */
	case FIB_EVENT_ENTRY_DEL:
		memcpy(&fib_work->fen_info, ptr, sizeof(fib_work->fen_info));
		/* Take referece on fib_info to prevent it from being
		 * freed while work is queued. Release it afterwards.
		 */
		fib_info_hold(fib_work->fen_info.fi);
		break;
2842 2843 2844 2845 2846
	case FIB_EVENT_RULE_ADD: /* fall through */
	case FIB_EVENT_RULE_DEL:
		memcpy(&fib_work->fr_info, ptr, sizeof(fib_work->fr_info));
		fib_rule_get(fib_work->fr_info.rule);
		break;
2847 2848 2849 2850 2851
	case FIB_EVENT_NH_ADD: /* fall through */
	case FIB_EVENT_NH_DEL:
		memcpy(&fib_work->fnh_info, ptr, sizeof(fib_work->fnh_info));
		fib_info_hold(fib_work->fnh_info.fib_nh->nh_parent);
		break;
2852 2853
	}

2854
	mlxsw_core_schedule_work(&fib_work->work);
2855

2856 2857 2858
	return NOTIFY_DONE;
}

2859 2860 2861 2862 2863 2864 2865
static struct mlxsw_sp_rif *
mlxsw_sp_rif_find_by_dev(const struct mlxsw_sp *mlxsw_sp,
			 const struct net_device *dev)
{
	int i;

	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS); i++)
2866 2867 2868
		if (mlxsw_sp->router->rifs[i] &&
		    mlxsw_sp->router->rifs[i]->dev == dev)
			return mlxsw_sp->router->rifs[i];
2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887

	return NULL;
}

static int mlxsw_sp_router_rif_disable(struct mlxsw_sp *mlxsw_sp, u16 rif)
{
	char ritr_pl[MLXSW_REG_RITR_LEN];
	int err;

	mlxsw_reg_ritr_rif_pack(ritr_pl, rif);
	err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
	if (WARN_ON_ONCE(err))
		return err;

	mlxsw_reg_ritr_enable_set(ritr_pl, false);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
}

static void mlxsw_sp_router_rif_gone_sync(struct mlxsw_sp *mlxsw_sp,
2888
					  struct mlxsw_sp_rif *rif)
2889
{
2890 2891 2892
	mlxsw_sp_router_rif_disable(mlxsw_sp, rif->rif_index);
	mlxsw_sp_nexthop_rif_gone_sync(mlxsw_sp, rif);
	mlxsw_sp_neigh_rif_gone_sync(mlxsw_sp, rif);
2893 2894
}

2895
static bool mlxsw_sp_rif_should_config(struct mlxsw_sp_rif *rif,
2896 2897 2898 2899 2900
				       const struct in_device *in_dev,
				       unsigned long event)
{
	switch (event) {
	case NETDEV_UP:
2901
		if (!rif)
2902 2903 2904
			return true;
		return false;
	case NETDEV_DOWN:
2905 2906
		if (rif && !in_dev->ifa_list &&
		    !netif_is_l3_slave(rif->dev))
2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917
			return true;
		/* It is possible we already removed the RIF ourselves
		 * if it was assigned to a netdev that is now a bridge
		 * or LAG slave.
		 */
		return false;
	}

	return false;
}

2918
#define MLXSW_SP_INVALID_INDEX_RIF 0xffff
2919 2920 2921 2922 2923
static int mlxsw_sp_avail_rif_get(struct mlxsw_sp *mlxsw_sp)
{
	int i;

	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS); i++)
2924
		if (!mlxsw_sp->router->rifs[i])
2925 2926
			return i;

2927
	return MLXSW_SP_INVALID_INDEX_RIF;
2928 2929
}

2930
static int
2931 2932
mlxsw_sp_port_vlan_rif_sp_op(struct mlxsw_sp *mlxsw_sp,
			     const struct mlxsw_sp_rif *rif, bool create)
2933
{
2934
	struct mlxsw_sp_rif_subport *rif_subport;
2935 2936
	char ritr_pl[MLXSW_REG_RITR_LEN];

2937 2938 2939 2940 2941 2942 2943 2944
	rif_subport = container_of(rif, struct mlxsw_sp_rif_subport, common);
	mlxsw_reg_ritr_pack(ritr_pl, create, MLXSW_REG_RITR_SP_IF,
			    rif->rif_index, rif->vr_id, rif->dev->mtu,
			    rif->dev->dev_addr);
	mlxsw_reg_ritr_sp_if_pack(ritr_pl, rif_subport->lag,
				  rif_subport->lag ? rif_subport->lag_id :
						     rif_subport->system_port,
				  rif_subport->vid);
2945 2946 2947 2948

	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
}

2949 2950
static void
mlxsw_sp_port_vlan_rif_sp_leave(struct mlxsw_sp_port_vlan *mlxsw_sp_port_vlan);
2951

2952
static u16 mlxsw_sp_rif_sp_to_fid(u16 rif_index)
2953
{
2954
	return MLXSW_SP_RFID_BASE + rif_index;
2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965
}

static struct mlxsw_sp_fid *
mlxsw_sp_rfid_alloc(u16 fid, struct net_device *l3_dev)
{
	struct mlxsw_sp_fid *f;

	f = kzalloc(sizeof(*f), GFP_KERNEL);
	if (!f)
		return NULL;

2966
	f->leave = mlxsw_sp_port_vlan_rif_sp_leave;
2967 2968 2969 2970 2971 2972 2973 2974
	f->ref_count = 0;
	f->dev = l3_dev;
	f->fid = fid;

	return f;
}

static struct mlxsw_sp_rif *
2975
mlxsw_sp_rif_alloc(u16 rif_index, u16 vr_id, struct net_device *l3_dev,
2976
		   struct mlxsw_sp_fid *f, bool is_subport)
2977
{
2978 2979
	size_t size = is_subport ? sizeof(struct mlxsw_sp_rif_subport) :
				   sizeof(struct mlxsw_sp_rif);
2980
	struct mlxsw_sp_rif *rif;
2981

2982
	rif = kzalloc(size, GFP_KERNEL);
2983
	if (!rif)
2984 2985
		return NULL;

2986 2987 2988 2989 2990 2991 2992 2993
	INIT_LIST_HEAD(&rif->nexthop_list);
	INIT_LIST_HEAD(&rif->neigh_list);
	ether_addr_copy(rif->addr, l3_dev->dev_addr);
	rif->mtu = l3_dev->mtu;
	rif->vr_id = vr_id;
	rif->dev = l3_dev;
	rif->rif_index = rif_index;
	rif->f = f;
2994

2995
	return rif;
2996 2997
}

2998 2999 3000 3001 3002 3003
struct mlxsw_sp_rif *mlxsw_sp_rif_by_index(const struct mlxsw_sp *mlxsw_sp,
					   u16 rif_index)
{
	return mlxsw_sp->router->rifs[rif_index];
}

3004 3005 3006 3007 3008 3009 3010 3011 3012 3013
u16 mlxsw_sp_rif_index(const struct mlxsw_sp_rif *rif)
{
	return rif->rif_index;
}

int mlxsw_sp_rif_dev_ifindex(const struct mlxsw_sp_rif *rif)
{
	return rif->dev->ifindex;
}

3014
static struct mlxsw_sp_rif *
3015 3016
mlxsw_sp_port_vlan_rif_sp_create(struct mlxsw_sp_port_vlan *mlxsw_sp_port_vlan,
				 struct net_device *l3_dev)
3017
{
3018 3019
	struct mlxsw_sp_port *mlxsw_sp_port = mlxsw_sp_port_vlan->mlxsw_sp_port;
	struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
3020
	struct mlxsw_sp_rif_subport *rif_subport;
3021
	u32 tb_id = l3mdev_fib_table(l3_dev);
3022
	struct mlxsw_sp_vr *vr;
3023
	struct mlxsw_sp_fid *f;
3024 3025
	struct mlxsw_sp_rif *rif;
	u16 fid, rif_index;
3026 3027
	int err;

3028 3029
	rif_index = mlxsw_sp_avail_rif_get(mlxsw_sp);
	if (rif_index == MLXSW_SP_INVALID_INDEX_RIF)
3030 3031
		return ERR_PTR(-ERANGE);

3032 3033 3034 3035 3036
	fid = mlxsw_sp_rif_sp_to_fid(rif_index);
	f = mlxsw_sp_rfid_alloc(fid, l3_dev);
	if (!f)
		return ERR_PTR(-ENOMEM);

3037
	vr = mlxsw_sp_vr_get(mlxsw_sp, tb_id ? : RT_TABLE_MAIN);
3038 3039 3040 3041
	if (IS_ERR(vr)) {
		err = PTR_ERR(vr);
		goto err_vr_get;
	}
3042

3043
	rif = mlxsw_sp_rif_alloc(rif_index, vr->id, l3_dev, f, true);
3044 3045 3046 3047 3048
	if (!rif) {
		err = -ENOMEM;
		goto err_rif_alloc;
	}

3049 3050 3051 3052 3053 3054 3055 3056 3057 3058
	rif_subport = container_of(rif, struct mlxsw_sp_rif_subport, common);
	rif_subport->vid = mlxsw_sp_port_vlan->vid;
	if (mlxsw_sp_port->lagged) {
		rif_subport->lag = true;
		rif_subport->lag_id = mlxsw_sp_port->lag_id;
	} else {
		rif_subport->lag = false;
		rif_subport->system_port = mlxsw_sp_port->local_port;
	}

3059
	err = mlxsw_sp_port_vlan_rif_sp_op(mlxsw_sp, rif, true);
3060
	if (err)
3061
		goto err_port_vlan_rif_sp_op;
3062 3063 3064 3065 3066

	err = mlxsw_sp_rif_fdb_op(mlxsw_sp, l3_dev->dev_addr, fid, true);
	if (err)
		goto err_rif_fdb_op;

3067 3068 3069 3070 3071
	if (devlink_dpipe_table_counter_enabled(priv_to_devlink(mlxsw_sp->core),
						MLXSW_SP_DPIPE_TABLE_NAME_ERIF)) {
		err = mlxsw_sp_rif_counter_alloc(mlxsw_sp, rif,
						 MLXSW_SP_RIF_COUNTER_EGRESS);
		if (err)
3072
			netdev_dbg(mlxsw_sp_port->dev,
3073 3074 3075
				   "Counter alloc Failed err=%d\n", err);
	}

3076
	f->rif = rif;
3077
	mlxsw_sp->router->rifs[rif_index] = rif;
3078
	vr->rif_count++;
3079

3080
	return rif;
3081 3082

err_rif_fdb_op:
3083
	mlxsw_sp_port_vlan_rif_sp_op(mlxsw_sp, rif, false);
3084
err_port_vlan_rif_sp_op:
3085 3086
	kfree(rif);
err_rif_alloc:
3087
	mlxsw_sp_vr_put(vr);
3088 3089
err_vr_get:
	kfree(f);
3090 3091 3092
	return ERR_PTR(err);
}

3093
static void
3094
mlxsw_sp_port_vlan_rif_sp_destroy(struct mlxsw_sp *mlxsw_sp,
3095
				  struct mlxsw_sp_rif *rif)
3096
{
3097
	struct mlxsw_sp_vr *vr = &mlxsw_sp->router->vrs[rif->vr_id];
3098 3099 3100
	struct net_device *l3_dev = rif->dev;
	struct mlxsw_sp_fid *f = rif->f;
	u16 rif_index = rif->rif_index;
3101 3102
	u16 fid = f->fid;

3103
	mlxsw_sp_router_rif_gone_sync(mlxsw_sp, rif);
3104

3105 3106 3107
	mlxsw_sp_rif_counter_free(mlxsw_sp, rif, MLXSW_SP_RIF_COUNTER_EGRESS);
	mlxsw_sp_rif_counter_free(mlxsw_sp, rif, MLXSW_SP_RIF_COUNTER_INGRESS);

3108
	vr->rif_count--;
3109
	mlxsw_sp->router->rifs[rif_index] = NULL;
3110
	f->rif = NULL;
3111 3112 3113

	mlxsw_sp_rif_fdb_op(mlxsw_sp, l3_dev->dev_addr, fid, false);

3114
	mlxsw_sp_port_vlan_rif_sp_op(mlxsw_sp, rif, false);
3115
	kfree(rif);
3116
	mlxsw_sp_vr_put(vr);
3117
	kfree(f);
3118 3119
}

3120 3121 3122
static int
mlxsw_sp_port_vlan_rif_sp_join(struct mlxsw_sp_port_vlan *mlxsw_sp_port_vlan,
			       struct net_device *l3_dev)
3123
{
3124
	struct mlxsw_sp_port *mlxsw_sp_port = mlxsw_sp_port_vlan->mlxsw_sp_port;
3125
	struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
3126
	u16 vid = mlxsw_sp_port_vlan->vid;
3127
	struct mlxsw_sp_rif *rif;
3128
	int err;
3129

3130
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, l3_dev);
3131
	if (!rif) {
3132 3133
		rif = mlxsw_sp_port_vlan_rif_sp_create(mlxsw_sp_port_vlan,
						       l3_dev);
3134 3135
		if (IS_ERR(rif))
			return PTR_ERR(rif);
3136 3137
	}

3138
	err = mlxsw_sp_port_vid_learning_set(mlxsw_sp_port, vid, false);
3139 3140 3141
	if (err)
		goto err_port_vid_learning_set;

3142
	err = mlxsw_sp_port_vid_stp_set(mlxsw_sp_port, vid,
3143 3144 3145 3146
					BR_STATE_FORWARDING);
	if (err)
		goto err_port_vid_stp_set;

3147 3148 3149 3150 3151 3152
	if (mlxsw_sp_port->nr_port_vid_map++ == 0) {
		err = mlxsw_sp_port_vp_mode_trans(mlxsw_sp_port);
		if (err)
			goto err_port_vp_mode_trans;
	}

3153
	mlxsw_sp_port_vlan->fid = rif->f;
3154
	rif->f->ref_count++;
3155 3156

	return 0;
3157

3158 3159
err_port_vp_mode_trans:
	mlxsw_sp_port->nr_port_vid_map--;
3160
	mlxsw_sp_port_vid_stp_set(mlxsw_sp_port, vid, BR_STATE_BLOCKING);
3161
err_port_vid_stp_set:
3162
	mlxsw_sp_port_vid_learning_set(mlxsw_sp_port, vid, true);
3163 3164
err_port_vid_learning_set:
	if (rif->f->ref_count == 0)
3165
		mlxsw_sp_port_vlan_rif_sp_destroy(mlxsw_sp, rif);
3166
	return err;
3167 3168
}

3169 3170
static void
mlxsw_sp_port_vlan_rif_sp_leave(struct mlxsw_sp_port_vlan *mlxsw_sp_port_vlan)
3171
{
3172
	struct mlxsw_sp_port *mlxsw_sp_port = mlxsw_sp_port_vlan->mlxsw_sp_port;
3173
	struct mlxsw_sp *mlxsw_sp = mlxsw_sp_port->mlxsw_sp;
3174
	struct mlxsw_sp_fid *fid = mlxsw_sp_port_vlan->fid;
3175 3176
	u16 vid = mlxsw_sp_port_vlan->vid;

3177 3178
	fid->ref_count--;
	mlxsw_sp_port_vlan->fid = NULL;
3179 3180 3181 3182

	if (mlxsw_sp_port->nr_port_vid_map == 1)
		mlxsw_sp_port_vlan_mode_trans(mlxsw_sp_port);
	mlxsw_sp_port->nr_port_vid_map--;
3183 3184
	mlxsw_sp_port_vid_stp_set(mlxsw_sp_port, vid, BR_STATE_BLOCKING);
	mlxsw_sp_port_vid_learning_set(mlxsw_sp_port, vid, true);
3185

3186
	if (fid->ref_count == 0)
3187
		mlxsw_sp_port_vlan_rif_sp_destroy(mlxsw_sp, fid->rif);
3188 3189
}

3190 3191 3192
static int mlxsw_sp_inetaddr_port_vlan_event(struct net_device *l3_dev,
					     struct net_device *port_dev,
					     unsigned long event, u16 vid)
3193 3194
{
	struct mlxsw_sp_port *mlxsw_sp_port = netdev_priv(port_dev);
3195
	struct mlxsw_sp_port_vlan *mlxsw_sp_port_vlan;
3196

3197
	mlxsw_sp_port_vlan = mlxsw_sp_port_vlan_find_by_vid(mlxsw_sp_port, vid);
3198 3199
	if (WARN_ON(!mlxsw_sp_port_vlan))
		return -EINVAL;
3200 3201 3202

	switch (event) {
	case NETDEV_UP:
3203 3204
		return mlxsw_sp_port_vlan_rif_sp_join(mlxsw_sp_port_vlan,
						      l3_dev);
3205
	case NETDEV_DOWN:
3206
		mlxsw_sp_port_vlan_rif_sp_leave(mlxsw_sp_port_vlan);
3207 3208 3209 3210 3211 3212 3213 3214 3215
		break;
	}

	return 0;
}

static int mlxsw_sp_inetaddr_port_event(struct net_device *port_dev,
					unsigned long event)
{
3216 3217 3218
	if (netif_is_bridge_port(port_dev) ||
	    netif_is_lag_port(port_dev) ||
	    netif_is_ovs_port(port_dev))
3219 3220
		return 0;

3221
	return mlxsw_sp_inetaddr_port_vlan_event(port_dev, port_dev, event, 1);
3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233
}

static int __mlxsw_sp_inetaddr_lag_event(struct net_device *l3_dev,
					 struct net_device *lag_dev,
					 unsigned long event, u16 vid)
{
	struct net_device *port_dev;
	struct list_head *iter;
	int err;

	netdev_for_each_lower_dev(lag_dev, port_dev, iter) {
		if (mlxsw_sp_port_dev_check(port_dev)) {
3234 3235 3236
			err = mlxsw_sp_inetaddr_port_vlan_event(l3_dev,
								port_dev,
								event, vid);
3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256
			if (err)
				return err;
		}
	}

	return 0;
}

static int mlxsw_sp_inetaddr_lag_event(struct net_device *lag_dev,
				       unsigned long event)
{
	if (netif_is_bridge_port(lag_dev))
		return 0;

	return __mlxsw_sp_inetaddr_lag_event(lag_dev, lag_dev, event, 1);
}

static struct mlxsw_sp_fid *mlxsw_sp_bridge_fid_get(struct mlxsw_sp *mlxsw_sp,
						    struct net_device *l3_dev)
{
3257 3258
	struct mlxsw_sp_fid *fid;
	u16 fid_index;
3259 3260

	if (is_vlan_dev(l3_dev))
3261
		fid_index = vlan_dev_vlan_id(l3_dev);
3262
	else if (br_vlan_enabled(l3_dev))
3263
		fid_index = 1;
3264 3265 3266
	else
		return mlxsw_sp_vfid_find(mlxsw_sp, l3_dev);

3267 3268 3269 3270 3271 3272 3273 3274
	fid = mlxsw_sp_fid_find(mlxsw_sp, fid_index);
	if (fid)
		return fid;

	fid = mlxsw_sp_fid_create(mlxsw_sp, fid_index);
	if (IS_ERR(fid))
		return NULL;
	return fid;
3275 3276
}

3277 3278 3279 3280 3281
static u8 mlxsw_sp_router_port(const struct mlxsw_sp *mlxsw_sp)
{
	return mlxsw_core_max_ports(mlxsw_sp->core) + 1;
}

3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295
static enum mlxsw_flood_table_type mlxsw_sp_flood_table_type_get(u16 fid)
{
	return mlxsw_sp_fid_is_vfid(fid) ? MLXSW_REG_SFGC_TABLE_TYPE_FID :
	       MLXSW_REG_SFGC_TABLE_TYPE_FID_OFFEST;
}

static u16 mlxsw_sp_flood_table_index_get(u16 fid)
{
	return mlxsw_sp_fid_is_vfid(fid) ? mlxsw_sp_fid_to_vfid(fid) : fid;
}

static int mlxsw_sp_router_port_flood_set(struct mlxsw_sp *mlxsw_sp, u16 fid,
					  bool set)
{
3296
	u8 router_port = mlxsw_sp_router_port(mlxsw_sp);
3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308
	enum mlxsw_flood_table_type table_type;
	char *sftr_pl;
	u16 index;
	int err;

	sftr_pl = kmalloc(MLXSW_REG_SFTR_LEN, GFP_KERNEL);
	if (!sftr_pl)
		return -ENOMEM;

	table_type = mlxsw_sp_flood_table_type_get(fid);
	index = mlxsw_sp_flood_table_index_get(fid);
	mlxsw_reg_sftr_pack(sftr_pl, MLXSW_SP_FLOOD_TABLE_BC, index, table_type,
3309
			    1, router_port, set);
3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323
	err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(sftr), sftr_pl);

	kfree(sftr_pl);
	return err;
}

static enum mlxsw_reg_ritr_if_type mlxsw_sp_rif_type_get(u16 fid)
{
	if (mlxsw_sp_fid_is_vfid(fid))
		return MLXSW_REG_RITR_FID_IF;
	else
		return MLXSW_REG_RITR_VLAN_IF;
}

3324 3325
static int mlxsw_sp_rif_bridge_op(struct mlxsw_sp *mlxsw_sp,
				  const struct mlxsw_sp_rif *rif, bool create)
3326 3327 3328 3329
{
	enum mlxsw_reg_ritr_if_type rif_type;
	char ritr_pl[MLXSW_REG_RITR_LEN];

3330 3331 3332 3333
	rif_type = mlxsw_sp_rif_type_get(rif->f->fid);
	mlxsw_reg_ritr_pack(ritr_pl, create, rif_type, rif->rif_index,
			    rif->vr_id, rif->dev->mtu, rif->dev->dev_addr);
	mlxsw_reg_ritr_fid_set(ritr_pl, rif_type, rif->f->fid);
3334 3335 3336 3337 3338 3339 3340 3341

	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
}

static int mlxsw_sp_rif_bridge_create(struct mlxsw_sp *mlxsw_sp,
				      struct net_device *l3_dev,
				      struct mlxsw_sp_fid *f)
{
3342
	u32 tb_id = l3mdev_fib_table(l3_dev);
3343
	struct mlxsw_sp_rif *rif;
3344
	struct mlxsw_sp_vr *vr;
3345
	u16 rif_index;
3346 3347
	int err;

3348 3349
	rif_index = mlxsw_sp_avail_rif_get(mlxsw_sp);
	if (rif_index == MLXSW_SP_INVALID_INDEX_RIF)
3350 3351
		return -ERANGE;

3352
	vr = mlxsw_sp_vr_get(mlxsw_sp, tb_id ? : RT_TABLE_MAIN);
3353 3354 3355
	if (IS_ERR(vr))
		return PTR_ERR(vr);

3356
	rif = mlxsw_sp_rif_alloc(rif_index, vr->id, l3_dev, f, false);
3357 3358 3359 3360 3361
	if (!rif) {
		err = -ENOMEM;
		goto err_rif_alloc;
	}

3362
	err = mlxsw_sp_rif_bridge_op(mlxsw_sp, rif, true);
3363 3364 3365
	if (err)
		goto err_rif_bridge_op;

3366 3367 3368 3369
	err = mlxsw_sp_router_port_flood_set(mlxsw_sp, f->fid, true);
	if (err)
		goto err_port_flood_set;

3370 3371 3372 3373
	err = mlxsw_sp_rif_fdb_op(mlxsw_sp, l3_dev->dev_addr, f->fid, true);
	if (err)
		goto err_rif_fdb_op;

3374
	f->rif = rif;
3375
	mlxsw_sp->router->rifs[rif_index] = rif;
3376
	vr->rif_count++;
3377

3378
	netdev_dbg(l3_dev, "RIF=%d created\n", rif_index);
3379 3380 3381 3382

	return 0;

err_rif_fdb_op:
3383 3384
	mlxsw_sp_router_port_flood_set(mlxsw_sp, f->fid, false);
err_port_flood_set:
3385
	mlxsw_sp_rif_bridge_op(mlxsw_sp, rif, false);
3386
err_rif_bridge_op:
3387 3388
	kfree(rif);
err_rif_alloc:
3389
	mlxsw_sp_vr_put(vr);
3390 3391 3392 3393
	return err;
}

void mlxsw_sp_rif_bridge_destroy(struct mlxsw_sp *mlxsw_sp,
3394
				 struct mlxsw_sp_rif *rif)
3395
{
3396
	struct mlxsw_sp_vr *vr = &mlxsw_sp->router->vrs[rif->vr_id];
3397 3398 3399
	struct net_device *l3_dev = rif->dev;
	struct mlxsw_sp_fid *f = rif->f;
	u16 rif_index = rif->rif_index;
3400

3401
	mlxsw_sp_router_rif_gone_sync(mlxsw_sp, rif);
3402

3403
	vr->rif_count--;
3404
	mlxsw_sp->router->rifs[rif_index] = NULL;
3405
	f->rif = NULL;
3406 3407 3408

	mlxsw_sp_rif_fdb_op(mlxsw_sp, l3_dev->dev_addr, f->fid, false);

3409 3410
	mlxsw_sp_router_port_flood_set(mlxsw_sp, f->fid, false);

3411
	mlxsw_sp_rif_bridge_op(mlxsw_sp, rif, false);
3412

3413 3414
	kfree(rif);

3415 3416
	mlxsw_sp_vr_put(vr);

3417
	netdev_dbg(l3_dev, "RIF=%d destroyed\n", rif_index);
3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438
}

static int mlxsw_sp_inetaddr_bridge_event(struct net_device *l3_dev,
					  struct net_device *br_dev,
					  unsigned long event)
{
	struct mlxsw_sp *mlxsw_sp = mlxsw_sp_lower_get(l3_dev);
	struct mlxsw_sp_fid *f;

	/* FID can either be an actual FID if the L3 device is the
	 * VLAN-aware bridge or a VLAN device on top. Otherwise, the
	 * L3 device is a VLAN-unaware bridge and we get a vFID.
	 */
	f = mlxsw_sp_bridge_fid_get(mlxsw_sp, l3_dev);
	if (WARN_ON(!f))
		return -EINVAL;

	switch (event) {
	case NETDEV_UP:
		return mlxsw_sp_rif_bridge_create(mlxsw_sp, l3_dev, f);
	case NETDEV_DOWN:
3439
		mlxsw_sp_rif_bridge_destroy(mlxsw_sp, f->rif);
3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452
		break;
	}

	return 0;
}

static int mlxsw_sp_inetaddr_vlan_event(struct net_device *vlan_dev,
					unsigned long event)
{
	struct net_device *real_dev = vlan_dev_real_dev(vlan_dev);
	u16 vid = vlan_dev_vlan_id(vlan_dev);

	if (mlxsw_sp_port_dev_check(real_dev))
3453 3454
		return mlxsw_sp_inetaddr_port_vlan_event(vlan_dev, real_dev,
							 event, vid);
3455 3456 3457
	else if (netif_is_lag_master(real_dev))
		return __mlxsw_sp_inetaddr_lag_event(vlan_dev, real_dev, event,
						     vid);
3458
	else if (netif_is_bridge_master(real_dev) && br_vlan_enabled(real_dev))
3459 3460 3461 3462 3463 3464
		return mlxsw_sp_inetaddr_bridge_event(vlan_dev, real_dev,
						      event);

	return 0;
}

3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479
static int __mlxsw_sp_inetaddr_event(struct net_device *dev,
				     unsigned long event)
{
	if (mlxsw_sp_port_dev_check(dev))
		return mlxsw_sp_inetaddr_port_event(dev, event);
	else if (netif_is_lag_master(dev))
		return mlxsw_sp_inetaddr_lag_event(dev, event);
	else if (netif_is_bridge_master(dev))
		return mlxsw_sp_inetaddr_bridge_event(dev, dev, event);
	else if (is_vlan_dev(dev))
		return mlxsw_sp_inetaddr_vlan_event(dev, event);
	else
		return 0;
}

3480 3481 3482 3483 3484 3485
int mlxsw_sp_inetaddr_event(struct notifier_block *unused,
			    unsigned long event, void *ptr)
{
	struct in_ifaddr *ifa = (struct in_ifaddr *) ptr;
	struct net_device *dev = ifa->ifa_dev->dev;
	struct mlxsw_sp *mlxsw_sp;
3486
	struct mlxsw_sp_rif *rif;
3487 3488 3489 3490 3491 3492
	int err = 0;

	mlxsw_sp = mlxsw_sp_lower_get(dev);
	if (!mlxsw_sp)
		goto out;

3493 3494
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, dev);
	if (!mlxsw_sp_rif_should_config(rif, ifa->ifa_dev, event))
3495 3496
		goto out;

3497
	err = __mlxsw_sp_inetaddr_event(dev, event);
3498 3499 3500 3501
out:
	return notifier_from_errno(err);
}

3502
static int mlxsw_sp_rif_edit(struct mlxsw_sp *mlxsw_sp, u16 rif_index,
3503 3504 3505 3506 3507
			     const char *mac, int mtu)
{
	char ritr_pl[MLXSW_REG_RITR_LEN];
	int err;

3508
	mlxsw_reg_ritr_rif_pack(ritr_pl, rif_index);
3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521
	err = mlxsw_reg_query(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
	if (err)
		return err;

	mlxsw_reg_ritr_mtu_set(ritr_pl, mtu);
	mlxsw_reg_ritr_if_mac_memcpy_to(ritr_pl, mac);
	mlxsw_reg_ritr_op_set(ritr_pl, MLXSW_REG_RITR_RIF_CREATE);
	return mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(ritr), ritr_pl);
}

int mlxsw_sp_netdevice_router_port_event(struct net_device *dev)
{
	struct mlxsw_sp *mlxsw_sp;
3522
	struct mlxsw_sp_rif *rif;
3523 3524 3525 3526 3527 3528
	int err;

	mlxsw_sp = mlxsw_sp_lower_get(dev);
	if (!mlxsw_sp)
		return 0;

3529 3530
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, dev);
	if (!rif)
3531 3532
		return 0;

3533
	err = mlxsw_sp_rif_fdb_op(mlxsw_sp, rif->addr, rif->f->fid, false);
3534 3535 3536
	if (err)
		return err;

3537 3538
	err = mlxsw_sp_rif_edit(mlxsw_sp, rif->rif_index, dev->dev_addr,
				dev->mtu);
3539 3540 3541
	if (err)
		goto err_rif_edit;

3542
	err = mlxsw_sp_rif_fdb_op(mlxsw_sp, dev->dev_addr, rif->f->fid, true);
3543 3544 3545
	if (err)
		goto err_rif_fdb_op;

3546 3547
	ether_addr_copy(rif->addr, dev->dev_addr);
	rif->mtu = dev->mtu;
3548

3549
	netdev_dbg(dev, "Updated RIF=%d\n", rif->rif_index);
3550 3551 3552 3553

	return 0;

err_rif_fdb_op:
3554
	mlxsw_sp_rif_edit(mlxsw_sp, rif->rif_index, rif->addr, rif->mtu);
3555
err_rif_edit:
3556
	mlxsw_sp_rif_fdb_op(mlxsw_sp, rif->addr, rif->f->fid, true);
3557 3558 3559
	return err;
}

3560 3561
static int mlxsw_sp_port_vrf_join(struct mlxsw_sp *mlxsw_sp,
				  struct net_device *l3_dev)
3562
{
3563
	struct mlxsw_sp_rif *rif;
3564

3565 3566
	/* If netdev is already associated with a RIF, then we need to
	 * destroy it and create a new one with the new virtual router ID.
3567
	 */
3568 3569 3570
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, l3_dev);
	if (rif)
		__mlxsw_sp_inetaddr_event(l3_dev, NETDEV_DOWN);
3571

3572
	return __mlxsw_sp_inetaddr_event(l3_dev, NETDEV_UP);
3573 3574
}

3575 3576
static void mlxsw_sp_port_vrf_leave(struct mlxsw_sp *mlxsw_sp,
				    struct net_device *l3_dev)
3577
{
3578
	struct mlxsw_sp_rif *rif;
3579

3580 3581
	rif = mlxsw_sp_rif_find_by_dev(mlxsw_sp, l3_dev);
	if (!rif)
3582
		return;
3583
	__mlxsw_sp_inetaddr_event(l3_dev, NETDEV_DOWN);
3584 3585
}

3586 3587
int mlxsw_sp_netdevice_vrf_event(struct net_device *l3_dev, unsigned long event,
				 struct netdev_notifier_changeupper_info *info)
3588
{
3589 3590
	struct mlxsw_sp *mlxsw_sp = mlxsw_sp_lower_get(l3_dev);
	int err = 0;
3591

3592 3593
	if (!mlxsw_sp)
		return 0;
3594

3595 3596 3597 3598 3599 3600 3601 3602 3603 3604
	switch (event) {
	case NETDEV_PRECHANGEUPPER:
		return 0;
	case NETDEV_CHANGEUPPER:
		if (info->linking)
			err = mlxsw_sp_port_vrf_join(mlxsw_sp, l3_dev);
		else
			mlxsw_sp_port_vrf_leave(mlxsw_sp, l3_dev);
		break;
	}
3605

3606
	return err;
3607 3608
}

3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630
static int mlxsw_sp_rifs_init(struct mlxsw_sp *mlxsw_sp)
{
	u64 max_rifs = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS);

	mlxsw_sp->router->rifs = kcalloc(max_rifs,
					 sizeof(struct mlxsw_sp_rif *),
					 GFP_KERNEL);
	if (!mlxsw_sp->router->rifs)
		return -ENOMEM;
	return 0;
}

static void mlxsw_sp_rifs_fini(struct mlxsw_sp *mlxsw_sp)
{
	int i;

	for (i = 0; i < MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS); i++)
		WARN_ON_ONCE(mlxsw_sp->router->rifs[i]);

	kfree(mlxsw_sp->router->rifs);
}

3631 3632
static void mlxsw_sp_router_fib_dump_flush(struct notifier_block *nb)
{
3633
	struct mlxsw_sp_router *router;
3634 3635 3636 3637 3638 3639

	/* Flush pending FIB notifications and then flush the device's
	 * table before requesting another dump. The FIB notification
	 * block is unregistered, so no need to take RTNL.
	 */
	mlxsw_core_flush_owq();
3640 3641
	router = container_of(nb, struct mlxsw_sp_router, fib_nb);
	mlxsw_sp_router_fib_flush(router->mlxsw_sp);
3642 3643
}

3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657
static int __mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp)
{
	char rgcr_pl[MLXSW_REG_RGCR_LEN];
	u64 max_rifs;
	int err;

	if (!MLXSW_CORE_RES_VALID(mlxsw_sp->core, MAX_RIFS))
		return -EIO;
	max_rifs = MLXSW_CORE_RES_GET(mlxsw_sp->core, MAX_RIFS);

	mlxsw_reg_rgcr_pack(rgcr_pl, true);
	mlxsw_reg_rgcr_max_router_interfaces_set(rgcr_pl, max_rifs);
	err = mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl);
	if (err)
3658
		return err;
3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669
	return 0;
}

static void __mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp)
{
	char rgcr_pl[MLXSW_REG_RGCR_LEN];

	mlxsw_reg_rgcr_pack(rgcr_pl, false);
	mlxsw_reg_write(mlxsw_sp->core, MLXSW_REG(rgcr), rgcr_pl);
}

3670 3671
int mlxsw_sp_router_init(struct mlxsw_sp *mlxsw_sp)
{
3672
	struct mlxsw_sp_router *router;
3673 3674
	int err;

3675 3676 3677 3678 3679 3680 3681
	router = kzalloc(sizeof(*mlxsw_sp->router), GFP_KERNEL);
	if (!router)
		return -ENOMEM;
	mlxsw_sp->router = router;
	router->mlxsw_sp = mlxsw_sp;

	INIT_LIST_HEAD(&mlxsw_sp->router->nexthop_neighs_list);
3682 3683
	err = __mlxsw_sp_router_init(mlxsw_sp);
	if (err)
3684
		goto err_router_init;
3685

3686 3687 3688 3689
	err = mlxsw_sp_rifs_init(mlxsw_sp);
	if (err)
		goto err_rifs_init;

3690
	err = rhashtable_init(&mlxsw_sp->router->nexthop_ht,
3691 3692 3693 3694
			      &mlxsw_sp_nexthop_ht_params);
	if (err)
		goto err_nexthop_ht_init;

3695
	err = rhashtable_init(&mlxsw_sp->router->nexthop_group_ht,
3696 3697 3698 3699
			      &mlxsw_sp_nexthop_group_ht_params);
	if (err)
		goto err_nexthop_group_ht_init;

3700 3701 3702 3703
	err = mlxsw_sp_lpm_init(mlxsw_sp);
	if (err)
		goto err_lpm_init;

3704 3705 3706 3707
	err = mlxsw_sp_vrs_init(mlxsw_sp);
	if (err)
		goto err_vrs_init;

3708
	err = mlxsw_sp_neigh_init(mlxsw_sp);
3709 3710 3711
	if (err)
		goto err_neigh_init;

3712 3713
	mlxsw_sp->router->fib_nb.notifier_call = mlxsw_sp_router_fib_event;
	err = register_fib_notifier(&mlxsw_sp->router->fib_nb,
3714 3715 3716 3717
				    mlxsw_sp_router_fib_dump_flush);
	if (err)
		goto err_register_fib_notifier;

3718 3719
	return 0;

3720 3721
err_register_fib_notifier:
	mlxsw_sp_neigh_fini(mlxsw_sp);
3722 3723 3724
err_neigh_init:
	mlxsw_sp_vrs_fini(mlxsw_sp);
err_vrs_init:
3725 3726
	mlxsw_sp_lpm_fini(mlxsw_sp);
err_lpm_init:
3727
	rhashtable_destroy(&mlxsw_sp->router->nexthop_group_ht);
3728
err_nexthop_group_ht_init:
3729
	rhashtable_destroy(&mlxsw_sp->router->nexthop_ht);
3730
err_nexthop_ht_init:
3731 3732
	mlxsw_sp_rifs_fini(mlxsw_sp);
err_rifs_init:
3733
	__mlxsw_sp_router_fini(mlxsw_sp);
3734 3735
err_router_init:
	kfree(mlxsw_sp->router);
3736 3737 3738 3739 3740
	return err;
}

void mlxsw_sp_router_fini(struct mlxsw_sp *mlxsw_sp)
{
3741
	unregister_fib_notifier(&mlxsw_sp->router->fib_nb);
3742 3743
	mlxsw_sp_neigh_fini(mlxsw_sp);
	mlxsw_sp_vrs_fini(mlxsw_sp);
3744
	mlxsw_sp_lpm_fini(mlxsw_sp);
3745 3746
	rhashtable_destroy(&mlxsw_sp->router->nexthop_group_ht);
	rhashtable_destroy(&mlxsw_sp->router->nexthop_ht);
3747
	mlxsw_sp_rifs_fini(mlxsw_sp);
3748
	__mlxsw_sp_router_fini(mlxsw_sp);
3749
	kfree(mlxsw_sp->router);
3750
}