[linux-2.6-block.git] / drivers / net / ethernet / mellanox / mlx5 / core / fs_core.h

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

#ifndef _MLX5_FS_CORE_
#define _MLX5_FS_CORE_

#include <linux/refcount.h>
#include <linux/mlx5/fs.h>
#include <linux/rhashtable.h>
#include <linux/llist.h>

/* FS_TYPE_PRIO_CHAINS is a PRIO that will have namespaces only,
 * and those are in parallel to one another when going over them to connect
 * a new flow table. Meaning the last flow table in a TYPE_PRIO prio in one
 * parallel namespace will not automatically connect to the first flow table
 * found in any prio in any next namespace, but skip the entire containing
 * TYPE_PRIO_CHAINS prio.
 *
 * This is used to implement tc chains, each chain of prios is a different
 * namespace inside a containing TYPE_PRIO_CHAINS prio.
 */

enum fs_node_type {
	FS_TYPE_NAMESPACE,
	FS_TYPE_PRIO,
	FS_TYPE_PRIO_CHAINS,
	FS_TYPE_FLOW_TABLE,
	FS_TYPE_FLOW_GROUP,
	FS_TYPE_FLOW_ENTRY,
	FS_TYPE_FLOW_DEST
};

enum fs_flow_table_type {
	FS_FT_NIC_RX          = 0x0,
	FS_FT_NIC_TX          = 0x1,
	FS_FT_ESW_EGRESS_ACL  = 0x2,
	FS_FT_ESW_INGRESS_ACL = 0x3,
	FS_FT_FDB             = 0X4,
	FS_FT_SNIFFER_RX	= 0X5,
	FS_FT_SNIFFER_TX	= 0X6,
	FS_FT_RDMA_RX		= 0X7,
	FS_FT_MAX_TYPE = FS_FT_RDMA_RX,
};

enum fs_flow_table_op_mod {
	FS_FT_OP_MOD_NORMAL,
	FS_FT_OP_MOD_LAG_DEMUX,
};

enum fs_fte_status {
	FS_FTE_STATUS_EXISTING = 1UL << 0,
};

struct mlx5_flow_steering {
	struct mlx5_core_dev *dev;
	struct kmem_cache               *fgs_cache;
	struct kmem_cache               *ftes_cache;
	struct mlx5_flow_root_namespace *root_ns;
	struct mlx5_flow_root_namespace *fdb_root_ns;
	struct mlx5_flow_namespace	**fdb_sub_ns;
	struct mlx5_flow_root_namespace **esw_egress_root_ns;
	struct mlx5_flow_root_namespace **esw_ingress_root_ns;
	struct mlx5_flow_root_namespace	*sniffer_tx_root_ns;
	struct mlx5_flow_root_namespace	*sniffer_rx_root_ns;
	struct mlx5_flow_root_namespace	*rdma_rx_root_ns;
	struct mlx5_flow_root_namespace	*egress_root_ns;
};

struct fs_node {
	struct list_head	list;
	struct list_head	children;
	enum fs_node_type	type;
	struct fs_node		*parent;
	struct fs_node		*root;
	/* lock the node for writing and traversing */
	struct rw_semaphore	lock;
	refcount_t		refcount;
	bool			active;
	void			(*del_hw_func)(struct fs_node *);
	void			(*del_sw_func)(struct fs_node *);
	atomic_t		version;
};

struct mlx5_flow_rule {
	struct fs_node				node;
	struct mlx5_flow_destination		dest_attr;
	/* next_ft should be accessed under chain_lock and only of
	 * destination type is FWD_NEXT_fT.
	 */
	struct list_head			next_ft;
	u32					sw_action;
};

struct mlx5_flow_handle {
	int num_rules;
	struct mlx5_flow_rule *rule[];
};

