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

   1 /* QLogic qed NIC Driver
   2  * Copyright (c) 2015 QLogic Corporation
   3  *
   4  * This software is available under the terms of the GNU General Public License
   5  * (GPL) Version 2, available from the file COPYING in the main directory of
   6  * this source tree.
   7  */
   8
   9 #include <linux/types.h>
  10 #include <asm/byteorder.h>
  11 #include <linux/io.h>
  12 #include <linux/delay.h>
  13 #include <linux/dma-mapping.h>
  14 #include <linux/errno.h>
  15 #include <linux/kernel.h>
  16 #include <linux/list.h>
  17 #include <linux/pci.h>
  18 #include <linux/slab.h>
  19 #include <linux/spinlock.h>
  20 #include <linux/string.h>
  21 #include "qed.h"
  22 #include "qed_cxt.h"
  23 #include "qed_dev_api.h"
  24 #include "qed_hsi.h"
  25 #include "qed_hw.h"
  26 #include "qed_int.h"
  27 #include "qed_mcp.h"
  28 #include "qed_reg_addr.h"
  29 #include "qed_sp.h"
  30
  31 /***************************************************************************
  32 * Structures & Definitions
  33 ***************************************************************************/
  34
  35 #define SPQ_HIGH_PRI_RESERVE_DEFAULT    (1)
  36 #define SPQ_BLOCK_SLEEP_LENGTH          (1000)
  37
  38 /***************************************************************************
  39 * Blocking Imp. (BLOCK/EBLOCK mode)
  40 ***************************************************************************/
  41 static void qed_spq_blocking_cb(struct qed_hwfn *p_hwfn,
  42                                 void *cookie,
  43                                 union event_ring_data *data,
  44                                 u8 fw_return_code)
  45 {
  46         struct qed_spq_comp_done *comp_done;
  47
  48         comp_done = (struct qed_spq_comp_done *)cookie;
  49
  50         comp_done->done                 = 0x1;
  51         comp_done->fw_return_code       = fw_return_code;
  52
  53         /* make update visible to waiting thread */
  54         smp_wmb();
  55 }
  56
  57 static int qed_spq_block(struct qed_hwfn *p_hwfn,
  58                          struct qed_spq_entry *p_ent,
  59                          u8 *p_fw_ret)
  60 {
  61         int sleep_count = SPQ_BLOCK_SLEEP_LENGTH;
  62         struct qed_spq_comp_done *comp_done;
  63         int rc;
  64
  65         comp_done = (struct qed_spq_comp_done *)p_ent->comp_cb.cookie;
  66         while (sleep_count) {
  67                 /* validate we receive completion update */
  68                 smp_rmb();
  69                 if (comp_done->done == 1) {
  70                         if (p_fw_ret)
  71                                 *p_fw_ret = comp_done->fw_return_code;
  72                         return 0;
  73                 }
  74                 usleep_range(5000, 10000);
  75                 sleep_count--;
  76         }
  77
  78         DP_INFO(p_hwfn, "Ramrod is stuck, requesting MCP drain\n");
  79         rc = qed_mcp_drain(p_hwfn, p_hwfn->p_main_ptt);
  80         if (rc != 0)
  81                 DP_NOTICE(p_hwfn, "MCP drain failed\n");
  82
  83         /* Retry after drain */
  84         sleep_count = SPQ_BLOCK_SLEEP_LENGTH;
  85         while (sleep_count) {
  86                 /* validate we receive completion update */
  87                 smp_rmb();
  88                 if (comp_done->done == 1) {
  89                         if (p_fw_ret)
  90                                 *p_fw_ret = comp_done->fw_return_code;
  91                         return 0;
  92                 }
  93                 usleep_range(5000, 10000);
  94                 sleep_count--;
  95         }
  96
  97         if (comp_done->done == 1) {
  98                 if (p_fw_ret)
  99                         *p_fw_ret = comp_done->fw_return_code;
 100                 return 0;
 101         }
 102
 103         DP_NOTICE(p_hwfn, "Ramrod is stuck, MCP drain failed\n");
 104
 105         return -EBUSY;
 106 }
 107
 108 /***************************************************************************
 109 * SPQ entries inner API
 110 ***************************************************************************/
 111 static int
 112 qed_spq_fill_entry(struct qed_hwfn *p_hwfn,
 113                    struct qed_spq_entry *p_ent)
 114 {
 115         p_ent->elem.hdr.echo = 0;
 116         p_hwfn->p_spq->echo_idx++;
 117         p_ent->flags = 0;
 118
 119         switch (p_ent->comp_mode) {
 120         case QED_SPQ_MODE_EBLOCK:
 121         case QED_SPQ_MODE_BLOCK:
 122                 p_ent->comp_cb.function = qed_spq_blocking_cb;
 123                 break;
 124         case QED_SPQ_MODE_CB:
 125                 break;
 126         default:
 127                 DP_NOTICE(p_hwfn, "Unknown SPQE completion mode %d\n",
 128                           p_ent->comp_mode);
 129                 return -EINVAL;
 130         }
 131
 132         DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
 133                    "Ramrod header: [CID 0x%08x CMD 0x%02x protocol 0x%02x] Data pointer: [%08x:%08x] Completion Mode: %s\n",
 134                    p_ent->elem.hdr.cid,
 135                    p_ent->elem.hdr.cmd_id,
 136                    p_ent->elem.hdr.protocol_id,
 137                    p_ent->elem.data_ptr.hi,
 138                    p_ent->elem.data_ptr.lo,
 139                    D_TRINE(p_ent->comp_mode, QED_SPQ_MODE_EBLOCK,
 140                            QED_SPQ_MODE_BLOCK, "MODE_EBLOCK", "MODE_BLOCK",
 141                            "MODE_CB"));
 142
 143         return 0;
 144 }
 145
 146 /***************************************************************************
 147 * HSI access
 148 ***************************************************************************/
 149 static void qed_spq_hw_initialize(struct qed_hwfn *p_hwfn,
 150                                   struct qed_spq *p_spq)
 151 {
 152         u16                             pq;
 153         struct qed_cxt_info             cxt_info;
 154         struct core_conn_context        *p_cxt;
 155         union qed_qm_pq_params          pq_params;
 156         int                             rc;
 157
 158         cxt_info.iid = p_spq->cid;
 159
 160         rc = qed_cxt_get_cid_info(p_hwfn, &cxt_info);
 161
 162         if (rc < 0) {
 163                 DP_NOTICE(p_hwfn, "Cannot find context info for cid=%d\n",
 164                           p_spq->cid);
 165                 return;
 166         }
 167
 168         p_cxt = cxt_info.p_cxt;
 169
 170         SET_FIELD(p_cxt->xstorm_ag_context.flags10,
 171                   XSTORM_CORE_CONN_AG_CTX_DQ_CF_EN, 1);
 172         SET_FIELD(p_cxt->xstorm_ag_context.flags1,
 173                   XSTORM_CORE_CONN_AG_CTX_DQ_CF_ACTIVE, 1);
 174         SET_FIELD(p_cxt->xstorm_ag_context.flags9,
 175                   XSTORM_CORE_CONN_AG_CTX_CONSOLID_PROD_CF_EN, 1);
 176
 177         /* QM physical queue */
 178         memset(&pq_params, 0, sizeof(pq_params));
 179         pq_params.core.tc = LB_TC;
 180         pq = qed_get_qm_pq(p_hwfn, PROTOCOLID_CORE, &pq_params);
 181         p_cxt->xstorm_ag_context.physical_q0 = cpu_to_le16(pq);
 182
 183         p_cxt->xstorm_st_context.spq_base_lo =
 184                 DMA_LO_LE(p_spq->chain.p_phys_addr);
 185         p_cxt->xstorm_st_context.spq_base_hi =
 186                 DMA_HI_LE(p_spq->chain.p_phys_addr);
 187
 188         p_cxt->xstorm_st_context.consolid_base_addr.lo =
 189                 DMA_LO_LE(p_hwfn->p_consq->chain.p_phys_addr);
 190         p_cxt->xstorm_st_context.consolid_base_addr.hi =
 191                 DMA_HI_LE(p_hwfn->p_consq->chain.p_phys_addr);
 192 }
 193
 194 static int qed_spq_hw_post(struct qed_hwfn *p_hwfn,
 195                            struct qed_spq *p_spq,
 196                            struct qed_spq_entry *p_ent)
 197 {
 198         struct qed_chain                *p_chain = &p_hwfn->p_spq->chain;
 199         struct slow_path_element        *elem;
 200         struct core_db_data             db;
 201
 202         elem = qed_chain_produce(p_chain);
 203         if (!elem) {
 204                 DP_NOTICE(p_hwfn, "Failed to produce from SPQ chain\n");
 205                 return -EINVAL;
 206         }
 207
 208         *elem = p_ent->elem; /* struct assignment */
 209
 210         /* send a doorbell on the slow hwfn session */
 211         memset(&db, 0, sizeof(db));
 212         SET_FIELD(db.params, CORE_DB_DATA_DEST, DB_DEST_XCM);
 213         SET_FIELD(db.params, CORE_DB_DATA_AGG_CMD, DB_AGG_CMD_SET);
 214         SET_FIELD(db.params, CORE_DB_DATA_AGG_VAL_SEL,
 215                   DQ_XCM_CORE_SPQ_PROD_CMD);
 216         db.agg_flags = DQ_XCM_CORE_DQ_CF_CMD;
 217
 218         /* validate producer is up to-date */
 219         rmb();
 220
 221         db.spq_prod = cpu_to_le16(qed_chain_get_prod_idx(p_chain));
 222
 223         /* do not reorder */
 224         barrier();
 225
 226         DOORBELL(p_hwfn, qed_db_addr(p_spq->cid, DQ_DEMS_LEGACY), *(u32 *)&db);
 227
 228         /* make sure doorbell is rang */
 229         mmiowb();
 230
 231         DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
 232                    "Doorbelled [0x%08x, CID 0x%08x] with Flags: %02x agg_params: %02x, prod: %04x\n",
 233                    qed_db_addr(p_spq->cid, DQ_DEMS_LEGACY),
 234                    p_spq->cid, db.params, db.agg_flags,
 235                    qed_chain_get_prod_idx(p_chain));
 236
 237         return 0;
 238 }
 239
 240 /***************************************************************************
 241 * Asynchronous events
 242 ***************************************************************************/
 243 static int
 244 qed_async_event_completion(struct qed_hwfn *p_hwfn,
 245                            struct event_ring_entry *p_eqe)
 246 {
 247         DP_NOTICE(p_hwfn,
 248                   "Unknown Async completion for protocol: %d\n",
 249                    p_eqe->protocol_id);
 250         return -EINVAL;
 251 }
 252
 253 /***************************************************************************
 254 * EQ API
 255 ***************************************************************************/
 256 void qed_eq_prod_update(struct qed_hwfn *p_hwfn,
 257                         u16 prod)
 258 {
 259         u32 addr = GTT_BAR0_MAP_REG_USDM_RAM +
 260                    USTORM_EQE_CONS_OFFSET(p_hwfn->rel_pf_id);
 261
 262         REG_WR16(p_hwfn, addr, prod);
 263
 264         /* keep prod updates ordered */
 265         mmiowb();
 266 }
 267
 268 int qed_eq_completion(struct qed_hwfn *p_hwfn,
 269                       void *cookie)
 270
 271 {
 272         struct qed_eq *p_eq = cookie;
 273         struct qed_chain *p_chain = &p_eq->chain;
 274         int rc = 0;
 275
 276         /* take a snapshot of the FW consumer */
 277         u16 fw_cons_idx = le16_to_cpu(*p_eq->p_fw_cons);
 278
 279         DP_VERBOSE(p_hwfn, QED_MSG_SPQ, "fw_cons_idx %x\n", fw_cons_idx);
 280
 281         /* Need to guarantee the fw_cons index we use points to a usuable
 282          * element (to comply with our chain), so our macros would comply
 283          */
 284         if ((fw_cons_idx & qed_chain_get_usable_per_page(p_chain)) ==
 285             qed_chain_get_usable_per_page(p_chain))
 286                 fw_cons_idx += qed_chain_get_unusable_per_page(p_chain);
 287
 288         /* Complete current segment of eq entries */
 289         while (fw_cons_idx != qed_chain_get_cons_idx(p_chain)) {
 290                 struct event_ring_entry *p_eqe = qed_chain_consume(p_chain);
 291
 292                 if (!p_eqe) {
 293                         rc = -EINVAL;
 294                         break;
 295                 }
 296
 297                 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
 298                            "op %x prot %x res0 %x echo %x fwret %x flags %x\n",
 299                            p_eqe->opcode,
 300                            p_eqe->protocol_id,
 301                            p_eqe->reserved0,
 302                            le16_to_cpu(p_eqe->echo),
 303                            p_eqe->fw_return_code,
 304                            p_eqe->flags);
 305
 306                 if (GET_FIELD(p_eqe->flags, EVENT_RING_ENTRY_ASYNC)) {
 307                         if (qed_async_event_completion(p_hwfn, p_eqe))
 308                                 rc = -EINVAL;
 309                 } else if (qed_spq_completion(p_hwfn,
 310                                               p_eqe->echo,
 311                                               p_eqe->fw_return_code,
 312                                               &p_eqe->data)) {
 313                         rc = -EINVAL;
 314                 }
 315
 316                 qed_chain_recycle_consumed(p_chain);
 317         }
 318
 319         qed_eq_prod_update(p_hwfn, qed_chain_get_prod_idx(p_chain));
 320
 321         return rc;
 322 }
 323
 324 struct qed_eq *qed_eq_alloc(struct qed_hwfn *p_hwfn,
 325                             u16 num_elem)
 326 {
 327         struct qed_eq *p_eq;
 328
 329         /* Allocate EQ struct */
 330         p_eq = kzalloc(sizeof(*p_eq), GFP_ATOMIC);
 331         if (!p_eq) {
 332                 DP_NOTICE(p_hwfn, "Failed to allocate `struct qed_eq'\n");
 333                 return NULL;
 334         }
 335
 336         /* Allocate and initialize EQ chain*/
 337         if (qed_chain_alloc(p_hwfn->cdev,
 338                             QED_CHAIN_USE_TO_PRODUCE,
 339                             QED_CHAIN_MODE_PBL,
 340                             num_elem,
 341                             sizeof(union event_ring_element),
 342                             &p_eq->chain)) {
 343                 DP_NOTICE(p_hwfn, "Failed to allocate eq chain\n");
 344                 goto eq_allocate_fail;
 345         }
 346
 347         /* register EQ completion on the SP SB */
 348         qed_int_register_cb(p_hwfn,
 349                             qed_eq_completion,
 350                             p_eq,
 351                             &p_eq->eq_sb_index,
 352                             &p_eq->p_fw_cons);
 353
 354         return p_eq;
 355
 356 eq_allocate_fail:
 357         qed_eq_free(p_hwfn, p_eq);
 358         return NULL;
 359 }
 360
 361 void qed_eq_setup(struct qed_hwfn *p_hwfn,
 362                   struct qed_eq *p_eq)
 363 {
 364         qed_chain_reset(&p_eq->chain);
 365 }
 366
 367 void qed_eq_free(struct qed_hwfn *p_hwfn,
 368                  struct qed_eq *p_eq)
 369 {
 370         if (!p_eq)
 371                 return;
 372         qed_chain_free(p_hwfn->cdev, &p_eq->chain);
 373         kfree(p_eq);
 374 }
 375
 376 /***************************************************************************
 377 * Slow hwfn Queue (spq)
 378 ***************************************************************************/
 379 void qed_spq_setup(struct qed_hwfn *p_hwfn)
 380 {
 381         struct qed_spq          *p_spq  = p_hwfn->p_spq;
 382         struct qed_spq_entry    *p_virt = NULL;
 383         dma_addr_t              p_phys  = 0;
 384         unsigned int            i       = 0;
 385
 386         INIT_LIST_HEAD(&p_spq->pending);
 387         INIT_LIST_HEAD(&p_spq->completion_pending);
 388         INIT_LIST_HEAD(&p_spq->free_pool);
 389         INIT_LIST_HEAD(&p_spq->unlimited_pending);
 390         spin_lock_init(&p_spq->lock);
 391
 392         /* SPQ empty pool */
 393         p_phys  = p_spq->p_phys + offsetof(struct qed_spq_entry, ramrod);
 394         p_virt  = p_spq->p_virt;
 395
 396         for (i = 0; i < p_spq->chain.capacity; i++) {
 397                 p_virt->elem.data_ptr.hi = DMA_HI_LE(p_phys);
 398                 p_virt->elem.data_ptr.lo = DMA_LO_LE(p_phys);
 399
 400                 list_add_tail(&p_virt->list, &p_spq->free_pool);
 401
 402                 p_virt++;
 403                 p_phys += sizeof(struct qed_spq_entry);
 404         }
 405
 406         /* Statistics */
 407         p_spq->normal_count             = 0;
 408         p_spq->comp_count               = 0;
 409         p_spq->comp_sent_count          = 0;
 410         p_spq->unlimited_pending_count  = 0;
 411         p_spq->echo_idx                 = 0;
 412
 413         /* SPQ cid, cannot fail */
 414         qed_cxt_acquire_cid(p_hwfn, PROTOCOLID_CORE, &p_spq->cid);
 415         qed_spq_hw_initialize(p_hwfn, p_spq);
 416
 417         /* reset the chain itself */
 418         qed_chain_reset(&p_spq->chain);
 419 }
 420
 421 int qed_spq_alloc(struct qed_hwfn *p_hwfn)
 422 {
 423         struct qed_spq          *p_spq  = NULL;
 424         dma_addr_t              p_phys  = 0;
 425         struct qed_spq_entry    *p_virt = NULL;
 426
 427         /* SPQ struct */
 428         p_spq =
 429                 kzalloc(sizeof(struct qed_spq), GFP_ATOMIC);
 430         if (!p_spq) {
 431                 DP_NOTICE(p_hwfn, "Failed to allocate `struct qed_spq'\n");
 432                 return -ENOMEM;
 433         }
 434
 435         /* SPQ ring  */
 436         if (qed_chain_alloc(p_hwfn->cdev,
 437                             QED_CHAIN_USE_TO_PRODUCE,
 438                             QED_CHAIN_MODE_SINGLE,
 439                             0,   /* N/A when the mode is SINGLE */
 440                             sizeof(struct slow_path_element),
 441                             &p_spq->chain)) {
 442                 DP_NOTICE(p_hwfn, "Failed to allocate spq chain\n");
 443                 goto spq_allocate_fail;
 444         }
 445
 446         /* allocate and fill the SPQ elements (incl. ramrod data list) */
 447         p_virt = dma_alloc_coherent(&p_hwfn->cdev->pdev->dev,
 448                                     p_spq->chain.capacity *
 449                                     sizeof(struct qed_spq_entry),
 450                                     &p_phys,
 451                                     GFP_KERNEL);
 452
 453         if (!p_virt)
 454                 goto spq_allocate_fail;
 455
 456         p_spq->p_virt = p_virt;
 457         p_spq->p_phys = p_phys;
 458         p_hwfn->p_spq = p_spq;
 459
 460         return 0;
 461
 462 spq_allocate_fail:
 463         qed_chain_free(p_hwfn->cdev, &p_spq->chain);
 464         kfree(p_spq);
 465         return -ENOMEM;
 466 }
 467
 468 void qed_spq_free(struct qed_hwfn *p_hwfn)
 469 {
 470         struct qed_spq *p_spq = p_hwfn->p_spq;
 471
 472         if (!p_spq)
 473                 return;
 474
 475         if (p_spq->p_virt)
 476                 dma_free_coherent(&p_hwfn->cdev->pdev->dev,
 477                                   p_spq->chain.capacity *
 478                                   sizeof(struct qed_spq_entry),
 479                                   p_spq->p_virt,
 480                                   p_spq->p_phys);
 481
 482         qed_chain_free(p_hwfn->cdev, &p_spq->chain);
 483         ;
 484         kfree(p_spq);
 485 }
 486
 487 int
 488 qed_spq_get_entry(struct qed_hwfn *p_hwfn,
 489                   struct qed_spq_entry **pp_ent)
 490 {
 491         struct qed_spq *p_spq = p_hwfn->p_spq;
 492         struct qed_spq_entry *p_ent = NULL;
 493         int rc = 0;
 494
 495         spin_lock_bh(&p_spq->lock);
 496
 497         if (list_empty(&p_spq->free_pool)) {
 498                 p_ent = kzalloc(sizeof(*p_ent), GFP_ATOMIC);
 499                 if (!p_ent) {
 500                         rc = -ENOMEM;
 501                         goto out_unlock;
 502                 }
 503                 p_ent->queue = &p_spq->unlimited_pending;
 504         } else {
 505                 p_ent = list_first_entry(&p_spq->free_pool,
 506                                          struct qed_spq_entry,
 507                                          list);
 508                 list_del(&p_ent->list);
 509                 p_ent->queue = &p_spq->pending;
 510         }
 511
 512         *pp_ent = p_ent;
 513
 514 out_unlock:
 515         spin_unlock_bh(&p_spq->lock);
 516         return rc;
 517 }
 518
 519 /* Locked variant; Should be called while the SPQ lock is taken */
 520 static void __qed_spq_return_entry(struct qed_hwfn *p_hwfn,
 521                                    struct qed_spq_entry *p_ent)
 522 {
 523         list_add_tail(&p_ent->list, &p_hwfn->p_spq->free_pool);
 524 }
 525
 526 void qed_spq_return_entry(struct qed_hwfn *p_hwfn,
 527                           struct qed_spq_entry *p_ent)
 528 {
 529         spin_lock_bh(&p_hwfn->p_spq->lock);
 530         __qed_spq_return_entry(p_hwfn, p_ent);
 531         spin_unlock_bh(&p_hwfn->p_spq->lock);
 532 }
 533
 534 /**
 535  * @brief qed_spq_add_entry - adds a new entry to the pending
 536  *        list. Should be used while lock is being held.
 537  *
 538  * Addes an entry to the pending list is there is room (en empty
 539  * element is available in the free_pool), or else places the
 540  * entry in the unlimited_pending pool.
 541  *
 542  * @param p_hwfn
 543  * @param p_ent
 544  * @param priority
 545  *
 546  * @return int
 547  */
 548 static int
 549 qed_spq_add_entry(struct qed_hwfn *p_hwfn,
 550                   struct qed_spq_entry *p_ent,
 551                   enum spq_priority priority)
 552 {
 553         struct qed_spq *p_spq = p_hwfn->p_spq;
 554
 555         if (p_ent->queue == &p_spq->unlimited_pending) {
 556                 struct qed_spq_entry *p_en2;
 557
 558                 if (list_empty(&p_spq->free_pool)) {
 559                         list_add_tail(&p_ent->list, &p_spq->unlimited_pending);
 560                         p_spq->unlimited_pending_count++;
 561
 562                         return 0;
 563                 }
 564
 565                 p_en2 = list_first_entry(&p_spq->free_pool,
 566                                          struct qed_spq_entry,
 567                                          list);
 568                 list_del(&p_en2->list);
 569
 570                 /* Strcut assignment */
 571                 *p_en2 = *p_ent;
 572
 573                 kfree(p_ent);
 574
 575                 p_ent = p_en2;
 576         }
 577
 578         /* entry is to be placed in 'pending' queue */
 579         switch (priority) {
 580         case QED_SPQ_PRIORITY_NORMAL:
 581                 list_add_tail(&p_ent->list, &p_spq->pending);
 582                 p_spq->normal_count++;
 583                 break;
 584         case QED_SPQ_PRIORITY_HIGH:
 585                 list_add(&p_ent->list, &p_spq->pending);
 586                 p_spq->high_count++;
 587                 break;
 588         default:
 589                 return -EINVAL;
 590         }
 591
 592         return 0;
 593 }
 594
 595 /***************************************************************************
 596 * Accessor
 597 ***************************************************************************/
 598 u32 qed_spq_get_cid(struct qed_hwfn *p_hwfn)
 599 {
 600         if (!p_hwfn->p_spq)
 601                 return 0xffffffff;      /* illegal */
 602         return p_hwfn->p_spq->cid;
 603 }
 604
 605 /***************************************************************************
 606 * Posting new Ramrods
 607 ***************************************************************************/
 608 static int qed_spq_post_list(struct qed_hwfn *p_hwfn,
 609                              struct list_head *head,
 610                              u32 keep_reserve)
 611 {
 612         struct qed_spq *p_spq = p_hwfn->p_spq;
 613         int rc;
 614
 615         while (qed_chain_get_elem_left(&p_spq->chain) > keep_reserve &&
 616                !list_empty(head)) {
 617                 struct qed_spq_entry *p_ent =
 618                         list_first_entry(head, struct qed_spq_entry, list);
 619                 list_del(&p_ent->list);
 620                 list_add_tail(&p_ent->list, &p_spq->completion_pending);
 621                 p_spq->comp_sent_count++;
 622
 623                 rc = qed_spq_hw_post(p_hwfn, p_spq, p_ent);
 624                 if (rc) {
 625                         list_del(&p_ent->list);
 626                         __qed_spq_return_entry(p_hwfn, p_ent);
 627                         return rc;
 628                 }
 629         }
 630
 631         return 0;
 632 }
 633
 634 static int qed_spq_pend_post(struct qed_hwfn *p_hwfn)
 635 {
 636         struct qed_spq *p_spq = p_hwfn->p_spq;
 637         struct qed_spq_entry *p_ent = NULL;
 638
 639         while (!list_empty(&p_spq->free_pool)) {
 640                 if (list_empty(&p_spq->unlimited_pending))
 641                         break;
 642
 643                 p_ent = list_first_entry(&p_spq->unlimited_pending,
 644                                          struct qed_spq_entry,
 645                                          list);
 646                 if (!p_ent)
 647                         return -EINVAL;
 648
 649                 list_del(&p_ent->list);
 650
 651                 qed_spq_add_entry(p_hwfn, p_ent, p_ent->priority);
 652         }
 653
 654         return qed_spq_post_list(p_hwfn, &p_spq->pending,
 655                                  SPQ_HIGH_PRI_RESERVE_DEFAULT);
 656 }
 657
 658 int qed_spq_post(struct qed_hwfn *p_hwfn,
 659                  struct qed_spq_entry *p_ent,
 660                  u8 *fw_return_code)
 661 {
 662         int rc = 0;
 663         struct qed_spq *p_spq = p_hwfn ? p_hwfn->p_spq : NULL;
 664         bool b_ret_ent = true;
 665
 666         if (!p_hwfn)
 667                 return -EINVAL;
 668
 669         if (!p_ent) {
 670                 DP_NOTICE(p_hwfn, "Got a NULL pointer\n");
 671                 return -EINVAL;
 672         }
 673
 674         /* Complete the entry */
 675         rc = qed_spq_fill_entry(p_hwfn, p_ent);
 676
 677         spin_lock_bh(&p_spq->lock);
 678
 679         /* Check return value after LOCK is taken for cleaner error flow */
 680         if (rc)
 681                 goto spq_post_fail;
 682
 683         /* Add the request to the pending queue */
 684         rc = qed_spq_add_entry(p_hwfn, p_ent, p_ent->priority);
 685         if (rc)
 686                 goto spq_post_fail;
 687
 688         rc = qed_spq_pend_post(p_hwfn);
 689         if (rc) {
 690                 /* Since it's possible that pending failed for a different
 691                  * entry [although unlikely], the failed entry was already
 692                  * dealt with; No need to return it here.
 693                  */
 694                 b_ret_ent = false;
 695                 goto spq_post_fail;
 696         }
 697
 698         spin_unlock_bh(&p_spq->lock);
 699
 700         if (p_ent->comp_mode == QED_SPQ_MODE_EBLOCK) {
 701                 /* For entries in QED BLOCK mode, the completion code cannot
 702                  * perform the necessary cleanup - if it did, we couldn't
 703                  * access p_ent here to see whether it's successful or not.
 704                  * Thus, after gaining the answer perform the cleanup here.
 705                  */
 706                 rc = qed_spq_block(p_hwfn, p_ent, fw_return_code);
 707                 if (rc)
 708                         goto spq_post_fail2;
 709
 710                 /* return to pool */
 711                 qed_spq_return_entry(p_hwfn, p_ent);
 712         }
 713         return rc;
 714
 715 spq_post_fail2:
 716         spin_lock_bh(&p_spq->lock);
 717         list_del(&p_ent->list);
 718         qed_chain_return_produced(&p_spq->chain);
 719
 720 spq_post_fail:
 721         /* return to the free pool */
 722         if (b_ret_ent)
 723                 __qed_spq_return_entry(p_hwfn, p_ent);
 724         spin_unlock_bh(&p_spq->lock);
 725
 726         return rc;
 727 }
 728
 729 int qed_spq_completion(struct qed_hwfn *p_hwfn,
 730                        __le16 echo,
 731                        u8 fw_return_code,
 732                        union event_ring_data *p_data)
 733 {
 734         struct qed_spq          *p_spq;
 735         struct qed_spq_entry    *p_ent = NULL;
 736         struct qed_spq_entry    *tmp;
 737         struct qed_spq_entry    *found = NULL;
 738         int                     rc;
 739
 740         if (!p_hwfn)
 741                 return -EINVAL;
 742
 743         p_spq = p_hwfn->p_spq;
 744         if (!p_spq)
 745                 return -EINVAL;
 746
 747         spin_lock_bh(&p_spq->lock);
 748         list_for_each_entry_safe(p_ent, tmp, &p_spq->completion_pending,
 749                                  list) {
 750                 if (p_ent->elem.hdr.echo == echo) {
 751                         list_del(&p_ent->list);
 752
 753                         qed_chain_return_produced(&p_spq->chain);
 754                         p_spq->comp_count++;
 755                         found = p_ent;
 756                         break;
 757                 }
 758         }
 759
 760         /* Release lock before callback, as callback may post
 761          * an additional ramrod.
 762          */
 763         spin_unlock_bh(&p_spq->lock);
 764
 765         if (!found) {
 766                 DP_NOTICE(p_hwfn,
 767                           "Failed to find an entry this EQE completes\n");
 768                 return -EEXIST;
 769         }
 770
 771         DP_VERBOSE(p_hwfn, QED_MSG_SPQ, "Complete: func %p cookie %p)\n",
 772                    p_ent->comp_cb.function, p_ent->comp_cb.cookie);
 773         if (found->comp_cb.function)
 774                 found->comp_cb.function(p_hwfn, found->comp_cb.cookie, p_data,
 775                                         fw_return_code);
 776
 777         if (found->comp_mode != QED_SPQ_MODE_EBLOCK)
 778                 /* EBLOCK is responsible for freeing its own entry */
 779                 qed_spq_return_entry(p_hwfn, found);
 780
 781         /* Attempt to post pending requests */
 782         spin_lock_bh(&p_spq->lock);
 783         rc = qed_spq_pend_post(p_hwfn);
 784         spin_unlock_bh(&p_spq->lock);
 785
 786         return rc;
 787 }
 788
 789 struct qed_consq *qed_consq_alloc(struct qed_hwfn *p_hwfn)
 790 {
 791         struct qed_consq *p_consq;
 792
 793         /* Allocate ConsQ struct */
 794         p_consq = kzalloc(sizeof(*p_consq), GFP_ATOMIC);
 795         if (!p_consq) {
 796                 DP_NOTICE(p_hwfn, "Failed to allocate `struct qed_consq'\n");
 797                 return NULL;
 798         }
 799
 800         /* Allocate and initialize EQ chain*/
 801         if (qed_chain_alloc(p_hwfn->cdev,
 802                             QED_CHAIN_USE_TO_PRODUCE,
 803                             QED_CHAIN_MODE_PBL,
 804                             QED_CHAIN_PAGE_SIZE / 0x80,
 805                             0x80,
 806                             &p_consq->chain)) {
 807                 DP_NOTICE(p_hwfn, "Failed to allocate consq chain");
 808                 goto consq_allocate_fail;
 809         }
 810
 811         return p_consq;
 812
 813 consq_allocate_fail:
 814         qed_consq_free(p_hwfn, p_consq);
 815         return NULL;
 816 }
 817
 818 void qed_consq_setup(struct qed_hwfn *p_hwfn,
 819                      struct qed_consq *p_consq)
 820 {
 821         qed_chain_reset(&p_consq->chain);
 822 }
 823
 824 void qed_consq_free(struct qed_hwfn *p_hwfn,
 825                     struct qed_consq *p_consq)
 826 {
 827         if (!p_consq)
 828                 return;
 829         qed_chain_free(p_hwfn->cdev, &p_consq->chain);
 830         kfree(p_consq);
 831 }