/*
 * Copyright (c) 2015, Mellanox Technologies. All rights reserved.
 *
 * This software is available to you under a choice of one of two
 * licenses.  You may choose to be licensed under the terms of the GNU
 * General Public License (GPL) Version 2, available from the file
 * COPYING in the main directory of this source tree, or the
 * OpenIB.org BSD license below:
 *
 *     Redistribution and use in source and binary forms, with or
 *     without modification, are permitted provided that the following
 *     conditions are met:
 *
 *      - Redistributions of source code must retain the above
 *        copyright notice, this list of conditions and the following
 *        disclaimer.
 *
 *      - Redistributions in binary form must reproduce the above
 *        copyright notice, this list of conditions and the following
 *        disclaimer in the documentation and/or other materials
 *        provided with the distribution.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#include <linux/mutex.h>
#include <linux/mlx5/driver.h>

#include "mlx5_core.h"
#include "fs_core.h"
#include "fs_cmd.h"
#include "diag/fs_tracepoint.h"

#define INIT_TREE_NODE_ARRAY_SIZE(...)  (sizeof((struct init_tree_node[]){__VA_ARGS__}) /\
                                         sizeof(struct init_tree_node))

#define ADD_PRIO(num_prios_val, min_level_val, num_levels_val, caps_val,\
                 ...) {.type = FS_TYPE_PRIO,\
        .min_ft_level = min_level_val,\
        .num_levels = num_levels_val,\
        .num_leaf_prios = num_prios_val,\
        .caps = caps_val,\
        .children = (struct init_tree_node[]) {__VA_ARGS__},\
        .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
}

#define ADD_MULTIPLE_PRIO(num_prios_val, num_levels_val, ...)\
        ADD_PRIO(num_prios_val, 0, num_levels_val, {},\
                 __VA_ARGS__)\

#define ADD_NS(...) {.type = FS_TYPE_NAMESPACE,\
        .children = (struct init_tree_node[]) {__VA_ARGS__},\
        .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
}

#define INIT_CAPS_ARRAY_SIZE(...) (sizeof((long[]){__VA_ARGS__}) /\
                                   sizeof(long))

#define FS_CAP(cap) (__mlx5_bit_off(flow_table_nic_cap, cap))

#define FS_REQUIRED_CAPS(...) {.arr_sz = INIT_CAPS_ARRAY_SIZE(__VA_ARGS__), \
                               .caps = (long[]) {__VA_ARGS__} }

#define FS_CHAINING_CAPS  FS_REQUIRED_CAPS(FS_CAP(flow_table_properties_nic_receive.flow_modify_en), \
                                           FS_CAP(flow_table_properties_nic_receive.modify_root), \
                                           FS_CAP(flow_table_properties_nic_receive.identified_miss_table_mode), \
                                           FS_CAP(flow_table_properties_nic_receive.flow_table_modify))

#define LEFTOVERS_NUM_LEVELS 1
#define LEFTOVERS_NUM_PRIOS 1

#define BY_PASS_PRIO_NUM_LEVELS 1
#define BY_PASS_MIN_LEVEL (ETHTOOL_MIN_LEVEL + MLX5_BY_PASS_NUM_PRIOS +\
                           LEFTOVERS_NUM_PRIOS)

#define ETHTOOL_PRIO_NUM_LEVELS 1
#define ETHTOOL_NUM_PRIOS 11
#define ETHTOOL_MIN_LEVEL (KERNEL_MIN_LEVEL + ETHTOOL_NUM_PRIOS)
/* Vlan, mac, ttc, inner ttc, aRFS */
#define KERNEL_NIC_PRIO_NUM_LEVELS 5
#define KERNEL_NIC_NUM_PRIOS 1
/* One more level for tc */
#define KERNEL_MIN_LEVEL (KERNEL_NIC_PRIO_NUM_LEVELS + 1)

#define ANCHOR_NUM_LEVELS 1
#define ANCHOR_NUM_PRIOS 1
#define ANCHOR_MIN_LEVEL (BY_PASS_MIN_LEVEL + 1)

#define OFFLOADS_MAX_FT 1
#define OFFLOADS_NUM_PRIOS 1
#define OFFLOADS_MIN_LEVEL (ANCHOR_MIN_LEVEL + 1)

#define LAG_PRIO_NUM_LEVELS 1
#define LAG_NUM_PRIOS 1
#define LAG_MIN_LEVEL (OFFLOADS_MIN_LEVEL + 1)

struct node_caps {
        size_t  arr_sz;
        long    *caps;
};

static struct init_tree_node {
        enum fs_node_type       type;
        struct init_tree_node *children;
        int ar_size;
        struct node_caps caps;
        int min_ft_level;
        int num_leaf_prios;
        int prio;
        int num_levels;
} root_fs = {
        .type = FS_TYPE_NAMESPACE,
        .ar_size = 7,
        .children = (struct init_tree_node[]) {
                ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0,
                         FS_CHAINING_CAPS,
                         ADD_NS(ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_PRIOS,
                                                  BY_PASS_PRIO_NUM_LEVELS))),
                ADD_PRIO(0, LAG_MIN_LEVEL, 0,
                         FS_CHAINING_CAPS,
                         ADD_NS(ADD_MULTIPLE_PRIO(LAG_NUM_PRIOS,
                                                  LAG_PRIO_NUM_LEVELS))),
                ADD_PRIO(0, OFFLOADS_MIN_LEVEL, 0, {},
                         ADD_NS(ADD_MULTIPLE_PRIO(OFFLOADS_NUM_PRIOS, OFFLOADS_MAX_FT))),
                ADD_PRIO(0, ETHTOOL_MIN_LEVEL, 0,
                         FS_CHAINING_CAPS,
                         ADD_NS(ADD_MULTIPLE_PRIO(ETHTOOL_NUM_PRIOS,
                                                  ETHTOOL_PRIO_NUM_LEVELS))),
                ADD_PRIO(0, KERNEL_MIN_LEVEL, 0, {},
                         ADD_NS(ADD_MULTIPLE_PRIO(1, 1),
                                ADD_MULTIPLE_PRIO(KERNEL_NIC_NUM_PRIOS,
                                                  KERNEL_NIC_PRIO_NUM_LEVELS))),
                ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0,
                         FS_CHAINING_CAPS,
                         ADD_NS(ADD_MULTIPLE_PRIO(LEFTOVERS_NUM_PRIOS, LEFTOVERS_NUM_LEVELS))),
                ADD_PRIO(0, ANCHOR_MIN_LEVEL, 0, {},
                         ADD_NS(ADD_MULTIPLE_PRIO(ANCHOR_NUM_PRIOS, ANCHOR_NUM_LEVELS))),
        }
};

enum fs_i_mutex_lock_class {
        FS_MUTEX_GRANDPARENT,
        FS_MUTEX_PARENT,
        FS_MUTEX_CHILD
};

static const struct rhashtable_params rhash_fte = {
        .key_len = FIELD_SIZEOF(struct fs_fte, val),
        .key_offset = offsetof(struct fs_fte, val),
        .head_offset = offsetof(struct fs_fte, hash),
        .automatic_shrinking = true,
        .min_size = 1,
};

static const struct rhashtable_params rhash_fg = {
        .key_len = FIELD_SIZEOF(struct mlx5_flow_group, mask),
        .key_offset = offsetof(struct mlx5_flow_group, mask),
        .head_offset = offsetof(struct mlx5_flow_group, hash),
        .automatic_shrinking = true,
        .min_size = 1,

};

static void del_rule(struct fs_node *node);
static void del_flow_table(struct fs_node *node);
static void del_flow_group(struct fs_node *node);
static void del_fte(struct fs_node *node);
static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
                                struct mlx5_flow_destination *d2);
static struct mlx5_flow_rule *
find_flow_rule(struct fs_fte *fte,
               struct mlx5_flow_destination *dest);

static void tree_init_node(struct fs_node *node,
                           unsigned int refcount,
                           void (*remove_func)(struct fs_node *))
{
        atomic_set(&node->refcount, refcount);
        INIT_LIST_HEAD(&node->list);
        INIT_LIST_HEAD(&node->children);
        mutex_init(&node->lock);
        node->remove_func = remove_func;
}

static void tree_add_node(struct fs_node *node, struct fs_node *parent)
{
        if (parent)
                atomic_inc(&parent->refcount);
        node->parent = parent;

        /* Parent is the root */
        if (!parent)
                node->root = node;
        else
                node->root = parent->root;
}

static void tree_get_node(struct fs_node *node)
{
        atomic_inc(&node->refcount);
}

static void nested_lock_ref_node(struct fs_node *node,
                                 enum fs_i_mutex_lock_class class)
{
        if (node) {
                mutex_lock_nested(&node->lock, class);
                atomic_inc(&node->refcount);
        }
}

static void lock_ref_node(struct fs_node *node)
{
        if (node) {
                mutex_lock(&node->lock);
                atomic_inc(&node->refcount);
        }
}

static void unlock_ref_node(struct fs_node *node)
{
        if (node) {
                atomic_dec(&node->refcount);
                mutex_unlock(&node->lock);
        }
}

static void tree_put_node(struct fs_node *node)
{
        struct fs_node *parent_node = node->parent;

        lock_ref_node(parent_node);
        if (atomic_dec_and_test(&node->refcount)) {
                if (parent_node)
                        list_del_init(&node->list);
                if (node->remove_func)
                        node->remove_func(node);
                kfree(node);
                node = NULL;
        }
        unlock_ref_node(parent_node);
        if (!node && parent_node)
                tree_put_node(parent_node);
}

