1 /* QLogic qed NIC Driver 2 * Copyright (c) 2015-2017 QLogic Corporation 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 #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> 40 #include "qed.h" 41 #include "qed_iscsi.h" 42 #include "qed_ll2.h" 43 #include "qed_ooo.h" 44 #include "qed_cxt.h" 45 46 static struct qed_ooo_archipelago 47 *qed_ooo_seek_archipelago(struct qed_hwfn *p_hwfn, 48 struct qed_ooo_info 49 *p_ooo_info, 50 u32 cid) 51 { 52 u32 idx = (cid & 0xffff) - p_ooo_info->cid_base; 53 struct qed_ooo_archipelago *p_archipelago; 54 55 if (idx >= p_ooo_info->max_num_archipelagos) 56 return NULL; 57 58 p_archipelago = &p_ooo_info->p_archipelagos_mem[idx]; 59 60 if (list_empty(&p_archipelago->isles_list)) 61 return NULL; 62 63 return p_archipelago; 64 } 65 66 static struct qed_ooo_isle *qed_ooo_seek_isle(struct qed_hwfn *p_hwfn, 67 struct qed_ooo_info *p_ooo_info, 68 u32 cid, u8 isle) 69 { 70 struct qed_ooo_archipelago *p_archipelago = NULL; 71 struct qed_ooo_isle *p_isle = NULL; 72 u8 the_num_of_isle = 1; 73 74 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid); 75 if (!p_archipelago) { 76 DP_NOTICE(p_hwfn, 77 "Connection %d is not found in OOO list\n", cid); 78 return NULL; 79 } 80 81 list_for_each_entry(p_isle, &p_archipelago->isles_list, list_entry) { 82 if (the_num_of_isle == isle) 83 return p_isle; 84 the_num_of_isle++; 85 } 86 87 return NULL; 88 } 89 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) 93 { 94 struct qed_ooo_history *p_history = &p_ooo_info->ooo_history; 95 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++; 100 } 101 102 struct qed_ooo_info *qed_ooo_alloc(struct qed_hwfn *p_hwfn) 103 { 104 u16 max_num_archipelagos = 0, cid_base; 105 struct qed_ooo_info *p_ooo_info; 106 u16 max_num_isles = 0; 107 u32 i; 108 109 if (p_hwfn->hw_info.personality != QED_PCI_ISCSI) { 110 DP_NOTICE(p_hwfn, 111 "Failed to allocate qed_ooo_info: unknown personality\n"); 112 return NULL; 113 } 114 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); 118 119 if (!max_num_archipelagos) { 120 DP_NOTICE(p_hwfn, 121 "Failed to allocate qed_ooo_info: unknown amount of connections\n"); 122 return NULL; 123 } 124 125 p_ooo_info = kzalloc(sizeof(*p_ooo_info), GFP_KERNEL); 126 if (!p_ooo_info) 127 return NULL; 128 129 p_ooo_info->cid_base = cid_base; 130 p_ooo_info->max_num_archipelagos = max_num_archipelagos; 131 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); 135 136 p_ooo_info->p_isles_mem = kcalloc(max_num_isles, 137 sizeof(struct qed_ooo_isle), 138 GFP_KERNEL); 139 if (!p_ooo_info->p_isles_mem) 140 goto no_isles_mem; 141 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); 146 } 147 148 p_ooo_info->p_archipelagos_mem = 149 kcalloc(max_num_archipelagos, 150 sizeof(struct qed_ooo_archipelago), 151 GFP_KERNEL); 152 if (!p_ooo_info->p_archipelagos_mem) 153 goto no_archipelagos_mem; 154 155 for (i = 0; i < max_num_archipelagos; i++) 156 INIT_LIST_HEAD(&p_ooo_info->p_archipelagos_mem[i].isles_list); 157 158 p_ooo_info->ooo_history.p_cqes = 159 kcalloc(QED_MAX_NUM_OOO_HISTORY_ENTRIES, 160 sizeof(struct ooo_opaque), 161 GFP_KERNEL); 162 if (!p_ooo_info->ooo_history.p_cqes) 163 goto no_history_mem; 164 165 p_ooo_info->ooo_history.num_of_cqes = QED_MAX_NUM_OOO_HISTORY_ENTRIES; 166 167 return p_ooo_info; 168 169 no_history_mem: 170 kfree(p_ooo_info->p_archipelagos_mem); 171 no_archipelagos_mem: 172 kfree(p_ooo_info->p_isles_mem); 173 no_isles_mem: 174 kfree(p_ooo_info); 175 return NULL; 176 } 177 178 void qed_ooo_release_connection_isles(struct qed_hwfn *p_hwfn, 179 struct qed_ooo_info *p_ooo_info, u32 cid) 180 { 181 struct qed_ooo_archipelago *p_archipelago; 182 struct qed_ooo_buffer *p_buffer; 183 struct qed_ooo_isle *p_isle; 184 185 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid); 186 if (!p_archipelago) 187 return; 188 189 while (!list_empty(&p_archipelago->isles_list)) { 190 p_isle = list_first_entry(&p_archipelago->isles_list, 191 struct qed_ooo_isle, list_entry); 192 193 list_del(&p_isle->list_entry); 194 195 while (!list_empty(&p_isle->buffers_list)) { 196 p_buffer = list_first_entry(&p_isle->buffers_list, 197 struct qed_ooo_buffer, 198 list_entry); 199 200 if (!p_buffer) 201 break; 202 203 list_del(&p_buffer->list_entry); 204 list_add_tail(&p_buffer->list_entry, 205 &p_ooo_info->free_buffers_list); 206 } 207 list_add_tail(&p_isle->list_entry, 208 &p_ooo_info->free_isles_list); 209 } 210 } 211 212 void qed_ooo_release_all_isles(struct qed_hwfn *p_hwfn, 213 struct qed_ooo_info *p_ooo_info) 214 { 215 struct qed_ooo_archipelago *p_archipelago; 216 struct qed_ooo_buffer *p_buffer; 217 struct qed_ooo_isle *p_isle; 218 u32 i; 219 220 for (i = 0; i < p_ooo_info->max_num_archipelagos; i++) { 221 p_archipelago = &(p_ooo_info->p_archipelagos_mem[i]); 222 223 while (!list_empty(&p_archipelago->isles_list)) { 224 p_isle = list_first_entry(&p_archipelago->isles_list, 225 struct qed_ooo_isle, 226 list_entry); 227 228 list_del(&p_isle->list_entry); 229 230 while (!list_empty(&p_isle->buffers_list)) { 231 p_buffer = 232 list_first_entry(&p_isle->buffers_list, 233 struct qed_ooo_buffer, 234 list_entry); 235 236 if (!p_buffer) 237 break; 238 239 list_del(&p_buffer->list_entry); 240 list_add_tail(&p_buffer->list_entry, 241 &p_ooo_info->free_buffers_list); 242 } 243 list_add_tail(&p_isle->list_entry, 244 &p_ooo_info->free_isles_list); 245 } 246 } 247 if (!list_empty(&p_ooo_info->ready_buffers_list)) 248 list_splice_tail_init(&p_ooo_info->ready_buffers_list, 249 &p_ooo_info->free_buffers_list); 250 } 251 252 void qed_ooo_setup(struct qed_hwfn *p_hwfn, struct qed_ooo_info *p_ooo_info) 253 { 254 qed_ooo_release_all_isles(p_hwfn, p_ooo_info); 255 memset(p_ooo_info->ooo_history.p_cqes, 0, 256 p_ooo_info->ooo_history.num_of_cqes * 257 sizeof(struct ooo_opaque)); 258 p_ooo_info->ooo_history.head_idx = 0; 259 } 260 261 void qed_ooo_free(struct qed_hwfn *p_hwfn, struct qed_ooo_info *p_ooo_info) 262 { 263 struct qed_ooo_buffer *p_buffer; 264 265 qed_ooo_release_all_isles(p_hwfn, p_ooo_info); 266 while (!list_empty(&p_ooo_info->free_buffers_list)) { 267 p_buffer = list_first_entry(&p_ooo_info->free_buffers_list, 268 struct qed_ooo_buffer, list_entry); 269 270 if (!p_buffer) 271 break; 272 273 list_del(&p_buffer->list_entry); 274 dma_free_coherent(&p_hwfn->cdev->pdev->dev, 275 p_buffer->rx_buffer_size, 276 p_buffer->rx_buffer_virt_addr, 277 p_buffer->rx_buffer_phys_addr); 278 kfree(p_buffer); 279 } 280 281 kfree(p_ooo_info->p_isles_mem); 282 kfree(p_ooo_info->p_archipelagos_mem); 283 kfree(p_ooo_info->ooo_history.p_cqes); 284 kfree(p_ooo_info); 285 } 286 287 void qed_ooo_put_free_buffer(struct qed_hwfn *p_hwfn, 288 struct qed_ooo_info *p_ooo_info, 289 struct qed_ooo_buffer *p_buffer) 290 { 291 list_add_tail(&p_buffer->list_entry, &p_ooo_info->free_buffers_list); 292 } 293 294 struct qed_ooo_buffer *qed_ooo_get_free_buffer(struct qed_hwfn *p_hwfn, 295 struct qed_ooo_info *p_ooo_info) 296 { 297 struct qed_ooo_buffer *p_buffer = NULL; 298 299 if (!list_empty(&p_ooo_info->free_buffers_list)) { 300 p_buffer = list_first_entry(&p_ooo_info->free_buffers_list, 301 struct qed_ooo_buffer, list_entry); 302 303 list_del(&p_buffer->list_entry); 304 } 305 306 return p_buffer; 307 } 308 309 void qed_ooo_put_ready_buffer(struct qed_hwfn *p_hwfn, 310 struct qed_ooo_info *p_ooo_info, 311 struct qed_ooo_buffer *p_buffer, u8 on_tail) 312 { 313 if (on_tail) 314 list_add_tail(&p_buffer->list_entry, 315 &p_ooo_info->ready_buffers_list); 316 else 317 list_add(&p_buffer->list_entry, 318 &p_ooo_info->ready_buffers_list); 319 } 320 321 struct qed_ooo_buffer *qed_ooo_get_ready_buffer(struct qed_hwfn *p_hwfn, 322 struct qed_ooo_info *p_ooo_info) 323 { 324 struct qed_ooo_buffer *p_buffer = NULL; 325 326 if (!list_empty(&p_ooo_info->ready_buffers_list)) { 327 p_buffer = list_first_entry(&p_ooo_info->ready_buffers_list, 328 struct qed_ooo_buffer, list_entry); 329 330 list_del(&p_buffer->list_entry); 331 } 332 333 return p_buffer; 334 } 335 336 void qed_ooo_delete_isles(struct qed_hwfn *p_hwfn, 337 struct qed_ooo_info *p_ooo_info, 338 u32 cid, u8 drop_isle, u8 drop_size) 339 { 340 struct qed_ooo_archipelago *p_archipelago = NULL; 341 struct qed_ooo_isle *p_isle = NULL; 342 u8 isle_idx; 343 344 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid); 345 for (isle_idx = 0; isle_idx < drop_size; isle_idx++) { 346 p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, drop_isle); 347 if (!p_isle) { 348 DP_NOTICE(p_hwfn, 349 "Isle %d is not found(cid %d)\n", 350 drop_isle, cid); 351 return; 352 } 353 if (list_empty(&p_isle->buffers_list)) 354 DP_NOTICE(p_hwfn, 355 "Isle %d is empty(cid %d)\n", drop_isle, cid); 356 else 357 list_splice_tail_init(&p_isle->buffers_list, 358 &p_ooo_info->free_buffers_list); 359 360 list_del(&p_isle->list_entry); 361 p_ooo_info->cur_isles_number--; 362 list_add(&p_isle->list_entry, &p_ooo_info->free_isles_list); 363 } 364 } 365 366 void qed_ooo_add_new_isle(struct qed_hwfn *p_hwfn, 367 struct qed_ooo_info *p_ooo_info, 368 u32 cid, u8 ooo_isle, 369 struct qed_ooo_buffer *p_buffer) 370 { 371 struct qed_ooo_archipelago *p_archipelago = NULL; 372 struct qed_ooo_isle *p_prev_isle = NULL; 373 struct qed_ooo_isle *p_isle = NULL; 374 375 if (ooo_isle > 1) { 376 p_prev_isle = qed_ooo_seek_isle(p_hwfn, 377 p_ooo_info, cid, ooo_isle - 1); 378 if (!p_prev_isle) { 379 DP_NOTICE(p_hwfn, 380 "Isle %d is not found(cid %d)\n", 381 ooo_isle - 1, cid); 382 return; 383 } 384 } 385 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid); 386 if (!p_archipelago && (ooo_isle != 1)) { 387 DP_NOTICE(p_hwfn, 388 "Connection %d is not found in OOO list\n", cid); 389 return; 390 } 391 392 if (!list_empty(&p_ooo_info->free_isles_list)) { 393 p_isle = list_first_entry(&p_ooo_info->free_isles_list, 394 struct qed_ooo_isle, list_entry); 395 396 list_del(&p_isle->list_entry); 397 if (!list_empty(&p_isle->buffers_list)) { 398 DP_NOTICE(p_hwfn, "Free isle is not empty\n"); 399 INIT_LIST_HEAD(&p_isle->buffers_list); 400 } 401 } else { 402 DP_NOTICE(p_hwfn, "No more free isles\n"); 403 return; 404 } 405 406 if (!p_archipelago) { 407 u32 idx = (cid & 0xffff) - p_ooo_info->cid_base; 408 409 p_archipelago = &p_ooo_info->p_archipelagos_mem[idx]; 410 } 411 412 list_add(&p_buffer->list_entry, &p_isle->buffers_list); 413 p_ooo_info->cur_isles_number++; 414 p_ooo_info->gen_isles_number++; 415 416 if (p_ooo_info->cur_isles_number > p_ooo_info->max_isles_number) 417 p_ooo_info->max_isles_number = p_ooo_info->cur_isles_number; 418 419 if (!p_prev_isle) 420 list_add(&p_isle->list_entry, &p_archipelago->isles_list); 421 else 422 list_add(&p_isle->list_entry, &p_prev_isle->list_entry); 423 } 424 425 void qed_ooo_add_new_buffer(struct qed_hwfn *p_hwfn, 426 struct qed_ooo_info *p_ooo_info, 427 u32 cid, 428 u8 ooo_isle, 429 struct qed_ooo_buffer *p_buffer, u8 buffer_side) 430 { 431 struct qed_ooo_isle *p_isle = NULL; 432 433 p_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, ooo_isle); 434 if (!p_isle) { 435 DP_NOTICE(p_hwfn, 436 "Isle %d is not found(cid %d)\n", ooo_isle, cid); 437 return; 438 } 439 440 if (buffer_side == QED_OOO_LEFT_BUF) 441 list_add(&p_buffer->list_entry, &p_isle->buffers_list); 442 else 443 list_add_tail(&p_buffer->list_entry, &p_isle->buffers_list); 444 } 445 446 void qed_ooo_join_isles(struct qed_hwfn *p_hwfn, 447 struct qed_ooo_info *p_ooo_info, u32 cid, u8 left_isle) 448 { 449 struct qed_ooo_archipelago *p_archipelago = NULL; 450 struct qed_ooo_isle *p_right_isle = NULL; 451 struct qed_ooo_isle *p_left_isle = NULL; 452 453 p_right_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, 454 left_isle + 1); 455 if (!p_right_isle) { 456 DP_NOTICE(p_hwfn, 457 "Right isle %d is not found(cid %d)\n", 458 left_isle + 1, cid); 459 return; 460 } 461 462 p_archipelago = qed_ooo_seek_archipelago(p_hwfn, p_ooo_info, cid); 463 list_del(&p_right_isle->list_entry); 464 p_ooo_info->cur_isles_number--; 465 if (left_isle) { 466 p_left_isle = qed_ooo_seek_isle(p_hwfn, p_ooo_info, cid, 467 left_isle); 468 if (!p_left_isle) { 469 DP_NOTICE(p_hwfn, 470 "Left isle %d is not found(cid %d)\n", 471 left_isle, cid); 472 return; 473 } 474 list_splice_tail_init(&p_right_isle->buffers_list, 475 &p_left_isle->buffers_list); 476 } else { 477 list_splice_tail_init(&p_right_isle->buffers_list, 478 &p_ooo_info->ready_buffers_list); 479 } 480 list_add_tail(&p_right_isle->list_entry, &p_ooo_info->free_isles_list); 481 } 482