1/* 2 * Copyright (c) 2017, Mellanox Technologies. All rights reserved. 3 * 4 * This software is available to you under a choice of one of two 5 * licenses. You may choose to be licensed under the terms of the GNU 6 * General Public License (GPL) Version 2, available from the file 7 * COPYING in the main directory of this source tree, or the 8 * OpenIB.org BSD license below: 9 * 10 * Redistribution and use in source and binary forms, with or 11 * without modification, are permitted provided that the following 12 * conditions are met: 13 * 14 * - Redistributions of source code must retain the above 15 * copyright notice, this list of conditions and the following 16 * disclaimer. 17 * 18 * - Redistributions in binary form must reproduce the above 19 * copyright notice, this list of conditions and the following 20 * disclaimer in the documentation and/or other materials 21 * provided with the distribution. 22 * 23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 30 * SOFTWARE. 31 */ 32 33#ifndef __MLX5E_REP_H__ 34#define __MLX5E_REP_H__ 35 36#include <net/ip_tunnels.h> 37#include <linux/rhashtable.h> 38#include "eswitch.h" 39#include "en.h" 40 41#ifdef CONFIG_MLX5_ESWITCH 42struct mlx5e_neigh_update_table { 43 struct rhashtable neigh_ht; 44 /* Save the neigh hash entries in a list in addition to the hash table 45 * (neigh_ht). In order to iterate easily over the neigh entries. 46 * Used for stats query. 47 */ 48 struct list_head neigh_list; 49 /* protect lookup/remove operations */ 50 spinlock_t encap_lock; 51 struct notifier_block netevent_nb; 52 struct delayed_work neigh_stats_work; 53 unsigned long min_interval; /* jiffies */ 54}; 55 56struct mlx5e_rep_priv { 57 struct mlx5_eswitch_rep *rep; 58 struct mlx5e_neigh_update_table neigh_update; 59 struct net_device *netdev; 60 struct mlx5_flow_handle *vport_rx_rule; 61 struct list_head vport_sqs_list; 62}; 63 64static inline 65struct mlx5e_rep_priv *mlx5e_rep_to_rep_priv(struct mlx5_eswitch_rep *rep) 66{ 67 return (struct mlx5e_rep_priv *)rep->rep_if[REP_ETH].priv; 68} 69 70struct mlx5e_neigh { 71 struct net_device *dev; 72 union { 73 __be32 v4; 74 struct in6_addr v6; 75 } dst_ip; 76 int family; 77}; 78 79struct mlx5e_neigh_hash_entry { 80 struct rhash_head rhash_node; 81 struct mlx5e_neigh m_neigh; 82 83 /* Save the neigh hash entry in a list on the representor in 84 * addition to the hash table. In order to iterate easily over the 85 * neighbour entries. Used for stats query. 86 */ 87 struct list_head neigh_list; 88 89 /* encap list sharing the same neigh */ 90 struct list_head encap_list; 91 92 /* valid only when the neigh reference is taken during 93 * neigh_update_work workqueue callback. 94 */ 95 struct neighbour *n; 96 struct work_struct neigh_update_work; 97 98 /* neigh hash entry can be deleted only when the refcount is zero. 99 * refcount is needed to avoid neigh hash entry removal by TC, while 100 * it's used by the neigh notification call. 101 */ 102 refcount_t refcnt; 103 104 /* Save the last reported time offloaded trafic pass over one of the 105 * neigh hash entry flows. Use it to periodically update the neigh 106 * 'used' value and avoid neigh deleting by the kernel. 107 */ 108 unsigned long reported_lastuse; 109}; 110 111enum { 112 /* set when the encap entry is successfully offloaded into HW */ 113 MLX5_ENCAP_ENTRY_VALID = BIT(0), 114}; 115 116struct mlx5e_encap_entry { 117 /* neigh hash entry list of encaps sharing the same neigh */ 118 struct list_head encap_list; 119 struct mlx5e_neigh m_neigh; 120 /* a node of the eswitch encap hash table which keeping all the encap 121 * entries 122 */ 123 struct hlist_node encap_hlist; 124 struct list_head flows; 125 u32 encap_id; 126 struct ip_tunnel_info tun_info; 127 unsigned char h_dest[ETH_ALEN]; /* destination eth addr */ 128 129 struct net_device *out_dev; 130 int tunnel_type; 131 u8 flags; 132 char *encap_header; 133 int encap_size; 134}; 135 136struct mlx5e_rep_sq { 137 struct mlx5_flow_handle *send_to_vport_rule; 138 struct list_head list; 139}; 140 141void *mlx5e_alloc_nic_rep_priv(struct mlx5_core_dev *mdev); 142void mlx5e_register_vport_reps(struct mlx5e_priv *priv); 143void mlx5e_unregister_vport_reps(struct mlx5e_priv *priv); 144bool mlx5e_is_uplink_rep(struct mlx5e_priv *priv); 145int mlx5e_add_sqs_fwd_rules(struct mlx5e_priv *priv); 146void mlx5e_remove_sqs_fwd_rules(struct mlx5e_priv *priv); 147 148int mlx5e_get_offload_stats(int attr_id, const struct net_device *dev, void *sp); 149bool mlx5e_has_offload_stats(const struct net_device *dev, int attr_id); 150 151int mlx5e_attr_get(struct net_device *dev, struct switchdev_attr *attr); 152void mlx5e_handle_rx_cqe_rep(struct mlx5e_rq *rq, struct mlx5_cqe64 *cqe); 153 154int mlx5e_rep_encap_entry_attach(struct mlx5e_priv *priv, 155 struct mlx5e_encap_entry *e); 156void mlx5e_rep_encap_entry_detach(struct mlx5e_priv *priv, 157 struct mlx5e_encap_entry *e); 158 159void mlx5e_rep_queue_neigh_stats_work(struct mlx5e_priv *priv); 160#else /* CONFIG_MLX5_ESWITCH */ 161static inline void mlx5e_register_vport_reps(struct mlx5e_priv *priv) {} 162static inline void mlx5e_unregister_vport_reps(struct mlx5e_priv *priv) {} 163static inline bool mlx5e_is_uplink_rep(struct mlx5e_priv *priv) { return false; } 164static inline int mlx5e_add_sqs_fwd_rules(struct mlx5e_priv *priv) { return 0; } 165static inline void mlx5e_remove_sqs_fwd_rules(struct mlx5e_priv *priv) {} 166#endif 167 168#endif /* __MLX5E_REP_H__ */ 169