1*336f459cSPeter Grehan /*- 210b59a9bSPeter Grehan * Copyright Rusty Russell IBM Corporation 2007. 3*336f459cSPeter Grehan * 4*336f459cSPeter Grehan * This header is BSD licensed so anyone can use the definitions to implement 5*336f459cSPeter Grehan * compatible drivers/servers. 6*336f459cSPeter Grehan * 7*336f459cSPeter Grehan * Redistribution and use in source and binary forms, with or without 8*336f459cSPeter Grehan * modification, are permitted provided that the following conditions 9*336f459cSPeter Grehan * are met: 10*336f459cSPeter Grehan * 1. Redistributions of source code must retain the above copyright 11*336f459cSPeter Grehan * notice, this list of conditions and the following disclaimer. 12*336f459cSPeter Grehan * 2. Redistributions in binary form must reproduce the above copyright 13*336f459cSPeter Grehan * notice, this list of conditions and the following disclaimer in the 14*336f459cSPeter Grehan * documentation and/or other materials provided with the distribution. 15*336f459cSPeter Grehan * 3. Neither the name of IBM nor the names of its contributors 16*336f459cSPeter Grehan * may be used to endorse or promote products derived from this software 17*336f459cSPeter Grehan * without specific prior written permission. 18*336f459cSPeter Grehan * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19*336f459cSPeter Grehan * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 20*336f459cSPeter Grehan * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 21*336f459cSPeter Grehan * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL IBM OR CONTRIBUTORS BE LIABLE 22*336f459cSPeter Grehan * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23*336f459cSPeter Grehan * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24*336f459cSPeter Grehan * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25*336f459cSPeter Grehan * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26*336f459cSPeter Grehan * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27*336f459cSPeter Grehan * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28*336f459cSPeter Grehan * SUCH DAMAGE. 29*336f459cSPeter Grehan * 30*336f459cSPeter Grehan * $FreeBSD$ 3110b59a9bSPeter Grehan */ 3210b59a9bSPeter Grehan 3310b59a9bSPeter Grehan #ifndef VIRTIO_RING_H 3410b59a9bSPeter Grehan #define VIRTIO_RING_H 3510b59a9bSPeter Grehan 3610b59a9bSPeter Grehan #include <sys/types.h> 3710b59a9bSPeter Grehan 3810b59a9bSPeter Grehan /* This marks a buffer as continuing via the next field. */ 3910b59a9bSPeter Grehan #define VRING_DESC_F_NEXT 1 4010b59a9bSPeter Grehan /* This marks a buffer as write-only (otherwise read-only). */ 4110b59a9bSPeter Grehan #define VRING_DESC_F_WRITE 2 4210b59a9bSPeter Grehan /* This means the buffer contains a list of buffer descriptors. */ 4310b59a9bSPeter Grehan #define VRING_DESC_F_INDIRECT 4 4410b59a9bSPeter Grehan 4510b59a9bSPeter Grehan /* The Host uses this in used->flags to advise the Guest: don't kick me 4610b59a9bSPeter Grehan * when you add a buffer. It's unreliable, so it's simply an 4710b59a9bSPeter Grehan * optimization. Guest will still kick if it's out of buffers. */ 4810b59a9bSPeter Grehan #define VRING_USED_F_NO_NOTIFY 1 4910b59a9bSPeter Grehan /* The Guest uses this in avail->flags to advise the Host: don't 5010b59a9bSPeter Grehan * interrupt me when you consume a buffer. It's unreliable, so it's 5110b59a9bSPeter Grehan * simply an optimization. */ 5210b59a9bSPeter Grehan #define VRING_AVAIL_F_NO_INTERRUPT 1 5310b59a9bSPeter Grehan 5410b59a9bSPeter Grehan /* VirtIO ring descriptors: 16 bytes. 5510b59a9bSPeter Grehan * These can chain together via "next". */ 5610b59a9bSPeter Grehan struct vring_desc { 5710b59a9bSPeter Grehan /* Address (guest-physical). */ 5810b59a9bSPeter Grehan uint64_t addr; 5910b59a9bSPeter Grehan /* Length. */ 6010b59a9bSPeter Grehan uint32_t len; 6110b59a9bSPeter Grehan /* The flags as indicated above. */ 6210b59a9bSPeter Grehan uint16_t flags; 6310b59a9bSPeter Grehan /* We chain unused descriptors via this, too. */ 6410b59a9bSPeter Grehan uint16_t next; 6510b59a9bSPeter Grehan }; 6610b59a9bSPeter Grehan 6710b59a9bSPeter Grehan struct vring_avail { 6810b59a9bSPeter Grehan uint16_t flags; 6910b59a9bSPeter Grehan uint16_t idx; 7010b59a9bSPeter Grehan uint16_t ring[0]; 7110b59a9bSPeter Grehan }; 7210b59a9bSPeter Grehan 7310b59a9bSPeter Grehan /* uint32_t is used here for ids for padding reasons. */ 7410b59a9bSPeter Grehan struct vring_used_elem { 7510b59a9bSPeter Grehan /* Index of start of used descriptor chain. */ 7610b59a9bSPeter Grehan uint32_t id; 7710b59a9bSPeter Grehan /* Total length of the descriptor chain which was written to. */ 7810b59a9bSPeter Grehan uint32_t len; 7910b59a9bSPeter Grehan }; 8010b59a9bSPeter Grehan 8110b59a9bSPeter Grehan struct vring_used { 8210b59a9bSPeter Grehan uint16_t flags; 8310b59a9bSPeter Grehan uint16_t idx; 8410b59a9bSPeter Grehan struct vring_used_elem ring[0]; 8510b59a9bSPeter Grehan }; 8610b59a9bSPeter Grehan 8710b59a9bSPeter Grehan struct vring { 8810b59a9bSPeter Grehan unsigned int num; 8910b59a9bSPeter Grehan 9010b59a9bSPeter Grehan struct vring_desc *desc; 9110b59a9bSPeter Grehan struct vring_avail *avail; 9210b59a9bSPeter Grehan struct vring_used *used; 9310b59a9bSPeter Grehan }; 9410b59a9bSPeter Grehan 9510b59a9bSPeter Grehan /* The standard layout for the ring is a continuous chunk of memory which 9610b59a9bSPeter Grehan * looks like this. We assume num is a power of 2. 9710b59a9bSPeter Grehan * 9810b59a9bSPeter Grehan * struct vring { 9910b59a9bSPeter Grehan * // The actual descriptors (16 bytes each) 10010b59a9bSPeter Grehan * struct vring_desc desc[num]; 10110b59a9bSPeter Grehan * 10210b59a9bSPeter Grehan * // A ring of available descriptor heads with free-running index. 10310b59a9bSPeter Grehan * __u16 avail_flags; 10410b59a9bSPeter Grehan * __u16 avail_idx; 10510b59a9bSPeter Grehan * __u16 available[num]; 10610b59a9bSPeter Grehan * 10710b59a9bSPeter Grehan * // Padding to the next align boundary. 10810b59a9bSPeter Grehan * char pad[]; 10910b59a9bSPeter Grehan * 11010b59a9bSPeter Grehan * // A ring of used descriptor heads with free-running index. 11110b59a9bSPeter Grehan * __u16 used_flags; 11210b59a9bSPeter Grehan * __u16 used_idx; 11310b59a9bSPeter Grehan * struct vring_used_elem used[num]; 11410b59a9bSPeter Grehan * }; 11510b59a9bSPeter Grehan * 11610b59a9bSPeter Grehan * NOTE: for VirtIO PCI, align is 4096. 11710b59a9bSPeter Grehan */ 11810b59a9bSPeter Grehan 11910b59a9bSPeter Grehan static inline int 12010b59a9bSPeter Grehan vring_size(unsigned int num, unsigned long align) 12110b59a9bSPeter Grehan { 12210b59a9bSPeter Grehan int size; 12310b59a9bSPeter Grehan 12410b59a9bSPeter Grehan size = num * sizeof(struct vring_desc); 12510b59a9bSPeter Grehan size += sizeof(struct vring_avail) + (num * sizeof(uint16_t)); 12610b59a9bSPeter Grehan size = (size + align - 1) & ~(align - 1); 12710b59a9bSPeter Grehan size += sizeof(struct vring_used) + 12810b59a9bSPeter Grehan (num * sizeof(struct vring_used_elem)); 12910b59a9bSPeter Grehan return (size); 13010b59a9bSPeter Grehan } 13110b59a9bSPeter Grehan 13210b59a9bSPeter Grehan static inline void 13310b59a9bSPeter Grehan vring_init(struct vring *vr, unsigned int num, uint8_t *p, 13410b59a9bSPeter Grehan unsigned long align) 13510b59a9bSPeter Grehan { 13610b59a9bSPeter Grehan vr->num = num; 13710b59a9bSPeter Grehan vr->desc = (struct vring_desc *) p; 13810b59a9bSPeter Grehan vr->avail = (struct vring_avail *) (p + 13910b59a9bSPeter Grehan num * sizeof(struct vring_desc)); 14010b59a9bSPeter Grehan vr->used = (void *) 14110b59a9bSPeter Grehan (((unsigned long) &vr->avail->ring[num] + align-1) & ~(align-1)); 14210b59a9bSPeter Grehan } 14310b59a9bSPeter Grehan #endif /* VIRTIO_RING_H */ 144