2 * Copyright (c) 2006, 2007, 2008 QLogic Corporation. 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/spinlock.h>
36 #include "ipath_verbs.h"
37 #include "ipath_kernel.h"
40 * Convert the AETH RNR timeout code into the number of milliseconds.
42 const u32 ib_ipath_rnr_table
[32] = {
78 * ipath_insert_rnr_queue - put QP on the RNR timeout list for the device
81 * Called with the QP s_lock held and interrupts disabled.
82 * XXX Use a simple list for now. We might need a priority
83 * queue if we have lots of QPs waiting for RNR timeouts
84 * but that should be rare.
86 void ipath_insert_rnr_queue(struct ipath_qp
*qp
)
88 struct ipath_ibdev
*dev
= to_idev(qp
->ibqp
.device
);
90 /* We already did a spin_lock_irqsave(), so just use spin_lock */
91 spin_lock(&dev
->pending_lock
);
92 if (list_empty(&dev
->rnrwait
))
93 list_add(&qp
->timerwait
, &dev
->rnrwait
);
95 struct list_head
*l
= &dev
->rnrwait
;
96 struct ipath_qp
*nqp
= list_entry(l
->next
, struct ipath_qp
,
99 while (qp
->s_rnr_timeout
>= nqp
->s_rnr_timeout
) {
100 qp
->s_rnr_timeout
-= nqp
->s_rnr_timeout
;
102 if (l
->next
== &dev
->rnrwait
) {
106 nqp
= list_entry(l
->next
, struct ipath_qp
,
110 nqp
->s_rnr_timeout
-= qp
->s_rnr_timeout
;
111 list_add(&qp
->timerwait
, l
);
113 spin_unlock(&dev
->pending_lock
);
117 * ipath_init_sge - Validate a RWQE and fill in the SGE state
122 int ipath_init_sge(struct ipath_qp
*qp
, struct ipath_rwqe
*wqe
,
123 u32
*lengthp
, struct ipath_sge_state
*ss
)
129 for (i
= j
= 0; i
< wqe
->num_sge
; i
++) {
130 if (wqe
->sg_list
[i
].length
== 0)
133 if (!ipath_lkey_ok(qp
, j
? &ss
->sg_list
[j
- 1] : &ss
->sge
,
134 &wqe
->sg_list
[i
], IB_ACCESS_LOCAL_WRITE
))
136 *lengthp
+= wqe
->sg_list
[i
].length
;
144 memset(&wc
, 0, sizeof(wc
));
145 wc
.wr_id
= wqe
->wr_id
;
146 wc
.status
= IB_WC_LOC_PROT_ERR
;
147 wc
.opcode
= IB_WC_RECV
;
149 /* Signal solicited completion event. */
150 ipath_cq_enter(to_icq(qp
->ibqp
.recv_cq
), &wc
, 1);
157 * ipath_get_rwqe - copy the next RWQE into the QP's RWQE
159 * @wr_id_only: update qp->r_wr_id only, not qp->r_sge
161 * Return 0 if no RWQE is available, otherwise return 1.
163 * Can be called from interrupt level.
165 int ipath_get_rwqe(struct ipath_qp
*qp
, int wr_id_only
)
169 struct ipath_rwq
*wq
;
170 struct ipath_srq
*srq
;
171 struct ipath_rwqe
*wqe
;
172 void (*handler
)(struct ib_event
*, void *);
177 srq
= to_isrq(qp
->ibqp
.srq
);
178 handler
= srq
->ibsrq
.event_handler
;
186 spin_lock_irqsave(&rq
->lock
, flags
);
187 if (!(ib_ipath_state_ops
[qp
->state
] & IPATH_PROCESS_RECV_OK
)) {
194 /* Validate tail before using it since it is user writable. */
195 if (tail
>= rq
->size
)
198 if (unlikely(tail
== wq
->head
)) {
202 /* Make sure entry is read after head index is read. */
204 wqe
= get_rwqe_ptr(rq
, tail
);
205 if (++tail
>= rq
->size
)
209 qp
->r_sge
.sg_list
= qp
->r_sg_list
;
210 } while (!ipath_init_sge(qp
, wqe
, &qp
->r_len
, &qp
->r_sge
));
211 qp
->r_wr_id
= wqe
->wr_id
;
215 set_bit(IPATH_R_WRID_VALID
, &qp
->r_aflags
);
220 * validate head pointer value and compute
221 * the number of remaining WQEs.
227 n
+= rq
->size
- tail
;
230 if (n
< srq
->limit
) {
234 spin_unlock_irqrestore(&rq
->lock
, flags
);
235 ev
.device
= qp
->ibqp
.device
;
236 ev
.element
.srq
= qp
->ibqp
.srq
;
237 ev
.event
= IB_EVENT_SRQ_LIMIT_REACHED
;
238 handler(&ev
, srq
->ibsrq
.srq_context
);
243 spin_unlock_irqrestore(&rq
->lock
, flags
);
249 * ipath_ruc_loopback - handle UC and RC lookback requests
250 * @sqp: the sending QP
252 * This is called from ipath_do_send() to
253 * forward a WQE addressed to the same HCA.
254 * Note that although we are single threaded due to the tasklet, we still
255 * have to protect against post_send(). We don't have to worry about
256 * receive interrupts since this is a connected protocol and all packets
257 * will pass through here.
259 static void ipath_ruc_loopback(struct ipath_qp
*sqp
)
261 struct ipath_ibdev
*dev
= to_idev(sqp
->ibqp
.device
);
263 struct ipath_swqe
*wqe
;
264 struct ipath_sge
*sge
;
269 enum ib_wc_status send_status
;
272 * Note that we check the responder QP state after
273 * checking the requester's state.
275 qp
= ipath_lookup_qpn(&dev
->qp_table
, sqp
->remote_qpn
);
277 spin_lock_irqsave(&sqp
->s_lock
, flags
);
279 /* Return if we are already busy processing a work request. */
280 if ((sqp
->s_flags
& (IPATH_S_BUSY
| IPATH_S_ANY_WAIT
)) ||
281 !(ib_ipath_state_ops
[sqp
->state
] & IPATH_PROCESS_OR_FLUSH_SEND
))
284 sqp
->s_flags
|= IPATH_S_BUSY
;
287 if (sqp
->s_last
== sqp
->s_head
)
289 wqe
= get_swqe_ptr(sqp
, sqp
->s_last
);
291 /* Return if it is not OK to start a new work reqeust. */
292 if (!(ib_ipath_state_ops
[sqp
->state
] & IPATH_PROCESS_NEXT_SEND_OK
)) {
293 if (!(ib_ipath_state_ops
[sqp
->state
] & IPATH_FLUSH_SEND
))
295 /* We are in the error state, flush the work request. */
296 send_status
= IB_WC_WR_FLUSH_ERR
;
301 * We can rely on the entry not changing without the s_lock
302 * being held until we update s_last.
303 * We increment s_cur to indicate s_last is in progress.
305 if (sqp
->s_last
== sqp
->s_cur
) {
306 if (++sqp
->s_cur
>= sqp
->s_size
)
309 spin_unlock_irqrestore(&sqp
->s_lock
, flags
);
311 if (!qp
|| !(ib_ipath_state_ops
[qp
->state
] & IPATH_PROCESS_RECV_OK
)) {
314 * For RC, the requester would timeout and retry so
315 * shortcut the timeouts and just signal too many retries.
317 if (sqp
->ibqp
.qp_type
== IB_QPT_RC
)
318 send_status
= IB_WC_RETRY_EXC_ERR
;
320 send_status
= IB_WC_SUCCESS
;
324 memset(&wc
, 0, sizeof wc
);
325 send_status
= IB_WC_SUCCESS
;
327 sqp
->s_sge
.sge
= wqe
->sg_list
[0];
328 sqp
->s_sge
.sg_list
= wqe
->sg_list
+ 1;
329 sqp
->s_sge
.num_sge
= wqe
->wr
.num_sge
;
330 sqp
->s_len
= wqe
->length
;
331 switch (wqe
->wr
.opcode
) {
332 case IB_WR_SEND_WITH_IMM
:
333 wc
.wc_flags
= IB_WC_WITH_IMM
;
334 wc
.ex
.imm_data
= wqe
->wr
.ex
.imm_data
;
337 if (!ipath_get_rwqe(qp
, 0))
341 case IB_WR_RDMA_WRITE_WITH_IMM
:
342 if (unlikely(!(qp
->qp_access_flags
& IB_ACCESS_REMOTE_WRITE
)))
344 wc
.wc_flags
= IB_WC_WITH_IMM
;
345 wc
.ex
.imm_data
= wqe
->wr
.ex
.imm_data
;
346 if (!ipath_get_rwqe(qp
, 1))
349 case IB_WR_RDMA_WRITE
:
350 if (unlikely(!(qp
->qp_access_flags
& IB_ACCESS_REMOTE_WRITE
)))
352 if (wqe
->length
== 0)
354 if (unlikely(!ipath_rkey_ok(qp
, &qp
->r_sge
, wqe
->length
,
355 wqe
->wr
.wr
.rdma
.remote_addr
,
356 wqe
->wr
.wr
.rdma
.rkey
,
357 IB_ACCESS_REMOTE_WRITE
)))
361 case IB_WR_RDMA_READ
:
362 if (unlikely(!(qp
->qp_access_flags
& IB_ACCESS_REMOTE_READ
)))
364 if (unlikely(!ipath_rkey_ok(qp
, &sqp
->s_sge
, wqe
->length
,
365 wqe
->wr
.wr
.rdma
.remote_addr
,
366 wqe
->wr
.wr
.rdma
.rkey
,
367 IB_ACCESS_REMOTE_READ
)))
369 qp
->r_sge
.sge
= wqe
->sg_list
[0];
370 qp
->r_sge
.sg_list
= wqe
->sg_list
+ 1;
371 qp
->r_sge
.num_sge
= wqe
->wr
.num_sge
;
374 case IB_WR_ATOMIC_CMP_AND_SWP
:
375 case IB_WR_ATOMIC_FETCH_AND_ADD
:
376 if (unlikely(!(qp
->qp_access_flags
& IB_ACCESS_REMOTE_ATOMIC
)))
378 if (unlikely(!ipath_rkey_ok(qp
, &qp
->r_sge
, sizeof(u64
),
379 wqe
->wr
.wr
.atomic
.remote_addr
,
380 wqe
->wr
.wr
.atomic
.rkey
,
381 IB_ACCESS_REMOTE_ATOMIC
)))
383 /* Perform atomic OP and save result. */
384 maddr
= (atomic64_t
*) qp
->r_sge
.sge
.vaddr
;
385 sdata
= wqe
->wr
.wr
.atomic
.compare_add
;
386 *(u64
*) sqp
->s_sge
.sge
.vaddr
=
387 (wqe
->wr
.opcode
== IB_WR_ATOMIC_FETCH_AND_ADD
) ?
388 (u64
) atomic64_add_return(sdata
, maddr
) - sdata
:
389 (u64
) cmpxchg((u64
*) qp
->r_sge
.sge
.vaddr
,
390 sdata
, wqe
->wr
.wr
.atomic
.swap
);
394 send_status
= IB_WC_LOC_QP_OP_ERR
;
398 sge
= &sqp
->s_sge
.sge
;
400 u32 len
= sqp
->s_len
;
402 if (len
> sge
->length
)
404 if (len
> sge
->sge_length
)
405 len
= sge
->sge_length
;
407 ipath_copy_sge(&qp
->r_sge
, sge
->vaddr
, len
);
410 sge
->sge_length
-= len
;
411 if (sge
->sge_length
== 0) {
412 if (--sqp
->s_sge
.num_sge
)
413 *sge
= *sqp
->s_sge
.sg_list
++;
414 } else if (sge
->length
== 0 && sge
->mr
!= NULL
) {
415 if (++sge
->n
>= IPATH_SEGSZ
) {
416 if (++sge
->m
>= sge
->mr
->mapsz
)
421 sge
->mr
->map
[sge
->m
]->segs
[sge
->n
].vaddr
;
423 sge
->mr
->map
[sge
->m
]->segs
[sge
->n
].length
;
428 if (!test_and_clear_bit(IPATH_R_WRID_VALID
, &qp
->r_aflags
))
431 if (wqe
->wr
.opcode
== IB_WR_RDMA_WRITE_WITH_IMM
)
432 wc
.opcode
= IB_WC_RECV_RDMA_WITH_IMM
;
434 wc
.opcode
= IB_WC_RECV
;
435 wc
.wr_id
= qp
->r_wr_id
;
436 wc
.status
= IB_WC_SUCCESS
;
437 wc
.byte_len
= wqe
->length
;
439 wc
.src_qp
= qp
->remote_qpn
;
440 wc
.slid
= qp
->remote_ah_attr
.dlid
;
441 wc
.sl
= qp
->remote_ah_attr
.sl
;
443 /* Signal completion event if the solicited bit is set. */
444 ipath_cq_enter(to_icq(qp
->ibqp
.recv_cq
), &wc
,
445 wqe
->wr
.send_flags
& IB_SEND_SOLICITED
);
448 spin_lock_irqsave(&sqp
->s_lock
, flags
);
450 sqp
->s_rnr_retry
= sqp
->s_rnr_retry_cnt
;
451 ipath_send_complete(sqp
, wqe
, send_status
);
456 if (qp
->ibqp
.qp_type
== IB_QPT_UC
)
459 * Note: we don't need the s_lock held since the BUSY flag
460 * makes this single threaded.
462 if (sqp
->s_rnr_retry
== 0) {
463 send_status
= IB_WC_RNR_RETRY_EXC_ERR
;
466 if (sqp
->s_rnr_retry_cnt
< 7)
468 spin_lock_irqsave(&sqp
->s_lock
, flags
);
469 if (!(ib_ipath_state_ops
[sqp
->state
] & IPATH_PROCESS_RECV_OK
))
471 sqp
->s_flags
|= IPATH_S_WAITING
;
473 sqp
->s_rnr_timeout
= ib_ipath_rnr_table
[qp
->r_min_rnr_timer
];
474 ipath_insert_rnr_queue(sqp
);
478 send_status
= IB_WC_REM_INV_REQ_ERR
;
479 wc
.status
= IB_WC_LOC_QP_OP_ERR
;
483 send_status
= IB_WC_REM_ACCESS_ERR
;
484 wc
.status
= IB_WC_LOC_PROT_ERR
;
486 /* responder goes to error state */
487 ipath_rc_error(qp
, wc
.status
);
490 spin_lock_irqsave(&sqp
->s_lock
, flags
);
491 ipath_send_complete(sqp
, wqe
, send_status
);
492 if (sqp
->ibqp
.qp_type
== IB_QPT_RC
) {
493 int lastwqe
= ipath_error_qp(sqp
, IB_WC_WR_FLUSH_ERR
);
495 sqp
->s_flags
&= ~IPATH_S_BUSY
;
496 spin_unlock_irqrestore(&sqp
->s_lock
, flags
);
500 ev
.device
= sqp
->ibqp
.device
;
501 ev
.element
.qp
= &sqp
->ibqp
;
502 ev
.event
= IB_EVENT_QP_LAST_WQE_REACHED
;
503 sqp
->ibqp
.event_handler(&ev
, sqp
->ibqp
.qp_context
);
508 sqp
->s_flags
&= ~IPATH_S_BUSY
;
510 spin_unlock_irqrestore(&sqp
->s_lock
, flags
);
512 if (qp
&& atomic_dec_and_test(&qp
->refcount
))
516 static void want_buffer(struct ipath_devdata
*dd
, struct ipath_qp
*qp
)
518 if (!(dd
->ipath_flags
& IPATH_HAS_SEND_DMA
) ||
519 qp
->ibqp
.qp_type
== IB_QPT_SMI
) {
522 spin_lock_irqsave(&dd
->ipath_sendctrl_lock
, flags
);
523 dd
->ipath_sendctrl
|= INFINIPATH_S_PIOINTBUFAVAIL
;
524 ipath_write_kreg(dd
, dd
->ipath_kregs
->kr_sendctrl
,
526 ipath_read_kreg64(dd
, dd
->ipath_kregs
->kr_scratch
);
527 spin_unlock_irqrestore(&dd
->ipath_sendctrl_lock
, flags
);
532 * ipath_no_bufs_available - tell the layer driver we need buffers
533 * @qp: the QP that caused the problem
534 * @dev: the device we ran out of buffers on
536 * Called when we run out of PIO buffers.
537 * If we are now in the error state, return zero to flush the
540 static int ipath_no_bufs_available(struct ipath_qp
*qp
,
541 struct ipath_ibdev
*dev
)
547 * Note that as soon as want_buffer() is called and
548 * possibly before it returns, ipath_ib_piobufavail()
549 * could be called. Therefore, put QP on the piowait list before
550 * enabling the PIO avail interrupt.
552 spin_lock_irqsave(&qp
->s_lock
, flags
);
553 if (ib_ipath_state_ops
[qp
->state
] & IPATH_PROCESS_SEND_OK
) {
555 qp
->s_flags
|= IPATH_S_WAITING
;
556 qp
->s_flags
&= ~IPATH_S_BUSY
;
557 spin_lock(&dev
->pending_lock
);
558 if (list_empty(&qp
->piowait
))
559 list_add_tail(&qp
->piowait
, &dev
->piowait
);
560 spin_unlock(&dev
->pending_lock
);
563 spin_unlock_irqrestore(&qp
->s_lock
, flags
);
565 want_buffer(dev
->dd
, qp
);
570 * ipath_make_grh - construct a GRH header
571 * @dev: a pointer to the ipath device
572 * @hdr: a pointer to the GRH header being constructed
573 * @grh: the global route address to send to
574 * @hwords: the number of 32 bit words of header being sent
575 * @nwords: the number of 32 bit words of data being sent
577 * Return the size of the header in 32 bit words.
579 u32
ipath_make_grh(struct ipath_ibdev
*dev
, struct ib_grh
*hdr
,
580 struct ib_global_route
*grh
, u32 hwords
, u32 nwords
)
582 hdr
->version_tclass_flow
=
583 cpu_to_be32((6 << 28) |
584 (grh
->traffic_class
<< 20) |
586 hdr
->paylen
= cpu_to_be16((hwords
- 2 + nwords
+ SIZE_OF_CRC
) << 2);
587 /* next_hdr is defined by C8-7 in ch. 8.4.1 */
588 hdr
->next_hdr
= 0x1B;
589 hdr
->hop_limit
= grh
->hop_limit
;
590 /* The SGID is 32-bit aligned. */
591 hdr
->sgid
.global
.subnet_prefix
= dev
->gid_prefix
;
592 hdr
->sgid
.global
.interface_id
= dev
->dd
->ipath_guid
;
593 hdr
->dgid
= grh
->dgid
;
595 /* GRH header size in 32-bit words. */
596 return sizeof(struct ib_grh
) / sizeof(u32
);
599 void ipath_make_ruc_header(struct ipath_ibdev
*dev
, struct ipath_qp
*qp
,
600 struct ipath_other_headers
*ohdr
,
607 /* Construct the header. */
608 extra_bytes
= -qp
->s_cur_size
& 3;
609 nwords
= (qp
->s_cur_size
+ extra_bytes
) >> 2;
610 lrh0
= IPATH_LRH_BTH
;
611 if (unlikely(qp
->remote_ah_attr
.ah_flags
& IB_AH_GRH
)) {
612 qp
->s_hdrwords
+= ipath_make_grh(dev
, &qp
->s_hdr
.u
.l
.grh
,
613 &qp
->remote_ah_attr
.grh
,
614 qp
->s_hdrwords
, nwords
);
615 lrh0
= IPATH_LRH_GRH
;
617 lrh0
|= qp
->remote_ah_attr
.sl
<< 4;
618 qp
->s_hdr
.lrh
[0] = cpu_to_be16(lrh0
);
619 qp
->s_hdr
.lrh
[1] = cpu_to_be16(qp
->remote_ah_attr
.dlid
);
620 qp
->s_hdr
.lrh
[2] = cpu_to_be16(qp
->s_hdrwords
+ nwords
+ SIZE_OF_CRC
);
621 qp
->s_hdr
.lrh
[3] = cpu_to_be16(dev
->dd
->ipath_lid
|
622 qp
->remote_ah_attr
.src_path_bits
);
623 bth0
|= ipath_get_pkey(dev
->dd
, qp
->s_pkey_index
);
624 bth0
|= extra_bytes
<< 20;
625 ohdr
->bth
[0] = cpu_to_be32(bth0
| (1 << 22));
626 ohdr
->bth
[1] = cpu_to_be32(qp
->remote_qpn
);
627 ohdr
->bth
[2] = cpu_to_be32(bth2
);
631 * ipath_do_send - perform a send on a QP
632 * @data: contains a pointer to the QP
634 * Process entries in the send work queue until credit or queue is
635 * exhausted. Only allow one CPU to send a packet per QP (tasklet).
636 * Otherwise, two threads could send packets out of order.
638 void ipath_do_send(unsigned long data
)
640 struct ipath_qp
*qp
= (struct ipath_qp
*)data
;
641 struct ipath_ibdev
*dev
= to_idev(qp
->ibqp
.device
);
642 int (*make_req
)(struct ipath_qp
*qp
);
645 if ((qp
->ibqp
.qp_type
== IB_QPT_RC
||
646 qp
->ibqp
.qp_type
== IB_QPT_UC
) &&
647 qp
->remote_ah_attr
.dlid
== dev
->dd
->ipath_lid
) {
648 ipath_ruc_loopback(qp
);
652 if (qp
->ibqp
.qp_type
== IB_QPT_RC
)
653 make_req
= ipath_make_rc_req
;
654 else if (qp
->ibqp
.qp_type
== IB_QPT_UC
)
655 make_req
= ipath_make_uc_req
;
657 make_req
= ipath_make_ud_req
;
659 spin_lock_irqsave(&qp
->s_lock
, flags
);
661 /* Return if we are already busy processing a work request. */
662 if ((qp
->s_flags
& (IPATH_S_BUSY
| IPATH_S_ANY_WAIT
)) ||
663 !(ib_ipath_state_ops
[qp
->state
] & IPATH_PROCESS_OR_FLUSH_SEND
)) {
664 spin_unlock_irqrestore(&qp
->s_lock
, flags
);
668 qp
->s_flags
|= IPATH_S_BUSY
;
670 spin_unlock_irqrestore(&qp
->s_lock
, flags
);
673 /* Check for a constructed packet to be sent. */
674 if (qp
->s_hdrwords
!= 0) {
676 * If no PIO bufs are available, return. An interrupt will
677 * call ipath_ib_piobufavail() when one is available.
679 if (ipath_verbs_send(qp
, &qp
->s_hdr
, qp
->s_hdrwords
,
680 qp
->s_cur_sge
, qp
->s_cur_size
)) {
681 if (ipath_no_bufs_available(qp
, dev
))
684 dev
->n_unicast_xmit
++;
685 /* Record that we sent the packet and s_hdr is empty. */
696 * This should be called with s_lock held.
698 void ipath_send_complete(struct ipath_qp
*qp
, struct ipath_swqe
*wqe
,
699 enum ib_wc_status status
)
703 if (!(ib_ipath_state_ops
[qp
->state
] & IPATH_PROCESS_OR_FLUSH_SEND
))
706 /* See ch. 11.2.4.1 and 10.7.3.1 */
707 if (!(qp
->s_flags
& IPATH_S_SIGNAL_REQ_WR
) ||
708 (wqe
->wr
.send_flags
& IB_SEND_SIGNALED
) ||
709 status
!= IB_WC_SUCCESS
) {
712 memset(&wc
, 0, sizeof wc
);
713 wc
.wr_id
= wqe
->wr
.wr_id
;
715 wc
.opcode
= ib_ipath_wc_opcode
[wqe
->wr
.opcode
];
717 if (status
== IB_WC_SUCCESS
)
718 wc
.byte_len
= wqe
->length
;
719 ipath_cq_enter(to_icq(qp
->ibqp
.send_cq
), &wc
,
720 status
!= IB_WC_SUCCESS
);
723 old_last
= last
= qp
->s_last
;
724 if (++last
>= qp
->s_size
)
727 if (qp
->s_cur
== old_last
)
729 if (qp
->s_tail
== old_last
)
731 if (qp
->state
== IB_QPS_SQD
&& last
== qp
->s_cur
)