2 * Copyright (c) 2006 QLogic, Inc. All rights reserved.
3 * Copyright (c) 2005, 2006 PathScale, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 #include <linux/err.h>
35 #include <linux/vmalloc.h>
37 #include "ipath_verbs.h"
38 #include "ipath_kernel.h"
40 #define BITS_PER_PAGE (PAGE_SIZE*BITS_PER_BYTE)
41 #define BITS_PER_PAGE_MASK (BITS_PER_PAGE-1)
42 #define mk_qpn(qpt, map, off) (((map) - (qpt)->map) * BITS_PER_PAGE + \
44 #define find_next_offset(map, off) find_next_zero_bit((map)->page, \
48 * Convert the AETH credit code into the number of credits.
50 static u32 credit_table[31] = {
84 static u32 alloc_qpn(struct ipath_qp_table *qpt)
86 u32 i, offset, max_scan, qpn;
93 offset = qpn & BITS_PER_PAGE_MASK;
94 map = &qpt->map[qpn / BITS_PER_PAGE];
95 max_scan = qpt->nmaps - !offset;
97 if (unlikely(!map->page)) {
98 unsigned long page = get_zeroed_page(GFP_KERNEL);
102 * Free the page if someone raced with us
105 spin_lock_irqsave(&qpt->lock, flags);
109 map->page = (void *)page;
110 spin_unlock_irqrestore(&qpt->lock, flags);
111 if (unlikely(!map->page))
114 if (likely(atomic_read(&map->n_free))) {
116 if (!test_and_set_bit(offset, map->page)) {
117 atomic_dec(&map->n_free);
122 offset = find_next_offset(map, offset);
123 qpn = mk_qpn(qpt, map, offset);
125 * This test differs from alloc_pidmap().
126 * If find_next_offset() does find a zero
127 * bit, we don't need to check for QPN
128 * wrapping around past our starting QPN.
129 * We just need to be sure we don't loop
132 } while (offset < BITS_PER_PAGE && qpn < QPN_MAX);
135 * In order to keep the number of pages allocated to a
136 * minimum, we scan the all existing pages before increasing
137 * the size of the bitmap table.
139 if (++i > max_scan) {
140 if (qpt->nmaps == QPNMAP_ENTRIES)
142 map = &qpt->map[qpt->nmaps++];
144 } else if (map < &qpt->map[qpt->nmaps]) {
151 qpn = mk_qpn(qpt, map, offset);
160 static void free_qpn(struct ipath_qp_table *qpt, u32 qpn)
164 map = qpt->map + qpn / BITS_PER_PAGE;
166 clear_bit(qpn & BITS_PER_PAGE_MASK, map->page);
167 atomic_inc(&map->n_free);
171 * ipath_alloc_qpn - allocate a QP number
174 * @type: the QP type (IB_QPT_SMI and IB_QPT_GSI are special)
176 * Allocate the next available QPN and put the QP into the hash table.
177 * The hash table holds a reference to the QP.
179 static int ipath_alloc_qpn(struct ipath_qp_table *qpt, struct ipath_qp *qp,
180 enum ib_qp_type type)
186 if (type == IB_QPT_SMI)
188 else if (type == IB_QPT_GSI)
191 /* Allocate the next available QPN */
192 qpn = alloc_qpn(qpt);
198 qp->ibqp.qp_num = qpn;
200 /* Add the QP to the hash table. */
201 spin_lock_irqsave(&qpt->lock, flags);
204 qp->next = qpt->table[qpn];
205 qpt->table[qpn] = qp;
206 atomic_inc(&qp->refcount);
208 spin_unlock_irqrestore(&qpt->lock, flags);
216 * ipath_free_qp - remove a QP from the QP table
218 * @qp: the QP to remove
220 * Remove the QP from the table so it can't be found asynchronously by
221 * the receive interrupt routine.
223 static void ipath_free_qp(struct ipath_qp_table *qpt, struct ipath_qp *qp)
225 struct ipath_qp *q, **qpp;
229 spin_lock_irqsave(&qpt->lock, flags);
231 /* Remove QP from the hash table. */
232 qpp = &qpt->table[qp->ibqp.qp_num % qpt->max];
233 for (; (q = *qpp) != NULL; qpp = &q->next) {
237 atomic_dec(&qp->refcount);
243 spin_unlock_irqrestore(&qpt->lock, flags);
248 /* If QPN is not reserved, mark QPN free in the bitmap. */
249 if (qp->ibqp.qp_num > 1)
250 free_qpn(qpt, qp->ibqp.qp_num);
252 wait_event(qp->wait, !atomic_read(&qp->refcount));
256 * ipath_free_all_qps - remove all QPs from the table
257 * @qpt: the QP table to empty
259 void ipath_free_all_qps(struct ipath_qp_table *qpt)
262 struct ipath_qp *qp, *nqp;
265 for (n = 0; n < qpt->max; n++) {
266 spin_lock_irqsave(&qpt->lock, flags);
268 qpt->table[n] = NULL;
269 spin_unlock_irqrestore(&qpt->lock, flags);
273 if (qp->ibqp.qp_num > 1)
274 free_qpn(qpt, qp->ibqp.qp_num);
275 if (!atomic_dec_and_test(&qp->refcount) ||
276 !ipath_destroy_qp(&qp->ibqp))
277 ipath_dbg(KERN_INFO "QP memory leak!\n");
282 for (n = 0; n < ARRAY_SIZE(qpt->map); n++) {
283 if (qpt->map[n].page)
284 free_page((unsigned long)qpt->map[n].page);
289 * ipath_lookup_qpn - return the QP with the given QPN
291 * @qpn: the QP number to look up
293 * The caller is responsible for decrementing the QP reference count
296 struct ipath_qp *ipath_lookup_qpn(struct ipath_qp_table *qpt, u32 qpn)
301 spin_lock_irqsave(&qpt->lock, flags);
303 for (qp = qpt->table[qpn % qpt->max]; qp; qp = qp->next) {
304 if (qp->ibqp.qp_num == qpn) {
305 atomic_inc(&qp->refcount);
310 spin_unlock_irqrestore(&qpt->lock, flags);
315 * ipath_reset_qp - initialize the QP state to the reset state
316 * @qp: the QP to reset
318 static void ipath_reset_qp(struct ipath_qp *qp)
322 qp->qp_access_flags = 0;
323 clear_bit(IPATH_S_BUSY, &qp->s_flags);
328 if (qp->ibqp.qp_type == IB_QPT_RC) {
329 qp->s_state = IB_OPCODE_RC_SEND_LAST;
330 qp->r_state = IB_OPCODE_RC_SEND_LAST;
332 qp->s_state = IB_OPCODE_UC_SEND_LAST;
333 qp->r_state = IB_OPCODE_UC_SEND_LAST;
335 qp->s_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
336 qp->r_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
338 qp->s_rnr_timeout = 0;
346 qp->r_rq.wq->head = 0;
347 qp->r_rq.wq->tail = 0;
353 * ipath_error_qp - put a QP into an error state
354 * @qp: the QP to put into an error state
356 * Flushes both send and receive work queues.
357 * QP s_lock should be held and interrupts disabled.
360 void ipath_error_qp(struct ipath_qp *qp)
362 struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
365 ipath_dbg(KERN_INFO "QP%d/%d in error state\n",
366 qp->ibqp.qp_num, qp->remote_qpn);
368 spin_lock(&dev->pending_lock);
369 /* XXX What if its already removed by the timeout code? */
370 if (!list_empty(&qp->timerwait))
371 list_del_init(&qp->timerwait);
372 if (!list_empty(&qp->piowait))
373 list_del_init(&qp->piowait);
374 spin_unlock(&dev->pending_lock);
376 wc.status = IB_WC_WR_FLUSH_ERR;
380 wc.qp_num = qp->ibqp.qp_num;
386 wc.dlid_path_bits = 0;
389 while (qp->s_last != qp->s_head) {
390 struct ipath_swqe *wqe = get_swqe_ptr(qp, qp->s_last);
392 wc.wr_id = wqe->wr.wr_id;
393 wc.opcode = ib_ipath_wc_opcode[wqe->wr.opcode];
394 if (++qp->s_last >= qp->s_size)
396 ipath_cq_enter(to_icq(qp->ibqp.send_cq), &wc, 1);
398 qp->s_cur = qp->s_tail = qp->s_head;
400 qp->s_ack_state = IB_OPCODE_RC_ACKNOWLEDGE;
403 struct ipath_rwq *wq;
407 spin_lock(&qp->r_rq.lock);
409 /* sanity check pointers before trusting them */
412 if (head >= qp->r_rq.size)
415 if (tail >= qp->r_rq.size)
417 wc.opcode = IB_WC_RECV;
418 while (tail != head) {
419 wc.wr_id = get_rwqe_ptr(&qp->r_rq, tail)->wr_id;
420 if (++tail >= qp->r_rq.size)
422 ipath_cq_enter(to_icq(qp->ibqp.recv_cq), &wc, 1);
426 spin_unlock(&qp->r_rq.lock);
431 * ipath_modify_qp - modify the attributes of a queue pair
432 * @ibqp: the queue pair who's attributes we're modifying
433 * @attr: the new attributes
434 * @attr_mask: the mask of attributes to modify
435 * @udata: user data for ipathverbs.so
437 * Returns 0 on success, otherwise returns an errno.
439 int ipath_modify_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
440 int attr_mask, struct ib_udata *udata)
442 struct ipath_ibdev *dev = to_idev(ibqp->device);
443 struct ipath_qp *qp = to_iqp(ibqp);
444 enum ib_qp_state cur_state, new_state;
448 spin_lock_irqsave(&qp->s_lock, flags);
450 cur_state = attr_mask & IB_QP_CUR_STATE ?
451 attr->cur_qp_state : qp->state;
452 new_state = attr_mask & IB_QP_STATE ? attr->qp_state : cur_state;
454 if (!ib_modify_qp_is_ok(cur_state, new_state, ibqp->qp_type,
458 if (attr_mask & IB_QP_AV)
459 if (attr->ah_attr.dlid == 0 ||
460 attr->ah_attr.dlid >= IPATH_MULTICAST_LID_BASE)
463 if (attr_mask & IB_QP_PKEY_INDEX)
464 if (attr->pkey_index >= ipath_get_npkeys(dev->dd))
467 if (attr_mask & IB_QP_MIN_RNR_TIMER)
468 if (attr->min_rnr_timer > 31)
485 if (attr_mask & IB_QP_PKEY_INDEX)
486 qp->s_pkey_index = attr->pkey_index;
488 if (attr_mask & IB_QP_DEST_QPN)
489 qp->remote_qpn = attr->dest_qp_num;
491 if (attr_mask & IB_QP_SQ_PSN) {
492 qp->s_next_psn = attr->sq_psn;
493 qp->s_last_psn = qp->s_next_psn - 1;
496 if (attr_mask & IB_QP_RQ_PSN)
497 qp->r_psn = attr->rq_psn;
499 if (attr_mask & IB_QP_ACCESS_FLAGS)
500 qp->qp_access_flags = attr->qp_access_flags;
502 if (attr_mask & IB_QP_AV)
503 qp->remote_ah_attr = attr->ah_attr;
505 if (attr_mask & IB_QP_PATH_MTU)
506 qp->path_mtu = attr->path_mtu;
508 if (attr_mask & IB_QP_RETRY_CNT)
509 qp->s_retry = qp->s_retry_cnt = attr->retry_cnt;
511 if (attr_mask & IB_QP_RNR_RETRY) {
512 qp->s_rnr_retry = attr->rnr_retry;
513 if (qp->s_rnr_retry > 7)
515 qp->s_rnr_retry_cnt = qp->s_rnr_retry;
518 if (attr_mask & IB_QP_MIN_RNR_TIMER)
519 qp->r_min_rnr_timer = attr->min_rnr_timer;
521 if (attr_mask & IB_QP_QKEY)
522 qp->qkey = attr->qkey;
524 qp->state = new_state;
525 spin_unlock_irqrestore(&qp->s_lock, flags);
531 spin_unlock_irqrestore(&qp->s_lock, flags);
538 int ipath_query_qp(struct ib_qp *ibqp, struct ib_qp_attr *attr,
539 int attr_mask, struct ib_qp_init_attr *init_attr)
541 struct ipath_qp *qp = to_iqp(ibqp);
543 attr->qp_state = qp->state;
544 attr->cur_qp_state = attr->qp_state;
545 attr->path_mtu = qp->path_mtu;
546 attr->path_mig_state = 0;
547 attr->qkey = qp->qkey;
548 attr->rq_psn = qp->r_psn;
549 attr->sq_psn = qp->s_next_psn;
550 attr->dest_qp_num = qp->remote_qpn;
551 attr->qp_access_flags = qp->qp_access_flags;
552 attr->cap.max_send_wr = qp->s_size - 1;
553 attr->cap.max_recv_wr = qp->ibqp.srq ? 0 : qp->r_rq.size - 1;
554 attr->cap.max_send_sge = qp->s_max_sge;
555 attr->cap.max_recv_sge = qp->r_rq.max_sge;
556 attr->cap.max_inline_data = 0;
557 attr->ah_attr = qp->remote_ah_attr;
558 memset(&attr->alt_ah_attr, 0, sizeof(attr->alt_ah_attr));
559 attr->pkey_index = qp->s_pkey_index;
560 attr->alt_pkey_index = 0;
561 attr->en_sqd_async_notify = 0;
562 attr->sq_draining = 0;
563 attr->max_rd_atomic = 1;
564 attr->max_dest_rd_atomic = 1;
565 attr->min_rnr_timer = qp->r_min_rnr_timer;
568 attr->retry_cnt = qp->s_retry_cnt;
569 attr->rnr_retry = qp->s_rnr_retry;
570 attr->alt_port_num = 0;
571 attr->alt_timeout = 0;
573 init_attr->event_handler = qp->ibqp.event_handler;
574 init_attr->qp_context = qp->ibqp.qp_context;
575 init_attr->send_cq = qp->ibqp.send_cq;
576 init_attr->recv_cq = qp->ibqp.recv_cq;
577 init_attr->srq = qp->ibqp.srq;
578 init_attr->cap = attr->cap;
579 init_attr->sq_sig_type =
580 (qp->s_flags & (1 << IPATH_S_SIGNAL_REQ_WR))
581 ? IB_SIGNAL_REQ_WR : 0;
582 init_attr->qp_type = qp->ibqp.qp_type;
583 init_attr->port_num = 1;
588 * ipath_compute_aeth - compute the AETH (syndrome + MSN)
589 * @qp: the queue pair to compute the AETH for
593 __be32 ipath_compute_aeth(struct ipath_qp *qp)
595 u32 aeth = qp->r_msn & IPATH_MSN_MASK;
599 * Shared receive queues don't generate credits.
600 * Set the credit field to the invalid value.
602 aeth |= IPATH_AETH_CREDIT_INVAL << IPATH_AETH_CREDIT_SHIFT;
606 struct ipath_rwq *wq = qp->r_rq.wq;
610 /* sanity check pointers before trusting them */
612 if (head >= qp->r_rq.size)
615 if (tail >= qp->r_rq.size)
618 * Compute the number of credits available (RWQEs).
619 * XXX Not holding the r_rq.lock here so there is a small
620 * chance that the pair of reads are not atomic.
622 credits = head - tail;
623 if ((int)credits < 0)
624 credits += qp->r_rq.size;
626 * Binary search the credit table to find the code to
633 if (credit_table[x] == credits)
635 if (credit_table[x] > credits)
642 aeth |= x << IPATH_AETH_CREDIT_SHIFT;
644 return cpu_to_be32(aeth);
648 * set_verbs_flags - set the verbs layer flags
649 * @dd: the infinipath device
650 * @flags: the flags to set
652 static int set_verbs_flags(struct ipath_devdata *dd, unsigned flags)
654 struct ipath_devdata *ss;
655 unsigned long lflags;
657 spin_lock_irqsave(&ipath_devs_lock, lflags);
659 list_for_each_entry(ss, &ipath_dev_list, ipath_list) {
660 if (!(ss->ipath_flags & IPATH_INITTED))
662 if ((flags & IPATH_VERBS_KERNEL_SMA) &&
663 !(*ss->ipath_statusp & IPATH_STATUS_SMA))
664 *ss->ipath_statusp |= IPATH_STATUS_OIB_SMA;
666 *ss->ipath_statusp &= ~IPATH_STATUS_OIB_SMA;
669 spin_unlock_irqrestore(&ipath_devs_lock, lflags);
675 * ipath_create_qp - create a queue pair for a device
676 * @ibpd: the protection domain who's device we create the queue pair for
677 * @init_attr: the attributes of the queue pair
678 * @udata: unused by InfiniPath
680 * Returns the queue pair on success, otherwise returns an errno.
682 * Called by the ib_create_qp() core verbs function.
684 struct ib_qp *ipath_create_qp(struct ib_pd *ibpd,
685 struct ib_qp_init_attr *init_attr,
686 struct ib_udata *udata)
690 struct ipath_swqe *swq = NULL;
691 struct ipath_ibdev *dev;
695 if (init_attr->cap.max_send_sge > ib_ipath_max_sges ||
696 init_attr->cap.max_recv_sge > ib_ipath_max_sges ||
697 init_attr->cap.max_send_wr > ib_ipath_max_qp_wrs ||
698 init_attr->cap.max_recv_wr > ib_ipath_max_qp_wrs) {
699 ret = ERR_PTR(-ENOMEM);
703 if (init_attr->cap.max_send_sge +
704 init_attr->cap.max_recv_sge +
705 init_attr->cap.max_send_wr +
706 init_attr->cap.max_recv_wr == 0) {
707 ret = ERR_PTR(-EINVAL);
711 switch (init_attr->qp_type) {
714 sz = sizeof(struct ipath_sge) *
715 init_attr->cap.max_send_sge +
716 sizeof(struct ipath_swqe);
717 swq = vmalloc((init_attr->cap.max_send_wr + 1) * sz);
719 ret = ERR_PTR(-ENOMEM);
727 if (init_attr->srq) {
728 struct ipath_srq *srq = to_isrq(init_attr->srq);
730 sz += sizeof(*qp->r_sg_list) *
733 sz += sizeof(*qp->r_sg_list) *
734 init_attr->cap.max_recv_sge;
735 qp = kmalloc(sz, GFP_KERNEL);
737 ret = ERR_PTR(-ENOMEM);
740 if (init_attr->srq) {
743 qp->r_rq.max_sge = 0;
745 init_attr->cap.max_recv_wr = 0;
746 init_attr->cap.max_recv_sge = 0;
748 qp->r_rq.size = init_attr->cap.max_recv_wr + 1;
749 qp->r_rq.max_sge = init_attr->cap.max_recv_sge;
750 sz = (sizeof(struct ib_sge) * qp->r_rq.max_sge) +
751 sizeof(struct ipath_rwqe);
752 qp->r_rq.wq = vmalloc_user(sizeof(struct ipath_rwq) +
755 ret = ERR_PTR(-ENOMEM);
761 * ib_create_qp() will initialize qp->ibqp
762 * except for qp->ibqp.qp_num.
764 spin_lock_init(&qp->s_lock);
765 spin_lock_init(&qp->r_rq.lock);
766 atomic_set(&qp->refcount, 0);
767 init_waitqueue_head(&qp->wait);
768 tasklet_init(&qp->s_task, ipath_do_ruc_send,
770 INIT_LIST_HEAD(&qp->piowait);
771 INIT_LIST_HEAD(&qp->timerwait);
772 qp->state = IB_QPS_RESET;
774 qp->s_size = init_attr->cap.max_send_wr + 1;
775 qp->s_max_sge = init_attr->cap.max_send_sge;
776 qp->s_flags = init_attr->sq_sig_type == IB_SIGNAL_REQ_WR ?
777 1 << IPATH_S_SIGNAL_REQ_WR : 0;
778 dev = to_idev(ibpd->device);
779 err = ipath_alloc_qpn(&dev->qp_table, qp,
788 /* Tell the core driver that the kernel SMA is present. */
789 if (init_attr->qp_type == IB_QPT_SMI)
790 set_verbs_flags(dev->dd, IPATH_VERBS_KERNEL_SMA);
794 /* Don't support raw QPs */
795 ret = ERR_PTR(-ENOSYS);
799 init_attr->cap.max_inline_data = 0;
802 * Return the address of the RWQ as the offset to mmap.
803 * See ipath_mmap() for details.
805 if (udata && udata->outlen >= sizeof(__u64)) {
806 struct ipath_mmap_info *ip;
807 __u64 offset = (__u64) qp->r_rq.wq;
810 err = ib_copy_to_udata(udata, &offset, sizeof(offset));
817 /* Allocate info for ipath_mmap(). */
818 ip = kmalloc(sizeof(*ip), GFP_KERNEL);
820 ret = ERR_PTR(-ENOMEM);
824 ip->context = ibpd->uobject->context;
825 ip->obj = qp->r_rq.wq;
828 ip->size = PAGE_ALIGN(sizeof(struct ipath_rwq) +
830 spin_lock_irq(&dev->pending_lock);
831 ip->next = dev->pending_mmaps;
832 dev->pending_mmaps = ip;
833 spin_unlock_irq(&dev->pending_lock);
851 * ipath_destroy_qp - destroy a queue pair
852 * @ibqp: the queue pair to destroy
854 * Returns 0 on success.
856 * Note that this can be called while the QP is actively sending or
859 int ipath_destroy_qp(struct ib_qp *ibqp)
861 struct ipath_qp *qp = to_iqp(ibqp);
862 struct ipath_ibdev *dev = to_idev(ibqp->device);
865 /* Tell the core driver that the kernel SMA is gone. */
866 if (qp->ibqp.qp_type == IB_QPT_SMI)
867 set_verbs_flags(dev->dd, 0);
869 spin_lock_irqsave(&qp->s_lock, flags);
870 qp->state = IB_QPS_ERR;
871 spin_unlock_irqrestore(&qp->s_lock, flags);
873 /* Stop the sending tasklet. */
874 tasklet_kill(&qp->s_task);
876 /* Make sure the QP isn't on the timeout list. */
877 spin_lock_irqsave(&dev->pending_lock, flags);
878 if (!list_empty(&qp->timerwait))
879 list_del_init(&qp->timerwait);
880 if (!list_empty(&qp->piowait))
881 list_del_init(&qp->piowait);
882 spin_unlock_irqrestore(&dev->pending_lock, flags);
885 * Make sure that the QP is not in the QPN table so receive
886 * interrupts will discard packets for this QP. XXX Also remove QP
887 * from multicast table.
889 if (atomic_read(&qp->refcount) != 0)
890 ipath_free_qp(&dev->qp_table, qp);
893 kref_put(&qp->ip->ref, ipath_release_mmap_info);
902 * ipath_init_qp_table - initialize the QP table for a device
903 * @idev: the device who's QP table we're initializing
904 * @size: the size of the QP table
906 * Returns 0 on success, otherwise returns an errno.
908 int ipath_init_qp_table(struct ipath_ibdev *idev, int size)
913 idev->qp_table.last = 1; /* QPN 0 and 1 are special. */
914 idev->qp_table.max = size;
915 idev->qp_table.nmaps = 1;
916 idev->qp_table.table = kzalloc(size * sizeof(*idev->qp_table.table),
918 if (idev->qp_table.table == NULL) {
923 for (i = 0; i < ARRAY_SIZE(idev->qp_table.map); i++) {
924 atomic_set(&idev->qp_table.map[i].n_free, BITS_PER_PAGE);
925 idev->qp_table.map[i].page = NULL;
935 * ipath_sqerror_qp - put a QP's send queue into an error state
936 * @qp: QP who's send queue will be put into an error state
937 * @wc: the WC responsible for putting the QP in this state
939 * Flushes the send work queue.
940 * The QP s_lock should be held.
943 void ipath_sqerror_qp(struct ipath_qp *qp, struct ib_wc *wc)
945 struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
946 struct ipath_swqe *wqe = get_swqe_ptr(qp, qp->s_last);
948 ipath_dbg(KERN_INFO "Send queue error on QP%d/%d: err: %d\n",
949 qp->ibqp.qp_num, qp->remote_qpn, wc->status);
951 spin_lock(&dev->pending_lock);
952 /* XXX What if its already removed by the timeout code? */
953 if (!list_empty(&qp->timerwait))
954 list_del_init(&qp->timerwait);
955 if (!list_empty(&qp->piowait))
956 list_del_init(&qp->piowait);
957 spin_unlock(&dev->pending_lock);
959 ipath_cq_enter(to_icq(qp->ibqp.send_cq), wc, 1);
960 if (++qp->s_last >= qp->s_size)
963 wc->status = IB_WC_WR_FLUSH_ERR;
965 while (qp->s_last != qp->s_head) {
966 wc->wr_id = wqe->wr.wr_id;
967 wc->opcode = ib_ipath_wc_opcode[wqe->wr.opcode];
968 ipath_cq_enter(to_icq(qp->ibqp.send_cq), wc, 1);
969 if (++qp->s_last >= qp->s_size)
971 wqe = get_swqe_ptr(qp, qp->s_last);
973 qp->s_cur = qp->s_tail = qp->s_head;
974 qp->state = IB_QPS_SQE;
978 * ipath_get_credit - flush the send work queue of a QP
979 * @qp: the qp who's send work queue to flush
980 * @aeth: the Acknowledge Extended Transport Header
982 * The QP s_lock should be held.
984 void ipath_get_credit(struct ipath_qp *qp, u32 aeth)
986 u32 credit = (aeth >> IPATH_AETH_CREDIT_SHIFT) & IPATH_AETH_CREDIT_MASK;
989 * If the credit is invalid, we can send
990 * as many packets as we like. Otherwise, we have to
991 * honor the credit field.
993 if (credit == IPATH_AETH_CREDIT_INVAL)
994 qp->s_lsn = (u32) -1;
995 else if (qp->s_lsn != (u32) -1) {
996 /* Compute new LSN (i.e., MSN + credit) */
997 credit = (aeth + credit_table[credit]) & IPATH_MSN_MASK;
998 if (ipath_cmp24(credit, qp->s_lsn) > 0)
1002 /* Restart sending if it was blocked due to lack of credits. */
1003 if (qp->s_cur != qp->s_head &&
1004 (qp->s_lsn == (u32) -1 ||
1005 ipath_cmp24(get_swqe_ptr(qp, qp->s_cur)->ssn,
1006 qp->s_lsn + 1) <= 0))
1007 tasklet_hi_schedule(&qp->s_task);