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 <asm/byteorder.h>
36 #include <linux/delay.h>
37 #include <linux/dma-mapping.h>
38 #include <linux/errno.h>
39 #include <linux/kernel.h>
40 #include <linux/list.h>
41 #include <linux/pci.h>
42 #include <linux/slab.h>
43 #include <linux/spinlock.h>
44 #include <linux/string.h>
47 #include "qed_dev_api.h"
51 #include "qed_iscsi.h"
54 #include "qed_reg_addr.h"
56 #include "qed_sriov.h"
59 /***************************************************************************
60 * Structures & Definitions
61 ***************************************************************************/
63 #define SPQ_HIGH_PRI_RESERVE_DEFAULT (1)
65 #define SPQ_BLOCK_DELAY_MAX_ITER (10)
66 #define SPQ_BLOCK_DELAY_US (10)
67 #define SPQ_BLOCK_SLEEP_MAX_ITER (1000)
68 #define SPQ_BLOCK_SLEEP_MS (5)
70 /***************************************************************************
71 * Blocking Imp. (BLOCK/EBLOCK mode)
72 ***************************************************************************/
73 static void qed_spq_blocking_cb(struct qed_hwfn *p_hwfn,
75 union event_ring_data *data, u8 fw_return_code)
77 struct qed_spq_comp_done *comp_done;
79 comp_done = (struct qed_spq_comp_done *)cookie;
81 comp_done->fw_return_code = fw_return_code;
83 /* Make sure completion done is visible on waiting thread */
84 smp_store_release(&comp_done->done, 0x1);
87 static int __qed_spq_block(struct qed_hwfn *p_hwfn,
88 struct qed_spq_entry *p_ent,
89 u8 *p_fw_ret, bool sleep_between_iter)
91 struct qed_spq_comp_done *comp_done;
94 comp_done = (struct qed_spq_comp_done *)p_ent->comp_cb.cookie;
95 iter_cnt = sleep_between_iter ? SPQ_BLOCK_SLEEP_MAX_ITER
96 : SPQ_BLOCK_DELAY_MAX_ITER;
99 /* Validate we receive completion update */
100 if (READ_ONCE(comp_done->done) == 1) {
101 /* Read updated FW return value */
102 smp_read_barrier_depends();
104 *p_fw_ret = comp_done->fw_return_code;
108 if (sleep_between_iter)
109 msleep(SPQ_BLOCK_SLEEP_MS);
111 udelay(SPQ_BLOCK_DELAY_US);
117 static int qed_spq_block(struct qed_hwfn *p_hwfn,
118 struct qed_spq_entry *p_ent,
119 u8 *p_fw_ret, bool skip_quick_poll)
121 struct qed_spq_comp_done *comp_done;
122 struct qed_ptt *p_ptt;
125 /* A relatively short polling period w/o sleeping, to allow the FW to
126 * complete the ramrod and thus possibly to avoid the following sleeps.
128 if (!skip_quick_poll) {
129 rc = __qed_spq_block(p_hwfn, p_ent, p_fw_ret, false);
134 /* Move to polling with a sleeping period between iterations */
135 rc = __qed_spq_block(p_hwfn, p_ent, p_fw_ret, true);
139 p_ptt = qed_ptt_acquire(p_hwfn);
141 DP_NOTICE(p_hwfn, "ptt, failed to acquire\n");
145 DP_INFO(p_hwfn, "Ramrod is stuck, requesting MCP drain\n");
146 rc = qed_mcp_drain(p_hwfn, p_ptt);
148 DP_NOTICE(p_hwfn, "MCP drain failed\n");
152 /* Retry after drain */
153 rc = __qed_spq_block(p_hwfn, p_ent, p_fw_ret, true);
157 comp_done = (struct qed_spq_comp_done *)p_ent->comp_cb.cookie;
158 if (comp_done->done == 1)
160 *p_fw_ret = comp_done->fw_return_code;
162 qed_ptt_release(p_hwfn, p_ptt);
166 qed_ptt_release(p_hwfn, p_ptt);
168 "Ramrod is stuck [CID %08x cmd %02x protocol %02x echo %04x]\n",
169 le32_to_cpu(p_ent->elem.hdr.cid),
170 p_ent->elem.hdr.cmd_id,
171 p_ent->elem.hdr.protocol_id,
172 le16_to_cpu(p_ent->elem.hdr.echo));
177 /***************************************************************************
178 * SPQ entries inner API
179 ***************************************************************************/
180 static int qed_spq_fill_entry(struct qed_hwfn *p_hwfn,
181 struct qed_spq_entry *p_ent)
185 switch (p_ent->comp_mode) {
186 case QED_SPQ_MODE_EBLOCK:
187 case QED_SPQ_MODE_BLOCK:
188 p_ent->comp_cb.function = qed_spq_blocking_cb;
190 case QED_SPQ_MODE_CB:
193 DP_NOTICE(p_hwfn, "Unknown SPQE completion mode %d\n",
198 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
199 "Ramrod header: [CID 0x%08x CMD 0x%02x protocol 0x%02x] Data pointer: [%08x:%08x] Completion Mode: %s\n",
201 p_ent->elem.hdr.cmd_id,
202 p_ent->elem.hdr.protocol_id,
203 p_ent->elem.data_ptr.hi,
204 p_ent->elem.data_ptr.lo,
205 D_TRINE(p_ent->comp_mode, QED_SPQ_MODE_EBLOCK,
206 QED_SPQ_MODE_BLOCK, "MODE_EBLOCK", "MODE_BLOCK",
212 /***************************************************************************
214 ***************************************************************************/
215 static void qed_spq_hw_initialize(struct qed_hwfn *p_hwfn,
216 struct qed_spq *p_spq)
218 struct core_conn_context *p_cxt;
219 struct qed_cxt_info cxt_info;
223 cxt_info.iid = p_spq->cid;
225 rc = qed_cxt_get_cid_info(p_hwfn, &cxt_info);
228 DP_NOTICE(p_hwfn, "Cannot find context info for cid=%d\n",
233 p_cxt = cxt_info.p_cxt;
235 SET_FIELD(p_cxt->xstorm_ag_context.flags10,
236 XSTORM_CORE_CONN_AG_CTX_DQ_CF_EN, 1);
237 SET_FIELD(p_cxt->xstorm_ag_context.flags1,
238 XSTORM_CORE_CONN_AG_CTX_DQ_CF_ACTIVE, 1);
239 SET_FIELD(p_cxt->xstorm_ag_context.flags9,
240 XSTORM_CORE_CONN_AG_CTX_CONSOLID_PROD_CF_EN, 1);
242 /* QM physical queue */
243 physical_q = qed_get_cm_pq_idx(p_hwfn, PQ_FLAGS_LB);
244 p_cxt->xstorm_ag_context.physical_q0 = cpu_to_le16(physical_q);
246 p_cxt->xstorm_st_context.spq_base_lo =
247 DMA_LO_LE(p_spq->chain.p_phys_addr);
248 p_cxt->xstorm_st_context.spq_base_hi =
249 DMA_HI_LE(p_spq->chain.p_phys_addr);
251 DMA_REGPAIR_LE(p_cxt->xstorm_st_context.consolid_base_addr,
252 p_hwfn->p_consq->chain.p_phys_addr);
255 static int qed_spq_hw_post(struct qed_hwfn *p_hwfn,
256 struct qed_spq *p_spq, struct qed_spq_entry *p_ent)
258 struct qed_chain *p_chain = &p_hwfn->p_spq->chain;
259 u16 echo = qed_chain_get_prod_idx(p_chain);
260 struct slow_path_element *elem;
261 struct core_db_data db;
263 p_ent->elem.hdr.echo = cpu_to_le16(echo);
264 elem = qed_chain_produce(p_chain);
266 DP_NOTICE(p_hwfn, "Failed to produce from SPQ chain\n");
270 *elem = p_ent->elem; /* struct assignment */
272 /* send a doorbell on the slow hwfn session */
273 memset(&db, 0, sizeof(db));
274 SET_FIELD(db.params, CORE_DB_DATA_DEST, DB_DEST_XCM);
275 SET_FIELD(db.params, CORE_DB_DATA_AGG_CMD, DB_AGG_CMD_SET);
276 SET_FIELD(db.params, CORE_DB_DATA_AGG_VAL_SEL,
277 DQ_XCM_CORE_SPQ_PROD_CMD);
278 db.agg_flags = DQ_XCM_CORE_DQ_CF_CMD;
279 db.spq_prod = cpu_to_le16(qed_chain_get_prod_idx(p_chain));
281 /* make sure the SPQE is updated before the doorbell */
284 DOORBELL(p_hwfn, qed_db_addr(p_spq->cid, DQ_DEMS_LEGACY), *(u32 *)&db);
286 /* make sure doorbell is rang */
289 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
290 "Doorbelled [0x%08x, CID 0x%08x] with Flags: %02x agg_params: %02x, prod: %04x\n",
291 qed_db_addr(p_spq->cid, DQ_DEMS_LEGACY),
292 p_spq->cid, db.params, db.agg_flags,
293 qed_chain_get_prod_idx(p_chain));
298 /***************************************************************************
299 * Asynchronous events
300 ***************************************************************************/
302 qed_async_event_completion(struct qed_hwfn *p_hwfn,
303 struct event_ring_entry *p_eqe)
305 qed_spq_async_comp_cb cb;
307 if (!p_hwfn->p_spq || (p_eqe->protocol_id >= MAX_PROTOCOL_TYPE))
310 cb = p_hwfn->p_spq->async_comp_cb[p_eqe->protocol_id];
312 return cb(p_hwfn, p_eqe->opcode, p_eqe->echo,
313 &p_eqe->data, p_eqe->fw_return_code);
316 "Unknown Async completion for protocol: %d\n",
323 qed_spq_register_async_cb(struct qed_hwfn *p_hwfn,
324 enum protocol_type protocol_id,
325 qed_spq_async_comp_cb cb)
327 if (!p_hwfn->p_spq || (protocol_id >= MAX_PROTOCOL_TYPE))
330 p_hwfn->p_spq->async_comp_cb[protocol_id] = cb;
335 qed_spq_unregister_async_cb(struct qed_hwfn *p_hwfn,
336 enum protocol_type protocol_id)
338 if (!p_hwfn->p_spq || (protocol_id >= MAX_PROTOCOL_TYPE))
341 p_hwfn->p_spq->async_comp_cb[protocol_id] = NULL;
344 /***************************************************************************
346 ***************************************************************************/
347 void qed_eq_prod_update(struct qed_hwfn *p_hwfn, u16 prod)
349 u32 addr = GTT_BAR0_MAP_REG_USDM_RAM +
350 USTORM_EQE_CONS_OFFSET(p_hwfn->rel_pf_id);
352 REG_WR16(p_hwfn, addr, prod);
354 /* keep prod updates ordered */
358 int qed_eq_completion(struct qed_hwfn *p_hwfn, void *cookie)
360 struct qed_eq *p_eq = cookie;
361 struct qed_chain *p_chain = &p_eq->chain;
364 /* take a snapshot of the FW consumer */
365 u16 fw_cons_idx = le16_to_cpu(*p_eq->p_fw_cons);
367 DP_VERBOSE(p_hwfn, QED_MSG_SPQ, "fw_cons_idx %x\n", fw_cons_idx);
369 /* Need to guarantee the fw_cons index we use points to a usuable
370 * element (to comply with our chain), so our macros would comply
372 if ((fw_cons_idx & qed_chain_get_usable_per_page(p_chain)) ==
373 qed_chain_get_usable_per_page(p_chain))
374 fw_cons_idx += qed_chain_get_unusable_per_page(p_chain);
376 /* Complete current segment of eq entries */
377 while (fw_cons_idx != qed_chain_get_cons_idx(p_chain)) {
378 struct event_ring_entry *p_eqe = qed_chain_consume(p_chain);
385 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
386 "op %x prot %x res0 %x echo %x fwret %x flags %x\n",
390 le16_to_cpu(p_eqe->echo),
391 p_eqe->fw_return_code,
394 if (GET_FIELD(p_eqe->flags, EVENT_RING_ENTRY_ASYNC)) {
395 if (qed_async_event_completion(p_hwfn, p_eqe))
397 } else if (qed_spq_completion(p_hwfn,
399 p_eqe->fw_return_code,
404 qed_chain_recycle_consumed(p_chain);
407 qed_eq_prod_update(p_hwfn, qed_chain_get_prod_idx(p_chain));
412 int qed_eq_alloc(struct qed_hwfn *p_hwfn, u16 num_elem)
416 /* Allocate EQ struct */
417 p_eq = kzalloc(sizeof(*p_eq), GFP_KERNEL);
421 /* Allocate and initialize EQ chain*/
422 if (qed_chain_alloc(p_hwfn->cdev,
423 QED_CHAIN_USE_TO_PRODUCE,
425 QED_CHAIN_CNT_TYPE_U16,
427 sizeof(union event_ring_element),
429 goto eq_allocate_fail;
431 /* register EQ completion on the SP SB */
432 qed_int_register_cb(p_hwfn, qed_eq_completion,
433 p_eq, &p_eq->eq_sb_index, &p_eq->p_fw_cons);
443 void qed_eq_setup(struct qed_hwfn *p_hwfn)
445 qed_chain_reset(&p_hwfn->p_eq->chain);
448 void qed_eq_free(struct qed_hwfn *p_hwfn)
453 qed_chain_free(p_hwfn->cdev, &p_hwfn->p_eq->chain);
459 /***************************************************************************
460 * CQE API - manipulate EQ functionality
461 ***************************************************************************/
462 static int qed_cqe_completion(struct qed_hwfn *p_hwfn,
463 struct eth_slow_path_rx_cqe *cqe,
464 enum protocol_type protocol)
466 if (IS_VF(p_hwfn->cdev))
469 /* @@@tmp - it's possible we'll eventually want to handle some
470 * actual commands that can arrive here, but for now this is only
471 * used to complete the ramrod using the echo value on the cqe
473 return qed_spq_completion(p_hwfn, cqe->echo, 0, NULL);
476 int qed_eth_cqe_completion(struct qed_hwfn *p_hwfn,
477 struct eth_slow_path_rx_cqe *cqe)
481 rc = qed_cqe_completion(p_hwfn, cqe, PROTOCOLID_ETH);
484 "Failed to handle RXQ CQE [cmd 0x%02x]\n",
490 /***************************************************************************
491 * Slow hwfn Queue (spq)
492 ***************************************************************************/
493 void qed_spq_setup(struct qed_hwfn *p_hwfn)
495 struct qed_spq *p_spq = p_hwfn->p_spq;
496 struct qed_spq_entry *p_virt = NULL;
497 dma_addr_t p_phys = 0;
500 INIT_LIST_HEAD(&p_spq->pending);
501 INIT_LIST_HEAD(&p_spq->completion_pending);
502 INIT_LIST_HEAD(&p_spq->free_pool);
503 INIT_LIST_HEAD(&p_spq->unlimited_pending);
504 spin_lock_init(&p_spq->lock);
507 p_phys = p_spq->p_phys + offsetof(struct qed_spq_entry, ramrod);
508 p_virt = p_spq->p_virt;
510 capacity = qed_chain_get_capacity(&p_spq->chain);
511 for (i = 0; i < capacity; i++) {
512 DMA_REGPAIR_LE(p_virt->elem.data_ptr, p_phys);
514 list_add_tail(&p_virt->list, &p_spq->free_pool);
517 p_phys += sizeof(struct qed_spq_entry);
521 p_spq->normal_count = 0;
522 p_spq->comp_count = 0;
523 p_spq->comp_sent_count = 0;
524 p_spq->unlimited_pending_count = 0;
526 bitmap_zero(p_spq->p_comp_bitmap, SPQ_RING_SIZE);
527 p_spq->comp_bitmap_idx = 0;
529 /* SPQ cid, cannot fail */
530 qed_cxt_acquire_cid(p_hwfn, PROTOCOLID_CORE, &p_spq->cid);
531 qed_spq_hw_initialize(p_hwfn, p_spq);
533 /* reset the chain itself */
534 qed_chain_reset(&p_spq->chain);
537 int qed_spq_alloc(struct qed_hwfn *p_hwfn)
539 struct qed_spq_entry *p_virt = NULL;
540 struct qed_spq *p_spq = NULL;
541 dma_addr_t p_phys = 0;
545 p_spq = kzalloc(sizeof(struct qed_spq), GFP_KERNEL);
550 if (qed_chain_alloc(p_hwfn->cdev,
551 QED_CHAIN_USE_TO_PRODUCE,
552 QED_CHAIN_MODE_SINGLE,
553 QED_CHAIN_CNT_TYPE_U16,
554 0, /* N/A when the mode is SINGLE */
555 sizeof(struct slow_path_element),
556 &p_spq->chain, NULL))
557 goto spq_allocate_fail;
559 /* allocate and fill the SPQ elements (incl. ramrod data list) */
560 capacity = qed_chain_get_capacity(&p_spq->chain);
561 p_virt = dma_alloc_coherent(&p_hwfn->cdev->pdev->dev,
562 capacity * sizeof(struct qed_spq_entry),
563 &p_phys, GFP_KERNEL);
565 goto spq_allocate_fail;
567 p_spq->p_virt = p_virt;
568 p_spq->p_phys = p_phys;
569 p_hwfn->p_spq = p_spq;
574 qed_chain_free(p_hwfn->cdev, &p_spq->chain);
579 void qed_spq_free(struct qed_hwfn *p_hwfn)
581 struct qed_spq *p_spq = p_hwfn->p_spq;
588 capacity = qed_chain_get_capacity(&p_spq->chain);
589 dma_free_coherent(&p_hwfn->cdev->pdev->dev,
591 sizeof(struct qed_spq_entry),
592 p_spq->p_virt, p_spq->p_phys);
595 qed_chain_free(p_hwfn->cdev, &p_spq->chain);
597 p_hwfn->p_spq = NULL;
600 int qed_spq_get_entry(struct qed_hwfn *p_hwfn, struct qed_spq_entry **pp_ent)
602 struct qed_spq *p_spq = p_hwfn->p_spq;
603 struct qed_spq_entry *p_ent = NULL;
606 spin_lock_bh(&p_spq->lock);
608 if (list_empty(&p_spq->free_pool)) {
609 p_ent = kzalloc(sizeof(*p_ent), GFP_ATOMIC);
612 "Failed to allocate an SPQ entry for a pending ramrod\n");
616 p_ent->queue = &p_spq->unlimited_pending;
618 p_ent = list_first_entry(&p_spq->free_pool,
619 struct qed_spq_entry, list);
620 list_del(&p_ent->list);
621 p_ent->queue = &p_spq->pending;
627 spin_unlock_bh(&p_spq->lock);
631 /* Locked variant; Should be called while the SPQ lock is taken */
632 static void __qed_spq_return_entry(struct qed_hwfn *p_hwfn,
633 struct qed_spq_entry *p_ent)
635 list_add_tail(&p_ent->list, &p_hwfn->p_spq->free_pool);
638 void qed_spq_return_entry(struct qed_hwfn *p_hwfn, struct qed_spq_entry *p_ent)
640 spin_lock_bh(&p_hwfn->p_spq->lock);
641 __qed_spq_return_entry(p_hwfn, p_ent);
642 spin_unlock_bh(&p_hwfn->p_spq->lock);
646 * @brief qed_spq_add_entry - adds a new entry to the pending
647 * list. Should be used while lock is being held.
649 * Addes an entry to the pending list is there is room (en empty
650 * element is available in the free_pool), or else places the
651 * entry in the unlimited_pending pool.
659 static int qed_spq_add_entry(struct qed_hwfn *p_hwfn,
660 struct qed_spq_entry *p_ent,
661 enum spq_priority priority)
663 struct qed_spq *p_spq = p_hwfn->p_spq;
665 if (p_ent->queue == &p_spq->unlimited_pending) {
667 if (list_empty(&p_spq->free_pool)) {
668 list_add_tail(&p_ent->list, &p_spq->unlimited_pending);
669 p_spq->unlimited_pending_count++;
673 struct qed_spq_entry *p_en2;
675 p_en2 = list_first_entry(&p_spq->free_pool,
676 struct qed_spq_entry, list);
677 list_del(&p_en2->list);
679 /* Copy the ring element physical pointer to the new
680 * entry, since we are about to override the entire ring
681 * entry and don't want to lose the pointer.
683 p_ent->elem.data_ptr = p_en2->elem.data_ptr;
687 /* EBLOCK responsible to free the allocated p_ent */
688 if (p_ent->comp_mode != QED_SPQ_MODE_EBLOCK)
695 /* entry is to be placed in 'pending' queue */
697 case QED_SPQ_PRIORITY_NORMAL:
698 list_add_tail(&p_ent->list, &p_spq->pending);
699 p_spq->normal_count++;
701 case QED_SPQ_PRIORITY_HIGH:
702 list_add(&p_ent->list, &p_spq->pending);
712 /***************************************************************************
714 ***************************************************************************/
715 u32 qed_spq_get_cid(struct qed_hwfn *p_hwfn)
718 return 0xffffffff; /* illegal */
719 return p_hwfn->p_spq->cid;
722 /***************************************************************************
723 * Posting new Ramrods
724 ***************************************************************************/
725 static int qed_spq_post_list(struct qed_hwfn *p_hwfn,
726 struct list_head *head, u32 keep_reserve)
728 struct qed_spq *p_spq = p_hwfn->p_spq;
731 while (qed_chain_get_elem_left(&p_spq->chain) > keep_reserve &&
733 struct qed_spq_entry *p_ent =
734 list_first_entry(head, struct qed_spq_entry, list);
735 list_del(&p_ent->list);
736 list_add_tail(&p_ent->list, &p_spq->completion_pending);
737 p_spq->comp_sent_count++;
739 rc = qed_spq_hw_post(p_hwfn, p_spq, p_ent);
741 list_del(&p_ent->list);
742 __qed_spq_return_entry(p_hwfn, p_ent);
750 static int qed_spq_pend_post(struct qed_hwfn *p_hwfn)
752 struct qed_spq *p_spq = p_hwfn->p_spq;
753 struct qed_spq_entry *p_ent = NULL;
755 while (!list_empty(&p_spq->free_pool)) {
756 if (list_empty(&p_spq->unlimited_pending))
759 p_ent = list_first_entry(&p_spq->unlimited_pending,
760 struct qed_spq_entry, list);
764 list_del(&p_ent->list);
766 qed_spq_add_entry(p_hwfn, p_ent, p_ent->priority);
769 return qed_spq_post_list(p_hwfn, &p_spq->pending,
770 SPQ_HIGH_PRI_RESERVE_DEFAULT);
773 int qed_spq_post(struct qed_hwfn *p_hwfn,
774 struct qed_spq_entry *p_ent, u8 *fw_return_code)
777 struct qed_spq *p_spq = p_hwfn ? p_hwfn->p_spq : NULL;
778 bool b_ret_ent = true;
784 DP_NOTICE(p_hwfn, "Got a NULL pointer\n");
788 /* Complete the entry */
789 rc = qed_spq_fill_entry(p_hwfn, p_ent);
791 spin_lock_bh(&p_spq->lock);
793 /* Check return value after LOCK is taken for cleaner error flow */
797 /* Add the request to the pending queue */
798 rc = qed_spq_add_entry(p_hwfn, p_ent, p_ent->priority);
802 rc = qed_spq_pend_post(p_hwfn);
804 /* Since it's possible that pending failed for a different
805 * entry [although unlikely], the failed entry was already
806 * dealt with; No need to return it here.
812 spin_unlock_bh(&p_spq->lock);
814 if (p_ent->comp_mode == QED_SPQ_MODE_EBLOCK) {
815 /* For entries in QED BLOCK mode, the completion code cannot
816 * perform the necessary cleanup - if it did, we couldn't
817 * access p_ent here to see whether it's successful or not.
818 * Thus, after gaining the answer perform the cleanup here.
820 rc = qed_spq_block(p_hwfn, p_ent, fw_return_code,
821 p_ent->queue == &p_spq->unlimited_pending);
823 if (p_ent->queue == &p_spq->unlimited_pending) {
824 /* This is an allocated p_ent which does not need to
835 qed_spq_return_entry(p_hwfn, p_ent);
840 spin_lock_bh(&p_spq->lock);
841 list_del(&p_ent->list);
842 qed_chain_return_produced(&p_spq->chain);
845 /* return to the free pool */
847 __qed_spq_return_entry(p_hwfn, p_ent);
848 spin_unlock_bh(&p_spq->lock);
853 int qed_spq_completion(struct qed_hwfn *p_hwfn,
856 union event_ring_data *p_data)
858 struct qed_spq *p_spq;
859 struct qed_spq_entry *p_ent = NULL;
860 struct qed_spq_entry *tmp;
861 struct qed_spq_entry *found = NULL;
867 p_spq = p_hwfn->p_spq;
871 spin_lock_bh(&p_spq->lock);
872 list_for_each_entry_safe(p_ent, tmp, &p_spq->completion_pending, list) {
873 if (p_ent->elem.hdr.echo == echo) {
874 u16 pos = le16_to_cpu(echo) % SPQ_RING_SIZE;
876 list_del(&p_ent->list);
878 /* Avoid overriding of SPQ entries when getting
879 * out-of-order completions, by marking the completions
880 * in a bitmap and increasing the chain consumer only
881 * for the first successive completed entries.
883 __set_bit(pos, p_spq->p_comp_bitmap);
885 while (test_bit(p_spq->comp_bitmap_idx,
886 p_spq->p_comp_bitmap)) {
887 __clear_bit(p_spq->comp_bitmap_idx,
888 p_spq->p_comp_bitmap);
889 p_spq->comp_bitmap_idx++;
890 qed_chain_return_produced(&p_spq->chain);
898 /* This is relatively uncommon - depends on scenarios
899 * which have mutliple per-PF sent ramrods.
901 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
902 "Got completion for echo %04x - doesn't match echo %04x in completion pending list\n",
904 le16_to_cpu(p_ent->elem.hdr.echo));
907 /* Release lock before callback, as callback may post
908 * an additional ramrod.
910 spin_unlock_bh(&p_spq->lock);
914 "Failed to find an entry this EQE [echo %04x] completes\n",
919 DP_VERBOSE(p_hwfn, QED_MSG_SPQ,
920 "Complete EQE [echo %04x]: func %p cookie %p)\n",
922 p_ent->comp_cb.function, p_ent->comp_cb.cookie);
923 if (found->comp_cb.function)
924 found->comp_cb.function(p_hwfn, found->comp_cb.cookie, p_data,
929 "Got a completion without a callback function\n");
931 if ((found->comp_mode != QED_SPQ_MODE_EBLOCK) ||
932 (found->queue == &p_spq->unlimited_pending))
933 /* EBLOCK is responsible for returning its own entry into the
934 * free list, unless it originally added the entry into the
935 * unlimited pending list.
937 qed_spq_return_entry(p_hwfn, found);
939 /* Attempt to post pending requests */
940 spin_lock_bh(&p_spq->lock);
941 rc = qed_spq_pend_post(p_hwfn);
942 spin_unlock_bh(&p_spq->lock);
947 int qed_consq_alloc(struct qed_hwfn *p_hwfn)
949 struct qed_consq *p_consq;
951 /* Allocate ConsQ struct */
952 p_consq = kzalloc(sizeof(*p_consq), GFP_KERNEL);
956 /* Allocate and initialize EQ chain*/
957 if (qed_chain_alloc(p_hwfn->cdev,
958 QED_CHAIN_USE_TO_PRODUCE,
960 QED_CHAIN_CNT_TYPE_U16,
961 QED_CHAIN_PAGE_SIZE / 0x80,
962 0x80, &p_consq->chain, NULL))
963 goto consq_allocate_fail;
965 p_hwfn->p_consq = p_consq;
973 void qed_consq_setup(struct qed_hwfn *p_hwfn)
975 qed_chain_reset(&p_hwfn->p_consq->chain);
978 void qed_consq_free(struct qed_hwfn *p_hwfn)
980 if (!p_hwfn->p_consq)
983 qed_chain_free(p_hwfn->cdev, &p_hwfn->p_consq->chain);
985 kfree(p_hwfn->p_consq);
986 p_hwfn->p_consq = NULL;