/* Type of children is mlx5_flow_group */
struct mlx5_flow_table {
	struct fs_node			node;
	u32				id;
	u16				vport;
	unsigned int			max_fte;
	unsigned int			level;
	enum fs_flow_table_type		type;
	enum fs_flow_table_op_mod	op_mod;
	struct {
		bool			active;
		unsigned int		required_groups;
		unsigned int		num_groups;
	} autogroup;
	/* Protect fwd_rules */
	struct mutex			lock;
	/* FWD rules that point on this flow table */
	struct list_head		fwd_rules;
	u32				flags;
	struct rhltable			fgs_hash;
};

struct mlx5_ft_underlay_qp {
	struct list_head list;
	u32 qpn;
};

#define MLX5_FTE_MATCH_PARAM_RESERVED	reserved_at_a00
/* Calculate the fte_match_param length and without the reserved length.
 * Make sure the reserved field is the last.
 */
#define MLX5_ST_SZ_DW_MATCH_PARAM					    \
	((MLX5_BYTE_OFF(fte_match_param, MLX5_FTE_MATCH_PARAM_RESERVED) / sizeof(u32)) + \
	 BUILD_BUG_ON_ZERO(MLX5_ST_SZ_BYTES(fte_match_param) !=		     \
			   MLX5_FLD_SZ_BYTES(fte_match_param,		     \
					     MLX5_FTE_MATCH_PARAM_RESERVED) +\
			   MLX5_BYTE_OFF(fte_match_param,		     \
					 MLX5_FTE_MATCH_PARAM_RESERVED)))

/* Type of children is mlx5_flow_rule */
struct fs_fte {
	struct fs_node			node;
	u32				val[MLX5_ST_SZ_DW_MATCH_PARAM];
	u32				dests_size;
	u32				index;
	struct mlx5_flow_context	flow_context;
	struct mlx5_flow_act		action;
	enum fs_fte_status		status;
	struct mlx5_fc			*counter;
	struct rhash_head		hash;
	int				modify_mask;
};

/* Type of children is mlx5_flow_table/namespace */
struct fs_prio {
	struct fs_node			node;
	unsigned int			num_levels;
	unsigned int			start_level;
	unsigned int			prio;
	unsigned int			num_ft;
};

/* Type of children is fs_prio */
struct mlx5_flow_namespace {
	/* parent == NULL => root ns */
	struct	fs_node			node;
};

struct mlx5_flow_group_mask {
	u8	match_criteria_enable;
	u32	match_criteria[MLX5_ST_SZ_DW_MATCH_PARAM];
};

/* Type of children is fs_fte */
struct mlx5_flow_group {
	struct fs_node			node;
	struct mlx5_flow_group_mask	mask;
	u32				start_index;
	u32				max_ftes;
	struct ida			fte_allocator;
	u32				id;
	struct rhashtable		ftes_hash;
	struct rhlist_head		hash;
};

struct mlx5_flow_root_namespace {
	struct mlx5_flow_namespace	ns;
	enum   fs_flow_table_type	table_type;
	struct mlx5_core_dev		*dev;
	struct mlx5_flow_table		*root_ft;
	/* Should be held when chaining flow tables */
	struct mutex			chain_lock;
	struct list_head		underlay_qpns;
	const struct mlx5_flow_cmds	*cmds;
	enum mlx5_flow_table_miss_action def_miss_action;
};

int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
void mlx5_fc_queue_stats_work(struct mlx5_core_dev *dev,
			      struct delayed_work *dwork,
			      unsigned long delay);
void mlx5_fc_update_sampling_interval(struct mlx5_core_dev *dev,
				      unsigned long interval);

int mlx5_init_fs(struct mlx5_core_dev *dev);
void mlx5_cleanup_fs(struct mlx5_core_dev *dev);

#define fs_get_obj(v, _node)  {v = container_of((_node), typeof(*v), node); }

#define fs_list_for_each_entry(pos, root)		\
	list_for_each_entry(pos, root, node.list)

#define fs_list_for_each_entry_safe(pos, tmp, root)		\
	list_for_each_entry_safe(pos, tmp, root, node.list)

