Lines Matching refs:entries
166 struct ib_cq *mlx4_ib_create_cq(struct ib_device *ibdev, int entries, int vector,
175 if (entries < 1 || entries > dev->dev->caps.max_cqes)
182 entries = roundup_pow_of_two(entries + 1);
183 cq->ibcq.cqe = entries - 1;
198 ucmd.buf_addr, entries);
218 err = mlx4_ib_alloc_cq_buf(dev, &cq->buf, entries);
225 err = mlx4_cq_alloc(dev->dev, entries, &cq->buf.mtt, uar,
264 int entries)
275 err = mlx4_ib_alloc_cq_buf(dev, &cq->resize_buf->buf, entries);
282 cq->resize_buf->cqe = entries - 1;
288 int entries, struct ib_udata *udata)
304 &cq->resize_umem, ucmd.buf_addr, entries);
311 cq->resize_buf->cqe = entries - 1;
345 int mlx4_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
355 if (entries < 1 || entries > dev->dev->caps.max_cqes) {
360 entries = roundup_pow_of_two(entries + 1);
361 if (entries == ibcq->cqe + 1) {
367 err = mlx4_alloc_resize_umem(dev, cq, entries, udata);
373 if (entries < outst_cqe + 1) {
378 err = mlx4_alloc_resize_buf(dev, cq, entries);
385 err = mlx4_cq_resize(dev->dev, &cq->mcq, entries, &cq->resize_buf->buf.mtt);
771 * adds new entries after this loop -- the QP we're worried
772 * about is already in RESET, so the new entries won't come
780 * Now sweep backwards through the CQ, removing CQ entries
781 * that match our QP by copying older entries on top of them.