[mirror_ubuntu-bionic-kernel.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>

enum fs_node_type {
	FS_TYPE_NAMESPACE,
	FS_TYPE_PRIO,
	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_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_MAX_TYPE = FS_FT_SNIFFER_TX,
};

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_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 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		group_size;
		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_fc_cache {
	u64 packets;
	u64 bytes;
	u64 lastuse;
};

struct mlx5_fc {
	struct rb_node node;
	struct list_head list;

	/* last{packets,bytes} members are used when calculating the delta since
	 * last reading
	 */
	u64 lastpackets;
	u64 lastbytes;

	u32 id;
	bool deleted;
	bool aging;

	struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
};

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

#define MLX5_FTE_MATCH_PARAM_RESERVED	reserved_at_600
/* 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				flow_tag;
	u32				index;
	u32				action;
	u32				encap_id;
	u32				modify_id;
	enum fs_fte_status		status;
	struct mlx5_fc			*counter;
	struct rhash_head		hash;
};

/* 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;
};

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