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

   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 #include <linux/mutex.h>
  34 #include <linux/mlx5/driver.h>
  35
  36 #include "mlx5_core.h"
  37 #include "fs_core.h"
  38 #include "fs_cmd.h"
  39
  40 #define INIT_TREE_NODE_ARRAY_SIZE(...)  (sizeof((struct init_tree_node[]){__VA_ARGS__}) /\
  41                                          sizeof(struct init_tree_node))
  42
  43 #define ADD_PRIO(num_prios_val, min_level_val, num_levels_val, caps_val,\
  44                  ...) {.type = FS_TYPE_PRIO,\
  45         .min_ft_level = min_level_val,\
  46         .num_levels = num_levels_val,\
  47         .num_leaf_prios = num_prios_val,\
  48         .caps = caps_val,\
  49         .children = (struct init_tree_node[]) {__VA_ARGS__},\
  50         .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
  51 }
  52
  53 #define ADD_MULTIPLE_PRIO(num_prios_val, num_levels_val, ...)\
  54         ADD_PRIO(num_prios_val, 0, num_levels_val, {},\
  55                  __VA_ARGS__)\
  56
  57 #define ADD_NS(...) {.type = FS_TYPE_NAMESPACE,\
  58         .children = (struct init_tree_node[]) {__VA_ARGS__},\
  59         .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
  60 }
  61
  62 #define INIT_CAPS_ARRAY_SIZE(...) (sizeof((long[]){__VA_ARGS__}) /\
  63                                    sizeof(long))
  64
  65 #define FS_CAP(cap) (__mlx5_bit_off(flow_table_nic_cap, cap))
  66
  67 #define FS_REQUIRED_CAPS(...) {.arr_sz = INIT_CAPS_ARRAY_SIZE(__VA_ARGS__), \
  68                                .caps = (long[]) {__VA_ARGS__} }
  69
  70 #define FS_CHAINING_CAPS  FS_REQUIRED_CAPS(FS_CAP(flow_table_properties_nic_receive.flow_modify_en), \
  71                                            FS_CAP(flow_table_properties_nic_receive.modify_root), \
  72                                            FS_CAP(flow_table_properties_nic_receive.identified_miss_table_mode), \
  73                                            FS_CAP(flow_table_properties_nic_receive.flow_table_modify))
  74
  75 #define LEFTOVERS_NUM_LEVELS 1
  76 #define LEFTOVERS_NUM_PRIOS 1
  77
  78 #define BY_PASS_PRIO_NUM_LEVELS 1
  79 #define BY_PASS_MIN_LEVEL (ETHTOOL_MIN_LEVEL + MLX5_BY_PASS_NUM_PRIOS +\
  80                            LEFTOVERS_NUM_PRIOS)
  81
  82 #define ETHTOOL_PRIO_NUM_LEVELS 1
  83 #define ETHTOOL_NUM_PRIOS 11
  84 #define ETHTOOL_MIN_LEVEL (KERNEL_MIN_LEVEL + ETHTOOL_NUM_PRIOS)
  85 /* Vlan, mac, ttc, aRFS */
  86 #define KERNEL_NIC_PRIO_NUM_LEVELS 4
  87 #define KERNEL_NIC_NUM_PRIOS 1
  88 /* One more level for tc */
  89 #define KERNEL_MIN_LEVEL (KERNEL_NIC_PRIO_NUM_LEVELS + 1)
  90
  91 #define ANCHOR_NUM_LEVELS 1
  92 #define ANCHOR_NUM_PRIOS 1
  93 #define ANCHOR_MIN_LEVEL (BY_PASS_MIN_LEVEL + 1)
  94
  95 #define OFFLOADS_MAX_FT 1
  96 #define OFFLOADS_NUM_PRIOS 1
  97 #define OFFLOADS_MIN_LEVEL (ANCHOR_MIN_LEVEL + 1)
  98
  99 #define LAG_PRIO_NUM_LEVELS 1
 100 #define LAG_NUM_PRIOS 1
 101 #define LAG_MIN_LEVEL (OFFLOADS_MIN_LEVEL + 1)
 102
 103 struct node_caps {
 104         size_t  arr_sz;
 105         long    *caps;
 106 };
 107 static struct init_tree_node {
 108         enum fs_node_type       type;
 109         struct init_tree_node *children;
 110         int ar_size;
 111         struct node_caps caps;
 112         int min_ft_level;
 113         int num_leaf_prios;
 114         int prio;
 115         int num_levels;
 116 } root_fs = {
 117         .type = FS_TYPE_NAMESPACE,
 118         .ar_size = 7,
 119         .children = (struct init_tree_node[]) {
 120                 ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0,
 121                          FS_CHAINING_CAPS,
 122                          ADD_NS(ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_PRIOS,
 123                                                   BY_PASS_PRIO_NUM_LEVELS))),
 124                 ADD_PRIO(0, LAG_MIN_LEVEL, 0,
 125                          FS_CHAINING_CAPS,
 126                          ADD_NS(ADD_MULTIPLE_PRIO(LAG_NUM_PRIOS,
 127                                                   LAG_PRIO_NUM_LEVELS))),
 128                 ADD_PRIO(0, OFFLOADS_MIN_LEVEL, 0, {},
 129                          ADD_NS(ADD_MULTIPLE_PRIO(OFFLOADS_NUM_PRIOS, OFFLOADS_MAX_FT))),
 130                 ADD_PRIO(0, ETHTOOL_MIN_LEVEL, 0,
 131                          FS_CHAINING_CAPS,
 132                          ADD_NS(ADD_MULTIPLE_PRIO(ETHTOOL_NUM_PRIOS,
 133                                                   ETHTOOL_PRIO_NUM_LEVELS))),
 134                 ADD_PRIO(0, KERNEL_MIN_LEVEL, 0, {},
 135                          ADD_NS(ADD_MULTIPLE_PRIO(1, 1),
 136                                 ADD_MULTIPLE_PRIO(KERNEL_NIC_NUM_PRIOS,
 137                                                   KERNEL_NIC_PRIO_NUM_LEVELS))),
 138                 ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0,
 139                          FS_CHAINING_CAPS,
 140                          ADD_NS(ADD_MULTIPLE_PRIO(LEFTOVERS_NUM_PRIOS, LEFTOVERS_NUM_LEVELS))),
 141                 ADD_PRIO(0, ANCHOR_MIN_LEVEL, 0, {},
 142                          ADD_NS(ADD_MULTIPLE_PRIO(ANCHOR_NUM_PRIOS, ANCHOR_NUM_LEVELS))),
 143         }
 144 };
 145
 146 enum fs_i_mutex_lock_class {
 147         FS_MUTEX_GRANDPARENT,
 148         FS_MUTEX_PARENT,
 149         FS_MUTEX_CHILD
 150 };
 151
 152 static void del_rule(struct fs_node *node);
 153 static void del_flow_table(struct fs_node *node);
 154 static void del_flow_group(struct fs_node *node);
 155 static void del_fte(struct fs_node *node);
 156 static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
 157                                 struct mlx5_flow_destination *d2);
 158
 159 static void tree_init_node(struct fs_node *node,
 160                            unsigned int refcount,
 161                            void (*remove_func)(struct fs_node *))
 162 {
 163         atomic_set(&node->refcount, refcount);
 164         INIT_LIST_HEAD(&node->list);
 165         INIT_LIST_HEAD(&node->children);
 166         mutex_init(&node->lock);
 167         node->remove_func = remove_func;
 168 }
 169
 170 static void tree_add_node(struct fs_node *node, struct fs_node *parent)
 171 {
 172         if (parent)
 173                 atomic_inc(&parent->refcount);
 174         node->parent = parent;
 175
 176         /* Parent is the root */
 177         if (!parent)
 178                 node->root = node;
 179         else
 180                 node->root = parent->root;
 181 }
 182
 183 static void tree_get_node(struct fs_node *node)
 184 {
 185         atomic_inc(&node->refcount);
 186 }
 187
 188 static void nested_lock_ref_node(struct fs_node *node,
 189                                  enum fs_i_mutex_lock_class class)
 190 {
 191         if (node) {
 192                 mutex_lock_nested(&node->lock, class);
 193                 atomic_inc(&node->refcount);
 194         }
 195 }
 196
 197 static void lock_ref_node(struct fs_node *node)
 198 {
 199         if (node) {
 200                 mutex_lock(&node->lock);
 201                 atomic_inc(&node->refcount);
 202         }
 203 }
 204
 205 static void unlock_ref_node(struct fs_node *node)
 206 {
 207         if (node) {
 208                 atomic_dec(&node->refcount);
 209                 mutex_unlock(&node->lock);
 210         }
 211 }
 212
 213 static void tree_put_node(struct fs_node *node)
 214 {
 215         struct fs_node *parent_node = node->parent;
 216
 217         lock_ref_node(parent_node);
 218         if (atomic_dec_and_test(&node->refcount)) {
 219                 if (parent_node)
 220                         list_del_init(&node->list);
 221                 if (node->remove_func)
 222                         node->remove_func(node);
 223                 kfree(node);
 224                 node = NULL;
 225         }
 226         unlock_ref_node(parent_node);
 227         if (!node && parent_node)
 228                 tree_put_node(parent_node);
 229 }
 230
 231 static int tree_remove_node(struct fs_node *node)
 232 {
 233         if (atomic_read(&node->refcount) > 1) {
 234                 atomic_dec(&node->refcount);
 235                 return -EEXIST;
 236         }
 237         tree_put_node(node);
 238         return 0;
 239 }
 240
 241 static struct fs_prio *find_prio(struct mlx5_flow_namespace *ns,
 242                                  unsigned int prio)
 243 {
 244         struct fs_prio *iter_prio;
 245
 246         fs_for_each_prio(iter_prio, ns) {
 247                 if (iter_prio->prio == prio)
 248                         return iter_prio;
 249         }
 250
 251         return NULL;
 252 }
 253
 254 static bool masked_memcmp(void *mask, void *val1, void *val2, size_t size)
 255 {
 256         unsigned int i;
 257
 258         for (i = 0; i < size; i++, mask++, val1++, val2++)
 259                 if ((*((u8 *)val1) & (*(u8 *)mask)) !=
 260                     ((*(u8 *)val2) & (*(u8 *)mask)))
 261                         return false;
 262
 263         return true;
 264 }
 265
 266 static bool compare_match_value(struct mlx5_flow_group_mask *mask,
 267                                 void *fte_param1, void *fte_param2)
 268 {
 269         if (mask->match_criteria_enable &
 270             1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_OUTER_HEADERS) {
 271                 void *fte_match1 = MLX5_ADDR_OF(fte_match_param,
 272                                                 fte_param1, outer_headers);
 273                 void *fte_match2 = MLX5_ADDR_OF(fte_match_param,
 274                                                 fte_param2, outer_headers);
 275                 void *fte_mask = MLX5_ADDR_OF(fte_match_param,
 276                                               mask->match_criteria, outer_headers);
 277
 278                 if (!masked_memcmp(fte_mask, fte_match1, fte_match2,
 279                                    MLX5_ST_SZ_BYTES(fte_match_set_lyr_2_4)))
 280                         return false;
 281         }
 282
 283         if (mask->match_criteria_enable &
 284             1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_MISC_PARAMETERS) {
 285                 void *fte_match1 = MLX5_ADDR_OF(fte_match_param,
 286                                                 fte_param1, misc_parameters);
 287                 void *fte_match2 = MLX5_ADDR_OF(fte_match_param,
 288                                                 fte_param2, misc_parameters);
 289                 void *fte_mask = MLX5_ADDR_OF(fte_match_param,
 290                                           mask->match_criteria, misc_parameters);
 291
 292                 if (!masked_memcmp(fte_mask, fte_match1, fte_match2,
 293                                    MLX5_ST_SZ_BYTES(fte_match_set_misc)))
 294                         return false;
 295         }
 296
 297         if (mask->match_criteria_enable &
 298             1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_INNER_HEADERS) {
 299                 void *fte_match1 = MLX5_ADDR_OF(fte_match_param,
 300                                                 fte_param1, inner_headers);
 301                 void *fte_match2 = MLX5_ADDR_OF(fte_match_param,
 302                                                 fte_param2, inner_headers);
 303                 void *fte_mask = MLX5_ADDR_OF(fte_match_param,
 304                                           mask->match_criteria, inner_headers);
 305
 306                 if (!masked_memcmp(fte_mask, fte_match1, fte_match2,
 307                                    MLX5_ST_SZ_BYTES(fte_match_set_lyr_2_4)))
 308                         return false;
 309         }
 310         return true;
 311 }
 312
 313 static bool compare_match_criteria(u8 match_criteria_enable1,
 314                                    u8 match_criteria_enable2,
 315                                    void *mask1, void *mask2)
 316 {
 317         return match_criteria_enable1 == match_criteria_enable2 &&
 318                 !memcmp(mask1, mask2, MLX5_ST_SZ_BYTES(fte_match_param));
 319 }
 320
 321 static struct mlx5_flow_root_namespace *find_root(struct fs_node *node)
 322 {
 323         struct fs_node *root;
 324         struct mlx5_flow_namespace *ns;
 325
 326         root = node->root;
 327
 328         if (WARN_ON(root->type != FS_TYPE_NAMESPACE)) {
 329                 pr_warn("mlx5: flow steering node is not in tree or garbaged\n");
 330                 return NULL;
 331         }
 332
 333         ns = container_of(root, struct mlx5_flow_namespace, node);
 334         return container_of(ns, struct mlx5_flow_root_namespace, ns);
 335 }
 336
 337 static inline struct mlx5_core_dev *get_dev(struct fs_node *node)
 338 {
 339         struct mlx5_flow_root_namespace *root = find_root(node);
 340
 341         if (root)
 342                 return root->dev;
 343         return NULL;
 344 }
 345
 346 static void del_flow_table(struct fs_node *node)
 347 {
 348         struct mlx5_flow_table *ft;
 349         struct mlx5_core_dev *dev;
 350         struct fs_prio *prio;
 351         int err;
 352
 353         fs_get_obj(ft, node);
 354         dev = get_dev(&ft->node);
 355
 356         err = mlx5_cmd_destroy_flow_table(dev, ft);
 357         if (err)
 358                 mlx5_core_warn(dev, "flow steering can't destroy ft\n");
 359         fs_get_obj(prio, ft->node.parent);
 360         prio->num_ft--;
 361 }
 362
 363 static void del_rule(struct fs_node *node)
 364 {
 365         struct mlx5_flow_rule *rule;
 366         struct mlx5_flow_table *ft;
 367         struct mlx5_flow_group *fg;
 368         struct fs_fte *fte;
 369         u32     *match_value;
 370         int modify_mask;
 371         struct mlx5_core_dev *dev = get_dev(node);
 372         int match_len = MLX5_ST_SZ_BYTES(fte_match_param);
 373         int err;
 374
 375         match_value = mlx5_vzalloc(match_len);
 376         if (!match_value) {
 377                 mlx5_core_warn(dev, "failed to allocate inbox\n");
 378                 return;
 379         }
 380
 381         fs_get_obj(rule, node);
 382         fs_get_obj(fte, rule->node.parent);
 383         fs_get_obj(fg, fte->node.parent);
 384         memcpy(match_value, fte->val, sizeof(fte->val));
 385         fs_get_obj(ft, fg->node.parent);
 386         list_del(&rule->node.list);
 387         if (rule->sw_action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
 388                 mutex_lock(&rule->dest_attr.ft->lock);
 389                 list_del(&rule->next_ft);
 390                 mutex_unlock(&rule->dest_attr.ft->lock);
 391         }
 392         if ((fte->action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST) &&
 393             --fte->dests_size) {
 394                 modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST),
 395                 err = mlx5_cmd_update_fte(dev, ft,
 396                                           fg->id,
 397                                           modify_mask,
 398                                           fte);
 399                 if (err)
 400                         mlx5_core_warn(dev,
 401                                        "%s can't del rule fg id=%d fte_index=%d\n",
 402                                        __func__, fg->id, fte->index);
 403         }
 404         kvfree(match_value);
 405 }
 406
 407 static void del_fte(struct fs_node *node)
 408 {
 409         struct mlx5_flow_table *ft;
 410         struct mlx5_flow_group *fg;
 411         struct mlx5_core_dev *dev;
 412         struct fs_fte *fte;
 413         int err;
 414
 415         fs_get_obj(fte, node);
 416         fs_get_obj(fg, fte->node.parent);
 417         fs_get_obj(ft, fg->node.parent);
 418
 419         dev = get_dev(&ft->node);
 420         err = mlx5_cmd_delete_fte(dev, ft,
 421                                   fte->index);
 422         if (err)
 423                 mlx5_core_warn(dev,
 424                                "flow steering can't delete fte in index %d of flow group id %d\n",
 425                                fte->index, fg->id);
 426
 427         fte->status = 0;
 428         fg->num_ftes--;
 429 }
 430
 431 static void del_flow_group(struct fs_node *node)
 432 {
 433         struct mlx5_flow_group *fg;
 434         struct mlx5_flow_table *ft;
 435         struct mlx5_core_dev *dev;
 436
 437         fs_get_obj(fg, node);
 438         fs_get_obj(ft, fg->node.parent);
 439         dev = get_dev(&ft->node);
 440
 441         if (mlx5_cmd_destroy_flow_group(dev, ft, fg->id))
 442                 mlx5_core_warn(dev, "flow steering can't destroy fg %d of ft %d\n",
 443                                fg->id, ft->id);
 444 }
 445
 446 static struct fs_fte *alloc_fte(u8 action,
 447                                 u32 flow_tag,
 448                                 u32 *match_value,
 449                                 unsigned int index)
 450 {
 451         struct fs_fte *fte;
 452
 453         fte = kzalloc(sizeof(*fte), GFP_KERNEL);
 454         if (!fte)
 455                 return ERR_PTR(-ENOMEM);
 456
 457         memcpy(fte->val, match_value, sizeof(fte->val));
 458         fte->node.type =  FS_TYPE_FLOW_ENTRY;
 459         fte->flow_tag = flow_tag;
 460         fte->index = index;
 461         fte->action = action;
 462
 463         return fte;
 464 }
 465
 466 static struct mlx5_flow_group *alloc_flow_group(u32 *create_fg_in)
 467 {
 468         struct mlx5_flow_group *fg;
 469         void *match_criteria = MLX5_ADDR_OF(create_flow_group_in,
 470                                             create_fg_in, match_criteria);
 471         u8 match_criteria_enable = MLX5_GET(create_flow_group_in,
 472                                             create_fg_in,
 473                                             match_criteria_enable);
 474         fg = kzalloc(sizeof(*fg), GFP_KERNEL);
 475         if (!fg)
 476                 return ERR_PTR(-ENOMEM);
 477
 478         fg->mask.match_criteria_enable = match_criteria_enable;
 479         memcpy(&fg->mask.match_criteria, match_criteria,
 480                sizeof(fg->mask.match_criteria));
 481         fg->node.type =  FS_TYPE_FLOW_GROUP;
 482         fg->start_index = MLX5_GET(create_flow_group_in, create_fg_in,
 483                                    start_flow_index);
 484         fg->max_ftes = MLX5_GET(create_flow_group_in, create_fg_in,
 485                                 end_flow_index) - fg->start_index + 1;
 486         return fg;
 487 }
 488
 489 static struct mlx5_flow_table *alloc_flow_table(int level, u16 vport, int max_fte,
 490                                                 enum fs_flow_table_type table_type,
 491                                                 enum fs_flow_table_op_mod op_mod)
 492 {
 493         struct mlx5_flow_table *ft;
 494
 495         ft  = kzalloc(sizeof(*ft), GFP_KERNEL);
 496         if (!ft)
 497                 return NULL;
 498
 499         ft->level = level;
 500         ft->node.type = FS_TYPE_FLOW_TABLE;
 501         ft->op_mod = op_mod;
 502         ft->type = table_type;
 503         ft->vport = vport;
 504         ft->max_fte = max_fte;
 505         INIT_LIST_HEAD(&ft->fwd_rules);
 506         mutex_init(&ft->lock);
 507
 508         return ft;
 509 }
 510
 511 /* If reverse is false, then we search for the first flow table in the
 512  * root sub-tree from start(closest from right), else we search for the
 513  * last flow table in the root sub-tree till start(closest from left).
 514  */
 515 static struct mlx5_flow_table *find_closest_ft_recursive(struct fs_node  *root,
 516                                                          struct list_head *start,
 517                                                          bool reverse)
 518 {
 519 #define list_advance_entry(pos, reverse)                \
 520         ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))
 521
 522 #define list_for_each_advance_continue(pos, head, reverse)      \
 523         for (pos = list_advance_entry(pos, reverse);            \
 524              &pos->list != (head);                              \
 525              pos = list_advance_entry(pos, reverse))
 526
 527         struct fs_node *iter = list_entry(start, struct fs_node, list);
 528         struct mlx5_flow_table *ft = NULL;
 529
 530         if (!root)
 531                 return NULL;
 532
 533         list_for_each_advance_continue(iter, &root->children, reverse) {
 534                 if (iter->type == FS_TYPE_FLOW_TABLE) {
 535                         fs_get_obj(ft, iter);
 536                         return ft;
 537                 }
 538                 ft = find_closest_ft_recursive(iter, &iter->children, reverse);
 539                 if (ft)
 540                         return ft;
 541         }
 542
 543         return ft;
 544 }
 545
 546 /* If reverse if false then return the first flow table in next priority of
 547  * prio in the tree, else return the last flow table in the previous priority
 548  * of prio in the tree.
 549  */
 550 static struct mlx5_flow_table *find_closest_ft(struct fs_prio *prio, bool reverse)
 551 {
 552         struct mlx5_flow_table *ft = NULL;
 553         struct fs_node *curr_node;
 554         struct fs_node *parent;
 555
 556         parent = prio->node.parent;
 557         curr_node = &prio->node;
 558         while (!ft && parent) {
 559                 ft = find_closest_ft_recursive(parent, &curr_node->list, reverse);
 560                 curr_node = parent;
 561                 parent = curr_node->parent;
 562         }
 563         return ft;
 564 }
 565
 566 /* Assuming all the tree is locked by mutex chain lock */
 567 static struct mlx5_flow_table *find_next_chained_ft(struct fs_prio *prio)
 568 {
 569         return find_closest_ft(prio, false);
 570 }
 571
 572 /* Assuming all the tree is locked by mutex chain lock */
 573 static struct mlx5_flow_table *find_prev_chained_ft(struct fs_prio *prio)
 574 {
 575         return find_closest_ft(prio, true);
 576 }
 577
 578 static int connect_fts_in_prio(struct mlx5_core_dev *dev,
 579                                struct fs_prio *prio,
 580                                struct mlx5_flow_table *ft)
 581 {
 582         struct mlx5_flow_table *iter;
 583         int i = 0;
 584         int err;
 585
 586         fs_for_each_ft(iter, prio) {
 587                 i++;
 588                 err = mlx5_cmd_modify_flow_table(dev,
 589                                                  iter,
 590                                                  ft);
 591                 if (err) {
 592                         mlx5_core_warn(dev, "Failed to modify flow table %d\n",
 593                                        iter->id);
 594                         /* The driver is out of sync with the FW */
 595                         if (i > 1)
 596                                 WARN_ON(true);
 597                         return err;
 598                 }
 599         }
 600         return 0;
 601 }
 602
 603 /* Connect flow tables from previous priority of prio to ft */
 604 static int connect_prev_fts(struct mlx5_core_dev *dev,
 605                             struct mlx5_flow_table *ft,
 606                             struct fs_prio *prio)
 607 {
 608         struct mlx5_flow_table *prev_ft;
 609
 610         prev_ft = find_prev_chained_ft(prio);
 611         if (prev_ft) {
 612                 struct fs_prio *prev_prio;
 613
 614                 fs_get_obj(prev_prio, prev_ft->node.parent);
 615                 return connect_fts_in_prio(dev, prev_prio, ft);
 616         }
 617         return 0;
 618 }
 619
 620 static int update_root_ft_create(struct mlx5_flow_table *ft, struct fs_prio
 621                                  *prio)
 622 {
 623         struct mlx5_flow_root_namespace *root = find_root(&prio->node);
 624         int min_level = INT_MAX;
 625         int err;
 626
 627         if (root->root_ft)
 628                 min_level = root->root_ft->level;
 629
 630         if (ft->level >= min_level)
 631                 return 0;
 632
 633         err = mlx5_cmd_update_root_ft(root->dev, ft);
 634         if (err)
 635                 mlx5_core_warn(root->dev, "Update root flow table of id=%u failed\n",
 636                                ft->id);
 637         else
 638                 root->root_ft = ft;
 639
 640         return err;
 641 }
 642
 643 int mlx5_modify_rule_destination(struct mlx5_flow_rule *rule,
 644                                  struct mlx5_flow_destination *dest)
 645 {
 646         struct mlx5_flow_table *ft;
 647         struct mlx5_flow_group *fg;
 648         struct fs_fte *fte;
 649         int modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
 650         int err = 0;
 651
 652         fs_get_obj(fte, rule->node.parent);
 653         if (!(fte->action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
 654                 return -EINVAL;
 655         lock_ref_node(&fte->node);
 656         fs_get_obj(fg, fte->node.parent);
 657         fs_get_obj(ft, fg->node.parent);
 658
 659         memcpy(&rule->dest_attr, dest, sizeof(*dest));
 660         err = mlx5_cmd_update_fte(get_dev(&ft->node),
 661                                   ft, fg->id,
 662                                   modify_mask,
 663                                   fte);
 664         unlock_ref_node(&fte->node);
 665
 666         return err;
 667 }
 668
 669 /* Modify/set FWD rules that point on old_next_ft to point on new_next_ft  */
 670 static int connect_fwd_rules(struct mlx5_core_dev *dev,
 671                              struct mlx5_flow_table *new_next_ft,
 672                              struct mlx5_flow_table *old_next_ft)
 673 {
 674         struct mlx5_flow_destination dest;
 675         struct mlx5_flow_rule *iter;
 676         int err = 0;
 677
 678         /* new_next_ft and old_next_ft could be NULL only
 679          * when we create/destroy the anchor flow table.
 680          */
 681         if (!new_next_ft || !old_next_ft)
 682                 return 0;
 683
 684         dest.type = MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
 685         dest.ft = new_next_ft;
 686
 687         mutex_lock(&old_next_ft->lock);
 688         list_splice_init(&old_next_ft->fwd_rules, &new_next_ft->fwd_rules);
 689         mutex_unlock(&old_next_ft->lock);
 690         list_for_each_entry(iter, &new_next_ft->fwd_rules, next_ft) {
 691                 err = mlx5_modify_rule_destination(iter, &dest);
 692                 if (err)
 693                         pr_err("mlx5_core: failed to modify rule to point on flow table %d\n",
 694                                new_next_ft->id);
 695         }
 696         return 0;
 697 }
 698
 699 static int connect_flow_table(struct mlx5_core_dev *dev, struct mlx5_flow_table *ft,
 700                               struct fs_prio *prio)
 701 {
 702         struct mlx5_flow_table *next_ft;
 703         int err = 0;
 704
 705         /* Connect_prev_fts and update_root_ft_create are mutually exclusive */
 706
 707         if (list_empty(&prio->node.children)) {
 708                 err = connect_prev_fts(dev, ft, prio);
 709                 if (err)
 710                         return err;
 711
 712                 next_ft = find_next_chained_ft(prio);
 713                 err = connect_fwd_rules(dev, ft, next_ft);
 714                 if (err)
 715                         return err;
 716         }
 717
 718         if (MLX5_CAP_FLOWTABLE(dev,
 719                                flow_table_properties_nic_receive.modify_root))
 720                 err = update_root_ft_create(ft, prio);
 721         return err;
 722 }
 723
 724 static void list_add_flow_table(struct mlx5_flow_table *ft,
 725                                 struct fs_prio *prio)
 726 {
 727         struct list_head *prev = &prio->node.children;
 728         struct mlx5_flow_table *iter;
 729
 730         fs_for_each_ft(iter, prio) {
 731                 if (iter->level > ft->level)
 732                         break;
 733                 prev = &iter->node.list;
 734         }
 735         list_add(&ft->node.list, prev);
 736 }
 737
 738 static struct mlx5_flow_table *__mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
 739                                                         enum fs_flow_table_op_mod op_mod,
 740                                                         u16 vport, int prio,
 741                                                         int max_fte, u32 level)
 742 {
 743         struct mlx5_flow_table *next_ft = NULL;
 744         struct mlx5_flow_table *ft;
 745         int err;
 746         int log_table_sz;
 747         struct mlx5_flow_root_namespace *root =
 748                 find_root(&ns->node);
 749         struct fs_prio *fs_prio = NULL;
 750
 751         if (!root) {
 752                 pr_err("mlx5: flow steering failed to find root of namespace\n");
 753                 return ERR_PTR(-ENODEV);
 754         }
 755
 756         mutex_lock(&root->chain_lock);
 757         fs_prio = find_prio(ns, prio);
 758         if (!fs_prio) {
 759                 err = -EINVAL;
 760                 goto unlock_root;
 761         }
 762         if (level >= fs_prio->num_levels) {
 763                 err = -ENOSPC;
 764                 goto unlock_root;
 765         }
 766         /* The level is related to the
 767          * priority level range.
 768          */
 769         level += fs_prio->start_level;
 770         ft = alloc_flow_table(level,
 771                               vport,
 772                               max_fte ? roundup_pow_of_two(max_fte) : 0,
 773                               root->table_type,
 774                               op_mod);
 775         if (!ft) {
 776                 err = -ENOMEM;
 777                 goto unlock_root;
 778         }
 779
 780         tree_init_node(&ft->node, 1, del_flow_table);
 781         log_table_sz = ft->max_fte ? ilog2(ft->max_fte) : 0;
 782         next_ft = find_next_chained_ft(fs_prio);
 783         err = mlx5_cmd_create_flow_table(root->dev, ft->vport, ft->op_mod, ft->type,
 784                                          ft->level, log_table_sz, next_ft, &ft->id);
 785         if (err)
 786                 goto free_ft;
 787
 788         err = connect_flow_table(root->dev, ft, fs_prio);
 789         if (err)
 790                 goto destroy_ft;
 791         lock_ref_node(&fs_prio->node);
 792         tree_add_node(&ft->node, &fs_prio->node);
 793         list_add_flow_table(ft, fs_prio);
 794         fs_prio->num_ft++;
 795         unlock_ref_node(&fs_prio->node);
 796         mutex_unlock(&root->chain_lock);
 797         return ft;
 798 destroy_ft:
 799         mlx5_cmd_destroy_flow_table(root->dev, ft);
 800 free_ft:
 801         kfree(ft);
 802 unlock_root:
 803         mutex_unlock(&root->chain_lock);
 804         return ERR_PTR(err);
 805 }
 806
 807 struct mlx5_flow_table *mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
 808                                                int prio, int max_fte,
 809                                                u32 level)
 810 {
 811         return __mlx5_create_flow_table(ns, FS_FT_OP_MOD_NORMAL, 0, prio,
 812                                         max_fte, level);
 813 }
 814
 815 struct mlx5_flow_table *mlx5_create_vport_flow_table(struct mlx5_flow_namespace *ns,
 816                                                      int prio, int max_fte,
 817                                                      u32 level, u16 vport)
 818 {
 819         return __mlx5_create_flow_table(ns, FS_FT_OP_MOD_NORMAL, vport, prio,
 820                                         max_fte, level);
 821 }
 822
 823 struct mlx5_flow_table *mlx5_create_lag_demux_flow_table(
 824                                                struct mlx5_flow_namespace *ns,
 825                                                int prio, u32 level)
 826 {
 827         return __mlx5_create_flow_table(ns, FS_FT_OP_MOD_LAG_DEMUX, 0, prio, 0,
 828                                         level);
 829 }
 830 EXPORT_SYMBOL(mlx5_create_lag_demux_flow_table);
 831
 832 struct mlx5_flow_table *mlx5_create_auto_grouped_flow_table(struct mlx5_flow_namespace *ns,
 833                                                             int prio,
 834                                                             int num_flow_table_entries,
 835                                                             int max_num_groups,
 836                                                             u32 level)
 837 {
 838         struct mlx5_flow_table *ft;
 839
 840         if (max_num_groups > num_flow_table_entries)
 841                 return ERR_PTR(-EINVAL);
 842
 843         ft = mlx5_create_flow_table(ns, prio, num_flow_table_entries, level);
 844         if (IS_ERR(ft))
 845                 return ft;
 846
 847         ft->autogroup.active = true;
 848         ft->autogroup.required_groups = max_num_groups;
 849
 850         return ft;
 851 }
 852 EXPORT_SYMBOL(mlx5_create_auto_grouped_flow_table);
 853
 854 /* Flow table should be locked */
 855 static struct mlx5_flow_group *create_flow_group_common(struct mlx5_flow_table *ft,
 856                                                         u32 *fg_in,
 857                                                         struct list_head
 858                                                         *prev_fg,
 859                                                         bool is_auto_fg)
 860 {
 861         struct mlx5_flow_group *fg;
 862         struct mlx5_core_dev *dev = get_dev(&ft->node);
 863         int err;
 864
 865         if (!dev)
 866                 return ERR_PTR(-ENODEV);
 867
 868         fg = alloc_flow_group(fg_in);
 869         if (IS_ERR(fg))
 870                 return fg;
 871
 872         err = mlx5_cmd_create_flow_group(dev, ft, fg_in, &fg->id);
 873         if (err) {
 874                 kfree(fg);
 875                 return ERR_PTR(err);
 876         }
 877
 878         if (ft->autogroup.active)
 879                 ft->autogroup.num_groups++;
 880         /* Add node to tree */
 881         tree_init_node(&fg->node, !is_auto_fg, del_flow_group);
 882         tree_add_node(&fg->node, &ft->node);
 883         /* Add node to group list */
 884         list_add(&fg->node.list, ft->node.children.prev);
 885
 886         return fg;
 887 }
 888
 889 struct mlx5_flow_group *mlx5_create_flow_group(struct mlx5_flow_table *ft,
 890                                                u32 *fg_in)
 891 {
 892         struct mlx5_flow_group *fg;
 893
 894         if (ft->autogroup.active)
 895                 return ERR_PTR(-EPERM);
 896
 897         lock_ref_node(&ft->node);
 898         fg = create_flow_group_common(ft, fg_in, &ft->node.children, false);
 899         unlock_ref_node(&ft->node);
 900
 901         return fg;
 902 }
 903
 904 static struct mlx5_flow_rule *alloc_rule(struct mlx5_flow_destination *dest)
 905 {
 906         struct mlx5_flow_rule *rule;
 907
 908         rule = kzalloc(sizeof(*rule), GFP_KERNEL);
 909         if (!rule)
 910                 return NULL;
 911
 912         INIT_LIST_HEAD(&rule->next_ft);
 913         rule->node.type = FS_TYPE_FLOW_DEST;
 914         if (dest)
 915                 memcpy(&rule->dest_attr, dest, sizeof(*dest));
 916
 917         return rule;
 918 }
 919
 920 /* fte should not be deleted while calling this function */
 921 static struct mlx5_flow_rule *add_rule_fte(struct fs_fte *fte,
 922                                            struct mlx5_flow_group *fg,
 923                                            struct mlx5_flow_destination *dest,
 924                                            bool update_action)
 925 {
 926         struct mlx5_flow_table *ft;
 927         struct mlx5_flow_rule *rule;
 928         int modify_mask = 0;
 929         int err;
 930
 931         rule = alloc_rule(dest);
 932         if (!rule)
 933                 return ERR_PTR(-ENOMEM);
 934
 935         if (update_action)
 936                 modify_mask |= BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION);
 937
 938         fs_get_obj(ft, fg->node.parent);
 939         /* Add dest to dests list- we need flow tables to be in the
 940          * end of the list for forward to next prio rules.
 941          */
 942         tree_init_node(&rule->node, 1, del_rule);
 943         if (dest && dest->type != MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE)
 944                 list_add(&rule->node.list, &fte->node.children);
 945         else
 946                 list_add_tail(&rule->node.list, &fte->node.children);
 947         if (dest) {
 948                 fte->dests_size++;
 949
 950                 modify_mask |= dest->type == MLX5_FLOW_DESTINATION_TYPE_COUNTER ?
 951                         BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_FLOW_COUNTERS) :
 952                         BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
 953         }
 954
 955         if (!(fte->status & FS_FTE_STATUS_EXISTING))
 956                 err = mlx5_cmd_create_fte(get_dev(&ft->node),
 957                                           ft, fg->id, fte);
 958         else
 959                 err = mlx5_cmd_update_fte(get_dev(&ft->node),
 960                                           ft, fg->id, modify_mask, fte);
 961         if (err)
 962                 goto free_rule;
 963
 964         fte->status |= FS_FTE_STATUS_EXISTING;
 965
 966         return rule;
 967
 968 free_rule:
 969         list_del(&rule->node.list);
 970         kfree(rule);
 971         if (dest)
 972                 fte->dests_size--;
 973         return ERR_PTR(err);
 974 }
 975
 976 /* Assumed fg is locked */
 977 static unsigned int get_free_fte_index(struct mlx5_flow_group *fg,
 978                                        struct list_head **prev)
 979 {
 980         struct fs_fte *fte;
 981         unsigned int start = fg->start_index;
 982
 983         if (prev)
 984                 *prev = &fg->node.children;
 985
 986         /* assumed list is sorted by index */
 987         fs_for_each_fte(fte, fg) {
 988                 if (fte->index != start)
 989                         return start;
 990                 start++;
 991                 if (prev)
 992                         *prev = &fte->node.list;
 993         }
 994
 995         return start;
 996 }
 997
 998 /* prev is output, prev->next = new_fte */
 999 static struct fs_fte *create_fte(struct mlx5_flow_group *fg,
1000                                  u32 *match_value,
1001                                  u8 action,
1002                                  u32 flow_tag,
1003                                  struct list_head **prev)
1004 {
1005         struct fs_fte *fte;
1006         int index;
1007
1008         index = get_free_fte_index(fg, prev);
1009         fte = alloc_fte(action, flow_tag, match_value, index);
1010         if (IS_ERR(fte))
1011                 return fte;
1012
1013         return fte;
1014 }
1015
1016 static struct mlx5_flow_group *create_autogroup(struct mlx5_flow_table *ft,
1017                                                 u8 match_criteria_enable,
1018                                                 u32 *match_criteria)
1019 {
1020         int inlen = MLX5_ST_SZ_BYTES(create_flow_group_in);
1021         struct list_head *prev = &ft->node.children;
1022         unsigned int candidate_index = 0;
1023         struct mlx5_flow_group *fg;
1024         void *match_criteria_addr;
1025         unsigned int group_size = 0;
1026         u32 *in;
1027
1028         if (!ft->autogroup.active)
1029                 return ERR_PTR(-ENOENT);
1030
1031         in = mlx5_vzalloc(inlen);
1032         if (!in)
1033                 return ERR_PTR(-ENOMEM);
1034
1035         if (ft->autogroup.num_groups < ft->autogroup.required_groups)
1036                 /* We save place for flow groups in addition to max types */
1037                 group_size = ft->max_fte / (ft->autogroup.required_groups + 1);
1038
1039         /*  ft->max_fte == ft->autogroup.max_types */
1040         if (group_size == 0)
1041                 group_size = 1;
1042
1043         /* sorted by start_index */
1044         fs_for_each_fg(fg, ft) {
1045                 if (candidate_index + group_size > fg->start_index)
1046                         candidate_index = fg->start_index + fg->max_ftes;
1047                 else
1048                         break;
1049                 prev = &fg->node.list;
1050         }
1051
1052         if (candidate_index + group_size > ft->max_fte) {
1053                 fg = ERR_PTR(-ENOSPC);
1054                 goto out;
1055         }
1056
1057         MLX5_SET(create_flow_group_in, in, match_criteria_enable,
1058                  match_criteria_enable);
1059         MLX5_SET(create_flow_group_in, in, start_flow_index, candidate_index);
1060         MLX5_SET(create_flow_group_in, in, end_flow_index,   candidate_index +
1061                  group_size - 1);
1062         match_criteria_addr = MLX5_ADDR_OF(create_flow_group_in,
1063                                            in, match_criteria);
1064         memcpy(match_criteria_addr, match_criteria,
1065                MLX5_ST_SZ_BYTES(fte_match_param));
1066
1067         fg = create_flow_group_common(ft, in, prev, true);
1068 out:
1069         kvfree(in);
1070         return fg;
1071 }
1072
1073 static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
1074                                 struct mlx5_flow_destination *d2)
1075 {
1076         if (d1->type == d2->type) {
1077                 if ((d1->type == MLX5_FLOW_DESTINATION_TYPE_VPORT &&
1078                      d1->vport_num == d2->vport_num) ||
1079                     (d1->type == MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE &&
1080                      d1->ft == d2->ft) ||
1081                     (d1->type == MLX5_FLOW_DESTINATION_TYPE_TIR &&
1082                      d1->tir_num == d2->tir_num))
1083                         return true;
1084         }
1085
1086         return false;
1087 }
1088
1089 static struct mlx5_flow_rule *find_flow_rule(struct fs_fte *fte,
1090                                              struct mlx5_flow_destination *dest)
1091 {
1092         struct mlx5_flow_rule *rule;
1093
1094         list_for_each_entry(rule, &fte->node.children, node.list) {
1095                 if (mlx5_flow_dests_cmp(&rule->dest_attr, dest))
1096                         return rule;
1097         }
1098         return NULL;
1099 }
1100
1101 static struct mlx5_flow_rule *add_rule_fg(struct mlx5_flow_group *fg,
1102                                           u32 *match_value,
1103                                           u8 action,
1104                                           u32 flow_tag,
1105                                           struct mlx5_flow_destination *dest)
1106 {
1107         struct fs_fte *fte;
1108         struct mlx5_flow_rule *rule;
1109         struct mlx5_flow_table *ft;
1110         struct list_head *prev;
1111
1112         nested_lock_ref_node(&fg->node, FS_MUTEX_PARENT);
1113         fs_for_each_fte(fte, fg) {
1114                 nested_lock_ref_node(&fte->node, FS_MUTEX_CHILD);
1115                 if (compare_match_value(&fg->mask, match_value, &fte->val) &&
1116                     (action & fte->action) && flow_tag == fte->flow_tag) {
1117                         int old_action = fte->action;
1118
1119                         rule = find_flow_rule(fte, dest);
1120                         if (rule) {
1121                                 atomic_inc(&rule->node.refcount);
1122                                 unlock_ref_node(&fte->node);
1123                                 unlock_ref_node(&fg->node);
1124                                 return rule;
1125                         }
1126                         fte->action |= action;
1127                         rule = add_rule_fte(fte, fg, dest,
1128                                             old_action != action);
1129                         if (IS_ERR(rule)) {
1130                                 fte->action = old_action;
1131                                 goto unlock_fte;
1132                         } else {
1133                                 goto add_rule;
1134                         }
1135                 }
1136                 unlock_ref_node(&fte->node);
1137         }
1138         fs_get_obj(ft, fg->node.parent);
1139         if (fg->num_ftes >= fg->max_ftes) {
1140                 rule = ERR_PTR(-ENOSPC);
1141                 goto unlock_fg;
1142         }
1143
1144         fte = create_fte(fg, match_value, action, flow_tag, &prev);
1145         if (IS_ERR(fte)) {
1146                 rule = (void *)fte;
1147                 goto unlock_fg;
1148         }
1149         tree_init_node(&fte->node, 0, del_fte);
1150         nested_lock_ref_node(&fte->node, FS_MUTEX_CHILD);
1151         rule = add_rule_fte(fte, fg, dest, false);
1152         if (IS_ERR(rule)) {
1153                 kfree(fte);
1154                 goto unlock_fg;
1155         }
1156
1157         fg->num_ftes++;
1158
1159         tree_add_node(&fte->node, &fg->node);
1160         list_add(&fte->node.list, prev);
1161 add_rule:
1162         tree_add_node(&rule->node, &fte->node);
1163 unlock_fte:
1164         unlock_ref_node(&fte->node);
1165 unlock_fg:
1166         unlock_ref_node(&fg->node);
1167         return rule;
1168 }
1169
1170 struct mlx5_fc *mlx5_flow_rule_counter(struct mlx5_flow_rule *rule)
1171 {
1172         struct mlx5_flow_rule *dst;
1173         struct fs_fte *fte;
1174
1175         fs_get_obj(fte, rule->node.parent);
1176
1177         fs_for_each_dst(dst, fte) {
1178                 if (dst->dest_attr.type == MLX5_FLOW_DESTINATION_TYPE_COUNTER)
1179                         return dst->dest_attr.counter;
1180         }
1181
1182         return NULL;
1183 }
1184
1185 static bool counter_is_valid(struct mlx5_fc *counter, u32 action)
1186 {
1187         if (!(action & MLX5_FLOW_CONTEXT_ACTION_COUNT))
1188                 return !counter;
1189
1190         if (!counter)
1191                 return false;
1192
1193         /* Hardware support counter for a drop action only */
1194         return action == (MLX5_FLOW_CONTEXT_ACTION_DROP | MLX5_FLOW_CONTEXT_ACTION_COUNT);
1195 }
1196
1197 static bool dest_is_valid(struct mlx5_flow_destination *dest,
1198                           u32 action,
1199                           struct mlx5_flow_table *ft)
1200 {
1201         if (dest && (dest->type == MLX5_FLOW_DESTINATION_TYPE_COUNTER))
1202                 return counter_is_valid(dest->counter, action);
1203
1204         if (!(action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
1205                 return true;
1206
1207         if (!dest || ((dest->type ==
1208             MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE) &&
1209             (dest->ft->level <= ft->level)))
1210                 return false;
1211         return true;
1212 }
1213
1214 static struct mlx5_flow_rule *
1215 _mlx5_add_flow_rule(struct mlx5_flow_table *ft,
1216                    struct mlx5_flow_spec *spec,
1217                     u32 action,
1218                     u32 flow_tag,
1219                     struct mlx5_flow_destination *dest)
1220 {
1221         struct mlx5_flow_group *g;
1222         struct mlx5_flow_rule *rule;
1223
1224         if (!dest_is_valid(dest, action, ft))
1225                 return ERR_PTR(-EINVAL);
1226
1227         nested_lock_ref_node(&ft->node, FS_MUTEX_GRANDPARENT);
1228         fs_for_each_fg(g, ft)
1229                 if (compare_match_criteria(g->mask.match_criteria_enable,
1230                                            spec->match_criteria_enable,
1231                                            g->mask.match_criteria,
1232                                            spec->match_criteria)) {
1233                         rule = add_rule_fg(g, spec->match_value,
1234                                            action, flow_tag, dest);
1235                         if (!IS_ERR(rule) || PTR_ERR(rule) != -ENOSPC)
1236                                 goto unlock;
1237                 }
1238
1239         g = create_autogroup(ft, spec->match_criteria_enable,
1240                              spec->match_criteria);
1241         if (IS_ERR(g)) {
1242                 rule = (void *)g;
1243                 goto unlock;
1244         }
1245
1246         rule = add_rule_fg(g, spec->match_value,
1247                            action, flow_tag, dest);
1248         if (IS_ERR(rule)) {
1249                 /* Remove assumes refcount > 0 and autogroup creates a group
1250                  * with a refcount = 0.
1251                  */
1252                 unlock_ref_node(&ft->node);
1253                 tree_get_node(&g->node);
1254                 tree_remove_node(&g->node);
1255                 return rule;
1256         }
1257 unlock:
1258         unlock_ref_node(&ft->node);
1259         return rule;
1260 }
1261
1262 static bool fwd_next_prio_supported(struct mlx5_flow_table *ft)
1263 {
1264         return ((ft->type == FS_FT_NIC_RX) &&
1265                 (MLX5_CAP_FLOWTABLE(get_dev(&ft->node), nic_rx_multi_path_tirs)));
1266 }
1267
1268 struct mlx5_flow_rule *
1269 mlx5_add_flow_rule(struct mlx5_flow_table *ft,
1270                    struct mlx5_flow_spec *spec,
1271                    u32 action,
1272                    u32 flow_tag,
1273                    struct mlx5_flow_destination *dest)
1274 {
1275         struct mlx5_flow_root_namespace *root = find_root(&ft->node);
1276         struct mlx5_flow_destination gen_dest;
1277         struct mlx5_flow_table *next_ft = NULL;
1278         struct mlx5_flow_rule *rule = NULL;
1279         u32 sw_action = action;
1280         struct fs_prio *prio;
1281
1282         fs_get_obj(prio, ft->node.parent);
1283         if (action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
1284                 if (!fwd_next_prio_supported(ft))
1285                         return ERR_PTR(-EOPNOTSUPP);
1286                 if (dest)
1287                         return ERR_PTR(-EINVAL);
1288                 mutex_lock(&root->chain_lock);
1289                 next_ft = find_next_chained_ft(prio);
1290                 if (next_ft) {
1291                         gen_dest.type = MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
1292                         gen_dest.ft = next_ft;
1293                         dest = &gen_dest;
1294                         action = MLX5_FLOW_CONTEXT_ACTION_FWD_DEST;
1295                 } else {
1296                         mutex_unlock(&root->chain_lock);
1297                         return ERR_PTR(-EOPNOTSUPP);
1298                 }
1299         }
1300
1301         rule = _mlx5_add_flow_rule(ft, spec, action, flow_tag, dest);
1302
1303         if (sw_action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
1304                 if (!IS_ERR_OR_NULL(rule) &&
1305                     (list_empty(&rule->next_ft))) {
1306                         mutex_lock(&next_ft->lock);
1307                         list_add(&rule->next_ft, &next_ft->fwd_rules);
1308                         mutex_unlock(&next_ft->lock);
1309                         rule->sw_action = MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO;
1310                 }
1311                 mutex_unlock(&root->chain_lock);
1312         }
1313         return rule;
1314 }
1315 EXPORT_SYMBOL(mlx5_add_flow_rule);
1316
1317 void mlx5_del_flow_rule(struct mlx5_flow_rule *rule)
1318 {
1319         tree_remove_node(&rule->node);
1320 }
1321 EXPORT_SYMBOL(mlx5_del_flow_rule);
1322
1323 /* Assuming prio->node.children(flow tables) is sorted by level */
1324 static struct mlx5_flow_table *find_next_ft(struct mlx5_flow_table *ft)
1325 {
1326         struct fs_prio *prio;
1327
1328         fs_get_obj(prio, ft->node.parent);
1329
1330         if (!list_is_last(&ft->node.list, &prio->node.children))
1331                 return list_next_entry(ft, node.list);
1332         return find_next_chained_ft(prio);
1333 }
1334
1335 static int update_root_ft_destroy(struct mlx5_flow_table *ft)
1336 {
1337         struct mlx5_flow_root_namespace *root = find_root(&ft->node);
1338         struct mlx5_flow_table *new_root_ft = NULL;
1339
1340         if (root->root_ft != ft)
1341                 return 0;
1342
1343         new_root_ft = find_next_ft(ft);
1344         if (new_root_ft) {
1345                 int err = mlx5_cmd_update_root_ft(root->dev, new_root_ft);
1346
1347                 if (err) {
1348                         mlx5_core_warn(root->dev, "Update root flow table of id=%u failed\n",
1349                                        ft->id);
1350                         return err;
1351                 }
1352         }
1353         root->root_ft = new_root_ft;
1354         return 0;
1355 }
1356
1357 /* Connect flow table from previous priority to
1358  * the next flow table.
1359  */
1360 static int disconnect_flow_table(struct mlx5_flow_table *ft)
1361 {
1362         struct mlx5_core_dev *dev = get_dev(&ft->node);
1363         struct mlx5_flow_table *next_ft;
1364         struct fs_prio *prio;
1365         int err = 0;
1366
1367         err = update_root_ft_destroy(ft);
1368         if (err)
1369                 return err;
1370
1371         fs_get_obj(prio, ft->node.parent);
1372         if  (!(list_first_entry(&prio->node.children,
1373                                 struct mlx5_flow_table,
1374                                 node.list) == ft))
1375                 return 0;
1376
1377         next_ft = find_next_chained_ft(prio);
1378         err = connect_fwd_rules(dev, next_ft, ft);
1379         if (err)
1380                 return err;
1381
1382         err = connect_prev_fts(dev, next_ft, prio);
1383         if (err)
1384                 mlx5_core_warn(dev, "Failed to disconnect flow table %d\n",
1385                                ft->id);
1386         return err;
1387 }
1388
1389 int mlx5_destroy_flow_table(struct mlx5_flow_table *ft)
1390 {
1391         struct mlx5_flow_root_namespace *root = find_root(&ft->node);
1392         int err = 0;
1393
1394         mutex_lock(&root->chain_lock);
1395         err = disconnect_flow_table(ft);
1396         if (err) {
1397                 mutex_unlock(&root->chain_lock);
1398                 return err;
1399         }
1400         if (tree_remove_node(&ft->node))
1401                 mlx5_core_warn(get_dev(&ft->node), "Flow table %d wasn't destroyed, refcount > 1\n",
1402                                ft->id);
1403         mutex_unlock(&root->chain_lock);
1404
1405         return err;
1406 }
1407 EXPORT_SYMBOL(mlx5_destroy_flow_table);
1408
1409 void mlx5_destroy_flow_group(struct mlx5_flow_group *fg)
1410 {
1411         if (tree_remove_node(&fg->node))
1412                 mlx5_core_warn(get_dev(&fg->node), "Flow group %d wasn't destroyed, refcount > 1\n",
1413                                fg->id);
1414 }
1415
1416 struct mlx5_flow_namespace *mlx5_get_flow_namespace(struct mlx5_core_dev *dev,
1417                                                     enum mlx5_flow_namespace_type type)
1418 {
1419         struct mlx5_flow_steering *steering = dev->priv.steering;
1420         struct mlx5_flow_root_namespace *root_ns;
1421         int prio;
1422         struct fs_prio *fs_prio;
1423         struct mlx5_flow_namespace *ns;
1424
1425         if (!steering)
1426                 return NULL;
1427
1428         switch (type) {
1429         case MLX5_FLOW_NAMESPACE_BYPASS:
1430         case MLX5_FLOW_NAMESPACE_LAG:
1431         case MLX5_FLOW_NAMESPACE_OFFLOADS:
1432         case MLX5_FLOW_NAMESPACE_ETHTOOL:
1433         case MLX5_FLOW_NAMESPACE_KERNEL:
1434         case MLX5_FLOW_NAMESPACE_LEFTOVERS:
1435         case MLX5_FLOW_NAMESPACE_ANCHOR:
1436                 prio = type;
1437                 break;
1438         case MLX5_FLOW_NAMESPACE_FDB:
1439                 if (steering->fdb_root_ns)
1440                         return &steering->fdb_root_ns->ns;
1441                 else
1442                         return NULL;
1443         case MLX5_FLOW_NAMESPACE_ESW_EGRESS:
1444                 if (steering->esw_egress_root_ns)
1445                         return &steering->esw_egress_root_ns->ns;
1446                 else
1447                         return NULL;
1448         case MLX5_FLOW_NAMESPACE_ESW_INGRESS:
1449                 if (steering->esw_ingress_root_ns)
1450                         return &steering->esw_ingress_root_ns->ns;
1451                 else
1452                         return NULL;
1453         case MLX5_FLOW_NAMESPACE_SNIFFER_RX:
1454                 if (steering->sniffer_rx_root_ns)
1455                         return &steering->sniffer_rx_root_ns->ns;
1456                 else
1457                         return NULL;
1458         case MLX5_FLOW_NAMESPACE_SNIFFER_TX:
1459                 if (steering->sniffer_tx_root_ns)
1460                         return &steering->sniffer_tx_root_ns->ns;
1461                 else
1462                         return NULL;
1463         default:
1464                 return NULL;
1465         }
1466
1467         root_ns = steering->root_ns;
1468         if (!root_ns)
1469                 return NULL;
1470
1471         fs_prio = find_prio(&root_ns->ns, prio);
1472         if (!fs_prio)
1473                 return NULL;
1474
1475         ns = list_first_entry(&fs_prio->node.children,
1476                               typeof(*ns),
1477                               node.list);
1478
1479         return ns;
1480 }
1481 EXPORT_SYMBOL(mlx5_get_flow_namespace);
1482
1483 static struct fs_prio *fs_create_prio(struct mlx5_flow_namespace *ns,
1484                                       unsigned int prio, int num_levels)
1485 {
1486         struct fs_prio *fs_prio;
1487
1488         fs_prio = kzalloc(sizeof(*fs_prio), GFP_KERNEL);
1489         if (!fs_prio)
1490                 return ERR_PTR(-ENOMEM);
1491
1492         fs_prio->node.type = FS_TYPE_PRIO;
1493         tree_init_node(&fs_prio->node, 1, NULL);
1494         tree_add_node(&fs_prio->node, &ns->node);
1495         fs_prio->num_levels = num_levels;
1496         fs_prio->prio = prio;
1497         list_add_tail(&fs_prio->node.list, &ns->node.children);
1498
1499         return fs_prio;
1500 }
1501
1502 static struct mlx5_flow_namespace *fs_init_namespace(struct mlx5_flow_namespace
1503                                                      *ns)
1504 {
1505         ns->node.type = FS_TYPE_NAMESPACE;
1506
1507         return ns;
1508 }
1509
1510 static struct mlx5_flow_namespace *fs_create_namespace(struct fs_prio *prio)
1511 {
1512         struct mlx5_flow_namespace      *ns;
1513
1514         ns = kzalloc(sizeof(*ns), GFP_KERNEL);
1515         if (!ns)
1516                 return ERR_PTR(-ENOMEM);
1517
1518         fs_init_namespace(ns);
1519         tree_init_node(&ns->node, 1, NULL);
1520         tree_add_node(&ns->node, &prio->node);
1521         list_add_tail(&ns->node.list, &prio->node.children);
1522
1523         return ns;
1524 }
1525
1526 static int create_leaf_prios(struct mlx5_flow_namespace *ns, int prio,
1527                              struct init_tree_node *prio_metadata)
1528 {
1529         struct fs_prio *fs_prio;
1530         int i;
1531
1532         for (i = 0; i < prio_metadata->num_leaf_prios; i++) {
1533                 fs_prio = fs_create_prio(ns, prio++, prio_metadata->num_levels);
1534                 if (IS_ERR(fs_prio))
1535                         return PTR_ERR(fs_prio);
1536         }
1537         return 0;
1538 }
1539
1540 #define FLOW_TABLE_BIT_SZ 1
1541 #define GET_FLOW_TABLE_CAP(dev, offset) \
1542         ((be32_to_cpu(*((__be32 *)(dev->hca_caps_cur[MLX5_CAP_FLOW_TABLE]) +    \
1543                         offset / 32)) >>                                        \
1544           (32 - FLOW_TABLE_BIT_SZ - (offset & 0x1f))) & FLOW_TABLE_BIT_SZ)
1545 static bool has_required_caps(struct mlx5_core_dev *dev, struct node_caps *caps)
1546 {
1547         int i;
1548
1549         for (i = 0; i < caps->arr_sz; i++) {
1550                 if (!GET_FLOW_TABLE_CAP(dev, caps->caps[i]))
1551                         return false;
1552         }
1553         return true;
1554 }
1555
1556 static int init_root_tree_recursive(struct mlx5_flow_steering *steering,
1557                                     struct init_tree_node *init_node,
1558                                     struct fs_node *fs_parent_node,
1559                                     struct init_tree_node *init_parent_node,
1560                                     int prio)
1561 {
1562         int max_ft_level = MLX5_CAP_FLOWTABLE(steering->dev,
1563                                               flow_table_properties_nic_receive.
1564                                               max_ft_level);
1565         struct mlx5_flow_namespace *fs_ns;
1566         struct fs_prio *fs_prio;
1567         struct fs_node *base;
1568         int i;
1569         int err;
1570
1571         if (init_node->type == FS_TYPE_PRIO) {
1572                 if ((init_node->min_ft_level > max_ft_level) ||
1573                     !has_required_caps(steering->dev, &init_node->caps))
1574                         return 0;
1575
1576                 fs_get_obj(fs_ns, fs_parent_node);
1577                 if (init_node->num_leaf_prios)
1578                         return create_leaf_prios(fs_ns, prio, init_node);
1579                 fs_prio = fs_create_prio(fs_ns, prio, init_node->num_levels);
1580                 if (IS_ERR(fs_prio))
1581                         return PTR_ERR(fs_prio);
1582                 base = &fs_prio->node;
1583         } else if (init_node->type == FS_TYPE_NAMESPACE) {
1584                 fs_get_obj(fs_prio, fs_parent_node);
1585                 fs_ns = fs_create_namespace(fs_prio);
1586                 if (IS_ERR(fs_ns))
1587                         return PTR_ERR(fs_ns);
1588                 base = &fs_ns->node;
1589         } else {
1590                 return -EINVAL;
1591         }
1592         prio = 0;
1593         for (i = 0; i < init_node->ar_size; i++) {
1594                 err = init_root_tree_recursive(steering, &init_node->children[i],
1595                                                base, init_node, prio);
1596                 if (err)
1597                         return err;
1598                 if (init_node->children[i].type == FS_TYPE_PRIO &&
1599                     init_node->children[i].num_leaf_prios) {
1600                         prio += init_node->children[i].num_leaf_prios;
1601                 }
1602         }
1603
1604         return 0;
1605 }
1606
1607 static int init_root_tree(struct mlx5_flow_steering *steering,
1608                           struct init_tree_node *init_node,
1609                           struct fs_node *fs_parent_node)
1610 {
1611         int i;
1612         struct mlx5_flow_namespace *fs_ns;
1613         int err;
1614
1615         fs_get_obj(fs_ns, fs_parent_node);
1616         for (i = 0; i < init_node->ar_size; i++) {
1617                 err = init_root_tree_recursive(steering, &init_node->children[i],
1618                                                &fs_ns->node,
1619                                                init_node, i);
1620                 if (err)
1621                         return err;
1622         }
1623         return 0;
1624 }
1625
1626 static struct mlx5_flow_root_namespace *create_root_ns(struct mlx5_flow_steering *steering,
1627                                                        enum fs_flow_table_type
1628                                                        table_type)
1629 {
1630         struct mlx5_flow_root_namespace *root_ns;
1631         struct mlx5_flow_namespace *ns;
1632
1633         /* Create the root namespace */
1634         root_ns = mlx5_vzalloc(sizeof(*root_ns));
1635         if (!root_ns)
1636                 return NULL;
1637
1638         root_ns->dev = steering->dev;
1639         root_ns->table_type = table_type;
1640
1641         ns = &root_ns->ns;
1642         fs_init_namespace(ns);
1643         mutex_init(&root_ns->chain_lock);
1644         tree_init_node(&ns->node, 1, NULL);
1645         tree_add_node(&ns->node, NULL);
1646
1647         return root_ns;
1648 }
1649
1650 static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level);
1651
1652 static int set_prio_attrs_in_ns(struct mlx5_flow_namespace *ns, int acc_level)
1653 {
1654         struct fs_prio *prio;
1655
1656         fs_for_each_prio(prio, ns) {
1657                  /* This updates prio start_level and num_levels */
1658                 set_prio_attrs_in_prio(prio, acc_level);
1659                 acc_level += prio->num_levels;
1660         }
1661         return acc_level;
1662 }
1663
1664 static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level)
1665 {
1666         struct mlx5_flow_namespace *ns;
1667         int acc_level_ns = acc_level;
1668
1669         prio->start_level = acc_level;
1670         fs_for_each_ns(ns, prio)
1671                 /* This updates start_level and num_levels of ns's priority descendants */
1672                 acc_level_ns = set_prio_attrs_in_ns(ns, acc_level);
1673         if (!prio->num_levels)
1674                 prio->num_levels = acc_level_ns - prio->start_level;
1675         WARN_ON(prio->num_levels < acc_level_ns - prio->start_level);
1676 }
1677
1678 static void set_prio_attrs(struct mlx5_flow_root_namespace *root_ns)
1679 {
1680         struct mlx5_flow_namespace *ns = &root_ns->ns;
1681         struct fs_prio *prio;
1682         int start_level = 0;
1683
1684         fs_for_each_prio(prio, ns) {
1685                 set_prio_attrs_in_prio(prio, start_level);
1686                 start_level += prio->num_levels;
1687         }
1688 }
1689
1690 #define ANCHOR_PRIO 0
1691 #define ANCHOR_SIZE 1
1692 #define ANCHOR_LEVEL 0
1693 static int create_anchor_flow_table(struct mlx5_flow_steering *steering)
1694 {
1695         struct mlx5_flow_namespace *ns = NULL;
1696         struct mlx5_flow_table *ft;
1697
1698         ns = mlx5_get_flow_namespace(steering->dev, MLX5_FLOW_NAMESPACE_ANCHOR);
1699         if (!ns)
1700                 return -EINVAL;
1701         ft = mlx5_create_flow_table(ns, ANCHOR_PRIO, ANCHOR_SIZE, ANCHOR_LEVEL);
1702         if (IS_ERR(ft)) {
1703                 mlx5_core_err(steering->dev, "Failed to create last anchor flow table");
1704                 return PTR_ERR(ft);
1705         }
1706         return 0;
1707 }
1708
1709 static int init_root_ns(struct mlx5_flow_steering *steering)
1710 {
1711
1712         steering->root_ns = create_root_ns(steering, FS_FT_NIC_RX);
1713         if (IS_ERR_OR_NULL(steering->root_ns))
1714                 goto cleanup;
1715
1716         if (init_root_tree(steering, &root_fs, &steering->root_ns->ns.node))
1717                 goto cleanup;
1718
1719         set_prio_attrs(steering->root_ns);
1720
1721         if (create_anchor_flow_table(steering))
1722                 goto cleanup;
1723
1724         return 0;
1725
1726 cleanup:
1727         mlx5_cleanup_fs(steering->dev);
1728         return -ENOMEM;
1729 }
1730
1731 static void clean_tree(struct fs_node *node)
1732 {
1733         if (node) {
1734                 struct fs_node *iter;
1735                 struct fs_node *temp;
1736
1737                 list_for_each_entry_safe(iter, temp, &node->children, list)
1738                         clean_tree(iter);
1739                 tree_remove_node(node);
1740         }
1741 }
1742
1743 static void cleanup_root_ns(struct mlx5_flow_root_namespace *root_ns)
1744 {
1745         if (!root_ns)
1746                 return;
1747
1748         clean_tree(&root_ns->ns.node);
1749 }
1750
1751 void mlx5_cleanup_fs(struct mlx5_core_dev *dev)
1752 {
1753         struct mlx5_flow_steering *steering = dev->priv.steering;
1754
1755         if (MLX5_CAP_GEN(dev, port_type) != MLX5_CAP_PORT_TYPE_ETH)
1756                 return;
1757
1758         cleanup_root_ns(steering->root_ns);
1759         cleanup_root_ns(steering->esw_egress_root_ns);
1760         cleanup_root_ns(steering->esw_ingress_root_ns);
1761         cleanup_root_ns(steering->fdb_root_ns);
1762         cleanup_root_ns(steering->sniffer_rx_root_ns);
1763         cleanup_root_ns(steering->sniffer_tx_root_ns);
1764         mlx5_cleanup_fc_stats(dev);
1765         kfree(steering);
1766 }
1767
1768 static int init_sniffer_tx_root_ns(struct mlx5_flow_steering *steering)
1769 {
1770         struct fs_prio *prio;
1771
1772         steering->sniffer_tx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_TX);
1773         if (!steering->sniffer_tx_root_ns)
1774                 return -ENOMEM;
1775
1776         /* Create single prio */
1777         prio = fs_create_prio(&steering->sniffer_tx_root_ns->ns, 0, 1);
1778         if (IS_ERR(prio)) {
1779                 cleanup_root_ns(steering->sniffer_tx_root_ns);
1780                 return PTR_ERR(prio);
1781         }
1782         return 0;
1783 }
1784
1785 static int init_sniffer_rx_root_ns(struct mlx5_flow_steering *steering)
1786 {
1787         struct fs_prio *prio;
1788
1789         steering->sniffer_rx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_RX);
1790         if (!steering->sniffer_rx_root_ns)
1791                 return -ENOMEM;
1792
1793         /* Create single prio */
1794         prio = fs_create_prio(&steering->sniffer_rx_root_ns->ns, 0, 1);
1795         if (IS_ERR(prio)) {
1796                 cleanup_root_ns(steering->sniffer_rx_root_ns);
1797                 return PTR_ERR(prio);
1798         }
1799         return 0;
1800 }
1801
1802 static int init_fdb_root_ns(struct mlx5_flow_steering *steering)
1803 {
1804         struct fs_prio *prio;
1805
1806         steering->fdb_root_ns = create_root_ns(steering, FS_FT_FDB);
1807         if (!steering->fdb_root_ns)
1808                 return -ENOMEM;
1809
1810         prio = fs_create_prio(&steering->fdb_root_ns->ns, 0, 1);
1811         if (IS_ERR(prio))
1812                 goto out_err;
1813
1814         prio = fs_create_prio(&steering->fdb_root_ns->ns, 1, 1);
1815         if (IS_ERR(prio))
1816                 goto out_err;
1817
1818         set_prio_attrs(steering->fdb_root_ns);
1819         return 0;
1820
1821 out_err:
1822         cleanup_root_ns(steering->fdb_root_ns);
1823         steering->fdb_root_ns = NULL;
1824         return PTR_ERR(prio);
1825 }
1826
1827 static int init_ingress_acl_root_ns(struct mlx5_flow_steering *steering)
1828 {
1829         struct fs_prio *prio;
1830
1831         steering->esw_egress_root_ns = create_root_ns(steering, FS_FT_ESW_EGRESS_ACL);
1832         if (!steering->esw_egress_root_ns)
1833                 return -ENOMEM;
1834
1835         /* create 1 prio*/
1836         prio = fs_create_prio(&steering->esw_egress_root_ns->ns, 0,
1837                               MLX5_TOTAL_VPORTS(steering->dev));
1838         return PTR_ERR_OR_ZERO(prio);
1839 }
1840
1841 static int init_egress_acl_root_ns(struct mlx5_flow_steering *steering)
1842 {
1843         struct fs_prio *prio;
1844
1845         steering->esw_ingress_root_ns = create_root_ns(steering, FS_FT_ESW_INGRESS_ACL);
1846         if (!steering->esw_ingress_root_ns)
1847                 return -ENOMEM;
1848
1849         /* create 1 prio*/
1850         prio = fs_create_prio(&steering->esw_ingress_root_ns->ns, 0,
1851                               MLX5_TOTAL_VPORTS(steering->dev));
1852         return PTR_ERR_OR_ZERO(prio);
1853 }
1854
1855 int mlx5_init_fs(struct mlx5_core_dev *dev)
1856 {
1857         struct mlx5_flow_steering *steering;
1858         int err = 0;
1859
1860         if (MLX5_CAP_GEN(dev, port_type) != MLX5_CAP_PORT_TYPE_ETH)
1861                 return 0;
1862
1863         err = mlx5_init_fc_stats(dev);
1864         if (err)
1865                 return err;
1866
1867         steering = kzalloc(sizeof(*steering), GFP_KERNEL);
1868         if (!steering)
1869                 return -ENOMEM;
1870         steering->dev = dev;
1871         dev->priv.steering = steering;
1872
1873         if (MLX5_CAP_GEN(dev, nic_flow_table) &&
1874             MLX5_CAP_FLOWTABLE_NIC_RX(dev, ft_support)) {
1875                 err = init_root_ns(steering);
1876                 if (err)
1877                         goto err;
1878         }
1879
1880         if (MLX5_CAP_GEN(dev, eswitch_flow_table)) {
1881                 if (MLX5_CAP_ESW_FLOWTABLE_FDB(dev, ft_support)) {
1882                         err = init_fdb_root_ns(steering);
1883                         if (err)
1884                                 goto err;
1885                 }
1886                 if (MLX5_CAP_ESW_EGRESS_ACL(dev, ft_support)) {
1887                         err = init_egress_acl_root_ns(steering);
1888                         if (err)
1889                                 goto err;
1890                 }
1891                 if (MLX5_CAP_ESW_INGRESS_ACL(dev, ft_support)) {
1892                         err = init_ingress_acl_root_ns(steering);
1893                         if (err)
1894                                 goto err;
1895                 }
1896         }
1897
1898         if (MLX5_CAP_FLOWTABLE_SNIFFER_RX(dev, ft_support)) {
1899                 err = init_sniffer_rx_root_ns(steering);
1900                 if (err)
1901                         goto err;
1902         }
1903
1904         if (MLX5_CAP_FLOWTABLE_SNIFFER_TX(dev, ft_support)) {
1905                 err = init_sniffer_tx_root_ns(steering);
1906                 if (err)
1907                         goto err;
1908         }
1909
1910         return 0;
1911 err:
1912         mlx5_cleanup_fs(dev);
1913         return err;
1914 }