net/mlx5: LAG demux flow table support
[deliverable/linux.git] / drivers / net / ethernet / mellanox / mlx5 / core / fs_core.h
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
36 #include <linux/mlx5/fs.h>
37
38 enum fs_node_type {
39 FS_TYPE_NAMESPACE,
40 FS_TYPE_PRIO,
41 FS_TYPE_FLOW_TABLE,
42 FS_TYPE_FLOW_GROUP,
43 FS_TYPE_FLOW_ENTRY,
44 FS_TYPE_FLOW_DEST
45 };
46
47 enum fs_flow_table_type {
48 FS_FT_NIC_RX = 0x0,
49 FS_FT_ESW_EGRESS_ACL = 0x2,
50 FS_FT_ESW_INGRESS_ACL = 0x3,
51 FS_FT_FDB = 0X4,
52 };
53
54 enum fs_flow_table_op_mod {
55 FS_FT_OP_MOD_NORMAL,
56 FS_FT_OP_MOD_LAG_DEMUX,
57 };
58
59 enum fs_fte_status {
60 FS_FTE_STATUS_EXISTING = 1UL << 0,
61 };
62
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;
69 };
70
71 struct fs_node {
72 struct list_head list;
73 struct list_head children;
74 enum fs_node_type type;
75 struct fs_node *parent;
76 struct fs_node *root;
77 /* lock the node for writing and traversing */
78 struct mutex lock;
79 atomic_t refcount;
80 void (*remove_func)(struct fs_node *);
81 };
82
83 struct mlx5_flow_rule {
84 struct fs_node node;
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.
88 */
89 struct list_head next_ft;
90 u32 sw_action;
91 };
92
93 /* Type of children is mlx5_flow_group */
94 struct mlx5_flow_table {
95 struct fs_node node;
96 u32 id;
97 u16 vport;
98 unsigned int max_fte;
99 unsigned int level;
100 enum fs_flow_table_type type;
101 enum fs_flow_table_op_mod op_mod;
102 struct {
103 bool active;
104 unsigned int required_groups;
105 unsigned int num_groups;
106 } autogroup;
107 /* Protect fwd_rules */
108 struct mutex lock;
109 /* FWD rules that point on this flow table */
110 struct list_head fwd_rules;
111 };
112
113 struct mlx5_fc_cache {
114 u64 packets;
115 u64 bytes;
116 u64 lastuse;
117 };
118
119 struct mlx5_fc {
120 struct rb_node node;
121 struct list_head list;
122
123 /* last{packets,bytes} members are used when calculating the delta since
124 * last reading
125 */
126 u64 lastpackets;
127 u64 lastbytes;
128
129 u16 id;
130 bool deleted;
131 bool aging;
132
133 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
134 };
135
136 /* Type of children is mlx5_flow_rule */
137 struct fs_fte {
138 struct fs_node node;
139 u32 val[MLX5_ST_SZ_DW(fte_match_param)];
140 u32 dests_size;
141 u32 flow_tag;
142 u32 index;
143 u32 action;
144 enum fs_fte_status status;
145 struct mlx5_fc *counter;
146 };
147
148 /* Type of children is mlx5_flow_table/namespace */
149 struct fs_prio {
150 struct fs_node node;
151 unsigned int num_levels;
152 unsigned int start_level;
153 unsigned int prio;
154 unsigned int num_ft;
155 };
156
157 /* Type of children is fs_prio */
158 struct mlx5_flow_namespace {
159 /* parent == NULL => root ns */
160 struct fs_node node;
161 };
162
163 struct mlx5_flow_group_mask {
164 u8 match_criteria_enable;
165 u32 match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
166 };
167
168 /* Type of children is fs_fte */
169 struct mlx5_flow_group {
170 struct fs_node node;
171 struct mlx5_flow_group_mask mask;
172 u32 start_index;
173 u32 max_ftes;
174 u32 num_ftes;
175 u32 id;
176 };
177
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;
185 };
186
187 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
188 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
189
190 int mlx5_init_fs(struct mlx5_core_dev *dev);
191 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
192
193 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
194
195 #define fs_list_for_each_entry(pos, root) \
196 list_for_each_entry(pos, root, node.list)
197
198 #define fs_list_for_each_entry_safe(pos, tmp, root) \
199 list_for_each_entry_safe(pos, tmp, root, node.list)
200
201 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
202 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
203
204 #define fs_for_each_ns_or_ft(pos, prio) \
205 list_for_each_entry(pos, (&(prio)->node.children), list)
206
207 #define fs_for_each_prio(pos, ns) \
208 fs_list_for_each_entry(pos, &(ns)->node.children)
209
210 #define fs_for_each_ns(pos, prio) \
211 fs_list_for_each_entry(pos, &(prio)->node.children)
212
213 #define fs_for_each_ft(pos, prio) \
214 fs_list_for_each_entry(pos, &(prio)->node.children)
215
216 #define fs_for_each_ft_safe(pos, tmp, prio) \
217 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
218
219 #define fs_for_each_fg(pos, ft) \
220 fs_list_for_each_entry(pos, &(ft)->node.children)
221
222 #define fs_for_each_fte(pos, fg) \
223 fs_list_for_each_entry(pos, &(fg)->node.children)
224
225 #define fs_for_each_dst(pos, fte) \
226 fs_list_for_each_entry(pos, &(fte)->node.children)
227
228 #endif
This page took 0.037467 seconds and 6 git commands to generate.