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/mlx5/fs.h>
47 enum fs_flow_table_type {
49 FS_FT_ESW_EGRESS_ACL = 0x2,
50 FS_FT_ESW_INGRESS_ACL = 0x3,
52 FS_FT_SNIFFER_RX = 0X5,
53 FS_FT_SNIFFER_TX = 0X6,
56 enum fs_flow_table_op_mod {
58 FS_FT_OP_MOD_LAG_DEMUX,
62 FS_FTE_STATUS_EXISTING = 1UL << 0,
65 struct mlx5_flow_steering {
66 struct mlx5_core_dev *dev;
67 struct mlx5_flow_root_namespace *root_ns;
68 struct mlx5_flow_root_namespace *fdb_root_ns;
69 struct mlx5_flow_root_namespace *esw_egress_root_ns;
70 struct mlx5_flow_root_namespace *esw_ingress_root_ns;
71 struct mlx5_flow_root_namespace *sniffer_tx_root_ns;
72 struct mlx5_flow_root_namespace *sniffer_rx_root_ns;
76 struct list_head list;
77 struct list_head children;
78 enum fs_node_type type;
79 struct fs_node *parent;
81 /* lock the node for writing and traversing */
84 void (*remove_func)(struct fs_node *);
87 struct mlx5_flow_rule {
89 struct mlx5_flow_destination dest_attr;
90 /* next_ft should be accessed under chain_lock and only of
91 * destination type is FWD_NEXT_fT.
93 struct list_head next_ft;
97 /* Type of children is mlx5_flow_group */
98 struct mlx5_flow_table {
102 unsigned int max_fte;
104 enum fs_flow_table_type type;
105 enum fs_flow_table_op_mod op_mod;
108 unsigned int required_groups;
109 unsigned int num_groups;
111 /* Protect fwd_rules */
113 /* FWD rules that point on this flow table */
114 struct list_head fwd_rules;
117 struct mlx5_fc_cache {
125 struct list_head list;
127 /* last{packets,bytes} members are used when calculating the delta since
137 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
140 /* Type of children is mlx5_flow_rule */
143 u32 val[MLX5_ST_SZ_DW(fte_match_param)];
148 enum fs_fte_status status;
149 struct mlx5_fc *counter;
152 /* Type of children is mlx5_flow_table/namespace */
155 unsigned int num_levels;
156 unsigned int start_level;
161 /* Type of children is fs_prio */
162 struct mlx5_flow_namespace {
163 /* parent == NULL => root ns */
167 struct mlx5_flow_group_mask {
168 u8 match_criteria_enable;
169 u32 match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
172 /* Type of children is fs_fte */
173 struct mlx5_flow_group {
175 struct mlx5_flow_group_mask mask;
182 struct mlx5_flow_root_namespace {
183 struct mlx5_flow_namespace ns;
184 enum fs_flow_table_type table_type;
185 struct mlx5_core_dev *dev;
186 struct mlx5_flow_table *root_ft;
187 /* Should be held when chaining flow tables */
188 struct mutex chain_lock;
191 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
192 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
194 int mlx5_init_fs(struct mlx5_core_dev *dev);
195 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
197 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
199 #define fs_list_for_each_entry(pos, root) \
200 list_for_each_entry(pos, root, node.list)
202 #define fs_list_for_each_entry_safe(pos, tmp, root) \
203 list_for_each_entry_safe(pos, tmp, root, node.list)
205 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
206 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
208 #define fs_for_each_ns_or_ft(pos, prio) \
209 list_for_each_entry(pos, (&(prio)->node.children), list)
211 #define fs_for_each_prio(pos, ns) \
212 fs_list_for_each_entry(pos, &(ns)->node.children)
214 #define fs_for_each_ns(pos, prio) \
215 fs_list_for_each_entry(pos, &(prio)->node.children)
217 #define fs_for_each_ft(pos, prio) \
218 fs_list_for_each_entry(pos, &(prio)->node.children)
220 #define fs_for_each_ft_safe(pos, tmp, prio) \
221 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
223 #define fs_for_each_fg(pos, ft) \
224 fs_list_for_each_entry(pos, &(ft)->node.children)
226 #define fs_for_each_fte(pos, fg) \
227 fs_list_for_each_entry(pos, &(fg)->node.children)
229 #define fs_for_each_dst(pos, fte) \
230 fs_list_for_each_entry(pos, &(fte)->node.children)