2 * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
3 * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
4 * Copyright (c) 2005, 2006 Cisco Systems, Inc. All rights reserved.
5 * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
6 * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
8 * This software is available to you under a choice of one of two
9 * licenses. You may choose to be licensed under the terms of the GNU
10 * General Public License (GPL) Version 2, available from the file
11 * COPYING in the main directory of this source tree, or the
12 * OpenIB.org BSD license below:
14 * Redistribution and use in source and binary forms, with or
15 * without modification, are permitted provided that the following
18 * - Redistributions of source code must retain the above
19 * copyright notice, this list of conditions and the following
22 * - Redistributions in binary form must reproduce the above
23 * copyright notice, this list of conditions and the following
24 * disclaimer in the documentation and/or other materials
25 * provided with the distribution.
27 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
28 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
29 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
30 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
31 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
32 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
33 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
36 * $Id: mthca_cq.c 1369 2004-12-20 16:17:07Z roland $
39 #include <linux/hardirq.h>
43 #include <rdma/ib_pack.h>
45 #include "mthca_dev.h"
46 #include "mthca_cmd.h"
47 #include "mthca_memfree.h"
50 MTHCA_MAX_DIRECT_CQ_SIZE = 4 * PAGE_SIZE
54 MTHCA_CQ_ENTRY_SIZE = 0x20
58 * Must be packed because start is 64 bits but only aligned to 32 bits.
60 struct mthca_cq_context {
63 __be32 logsize_usrpage;
64 __be32 error_eqn; /* Tavor only */
68 __be32 last_notified_index;
69 __be32 solicit_producer_index;
70 __be32 consumer_index;
71 __be32 producer_index;
73 __be32 ci_db; /* Arbel only */
74 __be32 state_db; /* Arbel only */
76 } __attribute__((packed));
78 #define MTHCA_CQ_STATUS_OK ( 0 << 28)
79 #define MTHCA_CQ_STATUS_OVERFLOW ( 9 << 28)
80 #define MTHCA_CQ_STATUS_WRITE_FAIL (10 << 28)
81 #define MTHCA_CQ_FLAG_TR ( 1 << 18)
82 #define MTHCA_CQ_FLAG_OI ( 1 << 17)
83 #define MTHCA_CQ_STATE_DISARMED ( 0 << 8)
84 #define MTHCA_CQ_STATE_ARMED ( 1 << 8)
85 #define MTHCA_CQ_STATE_ARMED_SOL ( 4 << 8)
86 #define MTHCA_EQ_STATE_FIRED (10 << 8)
89 MTHCA_ERROR_CQE_OPCODE_MASK = 0xfe
93 SYNDROME_LOCAL_LENGTH_ERR = 0x01,
94 SYNDROME_LOCAL_QP_OP_ERR = 0x02,
95 SYNDROME_LOCAL_EEC_OP_ERR = 0x03,
96 SYNDROME_LOCAL_PROT_ERR = 0x04,
97 SYNDROME_WR_FLUSH_ERR = 0x05,
98 SYNDROME_MW_BIND_ERR = 0x06,
99 SYNDROME_BAD_RESP_ERR = 0x10,
100 SYNDROME_LOCAL_ACCESS_ERR = 0x11,
101 SYNDROME_REMOTE_INVAL_REQ_ERR = 0x12,
102 SYNDROME_REMOTE_ACCESS_ERR = 0x13,
103 SYNDROME_REMOTE_OP_ERR = 0x14,
104 SYNDROME_RETRY_EXC_ERR = 0x15,
105 SYNDROME_RNR_RETRY_EXC_ERR = 0x16,
106 SYNDROME_LOCAL_RDD_VIOL_ERR = 0x20,
107 SYNDROME_REMOTE_INVAL_RD_REQ_ERR = 0x21,
108 SYNDROME_REMOTE_ABORTED_ERR = 0x22,
109 SYNDROME_INVAL_EECN_ERR = 0x23,
110 SYNDROME_INVAL_EEC_STATE_ERR = 0x24
119 __be32 imm_etype_pkey_eec;
128 struct mthca_err_cqe {
141 #define MTHCA_CQ_ENTRY_OWNER_SW (0 << 7)
142 #define MTHCA_CQ_ENTRY_OWNER_HW (1 << 7)
144 #define MTHCA_TAVOR_CQ_DB_INC_CI (1 << 24)
145 #define MTHCA_TAVOR_CQ_DB_REQ_NOT (2 << 24)
146 #define MTHCA_TAVOR_CQ_DB_REQ_NOT_SOL (3 << 24)
147 #define MTHCA_TAVOR_CQ_DB_SET_CI (4 << 24)
148 #define MTHCA_TAVOR_CQ_DB_REQ_NOT_MULT (5 << 24)
150 #define MTHCA_ARBEL_CQ_DB_REQ_NOT_SOL (1 << 24)
151 #define MTHCA_ARBEL_CQ_DB_REQ_NOT (2 << 24)
152 #define MTHCA_ARBEL_CQ_DB_REQ_NOT_MULT (3 << 24)
154 static inline struct mthca_cqe *get_cqe_from_buf(struct mthca_cq_buf *buf,
158 return buf->queue.direct.buf + (entry * MTHCA_CQ_ENTRY_SIZE);
160 return buf->queue.page_list[entry * MTHCA_CQ_ENTRY_SIZE / PAGE_SIZE].buf
161 + (entry * MTHCA_CQ_ENTRY_SIZE) % PAGE_SIZE;
164 static inline struct mthca_cqe *get_cqe(struct mthca_cq *cq, int entry)
166 return get_cqe_from_buf(&cq->buf, entry);
169 static inline struct mthca_cqe *cqe_sw(struct mthca_cqe *cqe)
171 return MTHCA_CQ_ENTRY_OWNER_HW & cqe->owner ? NULL : cqe;
174 static inline struct mthca_cqe *next_cqe_sw(struct mthca_cq *cq)
176 return cqe_sw(get_cqe(cq, cq->cons_index & cq->ibcq.cqe));
179 static inline void set_cqe_hw(struct mthca_cqe *cqe)
181 cqe->owner = MTHCA_CQ_ENTRY_OWNER_HW;
184 static void dump_cqe(struct mthca_dev *dev, void *cqe_ptr)
186 __be32 *cqe = cqe_ptr;
188 (void) cqe; /* avoid warning if mthca_dbg compiled away... */
189 mthca_dbg(dev, "CQE contents %08x %08x %08x %08x %08x %08x %08x %08x\n",
190 be32_to_cpu(cqe[0]), be32_to_cpu(cqe[1]), be32_to_cpu(cqe[2]),
191 be32_to_cpu(cqe[3]), be32_to_cpu(cqe[4]), be32_to_cpu(cqe[5]),
192 be32_to_cpu(cqe[6]), be32_to_cpu(cqe[7]));
196 * incr is ignored in native Arbel (mem-free) mode, so cq->cons_index
197 * should be correct before calling update_cons_index().
199 static inline void update_cons_index(struct mthca_dev *dev, struct mthca_cq *cq,
204 if (mthca_is_memfree(dev)) {
205 *cq->set_ci_db = cpu_to_be32(cq->cons_index);
208 doorbell[0] = cpu_to_be32(MTHCA_TAVOR_CQ_DB_INC_CI | cq->cqn);
209 doorbell[1] = cpu_to_be32(incr - 1);
211 mthca_write64(doorbell,
212 dev->kar + MTHCA_CQ_DOORBELL,
213 MTHCA_GET_DOORBELL_LOCK(&dev->doorbell_lock));
215 * Make sure doorbells don't leak out of CQ spinlock
216 * and reach the HCA out of order:
222 void mthca_cq_completion(struct mthca_dev *dev, u32 cqn)
226 cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
229 mthca_warn(dev, "Completion event for bogus CQ %08x\n", cqn);
235 cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
238 void mthca_cq_event(struct mthca_dev *dev, u32 cqn,
239 enum ib_event_type event_type)
242 struct ib_event event;
244 spin_lock(&dev->cq_table.lock);
246 cq = mthca_array_get(&dev->cq_table.cq, cqn & (dev->limits.num_cqs - 1));
250 spin_unlock(&dev->cq_table.lock);
253 mthca_warn(dev, "Async event for bogus CQ %08x\n", cqn);
257 event.device = &dev->ib_dev;
258 event.event = event_type;
259 event.element.cq = &cq->ibcq;
260 if (cq->ibcq.event_handler)
261 cq->ibcq.event_handler(&event, cq->ibcq.cq_context);
263 spin_lock(&dev->cq_table.lock);
266 spin_unlock(&dev->cq_table.lock);
269 static inline int is_recv_cqe(struct mthca_cqe *cqe)
271 if ((cqe->opcode & MTHCA_ERROR_CQE_OPCODE_MASK) ==
272 MTHCA_ERROR_CQE_OPCODE_MASK)
273 return !(cqe->opcode & 0x01);
275 return !(cqe->is_send & 0x80);
278 void mthca_cq_clean(struct mthca_dev *dev, struct mthca_cq *cq, u32 qpn,
279 struct mthca_srq *srq)
281 struct mthca_cqe *cqe;
285 spin_lock_irq(&cq->lock);
288 * First we need to find the current producer index, so we
289 * know where to start cleaning from. It doesn't matter if HW
290 * adds new entries after this loop -- the QP we're worried
291 * about is already in RESET, so the new entries won't come
292 * from our QP and therefore don't need to be checked.
294 for (prod_index = cq->cons_index;
295 cqe_sw(get_cqe(cq, prod_index & cq->ibcq.cqe));
297 if (prod_index == cq->cons_index + cq->ibcq.cqe)
301 mthca_dbg(dev, "Cleaning QPN %06x from CQN %06x; ci %d, pi %d\n",
302 qpn, cq->cqn, cq->cons_index, prod_index);
305 * Now sweep backwards through the CQ, removing CQ entries
306 * that match our QP by copying older entries on top of them.
308 while ((int) --prod_index - (int) cq->cons_index >= 0) {
309 cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
310 if (cqe->my_qpn == cpu_to_be32(qpn)) {
311 if (srq && is_recv_cqe(cqe))
312 mthca_free_srq_wqe(srq, be32_to_cpu(cqe->wqe));
315 memcpy(get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe),
316 cqe, MTHCA_CQ_ENTRY_SIZE);
321 cq->cons_index += nfreed;
322 update_cons_index(dev, cq, nfreed);
325 spin_unlock_irq(&cq->lock);
328 void mthca_cq_resize_copy_cqes(struct mthca_cq *cq)
333 * In Tavor mode, the hardware keeps the consumer and producer
334 * indices mod the CQ size. Since we might be making the CQ
335 * bigger, we need to deal with the case where the producer
336 * index wrapped around before the CQ was resized.
338 if (!mthca_is_memfree(to_mdev(cq->ibcq.device)) &&
339 cq->ibcq.cqe < cq->resize_buf->cqe) {
340 cq->cons_index &= cq->ibcq.cqe;
341 if (cqe_sw(get_cqe(cq, cq->ibcq.cqe)))
342 cq->cons_index -= cq->ibcq.cqe + 1;
345 for (i = cq->cons_index; cqe_sw(get_cqe(cq, i & cq->ibcq.cqe)); ++i)
346 memcpy(get_cqe_from_buf(&cq->resize_buf->buf,
347 i & cq->resize_buf->cqe),
348 get_cqe(cq, i & cq->ibcq.cqe), MTHCA_CQ_ENTRY_SIZE);
351 int mthca_alloc_cq_buf(struct mthca_dev *dev, struct mthca_cq_buf *buf, int nent)
356 ret = mthca_buf_alloc(dev, nent * MTHCA_CQ_ENTRY_SIZE,
357 MTHCA_MAX_DIRECT_CQ_SIZE,
358 &buf->queue, &buf->is_direct,
359 &dev->driver_pd, 1, &buf->mr);
363 for (i = 0; i < nent; ++i)
364 set_cqe_hw(get_cqe_from_buf(buf, i));
369 void mthca_free_cq_buf(struct mthca_dev *dev, struct mthca_cq_buf *buf, int cqe)
371 mthca_buf_free(dev, (cqe + 1) * MTHCA_CQ_ENTRY_SIZE, &buf->queue,
372 buf->is_direct, &buf->mr);
375 static void handle_error_cqe(struct mthca_dev *dev, struct mthca_cq *cq,
376 struct mthca_qp *qp, int wqe_index, int is_send,
377 struct mthca_err_cqe *cqe,
378 struct ib_wc *entry, int *free_cqe)
383 if (cqe->syndrome == SYNDROME_LOCAL_QP_OP_ERR) {
384 mthca_dbg(dev, "local QP operation err "
385 "(QPN %06x, WQE @ %08x, CQN %06x, index %d)\n",
386 be32_to_cpu(cqe->my_qpn), be32_to_cpu(cqe->wqe),
387 cq->cqn, cq->cons_index);
392 * For completions in error, only work request ID, status, vendor error
393 * (and freed resource count for RD) have to be set.
395 switch (cqe->syndrome) {
396 case SYNDROME_LOCAL_LENGTH_ERR:
397 entry->status = IB_WC_LOC_LEN_ERR;
399 case SYNDROME_LOCAL_QP_OP_ERR:
400 entry->status = IB_WC_LOC_QP_OP_ERR;
402 case SYNDROME_LOCAL_EEC_OP_ERR:
403 entry->status = IB_WC_LOC_EEC_OP_ERR;
405 case SYNDROME_LOCAL_PROT_ERR:
406 entry->status = IB_WC_LOC_PROT_ERR;
408 case SYNDROME_WR_FLUSH_ERR:
409 entry->status = IB_WC_WR_FLUSH_ERR;
411 case SYNDROME_MW_BIND_ERR:
412 entry->status = IB_WC_MW_BIND_ERR;
414 case SYNDROME_BAD_RESP_ERR:
415 entry->status = IB_WC_BAD_RESP_ERR;
417 case SYNDROME_LOCAL_ACCESS_ERR:
418 entry->status = IB_WC_LOC_ACCESS_ERR;
420 case SYNDROME_REMOTE_INVAL_REQ_ERR:
421 entry->status = IB_WC_REM_INV_REQ_ERR;
423 case SYNDROME_REMOTE_ACCESS_ERR:
424 entry->status = IB_WC_REM_ACCESS_ERR;
426 case SYNDROME_REMOTE_OP_ERR:
427 entry->status = IB_WC_REM_OP_ERR;
429 case SYNDROME_RETRY_EXC_ERR:
430 entry->status = IB_WC_RETRY_EXC_ERR;
432 case SYNDROME_RNR_RETRY_EXC_ERR:
433 entry->status = IB_WC_RNR_RETRY_EXC_ERR;
435 case SYNDROME_LOCAL_RDD_VIOL_ERR:
436 entry->status = IB_WC_LOC_RDD_VIOL_ERR;
438 case SYNDROME_REMOTE_INVAL_RD_REQ_ERR:
439 entry->status = IB_WC_REM_INV_RD_REQ_ERR;
441 case SYNDROME_REMOTE_ABORTED_ERR:
442 entry->status = IB_WC_REM_ABORT_ERR;
444 case SYNDROME_INVAL_EECN_ERR:
445 entry->status = IB_WC_INV_EECN_ERR;
447 case SYNDROME_INVAL_EEC_STATE_ERR:
448 entry->status = IB_WC_INV_EEC_STATE_ERR;
451 entry->status = IB_WC_GENERAL_ERR;
455 entry->vendor_err = cqe->vendor_err;
458 * Mem-free HCAs always generate one CQE per WQE, even in the
459 * error case, so we don't have to check the doorbell count, etc.
461 if (mthca_is_memfree(dev))
464 mthca_free_err_wqe(dev, qp, is_send, wqe_index, &dbd, &new_wqe);
467 * If we're at the end of the WQE chain, or we've used up our
468 * doorbell count, free the CQE. Otherwise just update it for
469 * the next poll operation.
471 if (!(new_wqe & cpu_to_be32(0x3f)) || (!cqe->db_cnt && dbd))
474 cqe->db_cnt = cpu_to_be16(be16_to_cpu(cqe->db_cnt) - dbd);
476 cqe->syndrome = SYNDROME_WR_FLUSH_ERR;
481 static inline int mthca_poll_one(struct mthca_dev *dev,
483 struct mthca_qp **cur_qp,
488 struct mthca_cqe *cqe;
495 cqe = next_cqe_sw(cq);
500 * Make sure we read CQ entry contents after we've checked the
506 mthca_dbg(dev, "%x/%d: CQE -> QPN %06x, WQE @ %08x\n",
507 cq->cqn, cq->cons_index, be32_to_cpu(cqe->my_qpn),
508 be32_to_cpu(cqe->wqe));
512 is_error = (cqe->opcode & MTHCA_ERROR_CQE_OPCODE_MASK) ==
513 MTHCA_ERROR_CQE_OPCODE_MASK;
514 is_send = is_error ? cqe->opcode & 0x01 : cqe->is_send & 0x80;
516 if (!*cur_qp || be32_to_cpu(cqe->my_qpn) != (*cur_qp)->qpn) {
518 * We do not have to take the QP table lock here,
519 * because CQs will be locked while QPs are removed
522 *cur_qp = mthca_array_get(&dev->qp_table.qp,
523 be32_to_cpu(cqe->my_qpn) &
524 (dev->limits.num_qps - 1));
526 mthca_warn(dev, "CQ entry for unknown QP %06x\n",
527 be32_to_cpu(cqe->my_qpn) & 0xffffff);
533 entry->qp_num = (*cur_qp)->qpn;
537 wqe_index = ((be32_to_cpu(cqe->wqe) - (*cur_qp)->send_wqe_offset)
539 entry->wr_id = (*cur_qp)->wrid[wqe_index +
541 } else if ((*cur_qp)->ibqp.srq) {
542 struct mthca_srq *srq = to_msrq((*cur_qp)->ibqp.srq);
543 u32 wqe = be32_to_cpu(cqe->wqe);
545 wqe_index = wqe >> srq->wqe_shift;
546 entry->wr_id = srq->wrid[wqe_index];
547 mthca_free_srq_wqe(srq, wqe);
551 wqe = be32_to_cpu(cqe->wqe);
552 wqe_index = wqe >> wq->wqe_shift;
554 * WQE addr == base - 1 might be reported in receive completion
555 * with error instead of (rq size - 1) by Sinai FW 1.0.800 and
556 * Arbel FW 5.1.400. This bug should be fixed in later FW revs.
558 if (unlikely(wqe_index < 0))
559 wqe_index = wq->max - 1;
560 entry->wr_id = (*cur_qp)->wrid[wqe_index];
564 if (wq->last_comp < wqe_index)
565 wq->tail += wqe_index - wq->last_comp;
567 wq->tail += wqe_index + wq->max - wq->last_comp;
569 wq->last_comp = wqe_index;
573 handle_error_cqe(dev, cq, *cur_qp, wqe_index, is_send,
574 (struct mthca_err_cqe *) cqe,
581 switch (cqe->opcode) {
582 case MTHCA_OPCODE_RDMA_WRITE:
583 entry->opcode = IB_WC_RDMA_WRITE;
585 case MTHCA_OPCODE_RDMA_WRITE_IMM:
586 entry->opcode = IB_WC_RDMA_WRITE;
587 entry->wc_flags |= IB_WC_WITH_IMM;
589 case MTHCA_OPCODE_SEND:
590 entry->opcode = IB_WC_SEND;
592 case MTHCA_OPCODE_SEND_IMM:
593 entry->opcode = IB_WC_SEND;
594 entry->wc_flags |= IB_WC_WITH_IMM;
596 case MTHCA_OPCODE_RDMA_READ:
597 entry->opcode = IB_WC_RDMA_READ;
598 entry->byte_len = be32_to_cpu(cqe->byte_cnt);
600 case MTHCA_OPCODE_ATOMIC_CS:
601 entry->opcode = IB_WC_COMP_SWAP;
602 entry->byte_len = be32_to_cpu(cqe->byte_cnt);
604 case MTHCA_OPCODE_ATOMIC_FA:
605 entry->opcode = IB_WC_FETCH_ADD;
606 entry->byte_len = be32_to_cpu(cqe->byte_cnt);
608 case MTHCA_OPCODE_BIND_MW:
609 entry->opcode = IB_WC_BIND_MW;
612 entry->opcode = MTHCA_OPCODE_INVALID;
616 entry->byte_len = be32_to_cpu(cqe->byte_cnt);
617 switch (cqe->opcode & 0x1f) {
618 case IB_OPCODE_SEND_LAST_WITH_IMMEDIATE:
619 case IB_OPCODE_SEND_ONLY_WITH_IMMEDIATE:
620 entry->wc_flags = IB_WC_WITH_IMM;
621 entry->imm_data = cqe->imm_etype_pkey_eec;
622 entry->opcode = IB_WC_RECV;
624 case IB_OPCODE_RDMA_WRITE_LAST_WITH_IMMEDIATE:
625 case IB_OPCODE_RDMA_WRITE_ONLY_WITH_IMMEDIATE:
626 entry->wc_flags = IB_WC_WITH_IMM;
627 entry->imm_data = cqe->imm_etype_pkey_eec;
628 entry->opcode = IB_WC_RECV_RDMA_WITH_IMM;
632 entry->opcode = IB_WC_RECV;
635 entry->slid = be16_to_cpu(cqe->rlid);
636 entry->sl = be16_to_cpu(cqe->sl_g_mlpath) >> 12;
637 entry->src_qp = be32_to_cpu(cqe->rqpn) & 0xffffff;
638 entry->dlid_path_bits = be16_to_cpu(cqe->sl_g_mlpath) & 0x7f;
639 entry->pkey_index = be32_to_cpu(cqe->imm_etype_pkey_eec) >> 16;
640 entry->wc_flags |= be16_to_cpu(cqe->sl_g_mlpath) & 0x80 ?
644 entry->status = IB_WC_SUCCESS;
647 if (likely(free_cqe)) {
656 int mthca_poll_cq(struct ib_cq *ibcq, int num_entries,
659 struct mthca_dev *dev = to_mdev(ibcq->device);
660 struct mthca_cq *cq = to_mcq(ibcq);
661 struct mthca_qp *qp = NULL;
667 spin_lock_irqsave(&cq->lock, flags);
671 while (npolled < num_entries) {
672 err = mthca_poll_one(dev, cq, &qp,
673 &freed, entry + npolled);
681 update_cons_index(dev, cq, freed);
685 * If a CQ resize is in progress and we discovered that the
686 * old buffer is empty, then peek in the new buffer, and if
687 * it's not empty, switch to the new buffer and continue
690 if (unlikely(err == -EAGAIN && cq->resize_buf &&
691 cq->resize_buf->state == CQ_RESIZE_READY)) {
693 * In Tavor mode, the hardware keeps the producer
694 * index modulo the CQ size. Since we might be making
695 * the CQ bigger, we need to mask our consumer index
696 * using the size of the old CQ buffer before looking
697 * in the new CQ buffer.
699 if (!mthca_is_memfree(dev))
700 cq->cons_index &= cq->ibcq.cqe;
702 if (cqe_sw(get_cqe_from_buf(&cq->resize_buf->buf,
703 cq->cons_index & cq->resize_buf->cqe))) {
704 struct mthca_cq_buf tbuf;
709 cq->buf = cq->resize_buf->buf;
710 cq->ibcq.cqe = cq->resize_buf->cqe;
712 cq->resize_buf->buf = tbuf;
713 cq->resize_buf->cqe = tcqe;
714 cq->resize_buf->state = CQ_RESIZE_SWAPPED;
720 spin_unlock_irqrestore(&cq->lock, flags);
722 return err == 0 || err == -EAGAIN ? npolled : err;
725 int mthca_tavor_arm_cq(struct ib_cq *cq, enum ib_cq_notify notify)
729 doorbell[0] = cpu_to_be32((notify == IB_CQ_SOLICITED ?
730 MTHCA_TAVOR_CQ_DB_REQ_NOT_SOL :
731 MTHCA_TAVOR_CQ_DB_REQ_NOT) |
733 doorbell[1] = (__force __be32) 0xffffffff;
735 mthca_write64(doorbell,
736 to_mdev(cq->device)->kar + MTHCA_CQ_DOORBELL,
737 MTHCA_GET_DOORBELL_LOCK(&to_mdev(cq->device)->doorbell_lock));
742 int mthca_arbel_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify notify)
744 struct mthca_cq *cq = to_mcq(ibcq);
750 ci = cpu_to_be32(cq->cons_index);
753 doorbell[1] = cpu_to_be32((cq->cqn << 8) | (2 << 5) | (sn << 3) |
754 (notify == IB_CQ_SOLICITED ? 1 : 2));
756 mthca_write_db_rec(doorbell, cq->arm_db);
759 * Make sure that the doorbell record in host memory is
760 * written before ringing the doorbell via PCI MMIO.
764 doorbell[0] = cpu_to_be32((sn << 28) |
765 (notify == IB_CQ_SOLICITED ?
766 MTHCA_ARBEL_CQ_DB_REQ_NOT_SOL :
767 MTHCA_ARBEL_CQ_DB_REQ_NOT) |
771 mthca_write64(doorbell,
772 to_mdev(ibcq->device)->kar + MTHCA_CQ_DOORBELL,
773 MTHCA_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->doorbell_lock));
778 int mthca_init_cq(struct mthca_dev *dev, int nent,
779 struct mthca_ucontext *ctx, u32 pdn,
782 struct mthca_mailbox *mailbox;
783 struct mthca_cq_context *cq_context;
787 cq->ibcq.cqe = nent - 1;
788 cq->is_kernel = !ctx;
790 cq->cqn = mthca_alloc(&dev->cq_table.alloc);
794 if (mthca_is_memfree(dev)) {
795 err = mthca_table_get(dev, dev->cq_table.table, cq->cqn);
804 cq->set_ci_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_SET_CI,
805 cq->cqn, &cq->set_ci_db);
806 if (cq->set_ci_db_index < 0)
809 cq->arm_db_index = mthca_alloc_db(dev, MTHCA_DB_TYPE_CQ_ARM,
810 cq->cqn, &cq->arm_db);
811 if (cq->arm_db_index < 0)
816 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
820 cq_context = mailbox->buf;
823 err = mthca_alloc_cq_buf(dev, &cq->buf, nent);
825 goto err_out_mailbox;
828 spin_lock_init(&cq->lock);
830 init_waitqueue_head(&cq->wait);
831 mutex_init(&cq->mutex);
833 memset(cq_context, 0, sizeof *cq_context);
834 cq_context->flags = cpu_to_be32(MTHCA_CQ_STATUS_OK |
835 MTHCA_CQ_STATE_DISARMED |
837 cq_context->logsize_usrpage = cpu_to_be32((ffs(nent) - 1) << 24);
839 cq_context->logsize_usrpage |= cpu_to_be32(ctx->uar.index);
841 cq_context->logsize_usrpage |= cpu_to_be32(dev->driver_uar.index);
842 cq_context->error_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_ASYNC].eqn);
843 cq_context->comp_eqn = cpu_to_be32(dev->eq_table.eq[MTHCA_EQ_COMP].eqn);
844 cq_context->pd = cpu_to_be32(pdn);
845 cq_context->lkey = cpu_to_be32(cq->buf.mr.ibmr.lkey);
846 cq_context->cqn = cpu_to_be32(cq->cqn);
848 if (mthca_is_memfree(dev)) {
849 cq_context->ci_db = cpu_to_be32(cq->set_ci_db_index);
850 cq_context->state_db = cpu_to_be32(cq->arm_db_index);
853 err = mthca_SW2HW_CQ(dev, mailbox, cq->cqn, &status);
855 mthca_warn(dev, "SW2HW_CQ failed (%d)\n", err);
856 goto err_out_free_mr;
860 mthca_warn(dev, "SW2HW_CQ returned status 0x%02x\n",
863 goto err_out_free_mr;
866 spin_lock_irq(&dev->cq_table.lock);
867 if (mthca_array_set(&dev->cq_table.cq,
868 cq->cqn & (dev->limits.num_cqs - 1),
870 spin_unlock_irq(&dev->cq_table.lock);
871 goto err_out_free_mr;
873 spin_unlock_irq(&dev->cq_table.lock);
877 mthca_free_mailbox(dev, mailbox);
883 mthca_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
886 mthca_free_mailbox(dev, mailbox);
889 if (cq->is_kernel && mthca_is_memfree(dev))
890 mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
893 if (cq->is_kernel && mthca_is_memfree(dev))
894 mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
897 mthca_table_put(dev, dev->cq_table.table, cq->cqn);
900 mthca_free(&dev->cq_table.alloc, cq->cqn);
905 static inline int get_cq_refcount(struct mthca_dev *dev, struct mthca_cq *cq)
909 spin_lock_irq(&dev->cq_table.lock);
911 spin_unlock_irq(&dev->cq_table.lock);
916 void mthca_free_cq(struct mthca_dev *dev,
919 struct mthca_mailbox *mailbox;
923 mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
924 if (IS_ERR(mailbox)) {
925 mthca_warn(dev, "No memory for mailbox to free CQ.\n");
929 err = mthca_HW2SW_CQ(dev, mailbox, cq->cqn, &status);
931 mthca_warn(dev, "HW2SW_CQ failed (%d)\n", err);
933 mthca_warn(dev, "HW2SW_CQ returned status 0x%02x\n", status);
936 __be32 *ctx = mailbox->buf;
939 printk(KERN_ERR "context for CQN %x (cons index %x, next sw %d)\n",
940 cq->cqn, cq->cons_index,
941 cq->is_kernel ? !!next_cqe_sw(cq) : 0);
942 for (j = 0; j < 16; ++j)
943 printk(KERN_ERR "[%2x] %08x\n", j * 4, be32_to_cpu(ctx[j]));
946 spin_lock_irq(&dev->cq_table.lock);
947 mthca_array_clear(&dev->cq_table.cq,
948 cq->cqn & (dev->limits.num_cqs - 1));
950 spin_unlock_irq(&dev->cq_table.lock);
952 if (dev->mthca_flags & MTHCA_FLAG_MSI_X)
953 synchronize_irq(dev->eq_table.eq[MTHCA_EQ_COMP].msi_x_vector);
955 synchronize_irq(dev->pdev->irq);
957 wait_event(cq->wait, !get_cq_refcount(dev, cq));
960 mthca_free_cq_buf(dev, &cq->buf, cq->ibcq.cqe);
961 if (mthca_is_memfree(dev)) {
962 mthca_free_db(dev, MTHCA_DB_TYPE_CQ_ARM, cq->arm_db_index);
963 mthca_free_db(dev, MTHCA_DB_TYPE_CQ_SET_CI, cq->set_ci_db_index);
967 mthca_table_put(dev, dev->cq_table.table, cq->cqn);
968 mthca_free(&dev->cq_table.alloc, cq->cqn);
969 mthca_free_mailbox(dev, mailbox);
972 int mthca_init_cq_table(struct mthca_dev *dev)
976 spin_lock_init(&dev->cq_table.lock);
978 err = mthca_alloc_init(&dev->cq_table.alloc,
981 dev->limits.reserved_cqs);
985 err = mthca_array_init(&dev->cq_table.cq,
986 dev->limits.num_cqs);
988 mthca_alloc_cleanup(&dev->cq_table.alloc);
993 void mthca_cleanup_cq_table(struct mthca_dev *dev)
995 mthca_array_cleanup(&dev->cq_table.cq, dev->limits.num_cqs);
996 mthca_alloc_cleanup(&dev->cq_table.alloc);