2 * Copyright (c) 2012 Intel Corporation. All rights reserved.
3 * Copyright (c) 2006 - 2012 QLogic Corporation. * All rights reserved.
4 * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
6 * This software is available to you under a choice of one of two
7 * licenses. You may choose to be licensed under the terms of the GNU
8 * General Public License (GPL) Version 2, available from the file
9 * COPYING in the main directory of this source tree, or the
10 * OpenIB.org BSD license below:
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
16 * - Redistributions of source code must retain the above
17 * copyright notice, this list of conditions and the following
20 * - Redistributions in binary form must reproduce the above
21 * copyright notice, this list of conditions and the following
22 * disclaimer in the documentation and/or other materials
23 * provided with the distribution.
25 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
26 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
27 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
28 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
29 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
30 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
31 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
35 #include <linux/err.h>
36 #include <linux/vmalloc.h>
37 #include <linux/jhash.h>
41 #define BITS_PER_PAGE (PAGE_SIZE*BITS_PER_BYTE)
42 #define BITS_PER_PAGE_MASK (BITS_PER_PAGE-1)
44 static inline unsigned mk_qpn(struct qib_qpn_table *qpt,
45 struct qpn_map *map, unsigned off)
47 return (map - qpt->map) * BITS_PER_PAGE + off;
50 static inline unsigned find_next_offset(struct qib_qpn_table *qpt,
51 struct qpn_map *map, unsigned off,
56 if (((off & qpt->mask) >> 1) >= n)
57 off = (off | qpt->mask) + 2;
59 off = find_next_zero_bit(map->page, BITS_PER_PAGE, off);
64 * Convert the AETH credit code into the number of credits.
66 static u32 credit_table[31] = {
100 static void get_map_page(struct qib_qpn_table *qpt, struct qpn_map *map)
102 unsigned long page = get_zeroed_page(GFP_KERNEL);
105 * Free the page if someone raced with us installing it.
108 spin_lock(&qpt->lock);
112 map->page = (void *)page;
113 spin_unlock(&qpt->lock);
117 * Allocate the next available QPN or
118 * zero/one for QP type IB_QPT_SMI/IB_QPT_GSI.
120 static int alloc_qpn(struct qib_devdata *dd, struct qib_qpn_table *qpt,
121 enum ib_qp_type type, u8 port)
123 u32 i, offset, max_scan, qpn;
127 if (type == IB_QPT_SMI || type == IB_QPT_GSI) {
130 ret = type == IB_QPT_GSI;
131 n = 1 << (ret + 2 * (port - 1));
132 spin_lock(&qpt->lock);
137 spin_unlock(&qpt->lock);
144 if (qpt->mask && ((qpn & qpt->mask) >> 1) >= dd->n_krcv_queues)
145 qpn = (qpn | qpt->mask) + 2;
146 offset = qpn & BITS_PER_PAGE_MASK;
147 map = &qpt->map[qpn / BITS_PER_PAGE];
148 max_scan = qpt->nmaps - !offset;
150 if (unlikely(!map->page)) {
151 get_map_page(qpt, map);
152 if (unlikely(!map->page))
156 if (!test_and_set_bit(offset, map->page)) {
161 offset = find_next_offset(qpt, map, offset,
163 qpn = mk_qpn(qpt, map, offset);
165 * This test differs from alloc_pidmap().
166 * If find_next_offset() does find a zero
167 * bit, we don't need to check for QPN
168 * wrapping around past our starting QPN.
169 * We just need to be sure we don't loop
172 } while (offset < BITS_PER_PAGE && qpn < QPN_MAX);
174 * In order to keep the number of pages allocated to a
175 * minimum, we scan the all existing pages before increasing
176 * the size of the bitmap table.
178 if (++i > max_scan) {
179 if (qpt->nmaps == QPNMAP_ENTRIES)
181 map = &qpt->map[qpt->nmaps++];
183 } else if (map < &qpt->map[qpt->nmaps]) {
190 qpn = mk_qpn(qpt, map, offset);
199 static void free_qpn(struct qib_qpn_table *qpt, u32 qpn)
203 map = qpt->map + qpn / BITS_PER_PAGE;
205 clear_bit(qpn & BITS_PER_PAGE_MASK, map->page);
208 static inline unsigned qpn_hash(struct qib_ibdev *dev, u32 qpn)
210 return jhash_1word(qpn, dev->qp_rnd) &
211 (dev->qp_table_size - 1);
216 * Put the QP into the hash table.
217 * The hash table holds a reference to the QP.
219 static void insert_qp(struct qib_ibdev *dev, struct qib_qp *qp)
221 struct qib_ibport *ibp = to_iport(qp->ibqp.device, qp->port_num);
223 unsigned n = qpn_hash(dev, qp->ibqp.qp_num);
225 spin_lock_irqsave(&dev->qpt_lock, flags);
226 atomic_inc(&qp->refcount);
228 if (qp->ibqp.qp_num == 0)
229 rcu_assign_pointer(ibp->qp0, qp);
230 else if (qp->ibqp.qp_num == 1)
231 rcu_assign_pointer(ibp->qp1, qp);
233 qp->next = dev->qp_table[n];
234 rcu_assign_pointer(dev->qp_table[n], qp);
237 spin_unlock_irqrestore(&dev->qpt_lock, flags);
242 * Remove the QP from the table so it can't be found asynchronously by
243 * the receive interrupt routine.
245 static void remove_qp(struct qib_ibdev *dev, struct qib_qp *qp)
247 struct qib_ibport *ibp = to_iport(qp->ibqp.device, qp->port_num);
248 unsigned n = qpn_hash(dev, qp->ibqp.qp_num);
251 spin_lock_irqsave(&dev->qpt_lock, flags);
253 if (rcu_dereference_protected(ibp->qp0,
254 lockdep_is_held(&dev->qpt_lock)) == qp) {
255 atomic_dec(&qp->refcount);
256 rcu_assign_pointer(ibp->qp0, NULL);
257 } else if (rcu_dereference_protected(ibp->qp1,
258 lockdep_is_held(&dev->qpt_lock)) == qp) {
259 atomic_dec(&qp->refcount);
260 rcu_assign_pointer(ibp->qp1, NULL);
263 struct qib_qp __rcu **qpp;
265 qpp = &dev->qp_table[n];
266 for (; (q = rcu_dereference_protected(*qpp,
267 lockdep_is_held(&dev->qpt_lock))) != NULL;
270 atomic_dec(&qp->refcount);
271 rcu_assign_pointer(*qpp,
272 rcu_dereference_protected(qp->next,
273 lockdep_is_held(&dev->qpt_lock)));
278 spin_unlock_irqrestore(&dev->qpt_lock, flags);
283 * qib_free_all_qps - check for QPs still in use
284 * @qpt: the QP table to empty
286 * There should not be any QPs still in use.
287 * Free memory for table.
289 unsigned qib_free_all_qps(struct qib_devdata *dd)
291 struct qib_ibdev *dev = &dd->verbs_dev;
294 unsigned n, qp_inuse = 0;
296 for (n = 0; n < dd->num_pports; n++) {
297 struct qib_ibport *ibp = &dd->pport[n].ibport_data;
299 if (!qib_mcast_tree_empty(ibp))
302 if (rcu_dereference(ibp->qp0))
304 if (rcu_dereference(ibp->qp1))
309 spin_lock_irqsave(&dev->qpt_lock, flags);
310 for (n = 0; n < dev->qp_table_size; n++) {
311 qp = rcu_dereference_protected(dev->qp_table[n],
312 lockdep_is_held(&dev->qpt_lock));
313 rcu_assign_pointer(dev->qp_table[n], NULL);
315 for (; qp; qp = rcu_dereference_protected(qp->next,
316 lockdep_is_held(&dev->qpt_lock)))
319 spin_unlock_irqrestore(&dev->qpt_lock, flags);
326 * qib_lookup_qpn - return the QP with the given QPN
328 * @qpn: the QP number to look up
330 * The caller is responsible for decrementing the QP reference count
333 struct qib_qp *qib_lookup_qpn(struct qib_ibport *ibp, u32 qpn)
335 struct qib_qp *qp = NULL;
337 if (unlikely(qpn <= 1)) {
340 qp = rcu_dereference(ibp->qp0);
342 qp = rcu_dereference(ibp->qp1);
344 struct qib_ibdev *dev = &ppd_from_ibp(ibp)->dd->verbs_dev;
345 unsigned n = qpn_hash(dev, qpn);
348 for (qp = rcu_dereference(dev->qp_table[n]); qp;
349 qp = rcu_dereference(qp->next))
350 if (qp->ibqp.qp_num == qpn)
354 if (unlikely(!atomic_inc_not_zero(&qp->refcount)))
362 * qib_reset_qp - initialize the QP state to the reset state
363 * @qp: the QP to reset
366 static void qib_reset_qp(struct qib_qp *qp, enum ib_qp_type type)
370 qp->qp_access_flags = 0;
371 atomic_set(&qp->s_dma_busy, 0);
372 qp->s_flags &= QIB_S_SIGNAL_REQ_WR;
378 qp->s_sending_psn = 0;
379 qp->s_sending_hpsn = 0;
383 if (type == IB_QPT_RC) {
384 qp->s_state = IB_OPCODE_RC_SEND_LAST;
385 qp->r_state = IB_OPCODE_RC_SEND_LAST;
387 qp->s_state = IB_OPCODE_UC_SEND_LAST;
388 qp->r_state = IB_OPCODE_UC_SEND_LAST;
390 qp->s_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
401 qp->s_mig_state = IB_MIG_MIGRATED;
402 memset(qp->s_ack_queue, 0, sizeof(qp->s_ack_queue));
403 qp->r_head_ack_queue = 0;
404 qp->s_tail_ack_queue = 0;
405 qp->s_num_rd_atomic = 0;
407 qp->r_rq.wq->head = 0;
408 qp->r_rq.wq->tail = 0;
410 qp->r_sge.num_sge = 0;
413 static void clear_mr_refs(struct qib_qp *qp, int clr_sends)
417 if (test_and_clear_bit(QIB_R_REWIND_SGE, &qp->r_aflags))
418 qib_put_ss(&qp->s_rdma_read_sge);
420 qib_put_ss(&qp->r_sge);
423 while (qp->s_last != qp->s_head) {
424 struct qib_swqe *wqe = get_swqe_ptr(qp, qp->s_last);
427 for (i = 0; i < wqe->wr.num_sge; i++) {
428 struct qib_sge *sge = &wqe->sg_list[i];
432 if (qp->ibqp.qp_type == IB_QPT_UD ||
433 qp->ibqp.qp_type == IB_QPT_SMI ||
434 qp->ibqp.qp_type == IB_QPT_GSI)
435 atomic_dec(&to_iah(wqe->wr.wr.ud.ah)->refcount);
436 if (++qp->s_last >= qp->s_size)
440 qib_put_mr(qp->s_rdma_mr);
441 qp->s_rdma_mr = NULL;
445 if (qp->ibqp.qp_type != IB_QPT_RC)
448 for (n = 0; n < ARRAY_SIZE(qp->s_ack_queue); n++) {
449 struct qib_ack_entry *e = &qp->s_ack_queue[n];
451 if (e->opcode == IB_OPCODE_RC_RDMA_READ_REQUEST &&
453 qib_put_mr(e->rdma_sge.mr);
454 e->rdma_sge.mr = NULL;
460 * qib_error_qp - put a QP into the error state
461 * @qp: the QP to put into the error state
462 * @err: the receive completion error to signal if a RWQE is active
464 * Flushes both send and receive work queues.
465 * Returns true if last WQE event should be generated.
466 * The QP r_lock and s_lock should be held and interrupts disabled.
467 * If we are already in error state, just return.
469 int qib_error_qp(struct qib_qp *qp, enum ib_wc_status err)
471 struct qib_ibdev *dev = to_idev(qp->ibqp.device);
475 if (qp->state == IB_QPS_ERR || qp->state == IB_QPS_RESET)
478 qp->state = IB_QPS_ERR;
480 if (qp->s_flags & (QIB_S_TIMER | QIB_S_WAIT_RNR)) {
481 qp->s_flags &= ~(QIB_S_TIMER | QIB_S_WAIT_RNR);
482 del_timer(&qp->s_timer);
485 if (qp->s_flags & QIB_S_ANY_WAIT_SEND)
486 qp->s_flags &= ~QIB_S_ANY_WAIT_SEND;
488 spin_lock(&dev->pending_lock);
489 if (!list_empty(&qp->iowait) && !(qp->s_flags & QIB_S_BUSY)) {
490 qp->s_flags &= ~QIB_S_ANY_WAIT_IO;
491 list_del_init(&qp->iowait);
493 spin_unlock(&dev->pending_lock);
495 if (!(qp->s_flags & QIB_S_BUSY)) {
498 qib_put_mr(qp->s_rdma_mr);
499 qp->s_rdma_mr = NULL;
502 qib_put_txreq(qp->s_tx);
507 /* Schedule the sending tasklet to drain the send work queue. */
508 if (qp->s_last != qp->s_head)
509 qib_schedule_send(qp);
511 clear_mr_refs(qp, 0);
513 memset(&wc, 0, sizeof(wc));
515 wc.opcode = IB_WC_RECV;
517 if (test_and_clear_bit(QIB_R_WRID_VALID, &qp->r_aflags)) {
518 wc.wr_id = qp->r_wr_id;
520 qib_cq_enter(to_icq(qp->ibqp.recv_cq), &wc, 1);
522 wc.status = IB_WC_WR_FLUSH_ERR;
529 spin_lock(&qp->r_rq.lock);
531 /* sanity check pointers before trusting them */
534 if (head >= qp->r_rq.size)
537 if (tail >= qp->r_rq.size)
539 while (tail != head) {
540 wc.wr_id = get_rwqe_ptr(&qp->r_rq, tail)->wr_id;
541 if (++tail >= qp->r_rq.size)
543 qib_cq_enter(to_icq(qp->ibqp.recv_cq), &wc, 1);
547 spin_unlock(&qp->r_rq.lock);
548 } else if (qp->ibqp.event_handler)
556 * qib_modify_qp - modify the attributes of a queue pair
557 * @ibqp: the queue pair who's attributes we're modifying
558 * @attr: the new attributes
559 * @attr_mask: the mask of attributes to modify
560 * @udata: user data for libibverbs.so
562 * Returns 0 on success, otherwise returns an errno.
564 int qib_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
565 int attr_mask, struct ib_udata *udata)
567 struct qib_ibdev *dev = to_idev(ibqp->device);
568 struct qib_qp *qp = to_iqp(ibqp);
569 enum ib_qp_state cur_state, new_state;
574 u32 pmtu = 0; /* for gcc warning only */
576 spin_lock_irq(&qp->r_lock);
577 spin_lock(&qp->s_lock);
579 cur_state = attr_mask & IB_QP_CUR_STATE ?
580 attr->cur_qp_state : qp->state;
581 new_state = attr_mask & IB_QP_STATE ? attr->qp_state : cur_state;
583 if (!ib_modify_qp_is_ok(cur_state, new_state, ibqp->qp_type,
587 if (attr_mask & IB_QP_AV) {
588 if (attr->ah_attr.dlid >= QIB_MULTICAST_LID_BASE)
590 if (qib_check_ah(qp->ibqp.device, &attr->ah_attr))
594 if (attr_mask & IB_QP_ALT_PATH) {
595 if (attr->alt_ah_attr.dlid >= QIB_MULTICAST_LID_BASE)
597 if (qib_check_ah(qp->ibqp.device, &attr->alt_ah_attr))
599 if (attr->alt_pkey_index >= qib_get_npkeys(dd_from_dev(dev)))
603 if (attr_mask & IB_QP_PKEY_INDEX)
604 if (attr->pkey_index >= qib_get_npkeys(dd_from_dev(dev)))
607 if (attr_mask & IB_QP_MIN_RNR_TIMER)
608 if (attr->min_rnr_timer > 31)
611 if (attr_mask & IB_QP_PORT)
612 if (qp->ibqp.qp_type == IB_QPT_SMI ||
613 qp->ibqp.qp_type == IB_QPT_GSI ||
614 attr->port_num == 0 ||
615 attr->port_num > ibqp->device->phys_port_cnt)
618 if (attr_mask & IB_QP_DEST_QPN)
619 if (attr->dest_qp_num > QIB_QPN_MASK)
622 if (attr_mask & IB_QP_RETRY_CNT)
623 if (attr->retry_cnt > 7)
626 if (attr_mask & IB_QP_RNR_RETRY)
627 if (attr->rnr_retry > 7)
631 * Don't allow invalid path_mtu values. OK to set greater
632 * than the active mtu (or even the max_cap, if we have tuned
633 * that to a small mtu. We'll set qp->path_mtu
634 * to the lesser of requested attribute mtu and active,
635 * for packetizing messages.
636 * Note that the QP port has to be set in INIT and MTU in RTR.
638 if (attr_mask & IB_QP_PATH_MTU) {
639 struct qib_devdata *dd = dd_from_dev(dev);
640 int mtu, pidx = qp->port_num - 1;
642 mtu = ib_mtu_enum_to_int(attr->path_mtu);
645 if (mtu > dd->pport[pidx].ibmtu) {
646 switch (dd->pport[pidx].ibmtu) {
666 pmtu = attr->path_mtu;
669 if (attr_mask & IB_QP_PATH_MIG_STATE) {
670 if (attr->path_mig_state == IB_MIG_REARM) {
671 if (qp->s_mig_state == IB_MIG_ARMED)
673 if (new_state != IB_QPS_RTS)
675 } else if (attr->path_mig_state == IB_MIG_MIGRATED) {
676 if (qp->s_mig_state == IB_MIG_REARM)
678 if (new_state != IB_QPS_RTS && new_state != IB_QPS_SQD)
680 if (qp->s_mig_state == IB_MIG_ARMED)
686 if (attr_mask & IB_QP_MAX_DEST_RD_ATOMIC)
687 if (attr->max_dest_rd_atomic > QIB_MAX_RDMA_ATOMIC)
692 if (qp->state != IB_QPS_RESET) {
693 qp->state = IB_QPS_RESET;
694 spin_lock(&dev->pending_lock);
695 if (!list_empty(&qp->iowait))
696 list_del_init(&qp->iowait);
697 spin_unlock(&dev->pending_lock);
698 qp->s_flags &= ~(QIB_S_TIMER | QIB_S_ANY_WAIT);
699 spin_unlock(&qp->s_lock);
700 spin_unlock_irq(&qp->r_lock);
701 /* Stop the sending work queue and retry timer */
702 cancel_work_sync(&qp->s_work);
703 del_timer_sync(&qp->s_timer);
704 wait_event(qp->wait_dma, !atomic_read(&qp->s_dma_busy));
706 qib_put_txreq(qp->s_tx);
710 wait_event(qp->wait, !atomic_read(&qp->refcount));
711 spin_lock_irq(&qp->r_lock);
712 spin_lock(&qp->s_lock);
713 clear_mr_refs(qp, 1);
714 qib_reset_qp(qp, ibqp->qp_type);
719 /* Allow event to retrigger if QP set to RTR more than once */
720 qp->r_flags &= ~QIB_R_COMM_EST;
721 qp->state = new_state;
725 qp->s_draining = qp->s_last != qp->s_cur;
726 qp->state = new_state;
730 if (qp->ibqp.qp_type == IB_QPT_RC)
732 qp->state = new_state;
736 lastwqe = qib_error_qp(qp, IB_WC_WR_FLUSH_ERR);
740 qp->state = new_state;
744 if (attr_mask & IB_QP_PKEY_INDEX)
745 qp->s_pkey_index = attr->pkey_index;
747 if (attr_mask & IB_QP_PORT)
748 qp->port_num = attr->port_num;
750 if (attr_mask & IB_QP_DEST_QPN)
751 qp->remote_qpn = attr->dest_qp_num;
753 if (attr_mask & IB_QP_SQ_PSN) {
754 qp->s_next_psn = attr->sq_psn & QIB_PSN_MASK;
755 qp->s_psn = qp->s_next_psn;
756 qp->s_sending_psn = qp->s_next_psn;
757 qp->s_last_psn = qp->s_next_psn - 1;
758 qp->s_sending_hpsn = qp->s_last_psn;
761 if (attr_mask & IB_QP_RQ_PSN)
762 qp->r_psn = attr->rq_psn & QIB_PSN_MASK;
764 if (attr_mask & IB_QP_ACCESS_FLAGS)
765 qp->qp_access_flags = attr->qp_access_flags;
767 if (attr_mask & IB_QP_AV) {
768 qp->remote_ah_attr = attr->ah_attr;
769 qp->s_srate = attr->ah_attr.static_rate;
772 if (attr_mask & IB_QP_ALT_PATH) {
773 qp->alt_ah_attr = attr->alt_ah_attr;
774 qp->s_alt_pkey_index = attr->alt_pkey_index;
777 if (attr_mask & IB_QP_PATH_MIG_STATE) {
778 qp->s_mig_state = attr->path_mig_state;
780 qp->remote_ah_attr = qp->alt_ah_attr;
781 qp->port_num = qp->alt_ah_attr.port_num;
782 qp->s_pkey_index = qp->s_alt_pkey_index;
786 if (attr_mask & IB_QP_PATH_MTU) {
788 qp->pmtu = ib_mtu_enum_to_int(pmtu);
791 if (attr_mask & IB_QP_RETRY_CNT) {
792 qp->s_retry_cnt = attr->retry_cnt;
793 qp->s_retry = attr->retry_cnt;
796 if (attr_mask & IB_QP_RNR_RETRY) {
797 qp->s_rnr_retry_cnt = attr->rnr_retry;
798 qp->s_rnr_retry = attr->rnr_retry;
801 if (attr_mask & IB_QP_MIN_RNR_TIMER)
802 qp->r_min_rnr_timer = attr->min_rnr_timer;
804 if (attr_mask & IB_QP_TIMEOUT) {
805 qp->timeout = attr->timeout;
806 qp->timeout_jiffies =
807 usecs_to_jiffies((4096UL * (1UL << qp->timeout)) /
811 if (attr_mask & IB_QP_QKEY)
812 qp->qkey = attr->qkey;
814 if (attr_mask & IB_QP_MAX_DEST_RD_ATOMIC)
815 qp->r_max_rd_atomic = attr->max_dest_rd_atomic;
817 if (attr_mask & IB_QP_MAX_QP_RD_ATOMIC)
818 qp->s_max_rd_atomic = attr->max_rd_atomic;
820 spin_unlock(&qp->s_lock);
821 spin_unlock_irq(&qp->r_lock);
823 if (cur_state == IB_QPS_RESET && new_state == IB_QPS_INIT)
827 ev.device = qp->ibqp.device;
828 ev.element.qp = &qp->ibqp;
829 ev.event = IB_EVENT_QP_LAST_WQE_REACHED;
830 qp->ibqp.event_handler(&ev, qp->ibqp.qp_context);
833 ev.device = qp->ibqp.device;
834 ev.element.qp = &qp->ibqp;
835 ev.event = IB_EVENT_PATH_MIG;
836 qp->ibqp.event_handler(&ev, qp->ibqp.qp_context);
842 spin_unlock(&qp->s_lock);
843 spin_unlock_irq(&qp->r_lock);
850 int qib_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
851 int attr_mask, struct ib_qp_init_attr *init_attr)
853 struct qib_qp *qp = to_iqp(ibqp);
855 attr->qp_state = qp->state;
856 attr->cur_qp_state = attr->qp_state;
857 attr->path_mtu = qp->path_mtu;
858 attr->path_mig_state = qp->s_mig_state;
859 attr->qkey = qp->qkey;
860 attr->rq_psn = qp->r_psn & QIB_PSN_MASK;
861 attr->sq_psn = qp->s_next_psn & QIB_PSN_MASK;
862 attr->dest_qp_num = qp->remote_qpn;
863 attr->qp_access_flags = qp->qp_access_flags;
864 attr->cap.max_send_wr = qp->s_size - 1;
865 attr->cap.max_recv_wr = qp->ibqp.srq ? 0 : qp->r_rq.size - 1;
866 attr->cap.max_send_sge = qp->s_max_sge;
867 attr->cap.max_recv_sge = qp->r_rq.max_sge;
868 attr->cap.max_inline_data = 0;
869 attr->ah_attr = qp->remote_ah_attr;
870 attr->alt_ah_attr = qp->alt_ah_attr;
871 attr->pkey_index = qp->s_pkey_index;
872 attr->alt_pkey_index = qp->s_alt_pkey_index;
873 attr->en_sqd_async_notify = 0;
874 attr->sq_draining = qp->s_draining;
875 attr->max_rd_atomic = qp->s_max_rd_atomic;
876 attr->max_dest_rd_atomic = qp->r_max_rd_atomic;
877 attr->min_rnr_timer = qp->r_min_rnr_timer;
878 attr->port_num = qp->port_num;
879 attr->timeout = qp->timeout;
880 attr->retry_cnt = qp->s_retry_cnt;
881 attr->rnr_retry = qp->s_rnr_retry_cnt;
882 attr->alt_port_num = qp->alt_ah_attr.port_num;
883 attr->alt_timeout = qp->alt_timeout;
885 init_attr->event_handler = qp->ibqp.event_handler;
886 init_attr->qp_context = qp->ibqp.qp_context;
887 init_attr->send_cq = qp->ibqp.send_cq;
888 init_attr->recv_cq = qp->ibqp.recv_cq;
889 init_attr->srq = qp->ibqp.srq;
890 init_attr->cap = attr->cap;
891 if (qp->s_flags & QIB_S_SIGNAL_REQ_WR)
892 init_attr->sq_sig_type = IB_SIGNAL_REQ_WR;
894 init_attr->sq_sig_type = IB_SIGNAL_ALL_WR;
895 init_attr->qp_type = qp->ibqp.qp_type;
896 init_attr->port_num = qp->port_num;
901 * qib_compute_aeth - compute the AETH (syndrome + MSN)
902 * @qp: the queue pair to compute the AETH for
906 __be32 qib_compute_aeth(struct qib_qp *qp)
908 u32 aeth = qp->r_msn & QIB_MSN_MASK;
912 * Shared receive queues don't generate credits.
913 * Set the credit field to the invalid value.
915 aeth |= QIB_AETH_CREDIT_INVAL << QIB_AETH_CREDIT_SHIFT;
919 struct qib_rwq *wq = qp->r_rq.wq;
923 /* sanity check pointers before trusting them */
925 if (head >= qp->r_rq.size)
928 if (tail >= qp->r_rq.size)
931 * Compute the number of credits available (RWQEs).
932 * XXX Not holding the r_rq.lock here so there is a small
933 * chance that the pair of reads are not atomic.
935 credits = head - tail;
936 if ((int)credits < 0)
937 credits += qp->r_rq.size;
939 * Binary search the credit table to find the code to
946 if (credit_table[x] == credits)
948 if (credit_table[x] > credits)
955 aeth |= x << QIB_AETH_CREDIT_SHIFT;
957 return cpu_to_be32(aeth);
961 * qib_create_qp - create a queue pair for a device
962 * @ibpd: the protection domain who's device we create the queue pair for
963 * @init_attr: the attributes of the queue pair
964 * @udata: user data for libibverbs.so
966 * Returns the queue pair on success, otherwise returns an errno.
968 * Called by the ib_create_qp() core verbs function.
970 struct ib_qp *qib_create_qp(struct ib_pd *ibpd,
971 struct ib_qp_init_attr *init_attr,
972 struct ib_udata *udata)
976 struct qib_swqe *swq = NULL;
977 struct qib_ibdev *dev;
978 struct qib_devdata *dd;
983 if (init_attr->cap.max_send_sge > ib_qib_max_sges ||
984 init_attr->cap.max_send_wr > ib_qib_max_qp_wrs) {
985 ret = ERR_PTR(-EINVAL);
989 /* Check receive queue parameters if no SRQ is specified. */
990 if (!init_attr->srq) {
991 if (init_attr->cap.max_recv_sge > ib_qib_max_sges ||
992 init_attr->cap.max_recv_wr > ib_qib_max_qp_wrs) {
993 ret = ERR_PTR(-EINVAL);
996 if (init_attr->cap.max_send_sge +
997 init_attr->cap.max_send_wr +
998 init_attr->cap.max_recv_sge +
999 init_attr->cap.max_recv_wr == 0) {
1000 ret = ERR_PTR(-EINVAL);
1005 switch (init_attr->qp_type) {
1008 if (init_attr->port_num == 0 ||
1009 init_attr->port_num > ibpd->device->phys_port_cnt) {
1010 ret = ERR_PTR(-EINVAL);
1016 sz = sizeof(struct qib_sge) *
1017 init_attr->cap.max_send_sge +
1018 sizeof(struct qib_swqe);
1019 swq = vmalloc((init_attr->cap.max_send_wr + 1) * sz);
1021 ret = ERR_PTR(-ENOMEM);
1026 if (init_attr->srq) {
1027 struct qib_srq *srq = to_isrq(init_attr->srq);
1029 if (srq->rq.max_sge > 1)
1030 sg_list_sz = sizeof(*qp->r_sg_list) *
1031 (srq->rq.max_sge - 1);
1032 } else if (init_attr->cap.max_recv_sge > 1)
1033 sg_list_sz = sizeof(*qp->r_sg_list) *
1034 (init_attr->cap.max_recv_sge - 1);
1035 qp = kzalloc(sz + sg_list_sz, GFP_KERNEL);
1037 ret = ERR_PTR(-ENOMEM);
1040 RCU_INIT_POINTER(qp->next, NULL);
1041 qp->s_hdr = kzalloc(sizeof(*qp->s_hdr), GFP_KERNEL);
1043 ret = ERR_PTR(-ENOMEM);
1046 qp->timeout_jiffies =
1047 usecs_to_jiffies((4096UL * (1UL << qp->timeout)) /
1052 qp->r_rq.size = init_attr->cap.max_recv_wr + 1;
1053 qp->r_rq.max_sge = init_attr->cap.max_recv_sge;
1054 sz = (sizeof(struct ib_sge) * qp->r_rq.max_sge) +
1055 sizeof(struct qib_rwqe);
1056 qp->r_rq.wq = vmalloc_user(sizeof(struct qib_rwq) +
1057 qp->r_rq.size * sz);
1059 ret = ERR_PTR(-ENOMEM);
1065 * ib_create_qp() will initialize qp->ibqp
1066 * except for qp->ibqp.qp_num.
1068 spin_lock_init(&qp->r_lock);
1069 spin_lock_init(&qp->s_lock);
1070 spin_lock_init(&qp->r_rq.lock);
1071 atomic_set(&qp->refcount, 0);
1072 init_waitqueue_head(&qp->wait);
1073 init_waitqueue_head(&qp->wait_dma);
1074 init_timer(&qp->s_timer);
1075 qp->s_timer.data = (unsigned long)qp;
1076 INIT_WORK(&qp->s_work, qib_do_send);
1077 INIT_LIST_HEAD(&qp->iowait);
1078 INIT_LIST_HEAD(&qp->rspwait);
1079 qp->state = IB_QPS_RESET;
1081 qp->s_size = init_attr->cap.max_send_wr + 1;
1082 qp->s_max_sge = init_attr->cap.max_send_sge;
1083 if (init_attr->sq_sig_type == IB_SIGNAL_REQ_WR)
1084 qp->s_flags = QIB_S_SIGNAL_REQ_WR;
1085 dev = to_idev(ibpd->device);
1086 dd = dd_from_dev(dev);
1087 err = alloc_qpn(dd, &dev->qpn_table, init_attr->qp_type,
1088 init_attr->port_num);
1094 qp->ibqp.qp_num = err;
1095 qp->port_num = init_attr->port_num;
1096 qib_reset_qp(qp, init_attr->qp_type);
1100 /* Don't support raw QPs */
1101 ret = ERR_PTR(-ENOSYS);
1105 init_attr->cap.max_inline_data = 0;
1108 * Return the address of the RWQ as the offset to mmap.
1109 * See qib_mmap() for details.
1111 if (udata && udata->outlen >= sizeof(__u64)) {
1115 err = ib_copy_to_udata(udata, &offset,
1122 u32 s = sizeof(struct qib_rwq) + qp->r_rq.size * sz;
1124 qp->ip = qib_create_mmap_info(dev, s,
1125 ibpd->uobject->context,
1128 ret = ERR_PTR(-ENOMEM);
1132 err = ib_copy_to_udata(udata, &(qp->ip->offset),
1133 sizeof(qp->ip->offset));
1141 spin_lock(&dev->n_qps_lock);
1142 if (dev->n_qps_allocated == ib_qib_max_qps) {
1143 spin_unlock(&dev->n_qps_lock);
1144 ret = ERR_PTR(-ENOMEM);
1148 dev->n_qps_allocated++;
1149 spin_unlock(&dev->n_qps_lock);
1152 spin_lock_irq(&dev->pending_lock);
1153 list_add(&qp->ip->pending_mmaps, &dev->pending_mmaps);
1154 spin_unlock_irq(&dev->pending_lock);
1162 kref_put(&qp->ip->ref, qib_release_mmap_info);
1165 free_qpn(&dev->qpn_table, qp->ibqp.qp_num);
1176 * qib_destroy_qp - destroy a queue pair
1177 * @ibqp: the queue pair to destroy
1179 * Returns 0 on success.
1181 * Note that this can be called while the QP is actively sending or
1184 int qib_destroy_qp(struct ib_qp *ibqp)
1186 struct qib_qp *qp = to_iqp(ibqp);
1187 struct qib_ibdev *dev = to_idev(ibqp->device);
1189 /* Make sure HW and driver activity is stopped. */
1190 spin_lock_irq(&qp->s_lock);
1191 if (qp->state != IB_QPS_RESET) {
1192 qp->state = IB_QPS_RESET;
1193 spin_lock(&dev->pending_lock);
1194 if (!list_empty(&qp->iowait))
1195 list_del_init(&qp->iowait);
1196 spin_unlock(&dev->pending_lock);
1197 qp->s_flags &= ~(QIB_S_TIMER | QIB_S_ANY_WAIT);
1198 spin_unlock_irq(&qp->s_lock);
1199 cancel_work_sync(&qp->s_work);
1200 del_timer_sync(&qp->s_timer);
1201 wait_event(qp->wait_dma, !atomic_read(&qp->s_dma_busy));
1203 qib_put_txreq(qp->s_tx);
1207 wait_event(qp->wait, !atomic_read(&qp->refcount));
1208 clear_mr_refs(qp, 1);
1210 spin_unlock_irq(&qp->s_lock);
1212 /* all user's cleaned up, mark it available */
1213 free_qpn(&dev->qpn_table, qp->ibqp.qp_num);
1214 spin_lock(&dev->n_qps_lock);
1215 dev->n_qps_allocated--;
1216 spin_unlock(&dev->n_qps_lock);
1219 kref_put(&qp->ip->ref, qib_release_mmap_info);
1229 * qib_init_qpn_table - initialize the QP number table for a device
1230 * @qpt: the QPN table
1232 void qib_init_qpn_table(struct qib_devdata *dd, struct qib_qpn_table *qpt)
1234 spin_lock_init(&qpt->lock);
1235 qpt->last = 1; /* start with QPN 2 */
1237 qpt->mask = dd->qpn_mask;
1241 * qib_free_qpn_table - free the QP number table for a device
1242 * @qpt: the QPN table
1244 void qib_free_qpn_table(struct qib_qpn_table *qpt)
1248 for (i = 0; i < ARRAY_SIZE(qpt->map); i++)
1249 if (qpt->map[i].page)
1250 free_page((unsigned long) qpt->map[i].page);
1254 * qib_get_credit - flush the send work queue of a QP
1255 * @qp: the qp who's send work queue to flush
1256 * @aeth: the Acknowledge Extended Transport Header
1258 * The QP s_lock should be held.
1260 void qib_get_credit(struct qib_qp *qp, u32 aeth)
1262 u32 credit = (aeth >> QIB_AETH_CREDIT_SHIFT) & QIB_AETH_CREDIT_MASK;
1265 * If the credit is invalid, we can send
1266 * as many packets as we like. Otherwise, we have to
1267 * honor the credit field.
1269 if (credit == QIB_AETH_CREDIT_INVAL) {
1270 if (!(qp->s_flags & QIB_S_UNLIMITED_CREDIT)) {
1271 qp->s_flags |= QIB_S_UNLIMITED_CREDIT;
1272 if (qp->s_flags & QIB_S_WAIT_SSN_CREDIT) {
1273 qp->s_flags &= ~QIB_S_WAIT_SSN_CREDIT;
1274 qib_schedule_send(qp);
1277 } else if (!(qp->s_flags & QIB_S_UNLIMITED_CREDIT)) {
1278 /* Compute new LSN (i.e., MSN + credit) */
1279 credit = (aeth + credit_table[credit]) & QIB_MSN_MASK;
1280 if (qib_cmp24(credit, qp->s_lsn) > 0) {
1282 if (qp->s_flags & QIB_S_WAIT_SSN_CREDIT) {
1283 qp->s_flags &= ~QIB_S_WAIT_SSN_CREDIT;
1284 qib_schedule_send(qp);