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,
55 FS_FTE_STATUS_EXISTING = 1UL << 0,
59 struct list_head list;
60 struct list_head children;
61 enum fs_node_type type;
62 struct fs_node *parent;
64 /* lock the node for writing and traversing */
67 void (*remove_func)(struct fs_node *);
70 struct mlx5_flow_rule {
72 struct mlx5_flow_destination dest_attr;
73 /* next_ft should be accessed under chain_lock and only of
74 * destination type is FWD_NEXT_fT.
76 struct list_head next_ft;
80 /* Type of children is mlx5_flow_group */
81 struct mlx5_flow_table {
87 enum fs_flow_table_type type;
90 unsigned int required_groups;
91 unsigned int num_groups;
93 /* Protect fwd_rules */
95 /* FWD rules that point on this flow table */
96 struct list_head fwd_rules;
99 struct mlx5_fc_cache {
106 struct list_head list;
108 /* last{packets,bytes} members are used when calculating the delta since
118 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
121 /* Type of children is mlx5_flow_rule */
124 u32 val[MLX5_ST_SZ_DW(fte_match_param)];
129 enum fs_fte_status status;
130 struct mlx5_fc *counter;
133 /* Type of children is mlx5_flow_table/namespace */
136 unsigned int num_levels;
137 unsigned int start_level;
142 /* Type of children is fs_prio */
143 struct mlx5_flow_namespace {
144 /* parent == NULL => root ns */
148 struct mlx5_flow_group_mask {
149 u8 match_criteria_enable;
150 u32 match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
153 /* Type of children is fs_fte */
154 struct mlx5_flow_group {
156 struct mlx5_flow_group_mask mask;
163 struct mlx5_flow_root_namespace {
164 struct mlx5_flow_namespace ns;
165 enum fs_flow_table_type table_type;
166 struct mlx5_core_dev *dev;
167 struct mlx5_flow_table *root_ft;
168 /* Should be held when chaining flow tables */
169 struct mutex chain_lock;
172 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
173 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
175 int mlx5_init_fs(struct mlx5_core_dev *dev);
176 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
178 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
180 #define fs_list_for_each_entry(pos, root) \
181 list_for_each_entry(pos, root, node.list)
183 #define fs_list_for_each_entry_safe(pos, tmp, root) \
184 list_for_each_entry_safe(pos, tmp, root, node.list)
186 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
187 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
189 #define fs_for_each_ns_or_ft(pos, prio) \
190 list_for_each_entry(pos, (&(prio)->node.children), list)
192 #define fs_for_each_prio(pos, ns) \
193 fs_list_for_each_entry(pos, &(ns)->node.children)
195 #define fs_for_each_ns(pos, prio) \
196 fs_list_for_each_entry(pos, &(prio)->node.children)
198 #define fs_for_each_ft(pos, prio) \
199 fs_list_for_each_entry(pos, &(prio)->node.children)
201 #define fs_for_each_ft_safe(pos, tmp, prio) \
202 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
204 #define fs_for_each_fg(pos, ft) \
205 fs_list_for_each_entry(pos, &(ft)->node.children)
207 #define fs_for_each_fte(pos, fg) \
208 fs_list_for_each_entry(pos, &(fg)->node.children)
210 #define fs_for_each_dst(pos, fte) \
211 fs_list_for_each_entry(pos, &(fte)->node.children)