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 (smp_load_acquire(&comp_done
->done
) == 1) { /* ^^^ */
102 *p_fw_ret
= comp_done
->fw_return_code
;
106 if (sleep_between_iter
)
107 msleep(SPQ_BLOCK_SLEEP_MS
);
109 udelay(SPQ_BLOCK_DELAY_US
);
115 static int qed_spq_block(struct qed_hwfn
*p_hwfn
,
116 struct qed_spq_entry
*p_ent
,
117 u8
*p_fw_ret
, bool skip_quick_poll
)
119 struct qed_spq_comp_done
*comp_done
;
120 struct qed_ptt
*p_ptt
;
123 /* A relatively short polling period w/o sleeping, to allow the FW to
124 * complete the ramrod and thus possibly to avoid the following sleeps.
126 if (!skip_quick_poll
) {
127 rc
= __qed_spq_block(p_hwfn
, p_ent
, p_fw_ret
, false);
132 /* Move to polling with a sleeping period between iterations */
133 rc
= __qed_spq_block(p_hwfn
, p_ent
, p_fw_ret
, true);
137 p_ptt
= qed_ptt_acquire(p_hwfn
);
139 DP_NOTICE(p_hwfn
, "ptt, failed to acquire\n");
143 DP_INFO(p_hwfn
, "Ramrod is stuck, requesting MCP drain\n");
144 rc
= qed_mcp_drain(p_hwfn
, p_ptt
);
145 qed_ptt_release(p_hwfn
, p_ptt
);
147 DP_NOTICE(p_hwfn
, "MCP drain failed\n");
151 /* Retry after drain */
152 rc
= __qed_spq_block(p_hwfn
, p_ent
, p_fw_ret
, true);
156 comp_done
= (struct qed_spq_comp_done
*)p_ent
->comp_cb
.cookie
;
157 if (comp_done
->done
== 1) {
159 *p_fw_ret
= comp_done
->fw_return_code
;
164 "Ramrod is stuck [CID %08x cmd %02x protocol %02x echo %04x]\n",
165 le32_to_cpu(p_ent
->elem
.hdr
.cid
),
166 p_ent
->elem
.hdr
.cmd_id
,
167 p_ent
->elem
.hdr
.protocol_id
,
168 le16_to_cpu(p_ent
->elem
.hdr
.echo
));
173 /***************************************************************************
174 * SPQ entries inner API
175 ***************************************************************************/
176 static int qed_spq_fill_entry(struct qed_hwfn
*p_hwfn
,
177 struct qed_spq_entry
*p_ent
)
181 switch (p_ent
->comp_mode
) {
182 case QED_SPQ_MODE_EBLOCK
:
183 case QED_SPQ_MODE_BLOCK
:
184 p_ent
->comp_cb
.function
= qed_spq_blocking_cb
;
186 case QED_SPQ_MODE_CB
:
189 DP_NOTICE(p_hwfn
, "Unknown SPQE completion mode %d\n",
194 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
,
195 "Ramrod header: [CID 0x%08x CMD 0x%02x protocol 0x%02x] Data pointer: [%08x:%08x] Completion Mode: %s\n",
197 p_ent
->elem
.hdr
.cmd_id
,
198 p_ent
->elem
.hdr
.protocol_id
,
199 p_ent
->elem
.data_ptr
.hi
,
200 p_ent
->elem
.data_ptr
.lo
,
201 D_TRINE(p_ent
->comp_mode
, QED_SPQ_MODE_EBLOCK
,
202 QED_SPQ_MODE_BLOCK
, "MODE_EBLOCK", "MODE_BLOCK",
208 /***************************************************************************
210 ***************************************************************************/
211 static void qed_spq_hw_initialize(struct qed_hwfn
*p_hwfn
,
212 struct qed_spq
*p_spq
)
214 struct e4_core_conn_context
*p_cxt
;
215 struct qed_cxt_info cxt_info
;
219 cxt_info
.iid
= p_spq
->cid
;
221 rc
= qed_cxt_get_cid_info(p_hwfn
, &cxt_info
);
224 DP_NOTICE(p_hwfn
, "Cannot find context info for cid=%d\n",
229 p_cxt
= cxt_info
.p_cxt
;
231 SET_FIELD(p_cxt
->xstorm_ag_context
.flags10
,
232 E4_XSTORM_CORE_CONN_AG_CTX_DQ_CF_EN
, 1);
233 SET_FIELD(p_cxt
->xstorm_ag_context
.flags1
,
234 E4_XSTORM_CORE_CONN_AG_CTX_DQ_CF_ACTIVE
, 1);
235 SET_FIELD(p_cxt
->xstorm_ag_context
.flags9
,
236 E4_XSTORM_CORE_CONN_AG_CTX_CONSOLID_PROD_CF_EN
, 1);
238 /* QM physical queue */
239 physical_q
= qed_get_cm_pq_idx(p_hwfn
, PQ_FLAGS_LB
);
240 p_cxt
->xstorm_ag_context
.physical_q0
= cpu_to_le16(physical_q
);
242 p_cxt
->xstorm_st_context
.spq_base_lo
=
243 DMA_LO_LE(p_spq
->chain
.p_phys_addr
);
244 p_cxt
->xstorm_st_context
.spq_base_hi
=
245 DMA_HI_LE(p_spq
->chain
.p_phys_addr
);
247 DMA_REGPAIR_LE(p_cxt
->xstorm_st_context
.consolid_base_addr
,
248 p_hwfn
->p_consq
->chain
.p_phys_addr
);
251 static int qed_spq_hw_post(struct qed_hwfn
*p_hwfn
,
252 struct qed_spq
*p_spq
, struct qed_spq_entry
*p_ent
)
254 struct qed_chain
*p_chain
= &p_hwfn
->p_spq
->chain
;
255 struct core_db_data
*p_db_data
= &p_spq
->db_data
;
256 u16 echo
= qed_chain_get_prod_idx(p_chain
);
257 struct slow_path_element
*elem
;
259 p_ent
->elem
.hdr
.echo
= cpu_to_le16(echo
);
260 elem
= qed_chain_produce(p_chain
);
262 DP_NOTICE(p_hwfn
, "Failed to produce from SPQ chain\n");
266 *elem
= p_ent
->elem
; /* struct assignment */
268 /* send a doorbell on the slow hwfn session */
269 p_db_data
->spq_prod
= cpu_to_le16(qed_chain_get_prod_idx(p_chain
));
271 /* make sure the SPQE is updated before the doorbell */
274 DOORBELL(p_hwfn
, p_spq
->db_addr_offset
, *(u32
*)p_db_data
);
276 /* make sure doorbell is rang */
279 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
,
280 "Doorbelled [0x%08x, CID 0x%08x] with Flags: %02x agg_params: %02x, prod: %04x\n",
281 p_spq
->db_addr_offset
,
284 p_db_data
->agg_flags
, qed_chain_get_prod_idx(p_chain
));
289 /***************************************************************************
290 * Asynchronous events
291 ***************************************************************************/
293 qed_async_event_completion(struct qed_hwfn
*p_hwfn
,
294 struct event_ring_entry
*p_eqe
)
296 qed_spq_async_comp_cb cb
;
298 if (!p_hwfn
->p_spq
|| (p_eqe
->protocol_id
>= MAX_PROTOCOL_TYPE
))
301 cb
= p_hwfn
->p_spq
->async_comp_cb
[p_eqe
->protocol_id
];
303 return cb(p_hwfn
, p_eqe
->opcode
, p_eqe
->echo
,
304 &p_eqe
->data
, p_eqe
->fw_return_code
);
307 "Unknown Async completion for protocol: %d\n",
314 qed_spq_register_async_cb(struct qed_hwfn
*p_hwfn
,
315 enum protocol_type protocol_id
,
316 qed_spq_async_comp_cb cb
)
318 if (!p_hwfn
->p_spq
|| (protocol_id
>= MAX_PROTOCOL_TYPE
))
321 p_hwfn
->p_spq
->async_comp_cb
[protocol_id
] = cb
;
326 qed_spq_unregister_async_cb(struct qed_hwfn
*p_hwfn
,
327 enum protocol_type protocol_id
)
329 if (!p_hwfn
->p_spq
|| (protocol_id
>= MAX_PROTOCOL_TYPE
))
332 p_hwfn
->p_spq
->async_comp_cb
[protocol_id
] = NULL
;
335 /***************************************************************************
337 ***************************************************************************/
338 void qed_eq_prod_update(struct qed_hwfn
*p_hwfn
, u16 prod
)
340 u32 addr
= GTT_BAR0_MAP_REG_USDM_RAM
+
341 USTORM_EQE_CONS_OFFSET(p_hwfn
->rel_pf_id
);
343 REG_WR16(p_hwfn
, addr
, prod
);
346 int qed_eq_completion(struct qed_hwfn
*p_hwfn
, void *cookie
)
348 struct qed_eq
*p_eq
= cookie
;
349 struct qed_chain
*p_chain
= &p_eq
->chain
;
352 /* take a snapshot of the FW consumer */
353 u16 fw_cons_idx
= le16_to_cpu(*p_eq
->p_fw_cons
);
355 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
, "fw_cons_idx %x\n", fw_cons_idx
);
357 /* Need to guarantee the fw_cons index we use points to a usuable
358 * element (to comply with our chain), so our macros would comply
360 if ((fw_cons_idx
& qed_chain_get_usable_per_page(p_chain
)) ==
361 qed_chain_get_usable_per_page(p_chain
))
362 fw_cons_idx
+= qed_chain_get_unusable_per_page(p_chain
);
364 /* Complete current segment of eq entries */
365 while (fw_cons_idx
!= qed_chain_get_cons_idx(p_chain
)) {
366 struct event_ring_entry
*p_eqe
= qed_chain_consume(p_chain
);
373 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
,
374 "op %x prot %x res0 %x echo %x fwret %x flags %x\n",
378 le16_to_cpu(p_eqe
->echo
),
379 p_eqe
->fw_return_code
,
382 if (GET_FIELD(p_eqe
->flags
, EVENT_RING_ENTRY_ASYNC
)) {
383 if (qed_async_event_completion(p_hwfn
, p_eqe
))
385 } else if (qed_spq_completion(p_hwfn
,
387 p_eqe
->fw_return_code
,
392 qed_chain_recycle_consumed(p_chain
);
395 qed_eq_prod_update(p_hwfn
, qed_chain_get_prod_idx(p_chain
));
397 /* Attempt to post pending requests */
398 spin_lock_bh(&p_hwfn
->p_spq
->lock
);
399 rc
= qed_spq_pend_post(p_hwfn
);
400 spin_unlock_bh(&p_hwfn
->p_spq
->lock
);
405 int qed_eq_alloc(struct qed_hwfn
*p_hwfn
, u16 num_elem
)
409 /* Allocate EQ struct */
410 p_eq
= kzalloc(sizeof(*p_eq
), GFP_KERNEL
);
414 /* Allocate and initialize EQ chain*/
415 if (qed_chain_alloc(p_hwfn
->cdev
,
416 QED_CHAIN_USE_TO_PRODUCE
,
418 QED_CHAIN_CNT_TYPE_U16
,
420 sizeof(union event_ring_element
),
422 goto eq_allocate_fail
;
424 /* register EQ completion on the SP SB */
425 qed_int_register_cb(p_hwfn
, qed_eq_completion
,
426 p_eq
, &p_eq
->eq_sb_index
, &p_eq
->p_fw_cons
);
436 void qed_eq_setup(struct qed_hwfn
*p_hwfn
)
438 qed_chain_reset(&p_hwfn
->p_eq
->chain
);
441 void qed_eq_free(struct qed_hwfn
*p_hwfn
)
446 qed_chain_free(p_hwfn
->cdev
, &p_hwfn
->p_eq
->chain
);
452 /***************************************************************************
453 * CQE API - manipulate EQ functionality
454 ***************************************************************************/
455 static int qed_cqe_completion(struct qed_hwfn
*p_hwfn
,
456 struct eth_slow_path_rx_cqe
*cqe
,
457 enum protocol_type protocol
)
459 if (IS_VF(p_hwfn
->cdev
))
462 /* @@@tmp - it's possible we'll eventually want to handle some
463 * actual commands that can arrive here, but for now this is only
464 * used to complete the ramrod using the echo value on the cqe
466 return qed_spq_completion(p_hwfn
, cqe
->echo
, 0, NULL
);
469 int qed_eth_cqe_completion(struct qed_hwfn
*p_hwfn
,
470 struct eth_slow_path_rx_cqe
*cqe
)
474 rc
= qed_cqe_completion(p_hwfn
, cqe
, PROTOCOLID_ETH
);
477 "Failed to handle RXQ CQE [cmd 0x%02x]\n",
483 /***************************************************************************
484 * Slow hwfn Queue (spq)
485 ***************************************************************************/
486 void qed_spq_setup(struct qed_hwfn
*p_hwfn
)
488 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
489 struct qed_spq_entry
*p_virt
= NULL
;
490 struct core_db_data
*p_db_data
;
491 void __iomem
*db_addr
;
492 dma_addr_t p_phys
= 0;
496 INIT_LIST_HEAD(&p_spq
->pending
);
497 INIT_LIST_HEAD(&p_spq
->completion_pending
);
498 INIT_LIST_HEAD(&p_spq
->free_pool
);
499 INIT_LIST_HEAD(&p_spq
->unlimited_pending
);
500 spin_lock_init(&p_spq
->lock
);
503 p_phys
= p_spq
->p_phys
+ offsetof(struct qed_spq_entry
, ramrod
);
504 p_virt
= p_spq
->p_virt
;
506 capacity
= qed_chain_get_capacity(&p_spq
->chain
);
507 for (i
= 0; i
< capacity
; i
++) {
508 DMA_REGPAIR_LE(p_virt
->elem
.data_ptr
, p_phys
);
510 list_add_tail(&p_virt
->list
, &p_spq
->free_pool
);
513 p_phys
+= sizeof(struct qed_spq_entry
);
517 p_spq
->normal_count
= 0;
518 p_spq
->comp_count
= 0;
519 p_spq
->comp_sent_count
= 0;
520 p_spq
->unlimited_pending_count
= 0;
522 bitmap_zero(p_spq
->p_comp_bitmap
, SPQ_RING_SIZE
);
523 p_spq
->comp_bitmap_idx
= 0;
525 /* SPQ cid, cannot fail */
526 qed_cxt_acquire_cid(p_hwfn
, PROTOCOLID_CORE
, &p_spq
->cid
);
527 qed_spq_hw_initialize(p_hwfn
, p_spq
);
529 /* reset the chain itself */
530 qed_chain_reset(&p_spq
->chain
);
532 /* Initialize the address/data of the SPQ doorbell */
533 p_spq
->db_addr_offset
= qed_db_addr(p_spq
->cid
, DQ_DEMS_LEGACY
);
534 p_db_data
= &p_spq
->db_data
;
535 memset(p_db_data
, 0, sizeof(*p_db_data
));
536 SET_FIELD(p_db_data
->params
, CORE_DB_DATA_DEST
, DB_DEST_XCM
);
537 SET_FIELD(p_db_data
->params
, CORE_DB_DATA_AGG_CMD
, DB_AGG_CMD_MAX
);
538 SET_FIELD(p_db_data
->params
, CORE_DB_DATA_AGG_VAL_SEL
,
539 DQ_XCM_CORE_SPQ_PROD_CMD
);
540 p_db_data
->agg_flags
= DQ_XCM_CORE_DQ_CF_CMD
;
542 /* Register the SPQ doorbell with the doorbell recovery mechanism */
543 db_addr
= (void __iomem
*)((u8 __iomem
*)p_hwfn
->doorbells
+
544 p_spq
->db_addr_offset
);
545 rc
= qed_db_recovery_add(p_hwfn
->cdev
, db_addr
, &p_spq
->db_data
,
546 DB_REC_WIDTH_32B
, DB_REC_KERNEL
);
549 "Failed to register the SPQ doorbell with the doorbell recovery mechanism\n");
552 int qed_spq_alloc(struct qed_hwfn
*p_hwfn
)
554 struct qed_spq_entry
*p_virt
= NULL
;
555 struct qed_spq
*p_spq
= NULL
;
556 dma_addr_t p_phys
= 0;
560 p_spq
= kzalloc(sizeof(struct qed_spq
), GFP_KERNEL
);
565 if (qed_chain_alloc(p_hwfn
->cdev
,
566 QED_CHAIN_USE_TO_PRODUCE
,
567 QED_CHAIN_MODE_SINGLE
,
568 QED_CHAIN_CNT_TYPE_U16
,
569 0, /* N/A when the mode is SINGLE */
570 sizeof(struct slow_path_element
),
571 &p_spq
->chain
, NULL
))
572 goto spq_allocate_fail
;
574 /* allocate and fill the SPQ elements (incl. ramrod data list) */
575 capacity
= qed_chain_get_capacity(&p_spq
->chain
);
576 p_virt
= dma_alloc_coherent(&p_hwfn
->cdev
->pdev
->dev
,
577 capacity
* sizeof(struct qed_spq_entry
),
578 &p_phys
, GFP_KERNEL
);
580 goto spq_allocate_fail
;
582 p_spq
->p_virt
= p_virt
;
583 p_spq
->p_phys
= p_phys
;
584 p_hwfn
->p_spq
= p_spq
;
589 qed_chain_free(p_hwfn
->cdev
, &p_spq
->chain
);
594 void qed_spq_free(struct qed_hwfn
*p_hwfn
)
596 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
597 void __iomem
*db_addr
;
603 /* Delete the SPQ doorbell from the doorbell recovery mechanism */
604 db_addr
= (void __iomem
*)((u8 __iomem
*)p_hwfn
->doorbells
+
605 p_spq
->db_addr_offset
);
606 qed_db_recovery_del(p_hwfn
->cdev
, db_addr
, &p_spq
->db_data
);
609 capacity
= qed_chain_get_capacity(&p_spq
->chain
);
610 dma_free_coherent(&p_hwfn
->cdev
->pdev
->dev
,
612 sizeof(struct qed_spq_entry
),
613 p_spq
->p_virt
, p_spq
->p_phys
);
616 qed_chain_free(p_hwfn
->cdev
, &p_spq
->chain
);
618 p_hwfn
->p_spq
= NULL
;
621 int qed_spq_get_entry(struct qed_hwfn
*p_hwfn
, struct qed_spq_entry
**pp_ent
)
623 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
624 struct qed_spq_entry
*p_ent
= NULL
;
627 spin_lock_bh(&p_spq
->lock
);
629 if (list_empty(&p_spq
->free_pool
)) {
630 p_ent
= kzalloc(sizeof(*p_ent
), GFP_ATOMIC
);
633 "Failed to allocate an SPQ entry for a pending ramrod\n");
637 p_ent
->queue
= &p_spq
->unlimited_pending
;
639 p_ent
= list_first_entry(&p_spq
->free_pool
,
640 struct qed_spq_entry
, list
);
641 list_del(&p_ent
->list
);
642 p_ent
->queue
= &p_spq
->pending
;
648 spin_unlock_bh(&p_spq
->lock
);
652 /* Locked variant; Should be called while the SPQ lock is taken */
653 static void __qed_spq_return_entry(struct qed_hwfn
*p_hwfn
,
654 struct qed_spq_entry
*p_ent
)
656 list_add_tail(&p_ent
->list
, &p_hwfn
->p_spq
->free_pool
);
659 void qed_spq_return_entry(struct qed_hwfn
*p_hwfn
, struct qed_spq_entry
*p_ent
)
661 spin_lock_bh(&p_hwfn
->p_spq
->lock
);
662 __qed_spq_return_entry(p_hwfn
, p_ent
);
663 spin_unlock_bh(&p_hwfn
->p_spq
->lock
);
667 * @brief qed_spq_add_entry - adds a new entry to the pending
668 * list. Should be used while lock is being held.
670 * Addes an entry to the pending list is there is room (en empty
671 * element is available in the free_pool), or else places the
672 * entry in the unlimited_pending pool.
680 static int qed_spq_add_entry(struct qed_hwfn
*p_hwfn
,
681 struct qed_spq_entry
*p_ent
,
682 enum spq_priority priority
)
684 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
686 if (p_ent
->queue
== &p_spq
->unlimited_pending
) {
688 if (list_empty(&p_spq
->free_pool
)) {
689 list_add_tail(&p_ent
->list
, &p_spq
->unlimited_pending
);
690 p_spq
->unlimited_pending_count
++;
694 struct qed_spq_entry
*p_en2
;
696 p_en2
= list_first_entry(&p_spq
->free_pool
,
697 struct qed_spq_entry
, list
);
698 list_del(&p_en2
->list
);
700 /* Copy the ring element physical pointer to the new
701 * entry, since we are about to override the entire ring
702 * entry and don't want to lose the pointer.
704 p_ent
->elem
.data_ptr
= p_en2
->elem
.data_ptr
;
708 /* EBLOCK responsible to free the allocated p_ent */
709 if (p_ent
->comp_mode
!= QED_SPQ_MODE_EBLOCK
)
712 p_ent
->post_ent
= p_en2
;
718 /* entry is to be placed in 'pending' queue */
720 case QED_SPQ_PRIORITY_NORMAL
:
721 list_add_tail(&p_ent
->list
, &p_spq
->pending
);
722 p_spq
->normal_count
++;
724 case QED_SPQ_PRIORITY_HIGH
:
725 list_add(&p_ent
->list
, &p_spq
->pending
);
735 /***************************************************************************
737 ***************************************************************************/
738 u32
qed_spq_get_cid(struct qed_hwfn
*p_hwfn
)
741 return 0xffffffff; /* illegal */
742 return p_hwfn
->p_spq
->cid
;
745 /***************************************************************************
746 * Posting new Ramrods
747 ***************************************************************************/
748 static int qed_spq_post_list(struct qed_hwfn
*p_hwfn
,
749 struct list_head
*head
, u32 keep_reserve
)
751 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
754 while (qed_chain_get_elem_left(&p_spq
->chain
) > keep_reserve
&&
756 struct qed_spq_entry
*p_ent
=
757 list_first_entry(head
, struct qed_spq_entry
, list
);
758 list_move_tail(&p_ent
->list
, &p_spq
->completion_pending
);
759 p_spq
->comp_sent_count
++;
761 rc
= qed_spq_hw_post(p_hwfn
, p_spq
, p_ent
);
763 list_del(&p_ent
->list
);
764 __qed_spq_return_entry(p_hwfn
, p_ent
);
772 int qed_spq_pend_post(struct qed_hwfn
*p_hwfn
)
774 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
775 struct qed_spq_entry
*p_ent
= NULL
;
777 while (!list_empty(&p_spq
->free_pool
)) {
778 if (list_empty(&p_spq
->unlimited_pending
))
781 p_ent
= list_first_entry(&p_spq
->unlimited_pending
,
782 struct qed_spq_entry
, list
);
786 list_del(&p_ent
->list
);
788 qed_spq_add_entry(p_hwfn
, p_ent
, p_ent
->priority
);
791 return qed_spq_post_list(p_hwfn
, &p_spq
->pending
,
792 SPQ_HIGH_PRI_RESERVE_DEFAULT
);
795 static void qed_spq_recov_set_ret_code(struct qed_spq_entry
*p_ent
,
801 if (p_ent
->elem
.hdr
.protocol_id
== PROTOCOLID_ROCE
||
802 p_ent
->elem
.hdr
.protocol_id
== PROTOCOLID_IWARP
)
803 *fw_return_code
= RDMA_RETURN_OK
;
806 /* Avoid overriding of SPQ entries when getting out-of-order completions, by
807 * marking the completions in a bitmap and increasing the chain consumer only
808 * for the first successive completed entries.
810 static void qed_spq_comp_bmap_update(struct qed_hwfn
*p_hwfn
, __le16 echo
)
812 u16 pos
= le16_to_cpu(echo
) % SPQ_RING_SIZE
;
813 struct qed_spq
*p_spq
= p_hwfn
->p_spq
;
815 __set_bit(pos
, p_spq
->p_comp_bitmap
);
816 while (test_bit(p_spq
->comp_bitmap_idx
,
817 p_spq
->p_comp_bitmap
)) {
818 __clear_bit(p_spq
->comp_bitmap_idx
,
819 p_spq
->p_comp_bitmap
);
820 p_spq
->comp_bitmap_idx
++;
821 qed_chain_return_produced(&p_spq
->chain
);
825 int qed_spq_post(struct qed_hwfn
*p_hwfn
,
826 struct qed_spq_entry
*p_ent
, u8
*fw_return_code
)
829 struct qed_spq
*p_spq
= p_hwfn
? p_hwfn
->p_spq
: NULL
;
830 bool b_ret_ent
= true;
837 DP_NOTICE(p_hwfn
, "Got a NULL pointer\n");
841 if (p_hwfn
->cdev
->recov_in_prog
) {
844 "Recovery is in progress. Skip spq post [cmd %02x protocol %02x]\n",
845 p_ent
->elem
.hdr
.cmd_id
, p_ent
->elem
.hdr
.protocol_id
);
847 /* Let the flow complete w/o any error handling */
848 qed_spq_recov_set_ret_code(p_ent
, fw_return_code
);
852 /* Complete the entry */
853 rc
= qed_spq_fill_entry(p_hwfn
, p_ent
);
855 spin_lock_bh(&p_spq
->lock
);
857 /* Check return value after LOCK is taken for cleaner error flow */
861 /* Check if entry is in block mode before qed_spq_add_entry,
862 * which might kfree p_ent.
864 eblock
= (p_ent
->comp_mode
== QED_SPQ_MODE_EBLOCK
);
866 /* Add the request to the pending queue */
867 rc
= qed_spq_add_entry(p_hwfn
, p_ent
, p_ent
->priority
);
871 rc
= qed_spq_pend_post(p_hwfn
);
873 /* Since it's possible that pending failed for a different
874 * entry [although unlikely], the failed entry was already
875 * dealt with; No need to return it here.
881 spin_unlock_bh(&p_spq
->lock
);
884 /* For entries in QED BLOCK mode, the completion code cannot
885 * perform the necessary cleanup - if it did, we couldn't
886 * access p_ent here to see whether it's successful or not.
887 * Thus, after gaining the answer perform the cleanup here.
889 rc
= qed_spq_block(p_hwfn
, p_ent
, fw_return_code
,
890 p_ent
->queue
== &p_spq
->unlimited_pending
);
892 if (p_ent
->queue
== &p_spq
->unlimited_pending
) {
893 struct qed_spq_entry
*p_post_ent
= p_ent
->post_ent
;
897 /* Return the entry which was actually posted */
905 qed_spq_return_entry(p_hwfn
, p_ent
);
910 spin_lock_bh(&p_spq
->lock
);
911 list_del(&p_ent
->list
);
912 qed_spq_comp_bmap_update(p_hwfn
, p_ent
->elem
.hdr
.echo
);
915 /* return to the free pool */
917 __qed_spq_return_entry(p_hwfn
, p_ent
);
918 spin_unlock_bh(&p_spq
->lock
);
923 int qed_spq_completion(struct qed_hwfn
*p_hwfn
,
926 union event_ring_data
*p_data
)
928 struct qed_spq
*p_spq
;
929 struct qed_spq_entry
*p_ent
= NULL
;
930 struct qed_spq_entry
*tmp
;
931 struct qed_spq_entry
*found
= NULL
;
936 p_spq
= p_hwfn
->p_spq
;
940 spin_lock_bh(&p_spq
->lock
);
941 list_for_each_entry_safe(p_ent
, tmp
, &p_spq
->completion_pending
, list
) {
942 if (p_ent
->elem
.hdr
.echo
== echo
) {
943 list_del(&p_ent
->list
);
944 qed_spq_comp_bmap_update(p_hwfn
, echo
);
950 /* This is relatively uncommon - depends on scenarios
951 * which have mutliple per-PF sent ramrods.
953 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
,
954 "Got completion for echo %04x - doesn't match echo %04x in completion pending list\n",
956 le16_to_cpu(p_ent
->elem
.hdr
.echo
));
959 /* Release lock before callback, as callback may post
960 * an additional ramrod.
962 spin_unlock_bh(&p_spq
->lock
);
966 "Failed to find an entry this EQE [echo %04x] completes\n",
971 DP_VERBOSE(p_hwfn
, QED_MSG_SPQ
,
972 "Complete EQE [echo %04x]: func %p cookie %p)\n",
974 p_ent
->comp_cb
.function
, p_ent
->comp_cb
.cookie
);
975 if (found
->comp_cb
.function
)
976 found
->comp_cb
.function(p_hwfn
, found
->comp_cb
.cookie
, p_data
,
981 "Got a completion without a callback function\n");
983 if (found
->comp_mode
!= QED_SPQ_MODE_EBLOCK
)
984 /* EBLOCK is responsible for returning its own entry into the
987 qed_spq_return_entry(p_hwfn
, found
);
992 int qed_consq_alloc(struct qed_hwfn
*p_hwfn
)
994 struct qed_consq
*p_consq
;
996 /* Allocate ConsQ struct */
997 p_consq
= kzalloc(sizeof(*p_consq
), GFP_KERNEL
);
1001 /* Allocate and initialize EQ chain*/
1002 if (qed_chain_alloc(p_hwfn
->cdev
,
1003 QED_CHAIN_USE_TO_PRODUCE
,
1005 QED_CHAIN_CNT_TYPE_U16
,
1006 QED_CHAIN_PAGE_SIZE
/ 0x80,
1007 0x80, &p_consq
->chain
, NULL
))
1008 goto consq_allocate_fail
;
1010 p_hwfn
->p_consq
= p_consq
;
1013 consq_allocate_fail
:
1018 void qed_consq_setup(struct qed_hwfn
*p_hwfn
)
1020 qed_chain_reset(&p_hwfn
->p_consq
->chain
);
1023 void qed_consq_free(struct qed_hwfn
*p_hwfn
)
1025 if (!p_hwfn
->p_consq
)
1028 qed_chain_free(p_hwfn
->cdev
, &p_hwfn
->p_consq
->chain
);
1030 kfree(p_hwfn
->p_consq
);
1031 p_hwfn
->p_consq
= NULL
;