#define fs_for_each_ns_or_ft_reverse(pos, prio)				\
	list_for_each_entry_reverse(pos, &(prio)->node.children, list)

#define fs_for_each_ns_or_ft(pos, prio)					\
	list_for_each_entry(pos, (&(prio)->node.children), list)

#define fs_for_each_prio(pos, ns)			\
	fs_list_for_each_entry(pos, &(ns)->node.children)

#define fs_for_each_ns(pos, prio)			\
	fs_list_for_each_entry(pos, &(prio)->node.children)

#define fs_for_each_ft(pos, prio)			\
	fs_list_for_each_entry(pos, &(prio)->node.children)

#define fs_for_each_ft_safe(pos, tmp, prio)			\
	fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)

#define fs_for_each_fg(pos, ft)			\
	fs_list_for_each_entry(pos, &(ft)->node.children)

#define fs_for_each_fte(pos, fg)			\
	fs_list_for_each_entry(pos, &(fg)->node.children)

#define fs_for_each_dst(pos, fte)			\
	fs_list_for_each_entry(pos, &(fte)->node.children)

#define MLX5_CAP_FLOWTABLE_TYPE(mdev, cap, type) (		\
	(type == FS_FT_NIC_RX) ? MLX5_CAP_FLOWTABLE_NIC_RX(mdev, cap) :		\
	(type == FS_FT_ESW_EGRESS_ACL) ? MLX5_CAP_ESW_EGRESS_ACL(mdev, cap) :		\
	(type == FS_FT_ESW_INGRESS_ACL) ? MLX5_CAP_ESW_INGRESS_ACL(mdev, cap) :		\
	(type == FS_FT_FDB) ? MLX5_CAP_ESW_FLOWTABLE_FDB(mdev, cap) :		\
	(type == FS_FT_SNIFFER_RX) ? MLX5_CAP_FLOWTABLE_SNIFFER_RX(mdev, cap) :		\
	(type == FS_FT_SNIFFER_TX) ? MLX5_CAP_FLOWTABLE_SNIFFER_TX(mdev, cap) :		\
	(type == FS_FT_RDMA_RX) ? MLX5_CAP_FLOWTABLE_RDMA_RX(mdev, cap) :		\
	(BUILD_BUG_ON_ZERO(FS_FT_RDMA_RX != FS_FT_MAX_TYPE))\
	)

#endif
Commit	Line	Data
26a81453 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	#ifndef _MLX5_FS_CORE_
	34	#define _MLX5_FS_CORE_
	35
dd8e1945	36	#include <linux/refcount.h>
26a81453	37	#include <linux/mlx5/fs.h>
0d235c3f	38	#include <linux/rhashtable.h>
83033688	39	#include <linux/llist.h>
26a81453	40
328edb49 PB	41	/* FS_TYPE_PRIO_CHAINS is a PRIO that will have namespaces only,
	42	* and those are in parallel to one another when going over them to connect
	43	* a new flow table. Meaning the last flow table in a TYPE_PRIO prio in one
	44	* parallel namespace will not automatically connect to the first flow table
	45	* found in any prio in any next namespace, but skip the entire containing
	46	* TYPE_PRIO_CHAINS prio.
	47	*
	48	* This is used to implement tc chains, each chain of prios is a different
	49	* namespace inside a containing TYPE_PRIO_CHAINS prio.
	50	*/
	51
