2 * Copyright (c) 2013-2016, 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 #include <linux/kernel.h>
34 #include <linux/module.h>
35 #include <linux/mlx5/driver.h>
36 #include <linux/mlx5/cmd.h>
37 #include "mlx5_core.h"
39 /* Scheduling element fw management */
40 int mlx5_create_scheduling_element_cmd(struct mlx5_core_dev
*dev
, u8 hierarchy
,
41 void *ctx
, u32
*element_id
)
43 u32 in
[MLX5_ST_SZ_DW(create_scheduling_element_in
)] = {0};
44 u32 out
[MLX5_ST_SZ_DW(create_scheduling_element_in
)] = {0};
48 schedc
= MLX5_ADDR_OF(create_scheduling_element_in
, in
,
50 MLX5_SET(create_scheduling_element_in
, in
, opcode
,
51 MLX5_CMD_OP_CREATE_SCHEDULING_ELEMENT
);
52 MLX5_SET(create_scheduling_element_in
, in
, scheduling_hierarchy
,
54 memcpy(schedc
, ctx
, MLX5_ST_SZ_BYTES(scheduling_context
));
56 err
= mlx5_cmd_exec(dev
, in
, sizeof(in
), out
, sizeof(out
));
60 *element_id
= MLX5_GET(create_scheduling_element_out
, out
,
61 scheduling_element_id
);
65 int mlx5_modify_scheduling_element_cmd(struct mlx5_core_dev
*dev
, u8 hierarchy
,
66 void *ctx
, u32 element_id
,
69 u32 in
[MLX5_ST_SZ_DW(modify_scheduling_element_in
)] = {0};
70 u32 out
[MLX5_ST_SZ_DW(modify_scheduling_element_in
)] = {0};
73 schedc
= MLX5_ADDR_OF(modify_scheduling_element_in
, in
,
75 MLX5_SET(modify_scheduling_element_in
, in
, opcode
,
76 MLX5_CMD_OP_MODIFY_SCHEDULING_ELEMENT
);
77 MLX5_SET(modify_scheduling_element_in
, in
, scheduling_element_id
,
79 MLX5_SET(modify_scheduling_element_in
, in
, modify_bitmask
,
81 MLX5_SET(modify_scheduling_element_in
, in
, scheduling_hierarchy
,
83 memcpy(schedc
, ctx
, MLX5_ST_SZ_BYTES(scheduling_context
));
85 return mlx5_cmd_exec(dev
, in
, sizeof(in
), out
, sizeof(out
));
88 int mlx5_destroy_scheduling_element_cmd(struct mlx5_core_dev
*dev
, u8 hierarchy
,
91 u32 in
[MLX5_ST_SZ_DW(destroy_scheduling_element_in
)] = {0};
92 u32 out
[MLX5_ST_SZ_DW(destroy_scheduling_element_in
)] = {0};
94 MLX5_SET(destroy_scheduling_element_in
, in
, opcode
,
95 MLX5_CMD_OP_DESTROY_SCHEDULING_ELEMENT
);
96 MLX5_SET(destroy_scheduling_element_in
, in
, scheduling_element_id
,
98 MLX5_SET(destroy_scheduling_element_in
, in
, scheduling_hierarchy
,
101 return mlx5_cmd_exec(dev
, in
, sizeof(in
), out
, sizeof(out
));
104 /* Finds an entry where we can register the given rate
105 * If the rate already exists, return the entry where it is registered,
106 * otherwise return the first available entry.
107 * If the table is full, return NULL
109 static struct mlx5_rl_entry
*find_rl_entry(struct mlx5_rl_table
*table
,
112 struct mlx5_rl_entry
*ret_entry
= NULL
;
113 bool empty_found
= false;
116 for (i
= 0; i
< table
->max_size
; i
++) {
117 if (table
->rl_entry
[i
].rate
== rate
)
118 return &table
->rl_entry
[i
];
119 if (!empty_found
&& !table
->rl_entry
[i
].rate
) {
121 ret_entry
= &table
->rl_entry
[i
];
128 static int mlx5_set_pp_rate_limit_cmd(struct mlx5_core_dev
*dev
,
131 u32 in
[MLX5_ST_SZ_DW(set_pp_rate_limit_in
)] = {0};
132 u32 out
[MLX5_ST_SZ_DW(set_pp_rate_limit_out
)] = {0};
134 MLX5_SET(set_pp_rate_limit_in
, in
, opcode
,
135 MLX5_CMD_OP_SET_PP_RATE_LIMIT
);
136 MLX5_SET(set_pp_rate_limit_in
, in
, rate_limit_index
, index
);
137 MLX5_SET(set_pp_rate_limit_in
, in
, rate_limit
, rate
);
138 return mlx5_cmd_exec(dev
, in
, sizeof(in
), out
, sizeof(out
));
141 bool mlx5_rl_is_in_range(struct mlx5_core_dev
*dev
, u32 rate
)
143 struct mlx5_rl_table
*table
= &dev
->priv
.rl_table
;
145 return (rate
<= table
->max_rate
&& rate
>= table
->min_rate
);
147 EXPORT_SYMBOL(mlx5_rl_is_in_range
);
149 int mlx5_rl_add_rate(struct mlx5_core_dev
*dev
, u32 rate
, u16
*index
)
151 struct mlx5_rl_table
*table
= &dev
->priv
.rl_table
;
152 struct mlx5_rl_entry
*entry
;
155 mutex_lock(&table
->rl_lock
);
157 if (!rate
|| !mlx5_rl_is_in_range(dev
, rate
)) {
158 mlx5_core_err(dev
, "Invalid rate: %u, should be %u to %u\n",
159 rate
, table
->min_rate
, table
->max_rate
);
164 entry
= find_rl_entry(table
, rate
);
166 mlx5_core_err(dev
, "Max number of %u rates reached\n",
171 if (entry
->refcount
) {
172 /* rate already configured */
176 err
= mlx5_set_pp_rate_limit_cmd(dev
, rate
, entry
->index
);
178 mlx5_core_err(dev
, "Failed configuring rate: %u (%d)\n",
185 *index
= entry
->index
;
188 mutex_unlock(&table
->rl_lock
);
191 EXPORT_SYMBOL(mlx5_rl_add_rate
);
193 void mlx5_rl_remove_rate(struct mlx5_core_dev
*dev
, u32 rate
)
195 struct mlx5_rl_table
*table
= &dev
->priv
.rl_table
;
196 struct mlx5_rl_entry
*entry
= NULL
;
198 /* 0 is a reserved value for unlimited rate */
202 mutex_lock(&table
->rl_lock
);
203 entry
= find_rl_entry(table
, rate
);
204 if (!entry
|| !entry
->refcount
) {
205 mlx5_core_warn(dev
, "Rate %u is not configured\n", rate
);
210 if (!entry
->refcount
) {
211 /* need to remove rate */
212 mlx5_set_pp_rate_limit_cmd(dev
, 0, entry
->index
);
217 mutex_unlock(&table
->rl_lock
);
219 EXPORT_SYMBOL(mlx5_rl_remove_rate
);
221 int mlx5_init_rl_table(struct mlx5_core_dev
*dev
)
223 struct mlx5_rl_table
*table
= &dev
->priv
.rl_table
;
226 mutex_init(&table
->rl_lock
);
227 if (!MLX5_CAP_GEN(dev
, qos
) || !MLX5_CAP_QOS(dev
, packet_pacing
)) {
232 /* First entry is reserved for unlimited rate */
233 table
->max_size
= MLX5_CAP_QOS(dev
, packet_pacing_rate_table_size
) - 1;
234 table
->max_rate
= MLX5_CAP_QOS(dev
, packet_pacing_max_rate
);
235 table
->min_rate
= MLX5_CAP_QOS(dev
, packet_pacing_min_rate
);
237 table
->rl_entry
= kcalloc(table
->max_size
, sizeof(struct mlx5_rl_entry
),
239 if (!table
->rl_entry
)
242 /* The index represents the index in HW rate limit table
243 * Index 0 is reserved for unlimited rate
245 for (i
= 0; i
< table
->max_size
; i
++)
246 table
->rl_entry
[i
].index
= i
+ 1;
248 /* Index 0 is reserved */
249 mlx5_core_info(dev
, "Rate limit: %u rates are supported, range: %uMbps to %uMbps\n",
251 table
->min_rate
>> 10,
252 table
->max_rate
>> 10);
257 void mlx5_cleanup_rl_table(struct mlx5_core_dev
*dev
)
259 struct mlx5_rl_table
*table
= &dev
->priv
.rl_table
;
262 /* Clear all configured rates */
263 for (i
= 0; i
< table
->max_size
; i
++)
264 if (table
->rl_entry
[i
].rate
)
265 mlx5_set_pp_rate_limit_cmd(dev
, 0,
266 table
->rl_entry
[i
].index
);
268 kfree(dev
->priv
.rl_table
.rl_entry
);