Lines Matching refs:entries
744 int entries, u32 **cqb,
772 entries * ucmd.cqe_size,
787 (long long)ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
846 int entries, int cqe_size,
861 err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
913 int entries = attr->cqe;
927 if (entries < 0 ||
928 (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))))
934 entries = roundup_pow_of_two(entries + 1);
935 if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)))
942 cq->ibcq.cqe = entries - 1;
952 err = create_cq_user(dev, udata, context, cq, entries,
958 err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
974 MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
1057 * adds new entries after this loop -- the QP we're worried
1058 * about is already in RESET, so the new entries won't come
1065 /* Now sweep backwards through the CQ, removing CQ entries
1066 * that match our QP by copying older entries on top of them.
1123 int entries, struct ib_udata *udata, int *npas,
1140 if (ucmd.cqe_size && SIZE_MAX / ucmd.cqe_size <= entries - 1)
1144 (size_t)ucmd.cqe_size * entries,
1166 int entries, int cqe_size)
1174 err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
1249 int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
1268 if (entries < 1 ||
1269 entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))) {
1270 mlx5_ib_warn(dev, "wrong entries number %d, max %d\n",
1271 entries,
1276 entries = roundup_pow_of_two(entries + 1);
1277 if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)) + 1)
1280 if (entries == ibcq->cqe + 1)
1285 err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
1289 err = resize_kernel(dev, cq, entries, cqe_size);
1326 MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
1336 cq->ibcq.cqe = entries - 1;
1355 cq->ibcq.cqe = entries - 1;