static int tree_remove_node(struct fs_node *node)
{
        if (atomic_read(&node->refcount) > 1) {
                atomic_dec(&node->refcount);
                return -EEXIST;
        }
        tree_put_node(node);
        return 0;
}

static struct fs_prio *find_prio(struct mlx5_flow_namespace *ns,
                                 unsigned int prio)
{
        struct fs_prio *iter_prio;

        fs_for_each_prio(iter_prio, ns) {
                if (iter_prio->prio == prio)
                        return iter_prio;
        }

        return NULL;
}

static bool check_last_reserved(const u32 *match_criteria)
{
        char *match_criteria_reserved =
                MLX5_ADDR_OF(fte_match_param, match_criteria, MLX5_FTE_MATCH_PARAM_RESERVED);

        return  !match_criteria_reserved[0] &&
                !memcmp(match_criteria_reserved, match_criteria_reserved + 1,
                        MLX5_FLD_SZ_BYTES(fte_match_param,
                                          MLX5_FTE_MATCH_PARAM_RESERVED) - 1);
}

static bool check_valid_mask(u8 match_criteria_enable, const u32 *match_criteria)
{
        if (match_criteria_enable & ~(
                (1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_OUTER_HEADERS)   |
                (1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_MISC_PARAMETERS) |
                (1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_INNER_HEADERS)))
                return false;

        if (!(match_criteria_enable &
              1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_OUTER_HEADERS)) {
                char *fg_type_mask = MLX5_ADDR_OF(fte_match_param,
                                                  match_criteria, outer_headers);

                if (fg_type_mask[0] ||
                    memcmp(fg_type_mask, fg_type_mask + 1,
                           MLX5_ST_SZ_BYTES(fte_match_set_lyr_2_4) - 1))
                        return false;
        }

        if (!(match_criteria_enable &
              1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_MISC_PARAMETERS)) {
                char *fg_type_mask = MLX5_ADDR_OF(fte_match_param,
                                                  match_criteria, misc_parameters);

                if (fg_type_mask[0] ||
                    memcmp(fg_type_mask, fg_type_mask + 1,
                           MLX5_ST_SZ_BYTES(fte_match_set_misc) - 1))
                        return false;
        }

        if (!(match_criteria_enable &
              1 << MLX5_CREATE_FLOW_GROUP_IN_MATCH_CRITERIA_ENABLE_INNER_HEADERS)) {
                char *fg_type_mask = MLX5_ADDR_OF(fte_match_param,
                                                  match_criteria, inner_headers);

                if (fg_type_mask[0] ||
                    memcmp(fg_type_mask, fg_type_mask + 1,
                           MLX5_ST_SZ_BYTES(fte_match_set_lyr_2_4) - 1))
                        return false;
        }

        return check_last_reserved(match_criteria);
}

static bool check_valid_spec(const struct mlx5_flow_spec *spec)
{
        int i;

        if (!check_valid_mask(spec->match_criteria_enable, spec->match_criteria)) {
                pr_warn("mlx5_core: Match criteria given mismatches match_criteria_enable\n");
                return false;
        }

        for (i = 0; i < MLX5_ST_SZ_DW_MATCH_PARAM; i++)
                if (spec->match_value[i] & ~spec->match_criteria[i]) {
                        pr_warn("mlx5_core: match_value differs from match_criteria\n");
                        return false;
                }

        return check_last_reserved(spec->match_value);
}

static struct mlx5_flow_root_namespace *find_root(struct fs_node *node)
{
        struct fs_node *root;
        struct mlx5_flow_namespace *ns;

        root = node->root;

        if (WARN_ON(root->type != FS_TYPE_NAMESPACE)) {
                pr_warn("mlx5: flow steering node is not in tree or garbaged\n");
                return NULL;
        }

        ns = container_of(root, struct mlx5_flow_namespace, node);
        return container_of(ns, struct mlx5_flow_root_namespace, ns);
}

static inline struct mlx5_core_dev *get_dev(struct fs_node *node)
{
        struct mlx5_flow_root_namespace *root = find_root(node);

        if (root)
                return root->dev;
        return NULL;
}

static void del_flow_table(struct fs_node *node)
{
        struct mlx5_flow_table *ft;
        struct mlx5_core_dev *dev;
        struct fs_prio *prio;
        int err;

        fs_get_obj(ft, node);
        dev = get_dev(&ft->node);

        err = mlx5_cmd_destroy_flow_table(dev, ft);
        if (err)
                mlx5_core_warn(dev, "flow steering can't destroy ft\n");
        ida_destroy(&ft->fte_allocator);
        rhltable_destroy(&ft->fgs_hash);
        fs_get_obj(prio, ft->node.parent);
        prio->num_ft--;
}

static void del_rule(struct fs_node *node)
{
        struct mlx5_flow_rule *rule;
        struct mlx5_flow_table *ft;
        struct mlx5_flow_group *fg;
        struct fs_fte *fte;
        int modify_mask;
        struct mlx5_core_dev *dev = get_dev(node);
        int err;
        bool update_fte = false;

        fs_get_obj(rule, node);
        fs_get_obj(fte, rule->node.parent);
        fs_get_obj(fg, fte->node.parent);
        fs_get_obj(ft, fg->node.parent);
        trace_mlx5_fs_del_rule(rule);
        list_del(&rule->node.list);
        if (rule->sw_action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
                mutex_lock(&rule->dest_attr.ft->lock);
                list_del(&rule->next_ft);
                mutex_unlock(&rule->dest_attr.ft->lock);
        }

        if (rule->dest_attr.type == MLX5_FLOW_DESTINATION_TYPE_COUNTER  &&
            --fte->dests_size) {
                modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION);
                fte->action &= ~MLX5_FLOW_CONTEXT_ACTION_COUNT;
                update_fte = true;
                goto out;
        }

        if ((fte->action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST) &&
            --fte->dests_size) {
                modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST),
                update_fte = true;
        }
out:
        if (update_fte && fte->dests_size) {
                err = mlx5_cmd_update_fte(dev, ft, fg->id, modify_mask, fte);
                if (err)
                        mlx5_core_warn(dev,
                                       "%s can't del rule fg id=%d fte_index=%d\n",
                                       __func__, fg->id, fte->index);
        }
}

static void destroy_fte(struct fs_fte *fte, struct mlx5_flow_group *fg)
{
        struct mlx5_flow_table *ft;
        int ret;

        ret = rhashtable_remove_fast(&fg->ftes_hash, &fte->hash, rhash_fte);
        WARN_ON(ret);
        fte->status = 0;
        fs_get_obj(ft, fg->node.parent);
        ida_simple_remove(&ft->fte_allocator, fte->index);
}

static void del_fte(struct fs_node *node)
{
        struct mlx5_flow_table *ft;
        struct mlx5_flow_group *fg;
        struct mlx5_core_dev *dev;
        struct fs_fte *fte;
        int err;

        fs_get_obj(fte, node);
        fs_get_obj(fg, fte->node.parent);
        fs_get_obj(ft, fg->node.parent);
        trace_mlx5_fs_del_fte(fte);

        dev = get_dev(&ft->node);
        err = mlx5_cmd_delete_fte(dev, ft,
                                  fte->index);
        if (err)
                mlx5_core_warn(dev,
                               "flow steering can't delete fte in index %d of flow group id %d\n",
                               fte->index, fg->id);

        destroy_fte(fte, fg);
}

static void del_flow_group(struct fs_node *node)
{
        struct mlx5_flow_group *fg;
        struct mlx5_flow_table *ft;
        struct mlx5_core_dev *dev;
        int err;

        fs_get_obj(fg, node);
        fs_get_obj(ft, fg->node.parent);
        dev = get_dev(&ft->node);
        trace_mlx5_fs_del_fg(fg);

        if (ft->autogroup.active)
                ft->autogroup.num_groups--;

        rhashtable_destroy(&fg->ftes_hash);
        err = rhltable_remove(&ft->fgs_hash,
                              &fg->hash,
                              rhash_fg);
        WARN_ON(err);
        if (mlx5_cmd_destroy_flow_group(dev, ft, fg->id))
                mlx5_core_warn(dev, "flow steering can't destroy fg %d of ft %d\n",
                               fg->id, ft->id);
}

static struct fs_fte *alloc_fte(struct mlx5_flow_act *flow_act,
                                u32 *match_value,
                                unsigned int index)
{
        struct fs_fte *fte;

        fte = kzalloc(sizeof(*fte), GFP_KERNEL);
        if (!fte)
                return ERR_PTR(-ENOMEM);

        memcpy(fte->val, match_value, sizeof(fte->val));
        fte->node.type =  FS_TYPE_FLOW_ENTRY;
        fte->flow_tag = flow_act->flow_tag;
        fte->index = index;
        fte->action = flow_act->action;
        fte->encap_id = flow_act->encap_id;
        fte->modify_id = flow_act->modify_id;

        return fte;
}

static struct mlx5_flow_group *alloc_flow_group(u32 *create_fg_in)
{
        struct mlx5_flow_group *fg;
        void *match_criteria = MLX5_ADDR_OF(create_flow_group_in,
                                            create_fg_in, match_criteria);
        u8 match_criteria_enable = MLX5_GET(create_flow_group_in,
                                            create_fg_in,
                                            match_criteria_enable);
        int ret;

