1813 static int mlx5_wq_overflow(struct mlx5_ib_wq *wq, int nreq, struct ib_cq *ib_cq)  in mlx5_wq_overflow()  argument
1819 	if (likely(cur + nreq < wq->max_post))  in mlx5_wq_overflow()
1827 	return cur + nreq >= wq->max_post;  in mlx5_wq_overflow()
2537 		     int *size, int nreq)  in begin_wqe()  argument
2541 	if (unlikely(mlx5_wq_overflow(&qp->sq, nreq, qp->ibqp.send_cq))) {  in begin_wqe()
2566 		       int nreq, u8 fence, u8 next_fence,  in finish_wqe()  argument
2581 	qp->sq.wqe_head[idx] = qp->sq.head + nreq;  in finish_wqe()
2605 	int nreq;  in mlx5_ib_post_send()  local
2612 	for (nreq = 0; wr; nreq++, wr = wr->next) {  in mlx5_ib_post_send()
2629 		err = begin_wqe(qp, &seg, &ctrl, wr, &idx, &size, nreq);  in mlx5_ib_post_send()
2695 					   nreq, get_fence(fence, wr),  in mlx5_ib_post_send()
2704 						&idx, &size, nreq);  in mlx5_ib_post_send()
2722 					   nreq, get_fence(fence, wr),  in mlx5_ib_post_send()
2725 						&idx, &size, nreq);  in mlx5_ib_post_send()
2744 					   nreq, get_fence(fence, wr),  in mlx5_ib_post_send()
2829 		finish_wqe(qp, ctrl, size, idx, wr->wr_id, nreq,  in mlx5_ib_post_send()
2838 	if (likely(nreq)) {  in mlx5_ib_post_send()
2839 		qp->sq.head += nreq;  in mlx5_ib_post_send()
2858 		if (0 && nreq == 1 && bf->uuarn && inl && size > 1 && size <= bf->buf_size / 16) {  in mlx5_ib_post_send()
2894 	int nreq;  in mlx5_ib_post_recv()  local
2902 	for (nreq = 0; wr; nreq++, wr = wr->next) {  in mlx5_ib_post_recv()
2903 		if (mlx5_wq_overflow(&qp->rq, nreq, qp->ibqp.recv_cq)) {  in mlx5_ib_post_recv()
2939 	if (likely(nreq)) {  in mlx5_ib_post_recv()
2940 		qp->rq.head += nreq;  in mlx5_ib_post_recv()