drivers/net/ethernet/mellanox/mlx5/core/fs_core.h

   1 /*
   2  * Copyright (c) 2015, 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 _MLX5_FS_CORE_
  34 #define _MLX5_FS_CORE_
  35
  36 #include <linux/mlx5/fs.h>
  37
  38 enum fs_node_type {
  39         FS_TYPE_NAMESPACE,
  40         FS_TYPE_PRIO,
  41         FS_TYPE_FLOW_TABLE,
  42         FS_TYPE_FLOW_GROUP,
  43         FS_TYPE_FLOW_ENTRY,
  44         FS_TYPE_FLOW_DEST
  45 };
  46
  47 enum fs_flow_table_type {
  48         FS_FT_NIC_RX          = 0x0,
  49         FS_FT_ESW_EGRESS_ACL  = 0x2,
  50         FS_FT_ESW_INGRESS_ACL = 0x3,
  51         FS_FT_FDB             = 0X4,
  52         FS_FT_SNIFFER_RX        = 0X5,
  53         FS_FT_SNIFFER_TX        = 0X6,
  54 };
  55
  56 enum fs_flow_table_op_mod {
  57         FS_FT_OP_MOD_NORMAL,
  58         FS_FT_OP_MOD_LAG_DEMUX,
  59 };
  60
  61 enum fs_fte_status {
  62         FS_FTE_STATUS_EXISTING = 1UL << 0,
  63 };
  64
  65 struct mlx5_flow_steering {
  66         struct mlx5_core_dev *dev;
  67         struct mlx5_flow_root_namespace *root_ns;
  68         struct mlx5_flow_root_namespace *fdb_root_ns;
  69         struct mlx5_flow_root_namespace *esw_egress_root_ns;
  70         struct mlx5_flow_root_namespace *esw_ingress_root_ns;
  71         struct mlx5_flow_root_namespace *sniffer_tx_root_ns;
  72         struct mlx5_flow_root_namespace *sniffer_rx_root_ns;
  73 };
  74
  75 struct fs_node {
  76         struct list_head        list;
  77         struct list_head        children;
  78         enum fs_node_type       type;
  79         struct fs_node          *parent;
  80         struct fs_node          *root;
  81         /* lock the node for writing and traversing */
  82         struct mutex            lock;
  83         atomic_t                refcount;
  84         void                    (*remove_func)(struct fs_node *);
  85 };
  86
  87 struct mlx5_flow_rule {
  88         struct fs_node                          node;
  89         struct mlx5_flow_destination            dest_attr;
  90         /* next_ft should be accessed under chain_lock and only of
  91          * destination type is FWD_NEXT_fT.
  92          */
  93         struct list_head                        next_ft;
  94         u32                                     sw_action;
  95 };
  96
  97 /* Type of children is mlx5_flow_group */
  98 struct mlx5_flow_table {
  99         struct fs_node                  node;
 100         u32                             id;
 101         u16                             vport;
 102         unsigned int                    max_fte;
 103         unsigned int                    level;
 104         enum fs_flow_table_type         type;
 105         enum fs_flow_table_op_mod       op_mod;
 106         struct {
 107                 bool                    active;
 108                 unsigned int            required_groups;
 109                 unsigned int            num_groups;
 110         } autogroup;
 111         /* Protect fwd_rules */
 112         struct mutex                    lock;
 113         /* FWD rules that point on this flow table */
 114         struct list_head                fwd_rules;
 115 };
 116
 117 struct mlx5_fc_cache {
 118         u64 packets;
 119         u64 bytes;
 120         u64 lastuse;
 121 };
 122
 123 struct mlx5_fc {
 124         struct rb_node node;
 125         struct list_head list;
 126
 127         /* last{packets,bytes} members are used when calculating the delta since
 128          * last reading
 129          */
 130         u64 lastpackets;
 131         u64 lastbytes;
 132
 133         u16 id;
 134         bool deleted;
 135         bool aging;
 136
 137         struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
 138 };
 139
 140 /* Type of children is mlx5_flow_rule */
 141 struct fs_fte {
 142         struct fs_node                  node;
 143         u32                             val[MLX5_ST_SZ_DW(fte_match_param)];
 144         u32                             dests_size;
 145         u32                             flow_tag;
 146         u32                             index;
 147         u32                             action;
 148         enum fs_fte_status              status;
 149         struct mlx5_fc                  *counter;
 150 };
 151
 152 /* Type of children is mlx5_flow_table/namespace */
 153 struct fs_prio {
 154         struct fs_node                  node;
 155         unsigned int                    num_levels;
 156         unsigned int                    start_level;
 157         unsigned int                    prio;
 158         unsigned int                    num_ft;
 159 };
 160
 161 /* Type of children is fs_prio */
 162 struct mlx5_flow_namespace {
 163         /* parent == NULL => root ns */
 164         struct  fs_node                 node;
 165 };
 166
 167 struct mlx5_flow_group_mask {
 168         u8      match_criteria_enable;
 169         u32     match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
 170 };
 171
 172 /* Type of children is fs_fte */
 173 struct mlx5_flow_group {
 174         struct fs_node                  node;
 175         struct mlx5_flow_group_mask     mask;
 176         u32                             start_index;
 177         u32                             max_ftes;
 178         u32                             num_ftes;
 179         u32                             id;
 180 };
 181
 182 struct mlx5_flow_root_namespace {
 183         struct mlx5_flow_namespace      ns;
 184         enum   fs_flow_table_type       table_type;
 185         struct mlx5_core_dev            *dev;
 186         struct mlx5_flow_table          *root_ft;
 187         /* Should be held when chaining flow tables */
 188         struct mutex                    chain_lock;
 189 };
 190
 191 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
 192 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
 193
 194 int mlx5_init_fs(struct mlx5_core_dev *dev);
 195 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
 196
 197 #define fs_get_obj(v, _node)  {v = container_of((_node), typeof(*v), node); }
 198
 199 #define fs_list_for_each_entry(pos, root)               \
 200         list_for_each_entry(pos, root, node.list)
 201
 202 #define fs_list_for_each_entry_safe(pos, tmp, root)             \
 203         list_for_each_entry_safe(pos, tmp, root, node.list)
 204
 205 #define fs_for_each_ns_or_ft_reverse(pos, prio)                         \
 206         list_for_each_entry_reverse(pos, &(prio)->node.children, list)
 207
 208 #define fs_for_each_ns_or_ft(pos, prio)                                 \
 209         list_for_each_entry(pos, (&(prio)->node.children), list)
 210
 211 #define fs_for_each_prio(pos, ns)                       \
 212         fs_list_for_each_entry(pos, &(ns)->node.children)
 213
 214 #define fs_for_each_ns(pos, prio)                       \
 215         fs_list_for_each_entry(pos, &(prio)->node.children)
 216
 217 #define fs_for_each_ft(pos, prio)                       \
 218         fs_list_for_each_entry(pos, &(prio)->node.children)
 219
 220 #define fs_for_each_ft_safe(pos, tmp, prio)                     \
 221         fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
 222
 223 #define fs_for_each_fg(pos, ft)                 \
 224         fs_list_for_each_entry(pos, &(ft)->node.children)
 225
 226 #define fs_for_each_fte(pos, fg)                        \
 227         fs_list_for_each_entry(pos, &(fg)->node.children)
 228
 229 #define fs_for_each_dst(pos, fte)                       \
 230         fs_list_for_each_entry(pos, &(fte)->node.children)
 231
 232 #endif