        fg = kzalloc(sizeof(*fg), GFP_KERNEL);
        if (!fg)
                return ERR_PTR(-ENOMEM);

        ret = rhashtable_init(&fg->ftes_hash, &rhash_fte);
        if (ret) {
                kfree(fg);
                return ERR_PTR(ret);
        }
        fg->mask.match_criteria_enable = match_criteria_enable;
        memcpy(&fg->mask.match_criteria, match_criteria,
               sizeof(fg->mask.match_criteria));
        fg->node.type =  FS_TYPE_FLOW_GROUP;
        fg->start_index = MLX5_GET(create_flow_group_in, create_fg_in,
                                   start_flow_index);
        fg->max_ftes = MLX5_GET(create_flow_group_in, create_fg_in,
                                end_flow_index) - fg->start_index + 1;
        return fg;
}

static struct mlx5_flow_table *alloc_flow_table(int level, u16 vport, int max_fte,
                                                enum fs_flow_table_type table_type,
                                                enum fs_flow_table_op_mod op_mod,
                                                u32 flags)
{
        struct mlx5_flow_table *ft;
        int ret;

        ft  = kzalloc(sizeof(*ft), GFP_KERNEL);
        if (!ft)
                return ERR_PTR(-ENOMEM);

        ret = rhltable_init(&ft->fgs_hash, &rhash_fg);
        if (ret) {
                kfree(ft);
                return ERR_PTR(ret);
        }

        ft->level = level;
        ft->node.type = FS_TYPE_FLOW_TABLE;
        ft->op_mod = op_mod;
        ft->type = table_type;
        ft->vport = vport;
        ft->max_fte = max_fte;
        ft->flags = flags;
        INIT_LIST_HEAD(&ft->fwd_rules);
        mutex_init(&ft->lock);
        ida_init(&ft->fte_allocator);

        return ft;
}

/* If reverse is false, then we search for the first flow table in the
 * root sub-tree from start(closest from right), else we search for the
 * last flow table in the root sub-tree till start(closest from left).
 */
static struct mlx5_flow_table *find_closest_ft_recursive(struct fs_node  *root,
                                                         struct list_head *start,
                                                         bool reverse)
{
#define list_advance_entry(pos, reverse)                \
        ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))

#define list_for_each_advance_continue(pos, head, reverse)      \
        for (pos = list_advance_entry(pos, reverse);            \
             &pos->list != (head);                              \
             pos = list_advance_entry(pos, reverse))

        struct fs_node *iter = list_entry(start, struct fs_node, list);
        struct mlx5_flow_table *ft = NULL;

        if (!root)
                return NULL;

        list_for_each_advance_continue(iter, &root->children, reverse) {
                if (iter->type == FS_TYPE_FLOW_TABLE) {
                        fs_get_obj(ft, iter);
                        return ft;
                }
                ft = find_closest_ft_recursive(iter, &iter->children, reverse);
                if (ft)
                        return ft;
        }

        return ft;
}

/* If reverse if false then return the first flow table in next priority of
 * prio in the tree, else return the last flow table in the previous priority
 * of prio in the tree.
 */
static struct mlx5_flow_table *find_closest_ft(struct fs_prio *prio, bool reverse)
{
        struct mlx5_flow_table *ft = NULL;
        struct fs_node *curr_node;
        struct fs_node *parent;

        parent = prio->node.parent;
        curr_node = &prio->node;
        while (!ft && parent) {
                ft = find_closest_ft_recursive(parent, &curr_node->list, reverse);
                curr_node = parent;
                parent = curr_node->parent;
        }
        return ft;
}

/* Assuming all the tree is locked by mutex chain lock */
static struct mlx5_flow_table *find_next_chained_ft(struct fs_prio *prio)
{
        return find_closest_ft(prio, false);
}

/* Assuming all the tree is locked by mutex chain lock */
static struct mlx5_flow_table *find_prev_chained_ft(struct fs_prio *prio)
{
        return find_closest_ft(prio, true);
}

static int connect_fts_in_prio(struct mlx5_core_dev *dev,
                               struct fs_prio *prio,
                               struct mlx5_flow_table *ft)
{
        struct mlx5_flow_table *iter;
        int i = 0;
        int err;

        fs_for_each_ft(iter, prio) {
                i++;
                err = mlx5_cmd_modify_flow_table(dev,
                                                 iter,
                                                 ft);
                if (err) {
                        mlx5_core_warn(dev, "Failed to modify flow table %d\n",
                                       iter->id);
                        /* The driver is out of sync with the FW */
                        if (i > 1)
                                WARN_ON(true);
                        return err;
                }
        }
        return 0;
}

/* Connect flow tables from previous priority of prio to ft */
static int connect_prev_fts(struct mlx5_core_dev *dev,
                            struct mlx5_flow_table *ft,
                            struct fs_prio *prio)
{
        struct mlx5_flow_table *prev_ft;

        prev_ft = find_prev_chained_ft(prio);
        if (prev_ft) {
                struct fs_prio *prev_prio;

                fs_get_obj(prev_prio, prev_ft->node.parent);
                return connect_fts_in_prio(dev, prev_prio, ft);
        }
        return 0;
}

static int update_root_ft_create(struct mlx5_flow_table *ft, struct fs_prio
                                 *prio)
{
        struct mlx5_flow_root_namespace *root = find_root(&prio->node);
        int min_level = INT_MAX;
        int err;

        if (root->root_ft)
                min_level = root->root_ft->level;

        if (ft->level >= min_level)
                return 0;

        err = mlx5_cmd_update_root_ft(root->dev, ft, root->underlay_qpn);
        if (err)
                mlx5_core_warn(root->dev, "Update root flow table of id=%u failed\n",
                               ft->id);
        else
                root->root_ft = ft;

        return err;
}

static int _mlx5_modify_rule_destination(struct mlx5_flow_rule *rule,
                                         struct mlx5_flow_destination *dest)
{
        struct mlx5_flow_table *ft;
        struct mlx5_flow_group *fg;
        struct fs_fte *fte;
        int modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
        int err = 0;

        fs_get_obj(fte, rule->node.parent);
        if (!(fte->action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
                return -EINVAL;
        lock_ref_node(&fte->node);
        fs_get_obj(fg, fte->node.parent);
        fs_get_obj(ft, fg->node.parent);

        memcpy(&rule->dest_attr, dest, sizeof(*dest));
        err = mlx5_cmd_update_fte(get_dev(&ft->node),
                                  ft, fg->id,
                                  modify_mask,
                                  fte);
        unlock_ref_node(&fte->node);

        return err;
}

int mlx5_modify_rule_destination(struct mlx5_flow_handle *handle,
                                 struct mlx5_flow_destination *new_dest,
                                 struct mlx5_flow_destination *old_dest)
{
        int i;

        if (!old_dest) {
                if (handle->num_rules != 1)
                        return -EINVAL;
                return _mlx5_modify_rule_destination(handle->rule[0],
                                                     new_dest);
        }

        for (i = 0; i < handle->num_rules; i++) {
                if (mlx5_flow_dests_cmp(new_dest, &handle->rule[i]->dest_attr))
                        return _mlx5_modify_rule_destination(handle->rule[i],
                                                             new_dest);
        }

        return -EINVAL;
}

/* Modify/set FWD rules that point on old_next_ft to point on new_next_ft  */
static int connect_fwd_rules(struct mlx5_core_dev *dev,
                             struct mlx5_flow_table *new_next_ft,
                             struct mlx5_flow_table *old_next_ft)
{
        struct mlx5_flow_destination dest;
        struct mlx5_flow_rule *iter;
        int err = 0;

        /* new_next_ft and old_next_ft could be NULL only
         * when we create/destroy the anchor flow table.
         */
        if (!new_next_ft || !old_next_ft)
                return 0;

        dest.type = MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
        dest.ft = new_next_ft;

        mutex_lock(&old_next_ft->lock);
        list_splice_init(&old_next_ft->fwd_rules, &new_next_ft->fwd_rules);
        mutex_unlock(&old_next_ft->lock);
        list_for_each_entry(iter, &new_next_ft->fwd_rules, next_ft) {
                err = _mlx5_modify_rule_destination(iter, &dest);
                if (err)
                        pr_err("mlx5_core: failed to modify rule to point on flow table %d\n",
                               new_next_ft->id);
        }
        return 0;
}

static int connect_flow_table(struct mlx5_core_dev *dev, struct mlx5_flow_table *ft,
                              struct fs_prio *prio)
{
        struct mlx5_flow_table *next_ft;
        int err = 0;

        /* Connect_prev_fts and update_root_ft_create are mutually exclusive */

        if (list_empty(&prio->node.children)) {
                err = connect_prev_fts(dev, ft, prio);
                if (err)
                        return err;

                next_ft = find_next_chained_ft(prio);
                err = connect_fwd_rules(dev, ft, next_ft);
                if (err)
                        return err;
        }

        if (MLX5_CAP_FLOWTABLE(dev,
                               flow_table_properties_nic_receive.modify_root))
                err = update_root_ft_create(ft, prio);
        return err;
}

static void list_add_flow_table(struct mlx5_flow_table *ft,
                                struct fs_prio *prio)
{
        struct list_head *prev = &prio->node.children;
        struct mlx5_flow_table *iter;

        fs_for_each_ft(iter, prio) {
                if (iter->level > ft->level)
                        break;
                prev = &iter->node.list;
        }
        list_add(&ft->node.list, prev);
}

static struct mlx5_flow_table *__mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
                                                        struct mlx5_flow_table_attr *ft_attr,
                                                        enum fs_flow_table_op_mod op_mod,
                                                        u16 vport)
{
        struct mlx5_flow_root_namespace *root = find_root(&ns->node);
        struct mlx5_flow_table *next_ft = NULL;
        struct fs_prio *fs_prio = NULL;
        struct mlx5_flow_table *ft;
        int log_table_sz;
        int err;

        if (!root) {
                pr_err("mlx5: flow steering failed to find root of namespace\n");
                return ERR_PTR(-ENODEV);
        }

        mutex_lock(&root->chain_lock);
        fs_prio = find_prio(ns, ft_attr->prio);
        if (!fs_prio) {
                err = -EINVAL;
                goto unlock_root;
        }
        if (ft_attr->level >= fs_prio->num_levels) {
                err = -ENOSPC;
                goto unlock_root;
        }
        /* The level is related to the
         * priority level range.
         */
        ft_attr->level += fs_prio->start_level;
        ft = alloc_flow_table(ft_attr->level,
                              vport,
                              ft_attr->max_fte ? roundup_pow_of_two(ft_attr->max_fte) : 0,
                              root->table_type,
                              op_mod, ft_attr->flags);
        if (IS_ERR(ft)) {
                err = PTR_ERR(ft);
                goto unlock_root;
        }

        tree_init_node(&ft->node, 1, del_flow_table);
        log_table_sz = ft->max_fte ? ilog2(ft->max_fte) : 0;
        next_ft = find_next_chained_ft(fs_prio);
        err = mlx5_cmd_create_flow_table(root->dev, ft->vport, ft->op_mod, ft->type,
                                         ft->level, log_table_sz, next_ft, &ft->id,
                                         ft->flags);
        if (err)
                goto free_ft;

        err = connect_flow_table(root->dev, ft, fs_prio);
        if (err)
                goto destroy_ft;
        lock_ref_node(&fs_prio->node);
        tree_add_node(&ft->node, &fs_prio->node);
        list_add_flow_table(ft, fs_prio);
        fs_prio->num_ft++;
        unlock_ref_node(&fs_prio->node);
        mutex_unlock(&root->chain_lock);
        return ft;
destroy_ft:
        mlx5_cmd_destroy_flow_table(root->dev, ft);
free_ft:
        ida_destroy(&ft->fte_allocator);
        kfree(ft);
unlock_root:
        mutex_unlock(&root->chain_lock);
        return ERR_PTR(err);
}

struct mlx5_flow_table *mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
                                               struct mlx5_flow_table_attr *ft_attr)
{
        return __mlx5_create_flow_table(ns, ft_attr, FS_FT_OP_MOD_NORMAL, 0);
}

