Lines Matching defs:nreq
2925 static int mlx5_wq_overflow(struct mlx5_ib_wq *wq, int nreq, struct ib_cq *ib_cq)
2931 if (likely(cur + nreq < wq->max_post))
2939 return cur + nreq >= wq->max_post;
3759 int *size, int nreq)
3761 if (unlikely(mlx5_wq_overflow(&qp->sq, nreq, qp->ibqp.send_cq)))
3784 int nreq, u8 fence, u8 next_fence,
3799 qp->sq.wqe_head[idx] = qp->sq.head + nreq;
3824 int nreq;
3841 nreq = 0;
3845 for (nreq = 0; wr; nreq++, wr = wr->next) {
3862 err = begin_wqe(qp, &seg, &ctrl, wr, &idx, &size, nreq);
3928 nreq, get_fence(fence, wr),
3937 &idx, &size, nreq);
3955 nreq, get_fence(fence, wr),
3958 &idx, &size, nreq);
3977 nreq, get_fence(fence, wr),
4083 finish_wqe(qp, ctrl, size, idx, wr->wr_id, nreq,
4092 if (likely(nreq)) {
4093 qp->sq.head += nreq;
4112 if (0 && nreq == 1 && bf->uuarn && inl && size > 1 && size <= bf->buf_size / 16) {
4150 int nreq;
4162 nreq = 0;
4168 for (nreq = 0; wr; nreq++, wr = wr->next) {
4169 if (mlx5_wq_overflow(&qp->rq, nreq, qp->ibqp.recv_cq)) {
4205 if (likely(nreq)) {
4206 qp->rq.head += nreq;