virtio_ring.h 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183
  1. #ifndef _LINUX_VIRTIO_RING_H
  2. #define _LINUX_VIRTIO_RING_H
  3. /* An interface for efficient virtio implementation, currently for use by KVM
  4. * and lguest, but hopefully others soon. Do NOT change this since it will
  5. * break existing servers and clients.
  6. *
  7. * This header is BSD licensed so anyone can use the definitions to implement
  8. * compatible drivers/servers.
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in the
  17. * documentation and/or other materials provided with the distribution.
  18. * 3. Neither the name of IBM nor the names of its contributors
  19. * may be used to endorse or promote products derived from this software
  20. * without specific prior written permission.
  21. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND
  22. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL IBM OR CONTRIBUTORS BE LIABLE
  25. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31. * SUCH DAMAGE.
  32. *
  33. * Copyright Rusty Russell IBM Corporation 2007. */
  34. #include <linux/types.h>
  35. /* This marks a buffer as continuing via the next field. */
  36. #define VRING_DESC_F_NEXT 1
  37. /* This marks a buffer as write-only (otherwise read-only). */
  38. #define VRING_DESC_F_WRITE 2
  39. /* This means the buffer contains a list of buffer descriptors. */
  40. #define VRING_DESC_F_INDIRECT 4
  41. /* The Host uses this in used->flags to advise the Guest: don't kick me when
  42. * you add a buffer. It's unreliable, so it's simply an optimization. Guest
  43. * will still kick if it's out of buffers. */
  44. #define VRING_USED_F_NO_NOTIFY 1
  45. /* The Guest uses this in avail->flags to advise the Host: don't interrupt me
  46. * when you consume a buffer. It's unreliable, so it's simply an
  47. * optimization. */
  48. #define VRING_AVAIL_F_NO_INTERRUPT 1
  49. /* We support indirect buffer descriptors */
  50. #define VIRTIO_RING_F_INDIRECT_DESC 28
  51. /* The Guest publishes the used index for which it expects an interrupt
  52. * at the end of the avail ring. Host should ignore the avail->flags field. */
  53. /* The Host publishes the avail index for which it expects a kick
  54. * at the end of the used ring. Guest should ignore the used->flags field. */
  55. #define VIRTIO_RING_F_EVENT_IDX 29
  56. /* Virtio ring descriptors: 16 bytes. These can chain together via "next". */
  57. struct vring_desc {
  58. /* Address (guest-physical). */
  59. __u64 addr;
  60. /* Length. */
  61. __u32 len;
  62. /* The flags as indicated above. */
  63. __u16 flags;
  64. /* We chain unused descriptors via this, too */
  65. __u16 next;
  66. };
  67. struct vring_avail {
  68. __u16 flags;
  69. __u16 idx;
  70. __u16 ring[];
  71. };
  72. /* u32 is used here for ids for padding reasons. */
  73. struct vring_used_elem {
  74. /* Index of start of used descriptor chain. */
  75. __u32 id;
  76. /* Total length of the descriptor chain which was used (written to) */
  77. __u32 len;
  78. };
  79. struct vring_used {
  80. __u16 flags;
  81. __u16 idx;
  82. struct vring_used_elem ring[];
  83. };
  84. struct vring {
  85. unsigned int num;
  86. struct vring_desc *desc;
  87. struct vring_avail *avail;
  88. struct vring_used *used;
  89. };
  90. /* The standard layout for the ring is a continuous chunk of memory which looks
  91. * like this. We assume num is a power of 2.
  92. *
  93. * struct vring
  94. * {
  95. * // The actual descriptors (16 bytes each)
  96. * struct vring_desc desc[num];
  97. *
  98. * // A ring of available descriptor heads with free-running index.
  99. * __u16 avail_flags;
  100. * __u16 avail_idx;
  101. * __u16 available[num];
  102. * __u16 used_event_idx;
  103. *
  104. * // Padding to the next align boundary.
  105. * char pad[];
  106. *
  107. * // A ring of used descriptor heads with free-running index.
  108. * __u16 used_flags;
  109. * __u16 used_idx;
  110. * struct vring_used_elem used[num];
  111. * __u16 avail_event_idx;
  112. * };
  113. */
  114. /* We publish the used event index at the end of the available ring, and vice
  115. * versa. They are at the end for backwards compatibility. */
  116. #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
  117. #define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])
  118. static inline void vring_init(struct vring *vr, unsigned int num, void *p,
  119. unsigned long align)
  120. {
  121. vr->num = num;
  122. vr->desc = p;
  123. vr->avail = p + num*sizeof(struct vring_desc);
  124. vr->used = (void *)(((unsigned long)&vr->avail->ring[num] + sizeof(__u16)
  125. + align-1) & ~(align - 1));
  126. }
  127. static inline unsigned vring_size(unsigned int num, unsigned long align)
  128. {
  129. return ((sizeof(struct vring_desc) * num + sizeof(__u16) * (3 + num)
  130. + align - 1) & ~(align - 1))
  131. + sizeof(__u16) * 3 + sizeof(struct vring_used_elem) * num;
  132. }
  133. /* The following is used with USED_EVENT_IDX and AVAIL_EVENT_IDX */
  134. /* Assuming a given event_idx value from the other size, if
  135. * we have just incremented index from old to new_idx,
  136. * should we trigger an event? */
  137. static inline int vring_need_event(__u16 event_idx, __u16 new_idx, __u16 old)
  138. {
  139. /* Note: Xen has similar logic for notification hold-off
  140. * in include/xen/interface/io/ring.h with req_event and req_prod
  141. * corresponding to event_idx + 1 and new_idx respectively.
  142. * Note also that req_event and req_prod in Xen start at 1,
  143. * event indexes in virtio start at 0. */
  144. return (__u16)(new_idx - event_idx - 1) < (__u16)(new_idx - old);
  145. }
  146. #ifdef __KERNEL__
  147. #include <linux/irqreturn.h>
  148. struct virtio_device;
  149. struct virtqueue;
  150. struct virtqueue *vring_new_virtqueue(unsigned int num,
  151. unsigned int vring_align,
  152. struct virtio_device *vdev,
  153. bool weak_barriers,
  154. void *pages,
  155. void (*notify)(struct virtqueue *vq),
  156. void (*callback)(struct virtqueue *vq),
  157. const char *name);
  158. void vring_del_virtqueue(struct virtqueue *vq);
  159. /* Filter out transport-specific feature bits. */
  160. void vring_transport_features(struct virtio_device *vdev);
  161. irqreturn_t vring_interrupt(int irq, void *_vq);
  162. #endif /* __KERNEL__ */
  163. #endif /* _LINUX_VIRTIO_RING_H */