struct mlx5_flow_table *mlx5_create_vport_flow_table(struct mlx5_flow_namespace *ns,
                                                     int prio, int max_fte,
                                                     u32 level, u16 vport)
{
        struct mlx5_flow_table_attr ft_attr = {};

        ft_attr.max_fte = max_fte;
        ft_attr.level   = level;
        ft_attr.prio    = prio;

        return __mlx5_create_flow_table(ns, &ft_attr, FS_FT_OP_MOD_NORMAL, vport);
}

struct mlx5_flow_table*
mlx5_create_lag_demux_flow_table(struct mlx5_flow_namespace *ns,
                                 int prio, u32 level)
{
        struct mlx5_flow_table_attr ft_attr = {};

        ft_attr.level = level;
        ft_attr.prio  = prio;
        return __mlx5_create_flow_table(ns, &ft_attr, FS_FT_OP_MOD_LAG_DEMUX, 0);
}
EXPORT_SYMBOL(mlx5_create_lag_demux_flow_table);

struct mlx5_flow_table*
mlx5_create_auto_grouped_flow_table(struct mlx5_flow_namespace *ns,
                                    int prio,
                                    int num_flow_table_entries,
                                    int max_num_groups,
                                    u32 level,
                                    u32 flags)
{
        struct mlx5_flow_table_attr ft_attr = {};
        struct mlx5_flow_table *ft;

        if (max_num_groups > num_flow_table_entries)
                return ERR_PTR(-EINVAL);

        ft_attr.max_fte = num_flow_table_entries;
        ft_attr.prio    = prio;
        ft_attr.level   = level;
        ft_attr.flags   = flags;

        ft = mlx5_create_flow_table(ns, &ft_attr);
        if (IS_ERR(ft))
                return ft;

        ft->autogroup.active = true;
        ft->autogroup.required_groups = max_num_groups;

        return ft;
}
EXPORT_SYMBOL(mlx5_create_auto_grouped_flow_table);

/* Flow table should be locked */
static struct mlx5_flow_group *create_flow_group_common(struct mlx5_flow_table *ft,
                                                        u32 *fg_in,
                                                        struct list_head
                                                        *prev_fg,
                                                        bool is_auto_fg)
{
        struct mlx5_flow_group *fg;
        struct mlx5_core_dev *dev = get_dev(&ft->node);
        int err;

        if (!dev)
                return ERR_PTR(-ENODEV);

        fg = alloc_flow_group(fg_in);
        if (IS_ERR(fg))
                return fg;

        err = rhltable_insert(&ft->fgs_hash, &fg->hash, rhash_fg);
        if (err)
                goto err_free_fg;

        err = mlx5_cmd_create_flow_group(dev, ft, fg_in, &fg->id);
        if (err)
                goto err_remove_fg;

        if (ft->autogroup.active)
                ft->autogroup.num_groups++;
        /* Add node to tree */
        tree_init_node(&fg->node, !is_auto_fg, del_flow_group);
        tree_add_node(&fg->node, &ft->node);
        /* Add node to group list */
        list_add(&fg->node.list, prev_fg);

        trace_mlx5_fs_add_fg(fg);
        return fg;

err_remove_fg:

        WARN_ON(rhltable_remove(&ft->fgs_hash,
                                &fg->hash,
                                rhash_fg));
err_free_fg:
        rhashtable_destroy(&fg->ftes_hash);
        kfree(fg);

        return ERR_PTR(err);
}

struct mlx5_flow_group *mlx5_create_flow_group(struct mlx5_flow_table *ft,
                                               u32 *fg_in)
{
        void *match_criteria = MLX5_ADDR_OF(create_flow_group_in,
                                            fg_in, match_criteria);
        u8 match_criteria_enable = MLX5_GET(create_flow_group_in,
                                            fg_in,
                                            match_criteria_enable);
        struct mlx5_flow_group *fg;

        if (!check_valid_mask(match_criteria_enable, match_criteria))
                return ERR_PTR(-EINVAL);

        if (ft->autogroup.active)
                return ERR_PTR(-EPERM);

        lock_ref_node(&ft->node);
        fg = create_flow_group_common(ft, fg_in, ft->node.children.prev, false);
        unlock_ref_node(&ft->node);

        return fg;
}

static struct mlx5_flow_rule *alloc_rule(struct mlx5_flow_destination *dest)
{
        struct mlx5_flow_rule *rule;

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

        INIT_LIST_HEAD(&rule->next_ft);
        rule->node.type = FS_TYPE_FLOW_DEST;
        if (dest)
                memcpy(&rule->dest_attr, dest, sizeof(*dest));

        return rule;
}

static struct mlx5_flow_handle *alloc_handle(int num_rules)
{
        struct mlx5_flow_handle *handle;

        handle = kzalloc(sizeof(*handle) + sizeof(handle->rule[0]) *
                          num_rules, GFP_KERNEL);
        if (!handle)
                return NULL;

        handle->num_rules = num_rules;

        return handle;
}

static void destroy_flow_handle(struct fs_fte *fte,
                                struct mlx5_flow_handle *handle,
                                struct mlx5_flow_destination *dest,
                                int i)
{
        for (; --i >= 0;) {
                if (atomic_dec_and_test(&handle->rule[i]->node.refcount)) {
                        fte->dests_size--;
                        list_del(&handle->rule[i]->node.list);
                        kfree(handle->rule[i]);
                }
        }
        kfree(handle);
}

static struct mlx5_flow_handle *
create_flow_handle(struct fs_fte *fte,
                   struct mlx5_flow_destination *dest,
                   int dest_num,
                   int *modify_mask,
                   bool *new_rule)
{
        struct mlx5_flow_handle *handle;
        struct mlx5_flow_rule *rule = NULL;
        static int count = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_FLOW_COUNTERS);
        static int dst = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
        int type;
        int i = 0;

        handle = alloc_handle((dest_num) ? dest_num : 1);
        if (!handle)
                return ERR_PTR(-ENOMEM);

        do {
                if (dest) {
                        rule = find_flow_rule(fte, dest + i);
                        if (rule) {
                                atomic_inc(&rule->node.refcount);
                                goto rule_found;
                        }
                }

                *new_rule = true;
                rule = alloc_rule(dest + i);
                if (!rule)
                        goto free_rules;

                /* Add dest to dests list- we need flow tables to be in the
                 * end of the list for forward to next prio rules.
                 */
                tree_init_node(&rule->node, 1, del_rule);
                if (dest &&
                    dest[i].type != MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE)
                        list_add(&rule->node.list, &fte->node.children);
                else
                        list_add_tail(&rule->node.list, &fte->node.children);
                if (dest) {
                        fte->dests_size++;

                        type = dest[i].type ==
                                MLX5_FLOW_DESTINATION_TYPE_COUNTER;
                        *modify_mask |= type ? count : dst;
                }
rule_found:
                handle->rule[i] = rule;
        } while (++i < dest_num);

        return handle;