26a81453 MG	52	enum fs_node_type {
	53	FS_TYPE_NAMESPACE,
	54	FS_TYPE_PRIO,
328edb49	55	FS_TYPE_PRIO_CHAINS,
26a81453 MG	56	FS_TYPE_FLOW_TABLE,
	57	FS_TYPE_FLOW_GROUP,
	58	FS_TYPE_FLOW_ENTRY,
	59	FS_TYPE_FLOW_DEST
	60	};
	61
	62	enum fs_flow_table_type {
efdc810b	63	FS_FT_NIC_RX = 0x0,
5f418378	64	FS_FT_NIC_TX = 0x1,
efdc810b MHY	65	FS_FT_ESW_EGRESS_ACL = 0x2,
	66	FS_FT_ESW_INGRESS_ACL = 0x3,
	67	FS_FT_FDB = 0X4,
87d22483 MG	68	FS_FT_SNIFFER_RX = 0X5,
87d22483 MG	69	FS_FT_SNIFFER_TX = 0X6,
d83eb50e	70	FS_FT_RDMA_RX = 0X7,
987f6c69	71	FS_FT_MAX_TYPE = FS_FT_RDMA_RX,
26a81453 MG	72	};
26a81453 MG	73
aaff1bea AH	74	enum fs_flow_table_op_mod {
	75	FS_FT_OP_MOD_NORMAL,
	76	FS_FT_OP_MOD_LAG_DEMUX,
	77	};
	78
26a81453 MG	79	enum fs_fte_status {
	80	FS_FTE_STATUS_EXISTING = 1UL << 0,
	81	};
	82
fba53f7b MG	83	struct mlx5_flow_steering {
fba53f7b MG	84	struct mlx5_core_dev *dev;
a369d4ac MG	85	struct kmem_cache *fgs_cache;
a369d4ac MG	86	struct kmem_cache *ftes_cache;
fba53f7b MG	87	struct mlx5_flow_root_namespace *root_ns;
fba53f7b MG	88	struct mlx5_flow_root_namespace *fdb_root_ns;
328edb49	89	struct mlx5_flow_namespace **fdb_sub_ns;
9b93ab98 GP	90	struct mlx5_flow_root_namespace **esw_egress_root_ns;
9b93ab98 GP	91	struct mlx5_flow_root_namespace **esw_ingress_root_ns;
87d22483 MG	92	struct mlx5_flow_root_namespace *sniffer_tx_root_ns;
87d22483 MG	93	struct mlx5_flow_root_namespace *sniffer_rx_root_ns;
d83eb50e	94	struct mlx5_flow_root_namespace *rdma_rx_root_ns;
5f418378	95	struct mlx5_flow_root_namespace *egress_root_ns;
fba53f7b MG	96	};
fba53f7b MG	97
26a81453 MG	98	struct fs_node {
	99	struct list_head list;
	100	struct list_head children;
	101	enum fs_node_type type;
de8575e0 MG	102	struct fs_node *parent;
	103	struct fs_node *root;
	104	/* lock the node for writing and traversing */
c7784b1c	105	struct rw_semaphore lock;
dd8e1945	106	refcount_t refcount;
19f100fe	107	bool active;
bd71b08e MG	108	void (del_hw_func)(struct fs_node );
	109	void (del_sw_func)(struct fs_node );
	110	atomic_t version;
26a81453 MG	111	};
	112
	113	struct mlx5_flow_rule {
	114	struct fs_node node;
	115	struct mlx5_flow_destination dest_attr;
b3638e1a MG	116	/* next_ft should be accessed under chain_lock and only of
	117	* destination type is FWD_NEXT_fT.
	118	*/
	119	struct list_head next_ft;
	120	u32 sw_action;
26a81453 MG	121	};
26a81453 MG	122
74491de9 MB	123	struct mlx5_flow_handle {
	124	int num_rules;
	125	struct mlx5_flow_rule *rule[];
	126	};
	127
