projects / linux-2.6-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
net/mlx5: DR, Support EMD tag in modify header for STEv1
[linux-2.6-block.git] / drivers / net / ethernet / mellanox / mlx5 / core / fs_core.c
CommitLineData
de8575e0
MG		 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>
bf3e4d38 35#include <linux/mlx5/vport.h>
0efc8562 36#include <linux/mlx5/eswitch.h>
de8575e0
MG		 37
38#include "mlx5_core.h"
39#include "fs_core.h"
0c56b975 40#include "fs_cmd.h"
4a98544d 41#include "fs_ft_pool.h"
4c03e69a 42#include "diag/fs_tracepoint.h"
5f418378 43#include "accel/ipsec.h"
05564d0a 44#include "fpga/ipsec.h"
0c56b975 45
25302363
MG		 46#define INIT_TREE_NODE_ARRAY_SIZE(...) (sizeof((struct init_tree_node[]){__VA_ARGS__}) /\
47 sizeof(struct init_tree_node))
48
a257b94a 49#define ADD_PRIO(num_prios_val, min_level_val, num_levels_val, caps_val,\
8d40d162 50 ...) {.type = FS_TYPE_PRIO,\
25302363 51 .min_ft_level = min_level_val,\
a257b94a 52 .num_levels = num_levels_val,\
4cbdd30e 53 .num_leaf_prios = num_prios_val,\
8d40d162 54 .caps = caps_val,\
25302363
MG		 55 .children = (struct init_tree_node[]) {__VA_ARGS__},\
56 .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
57}
58
a257b94a
MG		 59#define ADD_MULTIPLE_PRIO(num_prios_val, num_levels_val, ...)\
60 ADD_PRIO(num_prios_val, 0, num_levels_val, {},\
4cbdd30e 61 __VA_ARGS__)\
25302363 62
f66ad830
MZ		 63#define ADD_NS(def_miss_act, ...) {.type = FS_TYPE_NAMESPACE, \
64 .def_miss_action = def_miss_act,\
25302363
MG		 65 .children = (struct init_tree_node[]) {__VA_ARGS__},\
66 .ar_size = INIT_TREE_NODE_ARRAY_SIZE(__VA_ARGS__) \
67}
68
8d40d162
MG		 69#define INIT_CAPS_ARRAY_SIZE(...) (sizeof((long[]){__VA_ARGS__}) /\
70 sizeof(long))
71
72#define FS_CAP(cap) (__mlx5_bit_off(flow_table_nic_cap, cap))
73
74#define FS_REQUIRED_CAPS(...) {.arr_sz = INIT_CAPS_ARRAY_SIZE(__VA_ARGS__), \
75 .caps = (long[]) {__VA_ARGS__} }
76
6dc6071c
MG		 77#define FS_CHAINING_CAPS FS_REQUIRED_CAPS(FS_CAP(flow_table_properties_nic_receive.flow_modify_en), \
78 FS_CAP(flow_table_properties_nic_receive.modify_root), \
79 FS_CAP(flow_table_properties_nic_receive.identified_miss_table_mode), \
80 FS_CAP(flow_table_properties_nic_receive.flow_table_modify))
81
8ce78257
MB		 82#define FS_CHAINING_CAPS_EGRESS \
83 FS_REQUIRED_CAPS( \
84 FS_CAP(flow_table_properties_nic_transmit.flow_modify_en), \
85 FS_CAP(flow_table_properties_nic_transmit.modify_root), \
86 FS_CAP(flow_table_properties_nic_transmit \
87 .identified_miss_table_mode), \
88 FS_CAP(flow_table_properties_nic_transmit.flow_table_modify))
89
24670b1a
MG		 90#define FS_CHAINING_CAPS_RDMA_TX \
91 FS_REQUIRED_CAPS( \
92 FS_CAP(flow_table_properties_nic_transmit_rdma.flow_modify_en), \
93 FS_CAP(flow_table_properties_nic_transmit_rdma.modify_root), \
94 FS_CAP(flow_table_properties_nic_transmit_rdma \
95 .identified_miss_table_mode), \
96 FS_CAP(flow_table_properties_nic_transmit_rdma \
97 .flow_table_modify))
98
a257b94a 99#define LEFTOVERS_NUM_LEVELS 1
4cbdd30e 100#define LEFTOVERS_NUM_PRIOS 1
4cbdd30e 101
a257b94a 102#define BY_PASS_PRIO_NUM_LEVELS 1
6dc6071c 103#define BY_PASS_MIN_LEVEL (ETHTOOL_MIN_LEVEL + MLX5_BY_PASS_NUM_PRIOS +\
a257b94a
MG		 104 LEFTOVERS_NUM_PRIOS)
105
6dc6071c 106#define ETHTOOL_PRIO_NUM_LEVELS 1
e5835f28 107#define ETHTOOL_NUM_PRIOS 11
6dc6071c 108#define ETHTOOL_MIN_LEVEL (KERNEL_MIN_LEVEL + ETHTOOL_NUM_PRIOS)
0f575c20 109/* Promiscuous, Vlan, mac, ttc, inner ttc, {UDP/ANY/aRFS/accel/{esp, esp_err}} */
1c46d740 110#define KERNEL_NIC_PRIO_NUM_LEVELS 7
13de6c10
MG		 111#define KERNEL_NIC_NUM_PRIOS 1
112/* One more level for tc */
113#define KERNEL_MIN_LEVEL (KERNEL_NIC_PRIO_NUM_LEVELS + 1)
8d40d162 114
479f074c
OG		 115#define KERNEL_NIC_TC_NUM_PRIOS 1
116#define KERNEL_NIC_TC_NUM_LEVELS 2
117
a257b94a 118#define ANCHOR_NUM_LEVELS 1
153fefbf
MG		 119#define ANCHOR_NUM_PRIOS 1
120#define ANCHOR_MIN_LEVEL (BY_PASS_MIN_LEVEL + 1)
acbc2004 121
20f7b37f 122#define OFFLOADS_MAX_FT 2
11b717d6
PB		 123#define OFFLOADS_NUM_PRIOS 2
124#define OFFLOADS_MIN_LEVEL (ANCHOR_MIN_LEVEL + OFFLOADS_NUM_PRIOS)
acbc2004 125
3e75d4eb
AH		 126#define LAG_PRIO_NUM_LEVELS 1
127#define LAG_NUM_PRIOS 1
128#define LAG_MIN_LEVEL (OFFLOADS_MIN_LEVEL + 1)
129
ee92e4f1
HN		 130#define KERNEL_TX_IPSEC_NUM_PRIOS 1
131#define KERNEL_TX_IPSEC_NUM_LEVELS 1
132#define KERNEL_TX_MIN_LEVEL (KERNEL_TX_IPSEC_NUM_LEVELS)
133
8d40d162
MG		 134struct node_caps {
135 size_t arr_sz;
136 long *caps;
137};
8963ca45 138
25302363
MG		 139static struct init_tree_node {
140 enum fs_node_type type;
141 struct init_tree_node *children;
142 int ar_size;
8d40d162 143 struct node_caps caps;
25302363 144 int min_ft_level;
4cbdd30e 145 int num_leaf_prios;
25302363 146 int prio;
a257b94a 147 int num_levels;
f66ad830 148 enum mlx5_flow_table_miss_action def_miss_action;
25302363
MG		 149} root_fs = {
150 .type = FS_TYPE_NAMESPACE,
3e75d4eb 151 .ar_size = 7,
f66ad830
MZ		 152 .children = (struct init_tree_node[]){
153 ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0, FS_CHAINING_CAPS,
154 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
155 ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_PRIOS,
156 BY_PASS_PRIO_NUM_LEVELS))),
157 ADD_PRIO(0, LAG_MIN_LEVEL, 0, FS_CHAINING_CAPS,
158 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
159 ADD_MULTIPLE_PRIO(LAG_NUM_PRIOS,
160 LAG_PRIO_NUM_LEVELS))),
20f7b37f 161 ADD_PRIO(0, OFFLOADS_MIN_LEVEL, 0, FS_CHAINING_CAPS,
f66ad830
MZ		 162 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
163 ADD_MULTIPLE_PRIO(OFFLOADS_NUM_PRIOS,
164 OFFLOADS_MAX_FT))),
165 ADD_PRIO(0, ETHTOOL_MIN_LEVEL, 0, FS_CHAINING_CAPS,
166 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
167 ADD_MULTIPLE_PRIO(ETHTOOL_NUM_PRIOS,
168 ETHTOOL_PRIO_NUM_LEVELS))),
169 ADD_PRIO(0, KERNEL_MIN_LEVEL, 0, {},
170 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
171 ADD_MULTIPLE_PRIO(KERNEL_NIC_TC_NUM_PRIOS,
172 KERNEL_NIC_TC_NUM_LEVELS),
173 ADD_MULTIPLE_PRIO(KERNEL_NIC_NUM_PRIOS,
174 KERNEL_NIC_PRIO_NUM_LEVELS))),
175 ADD_PRIO(0, BY_PASS_MIN_LEVEL, 0, FS_CHAINING_CAPS,
176 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
177 ADD_MULTIPLE_PRIO(LEFTOVERS_NUM_PRIOS,
178 LEFTOVERS_NUM_LEVELS))),
179 ADD_PRIO(0, ANCHOR_MIN_LEVEL, 0, {},
180 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
181 ADD_MULTIPLE_PRIO(ANCHOR_NUM_PRIOS,
182 ANCHOR_NUM_LEVELS))),
25302363
MG		 183 }
184};
185
8ce78257
MB		 186static struct init_tree_node egress_root_fs = {
187 .type = FS_TYPE_NAMESPACE,
ee92e4f1
HN		 188#ifdef CONFIG_MLX5_IPSEC
189 .ar_size = 2,
190#else
8ce78257 191 .ar_size = 1,
ee92e4f1 192#endif
8ce78257
MB		 193 .children = (struct init_tree_node[]) {
194 ADD_PRIO(0, MLX5_BY_PASS_NUM_PRIOS, 0,
195 FS_CHAINING_CAPS_EGRESS,
f66ad830
MZ		 196 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
197 ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_PRIOS,
8ce78257 198 BY_PASS_PRIO_NUM_LEVELS))),
ee92e4f1
HN		 199#ifdef CONFIG_MLX5_IPSEC
200 ADD_PRIO(0, KERNEL_TX_MIN_LEVEL, 0,
201 FS_CHAINING_CAPS_EGRESS,
202 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
203 ADD_MULTIPLE_PRIO(KERNEL_TX_IPSEC_NUM_PRIOS,
204 KERNEL_TX_IPSEC_NUM_LEVELS))),
205#endif
8ce78257
MB		 206 }
207};
208
e6806e9a
MZ		 209#define RDMA_RX_BYPASS_PRIO 0
210#define RDMA_RX_KERNEL_PRIO 1
211static struct init_tree_node rdma_rx_root_fs = {
212 .type = FS_TYPE_NAMESPACE,
213 .ar_size = 2,
214 .children = (struct init_tree_node[]) {
215 [RDMA_RX_BYPASS_PRIO] =
216 ADD_PRIO(0, MLX5_BY_PASS_NUM_REGULAR_PRIOS, 0,
217 FS_CHAINING_CAPS,
218 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
219 ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_REGULAR_PRIOS,
220 BY_PASS_PRIO_NUM_LEVELS))),
221 [RDMA_RX_KERNEL_PRIO] =
222 ADD_PRIO(0, MLX5_BY_PASS_NUM_REGULAR_PRIOS + 1, 0,
223 FS_CHAINING_CAPS,
224 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_SWITCH_DOMAIN,
225 ADD_MULTIPLE_PRIO(1, 1))),
226 }
227};
228
24670b1a
MG		 229static struct init_tree_node rdma_tx_root_fs = {
230 .type = FS_TYPE_NAMESPACE,
231 .ar_size = 1,
232 .children = (struct init_tree_node[]) {
233 ADD_PRIO(0, MLX5_BY_PASS_NUM_PRIOS, 0,
234 FS_CHAINING_CAPS_RDMA_TX,
235 ADD_NS(MLX5_FLOW_TABLE_MISS_ACTION_DEF,
236 ADD_MULTIPLE_PRIO(MLX5_BY_PASS_NUM_PRIOS,
237 BY_PASS_PRIO_NUM_LEVELS))),
238 }
239};
240
c7784b1c
MG		 241enum fs_i_lock_class {
242 FS_LOCK_GRANDPARENT,
243 FS_LOCK_PARENT,
244 FS_LOCK_CHILD
f0d22d18
MG		 245};
246
0d235c3f 247static const struct rhashtable_params rhash_fte = {
c593642c 248 .key_len = sizeof_field(struct fs_fte, val),
0d235c3f
MB		 249 .key_offset = offsetof(struct fs_fte, val),
250 .head_offset = offsetof(struct fs_fte, hash),
251 .automatic_shrinking = true,
252 .min_size = 1,
253};
254
693c6883 255static const struct rhashtable_params rhash_fg = {
c593642c 256 .key_len = sizeof_field(struct mlx5_flow_group, mask),
693c6883
MB		 257 .key_offset = offsetof(struct mlx5_flow_group, mask),
258 .head_offset = offsetof(struct mlx5_flow_group, hash),
259 .automatic_shrinking = true,
260 .min_size = 1,
261
262};
263
bd71b08e
MG		 264static void del_hw_flow_table(struct fs_node *node);
265static void del_hw_flow_group(struct fs_node *node);
266static void del_hw_fte(struct fs_node *node);
267static void del_sw_flow_table(struct fs_node *node);
268static void del_sw_flow_group(struct fs_node *node);
269static void del_sw_fte(struct fs_node *node);
139ed6c6
MG		 270static void del_sw_prio(struct fs_node *node);
271static void del_sw_ns(struct fs_node *node);
14c129e3 272/* Delete rule (destination) is special case that
bd71b08e
MG		 273 * requires to lock the FTE for all the deletion process.
274 */
275static void del_sw_hw_rule(struct fs_node *node);
814fb875
MB		 276static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
277 struct mlx5_flow_destination *d2);
9c26f5f8 278static void cleanup_root_ns(struct mlx5_flow_root_namespace *root_ns);
74491de9
MB		 279static struct mlx5_flow_rule *
280find_flow_rule(struct fs_fte *fte,
281 struct mlx5_flow_destination *dest);
de8575e0
MG		 282
283static void tree_init_node(struct fs_node *node,
bd71b08e
MG		 284 void (*del_hw_func)(struct fs_node *),
285 void (*del_sw_func)(struct fs_node *))
de8575e0 286{
dd8e1945 287 refcount_set(&node->refcount, 1);
de8575e0
MG		 288 INIT_LIST_HEAD(&node->list);
289 INIT_LIST_HEAD(&node->children);
c7784b1c 290 init_rwsem(&node->lock);
bd71b08e
MG		 291 node->del_hw_func = del_hw_func;
292 node->del_sw_func = del_sw_func;
19f100fe 293 node->active = false;
de8575e0
MG		 294}
295
296static void tree_add_node(struct fs_node *node, struct fs_node *parent)
297{
298 if (parent)
dd8e1945 299 refcount_inc(&parent->refcount);
de8575e0
MG		 300 node->parent = parent;
301
302 /* Parent is the root */
303 if (!parent)
304 node->root = node;
305 else
306 node->root = parent->root;
307}
308
bd71b08e 309static int tree_get_node(struct fs_node *node)
de8575e0 310{
dd8e1945 311 return refcount_inc_not_zero(&node->refcount);
de8575e0
MG		 312}
313
bd71b08e
MG		 314static void nested_down_read_ref_node(struct fs_node *node,
315 enum fs_i_lock_class class)
de8575e0
MG		 316{
317 if (node) {
bd71b08e 318 down_read_nested(&node->lock, class);
dd8e1945 319 refcount_inc(&node->refcount);
de8575e0
MG		 320 }
321}
322
bd71b08e
MG		 323static void nested_down_write_ref_node(struct fs_node *node,
324 enum fs_i_lock_class class)
de8575e0
MG		 325{
326 if (node) {
bd71b08e 327 down_write_nested(&node->lock, class);
dd8e1945 328 refcount_inc(&node->refcount);
de8575e0
MG		 329 }
330}
331
476d61b7 332static void down_write_ref_node(struct fs_node *node, bool locked)
de8575e0
MG		 333{
334 if (node) {
476d61b7
EB		 335 if (!locked)
336 down_write(&node->lock);
dd8e1945 337 refcount_inc(&node->refcount);
de8575e0
MG		 338 }
339}
340
bd71b08e
MG		 341static void up_read_ref_node(struct fs_node *node)
342{
dd8e1945 343 refcount_dec(&node->refcount);
bd71b08e
MG		 344 up_read(&node->lock);
345}
346
476d61b7 347static void up_write_ref_node(struct fs_node *node, bool locked)
bd71b08e 348{
dd8e1945 349 refcount_dec(&node->refcount);
476d61b7
EB		 350 if (!locked)
351 up_write(&node->lock);
bd71b08e
MG		 352}
353
476d61b7 354static void tree_put_node(struct fs_node *node, bool locked)
de8575e0
MG		 355{
356 struct fs_node *parent_node = node->parent;
357
dd8e1945 358 if (refcount_dec_and_test(&node->refcount)) {
bd71b08e
MG		 359 if (node->del_hw_func)
360 node->del_hw_func(node);
361 if (parent_node) {
476d61b7 362 down_write_ref_node(parent_node, locked);
de8575e0 363 list_del_init(&node->list);
bd71b08e 364 }
6eb7a268
RD		 365 node->del_sw_func(node);
366 if (parent_node)
367 up_write_ref_node(parent_node, locked);
de8575e0
MG		 368 node = NULL;
369 }
de8575e0 370 if (!node && parent_node)
476d61b7 371 tree_put_node(parent_node, locked);
de8575e0
MG		 372}
373
476d61b7 374static int tree_remove_node(struct fs_node *node, bool locked)
de8575e0 375{
dd8e1945
ER		 376 if (refcount_read(&node->refcount) > 1) {
377 refcount_dec(&node->refcount);
b3638e1a
MG		 378 return -EEXIST;
379 }
476d61b7 380 tree_put_node(node, locked);
de8575e0
MG		 381 return 0;
382}
5e1626c0
MG		 383
384static struct fs_prio *find_prio(struct mlx5_flow_namespace *ns,
385 unsigned int prio)
386{
387 struct fs_prio *iter_prio;
388
389 fs_for_each_prio(iter_prio, ns) {
390 if (iter_prio->prio == prio)
391 return iter_prio;
392 }
393
394 return NULL;
395}
396
9254f8ed
MG		 397static bool is_fwd_next_action(u32 action)
398{
399 return action & (MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO |
400 MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_NS);
401}
402
693c6883 403static bool check_valid_spec(const struct mlx5_flow_spec *spec)
5e1626c0 404{
693c6883
MB		 405 int i;
406
693c6883
MB		 407 for (i = 0; i < MLX5_ST_SZ_DW_MATCH_PARAM; i++)
408 if (spec->match_value[i] & ~spec->match_criteria[i]) {
409 pr_warn("mlx5_core: match_value differs from match_criteria\n");
410 return false;
411 }
412
2aada6c0 413 return true;
5e1626c0 414}
0c56b975
MG		 415
416static struct mlx5_flow_root_namespace *find_root(struct fs_node *node)
417{
418 struct fs_node *root;
419 struct mlx5_flow_namespace *ns;
420
421 root = node->root;
422
423 if (WARN_ON(root->type != FS_TYPE_NAMESPACE)) {
424 pr_warn("mlx5: flow steering node is not in tree or garbaged\n");
425 return NULL;
426 }
427
428 ns = container_of(root, struct mlx5_flow_namespace, node);
429 return container_of(ns, struct mlx5_flow_root_namespace, ns);
430}
431
a369d4ac
MG		 432static inline struct mlx5_flow_steering *get_steering(struct fs_node *node)
433{
434 struct mlx5_flow_root_namespace *root = find_root(node);
435
436 if (root)
437 return root->dev->priv.steering;
438 return NULL;
439}
440
0c56b975
MG		 441static inline struct mlx5_core_dev *get_dev(struct fs_node *node)
442{
443 struct mlx5_flow_root_namespace *root = find_root(node);
444
445 if (root)
446 return root->dev;
447 return NULL;
448}
449
139ed6c6
MG		 450static void del_sw_ns(struct fs_node *node)
451{
452 kfree(node);
453}
454
455static void del_sw_prio(struct fs_node *node)
456{
457 kfree(node);
458}
459
bd71b08e 460static void del_hw_flow_table(struct fs_node *node)
0c56b975 461{
af76c501 462 struct mlx5_flow_root_namespace *root;
0c56b975
MG		 463 struct mlx5_flow_table *ft;
464 struct mlx5_core_dev *dev;
0c56b975
MG		 465 int err;
466
467 fs_get_obj(ft, node);
468 dev = get_dev(&ft->node);
af76c501 469 root = find_root(&ft->node);
8e4ca986 470 trace_mlx5_fs_del_ft(ft);
0c56b975 471
19f100fe 472 if (node->active) {
ae288a48 473 err = root->cmds->destroy_flow_table(root, ft);
19f100fe
MG		 474 if (err)
475 mlx5_core_warn(dev, "flow steering can't destroy ft\n");
476 }
bd71b08e
MG		 477}
478
479static void del_sw_flow_table(struct fs_node *node)
480{
481 struct mlx5_flow_table *ft;
482 struct fs_prio *prio;
483
484 fs_get_obj(ft, node);
485
693c6883 486 rhltable_destroy(&ft->fgs_hash);
aee37f3d
RD		 487 if (ft->node.parent) {
488 fs_get_obj(prio, ft->node.parent);
489 prio->num_ft--;
490 }
a369d4ac 491 kfree(ft);
0c56b975
MG		 492}
493
e7aafc8f 494static void modify_fte(struct fs_fte *fte)
0c56b975 495{
af76c501 496 struct mlx5_flow_root_namespace *root;
0c56b975
MG		 497 struct mlx5_flow_table *ft;
498 struct mlx5_flow_group *fg;
e7aafc8f 499 struct mlx5_core_dev *dev;
0c56b975
MG		 500 int err;
501
0c56b975 502 fs_get_obj(fg, fte->node.parent);
0c56b975 503 fs_get_obj(ft, fg->node.parent);
e7aafc8f
EB		 504 dev = get_dev(&fte->node);
505
506 root = find_root(&ft->node);
ae288a48 507 err = root->cmds->update_fte(root, ft, fg, fte->modify_mask, fte);
e7aafc8f
EB		 508 if (err)
509 mlx5_core_warn(dev,
510 "%s can't del rule fg id=%d fte_index=%d\n",
511 __func__, fg->id, fte->index);
512 fte->modify_mask = 0;
513}
514
515static void del_sw_hw_rule(struct fs_node *node)
516{
517 struct mlx5_flow_rule *rule;
518 struct fs_fte *fte;
519
520 fs_get_obj(rule, node);
521 fs_get_obj(fte, rule->node.parent);
4c03e69a 522 trace_mlx5_fs_del_rule(rule);
9254f8ed 523 if (is_fwd_next_action(rule->sw_action)) {
b3638e1a
MG		 524 mutex_lock(&rule->dest_attr.ft->lock);
525 list_del(&rule->next_ft);
526 mutex_unlock(&rule->dest_attr.ft->lock);
527 }
ae058314
MB		 528
529 if (rule->dest_attr.type == MLX5_FLOW_DESTINATION_TYPE_COUNTER &&
530 --fte->dests_size) {
e7aafc8f
EB		 531 fte->modify_mask |=
532 BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION) |
533 BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_FLOW_COUNTERS);
d2ec6a35 534 fte->action.action &= ~MLX5_FLOW_CONTEXT_ACTION_COUNT;
ae058314
MB		 535 goto out;
536 }
537
8cbcc5ef
MG		 538 if (rule->dest_attr.type == MLX5_FLOW_DESTINATION_TYPE_PORT &&
539 --fte->dests_size) {
540 fte->modify_mask |= BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION);
541 fte->action.action &= ~MLX5_FLOW_CONTEXT_ACTION_ALLOW;
542 goto out;
543 }
544
d2ec6a35 545 if ((fte->action.action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST) &&
60ab4584 546 --fte->dests_size) {
e7aafc8f
EB		 547 fte->modify_mask |=
548 BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
ae058314
MB		 549 }
550out:
a369d4ac 551 kfree(rule);
0c56b975
MG		 552}
553
bd71b08e 554static void del_hw_fte(struct fs_node *node)
0c56b975 555{
af76c501 556 struct mlx5_flow_root_namespace *root;
0c56b975
MG		 557 struct mlx5_flow_table *ft;
558 struct mlx5_flow_group *fg;
559 struct mlx5_core_dev *dev;
560 struct fs_fte *fte;
561 int err;
562
563 fs_get_obj(fte, node);
564 fs_get_obj(fg, fte->node.parent);
565 fs_get_obj(ft, fg->node.parent);
566
bd71b08e 567 trace_mlx5_fs_del_fte(fte);
0c56b975 568 dev = get_dev(&ft->node);
af76c501 569 root = find_root(&ft->node);
19f100fe 570 if (node->active) {
ae288a48 571 err = root->cmds->delete_fte(root, ft, fte);
19f100fe
MG		 572 if (err)
573 mlx5_core_warn(dev,
574 "flow steering can't delete fte in index %d of flow group id %d\n",
575 fte->index, fg->id);
79398543 576 node->active = false;
19f100fe 577 }
bd71b08e
MG		 578}
579
580static void del_sw_fte(struct fs_node *node)
581{
1f0593e7 582 struct mlx5_flow_steering *steering = get_steering(node);
bd71b08e
MG		 583 struct mlx5_flow_group *fg;
584 struct fs_fte *fte;
585 int err;
586
587 fs_get_obj(fte, node);
588 fs_get_obj(fg, fte->node.parent);
0c56b975 589
19f100fe
MG		 590 err = rhashtable_remove_fast(&fg->ftes_hash,
591 &fte->hash,
592 rhash_fte);
593 WARN_ON(err);
8802b8a4 594 ida_free(&fg->fte_allocator, fte->index - fg->start_index);
1f0593e7 595 kmem_cache_free(steering->ftes_cache, fte);
0c56b975
MG		 596}
597
bd71b08e 598static void del_hw_flow_group(struct fs_node *node)
0c56b975 599{
af76c501 600 struct mlx5_flow_root_namespace *root;
0c56b975
MG		 601 struct mlx5_flow_group *fg;
602 struct mlx5_flow_table *ft;
603 struct mlx5_core_dev *dev;
604
605 fs_get_obj(fg, node);
606 fs_get_obj(ft, fg->node.parent);
607 dev = get_dev(&ft->node);
4c03e69a 608 trace_mlx5_fs_del_fg(fg);
0c56b975 609
af76c501 610 root = find_root(&ft->node);
ae288a48 611 if (fg->node.active && root->cmds->destroy_flow_group(root, ft, fg))
bd71b08e
MG		 612 mlx5_core_warn(dev, "flow steering can't destroy fg %d of ft %d\n",
613 fg->id, ft->id);
614}
615
616static void del_sw_flow_group(struct fs_node *node)
617{
a369d4ac 618 struct mlx5_flow_steering *steering = get_steering(node);
bd71b08e
MG		 619 struct mlx5_flow_group *fg;
620 struct mlx5_flow_table *ft;
621 int err;
622
623 fs_get_obj(fg, node);
624 fs_get_obj(ft, fg->node.parent);
32dba76a 625
0d235c3f 626 rhashtable_destroy(&fg->ftes_hash);
75d1d187 627 ida_destroy(&fg->fte_allocator);
79cdb0aa
PB		 628 if (ft->autogroup.active &&
629 fg->max_ftes == ft->autogroup.group_size &&
630 fg->start_index < ft->autogroup.max_fte)
bd71b08e 631 ft->autogroup.num_groups--;
693c6883
MB		 632 err = rhltable_remove(&ft->fgs_hash,
633 &fg->hash,
634 rhash_fg);
635 WARN_ON(err);
a369d4ac 636 kmem_cache_free(steering->fgs_cache, fg);
0c56b975
MG		 637}
638
f5c2ff17
MG		 639static int insert_fte(struct mlx5_flow_group *fg, struct fs_fte *fte)
640{
641 int index;
642 int ret;
643
8802b8a4 644 index = ida_alloc_max(&fg->fte_allocator, fg->max_ftes - 1, GFP_KERNEL);
f5c2ff17
MG		 645 if (index < 0)
646 return index;
647
648 fte->index = index + fg->start_index;
649 ret = rhashtable_insert_fast(&fg->ftes_hash,
650 &fte->hash,
651 rhash_fte);
652 if (ret)
653 goto err_ida_remove;
654
655 tree_add_node(&fte->node, &fg->node);
656 list_add_tail(&fte->node.list, &fg->node.children);
657 return 0;
658
659err_ida_remove:
8802b8a4 660 ida_free(&fg->fte_allocator, index);
f5c2ff17
MG		 661 return ret;
662}
663
a369d4ac 664static struct fs_fte *alloc_fte(struct mlx5_flow_table *ft,
5233794b 665 const struct mlx5_flow_spec *spec,
f5c2ff17 666 struct mlx5_flow_act *flow_act)
0c56b975 667{
a369d4ac 668 struct mlx5_flow_steering *steering = get_steering(&ft->node);
0c56b975
MG		 669 struct fs_fte *fte;
670
a369d4ac 671 fte = kmem_cache_zalloc(steering->ftes_cache, GFP_KERNEL);
0c56b975
MG		 672 if (!fte)
673 return ERR_PTR(-ENOMEM);
674
bb0ee7dc 675 memcpy(fte->val, &spec->match_value, sizeof(fte->val));
0c56b975 676 fte->node.type = FS_TYPE_FLOW_ENTRY;
d2ec6a35 677 fte->action = *flow_act;
bb0ee7dc 678 fte->flow_context = spec->flow_context;
0c56b975 679
cefc2355 680 tree_init_node(&fte->node, del_hw_fte, del_sw_fte);
19f100fe
MG		 681
682 return fte;
19f100fe
MG		 683}
684
a369d4ac
MG		 685static void dealloc_flow_group(struct mlx5_flow_steering *steering,
686 struct mlx5_flow_group *fg)
19f100fe
MG		 687{
688 rhashtable_destroy(&fg->ftes_hash);
a369d4ac 689 kmem_cache_free(steering->fgs_cache, fg);
19f100fe
MG		 690}
691
a369d4ac
MG		 692static struct mlx5_flow_group *alloc_flow_group(struct mlx5_flow_steering *steering,
693 u8 match_criteria_enable,
5233794b 694 const void *match_criteria,
19f100fe
MG		 695 int start_index,
696 int end_index)
0c56b975
MG		 697{
698 struct mlx5_flow_group *fg;
0d235c3f
MB		 699 int ret;
700
a369d4ac 701 fg = kmem_cache_zalloc(steering->fgs_cache, GFP_KERNEL);
0c56b975
MG		 702 if (!fg)
703 return ERR_PTR(-ENOMEM);
704
0d235c3f
MB		 705 ret = rhashtable_init(&fg->ftes_hash, &rhash_fte);
706 if (ret) {
a369d4ac 707 kmem_cache_free(steering->fgs_cache, fg);
0d235c3f 708 return ERR_PTR(ret);
fc9c5a4a
TZ		 709 }
710
75d1d187 711 ida_init(&fg->fte_allocator);
0c56b975
MG		 712 fg->mask.match_criteria_enable = match_criteria_enable;
713 memcpy(&fg->mask.match_criteria, match_criteria,
714 sizeof(fg->mask.match_criteria));
715 fg->node.type = FS_TYPE_FLOW_GROUP;
19f100fe
MG		 716 fg->start_index = start_index;
717 fg->max_ftes = end_index - start_index + 1;
718
719 return fg;
720}
721
722static struct mlx5_flow_group *alloc_insert_flow_group(struct mlx5_flow_table *ft,
723 u8 match_criteria_enable,
5233794b 724 const void *match_criteria,
19f100fe
MG		 725 int start_index,
726 int end_index,
727 struct list_head *prev)
728{
a369d4ac 729 struct mlx5_flow_steering *steering = get_steering(&ft->node);
19f100fe
MG		 730 struct mlx5_flow_group *fg;
731 int ret;
732
a369d4ac 733 fg = alloc_flow_group(steering, match_criteria_enable, match_criteria,
19f100fe
MG		 734 start_index, end_index);
735 if (IS_ERR(fg))
736 return fg;
737
738 /* initialize refcnt, add to parent list */
739 ret = rhltable_insert(&ft->fgs_hash,
740 &fg->hash,
741 rhash_fg);
742 if (ret) {
a369d4ac 743 dealloc_flow_group(steering, fg);
19f100fe
MG		 744 return ERR_PTR(ret);
745 }
746
bd71b08e 747 tree_init_node(&fg->node, del_hw_flow_group, del_sw_flow_group);
19f100fe
MG		 748 tree_add_node(&fg->node, &ft->node);
749 /* Add node to group list */
750 list_add(&fg->node.list, prev);
bd71b08e 751 atomic_inc(&ft->node.version);
19f100fe 752
0c56b975
MG		 753 return fg;
754}
755
04745afb 756static struct mlx5_flow_table *alloc_flow_table(int level, u16 vport,
aaff1bea 757 enum fs_flow_table_type table_type,
c9f1b073
HHZ		 758 enum fs_flow_table_op_mod op_mod,
759 u32 flags)
0c56b975
MG		 760{
761 struct mlx5_flow_table *ft;
693c6883 762 int ret;
0c56b975
MG		 763
764 ft = kzalloc(sizeof(*ft), GFP_KERNEL);
765 if (!ft)
693c6883
MB		 766 return ERR_PTR(-ENOMEM);
767
768 ret = rhltable_init(&ft->fgs_hash, &rhash_fg);
769 if (ret) {
770 kfree(ft);
771 return ERR_PTR(ret);
772 }
0c56b975
MG		 773
774 ft->level = level;
775 ft->node.type = FS_TYPE_FLOW_TABLE;
aaff1bea 776 ft->op_mod = op_mod;
0c56b975 777 ft->type = table_type;
efdc810b 778 ft->vport = vport;
c9f1b073 779 ft->flags = flags;
b3638e1a
MG		 780 INIT_LIST_HEAD(&ft->fwd_rules);
781 mutex_init(&ft->lock);
0c56b975
MG		 782
783 return ft;
784}
785
fdb6896f
MG		 786/* If reverse is false, then we search for the first flow table in the
787 * root sub-tree from start(closest from right), else we search for the
788 * last flow table in the root sub-tree till start(closest from left).
789 */
790static struct mlx5_flow_table *find_closest_ft_recursive(struct fs_node *root,
791 struct list_head *start,
792 bool reverse)
793{
794#define list_advance_entry(pos, reverse) \
795 ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))
796
797#define list_for_each_advance_continue(pos, head, reverse) \
798 for (pos = list_advance_entry(pos, reverse); \
799 &pos->list != (head); \
800 pos = list_advance_entry(pos, reverse))
801
802 struct fs_node *iter = list_entry(start, struct fs_node, list);
803 struct mlx5_flow_table *ft = NULL;
804
328edb49 805 if (!root || root->type == FS_TYPE_PRIO_CHAINS)
fdb6896f
MG		 806 return NULL;
807
808 list_for_each_advance_continue(iter, &root->children, reverse) {
809 if (iter->type == FS_TYPE_FLOW_TABLE) {
810 fs_get_obj(ft, iter);
811 return ft;
812 }
813 ft = find_closest_ft_recursive(iter, &iter->children, reverse);
814 if (ft)
815 return ft;
816 }
817
818 return ft;
819}
820
59f8f7c8 821/* If reverse is false then return the first flow table in next priority of
fdb6896f
MG		 822 * prio in the tree, else return the last flow table in the previous priority
823 * of prio in the tree.
824 */
825static struct mlx5_flow_table *find_closest_ft(struct fs_prio *prio, bool reverse)
826{
827 struct mlx5_flow_table *ft = NULL;
828 struct fs_node *curr_node;
829 struct fs_node *parent;
830
831 parent = prio->node.parent;
832 curr_node = &prio->node;
833 while (!ft && parent) {
834 ft = find_closest_ft_recursive(parent, &curr_node->list, reverse);
835 curr_node = parent;
836 parent = curr_node->parent;
837 }
838 return ft;
839}
840
841/* Assuming all the tree is locked by mutex chain lock */
842static struct mlx5_flow_table *find_next_chained_ft(struct fs_prio *prio)
843{
844 return find_closest_ft(prio, false);
845}
846
847/* Assuming all the tree is locked by mutex chain lock */
848static struct mlx5_flow_table *find_prev_chained_ft(struct fs_prio *prio)
849{
850 return find_closest_ft(prio, true);
851}
852
9254f8ed
MG		 853static struct mlx5_flow_table *find_next_fwd_ft(struct mlx5_flow_table *ft,
854 struct mlx5_flow_act *flow_act)
855{
9254f8ed 856 struct fs_prio *prio;
59f8f7c8 857 bool next_ns;
9254f8ed 858
59f8f7c8
MG		 859 next_ns = flow_act->action & MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_NS;
860 fs_get_obj(prio, next_ns ? ft->ns->node.parent : ft->node.parent);
9254f8ed 861
59f8f7c8 862 return find_next_chained_ft(prio);
9254f8ed
MG		 863}
864
f90edfd2
MG		 865static int connect_fts_in_prio(struct mlx5_core_dev *dev,
866 struct fs_prio *prio,
867 struct mlx5_flow_table *ft)
868{
af76c501 869 struct mlx5_flow_root_namespace *root = find_root(&prio->node);
f90edfd2 870 struct mlx5_flow_table *iter;
f90edfd2
MG		 871 int err;
872
873 fs_for_each_ft(iter, prio) {
ae288a48 874 err = root->cmds->modify_flow_table(root, iter, ft);
f90edfd2 875 if (err) {
6c4e9bcf
LR		 876 mlx5_core_err(dev,
877 "Failed to modify flow table id %d, type %d, err %d\n",
878 iter->id, iter->type, err);
f90edfd2 879 /* The driver is out of sync with the FW */
f90edfd2
MG		 880 return err;
881 }
882 }
883 return 0;
884}
885
886/* Connect flow tables from previous priority of prio to ft */
887static int connect_prev_fts(struct mlx5_core_dev *dev,
888 struct mlx5_flow_table *ft,
889 struct fs_prio *prio)
890{
891 struct mlx5_flow_table *prev_ft;
892
893 prev_ft = find_prev_chained_ft(prio);
894 if (prev_ft) {
895 struct fs_prio *prev_prio;
896
897 fs_get_obj(prev_prio, prev_ft->node.parent);
898 return connect_fts_in_prio(dev, prev_prio, ft);
899 }
900 return 0;
901}
902
2cc43b49
MG		 903static int update_root_ft_create(struct mlx5_flow_table *ft, struct fs_prio
904 *prio)
905{
906 struct mlx5_flow_root_namespace *root = find_root(&prio->node);
dae37456 907 struct mlx5_ft_underlay_qp *uqp;
2cc43b49 908 int min_level = INT_MAX;
aef6c443 909 int err = 0;
dae37456 910 u32 qpn;
2cc43b49
MG		 911
912 if (root->root_ft)
913 min_level = root->root_ft->level;
914
915 if (ft->level >= min_level)
916 return 0;
917
dae37456
AV		 918 if (list_empty(&root->underlay_qpns)) {
919 /* Don't set any QPN (zero) in case QPN list is empty */
920 qpn = 0;
ae288a48 921 err = root->cmds->update_root_ft(root, ft, qpn, false);
dae37456
AV		 922 } else {
923 list_for_each_entry(uqp, &root->underlay_qpns, list) {
924 qpn = uqp->qpn;
ae288a48 925 err = root->cmds->update_root_ft(root, ft,
af76c501 926 qpn, false);
dae37456
AV		 927 if (err)
928 break;
929 }
930 }
931
2cc43b49 932 if (err)
dae37456
AV		 933 mlx5_core_warn(root->dev,
934 "Update root flow table of id(%u) qpn(%d) failed\n",
935 ft->id, qpn);
2cc43b49
MG		 936 else
937 root->root_ft = ft;
938
939 return err;
940}
941
74491de9
MB		 942static int _mlx5_modify_rule_destination(struct mlx5_flow_rule *rule,
943 struct mlx5_flow_destination *dest)
b3638e1a 944{
af76c501 945 struct mlx5_flow_root_namespace *root;
b3638e1a
MG		 946 struct mlx5_flow_table *ft;
947 struct mlx5_flow_group *fg;
948 struct fs_fte *fte;
bd5251db 949 int modify_mask = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
b3638e1a
MG		 950 int err = 0;
951
952 fs_get_obj(fte, rule->node.parent);
d2ec6a35 953 if (!(fte->action.action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
b3638e1a 954 return -EINVAL;
476d61b7 955 down_write_ref_node(&fte->node, false);
b3638e1a
MG		 956 fs_get_obj(fg, fte->node.parent);
957 fs_get_obj(ft, fg->node.parent);
958
959 memcpy(&rule->dest_attr, dest, sizeof(*dest));
af76c501 960 root = find_root(&ft->node);
ae288a48 961 err = root->cmds->update_fte(root, ft, fg,
af76c501 962 modify_mask, fte);
476d61b7 963 up_write_ref_node(&fte->node, false);
b3638e1a
MG		 964
965 return err;
966}
967
74491de9
MB		 968int mlx5_modify_rule_destination(struct mlx5_flow_handle *handle,
969 struct mlx5_flow_destination *new_dest,
970 struct mlx5_flow_destination *old_dest)
971{
972 int i;
973
974 if (!old_dest) {
975 if (handle->num_rules != 1)
976 return -EINVAL;
977 return _mlx5_modify_rule_destination(handle->rule[0],
978 new_dest);
979 }
980
981 for (i = 0; i < handle->num_rules; i++) {
982 if (mlx5_flow_dests_cmp(new_dest, &handle->rule[i]->dest_attr))
983 return _mlx5_modify_rule_destination(handle->rule[i],
984 new_dest);
985 }
986
987 return -EINVAL;
988}
989
b3638e1a
MG		 990/* Modify/set FWD rules that point on old_next_ft to point on new_next_ft */
991static int connect_fwd_rules(struct mlx5_core_dev *dev,
992 struct mlx5_flow_table *new_next_ft,
993 struct mlx5_flow_table *old_next_ft)
994{
4c5009c5 995 struct mlx5_flow_destination dest = {};
b3638e1a
MG		 996 struct mlx5_flow_rule *iter;
997 int err = 0;
998
999 /* new_next_ft and old_next_ft could be NULL only
1000 * when we create/destroy the anchor flow table.
1001 */
1002 if (!new_next_ft || !old_next_ft)
1003 return 0;
1004
1005 dest.type = MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
1006 dest.ft = new_next_ft;
1007
1008 mutex_lock(&old_next_ft->lock);
1009 list_splice_init(&old_next_ft->fwd_rules, &new_next_ft->fwd_rules);
1010 mutex_unlock(&old_next_ft->lock);
1011 list_for_each_entry(iter, &new_next_ft->fwd_rules, next_ft) {
9254f8ed
MG		 1012 if ((iter->sw_action & MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_NS) &&
1013 iter->ft->ns == new_next_ft->ns)
1014 continue;
1015
74491de9 1016 err = _mlx5_modify_rule_destination(iter, &dest);
b3638e1a
MG		 1017 if (err)
1018 pr_err("mlx5_core: failed to modify rule to point on flow table %d\n",
1019 new_next_ft->id);
1020 }
1021 return 0;
1022}
1023
f90edfd2
MG		 1024static int connect_flow_table(struct mlx5_core_dev *dev, struct mlx5_flow_table *ft,
1025 struct fs_prio *prio)
1026{
b3638e1a 1027 struct mlx5_flow_table *next_ft;
f90edfd2
MG		 1028 int err = 0;
1029
1030 /* Connect_prev_fts and update_root_ft_create are mutually exclusive */
1031
1032 if (list_empty(&prio->node.children)) {
1033 err = connect_prev_fts(dev, ft, prio);
1034 if (err)
1035 return err;
b3638e1a
MG		 1036
1037 next_ft = find_next_chained_ft(prio);
1038 err = connect_fwd_rules(dev, ft, next_ft);
1039 if (err)
1040 return err;
f90edfd2
MG		 1041 }
1042
1043 if (MLX5_CAP_FLOWTABLE(dev,
1044 flow_table_properties_nic_receive.modify_root))
1045 err = update_root_ft_create(ft, prio);
1046 return err;
1047}
1048
d63cd286
MG		 1049static void list_add_flow_table(struct mlx5_flow_table *ft,
1050 struct fs_prio *prio)
1051{
1052 struct list_head *prev = &prio->node.children;
1053 struct mlx5_flow_table *iter;
1054
1055 fs_for_each_ft(iter, prio) {
1056 if (iter->level > ft->level)
1057 break;
1058 prev = &iter->node.list;
1059 }
1060 list_add(&ft->node.list, prev);
1061}
1062
efdc810b 1063static struct mlx5_flow_table *__mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
b3ba5149 1064 struct mlx5_flow_table_attr *ft_attr,
aaff1bea 1065 enum fs_flow_table_op_mod op_mod,
b3ba5149 1066 u16 vport)
0c56b975 1067{
b3ba5149 1068 struct mlx5_flow_root_namespace *root = find_root(&ns->node);
5281a0c9
PB		 1069 bool unmanaged = ft_attr->flags & MLX5_FLOW_TABLE_UNMANAGED;
1070 struct mlx5_flow_table *next_ft;
b3ba5149 1071 struct fs_prio *fs_prio = NULL;
0c56b975 1072 struct mlx5_flow_table *ft;
b3ba5149 1073 int err;
0c56b975
MG		 1074
1075 if (!root) {
1076 pr_err("mlx5: flow steering failed to find root of namespace\n");
1077 return ERR_PTR(-ENODEV);
1078 }
1079
2cc43b49 1080 mutex_lock(&root->chain_lock);
b3ba5149 1081 fs_prio = find_prio(ns, ft_attr->prio);
2cc43b49
MG		 1082 if (!fs_prio) {
1083 err = -EINVAL;
1084 goto unlock_root;
1085 }
5281a0c9
PB		 1086 if (!unmanaged) {
1087 /* The level is related to the
1088 * priority level range.
1089 */
1090 if (ft_attr->level >= fs_prio->num_levels) {
1091 err = -ENOSPC;
1092 goto unlock_root;
1093 }
1094
1095 ft_attr->level += fs_prio->start_level;
0c56b975 1096 }
5281a0c9 1097
d63cd286
MG		 1098 /* The level is related to the
1099 * priority level range.
1100 */
b3ba5149 1101 ft = alloc_flow_table(ft_attr->level,
efdc810b 1102 vport,
aaff1bea 1103 root->table_type,
b3ba5149 1104 op_mod, ft_attr->flags);
693c6883
MB		 1105 if (IS_ERR(ft)) {
1106 err = PTR_ERR(ft);
2cc43b49 1107 goto unlock_root;
0c56b975
MG		 1108 }
1109
bd71b08e 1110 tree_init_node(&ft->node, del_hw_flow_table, del_sw_flow_table);
5281a0c9
PB		 1111 next_ft = unmanaged ? ft_attr->next_ft :
1112 find_next_chained_ft(fs_prio);
f66ad830 1113 ft->def_miss_action = ns->def_miss_action;
9254f8ed 1114 ft->ns = ns;
04745afb 1115 err = root->cmds->create_flow_table(root, ft, ft_attr->max_fte, next_ft);
0c56b975
MG		 1116 if (err)
1117 goto free_ft;
1118
5281a0c9
PB		 1119 if (!unmanaged) {
1120 err = connect_flow_table(root->dev, ft, fs_prio);
1121 if (err)
1122 goto destroy_ft;
1123 }
1124
19f100fe 1125 ft->node.active = true;
476d61b7 1126 down_write_ref_node(&fs_prio->node, false);
5281a0c9
PB		 1127 if (!unmanaged) {
1128 tree_add_node(&ft->node, &fs_prio->node);
1129 list_add_flow_table(ft, fs_prio);
1130 } else {
1131 ft->node.root = fs_prio->node.root;
1132 }
0c56b975 1133 fs_prio->num_ft++;
476d61b7 1134 up_write_ref_node(&fs_prio->node, false);
2cc43b49 1135 mutex_unlock(&root->chain_lock);
8e4ca986 1136 trace_mlx5_fs_add_ft(ft);
0c56b975 1137 return ft;
2cc43b49 1138destroy_ft:
ae288a48 1139 root->cmds->destroy_flow_table(root, ft);
0c56b975 1140free_ft:
487c6ef8 1141 rhltable_destroy(&ft->fgs_hash);
0c56b975 1142 kfree(ft);
2cc43b49
MG		 1143unlock_root:
1144 mutex_unlock(&root->chain_lock);
0c56b975
MG		 1145 return ERR_PTR(err);
1146}
1147
efdc810b 1148struct mlx5_flow_table *mlx5_create_flow_table(struct mlx5_flow_namespace *ns,
b3ba5149 1149 struct mlx5_flow_table_attr *ft_attr)
efdc810b 1150{
b3ba5149 1151 return __mlx5_create_flow_table(ns, ft_attr, FS_FT_OP_MOD_NORMAL, 0);
efdc810b 1152}
8d2a9d8d 1153EXPORT_SYMBOL(mlx5_create_flow_table);
efdc810b 1154
617b860c
PP		 1155struct mlx5_flow_table *
1156mlx5_create_vport_flow_table(struct mlx5_flow_namespace *ns,
1157 struct mlx5_flow_table_attr *ft_attr, u16 vport)
efdc810b 1158{
617b860c 1159 return __mlx5_create_flow_table(ns, ft_attr, FS_FT_OP_MOD_NORMAL, vport);
efdc810b
MHY		 1160}
1161
b3ba5149
ES		 1162struct mlx5_flow_table*
1163mlx5_create_lag_demux_flow_table(struct mlx5_flow_namespace *ns,
1164 int prio, u32 level)
aaff1bea 1165{
b3ba5149
ES		 1166 struct mlx5_flow_table_attr ft_attr = {};
1167
1168 ft_attr.level = level;
1169 ft_attr.prio = prio;
4a98544d
PB		 1170 ft_attr.max_fte = 1;
1171
b3ba5149 1172 return __mlx5_create_flow_table(ns, &ft_attr, FS_FT_OP_MOD_LAG_DEMUX, 0);
aaff1bea
AH		 1173}
1174EXPORT_SYMBOL(mlx5_create_lag_demux_flow_table);
1175
71513c05 1176#define MAX_FLOW_GROUP_SIZE BIT(24)
b3ba5149
ES		 1177struct mlx5_flow_table*
1178mlx5_create_auto_grouped_flow_table(struct mlx5_flow_namespace *ns,
61dc7b01 1179 struct mlx5_flow_table_attr *ft_attr)
f0d22d18 1180{
79cdb0aa 1181 int num_reserved_entries = ft_attr->autogroup.num_reserved_entries;
79cdb0aa 1182 int max_num_groups = ft_attr->autogroup.max_num_groups;
f0d22d18 1183 struct mlx5_flow_table *ft;
4a98544d 1184 int autogroups_max_fte;
f0d22d18 1185
61dc7b01 1186 ft = mlx5_create_flow_table(ns, ft_attr);
f0d22d18
MG		 1187 if (IS_ERR(ft))
1188 return ft;
1189
4a98544d
PB		 1190 autogroups_max_fte = ft->max_fte - num_reserved_entries;
1191 if (max_num_groups > autogroups_max_fte)
1192 goto err_validate;
1193 if (num_reserved_entries > ft->max_fte)
1194 goto err_validate;
1195
71513c05
PB		 1196 /* Align the number of groups according to the largest group size */
1197 if (autogroups_max_fte / (max_num_groups + 1) > MAX_FLOW_GROUP_SIZE)
1198 max_num_groups = (autogroups_max_fte / MAX_FLOW_GROUP_SIZE) - 1;
1199
f0d22d18 1200 ft->autogroup.active = true;
79cdb0aa
PB		 1201 ft->autogroup.required_groups = max_num_groups;
1202 ft->autogroup.max_fte = autogroups_max_fte;
97fd8da2 1203 /* We save place for flow groups in addition to max types */
79cdb0aa 1204 ft->autogroup.group_size = autogroups_max_fte / (max_num_groups + 1);
f0d22d18
MG		 1205
1206 return ft;
4a98544d
PB		 1207
1208err_validate:
1209 mlx5_destroy_flow_table(ft);
1210 return ERR_PTR(-ENOSPC);
f0d22d18 1211}
b217ea25 1212EXPORT_SYMBOL(mlx5_create_auto_grouped_flow_table);
f0d22d18 1213
f0d22d18
MG		 1214struct mlx5_flow_group *mlx5_create_flow_group(struct mlx5_flow_table *ft,
1215 u32 *fg_in)
1216{
af76c501 1217 struct mlx5_flow_root_namespace *root = find_root(&ft->node);
0d235c3f
MB		 1218 void *match_criteria = MLX5_ADDR_OF(create_flow_group_in,
1219 fg_in, match_criteria);
1220 u8 match_criteria_enable = MLX5_GET(create_flow_group_in,
1221 fg_in,
1222 match_criteria_enable);
19f100fe
MG		 1223 int start_index = MLX5_GET(create_flow_group_in, fg_in,
1224 start_flow_index);
1225 int end_index = MLX5_GET(create_flow_group_in, fg_in,
1226 end_flow_index);
f0d22d18 1227 struct mlx5_flow_group *fg;
19f100fe 1228 int err;
f0d22d18 1229
79cdb0aa 1230 if (ft->autogroup.active && start_index < ft->autogroup.max_fte)
f0d22d18
MG		 1231 return ERR_PTR(-EPERM);
1232
476d61b7 1233 down_write_ref_node(&ft->node, false);
19f100fe
MG		 1234 fg = alloc_insert_flow_group(ft, match_criteria_enable, match_criteria,
1235 start_index, end_index,
1236 ft->node.children.prev);
476d61b7 1237 up_write_ref_node(&ft->node, false);
19f100fe
MG		 1238 if (IS_ERR(fg))
1239 return fg;
1240
ae288a48 1241 err = root->cmds->create_flow_group(root, ft, fg_in, fg);
19f100fe 1242 if (err) {
476d61b7 1243 tree_put_node(&fg->node, false);
19f100fe
MG		 1244 return ERR_PTR(err);
1245 }
1246 trace_mlx5_fs_add_fg(fg);
1247 fg->node.active = true;
0c56b975
MG		 1248
1249 return fg;
1250}
8d2a9d8d 1251EXPORT_SYMBOL(mlx5_create_flow_group);
0c56b975
MG		 1252
1253static struct mlx5_flow_rule *alloc_rule(struct mlx5_flow_destination *dest)
1254{
1255 struct mlx5_flow_rule *rule;
1256
1257 rule = kzalloc(sizeof(*rule), GFP_KERNEL);
1258 if (!rule)
1259 return NULL;
1260
b3638e1a 1261 INIT_LIST_HEAD(&rule->next_ft);
0c56b975 1262 rule->node.type = FS_TYPE_FLOW_DEST;
60ab4584
AV		 1263 if (dest)
1264 memcpy(&rule->dest_attr, dest, sizeof(*dest));
0c56b975
MG		 1265
1266 return rule;
1267}
1268
74491de9
MB		 1269static struct mlx5_flow_handle *alloc_handle(int num_rules)
1270{
1271 struct mlx5_flow_handle *handle;
1272
acafe7e3 1273 handle = kzalloc(struct_size(handle, rule, num_rules), GFP_KERNEL);
74491de9
MB		 1274 if (!handle)
1275 return NULL;
1276
1277 handle->num_rules = num_rules;
1278
1279 return handle;
1280}
1281
1282static void destroy_flow_handle(struct fs_fte *fte,
1283 struct mlx5_flow_handle *handle,
1284 struct mlx5_flow_destination *dest,
1285 int i)
1286{
1287 for (; --i >= 0;) {
dd8e1945 1288 if (refcount_dec_and_test(&handle->rule[i]->node.refcount)) {
74491de9
MB		 1289 fte->dests_size--;
1290 list_del(&handle->rule[i]->node.list);
1291 kfree(handle->rule[i]);
1292 }
1293 }
1294 kfree(handle);
1295}
1296
1297static struct mlx5_flow_handle *
1298create_flow_handle(struct fs_fte *fte,
1299 struct mlx5_flow_destination *dest,
1300 int dest_num,
1301 int *modify_mask,
1302 bool *new_rule)
1303{
1304 struct mlx5_flow_handle *handle;
1305 struct mlx5_flow_rule *rule = NULL;
1306 static int count = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_FLOW_COUNTERS);
1307 static int dst = BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_DESTINATION_LIST);
1308 int type;
1309 int i = 0;
1310
1311 handle = alloc_handle((dest_num) ? dest_num : 1);
1312 if (!handle)
1313 return ERR_PTR(-ENOMEM);
1314
1315 do {
1316 if (dest) {
1317 rule = find_flow_rule(fte, dest + i);
1318 if (rule) {
dd8e1945 1319 refcount_inc(&rule->node.refcount);
74491de9
MB		 1320 goto rule_found;
1321 }
1322 }
1323
1324 *new_rule = true;
1325 rule = alloc_rule(dest + i);
1326 if (!rule)
1327 goto free_rules;
1328
1329 /* Add dest to dests list- we need flow tables to be in the
1330 * end of the list for forward to next prio rules.
1331 */
bd71b08e 1332 tree_init_node(&rule->node, NULL, del_sw_hw_rule);
74491de9
MB		 1333 if (dest &&
1334 dest[i].type != MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE)
1335 list_add(&rule->node.list, &fte->node.children);
1336 else
1337 list_add_tail(&rule->node.list, &fte->node.children);
1338 if (dest) {
1339 fte->dests_size++;
1340
1341 type = dest[i].type ==
1342 MLX5_FLOW_DESTINATION_TYPE_COUNTER;
1343 *modify_mask |= type ? count : dst;
1344 }
1345rule_found:
1346 handle->rule[i] = rule;
1347 } while (++i < dest_num);
1348
1349 return handle;
1350
1351free_rules:
1352 destroy_flow_handle(fte, handle, dest, i);
1353 return ERR_PTR(-ENOMEM);
1354}
1355
0c56b975 1356/* fte should not be deleted while calling this function */
74491de9
MB		 1357static struct mlx5_flow_handle *
1358add_rule_fte(struct fs_fte *fte,
1359 struct mlx5_flow_group *fg,
1360 struct mlx5_flow_destination *dest,
1361 int dest_num,
1362 bool update_action)
0c56b975 1363{
af76c501 1364 struct mlx5_flow_root_namespace *root;
74491de9 1365 struct mlx5_flow_handle *handle;
0c56b975 1366 struct mlx5_flow_table *ft;
bd5251db 1367 int modify_mask = 0;
0c56b975 1368 int err;
74491de9 1369 bool new_rule = false;
0c56b975 1370
74491de9
MB		 1371 handle = create_flow_handle(fte, dest, dest_num, &modify_mask,
1372 &new_rule);
1373 if (IS_ERR(handle) || !new_rule)
1374 goto out;
bd5251db 1375
a6224985
MB		 1376 if (update_action)
1377 modify_mask |= BIT(MLX5_SET_FTE_MODIFY_ENABLE_MASK_ACTION);
bd5251db 1378
0c56b975 1379 fs_get_obj(ft, fg->node.parent);
af76c501 1380 root = find_root(&fg->node);
0501fc47 1381 if (!(fte->status & FS_FTE_STATUS_EXISTING))
ae288a48 1382 err = root->cmds->create_fte(root, ft, fg, fte);
0c56b975 1383 else
ae288a48 1384 err = root->cmds->update_fte(root, ft, fg, modify_mask, fte);
0c56b975 1385 if (err)
74491de9 1386 goto free_handle;
0c56b975 1387
19f100fe 1388 fte->node.active = true;
0c56b975 1389 fte->status |= FS_FTE_STATUS_EXISTING;
454401ae 1390 atomic_inc(&fg->node.version);
0c56b975 1391
74491de9
MB		 1392out:
1393 return handle;
0c56b975 1394
74491de9
MB		 1395free_handle:
1396 destroy_flow_handle(fte, handle, dest, handle->num_rules);
0c56b975
MG		 1397 return ERR_PTR(err);
1398}
1399
19f100fe 1400static struct mlx5_flow_group *alloc_auto_flow_group(struct mlx5_flow_table *ft,
5233794b 1401 const struct mlx5_flow_spec *spec)
0c56b975 1402{
af363705 1403 struct list_head *prev = &ft->node.children;
79cdb0aa 1404 u32 max_fte = ft->autogroup.max_fte;
19f100fe 1405 unsigned int candidate_index = 0;
f0d22d18 1406 unsigned int group_size = 0;
79cdb0aa 1407 struct mlx5_flow_group *fg;
f0d22d18
MG		 1408
1409 if (!ft->autogroup.active)
1410 return ERR_PTR(-ENOENT);
1411
f0d22d18 1412 if (ft->autogroup.num_groups < ft->autogroup.required_groups)
97fd8da2 1413 group_size = ft->autogroup.group_size;
f0d22d18 1414
79cdb0aa 1415 /* max_fte == ft->autogroup.max_types */
f0d22d18
MG		 1416 if (group_size == 0)
1417 group_size = 1;
1418
1419 /* sorted by start_index */
1420 fs_for_each_fg(fg, ft) {
1421 if (candidate_index + group_size > fg->start_index)
1422 candidate_index = fg->start_index + fg->max_ftes;
1423 else
1424 break;
1425 prev = &fg->node.list;
1426 }
1427
79cdb0aa 1428 if (candidate_index + group_size > max_fte)
19f100fe
MG		 1429 return ERR_PTR(-ENOSPC);
1430
1431 fg = alloc_insert_flow_group(ft,
1432 spec->match_criteria_enable,
1433 spec->match_criteria,
1434 candidate_index,
1435 candidate_index + group_size - 1,
1436 prev);
1437 if (IS_ERR(fg))
f0d22d18 1438 goto out;
19f100fe 1439
97fd8da2
MG		 1440 if (group_size == ft->autogroup.group_size)
1441 ft->autogroup.num_groups++;
19f100fe
MG		 1442
1443out:
1444 return fg;
1445}
1446
1447static int create_auto_flow_group(struct mlx5_flow_table *ft,
1448 struct mlx5_flow_group *fg)
1449{
af76c501 1450 struct mlx5_flow_root_namespace *root = find_root(&ft->node);
19f100fe
MG		 1451 int inlen = MLX5_ST_SZ_BYTES(create_flow_group_in);
1452 void *match_criteria_addr;
3e99df87
SK		 1453 u8 src_esw_owner_mask_on;
1454 void *misc;
19f100fe
MG		 1455 int err;
1456 u32 *in;
1457
1458 in = kvzalloc(inlen, GFP_KERNEL);
1459 if (!in)
1460 return -ENOMEM;
f0d22d18
MG		 1461
1462 MLX5_SET(create_flow_group_in, in, match_criteria_enable,
19f100fe
MG		 1463 fg->mask.match_criteria_enable);
1464 MLX5_SET(create_flow_group_in, in, start_flow_index, fg->start_index);
1465 MLX5_SET(create_flow_group_in, in, end_flow_index, fg->start_index +
1466 fg->max_ftes - 1);
3e99df87
SK		 1467
1468 misc = MLX5_ADDR_OF(fte_match_param, fg->mask.match_criteria,
1469 misc_parameters);
1470 src_esw_owner_mask_on = !!MLX5_GET(fte_match_set_misc, misc,
1471 source_eswitch_owner_vhca_id);
1472 MLX5_SET(create_flow_group_in, in,
1473 source_eswitch_owner_vhca_id_valid, src_esw_owner_mask_on);
1474
f0d22d18
MG		 1475 match_criteria_addr = MLX5_ADDR_OF(create_flow_group_in,
1476 in, match_criteria);
19f100fe
MG		 1477 memcpy(match_criteria_addr, fg->mask.match_criteria,
1478 sizeof(fg->mask.match_criteria));
1479
ae288a48 1480 err = root->cmds->create_flow_group(root, ft, in, fg);
19f100fe
MG		 1481 if (!err) {
1482 fg->node.active = true;
1483 trace_mlx5_fs_add_fg(fg);
1484 }
f0d22d18 1485
f0d22d18 1486 kvfree(in);
19f100fe 1487 return err;
f0d22d18
MG		 1488}
1489
814fb875
MB		 1490static bool mlx5_flow_dests_cmp(struct mlx5_flow_destination *d1,
1491 struct mlx5_flow_destination *d2)
1492{
1493 if (d1->type == d2->type) {
1494 if ((d1->type == MLX5_FLOW_DESTINATION_TYPE_VPORT &&
1228e912
EB		 1495 d1->vport.num == d2->vport.num &&
1496 d1->vport.flags == d2->vport.flags &&
c979c445
DL		 1497 ((d1->vport.flags & MLX5_FLOW_DEST_VPORT_VHCA_ID) ?
1498 (d1->vport.vhca_id == d2->vport.vhca_id) : true) &&
1228e912 1499 ((d1->vport.flags & MLX5_FLOW_DEST_VPORT_REFORMAT_ID) ?
2b688ea5
MG		 1500 (d1->vport.pkt_reformat->id ==
1501 d2->vport.pkt_reformat->id) : true)) ||
814fb875
MB		 1502 (d1->type == MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE &&
1503 d1->ft == d2->ft) ||
1504 (d1->type == MLX5_FLOW_DESTINATION_TYPE_TIR &&
664000b6
YH		 1505 d1->tir_num == d2->tir_num) ||
1506 (d1->type == MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE_NUM &&
1507 d1->ft_num == d2->ft_num))
814fb875
MB		 1508 return true;
1509 }
1510
1511 return false;
1512}
1513
b3638e1a
MG		 1514static struct mlx5_flow_rule *find_flow_rule(struct fs_fte *fte,
1515 struct mlx5_flow_destination *dest)
1516{
1517 struct mlx5_flow_rule *rule;
1518
1519 list_for_each_entry(rule, &fte->node.children, node.list) {
814fb875
MB		 1520 if (mlx5_flow_dests_cmp(&rule->dest_attr, dest))
1521 return rule;
b3638e1a
MG		 1522 }
1523 return NULL;
1524}
1525
0d235c3f
MB		 1526static bool check_conflicting_actions(u32 action1, u32 action2)
1527{
1528 u32 xored_actions = action1 ^ action2;
1529
1530 /* if one rule only wants to count, it's ok */
1531 if (action1 == MLX5_FLOW_CONTEXT_ACTION_COUNT ||
1532 action2 == MLX5_FLOW_CONTEXT_ACTION_COUNT)
1533 return false;
1534
1535 if (xored_actions & (MLX5_FLOW_CONTEXT_ACTION_DROP |
60786f09 1536 MLX5_FLOW_CONTEXT_ACTION_PACKET_REFORMAT |
96de67a7 1537 MLX5_FLOW_CONTEXT_ACTION_DECAP |
0c06897a
OG		 1538 MLX5_FLOW_CONTEXT_ACTION_MOD_HDR |
1539 MLX5_FLOW_CONTEXT_ACTION_VLAN_POP |
8da6fe2a
JL		 1540 MLX5_FLOW_CONTEXT_ACTION_VLAN_PUSH |
1541 MLX5_FLOW_CONTEXT_ACTION_VLAN_POP_2 |
1542 MLX5_FLOW_CONTEXT_ACTION_VLAN_PUSH_2))
0d235c3f
MB		 1543 return true;
1544
1545 return false;
1546}
1547
bb0ee7dc
JL		 1548static int check_conflicting_ftes(struct fs_fte *fte,
1549 const struct mlx5_flow_context *flow_context,
1550 const struct mlx5_flow_act *flow_act)
0d235c3f 1551{
d2ec6a35 1552 if (check_conflicting_actions(flow_act->action, fte->action.action)) {
0d235c3f
MB		 1553 mlx5_core_warn(get_dev(&fte->node),
1554 "Found two FTEs with conflicting actions\n");
1555 return -EEXIST;
1556 }
1557
bb0ee7dc
JL		 1558 if ((flow_context->flags & FLOW_CONTEXT_HAS_TAG) &&
1559 fte->flow_context.flow_tag != flow_context->flow_tag) {
0d235c3f
MB		 1560 mlx5_core_warn(get_dev(&fte->node),
1561 "FTE flow tag %u already exists with different flow tag %u\n",
bb0ee7dc
JL		 1562 fte->flow_context.flow_tag,
1563 flow_context->flow_tag);
0d235c3f
MB		 1564 return -EEXIST;
1565 }
1566
1567 return 0;
1568}
1569
74491de9 1570static struct mlx5_flow_handle *add_rule_fg(struct mlx5_flow_group *fg,
5233794b 1571 const struct mlx5_flow_spec *spec,
66958ed9 1572 struct mlx5_flow_act *flow_act,
74491de9 1573 struct mlx5_flow_destination *dest,
693c6883
MB		 1574 int dest_num,
1575 struct fs_fte *fte)
0c56b975 1576{
74491de9 1577 struct mlx5_flow_handle *handle;
bd71b08e 1578 int old_action;
74491de9 1579 int i;
bd71b08e 1580 int ret;
0c56b975 1581
bb0ee7dc 1582 ret = check_conflicting_ftes(fte, &spec->flow_context, flow_act);
bd71b08e
MG		 1583 if (ret)
1584 return ERR_PTR(ret);
0c56b975 1585
d2ec6a35
MB		 1586 old_action = fte->action.action;
1587 fte->action.action |= flow_act->action;
bd71b08e
MG		 1588 handle = add_rule_fte(fte, fg, dest, dest_num,
1589 old_action != flow_act->action);
74491de9 1590 if (IS_ERR(handle)) {
d2ec6a35 1591 fte->action.action = old_action;
693c6883 1592 return handle;
0c56b975 1593 }
bd71b08e 1594 trace_mlx5_fs_set_fte(fte, false);
0c56b975 1595
74491de9 1596 for (i = 0; i < handle->num_rules; i++) {
dd8e1945 1597 if (refcount_read(&handle->rule[i]->node.refcount) == 1) {
74491de9 1598 tree_add_node(&handle->rule[i]->node, &fte->node);
4c03e69a
MB		 1599 trace_mlx5_fs_add_rule(handle->rule[i]);
1600 }
74491de9 1601 }
74491de9 1602 return handle;
0c56b975
MG		 1603}
1604
171c7625 1605static bool counter_is_valid(u32 action)
bd5251db 1606{
ae058314 1607 return (action & (MLX5_FLOW_CONTEXT_ACTION_DROP |
4c2573e1 1608 MLX5_FLOW_CONTEXT_ACTION_ALLOW |
eafa6abd 1609 MLX5_FLOW_CONTEXT_ACTION_FWD_DEST));
bd5251db
AV		 1610}
1611
d63cd286 1612static bool dest_is_valid(struct mlx5_flow_destination *dest,
ff189b43 1613 struct mlx5_flow_act *flow_act,
d63cd286
MG		 1614 struct mlx5_flow_table *ft)
1615{
ff189b43
PB		 1616 bool ignore_level = flow_act->flags & FLOW_ACT_IGNORE_FLOW_LEVEL;
1617 u32 action = flow_act->action;
1618
bd5251db 1619 if (dest && (dest->type == MLX5_FLOW_DESTINATION_TYPE_COUNTER))
171c7625 1620 return counter_is_valid(action);
bd5251db 1621
d63cd286
MG		 1622 if (!(action & MLX5_FLOW_CONTEXT_ACTION_FWD_DEST))
1623 return true;
1624
ff189b43 1625 if (ignore_level) {
006f623e
AL		 1626 if (ft->type != FS_FT_FDB &&
1627 ft->type != FS_FT_NIC_RX)
ff189b43
PB		 1628 return false;
1629
1630 if (dest->type == MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE &&
006f623e 1631 ft->type != dest->ft->type)
ff189b43
PB		 1632 return false;
1633 }
1634
d63cd286
MG		 1635 if (!dest || ((dest->type ==
1636 MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE) &&
ff189b43 1637 (dest->ft->level <= ft->level && !ignore_level)))
d63cd286
MG		 1638 return false;
1639 return true;
1640}
1641
46719d77
MG		 1642struct match_list {
1643 struct list_head list;
693c6883 1644 struct mlx5_flow_group *g;
46719d77
MG		 1645};
1646
b820ce00 1647static void free_match_list(struct match_list *head, bool ft_locked)
46719d77 1648{
b820ce00 1649 struct match_list *iter, *match_tmp;
46719d77 1650
b820ce00
EC		 1651 list_for_each_entry_safe(iter, match_tmp, &head->list,
1652 list) {
1653 tree_put_node(&iter->g->node, ft_locked);
1654 list_del(&iter->list);
1655 kfree(iter);
46719d77
MG		 1656 }
1657}
1658
b820ce00 1659static int build_match_list(struct match_list *match_head,
46719d77 1660 struct mlx5_flow_table *ft,
c1948390
MG		 1661 const struct mlx5_flow_spec *spec,
1662 bool ft_locked)
46719d77 1663{
693c6883 1664 struct rhlist_head *tmp, *list;
46719d77
MG		 1665 struct mlx5_flow_group *g;
1666 int err = 0;
693c6883
MB		 1667
1668 rcu_read_lock();
46719d77 1669 INIT_LIST_HEAD(&match_head->list);
693c6883
MB		 1670 /* Collect all fgs which has a matching match_criteria */
1671 list = rhltable_lookup(&ft->fgs_hash, spec, rhash_fg);
46719d77 1672 /* RCU is atomic, we can't execute FW commands here */
693c6883
MB		 1673 rhl_for_each_entry_rcu(g, tmp, list, hash) {
1674 struct match_list *curr_match;
1675
b820ce00 1676 if (unlikely(!tree_get_node(&g->node)))
693c6883 1677 continue;
693c6883 1678
46719d77 1679 curr_match = kmalloc(sizeof(*curr_match), GFP_ATOMIC);
693c6883 1680 if (!curr_match) {
c1948390 1681 free_match_list(match_head, ft_locked);
46719d77
MG		 1682 err = -ENOMEM;
1683 goto out;
693c6883
MB		 1684 }
1685 curr_match->g = g;
46719d77 1686 list_add_tail(&curr_match->list, &match_head->list);
693c6883 1687 }
46719d77 1688out:
693c6883 1689 rcu_read_unlock();
46719d77
MG		 1690 return err;
1691}
1692
bd71b08e
MG		 1693static u64 matched_fgs_get_version(struct list_head *match_head)
1694{
1695 struct match_list *iter;
1696 u64 version = 0;
1697
1698 list_for_each_entry(iter, match_head, list)
1699 version += (u64)atomic_read(&iter->g->node.version);
1700 return version;
1701}
1702
ad9421e3 1703static struct fs_fte *
1f0593e7
PP		 1704lookup_fte_locked(struct mlx5_flow_group *g,
1705 const u32 *match_value,
1706 bool take_write)
7dee607e
PP		 1707{
1708 struct fs_fte *fte_tmp;
1709
1f0593e7
PP		 1710 if (take_write)
1711 nested_down_write_ref_node(&g->node, FS_LOCK_PARENT);
1712 else
1713 nested_down_read_ref_node(&g->node, FS_LOCK_PARENT);
1714 fte_tmp = rhashtable_lookup_fast(&g->ftes_hash, match_value,
1715 rhash_fte);
ad9421e3
RD		 1716 if (!fte_tmp || !tree_get_node(&fte_tmp->node)) {
1717 fte_tmp = NULL;
1718 goto out;
1719 }
6237634d 1720 if (!fte_tmp->node.active) {
476d61b7 1721 tree_put_node(&fte_tmp->node, false);
6237634d
EB		 1722 fte_tmp = NULL;
1723 goto out;
1724 }
ad9421e3
RD		 1725
1726 nested_down_write_ref_node(&fte_tmp->node, FS_LOCK_CHILD);
1727out:
1f0593e7
PP		 1728 if (take_write)
1729 up_write_ref_node(&g->node, false);
7dee607e 1730 else
1f0593e7
PP		 1731 up_read_ref_node(&g->node);
1732 return fte_tmp;
7dee607e
PP		 1733}
1734
46719d77
MG		 1735static struct mlx5_flow_handle *
1736try_add_to_existing_fg(struct mlx5_flow_table *ft,
bd71b08e 1737 struct list_head *match_head,
5233794b 1738 const struct mlx5_flow_spec *spec,
46719d77
MG		 1739 struct mlx5_flow_act *flow_act,
1740 struct mlx5_flow_destination *dest,
bd71b08e
MG		 1741 int dest_num,
1742 int ft_version)
46719d77 1743{
a369d4ac 1744 struct mlx5_flow_steering *steering = get_steering(&ft->node);
46719d77
MG		 1745 struct mlx5_flow_group *g;
1746 struct mlx5_flow_handle *rule;
46719d77 1747 struct match_list *iter;
bd71b08e
MG		 1748 bool take_write = false;
1749 struct fs_fte *fte;
dc638d11 1750 u64 version = 0;
f5c2ff17
MG		 1751 int err;
1752
bb0ee7dc 1753 fte = alloc_fte(ft, spec, flow_act);
f5c2ff17
MG		 1754 if (IS_ERR(fte))
1755 return ERR_PTR(-ENOMEM);
46719d77 1756
bd71b08e 1757search_again_locked:
d5634fee
PB		 1758 if (flow_act->flags & FLOW_ACT_NO_APPEND)
1759 goto skip_search;
dc638d11
EC		 1760 version = matched_fgs_get_version(match_head);
1761 /* Try to find an fte with identical match value and attempt update its
1762 * action.
1763 */
bd71b08e
MG		 1764 list_for_each_entry(iter, match_head, list) {
1765 struct fs_fte *fte_tmp;
693c6883
MB		 1766
1767 g = iter->g;
ad9421e3
RD		 1768 fte_tmp = lookup_fte_locked(g, spec->match_value, take_write);
1769 if (!fte_tmp)
bd71b08e 1770 continue;
bb0ee7dc 1771 rule = add_rule_fg(g, spec, flow_act, dest, dest_num, fte_tmp);
a5bfe6b4 1772 /* No error check needed here, because insert_fte() is not called */
476d61b7
EB		 1773 up_write_ref_node(&fte_tmp->node, false);
1774 tree_put_node(&fte_tmp->node, false);
a369d4ac 1775 kmem_cache_free(steering->ftes_cache, fte);
bd71b08e 1776 return rule;
693c6883
MB		 1777 }
1778
d5634fee
PB		 1779skip_search:
1780 /* No group with matching fte found, or we skipped the search.
1781 * Try to add a new fte to any matching fg.
1782 */
1783
bd71b08e
MG		 1784 /* Check the ft version, for case that new flow group
1785 * was added while the fgs weren't locked
1786 */
1787 if (atomic_read(&ft->node.version) != ft_version) {
1788 rule = ERR_PTR(-EAGAIN);
1789 goto out;
1790 }
b92af5a7 1791
dc638d11
EC		 1792 /* Check the fgs version. If version have changed it could be that an
1793 * FTE with the same match value was added while the fgs weren't
1794 * locked.
bd71b08e 1795 */
dc638d11
EC		 1796 if (!(flow_act->flags & FLOW_ACT_NO_APPEND) &&
1797 version != matched_fgs_get_version(match_head)) {
ad9421e3 1798 take_write = true;
bd71b08e 1799 goto search_again_locked;
ad9421e3 1800 }
bd71b08e
MG		 1801
1802 list_for_each_entry(iter, match_head, list) {
1803 g = iter->g;
1804
ad9421e3
RD		 1805 nested_down_write_ref_node(&g->node, FS_LOCK_PARENT);
1806
49c0355d
PB		 1807 if (!g->node.active) {
1808 up_write_ref_node(&g->node, false);
1809 continue;
1810 }
1811
f5c2ff17
MG		 1812 err = insert_fte(g, fte);
1813 if (err) {
476d61b7 1814 up_write_ref_node(&g->node, false);
f5c2ff17 1815 if (err == -ENOSPC)
bd71b08e 1816 continue;
a369d4ac 1817 kmem_cache_free(steering->ftes_cache, fte);
f5c2ff17 1818 return ERR_PTR(err);
bd71b08e 1819 }
693c6883 1820
bd71b08e 1821 nested_down_write_ref_node(&fte->node, FS_LOCK_CHILD);
476d61b7 1822 up_write_ref_node(&g->node, false);
bb0ee7dc 1823 rule = add_rule_fg(g, spec, flow_act, dest, dest_num, fte);
476d61b7 1824 up_write_ref_node(&fte->node, false);
a5bfe6b4
MG		 1825 if (IS_ERR(rule))
1826 tree_put_node(&fte->node, false);
bd71b08e
MG		 1827 return rule;
1828 }
1829 rule = ERR_PTR(-ENOENT);
1830out:
a369d4ac 1831 kmem_cache_free(steering->ftes_cache, fte);
693c6883
MB		 1832 return rule;
1833}
1834
74491de9
MB		 1835static struct mlx5_flow_handle *
1836_mlx5_add_flow_rules(struct mlx5_flow_table *ft,
5233794b 1837 const struct mlx5_flow_spec *spec,
66958ed9 1838 struct mlx5_flow_act *flow_act,
74491de9
MB		 1839 struct mlx5_flow_destination *dest,
1840 int dest_num)
66958ed9 1841
0c56b975 1842{
a369d4ac 1843 struct mlx5_flow_steering *steering = get_steering(&ft->node);
74491de9 1844 struct mlx5_flow_handle *rule;
b820ce00
EC		 1845 struct match_list match_head;
1846 struct mlx5_flow_group *g;
bd71b08e
MG		 1847 bool take_write = false;
1848 struct fs_fte *fte;
1849 int version;
19f100fe 1850 int err;
74491de9 1851 int i;
0c56b975 1852
693c6883 1853 if (!check_valid_spec(spec))
0d235c3f
MB		 1854 return ERR_PTR(-EINVAL);
1855
74491de9 1856 for (i = 0; i < dest_num; i++) {
ff189b43 1857 if (!dest_is_valid(&dest[i], flow_act, ft))
74491de9
MB		 1858 return ERR_PTR(-EINVAL);
1859 }
bd71b08e
MG		 1860 nested_down_read_ref_node(&ft->node, FS_LOCK_GRANDPARENT);
1861search_again_locked:
1862 version = atomic_read(&ft->node.version);
60ab4584 1863
bd71b08e 1864 /* Collect all fgs which has a matching match_criteria */
c1948390 1865 err = build_match_list(&match_head, ft, spec, take_write);
9238e380
VB		 1866 if (err) {
1867 if (take_write)
476d61b7 1868 up_write_ref_node(&ft->node, false);
07130477
RD		 1869 else
1870 up_read_ref_node(&ft->node);
bd71b08e 1871 return ERR_PTR(err);
9238e380 1872 }
bd71b08e
MG		 1873
1874 if (!take_write)
1875 up_read_ref_node(&ft->node);
1876
1877 rule = try_add_to_existing_fg(ft, &match_head.list, spec, flow_act, dest,
1878 dest_num, version);
c1948390 1879 free_match_list(&match_head, take_write);
bd71b08e 1880 if (!IS_ERR(rule) ||
9238e380
VB		 1881 (PTR_ERR(rule) != -ENOENT && PTR_ERR(rule) != -EAGAIN)) {
1882 if (take_write)
476d61b7 1883 up_write_ref_node(&ft->node, false);
bd71b08e 1884 return rule;
9238e380 1885 }
bd71b08e
MG		 1886
1887 if (!take_write) {
1888 nested_down_write_ref_node(&ft->node, FS_LOCK_GRANDPARENT);
1889 take_write = true;
1890 }
1891
1892 if (PTR_ERR(rule) == -EAGAIN ||
1893 version != atomic_read(&ft->node.version))
1894 goto search_again_locked;
f0d22d18 1895
19f100fe 1896 g = alloc_auto_flow_group(ft, spec);
c3f9bf62 1897 if (IS_ERR(g)) {
d34c6efc 1898 rule = ERR_CAST(g);
476d61b7 1899 up_write_ref_node(&ft->node, false);
bd71b08e 1900 return rule;
c3f9bf62
MG		 1901 }
1902
84c7af63
PP		 1903 fte = alloc_fte(ft, spec, flow_act);
1904 if (IS_ERR(fte)) {
1905 up_write_ref_node(&ft->node, false);
1906 err = PTR_ERR(fte);
1907 goto err_alloc_fte;
1908 }
1909
bd71b08e 1910 nested_down_write_ref_node(&g->node, FS_LOCK_PARENT);
476d61b7 1911 up_write_ref_node(&ft->node, false);
bd71b08e 1912
19f100fe 1913 err = create_auto_flow_group(ft, g);
bd71b08e
MG		 1914 if (err)
1915 goto err_release_fg;
1916
f5c2ff17 1917 err = insert_fte(g, fte);
84c7af63 1918 if (err)
f5c2ff17 1919 goto err_release_fg;
f5c2ff17 1920
bd71b08e 1921 nested_down_write_ref_node(&fte->node, FS_LOCK_CHILD);
476d61b7 1922 up_write_ref_node(&g->node, false);
bb0ee7dc 1923 rule = add_rule_fg(g, spec, flow_act, dest, dest_num, fte);
476d61b7 1924 up_write_ref_node(&fte->node, false);
a5bfe6b4
MG		 1925 if (IS_ERR(rule))
1926 tree_put_node(&fte->node, false);
476d61b7 1927 tree_put_node(&g->node, false);
0c56b975 1928 return rule;
bd71b08e
MG		 1929
1930err_release_fg:
476d61b7 1931 up_write_ref_node(&g->node, false);
84c7af63
PP		 1932 kmem_cache_free(steering->ftes_cache, fte);
1933err_alloc_fte:
476d61b7 1934 tree_put_node(&g->node, false);
bd71b08e 1935 return ERR_PTR(err);
0c56b975 1936}
b3638e1a
MG		 1937
1938static bool fwd_next_prio_supported(struct mlx5_flow_table *ft)
1939{
1940 return ((ft->type == FS_FT_NIC_RX) &&
1941 (MLX5_CAP_FLOWTABLE(get_dev(&ft->node), nic_rx_multi_path_tirs)));
1942}
1943
74491de9
MB		 1944struct mlx5_flow_handle *
1945mlx5_add_flow_rules(struct mlx5_flow_table *ft,
5233794b 1946 const struct mlx5_flow_spec *spec,
66958ed9 1947 struct mlx5_flow_act *flow_act,
74491de9 1948 struct mlx5_flow_destination *dest,
cf916ffb 1949 int num_dest)
b3638e1a
MG		 1950{
1951 struct mlx5_flow_root_namespace *root = find_root(&ft->node);
5c2aa8ae 1952 static const struct mlx5_flow_spec zero_spec = {};
14c129e3 1953 struct mlx5_flow_destination *gen_dest = NULL;
b3638e1a 1954 struct mlx5_flow_table *next_ft = NULL;
74491de9 1955 struct mlx5_flow_handle *handle = NULL;
66958ed9 1956 u32 sw_action = flow_act->action;
14c129e3 1957 int i;
b3638e1a 1958
5c2aa8ae
MB		 1959 if (!spec)
1960 spec = &zero_spec;
1961
9254f8ed 1962 if (!is_fwd_next_action(sw_action))
14c129e3
MG		 1963 return _mlx5_add_flow_rules(ft, spec, flow_act, dest, num_dest);
1964
1965 if (!fwd_next_prio_supported(ft))
1966 return ERR_PTR(-EOPNOTSUPP);
1967
1968 mutex_lock(&root->chain_lock);
9254f8ed 1969 next_ft = find_next_fwd_ft(ft, flow_act);
14c129e3
MG		 1970 if (!next_ft) {
1971 handle = ERR_PTR(-EOPNOTSUPP);
1972 goto unlock;
b3638e1a
MG		 1973 }
1974
14c129e3
MG		 1975 gen_dest = kcalloc(num_dest + 1, sizeof(*dest),
1976 GFP_KERNEL);
1977 if (!gen_dest) {
1978 handle = ERR_PTR(-ENOMEM);
1979 goto unlock;
1980 }
1981 for (i = 0; i < num_dest; i++)
1982 gen_dest[i] = dest[i];
1983 gen_dest[i].type =
1984 MLX5_FLOW_DESTINATION_TYPE_FLOW_TABLE;
1985 gen_dest[i].ft = next_ft;
1986 dest = gen_dest;
1987 num_dest++;
9254f8ed
MG		 1988 flow_act->action &= ~(MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_PRIO |
1989 MLX5_FLOW_CONTEXT_ACTION_FWD_NEXT_NS);
14c129e3 1990 flow_act->action |= MLX5_FLOW_CONTEXT_ACTION_FWD_DEST;
cf916ffb 1991 handle = _mlx5_add_flow_rules(ft, spec, flow_act, dest, num_dest);
14c129e3
MG		 1992 if (IS_ERR(handle))
1993 goto unlock;
1994
1995 if (list_empty(&handle->rule[num_dest - 1]->next_ft)) {
1996 mutex_lock(&next_ft->lock);
1997 list_add(&handle->rule[num_dest - 1]->next_ft,
1998 &next_ft->fwd_rules);
1999 mutex_unlock(&next_ft->lock);
9254f8ed
MG		 2000 handle->rule[num_dest - 1]->sw_action = sw_action;
2001 handle->rule[num_dest - 1]->ft = ft;
b3638e1a 2002 }
14c129e3
MG		 2003unlock:
2004 mutex_unlock(&root->chain_lock);
2005 kfree(gen_dest);
74491de9 2006 return handle;
b3638e1a 2007}
74491de9 2008EXPORT_SYMBOL(mlx5_add_flow_rules);
0c56b975 2009
74491de9 2010void mlx5_del_flow_rules(struct mlx5_flow_handle *handle)
0c56b975 2011{
718ce4d6 2012 struct fs_fte *fte;
74491de9
MB		 2013 int i;
2014
718ce4d6
EB		 2015 /* In order to consolidate the HW changes we lock the FTE for other
2016 * changes, and increase its refcount, in order not to perform the
2017 * "del" functions of the FTE. Will handle them here.
2018 * The removal of the rules is done under locked FTE.
2019 * After removing all the handle's rules, if there are remaining
2020 * rules, it means we just need to modify the FTE in FW, and
2021 * unlock/decrease the refcount we increased before.
2022 * Otherwise, it means the FTE should be deleted. First delete the
2023 * FTE in FW. Then, unlock the FTE, and proceed the tree_put_node of
2024 * the FTE, which will handle the last decrease of the refcount, as
2025 * well as required handling of its parent.
2026 */
2027 fs_get_obj(fte, handle->rule[0]->node.parent);
2028 down_write_ref_node(&fte->node, false);
74491de9 2029 for (i = handle->num_rules - 1; i >= 0; i--)
718ce4d6 2030 tree_remove_node(&handle->rule[i]->node, true);
465e7baa
MG		 2031 if (fte->dests_size) {
2032 if (fte->modify_mask)
2033 modify_fte(fte);
718ce4d6 2034 up_write_ref_node(&fte->node, false);
465e7baa 2035 } else if (list_empty(&fte->node.children)) {
718ce4d6 2036 del_hw_fte(&fte->node);
cefc2355
MG		 2037 /* Avoid double call to del_hw_fte */
2038 fte->node.del_hw_func = NULL;
2039 up_write_ref_node(&fte->node, false);
718ce4d6
EB		 2040 tree_put_node(&fte->node, false);
2041 }
74491de9 2042 kfree(handle);
0c56b975 2043}
74491de9 2044EXPORT_SYMBOL(mlx5_del_flow_rules);
0c56b975 2045
2cc43b49
MG		 2046/* Assuming prio->node.children(flow tables) is sorted by level */
2047static struct mlx5_flow_table *find_next_ft(struct mlx5_flow_table *ft)
2048{
2049 struct fs_prio *prio;
2050
2051 fs_get_obj(prio, ft->node.parent);
2052
2053 if (!list_is_last(&ft->node.list, &prio->node.children))
2054 return list_next_entry(ft, node.list);
2055 return find_next_chained_ft(prio);
2056}
2057
2058static int update_root_ft_destroy(struct mlx5_flow_table *ft)
2059{
2060 struct mlx5_flow_root_namespace *root = find_root(&ft->node);
dae37456 2061 struct mlx5_ft_underlay_qp *uqp;
2cc43b49 2062 struct mlx5_flow_table *new_root_ft = NULL;
dae37456
AV		 2063 int err = 0;
2064 u32 qpn;
2cc43b49
MG		 2065
2066 if (root->root_ft != ft)
2067 return 0;
2068
2069 new_root_ft = find_next_ft(ft);
dae37456
AV		 2070 if (!new_root_ft) {
2071 root->root_ft = NULL;
2072 return 0;
2073 }
2074
2075 if (list_empty(&root->underlay_qpns)) {
2076 /* Don't set any QPN (zero) in case QPN list is empty */
2077 qpn = 0;
ae288a48 2078 err = root->cmds->update_root_ft(root, new_root_ft,
af76c501 2079 qpn, false);
dae37456
AV		 2080 } else {
2081 list_for_each_entry(uqp, &root->underlay_qpns, list) {
2082 qpn = uqp->qpn;
ae288a48 2083 err = root->cmds->update_root_ft(root,
af76c501
MB		 2084 new_root_ft, qpn,
2085 false);
dae37456
AV		 2086 if (err)
2087 break;
2cc43b49 2088 }
2cc43b49 2089 }
dae37456
AV		 2090
2091 if (err)
2092 mlx5_core_warn(root->dev,
2093 "Update root flow table of id(%u) qpn(%d) failed\n",
2094 ft->id, qpn);
2095 else
2096 root->root_ft = new_root_ft;
2097
2cc43b49
MG		 2098 return 0;
2099}
2100
f90edfd2
MG		 2101/* Connect flow table from previous priority to
2102 * the next flow table.
2103 */
2104static int disconnect_flow_table(struct mlx5_flow_table *ft)
2105{
2106 struct mlx5_core_dev *dev = get_dev(&ft->node);
2107 struct mlx5_flow_table *next_ft;
2108 struct fs_prio *prio;
2109 int err = 0;
2110
2111 err = update_root_ft_destroy(ft);
2112 if (err)
2113 return err;
2114
2115 fs_get_obj(prio, ft->node.parent);
2116 if (!(list_first_entry(&prio->node.children,
2117 struct mlx5_flow_table,
2118 node.list) == ft))
2119 return 0;
2120
2121 next_ft = find_next_chained_ft(prio);
b3638e1a
MG		 2122 err = connect_fwd_rules(dev, next_ft, ft);
2123 if (err)
2124 return err;
2125
f90edfd2
MG		 2126 err = connect_prev_fts(dev, next_ft, prio);
2127 if (err)
2128 mlx5_core_warn(dev, "Failed to disconnect flow table %d\n",
2129 ft->id);
2130 return err;
2131}
2132
86d722ad 2133int mlx5_destroy_flow_table(struct mlx5_flow_table *ft)
0c56b975 2134{
2cc43b49
MG		 2135 struct mlx5_flow_root_namespace *root = find_root(&ft->node);
2136 int err = 0;
2137
2138 mutex_lock(&root->chain_lock);
5281a0c9
PB		 2139 if (!(ft->flags & MLX5_FLOW_TABLE_UNMANAGED))
2140 err = disconnect_flow_table(ft);
2cc43b49
MG		 2141 if (err) {
2142 mutex_unlock(&root->chain_lock);
2143 return err;
2144 }
476d61b7 2145 if (tree_remove_node(&ft->node, false))
0c56b975
MG		 2146 mlx5_core_warn(get_dev(&ft->node), "Flow table %d wasn't destroyed, refcount > 1\n",
2147 ft->id);
2cc43b49 2148 mutex_unlock(&root->chain_lock);
0c56b975 2149
2cc43b49 2150 return err;
0c56b975 2151}
b217ea25 2152EXPORT_SYMBOL(mlx5_destroy_flow_table);
0c56b975 2153
86d722ad 2154void mlx5_destroy_flow_group(struct mlx5_flow_group *fg)
0c56b975 2155{
476d61b7 2156 if (tree_remove_node(&fg->node, false))
0c56b975
MG		 2157 mlx5_core_warn(get_dev(&fg->node), "Flow group %d wasn't destroyed, refcount > 1\n",
2158 fg->id);
2159}
8d2a9d8d 2160EXPORT_SYMBOL(mlx5_destroy_flow_group);
25302363 2161
328edb49
PB		 2162struct mlx5_flow_namespace *mlx5_get_fdb_sub_ns(struct mlx5_core_dev *dev,
2163 int n)
2164{
2165 struct mlx5_flow_steering *steering = dev->priv.steering;
2166
2167 if (!steering || !steering->fdb_sub_ns)
2168 return NULL;
2169
2170 return steering->fdb_sub_ns[n];
2171}
2172EXPORT_SYMBOL(mlx5_get_fdb_sub_ns);
2173
86d722ad
MG		 2174struct mlx5_flow_namespace *mlx5_get_flow_namespace(struct mlx5_core_dev *dev,
2175 enum mlx5_flow_namespace_type type)
25302363 2176{
fba53f7b
MG		 2177 struct mlx5_flow_steering *steering = dev->priv.steering;
2178 struct mlx5_flow_root_namespace *root_ns;
8ce78257 2179 int prio = 0;
78228cbd 2180 struct fs_prio *fs_prio;
25302363
MG		 2181 struct mlx5_flow_namespace *ns;
2182
fba53f7b 2183 if (!steering)
25302363
MG		 2184 return NULL;
2185
2186 switch (type) {
25302363 2187 case MLX5_FLOW_NAMESPACE_FDB:
fba53f7b
MG		 2188 if (steering->fdb_root_ns)
2189 return &steering->fdb_root_ns->ns;
2226dcb4 2190 return NULL;
87d22483
MG		 2191 case MLX5_FLOW_NAMESPACE_SNIFFER_RX:
2192 if (steering->sniffer_rx_root_ns)
2193 return &steering->sniffer_rx_root_ns->ns;
2226dcb4 2194 return NULL;
87d22483
MG		 2195 case MLX5_FLOW_NAMESPACE_SNIFFER_TX:
2196 if (steering->sniffer_tx_root_ns)
2197 return &steering->sniffer_tx_root_ns->ns;
25302363 2198 return NULL;
2226dcb4
MB		 2199 default:
2200 break;
25302363
MG		 2201 }
2202
ee92e4f1
HN		 2203 if (type == MLX5_FLOW_NAMESPACE_EGRESS ||
2204 type == MLX5_FLOW_NAMESPACE_EGRESS_KERNEL) {
8ce78257 2205 root_ns = steering->egress_root_ns;
ee92e4f1 2206 prio = type - MLX5_FLOW_NAMESPACE_EGRESS;
e6806e9a
MZ		 2207 } else if (type == MLX5_FLOW_NAMESPACE_RDMA_RX) {
2208 root_ns = steering->rdma_rx_root_ns;
2209 prio = RDMA_RX_BYPASS_PRIO;
2210 } else if (type == MLX5_FLOW_NAMESPACE_RDMA_RX_KERNEL) {
2211 root_ns = steering->rdma_rx_root_ns;
2212 prio = RDMA_RX_KERNEL_PRIO;
24670b1a
MG		 2213 } else if (type == MLX5_FLOW_NAMESPACE_RDMA_TX) {
2214 root_ns = steering->rdma_tx_root_ns;
8ce78257
MB		 2215 } else { /* Must be NIC RX */
2216 root_ns = steering->root_ns;
2217 prio = type;
25302363
MG		 2218 }
2219
fba53f7b
MG		 2220 if (!root_ns)
2221 return NULL;
2222
25302363
MG		 2223 fs_prio = find_prio(&root_ns->ns, prio);
2224 if (!fs_prio)
2225 return NULL;
2226
2227 ns = list_first_entry(&fs_prio->node.children,
2228 typeof(*ns),
2229 node.list);
2230
2231 return ns;
2232}
b217ea25 2233EXPORT_SYMBOL(mlx5_get_flow_namespace);
25302363 2234
9b93ab98
GP		 2235struct mlx5_flow_namespace *mlx5_get_flow_vport_acl_namespace(struct mlx5_core_dev *dev,
2236 enum mlx5_flow_namespace_type type,
2237 int vport)
2238{
2239 struct mlx5_flow_steering *steering = dev->priv.steering;
2240
57b92bdd 2241 if (!steering)
9b93ab98
GP		 2242 return NULL;
2243
2244 switch (type) {
2245 case MLX5_FLOW_NAMESPACE_ESW_EGRESS:
57b92bdd
PP		 2246 if (vport >= steering->esw_egress_acl_vports)
2247 return NULL;
9b93ab98
GP		 2248 if (steering->esw_egress_root_ns &&
2249 steering->esw_egress_root_ns[vport])
2250 return &steering->esw_egress_root_ns[vport]->ns;
2251 else
2252 return NULL;
2253 case MLX5_FLOW_NAMESPACE_ESW_INGRESS:
57b92bdd
PP		 2254 if (vport >= steering->esw_ingress_acl_vports)
2255 return NULL;
9b93ab98
GP		 2256 if (steering->esw_ingress_root_ns &&
2257 steering->esw_ingress_root_ns[vport])
2258 return &steering->esw_ingress_root_ns[vport]->ns;
2259 else
2260 return NULL;
2261 default:
2262 return NULL;
2263 }
2264}
2265
328edb49
PB		 2266static struct fs_prio *_fs_create_prio(struct mlx5_flow_namespace *ns,
2267 unsigned int prio,
2268 int num_levels,
2269 enum fs_node_type type)
25302363
MG		 2270{
2271 struct fs_prio *fs_prio;
2272
2273 fs_prio = kzalloc(sizeof(*fs_prio), GFP_KERNEL);
2274 if (!fs_prio)
2275 return ERR_PTR(-ENOMEM);
2276
328edb49 2277 fs_prio->node.type = type;
139ed6c6 2278 tree_init_node(&fs_prio->node, NULL, del_sw_prio);
25302363 2279 tree_add_node(&fs_prio->node, &ns->node);
a257b94a 2280 fs_prio->num_levels = num_levels;
25302363 2281 fs_prio->prio = prio;
25302363
MG		 2282 list_add_tail(&fs_prio->node.list, &ns->node.children);
2283
2284 return fs_prio;
2285}
2286
328edb49
PB		 2287static struct fs_prio *fs_create_prio_chained(struct mlx5_flow_namespace *ns,
2288 unsigned int prio,
2289 int num_levels)
2290{
2291 return _fs_create_prio(ns, prio, num_levels, FS_TYPE_PRIO_CHAINS);
2292}
2293
2294static struct fs_prio *fs_create_prio(struct mlx5_flow_namespace *ns,
2295 unsigned int prio, int num_levels)
2296{
2297 return _fs_create_prio(ns, prio, num_levels, FS_TYPE_PRIO);
2298}
2299
25302363
MG		 2300static struct mlx5_flow_namespace *fs_init_namespace(struct mlx5_flow_namespace
2301 *ns)
2302{
2303 ns->node.type = FS_TYPE_NAMESPACE;
2304
2305 return ns;
2306}
2307
f66ad830
MZ		 2308static struct mlx5_flow_namespace *fs_create_namespace(struct fs_prio *prio,
2309 int def_miss_act)
25302363
MG		 2310{
2311 struct mlx5_flow_namespace *ns;
2312
2313 ns = kzalloc(sizeof(*ns), GFP_KERNEL);
2314 if (!ns)
2315 return ERR_PTR(-ENOMEM);
2316
2317 fs_init_namespace(ns);
f66ad830 2318 ns->def_miss_action = def_miss_act;
139ed6c6 2319 tree_init_node(&ns->node, NULL, del_sw_ns);
25302363
MG		 2320 tree_add_node(&ns->node, &prio->node);
2321 list_add_tail(&ns->node.list, &prio->node.children);
2322
2323 return ns;
2324}
2325
13de6c10
MG		 2326static int create_leaf_prios(struct mlx5_flow_namespace *ns, int prio,
2327 struct init_tree_node *prio_metadata)
4cbdd30e
MG		 2328{
2329 struct fs_prio *fs_prio;
2330 int i;
2331
2332 for (i = 0; i < prio_metadata->num_leaf_prios; i++) {
13de6c10 2333 fs_prio = fs_create_prio(ns, prio++, prio_metadata->num_levels);
4cbdd30e
MG		 2334 if (IS_ERR(fs_prio))
2335 return PTR_ERR(fs_prio);
2336 }
2337 return 0;
2338}
2339
8d40d162
MG		 2340#define FLOW_TABLE_BIT_SZ 1
2341#define GET_FLOW_TABLE_CAP(dev, offset) \
701052c5 2342 ((be32_to_cpu(*((__be32 *)(dev->caps.hca_cur[MLX5_CAP_FLOW_TABLE]) + \
8d40d162
MG		 2343 offset / 32)) >> \
2344 (32 - FLOW_TABLE_BIT_SZ - (offset & 0x1f))) & FLOW_TABLE_BIT_SZ)
2345static bool has_required_caps(struct mlx5_core_dev *dev, struct node_caps *caps)
2346{
2347 int i;
2348
2349 for (i = 0; i < caps->arr_sz; i++) {
2350 if (!GET_FLOW_TABLE_CAP(dev, caps->caps[i]))
2351 return false;
2352 }
2353 return true;
2354}
2355
fba53f7b 2356static int init_root_tree_recursive(struct mlx5_flow_steering *steering,
8d40d162 2357 struct init_tree_node *init_node,
25302363
MG		 2358 struct fs_node *fs_parent_node,
2359 struct init_tree_node *init_parent_node,
13de6c10 2360 int prio)
25302363 2361{
fba53f7b 2362 int max_ft_level = MLX5_CAP_FLOWTABLE(steering->dev,
8d40d162
MG		 2363 flow_table_properties_nic_receive.
2364 max_ft_level);
25302363
MG		 2365 struct mlx5_flow_namespace *fs_ns;
2366 struct fs_prio *fs_prio;
2367 struct fs_node *base;
2368 int i;
2369 int err;
2370
2371 if (init_node->type == FS_TYPE_PRIO) {
8d40d162 2372 if ((init_node->min_ft_level > max_ft_level) ||
fba53f7b 2373 !has_required_caps(steering->dev, &init_node->caps))
8d40d162 2374 return 0;
25302363
MG		 2375
2376 fs_get_obj(fs_ns, fs_parent_node);
4cbdd30e 2377 if (init_node->num_leaf_prios)
13de6c10
MG		 2378 return create_leaf_prios(fs_ns, prio, init_node);
2379 fs_prio = fs_create_prio(fs_ns, prio, init_node->num_levels);
25302363
MG		 2380 if (IS_ERR(fs_prio))
2381 return PTR_ERR(fs_prio);
2382 base = &fs_prio->node;
2383 } else if (init_node->type == FS_TYPE_NAMESPACE) {
2384 fs_get_obj(fs_prio, fs_parent_node);
f66ad830 2385 fs_ns = fs_create_namespace(fs_prio, init_node->def_miss_action);
25302363
MG		 2386 if (IS_ERR(fs_ns))
2387 return PTR_ERR(fs_ns);
2388 base = &fs_ns->node;
2389 } else {
2390 return -EINVAL;
2391 }
13de6c10 2392 prio = 0;
25302363 2393 for (i = 0; i < init_node->ar_size; i++) {
fba53f7b 2394 err = init_root_tree_recursive(steering, &init_node->children[i],
13de6c10 2395 base, init_node, prio);
25302363
MG		 2396 if (err)
2397 return err;
13de6c10
MG		 2398 if (init_node->children[i].type == FS_TYPE_PRIO &&
2399 init_node->children[i].num_leaf_prios) {
2400 prio += init_node->children[i].num_leaf_prios;
2401 }
25302363
MG		 2402 }
2403
2404 return 0;
2405}
2406
fba53f7b 2407static int init_root_tree(struct mlx5_flow_steering *steering,
8d40d162 2408 struct init_tree_node *init_node,
25302363
MG		 2409 struct fs_node *fs_parent_node)
2410{
25302363 2411 int err;
61e9508f 2412 int i;
25302363 2413
25302363 2414 for (i = 0; i < init_node->ar_size; i++) {
fba53f7b 2415 err = init_root_tree_recursive(steering, &init_node->children[i],
61e9508f 2416 fs_parent_node,
25302363
MG		 2417 init_node, i);
2418 if (err)
2419 return err;
2420 }
2421 return 0;
2422}
2423
6eb7a268
RD		 2424static void del_sw_root_ns(struct fs_node *node)
2425{
9ca41539
RD		 2426 struct mlx5_flow_root_namespace *root_ns;
2427 struct mlx5_flow_namespace *ns;
2428
2429 fs_get_obj(ns, node);
2430 root_ns = container_of(ns, struct mlx5_flow_root_namespace, ns);
2431 mutex_destroy(&root_ns->chain_lock);
6eb7a268
RD		 2432 kfree(node);
2433}
2434
af76c501
MB		 2435static struct mlx5_flow_root_namespace
2436*create_root_ns(struct mlx5_flow_steering *steering,
2437 enum fs_flow_table_type table_type)
25302363 2438{
af76c501 2439 const struct mlx5_flow_cmds *cmds = mlx5_fs_cmd_get_default(table_type);
25302363
MG		 2440 struct mlx5_flow_root_namespace *root_ns;
2441 struct mlx5_flow_namespace *ns;
2442
8c8eea07 2443 if (mlx5_fpga_ipsec_device_caps(steering->dev) & MLX5_ACCEL_IPSEC_CAP_DEVICE &&
05564d0a
AY		 2444 (table_type == FS_FT_NIC_RX || table_type == FS_FT_NIC_TX))
2445 cmds = mlx5_fs_cmd_get_default_ipsec_fpga_cmds(table_type);
2446
86d722ad 2447 /* Create the root namespace */
25fa506b 2448 root_ns = kzalloc(sizeof(*root_ns), GFP_KERNEL);
25302363
MG		 2449 if (!root_ns)
2450 return NULL;
2451
fba53f7b 2452 root_ns->dev = steering->dev;
25302363 2453 root_ns->table_type = table_type;
af76c501 2454 root_ns->cmds = cmds;
25302363 2455
dae37456
AV		 2456 INIT_LIST_HEAD(&root_ns->underlay_qpns);
2457
25302363
MG		 2458 ns = &root_ns->ns;
2459 fs_init_namespace(ns);
2cc43b49 2460 mutex_init(&root_ns->chain_lock);
6eb7a268 2461 tree_init_node(&ns->node, NULL, del_sw_root_ns);
25302363
MG		 2462 tree_add_node(&ns->node, NULL);
2463
2464 return root_ns;
2465}
2466
655227ed
MG		 2467static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level);
2468
2469static int set_prio_attrs_in_ns(struct mlx5_flow_namespace *ns, int acc_level)
2470{
2471 struct fs_prio *prio;
2472
2473 fs_for_each_prio(prio, ns) {
a257b94a 2474 /* This updates prio start_level and num_levels */
655227ed 2475 set_prio_attrs_in_prio(prio, acc_level);
a257b94a 2476 acc_level += prio->num_levels;
655227ed
MG		 2477 }
2478 return acc_level;
2479}
2480
2481static void set_prio_attrs_in_prio(struct fs_prio *prio, int acc_level)
2482{
2483 struct mlx5_flow_namespace *ns;
2484 int acc_level_ns = acc_level;
2485
2486 prio->start_level = acc_level;
34b13cb3 2487 fs_for_each_ns(ns, prio) {
a257b94a 2488 /* This updates start_level and num_levels of ns's priority descendants */
655227ed 2489 acc_level_ns = set_prio_attrs_in_ns(ns, acc_level);
34b13cb3
PB		 2490
2491 /* If this a prio with chains, and we can jump from one chain
2492 * (namepsace) to another, so we accumulate the levels
2493 */
2494 if (prio->node.type == FS_TYPE_PRIO_CHAINS)
2495 acc_level = acc_level_ns;
2496 }
2497
a257b94a
MG		 2498 if (!prio->num_levels)
2499 prio->num_levels = acc_level_ns - prio->start_level;
2500 WARN_ON(prio->num_levels < acc_level_ns - prio->start_level);
655227ed
MG		 2501}
2502
2503static void set_prio_attrs(struct mlx5_flow_root_namespace *root_ns)
2504{
2505 struct mlx5_flow_namespace *ns = &root_ns->ns;
2506 struct fs_prio *prio;
2507 int start_level = 0;
2508
2509 fs_for_each_prio(prio, ns) {
2510 set_prio_attrs_in_prio(prio, start_level);
a257b94a 2511 start_level += prio->num_levels;
655227ed
MG		 2512 }
2513}
2514
153fefbf
MG		 2515#define ANCHOR_PRIO 0
2516#define ANCHOR_SIZE 1
d63cd286 2517#define ANCHOR_LEVEL 0
fba53f7b 2518static int create_anchor_flow_table(struct mlx5_flow_steering *steering)
153fefbf
MG		 2519{
2520 struct mlx5_flow_namespace *ns = NULL;
b3ba5149 2521 struct mlx5_flow_table_attr ft_attr = {};
153fefbf
MG		 2522 struct mlx5_flow_table *ft;
2523
fba53f7b 2524 ns = mlx5_get_flow_namespace(steering->dev, MLX5_FLOW_NAMESPACE_ANCHOR);
eff596da 2525 if (WARN_ON(!ns))
153fefbf 2526 return -EINVAL;
b3ba5149
ES		 2527
2528 ft_attr.max_fte = ANCHOR_SIZE;
2529 ft_attr.level = ANCHOR_LEVEL;
2530 ft_attr.prio = ANCHOR_PRIO;
2531
2532 ft = mlx5_create_flow_table(ns, &ft_attr);
153fefbf 2533 if (IS_ERR(ft)) {
fba53f7b 2534 mlx5_core_err(steering->dev, "Failed to create last anchor flow table");
153fefbf
MG		 2535 return PTR_ERR(ft);
2536 }
2537 return 0;
2538}
2539
fba53f7b 2540static int init_root_ns(struct mlx5_flow_steering *steering)
25302363 2541{
9c26f5f8
TB		 2542 int err;
2543
fba53f7b 2544 steering->root_ns = create_root_ns(steering, FS_FT_NIC_RX);
42fb18fd 2545 if (!steering->root_ns)
9c26f5f8 2546 return -ENOMEM;
25302363 2547
9c26f5f8
TB		 2548 err = init_root_tree(steering, &root_fs, &steering->root_ns->ns.node);
2549 if (err)
2550 goto out_err;
25302363 2551
fba53f7b 2552 set_prio_attrs(steering->root_ns);
9c26f5f8
TB		 2553 err = create_anchor_flow_table(steering);
2554 if (err)
2555 goto out_err;
153fefbf 2556
25302363
MG		 2557 return 0;
2558
9c26f5f8
TB		 2559out_err:
2560 cleanup_root_ns(steering->root_ns);
2561 steering->root_ns = NULL;
2562 return err;
25302363
MG		 2563}
2564
0da2d666 2565static void clean_tree(struct fs_node *node)
25302363 2566{
0da2d666
MG		 2567 if (node) {
2568 struct fs_node *iter;
2569 struct fs_node *temp;
25302363 2570
800350a3 2571 tree_get_node(node);
0da2d666
MG		 2572 list_for_each_entry_safe(iter, temp, &node->children, list)
2573 clean_tree(iter);
476d61b7
EB		 2574 tree_put_node(node, false);
2575 tree_remove_node(node, false);
25302363 2576 }
153fefbf
MG		 2577}
2578
0da2d666 2579static void cleanup_root_ns(struct mlx5_flow_root_namespace *root_ns)
25302363 2580{
25302363
MG		 2581 if (!root_ns)
2582 return;
2583
0da2d666 2584 clean_tree(&root_ns->ns.node);
25302363
MG		 2585}
2586
2587void mlx5_cleanup_fs(struct mlx5_core_dev *dev)
2588{
fba53f7b
MG		 2589 struct mlx5_flow_steering *steering = dev->priv.steering;
2590
0da2d666 2591 cleanup_root_ns(steering->root_ns);
0da2d666 2592 cleanup_root_ns(steering->fdb_root_ns);
328edb49
PB		 2593 steering->fdb_root_ns = NULL;
2594 kfree(steering->fdb_sub_ns);
2595 steering->fdb_sub_ns = NULL;
87d22483
MG		 2596 cleanup_root_ns(steering->sniffer_rx_root_ns);
2597 cleanup_root_ns(steering->sniffer_tx_root_ns);
d83eb50e 2598 cleanup_root_ns(steering->rdma_rx_root_ns);
24670b1a 2599 cleanup_root_ns(steering->rdma_tx_root_ns);
5f418378 2600 cleanup_root_ns(steering->egress_root_ns);
43a335e0 2601 mlx5_cleanup_fc_stats(dev);
a369d4ac
MG		 2602 kmem_cache_destroy(steering->ftes_cache);
2603 kmem_cache_destroy(steering->fgs_cache);
4a98544d 2604 mlx5_ft_pool_destroy(dev);
fba53f7b 2605 kfree(steering);
25302363
MG		 2606}
2607
87d22483
MG		 2608static int init_sniffer_tx_root_ns(struct mlx5_flow_steering *steering)
2609{
2610 struct fs_prio *prio;
2611
2612 steering->sniffer_tx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_TX);
2613 if (!steering->sniffer_tx_root_ns)
2614 return -ENOMEM;
2615
2616 /* Create single prio */
2617 prio = fs_create_prio(&steering->sniffer_tx_root_ns->ns, 0, 1);
905f6bd3 2618 return PTR_ERR_OR_ZERO(prio);
87d22483
MG		 2619}
2620
2621static int init_sniffer_rx_root_ns(struct mlx5_flow_steering *steering)
2622{
2623 struct fs_prio *prio;
2624
2625 steering->sniffer_rx_root_ns = create_root_ns(steering, FS_FT_SNIFFER_RX);
2626 if (!steering->sniffer_rx_root_ns)
2627 return -ENOMEM;
2628
2629 /* Create single prio */
2630 prio = fs_create_prio(&steering->sniffer_rx_root_ns->ns, 0, 1);
905f6bd3 2631 return PTR_ERR_OR_ZERO(prio);
87d22483
MG		 2632}
2633
d83eb50e
MG		 2634static int init_rdma_rx_root_ns(struct mlx5_flow_steering *steering)
2635{
e6806e9a 2636 int err;
d83eb50e
MG		 2637
2638 steering->rdma_rx_root_ns = create_root_ns(steering, FS_FT_RDMA_RX);
2639 if (!steering->rdma_rx_root_ns)
2640 return -ENOMEM;
2641
e6806e9a
MZ		 2642 err = init_root_tree(steering, &rdma_rx_root_fs,
2643 &steering->rdma_rx_root_ns->ns.node);
2644 if (err)
2645 goto out_err;
f6f7d6b5 2646
e6806e9a
MZ		 2647 set_prio_attrs(steering->rdma_rx_root_ns);
2648
2649 return 0;
2650
2651out_err:
2652 cleanup_root_ns(steering->rdma_rx_root_ns);
2653 steering->rdma_rx_root_ns = NULL;
2654 return err;
d83eb50e 2655}
439e843f 2656
24670b1a
MG		 2657static int init_rdma_tx_root_ns(struct mlx5_flow_steering *steering)
2658{
2659 int err;
2660
2661 steering->rdma_tx_root_ns = create_root_ns(steering, FS_FT_RDMA_TX);
2662 if (!steering->rdma_tx_root_ns)
2663 return -ENOMEM;
2664
2665 err = init_root_tree(steering, &rdma_tx_root_fs,
2666 &steering->rdma_tx_root_ns->ns.node);
2667 if (err)
2668 goto out_err;
2669
2670 set_prio_attrs(steering->rdma_tx_root_ns);
2671
2672 return 0;
2673
2674out_err:
2675 cleanup_root_ns(steering->rdma_tx_root_ns);
2676 steering->rdma_tx_root_ns = NULL;
2677 return err;
2678}
2679
439e843f
PB		 2680/* FT and tc chains are stored in the same array so we can re-use the
2681 * mlx5_get_fdb_sub_ns() and tc api for FT chains.
2682 * When creating a new ns for each chain store it in the first available slot.
2683 * Assume tc chains are created and stored first and only then the FT chain.
2684 */
2685static void store_fdb_sub_ns_prio_chain(struct mlx5_flow_steering *steering,
2686 struct mlx5_flow_namespace *ns)
2687{
2688 int chain = 0;
2689
2690 while (steering->fdb_sub_ns[chain])
2691 ++chain;
2692
2693 steering->fdb_sub_ns[chain] = ns;
2694}
2695
2696static int create_fdb_sub_ns_prio_chain(struct mlx5_flow_steering *steering,
2697 struct fs_prio *maj_prio)
25302363 2698{
328edb49 2699 struct mlx5_flow_namespace *ns;
328edb49 2700 struct fs_prio *min_prio;
439e843f
PB		 2701 int prio;
2702
2703 ns = fs_create_namespace(maj_prio, MLX5_FLOW_TABLE_MISS_ACTION_DEF);
2704 if (IS_ERR(ns))
2705 return PTR_ERR(ns);
2706
2707 for (prio = 0; prio < FDB_TC_MAX_PRIO; prio++) {
2708 min_prio = fs_create_prio(ns, prio, FDB_TC_LEVELS_PER_PRIO);
2709 if (IS_ERR(min_prio))
2710 return PTR_ERR(min_prio);
2711 }
2712
2713 store_fdb_sub_ns_prio_chain(steering, ns);
2714
2715 return 0;
2716}
2717
2718static int create_fdb_chains(struct mlx5_flow_steering *steering,
2719 int fs_prio,
2720 int chains)
2721{
2722 struct fs_prio *maj_prio;
328edb49
PB		 2723 int levels;
2724 int chain;
328edb49 2725 int err;
25302363 2726
439e843f
PB		 2727 levels = FDB_TC_LEVELS_PER_PRIO * FDB_TC_MAX_PRIO * chains;
2728 maj_prio = fs_create_prio_chained(&steering->fdb_root_ns->ns,
2729 fs_prio,
2730 levels);
2731 if (IS_ERR(maj_prio))
2732 return PTR_ERR(maj_prio);
2733
2734 for (chain = 0; chain < chains; chain++) {
2735 err = create_fdb_sub_ns_prio_chain(steering, maj_prio);
2736 if (err)
2737 return err;
2738 }
2739
2740 return 0;
2741}
25302363 2742
439e843f
PB		 2743static int create_fdb_fast_path(struct mlx5_flow_steering *steering)
2744{
439e843f
PB		 2745 int err;
2746
975b992f 2747 steering->fdb_sub_ns = kcalloc(FDB_NUM_CHAINS,
439e843f
PB		 2748 sizeof(*steering->fdb_sub_ns),
2749 GFP_KERNEL);
328edb49
PB		 2750 if (!steering->fdb_sub_ns)
2751 return -ENOMEM;
2752
975b992f
PB		 2753 err = create_fdb_chains(steering, FDB_TC_OFFLOAD, FDB_TC_MAX_CHAIN + 1);
2754 if (err)
2755 return err;
2756
2757 err = create_fdb_chains(steering, FDB_FT_OFFLOAD, 1);
439e843f
PB		 2758 if (err)
2759 return err;
2760
2761 return 0;
2762}
2763
2764static int init_fdb_root_ns(struct mlx5_flow_steering *steering)
2765{
2766 struct fs_prio *maj_prio;
2767 int err;
2768
2769 steering->fdb_root_ns = create_root_ns(steering, FS_FT_FDB);
2770 if (!steering->fdb_root_ns)
2771 return -ENOMEM;
2772
d9cb0675
MB		 2773 maj_prio = fs_create_prio(&steering->fdb_root_ns->ns, FDB_BYPASS_PATH,
2774 1);
2775 if (IS_ERR(maj_prio)) {
2776 err = PTR_ERR(maj_prio);
2777 goto out_err;
2778 }
439e843f
PB		 2779 err = create_fdb_fast_path(steering);
2780 if (err)
1033665e 2781 goto out_err;
328edb49 2782
b6d9ccb1 2783 maj_prio = fs_create_prio(&steering->fdb_root_ns->ns, FDB_SLOW_PATH, 1);
328edb49
PB		 2784 if (IS_ERR(maj_prio)) {
2785 err = PTR_ERR(maj_prio);
1033665e 2786 goto out_err;
328edb49 2787 }
1033665e 2788
96e32687
EC		 2789 /* We put this priority last, knowing that nothing will get here
2790 * unless explicitly forwarded to. This is possible because the
2791 * slow path tables have catch all rules and nothing gets passed
2792 * those tables.
2793 */
2794 maj_prio = fs_create_prio(&steering->fdb_root_ns->ns, FDB_PER_VPORT, 1);
2795 if (IS_ERR(maj_prio)) {
2796 err = PTR_ERR(maj_prio);
2797 goto out_err;
2798 }
2799
1033665e
OG		 2800 set_prio_attrs(steering->fdb_root_ns);
2801 return 0;
2802
2803out_err:
2804 cleanup_root_ns(steering->fdb_root_ns);
328edb49
PB		 2805 kfree(steering->fdb_sub_ns);
2806 steering->fdb_sub_ns = NULL;
1033665e 2807 steering->fdb_root_ns = NULL;
328edb49 2808 return err;
25302363
MG		 2809}
2810
9b93ab98 2811static int init_egress_acl_root_ns(struct mlx5_flow_steering *steering, int vport)
efdc810b
MHY		 2812{
2813 struct fs_prio *prio;
2814
9b93ab98
GP		 2815 steering->esw_egress_root_ns[vport] = create_root_ns(steering, FS_FT_ESW_EGRESS_ACL);
2816 if (!steering->esw_egress_root_ns[vport])
efdc810b
MHY		 2817 return -ENOMEM;
2818
2819 /* create 1 prio*/
9b93ab98 2820 prio = fs_create_prio(&steering->esw_egress_root_ns[vport]->ns, 0, 1);
44fafdaa 2821 return PTR_ERR_OR_ZERO(prio);
efdc810b
MHY		 2822}
2823
9b93ab98 2824static int init_ingress_acl_root_ns(struct mlx5_flow_steering *steering, int vport)
efdc810b
MHY		 2825{
2826 struct fs_prio *prio;
2827
9b93ab98
GP		 2828 steering->esw_ingress_root_ns[vport] = create_root_ns(steering, FS_FT_ESW_INGRESS_ACL);
2829 if (!steering->esw_ingress_root_ns[vport])
efdc810b
MHY		 2830 return -ENOMEM;
2831
2832 /* create 1 prio*/
9b93ab98 2833 prio = fs_create_prio(&steering->esw_ingress_root_ns[vport]->ns, 0, 1);
44fafdaa 2834 return PTR_ERR_OR_ZERO(prio);
efdc810b
MHY		 2835}
2836
57b92bdd 2837int mlx5_fs_egress_acls_init(struct mlx5_core_dev *dev, int total_vports)
9b93ab98
GP		 2838{
2839 struct mlx5_flow_steering *steering = dev->priv.steering;
2840 int err;
2841 int i;
2842
2752b823
PP		 2843 steering->esw_egress_root_ns =
2844 kcalloc(total_vports,
2845 sizeof(*steering->esw_egress_root_ns),
2846 GFP_KERNEL);
9b93ab98
GP		 2847 if (!steering->esw_egress_root_ns)
2848 return -ENOMEM;
2849
2752b823 2850 for (i = 0; i < total_vports; i++) {
9b93ab98
GP		 2851 err = init_egress_acl_root_ns(steering, i);
2852 if (err)
2853 goto cleanup_root_ns;
2854 }
57b92bdd 2855 steering->esw_egress_acl_vports = total_vports;
9b93ab98
GP		 2856 return 0;
2857
2858cleanup_root_ns:
2859 for (i--; i >= 0; i--)
2860 cleanup_root_ns(steering->esw_egress_root_ns[i]);
2861 kfree(steering->esw_egress_root_ns);
9414277a 2862 steering->esw_egress_root_ns = NULL;
9b93ab98
GP		 2863 return err;
2864}
2865
57b92bdd
PP		 2866void mlx5_fs_egress_acls_cleanup(struct mlx5_core_dev *dev)
2867{
2868 struct mlx5_flow_steering *steering = dev->priv.steering;
2869 int i;
2870
2871 if (!steering->esw_egress_root_ns)
2872 return;
2873
2874 for (i = 0; i < steering->esw_egress_acl_vports; i++)
2875 cleanup_root_ns(steering->esw_egress_root_ns[i]);
2876
2877 kfree(steering->esw_egress_root_ns);
2878 steering->esw_egress_root_ns = NULL;
2879}
2880
2881int mlx5_fs_ingress_acls_init(struct mlx5_core_dev *dev, int total_vports)
9b93ab98
GP		 2882{
2883 struct mlx5_flow_steering *steering = dev->priv.steering;
2884 int err;
2885 int i;
2886
2752b823
PP		 2887 steering->esw_ingress_root_ns =
2888 kcalloc(total_vports,
2889 sizeof(*steering->esw_ingress_root_ns),
2890 GFP_KERNEL);
9b93ab98
GP		 2891 if (!steering->esw_ingress_root_ns)
2892 return -ENOMEM;
2893
2752b823 2894 for (i = 0; i < total_vports; i++) {
9b93ab98
GP		 2895 err = init_ingress_acl_root_ns(steering, i);
2896 if (err)
2897 goto cleanup_root_ns;
2898 }
57b92bdd 2899 steering->esw_ingress_acl_vports = total_vports;
9b93ab98
GP		 2900 return 0;
2901
2902cleanup_root_ns:
2903 for (i--; i >= 0; i--)
2904 cleanup_root_ns(steering->esw_ingress_root_ns[i]);
2905 kfree(steering->esw_ingress_root_ns);
9414277a 2906 steering->esw_ingress_root_ns = NULL;
9b93ab98
GP		 2907 return err;
2908}
2909
57b92bdd
PP		 2910void mlx5_fs_ingress_acls_cleanup(struct mlx5_core_dev *dev)
2911{
2912 struct mlx5_flow_steering *steering = dev->priv.steering;
2913 int i;
2914
2915 if (!steering->esw_ingress_root_ns)
2916 return;
2917
2918 for (i = 0; i < steering->esw_ingress_acl_vports; i++)
2919 cleanup_root_ns(steering->esw_ingress_root_ns[i]);
2920
2921 kfree(steering->esw_ingress_root_ns);
2922 steering->esw_ingress_root_ns = NULL;
2923}
2924
5f418378
AY		 2925static int init_egress_root_ns(struct mlx5_flow_steering *steering)
2926{
8ce78257 2927 int err;
5f418378
AY		 2928
2929 steering->egress_root_ns = create_root_ns(steering,
2930 FS_FT_NIC_TX);
2931 if (!steering->egress_root_ns)
2932 return -ENOMEM;
2933
8ce78257
MB		 2934 err = init_root_tree(steering, &egress_root_fs,
2935 &steering->egress_root_ns->ns.node);
2936 if (err)
2937 goto cleanup;
2938 set_prio_attrs(steering->egress_root_ns);
2939 return 0;
2940cleanup:
2941 cleanup_root_ns(steering->egress_root_ns);
2942 steering->egress_root_ns = NULL;
2943 return err;
5f418378
AY		 2944}
2945
25302363
MG		 2946int mlx5_init_fs(struct mlx5_core_dev *dev)
2947{
fba53f7b 2948 struct mlx5_flow_steering *steering;
25302363
MG		 2949 int err = 0;
2950
43a335e0
AV		 2951 err = mlx5_init_fc_stats(dev);
2952 if (err)
2953 return err;
2954
4a98544d
PB		 2955 err = mlx5_ft_pool_init(dev);
2956 if (err)
2957 return err;
2958
fba53f7b
MG		 2959 steering = kzalloc(sizeof(*steering), GFP_KERNEL);
2960 if (!steering)
4a98544d 2961 goto err;
fba53f7b
MG		 2962 steering->dev = dev;
2963 dev->priv.steering = steering;
2964
a369d4ac
MG		 2965 steering->fgs_cache = kmem_cache_create("mlx5_fs_fgs",
2966 sizeof(struct mlx5_flow_group), 0,
2967 0, NULL);
2968 steering->ftes_cache = kmem_cache_create("mlx5_fs_ftes", sizeof(struct fs_fte), 0,
2969 0, NULL);
2970 if (!steering->ftes_cache || !steering->fgs_cache) {
2971 err = -ENOMEM;
2972 goto err;
2973 }
2974
ffdb8827
ES		 2975 if ((((MLX5_CAP_GEN(dev, port_type) == MLX5_CAP_PORT_TYPE_ETH) &&
2976 (MLX5_CAP_GEN(dev, nic_flow_table))) ||
2977 ((MLX5_CAP_GEN(dev, port_type) == MLX5_CAP_PORT_TYPE_IB) &&
2978 MLX5_CAP_GEN(dev, ipoib_enhanced_offloads))) &&
876d634d 2979 MLX5_CAP_FLOWTABLE_NIC_RX(dev, ft_support)) {
fba53f7b 2980 err = init_root_ns(steering);
25302363 2981 if (err)
43a335e0 2982 goto err;
25302363 2983 }
876d634d 2984
0efc8562 2985 if (MLX5_ESWITCH_MANAGER(dev)) {
bd02ef8e 2986 if (MLX5_CAP_ESW_FLOWTABLE_FDB(dev, ft_support)) {
fba53f7b 2987 err = init_fdb_root_ns(steering);
bd02ef8e
MG		 2988 if (err)
2989 goto err;
2990 }
25302363
MG		 2991 }
2992
87d22483
MG		 2993 if (MLX5_CAP_FLOWTABLE_SNIFFER_RX(dev, ft_support)) {
2994 err = init_sniffer_rx_root_ns(steering);
2995 if (err)
2996 goto err;
2997 }
2998
2999 if (MLX5_CAP_FLOWTABLE_SNIFFER_TX(dev, ft_support)) {
3000 err = init_sniffer_tx_root_ns(steering);
3001 if (err)
3002 goto err;
3003 }
3004
f6f7d6b5
MG		 3005 if (MLX5_CAP_FLOWTABLE_RDMA_RX(dev, ft_support) &&
3006 MLX5_CAP_FLOWTABLE_RDMA_RX(dev, table_miss_action_domain)) {
d83eb50e
MG		 3007 err = init_rdma_rx_root_ns(steering);
3008 if (err)
3009 goto err;
3010 }
3011
24670b1a
MG		 3012 if (MLX5_CAP_FLOWTABLE_RDMA_TX(dev, ft_support)) {
3013 err = init_rdma_tx_root_ns(steering);
3014 if (err)
3015 goto err;
3016 }
3017
8c8eea07
RS		 3018 if (mlx5_fpga_ipsec_device_caps(steering->dev) & MLX5_ACCEL_IPSEC_CAP_DEVICE ||
3019 MLX5_CAP_FLOWTABLE_NIC_TX(dev, ft_support)) {
5f418378
AY		 3020 err = init_egress_root_ns(steering);
3021 if (err)
3022 goto err;
3023 }
3024
efdc810b
MHY		 3025 return 0;
3026err:
3027 mlx5_cleanup_fs(dev);
25302363
MG		 3028 return err;
3029}
50854114
YH		 3030
3031int mlx5_fs_add_rx_underlay_qpn(struct mlx5_core_dev *dev, u32 underlay_qpn)
3032{
3033 struct mlx5_flow_root_namespace *root = dev->priv.steering->root_ns;
dae37456
AV		 3034 struct mlx5_ft_underlay_qp *new_uqp;
3035 int err = 0;
3036
3037 new_uqp = kzalloc(sizeof(*new_uqp), GFP_KERNEL);
3038 if (!new_uqp)
3039 return -ENOMEM;
3040
3041 mutex_lock(&root->chain_lock);
3042
3043 if (!root->root_ft) {
3044 err = -EINVAL;
3045 goto update_ft_fail;
3046 }
3047
ae288a48 3048 err = root->cmds->update_root_ft(root, root->root_ft, underlay_qpn,
af76c501 3049 false);
dae37456
AV		 3050 if (err) {
3051 mlx5_core_warn(dev, "Failed adding underlay QPN (%u) to root FT err(%d)\n",
3052 underlay_qpn, err);
3053 goto update_ft_fail;
3054 }
3055
3056 new_uqp->qpn = underlay_qpn;
3057 list_add_tail(&new_uqp->list, &root->underlay_qpns);
3058
3059 mutex_unlock(&root->chain_lock);
50854114 3060
50854114 3061 return 0;
dae37456
AV		 3062
3063update_ft_fail:
3064 mutex_unlock(&root->chain_lock);
3065 kfree(new_uqp);
3066 return err;
50854114
YH		 3067}
3068EXPORT_SYMBOL(mlx5_fs_add_rx_underlay_qpn);
3069
3070int mlx5_fs_remove_rx_underlay_qpn(struct mlx5_core_dev *dev, u32 underlay_qpn)
3071{
3072 struct mlx5_flow_root_namespace *root = dev->priv.steering->root_ns;
dae37456
AV		 3073 struct mlx5_ft_underlay_qp *uqp;
3074 bool found = false;
3075 int err = 0;
3076
3077 mutex_lock(&root->chain_lock);
3078 list_for_each_entry(uqp, &root->underlay_qpns, list) {
3079 if (uqp->qpn == underlay_qpn) {
3080 found = true;
3081 break;
3082 }
3083 }
3084
3085 if (!found) {
3086 mlx5_core_warn(dev, "Failed finding underlay qp (%u) in qpn list\n",
3087 underlay_qpn);
3088 err = -EINVAL;
3089 goto out;
3090 }
3091
ae288a48 3092 err = root->cmds->update_root_ft(root, root->root_ft, underlay_qpn,
af76c501 3093 true);
dae37456
AV		 3094 if (err)
3095 mlx5_core_warn(dev, "Failed removing underlay QPN (%u) from root FT err(%d)\n",
3096 underlay_qpn, err);
3097
3098 list_del(&uqp->list);
3099 mutex_unlock(&root->chain_lock);
3100 kfree(uqp);
50854114 3101
50854114 3102 return 0;
dae37456
AV		 3103
3104out:
3105 mutex_unlock(&root->chain_lock);
3106 return err;
50854114
YH		 3107}
3108EXPORT_SYMBOL(mlx5_fs_remove_rx_underlay_qpn);
2b688ea5
MG		 3109
3110static struct mlx5_flow_root_namespace
3111*get_root_namespace(struct mlx5_core_dev *dev, enum mlx5_flow_namespace_type ns_type)
3112{
3113 struct mlx5_flow_namespace *ns;
3114
3115 if (ns_type == MLX5_FLOW_NAMESPACE_ESW_EGRESS ||
3116 ns_type == MLX5_FLOW_NAMESPACE_ESW_INGRESS)
3117 ns = mlx5_get_flow_vport_acl_namespace(dev, ns_type, 0);
3118 else
3119 ns = mlx5_get_flow_namespace(dev, ns_type);
3120 if (!ns)
3121 return NULL;
3122
3123 return find_root(&ns->node);
3124}
3125
3126struct mlx5_modify_hdr *mlx5_modify_header_alloc(struct mlx5_core_dev *dev,
3127 u8 ns_type, u8 num_actions,
3128 void *modify_actions)
3129{
3130 struct mlx5_flow_root_namespace *root;
3131 struct mlx5_modify_hdr *modify_hdr;
3132 int err;
3133
3134 root = get_root_namespace(dev, ns_type);
3135 if (!root)
3136 return ERR_PTR(-EOPNOTSUPP);
3137
3138 modify_hdr = kzalloc(sizeof(*modify_hdr), GFP_KERNEL);
3139 if (!modify_hdr)
3140 return ERR_PTR(-ENOMEM);
3141
3142 modify_hdr->ns_type = ns_type;
3143 err = root->cmds->modify_header_alloc(root, ns_type, num_actions,
3144 modify_actions, modify_hdr);
3145 if (err) {
3146 kfree(modify_hdr);
3147 return ERR_PTR(err);
3148 }
3149
3150 return modify_hdr;
3151}
3152EXPORT_SYMBOL(mlx5_modify_header_alloc);
3153
3154void mlx5_modify_header_dealloc(struct mlx5_core_dev *dev,
3155 struct mlx5_modify_hdr *modify_hdr)
3156{
3157 struct mlx5_flow_root_namespace *root;
3158
3159 root = get_root_namespace(dev, modify_hdr->ns_type);
3160 if (WARN_ON(!root))
3161 return;
3162 root->cmds->modify_header_dealloc(root, modify_hdr);
3163 kfree(modify_hdr);
3164}
3165EXPORT_SYMBOL(mlx5_modify_header_dealloc);
3166
3167struct mlx5_pkt_reformat *mlx5_packet_reformat_alloc(struct mlx5_core_dev *dev,
3f3f05ab 3168 struct mlx5_pkt_reformat_params *params,
2b688ea5
MG		 3169 enum mlx5_flow_namespace_type ns_type)
3170{
3171 struct mlx5_pkt_reformat *pkt_reformat;
3172 struct mlx5_flow_root_namespace *root;
3173 int err;
3174
3175 root = get_root_namespace(dev, ns_type);
3176 if (!root)
3177 return ERR_PTR(-EOPNOTSUPP);
3178
3179 pkt_reformat = kzalloc(sizeof(*pkt_reformat), GFP_KERNEL);
3180 if (!pkt_reformat)
3181 return ERR_PTR(-ENOMEM);
3182
3183 pkt_reformat->ns_type = ns_type;
3f3f05ab
YK		 3184 pkt_reformat->reformat_type = params->type;
3185 err = root->cmds->packet_reformat_alloc(root, params, ns_type,
2b688ea5
MG		 3186 pkt_reformat);
3187 if (err) {
3188 kfree(pkt_reformat);
3189 return ERR_PTR(err);
3190 }
3191
3192 return pkt_reformat;
3193}
3194EXPORT_SYMBOL(mlx5_packet_reformat_alloc);
3195
3196void mlx5_packet_reformat_dealloc(struct mlx5_core_dev *dev,
3197 struct mlx5_pkt_reformat *pkt_reformat)
3198{
3199 struct mlx5_flow_root_namespace *root;
3200
3201 root = get_root_namespace(dev, pkt_reformat->ns_type);
3202 if (WARN_ON(!root))
3203 return;
3204 root->cmds->packet_reformat_dealloc(root, pkt_reformat);
3205 kfree(pkt_reformat);
3206}
3207EXPORT_SYMBOL(mlx5_packet_reformat_dealloc);
6a48faee
MG		 3208
3209int mlx5_flow_namespace_set_peer(struct mlx5_flow_root_namespace *ns,
3210 struct mlx5_flow_root_namespace *peer_ns)
3211{
38b9d1c6
MG		 3212 if (peer_ns && ns->mode != peer_ns->mode) {
3213 mlx5_core_err(ns->dev,
3214 "Can't peer namespace of different steering mode\n");
3215 return -EINVAL;
3216 }
3217
6a48faee
MG		 3218 return ns->cmds->set_peer(ns, peer_ns);
3219}
38b9d1c6
MG		 3220
3221/* This function should be called only at init stage of the namespace.
3222 * It is not safe to call this function while steering operations
3223 * are executed in the namespace.
3224 */
3225int mlx5_flow_namespace_set_mode(struct mlx5_flow_namespace *ns,
3226 enum mlx5_flow_steering_mode mode)
3227{
3228 struct mlx5_flow_root_namespace *root;
3229 const struct mlx5_flow_cmds *cmds;
3230 int err;
3231
3232 root = find_root(&ns->node);
3233 if (&root->ns != ns)
3234 /* Can't set cmds to non root namespace */
3235 return -EINVAL;
3236
3237 if (root->table_type != FS_FT_FDB)
3238 return -EOPNOTSUPP;
3239
3240 if (root->mode == mode)
3241 return 0;
3242
3243 if (mode == MLX5_FLOW_STEERING_MODE_SMFS)
3244 cmds = mlx5_fs_cmd_get_dr_cmds();
3245 else
3246 cmds = mlx5_fs_cmd_get_fw_cmds();
3247 if (!cmds)
3248 return -EOPNOTSUPP;
3249
3250 err = cmds->create_ns(root);
3251 if (err) {
3252 mlx5_core_err(root->dev, "Failed to create flow namespace (%d)\n",
3253 err);
3254 return err;
3255 }
3256
3257 root->cmds->destroy_ns(root);
3258 root->cmds = cmds;
3259 root->mode = mode;
3260
3261 return 0;
3262}
Linux 6.x block layer and io_uring tree(s)