2 * drivers/net/ethernet/mellanox/mlxsw/spectrum_router.h
3 * Copyright (c) 2017 Mellanox Technologies. All rights reserved.
4 * Copyright (c) 2017 Arkadi Sharshevsky <arkadis@mellanox.com>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. Neither the names of the copyright holders nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * Alternatively, this software may be distributed under the terms of the
19 * GNU General Public License ("GPL") version 2 as published by the Free
20 * Software Foundation.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
26 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
31 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
35 #ifndef _MLXSW_ROUTER_H_
36 #define _MLXSW_ROUTER_H_
40 enum mlxsw_sp_rif_counter_dir {
41 MLXSW_SP_RIF_COUNTER_INGRESS,
42 MLXSW_SP_RIF_COUNTER_EGRESS,
45 struct mlxsw_sp_neigh_entry;
47 struct mlxsw_sp_rif *mlxsw_sp_rif_by_index(const struct mlxsw_sp *mlxsw_sp,
49 u16 mlxsw_sp_rif_index(const struct mlxsw_sp_rif *rif);
50 int mlxsw_sp_rif_dev_ifindex(const struct mlxsw_sp_rif *rif);
51 int mlxsw_sp_rif_counter_value_get(struct mlxsw_sp *mlxsw_sp,
52 struct mlxsw_sp_rif *rif,
53 enum mlxsw_sp_rif_counter_dir dir,
55 void mlxsw_sp_rif_counter_free(struct mlxsw_sp *mlxsw_sp,
56 struct mlxsw_sp_rif *rif,
57 enum mlxsw_sp_rif_counter_dir dir);
58 int mlxsw_sp_rif_counter_alloc(struct mlxsw_sp *mlxsw_sp,
59 struct mlxsw_sp_rif *rif,
60 enum mlxsw_sp_rif_counter_dir dir);
61 struct mlxsw_sp_neigh_entry *
62 mlxsw_sp_rif_neigh_next(struct mlxsw_sp_rif *rif,
63 struct mlxsw_sp_neigh_entry *neigh_entry);
64 int mlxsw_sp_neigh_entry_type(struct mlxsw_sp_neigh_entry *neigh_entry);
66 mlxsw_sp_neigh_entry_ha(struct mlxsw_sp_neigh_entry *neigh_entry);
67 u32 mlxsw_sp_neigh4_entry_dip(struct mlxsw_sp_neigh_entry *neigh_entry);
69 #define mlxsw_sp_rif_neigh_for_each(neigh_entry, rif) \
70 for (neigh_entry = mlxsw_sp_rif_neigh_next(rif, NULL); neigh_entry; \
71 neigh_entry = mlxsw_sp_rif_neigh_next(rif, neigh_entry))
72 int mlxsw_sp_neigh_counter_get(struct mlxsw_sp *mlxsw_sp,
73 struct mlxsw_sp_neigh_entry *neigh_entry,
76 #endif /* _MLXSW_ROUTER_H_*/