Lines Matching defs:num
76 u16 num; /* Descriptor list length. */
143 unsigned int num;
451 WARN_ON_ONCE(total_sg > vq->split.vring.num && !vq->indirect);
546 avail = vq->split.avail_idx_shadow & (vq->split.vring.num - 1);
703 last_used = (vq->last_used_idx & (vq->split.vring.num - 1));
709 if (unlikely(i >= vq->split.vring.num)) {
826 for (i = 0; i < vq->split.vring.num; i++) {
839 BUG_ON(vq->vq.num_free != vq->split.vring.num);
847 unsigned int num,
863 /* We assume num is a power of 2. */
864 if (num & (num - 1)) {
865 dev_warn(&vdev->dev, "Bad virtqueue length %u\n", num);
870 for (; num && vring_size(num, vring_align) > PAGE_SIZE; num /= 2) {
871 queue = vring_alloc_queue(vdev, vring_size(num, vring_align),
880 if (!num)
885 queue = vring_alloc_queue(vdev, vring_size(num, vring_align),
891 queue_size_in_bytes = vring_size(num, vring_align);
892 vring_init(&vring, num, queue, vring_align);
1007 BUG_ON(id == vq->packed.vring.num);
1058 if (n >= vq->packed.vring.num) {
1069 vq->packed.desc_state[id].num = 1;
1138 WARN_ON_ONCE(total_sg > vq->packed.vring.num && !vq->indirect);
1152 BUG_ON(id == vq->packed.vring.num);
1184 if ((unlikely(++i >= vq->packed.vring.num))) {
1204 vq->packed.desc_state[id].num = descs_used;
1234 if (i >= vq->packed.vring.num)
1283 event_idx -= vq->packed.vring.num;
1305 vq->vq.num_free += state->num;
1309 for (i = 0; i < state->num; i++) {
1384 if (unlikely(id >= vq->packed.vring.num)) {
1397 vq->last_used_idx += vq->packed.desc_state[id].num;
1398 if (unlikely(vq->last_used_idx >= vq->packed.vring.num)) {
1399 vq->last_used_idx -= vq->packed.vring.num;
1495 bufs = (vq->packed.vring.num - vq->vq.num_free) * 3 / 4;
1499 if (used_idx >= vq->packed.vring.num) {
1500 used_idx -= vq->packed.vring.num;
1547 for (i = 0; i < vq->packed.vring.num; i++) {
1557 BUG_ON(vq->vq.num_free != vq->packed.vring.num);
1565 unsigned int num,
1582 ring_size_in_bytes = num * sizeof(struct vring_packed_desc);
1611 vq->vq.num_free = num;
1640 vq->packed.vring.num = num;
1651 vq->packed.desc_state = kmalloc_array(num,
1658 num * sizeof(struct vring_desc_state_packed));
1662 for (i = 0; i < num-1; i++)
1665 vq->packed.desc_extra = kmalloc_array(num,
1672 num * sizeof(struct vring_desc_extra_packed));
1761 * @num: the number of entries in @sg readable by other side
1771 struct scatterlist *sg, unsigned int num,
1775 return virtqueue_add(vq, &sg, num, 1, 0, data, NULL, gfp);
1783 * @num: the number of entries in @sg writable by other side
1793 struct scatterlist *sg, unsigned int num,
1797 return virtqueue_add(vq, &sg, num, 0, 1, data, NULL, gfp);
1805 * @num: the number of entries in @sg writable by other side
1816 struct scatterlist *sg, unsigned int num,
1821 return virtqueue_add(vq, &sg, num, 0, 1, data, ctx, gfp);
2091 vq->vq.num_free = vring.num;
2127 vq->split.desc_state = kmalloc_array(vring.num,
2136 for (i = 0; i < vring.num-1; i++)
2138 memset(vq->split.desc_state, 0, vring.num *
2150 unsigned int num,
2162 return vring_create_virtqueue_packed(index, num, vring_align,
2166 return vring_create_virtqueue_split(index, num, vring_align,
2174 unsigned int num,
2189 vring_init(&vring, num, pages, vring_align);
2273 return vq->packed_ring ? vq->packed.vring.num : vq->split.vring.num;