free_rules:
        destroy_flow_handle(fte, handle, dest, i);
        return ERR_PTR(-ENOMEM);
}

/* fte should not be deleted while calling this function */
static struct mlx5_flow_handle *
add_rule_fte(struct fs_fte *fte,
             struct mlx5_flow_group *fg,
             struct mlx5_flow_destination *dest,
             int dest_num,
             bool update_action)
{
        struct mlx5_flow_handle *handle;
        struct mlx5_flow_table *ft;
        int modify_mask = 0;
        int err;
        bool new_rule = false;

        handle = create_flow_handle(fte, dest, dest_num, &modify_mask,
                                    &new_rule);
        if (IS_ERR(handle) || !new_rule)
                goto out;

        if (update_action)
                modify_mask |= BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION);

        fs_get_obj(ft, fg->node.parent);
        if (!(fte->status & FS_FTE_STATUS_EXISTING))
                err = mlx5_cmd_create_fte(get_dev(&ft->node),
                                          ft, fg->id, fte);
        else
                err = mlx5_cmd_update_fte(get_dev(&ft->node),
                                          ft, fg->id, modify_mask, fte);
        if (err)
                goto free_handle;

        fte->status |= FS_FTE_STATUS_EXISTING;

out:
        return handle;

free_handle:
        destroy_flow_handle(fte, handle, dest, handle->num_rules);
        return ERR_PTR(err);
}

static struct fs_fte *create_fte(struct mlx5_flow_group *fg,
                                 u32 *match_value,
                                 struct mlx5_flow_act *flow_act)
{
        struct mlx5_flow_table *ft;
        struct fs_fte *fte;
        int index;
        int ret;

        fs_get_obj(ft, fg->node.parent);
        index = ida_simple_get(&ft->fte_allocator, fg->start_index,
                               fg->start_index + fg->max_ftes,
                               GFP_KERNEL);
        if (index < 0)
                return ERR_PTR(index);

        fte = alloc_fte(flow_act, match_value, index);
        if (IS_ERR(fte)) {
                ret = PTR_ERR(fte);
                goto err_alloc;
        }
        ret = rhashtable_insert_fast(&fg->ftes_hash, &fte->hash, rhash_fte);
        if (ret)
                goto err_hash;

        return fte;

err_hash:
        kfree(fte);
err_alloc:
        ida_simple_remove(&ft->fte_allocator, index);
        return ERR_PTR(ret);
}

static struct mlx5_flow_group *create_autogroup(struct mlx5_flow_table *ft,
                                                u8 match_criteria_enable,
                                                u32 *match_criteria)
{
        int inlen = MLX5_ST_SZ_BYTES(create_flow_group_in);
        struct list_head *prev = &ft->node.children;
        unsigned int candidate_index = 0;
        struct mlx5_flow_group *fg;
        void *match_criteria_addr;
        unsigned int group_size = 0;
        u32 *in;

        if (!ft->autogroup.active)
                return ERR_PTR(-ENOENT);

        in = kvzalloc(inlen, GFP_KERNEL);
        if (!in)
                return ERR_PTR(-ENOMEM);

        if (ft->autogroup.num_groups < ft->autogroup.required_groups)
                /* We save place for flow groups in addition to max types */
                group_size = ft->max_fte / (ft->autogroup.required_groups + 1);

        /*  ft->max_fte == ft->autogroup.max_types */
        if (group_size == 0)
                group_size = 1;

        /* sorted by start_index */
        fs_for_each_fg(fg, ft) {
                if (candidate_index + group_size > fg->start_index)
                        candidate_index = fg->start_index + fg->max_ftes;
                else
                        break;
                prev = &fg->node.list;
        }

        if (candidate_index + group_size > ft->max_fte) {
                fg = ERR_PTR(-ENOSPC);
                goto out;
        }

        MLX5_SET(create_flow_group_in, in, match_criteria_enable,
                 match_criteria_enable);
        MLX5_SET(create_flow_group_in, in, start_flow_index, candidate_index);
        MLX5_SET(create_flow_group_in, in, end_flow_index,   candidate_index +
                 group_size - 1);
        match_criteria_addr = MLX5_ADDR_OF(create_flow_group_in,
                                           in, match_criteria);
        memcpy(match_criteria_addr, match_criteria,
               MLX5_ST_SZ_BYTES(fte_match_param));

        fg = create_flow_group_common(ft, in, prev, true);
out:
        kvfree(in);
        return fg;
}

static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
                                struct mlx5_flow_destination *d2)
{
        if (d1->type == d2->type) {
                if ((d1->type == MLX5_FLOW_DESTINATION_TYPE_VPORT &&
                     d1->vport_num == d2->vport_num) ||
                    (d1->type == MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE &&
                     d1->ft == d2->ft) ||
                    (d1->type == MLX5_FLOW_DESTINATION_TYPE_TIR &&
                     d1->tir_num == d2->tir_num))
                        return true;
        }

        return false;
}

static struct mlx5_flow_rule *find_flow_rule(struct fs_fte *fte,
                                             struct mlx5_flow_destination *dest)
{
        struct mlx5_flow_rule *rule;

        list_for_each_entry(rule, &fte->node.children, node.list) {
                if (mlx5_flow_dests_cmp(&rule->dest_attr, dest))
                        return rule;
        }
        return NULL;
}

static bool check_conflicting_actions(u32 action1, u32 action2)
{
        u32 xored_actions = action1 ^ action2;

        /* if one rule only wants to count, it's ok */
        if (action1 == MLX5_FLOW_CONTEXT_ACTION_COUNT ||
            action2 == MLX5_FLOW_CONTEXT_ACTION_COUNT)
                return false;

        if (xored_actions & (MLX5_FLOW_CONTEXT_ACTION_DROP  |
                             MLX5_FLOW_CONTEXT_ACTION_ENCAP |
                             MLX5_FLOW_CONTEXT_ACTION_DECAP))
                return true;

        return false;
}

static int check_conflicting_ftes(struct fs_fte *fte, const struct mlx5_flow_act *flow_act)
{
        if (check_conflicting_actions(flow_act->action, fte->action)) {
                mlx5_core_warn(get_dev(&fte->node),
                               "Found two FTEs with conflicting actions\n");
                return -EEXIST;
        }

        if (fte->flow_tag != flow_act->flow_tag) {
                mlx5_core_warn(get_dev(&fte->node),
                               "FTE flow tag %u already exists with different flow tag %u\n",
                               fte->flow_tag,
                               flow_act->flow_tag);
                return -EEXIST;
        }

        return 0;
}

static struct mlx5_flow_handle *add_rule_fg(struct mlx5_flow_group *fg,
                                            u32 *match_value,
                                            struct mlx5_flow_act *flow_act,
                                            struct mlx5_flow_destination *dest,
                                            int dest_num,
                                            struct fs_fte *fte)
{
        struct mlx5_flow_handle *handle;
        struct mlx5_flow_table *ft;
        int i;

        if (fte) {
                int old_action;
                int ret;

                nested_lock_ref_node(&fte->node, FS_MUTEX_CHILD);
                ret = check_conflicting_ftes(fte, flow_act);
                if (ret) {
                        handle = ERR_PTR(ret);
                        goto unlock_fte;
                }

                old_action = fte->action;
                fte->action |= flow_act->action;
                handle = add_rule_fte(fte, fg, dest, dest_num,
                                      old_action != flow_act->action);
                if (IS_ERR(handle)) {
                        fte->action = old_action;
                        goto unlock_fte;
                } else {
                        trace_mlx5_fs_set_fte(fte, false);
                        goto add_rules;
                }
        }
        fs_get_obj(ft, fg->node.parent);

        fte = create_fte(fg, match_value, flow_act);
        if (IS_ERR(fte))
                return (void *)fte;
        tree_init_node(&fte->node, 0, del_fte);
        nested_lock_ref_node(&fte->node, FS_MUTEX_CHILD);
        handle = add_rule_fte(fte, fg, dest, dest_num, false);
        if (IS_ERR(handle)) {
                unlock_ref_node(&fte->node);
                destroy_fte(fte, fg);
                kfree(fte);
                return handle;
        }

        tree_add_node(&fte->node, &fg->node);
        /* fte list isn't sorted */
        list_add_tail(&fte->node.list, &fg->node.children);
        trace_mlx5_fs_set_fte(fte, true);
add_rules:
        for (i = 0; i < handle->num_rules; i++) {
                if (atomic_read(&handle->rule[i]->node.refcount) == 1) {
                        tree_add_node(&handle->rule[i]->node, &fte->node);
                        trace_mlx5_fs_add_rule(handle->rule[i]);
                }
        }
unlock_fte:
        unlock_ref_node(&fte->node);
        return handle;
}

struct mlx5_fc *mlx5_flow_rule_counter(struct mlx5_flow_handle *handle)
{
        struct mlx5_flow_rule *dst;
        struct fs_fte *fte;

        fs_get_obj(fte, handle->rule[0]->node.parent);

        fs_for_each_dst(dst, fte) {
                if (dst->dest_attr.type == MLX5_FLOW_DESTINATION_TYPE_COUNTER)
                        return dst->dest_attr.counter;
        }

        return NULL;
}

