Lines Matching defs:entries

746 			  struct mlx5_ib_cq *cq, int entries, u32 **cqb,
776 				   entries * ucmd.cqe_size,
791 		    (long long)ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
854 			    int entries, int cqe_size,
869 	err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
920 	int entries = attr->cqe;
934 	if (entries < 0 ||
935 	    (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))))
941 	entries = roundup_pow_of_two(entries + 1);
942 	if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)))
945 	cq->ibcq.cqe = entries - 1;
955 		err = create_cq_user(dev, udata, cq, entries, &cqb, &cqe_size,
961 		err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
977 	MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
1047 	 * adds new entries after this loop -- the QP we're worried
1048 	 * about is already in RESET, so the new entries won't come
1055 	/* Now sweep backwards through the CQ, removing CQ entries
1056 	 * that match our QP by copying older entries on top of them.
1113 		       int entries, struct ib_udata *udata, int *npas,
1130 	if (ucmd.cqe_size && SIZE_MAX / ucmd.cqe_size <= entries - 1)
1134 			   (size_t)ucmd.cqe_size * entries,
1156 			 int entries, int cqe_size)
1164 	err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
1239 int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
1258 	if (entries < 1 ||
1259 	    entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))) {
1260 		mlx5_ib_warn(dev, "wrong entries number %d, max %d\n",
1261 			     entries,
1266 	entries = roundup_pow_of_two(entries + 1);
1267 	if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)) + 1)
1270 	if (entries == ibcq->cqe + 1)
1275 		err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
1279 		err = resize_kernel(dev, cq, entries, cqe_size);
1316 	MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
1326 		cq->ibcq.cqe = entries - 1;
1345 		cq->ibcq.cqe = entries - 1;