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,
54 enum fs_flow_table_op_mod
{
56 FS_FT_OP_MOD_LAG_DEMUX
,
60 FS_FTE_STATUS_EXISTING
= 1UL << 0,
63 struct mlx5_flow_steering
{
64 struct mlx5_core_dev
*dev
;
65 struct mlx5_flow_root_namespace
*root_ns
;
66 struct mlx5_flow_root_namespace
*fdb_root_ns
;
67 struct mlx5_flow_root_namespace
*esw_egress_root_ns
;
68 struct mlx5_flow_root_namespace
*esw_ingress_root_ns
;
72 struct list_head list
;
73 struct list_head children
;
74 enum fs_node_type type
;
75 struct fs_node
*parent
;
77 /* lock the node for writing and traversing */
80 void (*remove_func
)(struct fs_node
*);
83 struct mlx5_flow_rule
{
85 struct mlx5_flow_destination dest_attr
;
86 /* next_ft should be accessed under chain_lock and only of
87 * destination type is FWD_NEXT_fT.
89 struct list_head next_ft
;
93 /* Type of children is mlx5_flow_group */
94 struct mlx5_flow_table
{
100 enum fs_flow_table_type type
;
101 enum fs_flow_table_op_mod op_mod
;
104 unsigned int required_groups
;
105 unsigned int num_groups
;
107 /* Protect fwd_rules */
109 /* FWD rules that point on this flow table */
110 struct list_head fwd_rules
;
113 struct mlx5_fc_cache
{
121 struct list_head list
;
123 /* last{packets,bytes} members are used when calculating the delta since
133 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp
;
136 /* Type of children is mlx5_flow_rule */
139 u32 val
[MLX5_ST_SZ_DW(fte_match_param
)];
144 enum fs_fte_status status
;
145 struct mlx5_fc
*counter
;
148 /* Type of children is mlx5_flow_table/namespace */
151 unsigned int num_levels
;
152 unsigned int start_level
;
157 /* Type of children is fs_prio */
158 struct mlx5_flow_namespace
{
159 /* parent == NULL => root ns */
163 struct mlx5_flow_group_mask
{
164 u8 match_criteria_enable
;
165 u32 match_criteria
[MLX5_ST_SZ_DW(fte_match_param
)];
168 /* Type of children is fs_fte */
169 struct mlx5_flow_group
{
171 struct mlx5_flow_group_mask mask
;
178 struct mlx5_flow_root_namespace
{
179 struct mlx5_flow_namespace ns
;
180 enum fs_flow_table_type table_type
;
181 struct mlx5_core_dev
*dev
;
182 struct mlx5_flow_table
*root_ft
;
183 /* Should be held when chaining flow tables */
184 struct mutex chain_lock
;
187 int mlx5_init_fc_stats(struct mlx5_core_dev
*dev
);
188 void mlx5_cleanup_fc_stats(struct mlx5_core_dev
*dev
);
190 int mlx5_init_fs(struct mlx5_core_dev
*dev
);
191 void mlx5_cleanup_fs(struct mlx5_core_dev
*dev
);
193 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
195 #define fs_list_for_each_entry(pos, root) \
196 list_for_each_entry(pos, root, node.list)
198 #define fs_list_for_each_entry_safe(pos, tmp, root) \
199 list_for_each_entry_safe(pos, tmp, root, node.list)
201 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
202 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
204 #define fs_for_each_ns_or_ft(pos, prio) \
205 list_for_each_entry(pos, (&(prio)->node.children), list)
207 #define fs_for_each_prio(pos, ns) \
208 fs_list_for_each_entry(pos, &(ns)->node.children)
210 #define fs_for_each_ns(pos, prio) \
211 fs_list_for_each_entry(pos, &(prio)->node.children)
213 #define fs_for_each_ft(pos, prio) \
214 fs_list_for_each_entry(pos, &(prio)->node.children)
216 #define fs_for_each_ft_safe(pos, tmp, prio) \
217 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
219 #define fs_for_each_fg(pos, ft) \
220 fs_list_for_each_entry(pos, &(ft)->node.children)
222 #define fs_for_each_fte(pos, fg) \
223 fs_list_for_each_entry(pos, &(fg)->node.children)
225 #define fs_for_each_dst(pos, fte) \
226 fs_list_for_each_entry(pos, &(fte)->node.children)