static bool counter_is_valid(struct mlx5_fc *counter, u32 action)
{
        if (!(action & MLX5_FLOW_CONTEXT_ACTION_COUNT))
                return !counter;

        if (!counter)
                return false;

        return (action & (MLX5_FLOW_CONTEXT_ACTION_DROP |
                          MLX5_FLOW_CONTEXT_ACTION_FWD_DEST));
}

static bool dest_is_valid(struct mlx5_flow_destination *dest,
                          u32 action,
                          struct mlx5_flow_table *ft)
{
        if (dest && (dest->type == MLX5_FLOW_DESTINATION_TYPE_COUNTER))
                return counter_is_valid(dest->counter, action);

        if (!(action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
                return true;

        if (!dest || ((dest->type ==
            MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE) &&
            (dest->ft->level <= ft->level)))
                return false;
        return true;
}

static struct mlx5_flow_handle *
try_add_to_existing_fg(struct mlx5_flow_table *ft,
                       struct mlx5_flow_spec *spec,
                       struct mlx5_flow_act *flow_act,
                       struct mlx5_flow_destination *dest,
                       int dest_num)
{
        struct mlx5_flow_group *g;
        struct mlx5_flow_handle *rule = ERR_PTR(-ENOENT);
        struct rhlist_head *tmp, *list;
        struct match_list {
                struct list_head        list;
                struct mlx5_flow_group *g;
        } match_list, *iter;
        LIST_HEAD(match_head);

        rcu_read_lock();
        /* Collect all fgs which has a matching match_criteria */
        list = rhltable_lookup(&ft->fgs_hash, spec, rhash_fg);
        rhl_for_each_entry_rcu(g, tmp, list, hash) {
                struct match_list *curr_match;

                if (likely(list_empty(&match_head))) {
                        match_list.g = g;
                        list_add_tail(&match_list.list, &match_head);
                        continue;
                }
                curr_match = kmalloc(sizeof(*curr_match), GFP_ATOMIC);

                if (!curr_match) {
                        rcu_read_unlock();
                        rule = ERR_PTR(-ENOMEM);
                        goto free_list;
                }
                curr_match->g = g;
                list_add_tail(&curr_match->list, &match_head);
        }
        rcu_read_unlock();

        /* Try to find a fg that already contains a matching fte */
        list_for_each_entry(iter, &match_head, list) {
                struct fs_fte *fte;

                g = iter->g;
                nested_lock_ref_node(&g->node, FS_MUTEX_PARENT);
                fte = rhashtable_lookup_fast(&g->ftes_hash, spec->match_value,
                                             rhash_fte);
                if (fte) {
                        rule = add_rule_fg(g, spec->match_value,
                                           flow_act, dest, dest_num, fte);
                        unlock_ref_node(&g->node);
                        goto free_list;
                }
                unlock_ref_node(&g->node);
        }

        /* No group with matching fte found. Try to add a new fte to any
         * matching fg.
         */
        list_for_each_entry(iter, &match_head, list) {
                g = iter->g;

                nested_lock_ref_node(&g->node, FS_MUTEX_PARENT);
                rule = add_rule_fg(g, spec->match_value,
                                   flow_act, dest, dest_num, NULL);
                if (!IS_ERR(rule) || PTR_ERR(rule) != -ENOSPC) {
                        unlock_ref_node(&g->node);
                        goto free_list;
                }
                unlock_ref_node(&g->node);
        }

free_list:
        if (!list_empty(&match_head)) {
                struct match_list *match_tmp;

                /* The most common case is having one FG. Since we want to
                 * optimize this case, we save the first on the stack.
                 * Therefore, no need to free it.
                 */
                list_del(&list_first_entry(&match_head, typeof(*iter), list)->list);
                list_for_each_entry_safe(iter, match_tmp, &match_head, list) {
                        list_del(&iter->list);
                        kfree(iter);
                }
        }

        return rule;
}

static struct mlx5_flow_handle *
_mlx5_add_flow_rules(struct mlx5_flow_table *ft,
                     struct mlx5_flow_spec *spec,
                     struct mlx5_flow_act *flow_act,
                     struct mlx5_flow_destination *dest,
                     int dest_num)

{
        struct mlx5_flow_group *g;
        struct mlx5_flow_handle *rule;
        int i;

        if (!check_valid_spec(spec))
                return ERR_PTR(-EINVAL);

        for (i = 0; i < dest_num; i++) {
                if (!dest_is_valid(&dest[i], flow_act->action, ft))
                        return ERR_PTR(-EINVAL);
        }

        nested_lock_ref_node(&ft->node, FS_MUTEX_GRANDPARENT);
        rule = try_add_to_existing_fg(ft, spec, flow_act, dest, dest_num);
        if (!IS_ERR(rule))
                goto unlock;

        g = create_autogroup(ft, spec->match_criteria_enable,
                             spec->match_criteria);
        if (IS_ERR(g)) {
                rule = (void *)g;
                goto unlock;
        }

        rule = add_rule_fg(g, spec->match_value, flow_act, dest,
                           dest_num, NULL);
        if (IS_ERR(rule)) {
                /* Remove assumes refcount > 0 and autogroup creates a group
                 * with a refcount = 0.
                 */
                unlock_ref_node(&ft->node);
                tree_get_node(&g->node);
                tree_remove_node(&g->node);
                return rule;
        }
unlock:
        unlock_ref_node(&ft->node);
        return rule;
}

static bool fwd_next_prio_supported(struct mlx5_flow_table *ft)
{
        return ((ft->type == FS_FT_NIC_RX) &&
                (MLX5_CAP_FLOWTABLE(get_dev(&ft->node), nic_rx_multi_path_tirs)));
}

struct mlx5_flow_handle *
mlx5_add_flow_rules(struct mlx5_flow_table *ft,
                    struct mlx5_flow_spec *spec,
                    struct mlx5_flow_act *flow_act,
                    struct mlx5_flow_destination *dest,
                    int dest_num)
{
        struct mlx5_flow_root_namespace *root = find_root(&ft->node);
        struct mlx5_flow_destination gen_dest;
        struct mlx5_flow_table *next_ft = NULL;
        struct mlx5_flow_handle *handle = NULL;
        u32 sw_action = flow_act->action;
        struct fs_prio *prio;

        fs_get_obj(prio, ft->node.parent);
        if (flow_act->action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
                if (!fwd_next_prio_supported(ft))
                        return ERR_PTR(-EOPNOTSUPP);
                if (dest)
                        return ERR_PTR(-EINVAL);
                mutex_lock(&root->chain_lock);
                next_ft = find_next_chained_ft(prio);
                if (next_ft) {
                        gen_dest.type = MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
                        gen_dest.ft = next_ft;
                        dest = &gen_dest;
                        dest_num = 1;
                        flow_act->action = MLX5_FLOW_CONTEXT_ACTION_FWD_DEST;
                } else {
                        mutex_unlock(&root->chain_lock);
                        return ERR_PTR(-EOPNOTSUPP);
                }
        }

        handle = _mlx5_add_flow_rules(ft, spec, flow_act, dest, dest_num);

        if (sw_action == MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO) {
                if (!IS_ERR_OR_NULL(handle) &&
                    (list_empty(&handle->rule[0]->next_ft))) {
                        mutex_lock(&next_ft->lock);
                        list_add(&handle->rule[0]->next_ft,
                                 &next_ft->fwd_rules);
                        mutex_unlock(&next_ft->lock);
                        handle->rule[0]->sw_action = MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO;
                }
                mutex_unlock(&root->chain_lock);
        }
        return handle;
}
EXPORT_SYMBOL(mlx5_add_flow_rules);

void mlx5_del_flow_rules(struct mlx5_flow_handle *handle)
{
        int i;

        for (i = handle->num_rules - 1; i >= 0; i--)
                tree_remove_node(&handle->rule[i]->node);
        kfree(handle);
}
EXPORT_SYMBOL(mlx5_del_flow_rules);

/* Assuming prio->node.children(flow tables) is sorted by level */
static struct mlx5_flow_table *find_next_ft(struct mlx5_flow_table *ft)
{
        struct fs_prio *prio;

        fs_get_obj(prio, ft->node.parent);

        if (!list_is_last(&ft->node.list, &prio->node.children))
                return list_next_entry(ft, node.list);
        return find_next_chained_ft(prio);
}

static int update_root_ft_destroy(struct mlx5_flow_table *ft)
{
        struct mlx5_flow_root_namespace *root = find_root(&ft->node);
        struct mlx5_flow_table *new_root_ft = NULL;

        if (root->root_ft != ft)
                return 0;

        new_root_ft = find_next_ft(ft);
        if (new_root_ft) {
                int err = mlx5_cmd_update_root_ft(root->dev, new_root_ft,
                                                  root->underlay_qpn);

                if (err) {
                        mlx5_core_warn(root->dev, "Update root flow table of id=%u failed\n",
                                       ft->id);
                        return err;
                }
        }
        root->root_ft = new_root_ft;
        return 0;
}

/* Connect flow table from previous priority to
 * the next flow table.
 */
static int disconnect_flow_table(struct mlx5_flow_table *ft)
{
        struct mlx5_core_dev *dev = get_dev(&ft->node);
        struct mlx5_flow_table *next_ft;
        struct fs_prio *prio;
        int err = 0;

        err = update_root_ft_destroy(ft);
        if (err)
                return err;

        fs_get_obj(prio, ft->node.parent);
        if  (!(list_first_entry(&prio->node.children,
                                struct mlx5_flow_table,
                                node.list) == ft))
                return 0;

        next_ft = find_next_chained_ft(prio);
        err = connect_fwd_rules(dev, next_ft, ft);
        if (err)
                return err;

        err = connect_prev_fts(dev, next_ft, prio);
        if (err)
                mlx5_core_warn(dev, "Failed to disconnect flow table %d\n",
                               ft->id);
        return err;
}

int mlx5_destroy_flow_table(struct mlx5_flow_table *ft)
{
        struct mlx5_flow_root_namespace *root = find_root(&ft->node);
        int err = 0;

        mutex_lock(&root->chain_lock);
        err = disconnect_flow_table(ft);
        if (err) {
                mutex_unlock(&root->chain_lock);
                return err;
        }
        if (tree_remove_node(&ft->node))
                mlx5_core_warn(get_dev(&ft->node), "Flow table %d wasn't destroyed, refcount > 1\n",
                               ft->id);
        mutex_unlock(&root->chain_lock);

        return err;
}
EXPORT_SYMBOL(mlx5_destroy_flow_table);

void mlx5_destroy_flow_group(struct mlx5_flow_group *fg)
{
        if (tree_remove_node(&fg->node))
                mlx5_core_warn(get_dev(&fg->node), "Flow group %d wasn't destroyed, refcount > 1\n",
                               fg->id);
}

struct mlx5_flow_namespace *mlx5_get_flow_namespace(struct mlx5_core_dev *dev,
                                                    enum mlx5_flow_namespace_type type)
{
        struct mlx5_flow_steering *steering = dev->priv.steering;
        struct mlx5_flow_root_namespace *root_ns;
        int prio;
        struct fs_prio *fs_prio;
        struct mlx5_flow_namespace *ns;

        if (!steering)
                return NULL;

        switch (type) {
        case MLX5_FLOW_NAMESPACE_BYPASS:
        case MLX5_FLOW_NAMESPACE_LAG:
        case MLX5_FLOW_NAMESPACE_OFFLOADS:
        case MLX5_FLOW_NAMESPACE_ETHTOOL:
        case MLX5_FLOW_NAMESPACE_KERNEL:
        case MLX5_FLOW_NAMESPACE_LEFTOVERS:
        case MLX5_FLOW_NAMESPACE_ANCHOR:
                prio = type;
                break;
        case MLX5_FLOW_NAMESPACE_FDB:
                if (steering->fdb_root_ns)
                        return &steering->fdb_root_ns->ns;
                else
                        return NULL;
        case MLX5_FLOW_NAMESPACE_ESW_EGRESS:
                if (steering->esw_egress_root_ns)
                        return &steering->esw_egress_root_ns->ns;
                else
                        return NULL;
        case MLX5_FLOW_NAMESPACE_ESW_INGRESS:
                if (steering->esw_ingress_root_ns)
                        return &steering->esw_ingress_root_ns->ns;
                else
                        return NULL;
        case MLX5_FLOW_NAMESPACE_SNIFFER_RX:
                if (steering->sniffer_rx_root_ns)
                        return &steering->sniffer_rx_root_ns->ns;
                else
                        return NULL;
        case MLX5_FLOW_NAMESPACE_SNIFFER_TX:
                if (steering->sniffer_tx_root_ns)
                        return &steering->sniffer_tx_root_ns->ns;
                else
                        return NULL;
        default:
                return NULL;
        }

        root_ns = steering->root_ns;
        if (!root_ns)
                return NULL;

        fs_prio = find_prio(&root_ns->ns, prio);
        if (!fs_prio)
                return NULL;

        ns = list_first_entry(&fs_prio->node.children,
                              typeof(*ns),
                              node.list);

        return ns;
}
EXPORT_SYMBOL(mlx5_get_flow_namespace);

static struct fs_prio *fs_create_prio(struct mlx5_flow_namespace *ns,
                                      unsigned int prio, int num_levels)
{
        struct fs_prio *fs_prio;

        fs_prio = kzalloc(sizeof(*fs_prio), GFP_KERNEL);
        if (!fs_prio)
                return ERR_PTR(-ENOMEM);

        fs_prio->node.type = FS_TYPE_PRIO;
        tree_init_node(&fs_prio->node, 1, NULL);
        tree_add_node(&fs_prio->node, &ns->node);
        fs_prio->num_levels = num_levels;
        fs_prio->prio = prio;
        list_add_tail(&fs_prio->node.list, &ns->node.children);

        return fs_prio;
}

static struct mlx5_flow_namespace *fs_init_namespace(struct mlx5_flow_namespace
                                                     *ns)
{
        ns->node.type = FS_TYPE_NAMESPACE;

        return ns;
}

static struct mlx5_flow_namespace *fs_create_namespace(struct fs_prio *prio)
{
        struct mlx5_flow_namespace      *ns;

        ns = kzalloc(sizeof(*ns), GFP_KERNEL);
        if (!ns)
                return ERR_PTR(-ENOMEM);

        fs_init_namespace(ns);
        tree_init_node(&ns->node, 1, NULL);
        tree_add_node(&ns->node, &prio->node);
        list_add_tail(&ns->node.list, &prio->node.children);

        return ns;
}

static int create_leaf_prios(struct mlx5_flow_namespace *ns, int prio,
                             struct init_tree_node *prio_metadata)
{
        struct fs_prio *fs_prio;
        int i;

        for (i = 0; i < prio_metadata->num_leaf_prios; i++) {
                fs_prio = fs_create_prio(ns, prio++, prio_metadata->num_levels);
                if (IS_ERR(fs_prio))
                        return PTR_ERR(fs_prio);
        }
        return 0;
}

#define FLOW_TABLE_BIT_SZ 1
#define GET_FLOW_TABLE_CAP(dev, offset) \
        ((be32_to_cpu(*((__be32 *)(dev->caps.hca_cur[MLX5_CAP_FLOW_TABLE]) +    \
                        offset / 32)) >>                                        \
          (32 - FLOW_TABLE_BIT_SZ - (offset & 0x1f))) & FLOW_TABLE_BIT_SZ)
static bool has_required_caps(struct mlx5_core_dev *dev, struct node_caps *caps)
{
        int i;

        for (i = 0; i < caps->arr_sz; i++) {
                if (!GET_FLOW_TABLE_CAP(dev, caps->caps[i]))
                        return false;
        }
        return true;
}

static int init_root_tree_recursive(struct mlx5_flow_steering *steering,
                                    struct init_tree_node *init_node,
                                    struct fs_node *fs_parent_node,
                                    struct init_tree_node *init_parent_node,
                                    int prio)
{
        int max_ft_level = MLX5_CAP_FLOWTABLE(steering->dev,
                                              flow_table_properties_nic_receive.
                                              max_ft_level);
        struct mlx5_flow_namespace *fs_ns;
        struct fs_prio *fs_prio;
        struct fs_node *base;
        int i;
        int err;

        if (init_node->type == FS_TYPE_PRIO) {
                if ((init_node->min_ft_level > max_ft_level) ||
                    !has_required_caps(steering->dev, &init_node->caps))
                        return 0;

                fs_get_obj(fs_ns, fs_parent_node);
                if (init_node->num_leaf_prios)
                        return create_leaf_prios(fs_ns, prio, init_node);
                fs_prio = fs_create_prio(fs_ns, prio, init_node->num_levels);
                if (IS_ERR(fs_prio))
                        return PTR_ERR(fs_prio);
                base = &fs_prio->node;
        } else if (init_node->type == FS_TYPE_NAMESPACE) {
                fs_get_obj(fs_prio, fs_parent_node);
                fs_ns = fs_create_namespace(fs_prio);
                if (IS_ERR(fs_ns))
                        return PTR_ERR(fs_ns);
                base = &fs_ns->node;
        } else {
                return -EINVAL;
        }
        prio = 0;
        for (i = 0; i < init_node->ar_size; i++) {
                err = init_root_tree_recursive(steering, &init_node->children[i],
                                               base, init_node, prio);
                if (err)
                        return err;
                if (init_node->children[i].type == FS_TYPE_PRIO &&
                    init_node->children[i].num_leaf_prios) {
                        prio += init_node->children[i].num_leaf_prios;
                }
        }

        return 0;
}

static int init_root_tree(struct mlx5_flow_steering *steering,
                          struct init_tree_node *init_node,
                          struct fs_node *fs_parent_node)
{
        int i;
        struct mlx5_flow_namespace *fs_ns;
        int err;

        fs_get_obj(fs_ns, fs_parent_node);
        for (i = 0; i < init_node->ar_size; i++) {
                err = init_root_tree_recursive(steering, &init_node->children[i],
                                               &fs_ns->node,
                                               init_node, i);
                if (err)
                        return err;
        }
        return 0;
}

static struct mlx5_flow_root_namespace *create_root_ns(struct mlx5_flow_steering *steering,
                                                       enum fs_flow_table_type
                                                       table_type)
{
        struct mlx5_flow_root_namespace *root_ns;
        struct mlx5_flow_namespace *ns;

        /* Create the root namespace */
        root_ns = kvzalloc(sizeof(*root_ns), GFP_KERNEL);
        if (!root_ns)
                return NULL;

        root_ns->dev = steering->dev;
        root_ns->table_type = table_type;

        ns = &root_ns->ns;
        fs_init_namespace(ns);
        mutex_init(&root_ns->chain_lock);
        tree_init_node(&ns->node, 1, NULL);
        tree_add_node(&ns->node, NULL);

        return root_ns;
}

static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level);

static int set_prio_attrs_in_ns(struct mlx5_flow_namespace *ns, int acc_level)
{
        struct fs_prio *prio;

        fs_for_each_prio(prio, ns) {
                 /* This updates prio start_level and num_levels */
                set_prio_attrs_in_prio(prio, acc_level);
                acc_level += prio->num_levels;
        }
        return acc_level;
}

static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level)
{
        struct mlx5_flow_namespace *ns;
        int acc_level_ns = acc_level;

        prio->start_level = acc_level;
        fs_for_each_ns(ns, prio)
                /* This updates start_level and num_levels of ns's priority descendants */
                acc_level_ns = set_prio_attrs_in_ns(ns, acc_level);
        if (!prio->num_levels)

                prio->num_levels = acc_level_ns - prio->start_level;
        WARN_ON(prio->num_levels < acc_level_ns - prio->start_level);
}