0c56b975	128	/* Type of children is mlx5_flow_group */
26a81453 MG	129	struct mlx5_flow_table {
	130	struct fs_node node;
	131	u32 id;
efdc810b	132	u16 vport;
0c56b975	133	unsigned int max_fte;
5e1626c0	134	unsigned int level;
26a81453	135	enum fs_flow_table_type type;
aaff1bea	136	enum fs_flow_table_op_mod op_mod;
f0d22d18 MG	137	struct {
	138	bool active;
	139	unsigned int required_groups;
	140	unsigned int num_groups;
	141	} autogroup;
b3638e1a MG	142	/* Protect fwd_rules */
	143	struct mutex lock;
	144	/* FWD rules that point on this flow table */
	145	struct list_head fwd_rules;
c9f1b073	146	u32 flags;
693c6883	147	struct rhltable fgs_hash;
26a81453 MG	148	};
26a81453 MG	149
dae37456 AV	150	struct mlx5_ft_underlay_qp {
	151	struct list_head list;
	152	u32 qpn;
	153	};
	154
b169e64a	155	#define MLX5_FTE_MATCH_PARAM_RESERVED reserved_at_a00
667cb65a MB	156	/* Calculate the fte_match_param length and without the reserved length.
	157	* Make sure the reserved field is the last.
	158	*/
	159	#define MLX5_ST_SZ_DW_MATCH_PARAM \
	160	((MLX5_BYTE_OFF(fte_match_param, MLX5_FTE_MATCH_PARAM_RESERVED) / sizeof(u32)) + \
	161	BUILD_BUG_ON_ZERO(MLX5_ST_SZ_BYTES(fte_match_param) != \
	162	MLX5_FLD_SZ_BYTES(fte_match_param, \
	163	MLX5_FTE_MATCH_PARAM_RESERVED) +\
	164	MLX5_BYTE_OFF(fte_match_param, \
	165	MLX5_FTE_MATCH_PARAM_RESERVED)))
	166
0c56b975	167	/* Type of children is mlx5_flow_rule */
26a81453 MG	168	struct fs_fte {
26a81453 MG	169	struct fs_node node;
667cb65a	170	u32 val[MLX5_ST_SZ_DW_MATCH_PARAM];
26a81453	171	u32 dests_size;
26a81453	172	u32 index;
bb0ee7dc	173	struct mlx5_flow_context flow_context;
d2ec6a35	174	struct mlx5_flow_act action;
0c56b975	175	enum fs_fte_status status;
bd5251db	176	struct mlx5_fc *counter;
0d235c3f	177	struct rhash_head hash;
e7aafc8f	178	int modify_mask;
26a81453 MG	179	};
26a81453 MG	180
0c56b975	181	/* Type of children is mlx5_flow_table/namespace */
5e1626c0 MG	182	struct fs_prio {
5e1626c0 MG	183	struct fs_node node;
a257b94a	184	unsigned int num_levels;
5e1626c0 MG	185	unsigned int start_level;
5e1626c0 MG	186	unsigned int prio;
0c56b975	187	unsigned int num_ft;
5e1626c0 MG	188	};
5e1626c0 MG	189
0c56b975	190	/* Type of children is fs_prio */
5e1626c0 MG	191	struct mlx5_flow_namespace {
	192	/* parent == NULL => root ns */
	193	struct fs_node node;
	194	};
	195
	196	struct mlx5_flow_group_mask {
	197	u8 match_criteria_enable;
667cb65a	198	u32 match_criteria[MLX5_ST_SZ_DW_MATCH_PARAM];
5e1626c0 MG	199	};
5e1626c0 MG	200
0c56b975 MG	201	/* Type of children is fs_fte */
	202	struct mlx5_flow_group {
	203	struct fs_node node;
	204	struct mlx5_flow_group_mask mask;
	205	u32 start_index;
	206	u32 max_ftes;
75d1d187	207	struct ida fte_allocator;
0c56b975	208	u32 id;
0d235c3f	209	struct rhashtable ftes_hash;
693c6883	210	struct rhlist_head hash;
0c56b975 MG	211	};
	212
	213	struct mlx5_flow_root_namespace {
	214	struct mlx5_flow_namespace ns;
	215	enum fs_flow_table_type table_type;
	216	struct mlx5_core_dev *dev;
2cc43b49 MG	217	struct mlx5_flow_table *root_ft;
	218	/* Should be held when chaining flow tables */
	219	struct mutex chain_lock;
dae37456	220	struct list_head underlay_qpns;
af76c501	221	const struct mlx5_flow_cmds *cmds;
f6f7d6b5	222	enum mlx5_flow_table_miss_action def_miss_action;
0c56b975 MG	223	};
0c56b975 MG	224
43a335e0 AV	225	int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
43a335e0 AV	226	void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
f6dfb4c3 HHZ	227	void mlx5_fc_queue_stats_work(struct mlx5_core_dev *dev,
	228	struct delayed_work *dwork,
	229	unsigned long delay);
	230	void mlx5_fc_update_sampling_interval(struct mlx5_core_dev *dev,
	231	unsigned long interval);
