2 * Copyright (c) 2015, Mellanox Technologies. All rights reserved.
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:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
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.
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
33 #ifndef _MLX5_FS_CORE_
34 #define _MLX5_FS_CORE_
36 #include <linux/refcount.h>
37 #include <linux/mlx5/fs.h>
38 #include <linux/rhashtable.h>
39 #include <linux/llist.h>
50 enum fs_flow_table_type {
53 FS_FT_ESW_EGRESS_ACL = 0x2,
54 FS_FT_ESW_INGRESS_ACL = 0x3,
56 FS_FT_SNIFFER_RX = 0X5,
57 FS_FT_SNIFFER_TX = 0X6,
58 FS_FT_MAX_TYPE = FS_FT_SNIFFER_TX,
61 enum fs_flow_table_op_mod {
63 FS_FT_OP_MOD_LAG_DEMUX,
67 FS_FTE_STATUS_EXISTING = 1UL << 0,
70 struct mlx5_flow_steering {
71 struct mlx5_core_dev *dev;
72 struct kmem_cache *fgs_cache;
73 struct kmem_cache *ftes_cache;
74 struct mlx5_flow_root_namespace *root_ns;
75 struct mlx5_flow_root_namespace *fdb_root_ns;
76 struct mlx5_flow_root_namespace **esw_egress_root_ns;
77 struct mlx5_flow_root_namespace **esw_ingress_root_ns;
78 struct mlx5_flow_root_namespace *sniffer_tx_root_ns;
79 struct mlx5_flow_root_namespace *sniffer_rx_root_ns;
80 struct mlx5_flow_root_namespace *egress_root_ns;
84 struct list_head list;
85 struct list_head children;
86 enum fs_node_type type;
87 struct fs_node *parent;
89 /* lock the node for writing and traversing */
90 struct rw_semaphore lock;
93 void (*del_hw_func)(struct fs_node *);
94 void (*del_sw_func)(struct fs_node *);
98 struct mlx5_flow_rule {
100 struct mlx5_flow_destination dest_attr;
101 /* next_ft should be accessed under chain_lock and only of
102 * destination type is FWD_NEXT_fT.
104 struct list_head next_ft;
108 struct mlx5_flow_handle {
110 struct mlx5_flow_rule *rule[];
113 /* Type of children is mlx5_flow_group */
114 struct mlx5_flow_table {
118 unsigned int max_fte;
120 enum fs_flow_table_type type;
121 enum fs_flow_table_op_mod op_mod;
124 unsigned int required_groups;
125 unsigned int num_groups;
127 /* Protect fwd_rules */
129 /* FWD rules that point on this flow table */
130 struct list_head fwd_rules;
132 struct rhltable fgs_hash;
135 struct mlx5_fc_cache {
143 struct llist_node addlist;
144 struct llist_node dellist;
146 /* last{packets,bytes} members are used when calculating the delta since
155 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
158 struct mlx5_ft_underlay_qp {
159 struct list_head list;
163 #define MLX5_FTE_MATCH_PARAM_RESERVED reserved_at_800
164 /* Calculate the fte_match_param length and without the reserved length.
165 * Make sure the reserved field is the last.
167 #define MLX5_ST_SZ_DW_MATCH_PARAM \
168 ((MLX5_BYTE_OFF(fte_match_param, MLX5_FTE_MATCH_PARAM_RESERVED) / sizeof(u32)) + \
169 BUILD_BUG_ON_ZERO(MLX5_ST_SZ_BYTES(fte_match_param) != \
170 MLX5_FLD_SZ_BYTES(fte_match_param, \
171 MLX5_FTE_MATCH_PARAM_RESERVED) +\
172 MLX5_BYTE_OFF(fte_match_param, \
173 MLX5_FTE_MATCH_PARAM_RESERVED)))
175 /* Type of children is mlx5_flow_rule */
178 u32 val[MLX5_ST_SZ_DW_MATCH_PARAM];
181 struct mlx5_flow_act action;
182 enum fs_fte_status status;
183 struct mlx5_fc *counter;
184 struct rhash_head hash;
187 /* Type of children is mlx5_flow_table/namespace */
190 unsigned int num_levels;
191 unsigned int start_level;
196 /* Type of children is fs_prio */
197 struct mlx5_flow_namespace {
198 /* parent == NULL => root ns */
202 struct mlx5_flow_group_mask {
203 u8 match_criteria_enable;
204 u32 match_criteria[MLX5_ST_SZ_DW_MATCH_PARAM];
207 /* Type of children is fs_fte */
208 struct mlx5_flow_group {
210 struct mlx5_flow_group_mask mask;
213 struct ida fte_allocator;
215 struct rhashtable ftes_hash;
216 struct rhlist_head hash;
219 struct mlx5_flow_root_namespace {
220 struct mlx5_flow_namespace ns;
221 enum fs_flow_table_type table_type;
222 struct mlx5_core_dev *dev;
223 struct mlx5_flow_table *root_ft;
224 /* Should be held when chaining flow tables */
225 struct mutex chain_lock;
226 struct list_head underlay_qpns;
227 const struct mlx5_flow_cmds *cmds;
230 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
231 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
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);
238 int mlx5_init_fs(struct mlx5_core_dev *dev);
239 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
241 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
243 #define fs_list_for_each_entry(pos, root) \
244 list_for_each_entry(pos, root, node.list)
246 #define fs_list_for_each_entry_safe(pos, tmp, root) \
247 list_for_each_entry_safe(pos, tmp, root, node.list)
249 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
250 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
252 #define fs_for_each_ns_or_ft(pos, prio) \
253 list_for_each_entry(pos, (&(prio)->node.children), list)
255 #define fs_for_each_prio(pos, ns) \
256 fs_list_for_each_entry(pos, &(ns)->node.children)
258 #define fs_for_each_ns(pos, prio) \
259 fs_list_for_each_entry(pos, &(prio)->node.children)
261 #define fs_for_each_ft(pos, prio) \
262 fs_list_for_each_entry(pos, &(prio)->node.children)
264 #define fs_for_each_ft_safe(pos, tmp, prio) \
265 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
267 #define fs_for_each_fg(pos, ft) \
268 fs_list_for_each_entry(pos, &(ft)->node.children)
270 #define fs_for_each_fte(pos, fg) \
271 fs_list_for_each_entry(pos, &(fg)->node.children)
273 #define fs_for_each_dst(pos, fte) \
274 fs_list_for_each_entry(pos, &(fte)->node.children)
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))\