static void set_prio_attrs(struct mlx5_flow_root_namespace *root_ns)
{
        struct mlx5_flow_namespace *ns = &root_ns->ns;
        struct fs_prio *prio;
        int start_level = 0;

        fs_for_each_prio(prio, ns) {
                set_prio_attrs_in_prio(prio, start_level);
                start_level += prio->num_levels;
        }
}

#define ANCHOR_PRIO 0
#define ANCHOR_SIZE 1
#define ANCHOR_LEVEL 0
static int create_anchor_flow_table(struct mlx5_flow_steering *steering)
{
        struct mlx5_flow_namespace *ns = NULL;
        struct mlx5_flow_table_attr ft_attr = {};
        struct mlx5_flow_table *ft;

        ns = mlx5_get_flow_namespace(steering->dev, MLX5_FLOW_NAMESPACE_ANCHOR);
        if (WARN_ON(!ns))
                return -EINVAL;

        ft_attr.max_fte = ANCHOR_SIZE;
        ft_attr.level   = ANCHOR_LEVEL;
        ft_attr.prio    = ANCHOR_PRIO;

        ft = mlx5_create_flow_table(ns, &ft_attr);
        if (IS_ERR(ft)) {
                mlx5_core_err(steering->dev, "Failed to create last anchor flow table");
                return PTR_ERR(ft);
        }
        return 0;
}