43a335e0	232
25302363 MG	233	int mlx5_init_fs(struct mlx5_core_dev *dev);
	234	void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
	235
5e1626c0 MG	236	#define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
	237
	238	#define fs_list_for_each_entry(pos, root) \
	239	list_for_each_entry(pos, root, node.list)
	240
153fefbf MG	241	#define fs_list_for_each_entry_safe(pos, tmp, root) \
	242	list_for_each_entry_safe(pos, tmp, root, node.list)
	243
5e1626c0 MG	244	#define fs_for_each_ns_or_ft_reverse(pos, prio) \
	245	list_for_each_entry_reverse(pos, &(prio)->node.children, list)
	246
	247	#define fs_for_each_ns_or_ft(pos, prio) \
	248	list_for_each_entry(pos, (&(prio)->node.children), list)
	249
	250	#define fs_for_each_prio(pos, ns) \
	251	fs_list_for_each_entry(pos, &(ns)->node.children)
	252
655227ed MG	253	#define fs_for_each_ns(pos, prio) \
	254	fs_list_for_each_entry(pos, &(prio)->node.children)
	255
2cc43b49 MG	256	#define fs_for_each_ft(pos, prio) \
	257	fs_list_for_each_entry(pos, &(prio)->node.children)
	258
153fefbf MG	259	#define fs_for_each_ft_safe(pos, tmp, prio) \
	260	fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
	261
5e1626c0 MG	262	#define fs_for_each_fg(pos, ft) \
	263	fs_list_for_each_entry(pos, &(ft)->node.children)
	264
	265	#define fs_for_each_fte(pos, fg) \
	266	fs_list_for_each_entry(pos, &(fg)->node.children)
	267
	268	#define fs_for_each_dst(pos, fte) \
	269	fs_list_for_each_entry(pos, &(fte)->node.children)
	270
16f1c5bb RS	271	#define MLX5_CAP_FLOWTABLE_TYPE(mdev, cap, type) ( \
	272	(type == FS_FT_NIC_RX) ? MLX5_CAP_FLOWTABLE_NIC_RX(mdev, cap) : \
	273	(type == FS_FT_ESW_EGRESS_ACL) ? MLX5_CAP_ESW_EGRESS_ACL(mdev, cap) : \
	274	(type == FS_FT_ESW_INGRESS_ACL) ? MLX5_CAP_ESW_INGRESS_ACL(mdev, cap) : \
	275	(type == FS_FT_FDB) ? MLX5_CAP_ESW_FLOWTABLE_FDB(mdev, cap) : \
	276	(type == FS_FT_SNIFFER_RX) ? MLX5_CAP_FLOWTABLE_SNIFFER_RX(mdev, cap) : \
	277	(type == FS_FT_SNIFFER_TX) ? MLX5_CAP_FLOWTABLE_SNIFFER_TX(mdev, cap) : \
987f6c69 MG	278	(type == FS_FT_RDMA_RX) ? MLX5_CAP_FLOWTABLE_RDMA_RX(mdev, cap) : \
987f6c69 MG	279	(BUILD_BUG_ON_ZERO(FS_FT_RDMA_RX != FS_FT_MAX_TYPE))\
16f1c5bb RS	280	)
16f1c5bb RS	281
26a81453	282	#endif