fs_prio
struct fs_prio *prio)
struct fs_prio *prio)
struct fs_prio *fs_prio = NULL;
fs_prio = find_prio(ns, ft_attr->prio);
if (!fs_prio) {
if (ft_attr->level >= fs_prio->num_levels) {
ft_attr->level += fs_prio->start_level;
find_next_chained_ft(fs_prio);
err = connect_flow_table(root->dev, ft, fs_prio);
down_write_ref_node(&fs_prio->node, false);
tree_add_node(&ft->node, &fs_prio->node);
list_add_flow_table(ft, fs_prio);
ft->node.root = fs_prio->node.root;
fs_prio->num_ft++;
up_write_ref_node(&fs_prio->node, false);
struct fs_prio *prio;
struct fs_prio *prio;
struct fs_prio *fs_prio;
fs_prio = find_prio(&root_ns->ns, prio);
if (!fs_prio)
ns = list_first_entry(&fs_prio->node.children,
static struct fs_prio *_fs_create_prio(struct mlx5_flow_namespace *ns,
struct fs_prio *fs_prio;
fs_prio = kzalloc(sizeof(*fs_prio), GFP_KERNEL);
if (!fs_prio)
fs_prio->node.type = type;
tree_init_node(&fs_prio->node, NULL, del_sw_prio);
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 fs_prio *fs_create_prio_chained(struct mlx5_flow_namespace *ns,
static struct fs_prio *fs_create_prio(struct mlx5_flow_namespace *ns,
static struct mlx5_flow_namespace *fs_create_namespace(struct fs_prio *prio,
struct fs_prio *fs_prio;
fs_prio = fs_create_prio(ns, prio++, prio_metadata->num_levels);
if (IS_ERR(fs_prio))
return PTR_ERR(fs_prio);
struct fs_prio *fs_prio;
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;
fs_get_obj(fs_prio, fs_parent_node);
fs_ns = fs_create_namespace(fs_prio, init_node->def_miss_action);
static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level);
struct fs_prio *prio;
static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level)
struct fs_prio *prio;
struct fs_prio *prio;
struct fs_prio *prio;
struct fs_prio *prio;
struct fs_prio *maj_prio)
struct fs_prio *min_prio;
int fs_prio,
struct fs_prio *maj_prio;
fs_prio,
struct fs_prio *prio;
struct fs_prio *maj_prio;
struct fs_prio *prio;
struct fs_prio *prio;
static struct fs_prio *find_prio(struct mlx5_flow_namespace *ns,
struct fs_prio *iter_prio;
struct fs_prio *prio;
static struct mlx5_flow_table *find_closest_ft(struct fs_prio *prio, bool reverse)
static struct mlx5_flow_table *find_next_chained_ft(struct fs_prio *prio)
static struct mlx5_flow_table *find_prev_chained_ft(struct fs_prio *prio)
struct fs_prio *prio;
struct fs_prio *prio,
struct fs_prio *prio)
struct fs_prio *prev_prio;
static int update_root_ft_create(struct mlx5_flow_table *ft, struct fs_prio