1 /* QLogic qed NIC Driver
2 * Copyright (c) 2015-2017 QLogic Corporation
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/types.h>
34 #include <linux/dma-mapping.h>
35 #include <linux/kernel.h>
36 #include <linux/list.h>
37 #include <linux/pci.h>
38 #include <linux/slab.h>
39 #include <linux/string.h>
41 #include "qed_iscsi.h"
46 static struct qed_ooo_archipelago
47 *qed_ooo_seek_archipelago(struct qed_hwfn *p_hwfn,
52 u32 idx = (cid & 0xffff) - p_ooo_info->cid_base;
53 struct qed_ooo_archipelago *p_archipelago;
55 if (idx >= p_ooo_info->max_num_archipelagos)
58 p_archipelago = &p_ooo_info->p_archipelagos_mem[idx];
60 if (list_empty(&p_archipelago->isles_list))
66 static struct qed_ooo_isle *qed_ooo_seek_isle(struct qed_hwfn *p_hwfn,
67 struct qed_ooo_info *p_ooo_info,
70 struct qed_ooo_archipelago *p_archipelago = NULL;
71 struct qed_ooo_isle *p_isle = NULL;
72 u8 the_num_of_isle = 1;
74 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
77 "Connection %d is not found in OOO list\n", cid);
81 list_for_each_entry(p_isle, &p_archipelago->isles_list, list_entry) {
82 if (the_num_of_isle == isle)
90 void qed_ooo_save_history_entry(struct qed_hwfn *p_hwfn,
91 struct qed_ooo_info *p_ooo_info,
92 struct ooo_opaque *p_cqe)
94 struct qed_ooo_history *p_history = &p_ooo_info->ooo_history;
96 if (p_history->head_idx == p_history->num_of_cqes)
97 p_history->head_idx = 0;
98 p_history->p_cqes[p_history->head_idx] = *p_cqe;
99 p_history->head_idx++;
102 int qed_ooo_alloc(struct qed_hwfn *p_hwfn)
104 u16 max_num_archipelagos = 0, cid_base;
105 struct qed_ooo_info *p_ooo_info;
106 u16 max_num_isles = 0;
109 if (p_hwfn->hw_info.personality != QED_PCI_ISCSI) {
111 "Failed to allocate qed_ooo_info: unknown personality\n");
115 max_num_archipelagos = p_hwfn->pf_params.iscsi_pf_params.num_cons;
116 max_num_isles = QED_MAX_NUM_ISLES + max_num_archipelagos;
117 cid_base = (u16)qed_cxt_get_proto_cid_start(p_hwfn, PROTOCOLID_ISCSI);
119 if (!max_num_archipelagos) {
121 "Failed to allocate qed_ooo_info: unknown amount of connections\n");
125 p_ooo_info = kzalloc(sizeof(*p_ooo_info), GFP_KERNEL);
129 p_ooo_info->cid_base = cid_base;
130 p_ooo_info->max_num_archipelagos = max_num_archipelagos;
132 INIT_LIST_HEAD(&p_ooo_info->free_buffers_list);
133 INIT_LIST_HEAD(&p_ooo_info->ready_buffers_list);
134 INIT_LIST_HEAD(&p_ooo_info->free_isles_list);
136 p_ooo_info->p_isles_mem = kcalloc(max_num_isles,
137 sizeof(struct qed_ooo_isle),
139 if (!p_ooo_info->p_isles_mem)
142 for (i = 0; i < max_num_isles; i++) {
143 INIT_LIST_HEAD(&p_ooo_info->p_isles_mem[i].buffers_list);
144 list_add_tail(&p_ooo_info->p_isles_mem[i].list_entry,
145 &p_ooo_info->free_isles_list);
148 p_ooo_info->p_archipelagos_mem =
149 kcalloc(max_num_archipelagos,
150 sizeof(struct qed_ooo_archipelago),
152 if (!p_ooo_info->p_archipelagos_mem)
153 goto no_archipelagos_mem;
155 for (i = 0; i < max_num_archipelagos; i++)
156 INIT_LIST_HEAD(&p_ooo_info->p_archipelagos_mem[i].isles_list);
158 p_ooo_info->ooo_history.p_cqes =
159 kcalloc(QED_MAX_NUM_OOO_HISTORY_ENTRIES,
160 sizeof(struct ooo_opaque),
162 if (!p_ooo_info->ooo_history.p_cqes)
165 p_ooo_info->ooo_history.num_of_cqes = QED_MAX_NUM_OOO_HISTORY_ENTRIES;
167 p_hwfn->p_ooo_info = p_ooo_info;
171 kfree(p_ooo_info->p_archipelagos_mem);
173 kfree(p_ooo_info->p_isles_mem);
179 void qed_ooo_release_connection_isles(struct qed_hwfn *p_hwfn,
180 struct qed_ooo_info *p_ooo_info, u32 cid)
182 struct qed_ooo_archipelago *p_archipelago;
183 struct qed_ooo_buffer *p_buffer;
184 struct qed_ooo_isle *p_isle;
186 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
190 while (!list_empty(&p_archipelago->isles_list)) {
191 p_isle = list_first_entry(&p_archipelago->isles_list,
192 struct qed_ooo_isle, list_entry);
194 list_del(&p_isle->list_entry);
196 while (!list_empty(&p_isle->buffers_list)) {
197 p_buffer = list_first_entry(&p_isle->buffers_list,
198 struct qed_ooo_buffer,
204 list_del(&p_buffer->list_entry);
205 list_add_tail(&p_buffer->list_entry,
206 &p_ooo_info->free_buffers_list);
208 list_add_tail(&p_isle->list_entry,
209 &p_ooo_info->free_isles_list);
213 void qed_ooo_release_all_isles(struct qed_hwfn *p_hwfn,
214 struct qed_ooo_info *p_ooo_info)
216 struct qed_ooo_archipelago *p_archipelago;
217 struct qed_ooo_buffer *p_buffer;
218 struct qed_ooo_isle *p_isle;
221 for (i = 0; i < p_ooo_info->max_num_archipelagos; i++) {
222 p_archipelago = &(p_ooo_info->p_archipelagos_mem[i]);
224 while (!list_empty(&p_archipelago->isles_list)) {
225 p_isle = list_first_entry(&p_archipelago->isles_list,
229 list_del(&p_isle->list_entry);
231 while (!list_empty(&p_isle->buffers_list)) {
233 list_first_entry(&p_isle->buffers_list,
234 struct qed_ooo_buffer,
240 list_del(&p_buffer->list_entry);
241 list_add_tail(&p_buffer->list_entry,
242 &p_ooo_info->free_buffers_list);
244 list_add_tail(&p_isle->list_entry,
245 &p_ooo_info->free_isles_list);
248 if (!list_empty(&p_ooo_info->ready_buffers_list))
249 list_splice_tail_init(&p_ooo_info->ready_buffers_list,
250 &p_ooo_info->free_buffers_list);
253 void qed_ooo_setup(struct qed_hwfn *p_hwfn)
255 qed_ooo_release_all_isles(p_hwfn, p_hwfn->p_ooo_info);
256 memset(p_hwfn->p_ooo_info->ooo_history.p_cqes, 0,
257 p_hwfn->p_ooo_info->ooo_history.num_of_cqes *
258 sizeof(struct ooo_opaque));
259 p_hwfn->p_ooo_info->ooo_history.head_idx = 0;
262 void qed_ooo_free(struct qed_hwfn *p_hwfn)
264 struct qed_ooo_info *p_ooo_info = p_hwfn->p_ooo_info;
265 struct qed_ooo_buffer *p_buffer;
270 qed_ooo_release_all_isles(p_hwfn, p_ooo_info);
271 while (!list_empty(&p_ooo_info->free_buffers_list)) {
272 p_buffer = list_first_entry(&p_ooo_info->free_buffers_list,
273 struct qed_ooo_buffer, list_entry);
278 list_del(&p_buffer->list_entry);
279 dma_free_coherent(&p_hwfn->cdev->pdev->dev,
280 p_buffer->rx_buffer_size,
281 p_buffer->rx_buffer_virt_addr,
282 p_buffer->rx_buffer_phys_addr);
286 kfree(p_ooo_info->p_isles_mem);
287 kfree(p_ooo_info->p_archipelagos_mem);
288 kfree(p_ooo_info->ooo_history.p_cqes);
290 p_hwfn->p_ooo_info = NULL;
293 void qed_ooo_put_free_buffer(struct qed_hwfn *p_hwfn,
294 struct qed_ooo_info *p_ooo_info,
295 struct qed_ooo_buffer *p_buffer)
297 list_add_tail(&p_buffer->list_entry, &p_ooo_info->free_buffers_list);
300 struct qed_ooo_buffer *qed_ooo_get_free_buffer(struct qed_hwfn *p_hwfn,
301 struct qed_ooo_info *p_ooo_info)
303 struct qed_ooo_buffer *p_buffer = NULL;
305 if (!list_empty(&p_ooo_info->free_buffers_list)) {
306 p_buffer = list_first_entry(&p_ooo_info->free_buffers_list,
307 struct qed_ooo_buffer, list_entry);
309 list_del(&p_buffer->list_entry);
315 void qed_ooo_put_ready_buffer(struct qed_hwfn *p_hwfn,
316 struct qed_ooo_info *p_ooo_info,
317 struct qed_ooo_buffer *p_buffer, u8 on_tail)
320 list_add_tail(&p_buffer->list_entry,
321 &p_ooo_info->ready_buffers_list);
323 list_add(&p_buffer->list_entry,
324 &p_ooo_info->ready_buffers_list);
327 struct qed_ooo_buffer *qed_ooo_get_ready_buffer(struct qed_hwfn *p_hwfn,
328 struct qed_ooo_info *p_ooo_info)
330 struct qed_ooo_buffer *p_buffer = NULL;
332 if (!list_empty(&p_ooo_info->ready_buffers_list)) {
333 p_buffer = list_first_entry(&p_ooo_info->ready_buffers_list,
334 struct qed_ooo_buffer, list_entry);
336 list_del(&p_buffer->list_entry);
342 void qed_ooo_delete_isles(struct qed_hwfn *p_hwfn,
343 struct qed_ooo_info *p_ooo_info,
344 u32 cid, u8 drop_isle, u8 drop_size)
346 struct qed_ooo_archipelago *p_archipelago = NULL;
347 struct qed_ooo_isle *p_isle = NULL;
350 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
351 for (isle_idx = 0; isle_idx < drop_size; isle_idx++) {
352 p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, drop_isle);
355 "Isle %d is not found(cid %d)\n",
359 if (list_empty(&p_isle->buffers_list))
361 "Isle %d is empty(cid %d)\n", drop_isle, cid);
363 list_splice_tail_init(&p_isle->buffers_list,
364 &p_ooo_info->free_buffers_list);
366 list_del(&p_isle->list_entry);
367 p_ooo_info->cur_isles_number--;
368 list_add(&p_isle->list_entry, &p_ooo_info->free_isles_list);
372 void qed_ooo_add_new_isle(struct qed_hwfn *p_hwfn,
373 struct qed_ooo_info *p_ooo_info,
374 u32 cid, u8 ooo_isle,
375 struct qed_ooo_buffer *p_buffer)
377 struct qed_ooo_archipelago *p_archipelago = NULL;
378 struct qed_ooo_isle *p_prev_isle = NULL;
379 struct qed_ooo_isle *p_isle = NULL;
382 p_prev_isle = qed_ooo_seek_isle(p_hwfn,
383 p_ooo_info, cid, ooo_isle - 1);
386 "Isle %d is not found(cid %d)\n",
391 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
392 if (!p_archipelago && (ooo_isle != 1)) {
394 "Connection %d is not found in OOO list\n", cid);
398 if (!list_empty(&p_ooo_info->free_isles_list)) {
399 p_isle = list_first_entry(&p_ooo_info->free_isles_list,
400 struct qed_ooo_isle, list_entry);
402 list_del(&p_isle->list_entry);
403 if (!list_empty(&p_isle->buffers_list)) {
404 DP_NOTICE(p_hwfn, "Free isle is not empty\n");
405 INIT_LIST_HEAD(&p_isle->buffers_list);
408 DP_NOTICE(p_hwfn, "No more free isles\n");
412 if (!p_archipelago) {
413 u32 idx = (cid & 0xffff) - p_ooo_info->cid_base;
415 p_archipelago = &p_ooo_info->p_archipelagos_mem[idx];
418 list_add(&p_buffer->list_entry, &p_isle->buffers_list);
419 p_ooo_info->cur_isles_number++;
420 p_ooo_info->gen_isles_number++;
422 if (p_ooo_info->cur_isles_number > p_ooo_info->max_isles_number)
423 p_ooo_info->max_isles_number = p_ooo_info->cur_isles_number;
426 list_add(&p_isle->list_entry, &p_archipelago->isles_list);
428 list_add(&p_isle->list_entry, &p_prev_isle->list_entry);
431 void qed_ooo_add_new_buffer(struct qed_hwfn *p_hwfn,
432 struct qed_ooo_info *p_ooo_info,
435 struct qed_ooo_buffer *p_buffer, u8 buffer_side)
437 struct qed_ooo_isle *p_isle = NULL;
439 p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, ooo_isle);
442 "Isle %d is not found(cid %d)\n", ooo_isle, cid);
446 if (buffer_side == QED_OOO_LEFT_BUF)
447 list_add(&p_buffer->list_entry, &p_isle->buffers_list);
449 list_add_tail(&p_buffer->list_entry, &p_isle->buffers_list);
452 void qed_ooo_join_isles(struct qed_hwfn *p_hwfn,
453 struct qed_ooo_info *p_ooo_info, u32 cid, u8 left_isle)
455 struct qed_ooo_archipelago *p_archipelago = NULL;
456 struct qed_ooo_isle *p_right_isle = NULL;
457 struct qed_ooo_isle *p_left_isle = NULL;
459 p_right_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid,
463 "Right isle %d is not found(cid %d)\n",
468 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid);
469 list_del(&p_right_isle->list_entry);
470 p_ooo_info->cur_isles_number--;
472 p_left_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid,
476 "Left isle %d is not found(cid %d)\n",
480 list_splice_tail_init(&p_right_isle->buffers_list,
481 &p_left_isle->buffers_list);
483 list_splice_tail_init(&p_right_isle->buffers_list,
484 &p_ooo_info->ready_buffers_list);
486 list_add_tail(&p_right_isle->list_entry, &p_ooo_info->free_isles_list);