drivers/net/ethernet/qlogic/qed/qed_ooo.c

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