]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - drivers/net/ethernet/mellanox/mlx5/core/fs_core.h
Merge remote-tracking branch 'regulator/fix/max77802' into regulator-linus
[mirror_ubuntu-artful-kernel.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 FS_FT_SNIFFER_RX = 0X5,
53 FS_FT_SNIFFER_TX = 0X6,
54 };
55
56 enum fs_flow_table_op_mod {
57 FS_FT_OP_MOD_NORMAL,
58 FS_FT_OP_MOD_LAG_DEMUX,
59 };
60
61 enum fs_fte_status {
62 FS_FTE_STATUS_EXISTING = 1UL << 0,
63 };
64
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;
73 };
74
75 struct fs_node {
76 struct list_head list;
77 struct list_head children;
78 enum fs_node_type type;
79 struct fs_node *parent;
80 struct fs_node *root;
81 /* lock the node for writing and traversing */
82 struct mutex lock;
83 atomic_t refcount;
84 void (*remove_func)(struct fs_node *);
85 };
86
87 struct mlx5_flow_rule {
88 struct fs_node node;
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.
92 */
93 struct list_head next_ft;
94 u32 sw_action;
95 };
96
97 struct mlx5_flow_handle {
98 int num_rules;
99 struct mlx5_flow_rule *rule[];
100 };
101
102 /* Type of children is mlx5_flow_group */
103 struct mlx5_flow_table {
104 struct fs_node node;
105 u32 id;
106 u16 vport;
107 unsigned int max_fte;
108 unsigned int level;
109 enum fs_flow_table_type type;
110 enum fs_flow_table_op_mod op_mod;
111 struct {
112 bool active;
113 unsigned int required_groups;
114 unsigned int num_groups;
115 } autogroup;
116 /* Protect fwd_rules */
117 struct mutex lock;
118 /* FWD rules that point on this flow table */
119 struct list_head fwd_rules;
120 u32 flags;
121 };
122
123 struct mlx5_fc_cache {
124 u64 packets;
125 u64 bytes;
126 u64 lastuse;
127 };
128
129 struct mlx5_fc {
130 struct rb_node node;
131 struct list_head list;
132
133 /* last{packets,bytes} members are used when calculating the delta since
134 * last reading
135 */
136 u64 lastpackets;
137 u64 lastbytes;
138
139 u16 id;
140 bool deleted;
141 bool aging;
142
143 struct mlx5_fc_cache cache ____cacheline_aligned_in_smp;
144 };
145
146 /* Type of children is mlx5_flow_rule */
147 struct fs_fte {
148 struct fs_node node;
149 u32 val[MLX5_ST_SZ_DW(fte_match_param)];
150 u32 dests_size;
151 u32 flow_tag;
152 u32 index;
153 u32 action;
154 u32 encap_id;
155 u32 modify_id;
156 enum fs_fte_status status;
157 struct mlx5_fc *counter;
158 };
159
160 /* Type of children is mlx5_flow_table/namespace */
161 struct fs_prio {
162 struct fs_node node;
163 unsigned int num_levels;
164 unsigned int start_level;
165 unsigned int prio;
166 unsigned int num_ft;
167 };
168
169 /* Type of children is fs_prio */
170 struct mlx5_flow_namespace {
171 /* parent == NULL => root ns */
172 struct fs_node node;
173 };
174
175 struct mlx5_flow_group_mask {
176 u8 match_criteria_enable;
177 u32 match_criteria[MLX5_ST_SZ_DW(fte_match_param)];
178 };
179
180 /* Type of children is fs_fte */
181 struct mlx5_flow_group {
182 struct fs_node node;
183 struct mlx5_flow_group_mask mask;
184 u32 start_index;
185 u32 max_ftes;
186 u32 num_ftes;
187 u32 id;
188 };
189
190 struct mlx5_flow_root_namespace {
191 struct mlx5_flow_namespace ns;
192 enum fs_flow_table_type table_type;
193 struct mlx5_core_dev *dev;
194 struct mlx5_flow_table *root_ft;
195 /* Should be held when chaining flow tables */
196 struct mutex chain_lock;
197 u32 underlay_qpn;
198 };
199
200 int mlx5_init_fc_stats(struct mlx5_core_dev *dev);
201 void mlx5_cleanup_fc_stats(struct mlx5_core_dev *dev);
202 void mlx5_fc_queue_stats_work(struct mlx5_core_dev *dev,
203 struct delayed_work *dwork,
204 unsigned long delay);
205 void mlx5_fc_update_sampling_interval(struct mlx5_core_dev *dev,
206 unsigned long interval);
207
208 int mlx5_init_fs(struct mlx5_core_dev *dev);
209 void mlx5_cleanup_fs(struct mlx5_core_dev *dev);
210
211 #define fs_get_obj(v, _node) {v = container_of((_node), typeof(*v), node); }
212
213 #define fs_list_for_each_entry(pos, root) \
214 list_for_each_entry(pos, root, node.list)
215
216 #define fs_list_for_each_entry_safe(pos, tmp, root) \
217 list_for_each_entry_safe(pos, tmp, root, node.list)
218
219 #define fs_for_each_ns_or_ft_reverse(pos, prio) \
220 list_for_each_entry_reverse(pos, &(prio)->node.children, list)
221
222 #define fs_for_each_ns_or_ft(pos, prio) \
223 list_for_each_entry(pos, (&(prio)->node.children), list)
224
225 #define fs_for_each_prio(pos, ns) \
226 fs_list_for_each_entry(pos, &(ns)->node.children)
227
228 #define fs_for_each_ns(pos, prio) \
229 fs_list_for_each_entry(pos, &(prio)->node.children)
230
231 #define fs_for_each_ft(pos, prio) \
232 fs_list_for_each_entry(pos, &(prio)->node.children)
233
234 #define fs_for_each_ft_safe(pos, tmp, prio) \
235 fs_list_for_each_entry_safe(pos, tmp, &(prio)->node.children)
236
237 #define fs_for_each_fg(pos, ft) \
238 fs_list_for_each_entry(pos, &(ft)->node.children)
239
240 #define fs_for_each_fte(pos, fg) \
241 fs_list_for_each_entry(pos, &(fg)->node.children)
242
243 #define fs_for_each_dst(pos, fte) \
244 fs_list_for_each_entry(pos, &(fte)->node.children)
245
246 #endif