static int init_root_ns(struct mlx5_flow_steering *steering)
{
        steering->root_ns = create_root_ns(steering, FS_FT_NIC_RX);
        if (!steering->root_ns)
                goto cleanup;

        if (init_root_tree(steering, &root_fs, &steering->root_ns->ns.node))
                goto cleanup;

        set_prio_attrs(steering->root_ns);

        if (create_anchor_flow_table(steering))
                goto cleanup;

        return 0;

cleanup:
        mlx5_cleanup_fs(steering->dev);
        return -ENOMEM;
}

static void clean_tree(struct fs_node *node)
{
        if (node) {
                struct fs_node *iter;
                struct fs_node *temp;

                list_for_each_entry_safe(iter, temp, &node->children, list)
                        clean_tree(iter);
                tree_remove_node(node);
        }
}

static void cleanup_root_ns(struct mlx5_flow_root_namespace *root_ns)
{
        if (!root_ns)
                return;

        clean_tree(&root_ns->ns.node);
}

void mlx5_cleanup_fs(struct mlx5_core_dev *dev)
{
        struct mlx5_flow_steering *steering = dev->priv.steering;

        cleanup_root_ns(steering->root_ns);
        cleanup_root_ns(steering->esw_egress_root_ns);
        cleanup_root_ns(steering->esw_ingress_root_ns);
        cleanup_root_ns(steering->fdb_root_ns);
        cleanup_root_ns(steering->sniffer_rx_root_ns);
        cleanup_root_ns(steering->sniffer_tx_root_ns);
        mlx5_cleanup_fc_stats(dev);
        kfree(steering);
}

static int init_sniffer_tx_root_ns(struct mlx5_flow_steering *steering)
{
        struct fs_prio *prio;

        steering->sniffer_tx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_TX);
        if (!steering->sniffer_tx_root_ns)
                return -ENOMEM;

        /* Create single prio */
        prio = fs_create_prio(&steering->sniffer_tx_root_ns->ns, 0, 1);
        if (IS_ERR(prio)) {
                cleanup_root_ns(steering->sniffer_tx_root_ns);
                return PTR_ERR(prio);
        }
        return 0;
}

static int init_sniffer_rx_root_ns(struct mlx5_flow_steering *steering)
{
        struct fs_prio *prio;

        steering->sniffer_rx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_RX);
        if (!steering->sniffer_rx_root_ns)
                return -ENOMEM;

        /* Create single prio */
        prio = fs_create_prio(&steering->sniffer_rx_root_ns->ns, 0, 1);
        if (IS_ERR(prio)) {
                cleanup_root_ns(steering->sniffer_rx_root_ns);
                return PTR_ERR(prio);
        }
        return 0;
}

static int init_fdb_root_ns(struct mlx5_flow_steering *steering)
{
        struct fs_prio *prio;

        steering->fdb_root_ns = create_root_ns(steering, FS_FT_FDB);
        if (!steering->fdb_root_ns)
                return -ENOMEM;

        prio = fs_create_prio(&steering->fdb_root_ns->ns, 0, 1);
        if (IS_ERR(prio))
                goto out_err;

        prio = fs_create_prio(&steering->fdb_root_ns->ns, 1, 1);
        if (IS_ERR(prio))
                goto out_err;

        set_prio_attrs(steering->fdb_root_ns);
        return 0;

out_err:
        cleanup_root_ns(steering->fdb_root_ns);
        steering->fdb_root_ns = NULL;
        return PTR_ERR(prio);
}

static int init_ingress_acl_root_ns(struct mlx5_flow_steering *steering)
{
        struct fs_prio *prio;

        steering->esw_egress_root_ns = create_root_ns(steering, FS_FT_ESW_EGRESS_ACL);
        if (!steering->esw_egress_root_ns)
                return -ENOMEM;

        /* create 1 prio*/
        prio = fs_create_prio(&steering->esw_egress_root_ns->ns, 0,
                              MLX5_TOTAL_VPORTS(steering->dev));
        return PTR_ERR_OR_ZERO(prio);
}

static int init_egress_acl_root_ns(struct mlx5_flow_steering *steering)
{
        struct fs_prio *prio;

        steering->esw_ingress_root_ns = create_root_ns(steering, FS_FT_ESW_INGRESS_ACL);
        if (!steering->esw_ingress_root_ns)
                return -ENOMEM;

        /* create 1 prio*/
        prio = fs_create_prio(&steering->esw_ingress_root_ns->ns, 0,
                              MLX5_TOTAL_VPORTS(steering->dev));
        return PTR_ERR_OR_ZERO(prio);
}

int mlx5_init_fs(struct mlx5_core_dev *dev)
{
        struct mlx5_flow_steering *steering;
        int err = 0;

        err = mlx5_init_fc_stats(dev);
        if (err)
                return err;

        steering = kzalloc(sizeof(*steering), GFP_KERNEL);
        if (!steering)
                return -ENOMEM;
        steering->dev = dev;
        dev->priv.steering = steering;

        if ((((MLX5_CAP_GEN(dev, port_type) == MLX5_CAP_PORT_TYPE_ETH) &&
              (MLX5_CAP_GEN(dev, nic_flow_table))) ||
             ((MLX5_CAP_GEN(dev, port_type) == MLX5_CAP_PORT_TYPE_IB) &&
              MLX5_CAP_GEN(dev, ipoib_enhanced_offloads))) &&
            MLX5_CAP_FLOWTABLE_NIC_RX(dev, ft_support)) {
                err = init_root_ns(steering);
                if (err)
                        goto err;
        }

        if (MLX5_CAP_GEN(dev, eswitch_flow_table)) {
                if (MLX5_CAP_ESW_FLOWTABLE_FDB(dev, ft_support)) {
                        err = init_fdb_root_ns(steering);
                        if (err)
                                goto err;
                }
                if (MLX5_CAP_ESW_EGRESS_ACL(dev, ft_support)) {
                        err = init_egress_acl_root_ns(steering);
                        if (err)
                                goto err;
                }
                if (MLX5_CAP_ESW_INGRESS_ACL(dev, ft_support)) {
                        err = init_ingress_acl_root_ns(steering);
                        if (err)
                                goto err;
                }
        }

        if (MLX5_CAP_FLOWTABLE_SNIFFER_RX(dev, ft_support)) {
                err = init_sniffer_rx_root_ns(steering);
                if (err)
                        goto err;
        }

        if (MLX5_CAP_FLOWTABLE_SNIFFER_TX(dev, ft_support)) {
                err = init_sniffer_tx_root_ns(steering);
                if (err)
                        goto err;
        }

        return 0;
err:
        mlx5_cleanup_fs(dev);
        return err;
}

int mlx5_fs_add_rx_underlay_qpn(struct mlx5_core_dev *dev, u32 underlay_qpn)
{
        struct mlx5_flow_root_namespace *root = dev->priv.steering->root_ns;

        root->underlay_qpn = underlay_qpn;
        return 0;
}
EXPORT_SYMBOL(mlx5_fs_add_rx_underlay_qpn);

int mlx5_fs_remove_rx_underlay_qpn(struct mlx5_core_dev *dev, u32 underlay_qpn)
{
        struct mlx5_flow_root_namespace *root = dev->priv.steering->root_ns;

        root->underlay_qpn = 0;
        return 0;
}
EXPORT_SYMBOL(mlx5_fs_remove_rx_underlay_qpn);