virtio_ring.h 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  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 <stdint.h>
  35. #include <linux/types.h>
  36. #include <linux/virtio_types.h>
  37. /* This marks a buffer as continuing via the next field. */
  38. #define VRING_DESC_F_NEXT 1
  39. /* This marks a buffer as write-only (otherwise read-only). */
  40. #define VRING_DESC_F_WRITE 2
  41. /* This means the buffer contains a list of buffer descriptors. */
  42. #define VRING_DESC_F_INDIRECT 4
  43. /* The Host uses this in used->flags to advise the Guest: don't kick me when
  44. * you add a buffer. It's unreliable, so it's simply an optimization. Guest
  45. * will still kick if it's out of buffers. */
  46. #define VRING_USED_F_NO_NOTIFY 1
  47. /* The Guest uses this in avail->flags to advise the Host: don't interrupt me
  48. * when you consume a buffer. It's unreliable, so it's simply an
  49. * optimization. */
  50. #define VRING_AVAIL_F_NO_INTERRUPT 1
  51. /* We support indirect buffer descriptors */
  52. #define VIRTIO_RING_F_INDIRECT_DESC 28
  53. /* The Guest publishes the used index for which it expects an interrupt
  54. * at the end of the avail ring. Host should ignore the avail->flags field. */
  55. /* The Host publishes the avail index for which it expects a kick
  56. * at the end of the used ring. Guest should ignore the used->flags field. */
  57. #define VIRTIO_RING_F_EVENT_IDX 29
  58. /* Virtio ring descriptors: 16 bytes. These can chain together via "next". */
  59. struct vring_desc {
  60. /* Address (guest-physical). */
  61. __virtio64 addr;
  62. /* Length. */
  63. __virtio32 len;
  64. /* The flags as indicated above. */
  65. __virtio16 flags;
  66. /* We chain unused descriptors via this, too */
  67. __virtio16 next;
  68. };
  69. struct vring_avail {
  70. __virtio16 flags;
  71. __virtio16 idx;
  72. __virtio16 ring[];
  73. };
  74. /* u32 is used here for ids for padding reasons. */
  75. struct vring_used_elem {
  76. /* Index of start of used descriptor chain. */
  77. __virtio32 id;
  78. /* Total length of the descriptor chain which was used (written to) */
  79. __virtio32 len;
  80. };
  81. struct vring_used {
  82. __virtio16 flags;
  83. __virtio16 idx;
  84. struct vring_used_elem ring[];
  85. };
  86. struct vring {
  87. unsigned int num;
  88. struct vring_desc *desc;
  89. struct vring_avail *avail;
  90. struct vring_used *used;
  91. };
  92. /* Alignment requirements for vring elements.
  93. * When using pre-virtio 1.0 layout, these fall out naturally.
  94. */
  95. #define VRING_AVAIL_ALIGN_SIZE 2
  96. #define VRING_USED_ALIGN_SIZE 4
  97. #define VRING_DESC_ALIGN_SIZE 16
  98. /* The standard layout for the ring is a continuous chunk of memory which looks
  99. * like this. We assume num is a power of 2.
  100. *
  101. * struct vring
  102. * {
  103. * // The actual descriptors (16 bytes each)
  104. * struct vring_desc desc[num];
  105. *
  106. * // A ring of available descriptor heads with free-running index.
  107. * __virtio16 avail_flags;
  108. * __virtio16 avail_idx;
  109. * __virtio16 available[num];
  110. * __virtio16 used_event_idx;
  111. *
  112. * // Padding to the next align boundary.
  113. * char pad[];
  114. *
  115. * // A ring of used descriptor heads with free-running index.
  116. * __virtio16 used_flags;
  117. * __virtio16 used_idx;
  118. * struct vring_used_elem used[num];
  119. * __virtio16 avail_event_idx;
  120. * };
  121. */
  122. /* We publish the used event index at the end of the available ring, and vice
  123. * versa. They are at the end for backwards compatibility. */
  124. #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
  125. #define vring_avail_event(vr) (*(__virtio16 *)&(vr)->used->ring[(vr)->num])
  126. static __inline__ void vring_init(struct vring *vr, unsigned int num, void *p,
  127. unsigned long align)
  128. {
  129. vr->num = num;
  130. vr->desc = p;
  131. vr->avail = p + num*sizeof(struct vring_desc);
  132. vr->used = (void *)(((uintptr_t)&vr->avail->ring[num] + sizeof(__virtio16)
  133. + align-1) & ~(align - 1));
  134. }
  135. static __inline__ unsigned vring_size(unsigned int num, unsigned long align)
  136. {
  137. return ((sizeof(struct vring_desc) * num + sizeof(__virtio16) * (3 + num)
  138. + align - 1) & ~(align - 1))
  139. + sizeof(__virtio16) * 3 + sizeof(struct vring_used_elem) * num;
  140. }
  141. /* The following is used with USED_EVENT_IDX and AVAIL_EVENT_IDX */
  142. /* Assuming a given event_idx value from the other side, if
  143. * we have just incremented index from old to new_idx,
  144. * should we trigger an event? */
  145. static __inline__ int vring_need_event(__u16 event_idx, __u16 new_idx, __u16 old)
  146. {
  147. /* Note: Xen has similar logic for notification hold-off
  148. * in include/xen/interface/io/ring.h with req_event and req_prod
  149. * corresponding to event_idx + 1 and new_idx respectively.
  150. * Note also that req_event and req_prod in Xen start at 1,
  151. * event indexes in virtio start at 0. */
  152. return (__u16)(new_idx - event_idx - 1) < (__u16)(new_idx - old);
  153. }
  154. #endif /* _LINUX_VIRTIO_RING_H */