From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:10:54
OK, here is the large patchset that implements the virtio spec update
that I sent earlier (the spec itself needs a minor update, will send
that out too next week, but I think we are on the same page here
already). It supercedes the PUBLISH_USED_IDX patches I sent
out earlier.
What will follow will be a patchset that actually includes 4 sets of
patches. I note below their status. Please consider for 2.6.40, at
least partially. Rusty, do you think it's feasible?
List of patches and what they do:
I) With the first patchset, we change virtio ring notification
hand-off to work like the one in Xen -
each side publishes an event index, the other one
notifies when it reaches that value -
With the one difference that event index starts at 0,
same as request index (in xen event index starts at 1).
These are the patches in this set:
virtio: event index interface
virtio ring: inline function to check for events
virtio_ring: support event idx feature
vhost: support event index
virtio_test: support event index
Changes in this part of the patchset from v1 - address comments by Rusty et al.
I tested this a lot with virtio net block and with the simulator and esp
with the simulator it's easy to see drastic performance improvement
here:
[virtio]# time ./virtio_test
spurious wakeus: 0x7
real 0m0.169s
user 0m0.140s
sys 0m0.019s
[virtio]# time ./virtio_test --no-event-idx
spurious wakeus: 0x11
real 0m0.649s
user 0m0.295s
sys 0m0.335s
And these patches are mostly unchanged from the very first version,
changes being almost exclusively code cleanups. So I consider this part
the most stable, I strongly think these patches should go into 2.6.40.
One extra reason besides performance is that maintaining
them out of tree is very painful as guest/host ABI is affected.
II) Second set of patches: new apis and use in virtio_net
With the indexes in place it becomes possibile to request an event after
many requests (and not just on the next one as done now). This shall fix
the TX queue overrun which currently triggers a storm of interrupts.
Another issue I tried to fix is capacity checks in virtio-net,
there's a new API for that, and on top of that,
I implemented a patch improving real-time characteristics
of virtio_net
Thus we get the second patchset:
virtio: add api for delayed callbacks
virtio_net: delay TX callbacks
virtio_ring: Add capacity check API
virtio_net: fix TX capacity checks using new API
virtio_net: limit xmit polling
This has some fixes that I posted previously applied,
but otherwise ideantical to v1. I tried to change API
for enable_cb_delayed as Rusty suggested but failed to do this.
I think it's not possible to define cleanly.
These work fine for me, I think they can be merged for 2.6.40
too but would be nice to hear back from Shirley, Tom, Krishna.
III) There's also a patch that adds a tweak to virtio ring
virtio: don't delay avail index update
This seems to help small message sizes where we are constantly draining
the RX VQ.
I'll need to benchmark this to be able to give any numbers
with confidence, but I don't see how it can hurt anything.
Thoughts?
IV) Last part is a set of patches to extend feature bits
to 64 bit. I tested this by using feature bit 32.
vhost: fix 64 bit features
virtio_test: update for 64 bit features
virtio: 64 bit features
It's nice to have as set I used up the last free bit.
But not a must now that a single bit controls
use of event index on both sides.
The patchset is on top of net-next which at the time
I last rebased was 15ecd03 - so roughly 2.6.39-rc2.
For testing I usually do merge v2.6.39 on top.
qemu patch is also ready. Code can be pulled from here:
git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git vhost-net-next-event-idx-v3
git://git.kernel.org/pub/scm/linux/kernel/git/mst/qemu-kvm.git virtio-net-event-idx-v3
Rusty, I think it will be easier to merge vhost and virtio bits in one
go. Can it all go in through your tree (Dave in the past acked
sending a very similar patch through you so should not be a problem)?
--
1.7.5.53.gc233e
Michael S. Tsirkin (13):
virtio: event index interface
virtio ring: inline function to check for events
virtio_ring: support event idx feature
vhost: support event index
virtio_test: support event index
virtio: add api for delayed callbacks
virtio_net: delay TX callbacks
virtio_net: fix TX capacity checks using new API
virtio_net: limit xmit polling
virtio: don't delay avail index update
virtio: 64 bit features
virtio_test: update for 64 bit features
vhost: fix 64 bit features
Shirley Ma (1):
virtio_ring: Add capacity check API
drivers/lguest/lguest_device.c | 8 +-
drivers/net/virtio_net.c | 27 +++++---
drivers/s390/kvm/kvm_virtio.c | 8 +-
drivers/vhost/net.c | 12 ++--
drivers/vhost/test.c | 6 +-
drivers/vhost/vhost.c | 138 ++++++++++++++++++++++++++++++----------
drivers/vhost/vhost.h | 29 +++++---
drivers/virtio/virtio.c | 8 +-
drivers/virtio/virtio_pci.c | 34 ++++++++--
drivers/virtio/virtio_ring.c | 87 ++++++++++++++++++++++---
include/linux/virtio.h | 16 ++++-
include/linux/virtio_config.h | 15 +++--
include/linux/virtio_pci.h | 9 ++-
include/linux/virtio_ring.h | 29 ++++++++-
tools/virtio/virtio_test.c | 27 +++++++-
15 files changed, 348 insertions(+), 105 deletions(-)
--
1.7.5.53.gc233e
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:10:44
Define a new feature bit for the guest and host to utilize
an event index (like Xen) instead if a flag bit to enable/disable
interrupts and kicks.
Signed-off-by: Michael S. Tsirkin <redacted>
---
include/linux/virtio_ring.h | 15 ++++++++++++++-
1 files changed, 14 insertions(+), 1 deletions(-)
@@ -29,6 +29,12 @@/* We support indirect buffer descriptors */#define VIRTIO_RING_F_INDIRECT_DESC 28+/* The Guest publishes the used index for which it expects an interrupt+*attheendoftheavailring.Hostshouldignoretheavail->flagsfield.*/+/* The Host publishes the avail index for which it expects a kick+*attheendoftheusedring.Guestshouldignoretheused->flagsfield.*/+#define VIRTIO_RING_F_EVENT_IDX 29+/* Virtio ring descriptors: 16 bytes. These can chain together via "next". */structvring_desc{/* Address (guest-physical). */
@@ -83,6 +89,7 @@ struct vring {*__u16avail_flags;*__u16avail_idx;*__u16available[num];+*__u16used_event_idx;**// Padding to the next align boundary.*charpad[];
@@ -91,8 +98,14 @@ struct vring {*__u16used_flags;*__u16used_idx;*structvring_used_elemused[num];+*__u16avail_event_idx;*};*/+/* We publish the used event index at the end of the available ring, and vice+*versa.Theyareattheendforbackwardscompatibility.*/+#define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])+#define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])+staticinlinevoidvring_init(structvring*vr,unsignedintnum,void*p,unsignedlongalign){
@@ -107,7 +120,7 @@ static inline unsigned vring_size(unsigned int num, unsigned long align){return((sizeof(structvring_desc)*num+sizeof(__u16)*(2+num)+align-1)&~(align-1))-+sizeof(__u16)*2+sizeof(structvring_used_elem)*num;++sizeof(__u16)*3+sizeof(structvring_used_elem)*num;}#ifdef __KERNEL__
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:11:17
With the new used_event and avail_event and features, both
host and guest need similar logic to check whether events are
enabled, so it helps to put the common code in the header.
Note that Xen has similar logic for notification hold-off
in include/xen/interface/io/ring.h with req_event and req_prod
corresponding to event_idx + 1 and new_idx respectively.
+1 comes from the fact that req_event and req_prod in Xen start at 1,
while event index in virtio starts at 0.
Signed-off-by: Michael S. Tsirkin <redacted>
---
include/linux/virtio_ring.h | 14 ++++++++++++++
1 files changed, 14 insertions(+), 0 deletions(-)
@@ -123,6 +123,20 @@ static inline unsigned vring_size(unsigned int num, unsigned long align)+sizeof(__u16)*3+sizeof(structvring_used_elem)*num;}+/* The following is used with USED_EVENT_IDX and AVAIL_EVENT_IDX */+/* Assuming a given event_idx value from the other size, if+*wehavejustincrementedindexfromoldtonew_idx,+*shouldwetriggeranevent?*/+staticinlineintvring_need_event(__u16event_idx,__u16new_idx,__u16old)+{+/* Note: Xen has similar logic for notification hold-off+*ininclude/xen/interface/io/ring.hwithreq_eventandreq_prod+*correspondingtoevent_idx+1andnew_idxrespectively.+*Notealsothatreq_eventandreq_prodinXenstartat1,+*eventindexesinvirtiostartat0.*/+return(__u16)(new_idx-event_idx-1)<(__u16)(new_idx-old);+}+#ifdef __KERNEL__#include<linux/irqreturn.h>structvirtio_device;
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:11:27
Support for the new event idx feature:
1. When enabling interrupts, publish the current avail index
value to the host to get interrupts on the next update.
2. Use the new avail_event feature to reduce the number
of exits from the guest.
Simple test with the simulator:
[virtio]# time ./virtio_test
spurious wakeus: 0x7
real 0m0.169s
user 0m0.140s
sys 0m0.019s
[virtio]# time ./virtio_test --no-event-idx
spurious wakeus: 0x11
real 0m0.649s
user 0m0.295s
sys 0m0.335s
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/virtio/virtio_ring.c | 26 ++++++++++++++++++++++++--
1 files changed, 24 insertions(+), 2 deletions(-)
@@ -82,6 +82,9 @@ struct vring_virtqueue/* Host supports indirect buffers */boolindirect;+/* Host publishes avail event idx */+boolevent;+/* Number of free buffers */unsignedintnum_free;/* Head of free buffer list. */
@@ -237,18 +240,22 @@ EXPORT_SYMBOL_GPL(virtqueue_add_buf_gfp);voidvirtqueue_kick(structvirtqueue*_vq){structvring_virtqueue*vq=to_vvq(_vq);+u16new,old;START_USE(vq);/* Descriptors and available array need to be set before we expose the*newavailablearrayentries.*/virtio_wmb();-vq->vring.avail->idx+=vq->num_added;+old=vq->vring.avail->idx;+new=vq->vring.avail->idx=old+vq->num_added;vq->num_added=0;/* Need to update avail index before checking if we should notify */virtio_mb();-if(!(vq->vring.used->flags&VRING_USED_F_NO_NOTIFY))+if(vq->event?+vring_need_event(vring_avail_event(&vq->vring),new,old):+!(vq->vring.used->flags&VRING_USED_F_NO_NOTIFY))/* Prod other side to tell it about changes. */vq->notify(&vq->vq);
@@ -324,6 +331,14 @@ void *virtqueue_get_buf(struct virtqueue *_vq, unsigned int *len)ret=vq->data[i];detach_buf(vq,i);vq->last_used_idx++;+/* If we expect an interrupt for the next entry, tell host+*bywritingeventindexandflushoutthewritebefore+*thereadinthenextget_bufcall.*/+if(!(vq->vring.avail->flags&VRING_AVAIL_F_NO_INTERRUPT)){+vring_used_event(&vq->vring)=vq->last_used_idx;+virtio_mb();+}+END_USE(vq);returnret;}
@@ -345,7 +360,11 @@ bool virtqueue_enable_cb(struct virtqueue *_vq)/* We optimistically turn back on interrupts, then check if there was*moretodo.*/+/* Depending on the VIRTIO_RING_F_EVENT_IDX feature, we need to+*eithercleartheflagsbitorpointtheeventindexatthenext+*entry.Alwaysdobothtokeepcodesimple.*/vq->vring.avail->flags&=~VRING_AVAIL_F_NO_INTERRUPT;+vring_used_event(&vq->vring)=vq->last_used_idx;virtio_mb();if(unlikely(more_used(vq))){END_USE(vq);
@@ -437,6 +456,7 @@ struct virtqueue *vring_new_virtqueue(unsigned int num,#endifvq->indirect=virtio_has_feature(vdev,VIRTIO_RING_F_INDIRECT_DESC);+vq->event=virtio_has_feature(vdev,VIRTIO_RING_F_EVENT_IDX);/* No callback? Tell other side not to bother us. */if(!callback)
@@ -471,6 +491,8 @@ void vring_transport_features(struct virtio_device *vdev)switch(i){caseVIRTIO_RING_F_INDIRECT_DESC:break;+caseVIRTIO_RING_F_EVENT_IDX:+break;default:/* We don't understand this bit. */clear_bit(i,vdev->features);
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:11:36
Add ability to test the new event idx feature,
enable by default.
---
tools/virtio/virtio_test.c | 19 +++++++++++++++++--
1 files changed, 17 insertions(+), 2 deletions(-)
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:11:42
Add an API that tells the other side that callbacks
should be delayed until a lot of work has been done.
Implement using the new event_idx feature.
Note: it might seem advantageous to let the drivers
ask for a callback after a specific capacity has
been reached. However, as a single head can
free many entries in the descriptor table,
we don't really have a clue about capacity
until get_buf is called. The API is the simplest
to implement at the moment, we'll see what kind of
hints drivers can pass when there's more than one
user of the feature.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/virtio/virtio_ring.c | 27 +++++++++++++++++++++++++++
include/linux/virtio.h | 9 +++++++++
2 files changed, 36 insertions(+), 0 deletions(-)
@@ -376,6 +376,33 @@ bool virtqueue_enable_cb(struct virtqueue *_vq)}EXPORT_SYMBOL_GPL(virtqueue_enable_cb);+boolvirtqueue_enable_cb_delayed(structvirtqueue*_vq)+{+structvring_virtqueue*vq=to_vvq(_vq);+u16bufs;++START_USE(vq);++/* We optimistically turn back on interrupts, then check if there was+*moretodo.*/+/* Depending on the VIRTIO_RING_F_USED_EVENT_IDX feature, we need to+*eithercleartheflagsbitorpointtheeventindexatthenext+*entry.Alwaysdobothtokeepcodesimple.*/+vq->vring.avail->flags&=~VRING_AVAIL_F_NO_INTERRUPT;+/* TODO: tune this threshold */+bufs=(u16)(vq->vring.avail->idx-vq->last_used_idx)*3/4;+vring_used_event(&vq->vring)=vq->last_used_idx+bufs;+virtio_mb();+if(unlikely((u16)(vq->vring.used->idx-vq->last_used_idx)>bufs)){+END_USE(vq);+returnfalse;+}++END_USE(vq);+returntrue;+}+EXPORT_SYMBOL_GPL(virtqueue_enable_cb_delayed);+void*virtqueue_detach_unused_buf(structvirtqueue*_vq){structvring_virtqueue*vq=to_vvq(_vq);
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:12:00
Ask for delayed callbacks on TX ring full, to give the
other side more of a chance to make progress.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/net/virtio_net.c | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:12:17
virtio net uses the number of sg entries to
check for TX ring capacity freed. But this
gives incorrect results when indirect buffers
are used. Use the new capacity API instead.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/net/virtio_net.c | 9 ++++-----
1 files changed, 4 insertions(+), 5 deletions(-)
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:12:26
Current code might introduce a lot of latency variation
if there are many pending bufs at the time we
attempt to transmit a new one. This is bad for
real-time applications and can't be good for TCP either.
Free up just enough to both clean up all buffers
eventually and to be able to xmit the next packet.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/net/virtio_net.c | 22 ++++++++++++++--------
1 files changed, 14 insertions(+), 8 deletions(-)
@@ -509,17 +509,25 @@ again:returnreceived;}-staticvoidfree_old_xmit_skbs(structvirtnet_info*vi)+staticboolfree_old_xmit_skbs(structvirtnet_info*vi,intcapacity){structsk_buff*skb;unsignedintlen;--while((skb=virtqueue_get_buf(vi->svq,&len))!=NULL){+boolc;+intn;++/* We try to free up at least 2 skbs per one sent, so that we'll get+*allofthememorybackiftheyareusedfastenough.*/+for(n=0;+((c=virtqueue_get_capacity(vi->svq)<capacity)||n<2)&&+((skb=virtqueue_get_buf(vi->svq,&len)));+++n){pr_debug("Sent skb %p\n",skb);vi->dev->stats.tx_bytes+=skb->len;vi->dev->stats.tx_packets++;dev_kfree_skb_any(skb);}+return!c;}staticintxmit_skb(structvirtnet_info*vi,structsk_buff*skb)
@@ -574,8 +582,8 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev)structvirtnet_info*vi=netdev_priv(dev);intcapacity;-/* Free up any pending old buffers before queueing new ones. */-free_old_xmit_skbs(vi);+/* Free enough pending old buffers to enable queueing new ones. */+free_old_xmit_skbs(vi,2+MAX_SKB_FRAGS);/* Try to transmit */capacity=xmit_skb(vi,skb);
@@ -609,9 +617,7 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev)netif_stop_queue(dev);if(unlikely(!virtqueue_enable_cb_delayed(vi->svq))){/* More just got used, free them then recheck. */-free_old_xmit_skbs(vi);-capacity=virtqueue_get_capacity(vi->svq);-if(capacity>=2+MAX_SKB_FRAGS){+if(!likely(free_old_xmit_skbs(vi,2+MAX_SKB_FRAGS))){netif_start_queue(dev);virtqueue_disable_cb(vi->svq);}
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:13:00
Update avail index immediately instead of upon kick:
for virtio-net RX this helps parallelism with the host.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/virtio/virtio_ring.c | 28 +++++++++++++++++++---------
1 files changed, 19 insertions(+), 9 deletions(-)
@@ -89,7 +89,7 @@ struct vring_virtqueueunsignedintnum_free;/* Head of free buffer list. */unsignedintfree_head;-/* Number we've added since last sync. */+/* Number we've added since last kick. */unsignedintnum_added;/* Last used index we've seen. */
@@ -174,6 +174,13 @@ int virtqueue_add_buf_gfp(struct virtqueue *_vq,BUG_ON(data==NULL);+/* Prevent drivers from adding more than num bufs without a kick. */+if(vq->num_added==vq->vring.num){+printk(KERN_ERR"gaaa!!!\n");+END_USE(vq);+return-ENOSPC;+}+/* If the host supports indirect descriptor tables, and we have multiple*buffers,thengoindirect.FIXME:tunethisthreshold*/if(vq->indirect&&(out+in)>1&&vq->num_free){
@@ -227,8 +234,14 @@ add_head:/* Put entry in available array (but don't update avail->idx until they*dosync).FIXME:avoidmodulushere?*/-avail=(vq->vring.avail->idx+vq->num_added++)%vq->vring.num;+avail=vq->vring.avail->idx%vq->vring.num;vq->vring.avail->ring[avail]=head;+vq->num_added++;++/* Descriptors and available array need to be set before we expose the+*newavailablearrayentries.*/+virtio_wmb();+vq->vring.avail->idx++;pr_debug("Added buffer head %i to %p\n",head,vq);END_USE(vq);
@@ -242,17 +255,14 @@ void virtqueue_kick(struct virtqueue *_vq)structvring_virtqueue*vq=to_vvq(_vq);u16new,old;START_USE(vq);-/* Descriptors and available array need to be set before we expose the-*newavailablearrayentries.*/-virtio_wmb();--old=vq->vring.avail->idx;-new=vq->vring.avail->idx=old+vq->num_added;-vq->num_added=0;/* Need to update avail index before checking if we should notify */virtio_mb();+new=vq->vring.avail->idx;+old=new-vq->num_added;+vq->num_added=0;+if(vq->event?vring_need_event(vring_avail_event(&vq->vring),new,old):!(vq->vring.used->flags&VRING_USED_F_NO_NOTIFY))
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:13:07
Extend the virtio_test tool so it can work with
64 bit features.
Signed-off-by: Michael S. Tsirkin <redacted>
---
tools/virtio/virtio_test.c | 8 ++++++--
1 files changed, 6 insertions(+), 2 deletions(-)
@@ -93,17 +93,17 @@ static unsigned desc_size(const struct lguest_device_desc *desc)}/* This gets the device's feature bits. */-staticu32lg_get_features(structvirtio_device*vdev)+staticu64lg_get_features(structvirtio_device*vdev){unsignedinti;-u32features=0;+u64features=0;structlguest_device_desc*desc=to_lgdev(vdev)->desc;u8*in_features=lg_features(desc);/* We do this the slow but generic way. */-for(i=0;i<min(desc->feature_len*8,32);i++)+for(i=0;i<min(desc->feature_len*8,64);i++)if(in_features[i/8]&(1<<(i%8)))-features|=(1<<i);+features|=(1ull<<i);returnfeatures;}
@@ -112,7 +112,7 @@ static int virtio_dev_probe(struct device *_d)structvirtio_device*dev=container_of(_d,structvirtio_device,dev);structvirtio_driver*drv=container_of(dev->dev.driver,structvirtio_driver,driver);-u32device_features;+u64device_features;/* We have a driver! */add_status(dev,VIRTIO_CONFIG_S_DRIVER);
@@ -124,14 +124,14 @@ static int virtio_dev_probe(struct device *_d)memset(dev->features,0,sizeof(dev->features));for(i=0;i<drv->feature_table_size;i++){unsignedintf=drv->feature_table[i];-BUG_ON(f>=32);-if(device_features&(1<<f))+BUG_ON(f>=64);+if(device_features&(1ull<<f))set_bit(f,dev->features);}/* Transport features always preserved to pass to finalize_features. */for(i=VIRTIO_TRANSPORT_F_START;i<VIRTIO_TRANSPORT_F_END;i++)-if(device_features&(1<<i))+if(device_features&(1ull<<i))set_bit(i,dev->features);dev->config->finalize_features(dev);
@@ -44,6 +44,8 @@ struct virtio_pci_devicespinlock_tlock;structlist_headvirtqueues;+/* 64 bit features */+intfeatures_hi;/* MSI-X support */intmsix_enabled;intintx_enabled;
@@ -103,26 +105,46 @@ static struct virtio_pci_device *to_vp_device(struct virtio_device *vdev)}/* virtio config->get_features() implementation */-staticu32vp_get_features(structvirtio_device*vdev)+staticu64vp_get_features(structvirtio_device*vdev){structvirtio_pci_device*vp_dev=to_vp_device(vdev);+u32flo,fhi;-/* When someone needs more than 32 feature bits, we'll need to+/* When someone needs more than 32 feature bits, we need to*stealabittoindicatethattherestaresomewhereelse.*/-returnioread32(vp_dev->ioaddr+VIRTIO_PCI_HOST_FEATURES);+flo=ioread32(vp_dev->ioaddr+VIRTIO_PCI_HOST_FEATURES);+if(flo&(0x1<<VIRTIO_F_FEATURES_HI)){+vp_dev->features_hi=1;+iowrite32(0x1<<VIRTIO_F_FEATURES_HI,+vp_dev->ioaddr+VIRTIO_PCI_GUEST_FEATURES);+fhi=ioread32(vp_dev->ioaddr+VIRTIO_PCI_HOST_FEATURES_HI);+}else{+vp_dev->features_hi=0;+fhi=0;+}+return(((u64)fhi)<<32)|flo;}/* virtio config->finalize_features() implementation */staticvoidvp_finalize_features(structvirtio_device*vdev){structvirtio_pci_device*vp_dev=to_vp_device(vdev);+u32flo,fhi;/* Give virtio_ring a chance to accept features. */vring_transport_features(vdev);-/* We only support 32 feature bits. */-BUILD_BUG_ON(ARRAY_SIZE(vdev->features)!=1);-iowrite32(vdev->features[0],vp_dev->ioaddr+VIRTIO_PCI_GUEST_FEATURES);+/* We only support 64 feature bits. */+BUILD_BUG_ON(ARRAY_SIZE(vdev->features)!=64/BITS_PER_LONG);+flo=vdev->features[0];+fhi=vdev->features[64/BITS_PER_LONG-1]>>(BITS_PER_LONG-32);+iowrite32(flo,vp_dev->ioaddr+VIRTIO_PCI_GUEST_FEATURES);+if(flo&(0x1<<VIRTIO_F_FEATURES_HI)){+vp_dev->features_hi=1;+iowrite32(fhi,vp_dev->ioaddr+VIRTIO_PCI_GUEST_FEATURES_HI);+}else{+vp_dev->features_hi=0;+}}/* virtio config->get() implementation */
@@ -119,7 +119,7 @@ struct virtio_device {structvirtio_config_ops*config;structlist_headvqs;/* Note that this is a Linux set_bit-style bitmap. */-unsignedlongfeatures[1];+unsignedlongfeatures[64/BITS_PER_LONG];void*priv;};
@@ -18,16 +18,19 @@/* We've given up on this device. */#define VIRTIO_CONFIG_S_FAILED 0x80-/* Some virtio feature bits (currently bits 28 through 31) are reserved for the+/* Some virtio feature bits (currently bits 28 through 39) are reserved for the*transportbeingused(eg.virtio_ring),therestareper-devicefeature*bits.*/#define VIRTIO_TRANSPORT_F_START 28-#define VIRTIO_TRANSPORT_F_END 32+#define VIRTIO_TRANSPORT_F_END 40/* Do we get callbacks when the ring is completely used, even if we've*suppressedthem?*/#define VIRTIO_F_NOTIFY_ON_EMPTY 24+/* Enables feature bits 32 to 63 (only really required for virtio_pci). */+#define VIRTIO_F_FEATURES_HI 31+#ifdef __KERNEL__#include<linux/err.h>#include<linux/virtio.h>
@@ -110,9 +113,9 @@ static inline bool virtio_has_feature(const struct virtio_device *vdev,{/* Did you forget to fix assumptions on max features? */if(__builtin_constant_p(fbit))-BUILD_BUG_ON(fbit>=32);+BUILD_BUG_ON(fbit>=64);else-BUG_ON(fbit>=32);+BUG_ON(fbit>=64);if(fbit<VIRTIO_TRANSPORT_F_START)virtio_check_driver_offered_feature(vdev,fbit);
@@ -55,9 +55,16 @@/* Vector value used to disable MSI for queue */#define VIRTIO_MSI_NO_VECTOR 0xffff+/* An extended 32-bit r/o bitmask of the features supported by the host */+#define VIRTIO_PCI_HOST_FEATURES_HI 24++/* An extended 32-bit r/w bitmask of features activated by the guest */+#define VIRTIO_PCI_GUEST_FEATURES_HI 28+/* The remaining space is defined by each driver as the per-driver*configurationspace*/-#define VIRTIO_PCI_CONFIG(dev) ((dev)->msix_enabled ? 24 : 20)+#define VIRTIO_PCI_CONFIG(dev) ((dev)->features_hi ? 32 : \+(dev)->msix_enabled?24:20)/* Virtio ABI version, this must match exactly */#define VIRTIO_PCI_ABI_VERSION 0
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:13:35
Update vhost_has_feature to make it work correctly for bit > 32.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/vhost/vhost.h | 8 ++++----
1 files changed, 4 insertions(+), 4 deletions(-)
@@ -176,14 +176,14 @@ enum {(1ULL<<VIRTIO_NET_F_MRG_RXBUF),};-staticinlineintvhost_has_feature(structvhost_dev*dev,intbit)+staticinlineboolvhost_has_feature(structvhost_dev*dev,intbit){-unsignedacked_features;+u64acked_features;/* TODO: check that we are running from vhost_worker or dev mutex is*held?*/acked_features=rcu_dereference_index_check(dev->acked_features,1);-returnacked_features&(1<<bit);+returnacked_features&(1ull<<bit);}#endif
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-19 23:14:53
Support the new event index feature. When acked,
utilize it to reduce the # of interrupts sent to the guest.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/vhost/net.c | 12 ++--
drivers/vhost/test.c | 6 +-
drivers/vhost/vhost.c | 138 +++++++++++++++++++++++++++++++++++++------------
drivers/vhost/vhost.h | 21 +++++---
4 files changed, 127 insertions(+), 50 deletions(-)
@@ -334,10 +334,10 @@ static void handle_rx(struct vhost_net *net)break;/* OK, now we need to know about added descriptors. */if(!headcount){-if(unlikely(vhost_enable_notify(vq))){+if(unlikely(vhost_enable_notify(&net->dev,vq))){/* They have slipped one in as we were*doingthat:checkagain.*/-vhost_disable_notify(vq);+vhost_disable_notify(&net->dev,vq);continue;}/* Nothing new? Wait for eventfd to tell us
@@ -61,8 +61,8 @@ static void handle_vq(struct vhost_test *n)break;/* Nothing new? Wait for eventfd to tell us they refilled. */if(head==vq->num){-if(unlikely(vhost_enable_notify(vq))){-vhost_disable_notify(vq);+if(unlikely(vhost_enable_notify(&n->dev,vq))){+vhost_disable_notify(&n->dev,vq);continue;}break;
@@ -489,16 +494,17 @@ static int memory_access_ok(struct vhost_dev *d, struct vhost_memory *mem,return1;}-staticintvq_access_ok(unsignedintnum,+staticintvq_access_ok(structvhost_dev*d,unsignedintnum,structvring_desc__user*desc,structvring_avail__user*avail,structvring_used__user*used){+size_ts=vhost_has_feature(d,VIRTIO_RING_F_EVENT_IDX)?2:0;returnaccess_ok(VERIFY_READ,desc,num*sizeof*desc)&&access_ok(VERIFY_READ,avail,-sizeof*avail+num*sizeof*avail->ring)&&+sizeof*avail+num*sizeof*avail->ring+s)&&access_ok(VERIFY_WRITE,used,-sizeof*used+num*sizeof*used->ring);+sizeof*used+num*sizeof*used->ring+s);}/* Can we log writes? */
@@ -514,9 +520,11 @@ int vhost_log_access_ok(struct vhost_dev *dev)/* Verify access for write logging. *//* Caller should have vq mutex and device mutex */-staticintvq_log_access_ok(structvhost_virtqueue*vq,void__user*log_base)+staticintvq_log_access_ok(structvhost_dev*d,structvhost_virtqueue*vq,+void__user*log_base){structvhost_memory*mp;+size_ts=vhost_has_feature(d,VIRTIO_RING_F_EVENT_IDX)?2:0;mp=rcu_dereference_protected(vq->dev->memory,lockdep_is_held(&vq->mutex));
@@ -524,15 +532,15 @@ static int vq_log_access_ok(struct vhost_virtqueue *vq, void __user *log_base)vhost_has_feature(vq->dev,VHOST_F_LOG_ALL))&&(!vq->log_used||log_access_ok(log_base,vq->log_addr,sizeof*vq->used+-vq->num*sizeof*vq->used->ring));+vq->num*sizeof*vq->used->ring+s));}/* Can we start vq? *//* Caller should have vq mutex and device mutex */intvhost_vq_access_ok(structvhost_virtqueue*vq){-returnvq_access_ok(vq->num,vq->desc,vq->avail,vq->used)&&-vq_log_access_ok(vq,vq->log_base);+returnvq_access_ok(vq->dev,vq->num,vq->desc,vq->avail,vq->used)&&+vq_log_access_ok(vq->dev,vq,vq->log_base);}staticlongvhost_set_memory(structvhost_dev*d,structvhost_memory__user*m)
@@ -577,6 +585,7 @@ static int init_used(struct vhost_virtqueue *vq,if(r)returnr;+vq->signalled_used_valid=false;returnget_user(vq->last_used_idx,&used->idx);}
@@ -674,7 +683,7 @@ static long vhost_set_vring(struct vhost_dev *d, int ioctl, void __user *argp)*Ifitisnot,wedon'tassizemightnothavebeensetup.*Wewillverifywhenbackendisconfigured.*/if(vq->private_data){-if(!vq_access_ok(vq->num,+if(!vq_access_ok(d,vq->num,(void__user*)(unsignedlong)a.desc_user_addr,(void__user*)(unsignedlong)a.avail_user_addr,(void__user*)(unsignedlong)a.used_user_addr)){
@@ -818,7 +827,7 @@ long vhost_dev_ioctl(struct vhost_dev *d, unsigned int ioctl, unsigned long arg)vq=d->vqs+i;mutex_lock(&vq->mutex);/* If ring is inactive, will check when it's enabled. */-if(vq->private_data&&!vq_log_access_ok(vq,base))+if(vq->private_data&&!vq_log_access_ok(d,vq,base))r=-EFAULT;elsevq->log_base=base;
@@ -1219,6 +1228,10 @@ int vhost_get_vq_desc(struct vhost_dev *dev, struct vhost_virtqueue *vq,/* On success, increment avail index. */vq->last_avail_idx++;++/* Assume notifications from guest are disabled at this point,+*iftheyaren'twewouldneedtoupdateavail_eventindex.*/+BUG_ON(!(vq->used_flags&VRING_USED_F_NO_NOTIFY));returnhead;}
@@ -1267,6 +1280,12 @@ int vhost_add_used(struct vhost_virtqueue *vq, unsigned int head, int len)eventfd_signal(vq->log_ctx,1);}vq->last_used_idx++;+/* If the driver never bothers to signal in a very long while,+*usedindexmightwraparound.Ifthathappens,invalidate+*signalled_usedindexwestored.TODO:makesuredriver+*signalsatleastoncein2^16andremovethis.*/+if(unlikely(vq->last_used_idx==vq->signalled_used))+vq->signalled_used_valid=false;return0;}
@@ -1275,6 +1294,7 @@ static int __vhost_add_used_n(struct vhost_virtqueue *vq,unsignedcount){structvring_used_elem__user*used;+u16old,new;intstart;start=vq->last_used_idx%vq->num;
@@ -1292,7 +1312,14 @@ static int __vhost_add_used_n(struct vhost_virtqueue *vq,((void__user*)used-(void__user*)vq->used),count*sizeof*used);}-vq->last_used_idx+=count;+old=vq->last_used_idx;+new=(vq->last_used_idx+=count);+/* If the driver never bothers to signal in a very long while,+*usedindexmightwraparound.Ifthathappens,invalidate+*signalled_usedindexwestored.TODO:makesuredriver+*signalsatleastoncein2^16andremovethis.*/+if(unlikely((u16)(new-vq->signalled_used)<(u16)(new-old)))+vq->signalled_used_valid=false;return0;}
@@ -1331,29 +1358,47 @@ int vhost_add_used_n(struct vhost_virtqueue *vq, struct vring_used_elem *heads,returnr;}-/* This actually signals the guest, using eventfd. */-voidvhost_signal(structvhost_dev*dev,structvhost_virtqueue*vq)+staticboolvhost_notify(structvhost_dev*dev,structvhost_virtqueue*vq){-__u16flags;-+__u16old,new,event;+boolv;/* Flush out used index updates. This is paired*withthebarrierthattheGuestexecuteswhenenabling*interrupts.*/smp_mb();-if(__get_user(flags,&vq->avail->flags)){-vq_err(vq,"Failed to get flags");-return;+if(vhost_has_feature(dev,VIRTIO_F_NOTIFY_ON_EMPTY)&&+unlikely(vq->avail_idx==vq->last_avail_idx))+returntrue;++if(!vhost_has_feature(dev,VIRTIO_RING_F_EVENT_IDX)){+__u16flags;+if(__get_user(flags,&vq->avail->flags)){+vq_err(vq,"Failed to get flags");+returntrue;+}+return!(flags&VRING_AVAIL_F_NO_INTERRUPT);}+old=vq->signalled_used;+v=vq->signalled_used_valid;+new=vq->signalled_used=vq->last_used_idx;+vq->signalled_used_valid=true;-/* If they don't want an interrupt, don't signal, unless empty. */-if((flags&VRING_AVAIL_F_NO_INTERRUPT)&&-(vq->avail_idx!=vq->last_avail_idx||-!vhost_has_feature(dev,VIRTIO_F_NOTIFY_ON_EMPTY)))-return;+if(unlikely(!v))+returntrue;+if(get_user(event,vhost_used_event(vq))){+vq_err(vq,"Failed to get used event idx");+returntrue;+}+returnvring_need_event(event,new,old);+}++/* This actually signals the guest, using eventfd. */+voidvhost_signal(structvhost_dev*dev,structvhost_virtqueue*vq)+{/* Signal the Guest tell them we used something up. */-if(vq->call_ctx)+if(vq->call_ctx&&vhost_notify(dev,vq))eventfd_signal(vq->call_ctx,1);}
@@ -1376,7 +1421,7 @@ void vhost_add_used_and_signal_n(struct vhost_dev *dev,}/* OK, now we need to know about added descriptors. */-boolvhost_enable_notify(structvhost_virtqueue*vq)+boolvhost_enable_notify(structvhost_dev*dev,structvhost_virtqueue*vq){u16avail_idx;intr;
@@ -1384,11 +1429,34 @@ bool vhost_enable_notify(struct vhost_virtqueue *vq)if(!(vq->used_flags&VRING_USED_F_NO_NOTIFY))returnfalse;vq->used_flags&=~VRING_USED_F_NO_NOTIFY;-r=put_user(vq->used_flags,&vq->used->flags);-if(r){-vq_err(vq,"Failed to enable notification at %p: %d\n",-&vq->used->flags,r);-returnfalse;+if(!vhost_has_feature(dev,VIRTIO_RING_F_EVENT_IDX)){+r=put_user(vq->used_flags,&vq->used->flags);+if(r){+vq_err(vq,"Failed to enable notification at %p: %d\n",+&vq->used->flags,r);+returnfalse;+}+}else{+r=put_user(vq->avail_idx,vhost_avail_event(vq));+if(r){+vq_err(vq,"Failed to update avail event index at %p: %d\n",+vhost_avail_event(vq),r);+returnfalse;+}+}+if(unlikely(vq->log_used)){+void__user*used;+/* Make sure data is seen before log. */+smp_wmb();+used=vhost_has_feature(dev,VIRTIO_RING_F_EVENT_IDX)?+&vq->used->flags:vhost_avail_event(vq);+/* Log used flags or event index entry write. Both are 16 bit+*fields.*/+log_write(vq->log_base,vq->log_addr++(used-(void__user*)vq->used),+sizeof(u16));+if(vq->log_ctx)+eventfd_signal(vq->log_ctx,1);}/* They could have slipped one in as we were doing that: make*sureit'swritten,thencheckagain.*/
@@ -1404,15 +1472,17 @@ bool vhost_enable_notify(struct vhost_virtqueue *vq)}/* We don't need to be notified again. */-voidvhost_disable_notify(structvhost_virtqueue*vq)+voidvhost_disable_notify(structvhost_dev*dev,structvhost_virtqueue*vq){intr;if(vq->used_flags&VRING_USED_F_NO_NOTIFY)return;vq->used_flags|=VRING_USED_F_NO_NOTIFY;-r=put_user(vq->used_flags,&vq->used->flags);-if(r)-vq_err(vq,"Failed to enable notification at %p: %d\n",-&vq->used->flags,r);+if(!vhost_has_feature(dev,VIRTIO_RING_F_EVENT_IDX)){+r=put_user(vq->used_flags,&vq->used->flags);+if(r)+vq_err(vq,"Failed to enable notification at %p: %d\n",+&vq->used->flags,r);+}}
@@ -84,6 +84,12 @@ struct vhost_virtqueue {/* Used flags */u16used_flags;+/* Last used index value we have signalled on */+u16signalled_used;++/* Last used index value we have signalled on */+boolsignalled_used_valid;+/* Log writes to used structure. */boollog_used;u64log_addr;
From: David Miller <davem@davemloft.net> Date: 2011-05-19 23:21:16
From: "Michael S. Tsirkin" <mst@redhat.com>
Date: Fri, 20 May 2011 02:10:07 +0300
Rusty, I think it will be easier to merge vhost and virtio bits in one
go. Can it all go in through your tree (Dave in the past acked
sending a very similar patch through you so should not be a problem)?
And in case you want an explicit ack for the net bits:
Acked-by: David S. Miller <davem@davemloft.net>
:-)
From: Rusty Russell <hidden> Date: 2011-05-20 07:52:51
On Fri, 20 May 2011 02:10:07 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
OK, here is the large patchset that implements the virtio spec update
that I sent earlier (the spec itself needs a minor update, will send
that out too next week, but I think we are on the same page here
already). It supercedes the PUBLISH_USED_IDX patches I sent
out earlier.
What will follow will be a patchset that actually includes 4 sets of
patches. I note below their status. Please consider for 2.6.40, at
least partially. Rusty, do you think it's feasible?
Erk. I'm still unsure that we should be using ring capacity as the
thresholding mechanism, given that *descriptor* exhaustion is what we
actually face.
That said, I will review these thoroughly in 14 hours (Sat morning my
time). Perhaps I can convince myself that it's not a problem, because
it *is* simpler...
List of patches and what they do:
I) With the first patchset, we change virtio ring notification
hand-off to work like the one in Xen -
each side publishes an event index, the other one
notifies when it reaches that value -
With the one difference that event index starts at 0,
same as request index (in xen event index starts at 1).
These are the patches in this set:
virtio: event index interface
virtio ring: inline function to check for events
virtio_ring: support event idx feature
vhost: support event index
virtio_test: support event index
Changes in this part of the patchset from v1 - address comments by Rusty et al.
I tested this a lot with virtio net block and with the simulator and esp
with the simulator it's easy to see drastic performance improvement
here:
[virtio]# time ./virtio_test
spurious wakeus: 0x7
real 0m0.169s
user 0m0.140s
sys 0m0.019s
[virtio]# time ./virtio_test --no-event-idx
spurious wakeus: 0x11
real 0m0.649s
user 0m0.295s
sys 0m0.335s
And these patches are mostly unchanged from the very first version,
changes being almost exclusively code cleanups. So I consider this part
the most stable, I strongly think these patches should go into 2.6.40.
One extra reason besides performance is that maintaining
them out of tree is very painful as guest/host ABI is affected.
II) Second set of patches: new apis and use in virtio_net
With the indexes in place it becomes possibile to request an event after
many requests (and not just on the next one as done now). This shall fix
the TX queue overrun which currently triggers a storm of interrupts.
Another issue I tried to fix is capacity checks in virtio-net,
there's a new API for that, and on top of that,
I implemented a patch improving real-time characteristics
of virtio_net
Thus we get the second patchset:
virtio: add api for delayed callbacks
virtio_net: delay TX callbacks
virtio_ring: Add capacity check API
virtio_net: fix TX capacity checks using new API
virtio_net: limit xmit polling
This has some fixes that I posted previously applied,
but otherwise ideantical to v1. I tried to change API
for enable_cb_delayed as Rusty suggested but failed to do this.
I think it's not possible to define cleanly.
These work fine for me, I think they can be merged for 2.6.40
too but would be nice to hear back from Shirley, Tom, Krishna.
See other mail.
III) There's also a patch that adds a tweak to virtio ring
virtio: don't delay avail index update
This seems to help small message sizes where we are constantly draining
the RX VQ.
This is independent. If someone shows some benchmark improvement I'm
definitely happy to put this in .40, if nothing else.
I'll need to benchmark this to be able to give any numbers
with confidence, but I don't see how it can hurt anything.
Thoughts?
IV) Last part is a set of patches to extend feature bits
to 64 bit. I tested this by using feature bit 32.
vhost: fix 64 bit features
virtio_test: update for 64 bit features
virtio: 64 bit features
Sweetness, but .41 material at this stage.
Thanks,
Rusty.
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:26
On Fri, 20 May 2011 02:10:44 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
Support for the new event idx feature:
1. When enabling interrupts, publish the current avail index
value to the host to get interrupts on the next update.
2. Use the new avail_event feature to reduce the number
of exits from the guest.
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:32
On Fri, 20 May 2011 02:10:27 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
With the new used_event and avail_event and features, both
host and guest need similar logic to check whether events are
enabled, so it helps to put the common code in the header.
Note that Xen has similar logic for notification hold-off
in include/xen/interface/io/ring.h with req_event and req_prod
corresponding to event_idx + 1 and new_idx respectively.
+1 comes from the fact that req_event and req_prod in Xen start at 1,
while event index in virtio starts at 0.
Signed-off-by: Michael S. Tsirkin <redacted>
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:35
On Fri, 20 May 2011 02:11:47 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
virtio net uses the number of sg entries to
check for TX ring capacity freed. But this
gives incorrect results when indirect buffers
are used. Use the new capacity API instead.
OK, but this explanation needs enhancement, such as noting the actual
results of that miscalculation. Something like:
virtio_net uses the number of sg entries in the skb it frees to
calculate how many descriptors in the ring have just been made
available. But this value is an overestimate: with indirect buffers
each skb only uses one descriptor entry, meaning we may wake the queue
only to find we still can't transmit anything.
Using the new virtqueue_get_capacity() call, we can exactly determine
the remaining capacity, so we should use that instead.
But, here's the side effect:
/* More just got used, free them then recheck. */
- capacity += free_old_xmit_skbs(vi);
+ free_old_xmit_skbs(vi);
+ capacity = virtqueue_get_capacity(vi->svq);
if (capacity >= 2+MAX_SKB_FRAGS) {
That capacity >= 2+MAX_SKB_FRAGS is too much for indirect buffers. This
means we waste 20 entries in the ring, but OTOH if we hit OOM we fall
back to direct buffers and we *will* need this.
Which means this comment in the driver is now wrong:
/* This can happen with OOM and indirect buffers. */
if (unlikely(capacity < 0)) {
if (net_ratelimit()) {
if (likely(capacity == -ENOMEM)) {
dev_warn(&dev->dev,
"TX queue failure: out of memory\n");
} else {
dev->stats.tx_fifo_errors++;
dev_warn(&dev->dev,
"Unexpected TX queue failure: %d\n",
capacity);
}
}
dev->stats.tx_dropped++;
kfree_skb(skb);
return NETDEV_TX_OK;
}
virtqueue_kick(vi->svq);
So I'm not applying this patch (nor the virtqueue_get_capacity
predeccessor) for the moment.
Thanks,
Rusty.
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:40
On Fri, 20 May 2011 02:11:14 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
Add an API that tells the other side that callbacks
should be delayed until a lot of work has been done.
Implement using the new event_idx feature.
Note: it might seem advantageous to let the drivers
ask for a callback after a specific capacity has
been reached. However, as a single head can
free many entries in the descriptor table,
we don't really have a clue about capacity
until get_buf is called. The API is the simplest
to implement at the moment, we'll see what kind of
hints drivers can pass when there's more than one
user of the feature.
Signed-off-by: Michael S. Tsirkin <redacted>
Yes, I've applied this (and the next one which uses it in virtio_net),
despite my reservations about the API. But that is fixable...
Thanks,
Rusty.
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:49
On Fri, 20 May 2011 02:11:56 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
Current code might introduce a lot of latency variation
if there are many pending bufs at the time we
attempt to transmit a new one. This is bad for
real-time applications and can't be good for TCP either.
Do we have more than speculation to back that up, BTW?
This patch is pretty sloppy; the previous ones were better polished.
A comment here indicating it returns true if it frees something?
struct sk_buff *skb;
unsigned int len;
-
- while ((skb = virtqueue_get_buf(vi->svq, &len)) != NULL) {
+ bool c;
+ int n;
+
+ /* We try to free up at least 2 skbs per one sent, so that we'll get
+ * all of the memory back if they are used fast enough. */
+ for (n = 0;
+ ((c = virtqueue_get_capacity(vi->svq) < capacity) || n < 2) &&
+ ((skb = virtqueue_get_buf(vi->svq, &len)));
+ ++n) {
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
+ return !c;
This is for() abuse :)
Why is the capacity check in there at all? Surely it's simpler to try
to free 2 skbs each time around?
for (n = 0; n < 2; n++) {
skb = virtqueue_get_buf(vi->svq, &len);
if (!skb)
break;
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
quoted hunk
static int xmit_skb(struct virtnet_info *vi, struct sk_buff *skb)
@@ -574,8 +582,8 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev) struct virtnet_info *vi = netdev_priv(dev); int capacity;- /* Free up any pending old buffers before queueing new ones. */- free_old_xmit_skbs(vi);+ /* Free enough pending old buffers to enable queueing new ones. */+ free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS); /* Try to transmit */ capacity = xmit_skb(vi, skb);
@@ -609,9 +617,7 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev) netif_stop_queue(dev); if (unlikely(!virtqueue_enable_cb_delayed(vi->svq))) { /* More just got used, free them then recheck. */- free_old_xmit_skbs(vi);- capacity = virtqueue_get_capacity(vi->svq);- if (capacity >= 2+MAX_SKB_FRAGS) {+ if (!likely(free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
This extra argument to free_old_xmit_skbs seems odd, unless you have
future plans?
Thanks,
Rusty.
From: Rusty Russell <hidden> Date: 2011-05-21 02:34:52
On Fri, 20 May 2011 02:12:19 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted hunk
Update avail index immediately instead of upon kick:
for virtio-net RX this helps parallelism with the host.
Signed-off-by: Michael S. Tsirkin <redacted>
---
drivers/virtio/virtio_ring.c | 28 +++++++++++++++++++---------
1 files changed, 19 insertions(+), 9 deletions(-)
@@ -89,7 +89,7 @@ struct vring_virtqueueunsignedintnum_free;/* Head of free buffer list. */unsignedintfree_head;-/* Number we've added since last sync. */+/* Number we've added since last kick. */unsignedintnum_added;
I always like to see obsolescent nomenclature cleaned up like this.
Thanks.
quoted hunk
/* Last used index we've seen. */
@@ -174,6 +174,13 @@ int virtqueue_add_buf_gfp(struct virtqueue *_vq, BUG_ON(data == NULL);+ /* Prevent drivers from adding more than num bufs without a kick. */+ if (vq->num_added == vq->vring.num) {+ printk(KERN_ERR "gaaa!!!\n");+ END_USE(vq);+ return -ENOSPC;+ }+
I like "gaaa!" but it won't tell us which driver. How about the more
conventional:
if (WARN_ON(vq->num_added >= vq->vring.num)) {
END_USE(vq);
return -ENOSPC;
}
I'd really like to see the results of this patch. It's useless for
outgoing net traffic (we deal with one packet at a time) but perhaps a
flood of incoming packets would show something.
Thanks,
Rusty.
From: Rusty Russell <hidden> Date: 2011-05-21 02:36:37
On Fri, 20 May 2011 02:10:54 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
Support the new event index feature. When acked,
utilize it to reduce the # of interrupts sent to the guest.
Signed-off-by: Michael S. Tsirkin <redacted>
Applied, even though it'd normally be in your tree, it's easier for me
to push all together.
Thanks,
Rusty.
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-22 12:10:53
On Sat, May 21, 2011 at 11:49:59AM +0930, Rusty Russell wrote:
On Fri, 20 May 2011 02:11:56 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
Current code might introduce a lot of latency variation
if there are many pending bufs at the time we
attempt to transmit a new one. This is bad for
real-time applications and can't be good for TCP either.
Do we have more than speculation to back that up, BTW?
Need to dig this up: I thought we saw some reports of this on the list?
This patch is pretty sloppy; the previous ones were better polished.
A comment here indicating it returns true if it frees something?
Agree.
quoted
struct sk_buff *skb;
unsigned int len;
-
- while ((skb = virtqueue_get_buf(vi->svq, &len)) != NULL) {
+ bool c;
+ int n;
+
+ /* We try to free up at least 2 skbs per one sent, so that we'll get
+ * all of the memory back if they are used fast enough. */
+ for (n = 0;
+ ((c = virtqueue_get_capacity(vi->svq) < capacity) || n < 2) &&
+ ((skb = virtqueue_get_buf(vi->svq, &len)));
+ ++n) {
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
+ return !c;
This is for() abuse :)
Why is the capacity check in there at all? Surely it's simpler to try
to free 2 skbs each time around?
This is in case we can't use indirect: we want to free up
enough buffers for the following add_buf to succeed.
for (n = 0; n < 2; n++) {
skb = virtqueue_get_buf(vi->svq, &len);
if (!skb)
break;
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
quoted
static int xmit_skb(struct virtnet_info *vi, struct sk_buff *skb)
@@ -574,8 +582,8 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev) struct virtnet_info *vi = netdev_priv(dev); int capacity;- /* Free up any pending old buffers before queueing new ones. */- free_old_xmit_skbs(vi);+ /* Free enough pending old buffers to enable queueing new ones. */+ free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS); /* Try to transmit */ capacity = xmit_skb(vi, skb);
@@ -609,9 +617,7 @@ static netdev_tx_t start_xmit(struct sk_buff *skb, struct net_device *dev) netif_stop_queue(dev); if (unlikely(!virtqueue_enable_cb_delayed(vi->svq))) { /* More just got used, free them then recheck. */- free_old_xmit_skbs(vi);- capacity = virtqueue_get_capacity(vi->svq);- if (capacity >= 2+MAX_SKB_FRAGS) {+ if (!likely(free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
This extra argument to free_old_xmit_skbs seems odd, unless you have
future plans?
Thanks,
Rusty.
I just wanted to localize the 2+MAX_SKB_FRAGS logic that tries to make
sure we have enough space in the buffer. Another way to do
that is with a define :).
--
MST
From: Rusty Russell <hidden> Date: 2011-05-23 02:24:06
On Sun, 22 May 2011 15:10:08 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
On Sat, May 21, 2011 at 11:49:59AM +0930, Rusty Russell wrote:
quoted
On Fri, 20 May 2011 02:11:56 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
Current code might introduce a lot of latency variation
if there are many pending bufs at the time we
attempt to transmit a new one. This is bad for
real-time applications and can't be good for TCP either.
Do we have more than speculation to back that up, BTW?
Need to dig this up: I thought we saw some reports of this on the list?
I think so too, but a reference needs to be here too.
It helps to have exact benchmarks on what's being tested, otherwise we
risk unexpected interaction with the other optimization patches.
quoted
quoted
struct sk_buff *skb;
unsigned int len;
-
- while ((skb = virtqueue_get_buf(vi->svq, &len)) != NULL) {
+ bool c;
+ int n;
+
+ /* We try to free up at least 2 skbs per one sent, so that we'll get
+ * all of the memory back if they are used fast enough. */
+ for (n = 0;
+ ((c = virtqueue_get_capacity(vi->svq) < capacity) || n < 2) &&
+ ((skb = virtqueue_get_buf(vi->svq, &len)));
+ ++n) {
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
+ return !c;
This is for() abuse :)
Why is the capacity check in there at all? Surely it's simpler to try
to free 2 skbs each time around?
This is in case we can't use indirect: we want to free up
enough buffers for the following add_buf to succeed.
Sure, or we could just count the frags of the skb we're taking out,
which would be accurate for both cases and far more intuitive.
ie. always try to free up twice as much as we're about to put in.
Can we hit problems with OOM? Sure, but no worse than now...
The problem is that this "virtqueue_get_capacity()" returns the worst
case, not the normal case. So using it is deceptive.
I just wanted to localize the 2+MAX_SKB_FRAGS logic that tries to make
sure we have enough space in the buffer. Another way to do
that is with a define :).
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-23 11:19:56
On Mon, May 23, 2011 at 11:37:15AM +0930, Rusty Russell wrote:
On Sun, 22 May 2011 15:10:08 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
On Sat, May 21, 2011 at 11:49:59AM +0930, Rusty Russell wrote:
quoted
On Fri, 20 May 2011 02:11:56 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
Current code might introduce a lot of latency variation
if there are many pending bufs at the time we
attempt to transmit a new one. This is bad for
real-time applications and can't be good for TCP either.
Do we have more than speculation to back that up, BTW?
Need to dig this up: I thought we saw some reports of this on the list?
I think so too, but a reference needs to be here too.
It helps to have exact benchmarks on what's being tested, otherwise we
risk unexpected interaction with the other optimization patches.
quoted
quoted
quoted
struct sk_buff *skb;
unsigned int len;
-
- while ((skb = virtqueue_get_buf(vi->svq, &len)) != NULL) {
+ bool c;
+ int n;
+
+ /* We try to free up at least 2 skbs per one sent, so that we'll get
+ * all of the memory back if they are used fast enough. */
+ for (n = 0;
+ ((c = virtqueue_get_capacity(vi->svq) < capacity) || n < 2) &&
+ ((skb = virtqueue_get_buf(vi->svq, &len)));
+ ++n) {
pr_debug("Sent skb %p\n", skb);
vi->dev->stats.tx_bytes += skb->len;
vi->dev->stats.tx_packets++;
dev_kfree_skb_any(skb);
}
+ return !c;
This is for() abuse :)
Why is the capacity check in there at all? Surely it's simpler to try
to free 2 skbs each time around?
This is in case we can't use indirect: we want to free up
enough buffers for the following add_buf to succeed.
Sure, or we could just count the frags of the skb we're taking out,
which would be accurate for both cases and far more intuitive.
ie. always try to free up twice as much as we're about to put in.
Can we hit problems with OOM? Sure, but no worse than now...
The problem is that this "virtqueue_get_capacity()" returns the worst
case, not the normal case. So using it is deceptive.
Maybe just document this?
I still believe capacity really needs to be decided
at the virtqueue level, not in the driver.
E.g. with indirect each skb uses a single entry: freeing
1 small skb is always enough to have space for a large one.
I do understand how it seems a waste to leave direct space
in the ring while we might in practice have space
due to indirect. Didn't come up with a nice way to
solve this yet - but 'no worse than now :)'
quoted
I just wanted to localize the 2+MAX_SKB_FRAGS logic that tries to make
sure we have enough space in the buffer. Another way to do
that is with a define :).
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is stop
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
--
MST
"Michael S. Tsirkin" [off-list ref] wrote on 05/23/2011 04:49:00 PM:
quoted
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is stop
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use. The
code could become much simpler:
start_xmit()
{
{
num_sgs = get num_sgs for this skb;
/* Free enough pending old buffers to enable queueing this one */
free_old_xmit_skbs(vi, num_sgs * 2); /* ?? */
if (virtqueue_get_capacity() < num_sgs) {
netif_stop_queue(dev);
if (virtqueue_enable_cb_delayed(vi->svq) ||
free_old_xmit_skbs(vi, num_sgs)) {
/* Nothing freed up, or not enough freed up */
kfree_skb(skb);
return NETDEV_TX_OK;
}
netif_start_queue(dev);
virtqueue_disable_cb(vi->svq);
}
/* xmit_skb cannot fail now, also pass 'num_sgs' */
xmit_skb(vi, skb, num_sgs);
virtqueue_kick(vi->svq);
skb_orphan(skb);
nf_reset(skb);
return NETDEV_TX_OK;
}
We could even return TX_BUSY since that makes the dequeue
code more efficient. See dev_dequeue_skb() - you can skip a
lot of code (and avoid taking locks) to check if the queue
is already stopped but that code runs only if you return
TX_BUSY in the earlier iteration.
BTW, shouldn't the check in start_xmit be:
if (likely(!free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
...
}
Thanks,
- KK
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-24 09:13:46
On Tue, May 24, 2011 at 01:24:15PM +0530, Krishna Kumar2 wrote:
"Michael S. Tsirkin" [off-list ref] wrote on 05/23/2011 04:49:00 PM:
quoted
quoted
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is stop
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use.
Not sure I nderstand. We can't know space is freed in the previous
iteration as buffers might not have been used by then.
The
code could become much simpler:
start_xmit()
{
{
num_sgs = get num_sgs for this skb;
/* Free enough pending old buffers to enable queueing this one */
free_old_xmit_skbs(vi, num_sgs * 2); /* ?? */
if (virtqueue_get_capacity() < num_sgs) {
netif_stop_queue(dev);
if (virtqueue_enable_cb_delayed(vi->svq) ||
free_old_xmit_skbs(vi, num_sgs)) {
/* Nothing freed up, or not enough freed up */
kfree_skb(skb);
return NETDEV_TX_OK;
This packet drop is what we wanted to avoid.
}
netif_start_queue(dev);
virtqueue_disable_cb(vi->svq);
}
/* xmit_skb cannot fail now, also pass 'num_sgs' */
xmit_skb(vi, skb, num_sgs);
virtqueue_kick(vi->svq);
skb_orphan(skb);
nf_reset(skb);
return NETDEV_TX_OK;
}
We could even return TX_BUSY since that makes the dequeue
code more efficient. See dev_dequeue_skb() - you can skip a
lot of code (and avoid taking locks) to check if the queue
is already stopped but that code runs only if you return
TX_BUSY in the earlier iteration.
BTW, shouldn't the check in start_xmit be:
if (likely(!free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
...
}
Thanks,
- KK
I thought we used to do basically this but other devices moved to a
model where they stop *before* queueing fails, so we did too.
--
MST
"Michael S. Tsirkin" [off-list ref] wrote on 05/24/2011 02:42:55 PM:
quoted
quoted
quoted
To do this properly, we should really be using the actual number of
sg
quoted
quoted
quoted
elements needed, but we'd have to do most of xmit_skb beforehand so
we
quoted
quoted
quoted
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is
stop
quoted
quoted
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use.
Not sure I nderstand. We can't know space is freed in the previous
iteration as buffers might not have been used by then.
Yes, the first few iterations may not have freed up space, but
later ones should. The amount of free space should increase
from then on, especially since we try to free double of what
we consume.
quoted
The
code could become much simpler:
start_xmit()
{
{
num_sgs = get num_sgs for this skb;
/* Free enough pending old buffers to enable queueing this one
*/
quoted
free_old_xmit_skbs(vi, num_sgs * 2); /* ?? */
if (virtqueue_get_capacity() < num_sgs) {
netif_stop_queue(dev);
if (virtqueue_enable_cb_delayed(vi->svq) ||
free_old_xmit_skbs(vi, num_sgs)) {
/* Nothing freed up, or not enough freed up */
kfree_skb(skb);
return NETDEV_TX_OK;
This packet drop is what we wanted to avoid.
Please see below on returning NETDEV_TX_BUSY.
quoted
}
netif_start_queue(dev);
virtqueue_disable_cb(vi->svq);
}
/* xmit_skb cannot fail now, also pass 'num_sgs' */
xmit_skb(vi, skb, num_sgs);
virtqueue_kick(vi->svq);
skb_orphan(skb);
nf_reset(skb);
return NETDEV_TX_OK;
}
We could even return TX_BUSY since that makes the dequeue
code more efficient. See dev_dequeue_skb() - you can skip a
lot of code (and avoid taking locks) to check if the queue
is already stopped but that code runs only if you return
TX_BUSY in the earlier iteration.
BTW, shouldn't the check in start_xmit be:
if (likely(!free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
...
}
Thanks,
- KK
I thought we used to do basically this but other devices moved to a
model where they stop *before* queueing fails, so we did too.
I am not sure of why it was changed, since returning TX_BUSY
seems more efficient IMHO. qdisc_restart() handles requeue'd
packets much better than a stopped queue, as a significant
part of this code is skipped if gso_skb is present (qdisc
will eventually start dropping packets when tx_queue_len is
exceeded anyway).
Thanks,
- KK
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-24 11:29:57
On Tue, May 24, 2011 at 02:57:43PM +0530, Krishna Kumar2 wrote:
"Michael S. Tsirkin" [off-list ref] wrote on 05/24/2011 02:42:55 PM:
quoted
quoted
quoted
quoted
To do this properly, we should really be using the actual number of
sg
quoted
quoted
quoted
quoted
elements needed, but we'd have to do most of xmit_skb beforehand so
we
quoted
quoted
quoted
quoted
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is
stop
quoted
quoted
quoted
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use.
Not sure I nderstand. We can't know space is freed in the previous
iteration as buffers might not have been used by then.
Yes, the first few iterations may not have freed up space, but
later ones should. The amount of free space should increase
from then on, especially since we try to free double of what
we consume.
Hmm. This is only an upper limit on the # of entries in the queue.
Assume that vq size is 4 and we transmit 4 enties without
getting anything in the used ring. The next transmit will fail.
So I don't really see why it's unlikely that we reach the packet
drop code with your patch.
quoted
quoted
The
code could become much simpler:
start_xmit()
{
{
num_sgs = get num_sgs for this skb;
/* Free enough pending old buffers to enable queueing this one
*/
quoted
quoted
free_old_xmit_skbs(vi, num_sgs * 2); /* ?? */
if (virtqueue_get_capacity() < num_sgs) {
netif_stop_queue(dev);
if (virtqueue_enable_cb_delayed(vi->svq) ||
free_old_xmit_skbs(vi, num_sgs)) {
/* Nothing freed up, or not enough freed up */
kfree_skb(skb);
return NETDEV_TX_OK;
This packet drop is what we wanted to avoid.
Please see below on returning NETDEV_TX_BUSY.
quoted
quoted
}
netif_start_queue(dev);
virtqueue_disable_cb(vi->svq);
}
/* xmit_skb cannot fail now, also pass 'num_sgs' */
xmit_skb(vi, skb, num_sgs);
virtqueue_kick(vi->svq);
skb_orphan(skb);
nf_reset(skb);
return NETDEV_TX_OK;
}
We could even return TX_BUSY since that makes the dequeue
code more efficient. See dev_dequeue_skb() - you can skip a
lot of code (and avoid taking locks) to check if the queue
is already stopped but that code runs only if you return
TX_BUSY in the earlier iteration.
BTW, shouldn't the check in start_xmit be:
if (likely(!free_old_xmit_skbs(vi, 2+MAX_SKB_FRAGS))) {
...
}
Thanks,
- KK
I thought we used to do basically this but other devices moved to a
model where they stop *before* queueing fails, so we did too.
I am not sure of why it was changed, since returning TX_BUSY
seems more efficient IMHO.
qdisc_restart() handles requeue'd
packets much better than a stopped queue, as a significant
part of this code is skipped if gso_skb is present
(qdisc
will eventually start dropping packets when tx_queue_len is
exceeded anyway).
Thanks,
- KK
tx_queue_len is a pretty large buffer so maybe no.
I think the packet drops from the scheduler queue can also be
done intelligently (e.g. with CHOKe) which should
work better than dropping a random packet?
--
MST
"Michael S. Tsirkin" [off-list ref] wrote on 05/24/2011 04:59:39 PM:
quoted
quoted
quoted
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use.
Not sure I nderstand. We can't know space is freed in the previous
iteration as buffers might not have been used by then.
Yes, the first few iterations may not have freed up space, but
later ones should. The amount of free space should increase
from then on, especially since we try to free double of what
we consume.
Hmm. This is only an upper limit on the # of entries in the queue.
Assume that vq size is 4 and we transmit 4 enties without
getting anything in the used ring. The next transmit will fail.
So I don't really see why it's unlikely that we reach the packet
drop code with your patch.
I was assuming 256 entries :) I will try to get some
numbers to see how often it is true tomorrow.
quoted
I am not sure of why it was changed, since returning TX_BUSY
seems more efficient IMHO.
qdisc_restart() handles requeue'd
packets much better than a stopped queue, as a significant
part of this code is skipped if gso_skb is present
Thanks for digging up that thread! Yes, that one skb would get
sent first ahead of possibly higher priority skbs. However,
from a performance point, TX_BUSY code skips a lot of checks
and code for all subsequent packets till the device is
restarted. I can test performance with both cases and report
what I find (the requeue code has become very simple and clean
from "horribly complex", thanks to Herbert and Dave).
quoted
(qdisc
will eventually start dropping packets when tx_queue_len is
tx_queue_len is a pretty large buffer so maybe no.
I remember seeing tons of drops (pfifo_fast_enqueue) when
xmit returns TX_BUSY.
I think the packet drops from the scheduler queue can also be
done intelligently (e.g. with CHOKe) which should
work better than dropping a random packet?
I am not sure of that - choke_enqueue checks against a random
skb to drop current skb, and also during congestion. But for
my "sample driver xmit", returning TX_BUSY could still allow
to be used with CHOKe.
thanks,
- KK
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-24 13:53:44
On Tue, May 24, 2011 at 06:20:35PM +0530, Krishna Kumar2 wrote:
"Michael S. Tsirkin" [off-list ref] wrote on 05/24/2011 04:59:39 PM:
quoted
quoted
quoted
quoted
Maybe Rusty means it is a simpler model to free the amount
of space that this xmit needs. We will still fail anyway
at some time but it is unlikely, since earlier iteration
freed up atleast the space that it was going to use.
Not sure I nderstand. We can't know space is freed in the previous
iteration as buffers might not have been used by then.
Yes, the first few iterations may not have freed up space, but
later ones should. The amount of free space should increase
from then on, especially since we try to free double of what
we consume.
Hmm. This is only an upper limit on the # of entries in the queue.
Assume that vq size is 4 and we transmit 4 enties without
getting anything in the used ring. The next transmit will fail.
So I don't really see why it's unlikely that we reach the packet
drop code with your patch.
I was assuming 256 entries :) I will try to get some
numbers to see how often it is true tomorrow.
That would depend on how fast the hypervisor is.
Try doing something to make hypervisor slower than the guest. I don't
think we need measurements to realize that with the host being slower
than guest that would happen a lot, though.
quoted
quoted
I am not sure of why it was changed, since returning TX_BUSY
seems more efficient IMHO.
qdisc_restart() handles requeue'd
packets much better than a stopped queue, as a significant
part of this code is skipped if gso_skb is present
Thanks for digging up that thread! Yes, that one skb would get
sent first ahead of possibly higher priority skbs. However,
from a performance point, TX_BUSY code skips a lot of checks
and code for all subsequent packets till the device is
restarted. I can test performance with both cases and report
what I find (the requeue code has become very simple and clean
from "horribly complex", thanks to Herbert and Dave).
Cc Herbert, and try to convince him :)
quoted
quoted
(qdisc
will eventually start dropping packets when tx_queue_len is
tx_queue_len is a pretty large buffer so maybe no.
I remember seeing tons of drops (pfifo_fast_enqueue) when
xmit returns TX_BUSY.
quoted
I think the packet drops from the scheduler queue can also be
done intelligently (e.g. with CHOKe) which should
work better than dropping a random packet?
I am not sure of that - choke_enqueue checks against a random
skb to drop current skb, and also during congestion. But for
my "sample driver xmit", returning TX_BUSY could still allow
to be used with CHOKe.
thanks,
- KK
From: Rusty Russell <hidden> Date: 2011-05-25 04:40:58
On Mon, 23 May 2011 14:19:00 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
On Mon, May 23, 2011 at 11:37:15AM +0930, Rusty Russell wrote:
quoted
Can we hit problems with OOM? Sure, but no worse than now...
The problem is that this "virtqueue_get_capacity()" returns the worst
case, not the normal case. So using it is deceptive.
Maybe just document this?
Yes, but also by renaming virtqueue_get_capacity(). Takes it from a 3
to a 6 on the API hard-to-misuse scale.
How about, virtqueue_min_capacity()? Makes the reader realize something
weird is going on.
I still believe capacity really needs to be decided
at the virtqueue level, not in the driver.
E.g. with indirect each skb uses a single entry: freeing
1 small skb is always enough to have space for a large one.
I do understand how it seems a waste to leave direct space
in the ring while we might in practice have space
due to indirect. Didn't come up with a nice way to
solve this yet - but 'no worse than now :)'
Agreed.
quoted
quoted
I just wanted to localize the 2+MAX_SKB_FRAGS logic that tries to make
sure we have enough space in the buffer. Another way to do
that is with a define :).
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is stop
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
From: Rusty Russell <hidden> Date: 2011-05-25 04:40:59
On Mon, 23 May 2011 14:19:00 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
I do understand how it seems a waste to leave direct space
in the ring while we might in practice have space
due to indirect. Didn't come up with a nice way to
solve this yet - but 'no worse than now :)'
Let's just make it "bool free_old_xmit_skbs(unsigned int max)". max ==
2 for the normal xmit path, so we're low latency but we keep ahead on
average. max == -1 for the "we're out of capacity, we may have to stop
the queue".
That keeps it simple and probably the right thing...
Thanks,
Rusty.
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-25 05:50:54
On Wed, May 25, 2011 at 10:58:26AM +0930, Rusty Russell wrote:
On Mon, 23 May 2011 14:19:00 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
On Mon, May 23, 2011 at 11:37:15AM +0930, Rusty Russell wrote:
quoted
Can we hit problems with OOM? Sure, but no worse than now...
The problem is that this "virtqueue_get_capacity()" returns the worst
case, not the normal case. So using it is deceptive.
Maybe just document this?
Yes, but also by renaming virtqueue_get_capacity(). Takes it from a 3
to a 6 on the API hard-to-misuse scale.
How about, virtqueue_min_capacity()? Makes the reader realize something
weird is going on.
Absolutely. Great idea.
quoted
I still believe capacity really needs to be decided
at the virtqueue level, not in the driver.
E.g. with indirect each skb uses a single entry: freeing
1 small skb is always enough to have space for a large one.
I do understand how it seems a waste to leave direct space
in the ring while we might in practice have space
due to indirect. Didn't come up with a nice way to
solve this yet - but 'no worse than now :)'
Agreed.
quoted
quoted
quoted
I just wanted to localize the 2+MAX_SKB_FRAGS logic that tries to make
sure we have enough space in the buffer. Another way to do
that is with a define :).
To do this properly, we should really be using the actual number of sg
elements needed, but we'd have to do most of xmit_skb beforehand so we
know how many.
Cheers,
Rusty.
Maybe I'm confused here. The problem isn't the failing
add_buf for the given skb IIUC. What we are trying to do here is stop
the queue *before xmit_skb fails*. We can't look at the
number of fragments in the current skb - the next one can be
much larger. That's why we check capacity after xmit_skb,
not before it, right?
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-25 06:08:23
On Wed, May 25, 2011 at 11:05:04AM +0930, Rusty Russell wrote:
On Mon, 23 May 2011 14:19:00 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
I do understand how it seems a waste to leave direct space
in the ring while we might in practice have space
due to indirect. Didn't come up with a nice way to
solve this yet - but 'no worse than now :)'
Let's just make it "bool free_old_xmit_skbs(unsigned int max)". max ==
2 for the normal xmit path, so we're low latency but we keep ahead on
average. max == -1 for the "we're out of capacity, we may have to stop
the queue".
That keeps it simple and probably the right thing...
Thanks,
Rusty.
Hmm I'm not sure I got it, need to think about this.
I'd like to go back and document how my design was supposed to work.
This really should have been in commit log or even a comment.
I thought we need a min, not a max.
We start with this:
while ((c = (virtqueue_get_capacity(vq) < 2 + MAX_SKB_FRAGS) &&
(skb = get_buf)))
kfree_skb(skb);
return !c;
This is clean and simple, right? And it's exactly asking for what we need.
But this way we always keep a lot of memory in skbs even when rate of
communication is low.
So we add the min parameter:
int n = 0;
while ((((c = (virtqueue_get_capacity(vq) < 2 + MAX_SKB_FRAGS)) ||
n++ < min) && (skb = get_buf)))
kfree_skb(skb);
return !c;
on the normal path min == 2 so we're low latency but we keep ahead on
average. min == 0 for the "we're out of capacity, we may have to stop
the queue".
Does the above make sense at all?
--
MST
"Michael S. Tsirkin" [off-list ref] wrote on 05/20/2011 04:40:07 AM:
OK, here is the large patchset that implements the virtio spec update
that I sent earlier (the spec itself needs a minor update, will send
that out too next week, but I think we are on the same page here
already). It supercedes the PUBLISH_USED_IDX patches I sent
out earlier.
I was able to get this tested by applying the v2 patches
to git-next tree (somehow MST's git tree hung on my guest
which never got resolved). Testing was from Guest -> Remote
node, using an ixgbe 10g card. The test results are
*excellent* (table: #netperf sesssions, BW% improvement,
SD% improvement, CPU% improvement):
___________________________________
512 byte I/O
# BW% SD% CPU%
____________________________________
1 151.6 -65.1 -10.7
2 180.6 -66.6 -6.4
4 15.5 -35.8 -26.1
8 1.8 -28.4 -26.7
16 3.1 -29.0 -26.5
32 1.1 -27.4 -27.5
64 3.8 -30.9 -26.7
96 5.4 -21.7 -24.2
128 5.7 -24.4 -25.5
____________________________________
BW: 16.6% SD: -24.6% CPU: -25.5%
____________________________________
1K I/O
# BW% SD% CPU%
____________________________________
1 233.9 -76.5 -18.0
2 112.2 -64.0 -23.2
4 9.2 -31.6 -26.1
8 -1.7 -26.8 -30.3
16 3.5 -31.5 -30.6
32 4.8 -25.2 -30.5
64 5.7 -31.0 -28.9
96 5.3 -32.2 -31.7
128 4.6 -38.2 -33.6
____________________________________
BW: 16.4% SD: -35.% CPU: -31.5%
____________________________________
16K I/O
# BW% SD% CPU%
____________________________________
1 18.8 -27.2 -18.3
2 14.8 -36.7 -27.7
4 12.7 -45.2 -38.1
8 4.4 -56.4 -54.4
16 4.8 -38.3 -36.1
32 0 78.0 79.2
64 3.8 -38.1 -37.5
96 7.3 -35.2 -31.1
128 3.4 -31.1 -32.1
____________________________________
BW: 7.6% SD: -30.1% CPU: -23.7%
I plan to run some more tests tomorrow. Please let
me know if any other scenario will help.
Thanks,
- KK
From: Shirley Ma <hidden> Date: 2011-05-26 15:42:22
Hello KK,
Could you please try TCP_RRs as well?
Thanks
Shirley
Krishna Kumar2
<krkumar2@in.ibm.
com> To
"Michael S. Tsirkin"
05/26/2011 08:32 [off-list ref]
AM cc
Christian Borntraeger
[off-list ref], Carsten
Otte [off-list ref],
habanero@linux.vnet.ibm.com, Heiko
Carstens
[off-list ref],
kvm@vger.kernel.org,
lguest@lists.ozlabs.org,
linux-kernel@vger.kernel.org,
linux-s390@vger.kernel.org,
linux390@de.ibm.com,
netdev@vger.kernel.org, Rusty
Russell [off-list ref],
Martin Schwidefsky
[off-list ref], Steve
Dobbelstein/Austin/IBM@IBMUS, Tom
Lendacky [off-list ref],
virtualization@lists.linux-foundati
on.org, Shirley
Ma/Beaverton/IBM@IBMUS
Subject
[PERF RESULTS] virtio and vhost-net
performance enhancements
"Michael S. Tsirkin" [off-list ref] wrote on 05/20/2011 04:40:07 AM:
OK, here is the large patchset that implements the virtio spec update
that I sent earlier (the spec itself needs a minor update, will send
that out too next week, but I think we are on the same page here
already). It supercedes the PUBLISH_USED_IDX patches I sent
out earlier.
I was able to get this tested by applying the v2 patches
to git-next tree (somehow MST's git tree hung on my guest
which never got resolved). Testing was from Guest -> Remote
node, using an ixgbe 10g card. The test results are
*excellent* (table: #netperf sesssions, BW% improvement,
SD% improvement, CPU% improvement):
___________________________________
512 byte I/O
# BW% SD% CPU%
____________________________________
1 151.6 -65.1 -10.7
2 180.6 -66.6 -6.4
4 15.5 -35.8 -26.1
8 1.8 -28.4 -26.7
16 3.1 -29.0 -26.5
32 1.1 -27.4 -27.5
64 3.8 -30.9 -26.7
96 5.4 -21.7 -24.2
128 5.7 -24.4 -25.5
____________________________________
BW: 16.6% SD: -24.6% CPU: -25.5%
____________________________________
1K I/O
# BW% SD% CPU%
____________________________________
1 233.9 -76.5 -18.0
2 112.2 -64.0 -23.2
4 9.2 -31.6 -26.1
8 -1.7 -26.8 -30.3
16 3.5 -31.5 -30.6
32 4.8 -25.2 -30.5
64 5.7 -31.0 -28.9
96 5.3 -32.2 -31.7
128 4.6 -38.2 -33.6
____________________________________
BW: 16.4% SD: -35.% CPU: -31.5%
____________________________________
16K I/O
# BW% SD% CPU%
____________________________________
1 18.8 -27.2 -18.3
2 14.8 -36.7 -27.7
4 12.7 -45.2 -38.1
8 4.4 -56.4 -54.4
16 4.8 -38.3 -36.1
32 0 78.0 79.2
64 3.8 -38.1 -37.5
96 7.3 -35.2 -31.1
128 3.4 -31.1 -32.1
____________________________________
BW: 7.6% SD: -30.1% CPU: -23.7%
I plan to run some more tests tomorrow. Please let
me know if any other scenario will help.
Thanks,
- KK
From: Rusty Russell <hidden> Date: 2011-05-27 22:34:22
On Wed, 25 May 2011 09:07:59 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
On Wed, May 25, 2011 at 11:05:04AM +0930, Rusty Russell wrote:
Hmm I'm not sure I got it, need to think about this.
I'd like to go back and document how my design was supposed to work.
This really should have been in commit log or even a comment.
I thought we need a min, not a max.
We start with this:
while ((c = (virtqueue_get_capacity(vq) < 2 + MAX_SKB_FRAGS) &&
(skb = get_buf)))
kfree_skb(skb);
return !c;
This is clean and simple, right? And it's exactly asking for what we need.
No, I started from the other direction:
for (i = 0; i < 2; i++) {
skb = get_buf();
if (!skb)
break;
kfree_skb(skb);
}
ie. free two packets for every one we're about to add. For steady state
that would work really well. Then we hit the case where the ring seems
full after we do the add: at that point, screw latency, and just try to
free all the buffers we can.
on the normal path min == 2 so we're low latency but we keep ahead on
average. min == 0 for the "we're out of capacity, we may have to stop
the queue".
Does the above make sense at all?
It makes sense, but I think it's a classic case where incremental
improvements aren't as good as starting from scratch.
Cheers,
Rusty.
From: "Michael S. Tsirkin" <mst@redhat.com> Date: 2011-05-28 20:02:26
On Thu, May 26, 2011 at 12:58:23PM +0930, Rusty Russell wrote:
On Wed, 25 May 2011 09:07:59 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
quoted
On Wed, May 25, 2011 at 11:05:04AM +0930, Rusty Russell wrote:
Hmm I'm not sure I got it, need to think about this.
I'd like to go back and document how my design was supposed to work.
This really should have been in commit log or even a comment.
I thought we need a min, not a max.
We start with this:
while ((c = (virtqueue_get_capacity(vq) < 2 + MAX_SKB_FRAGS) &&
(skb = get_buf)))
kfree_skb(skb);
return !c;
This is clean and simple, right? And it's exactly asking for what we need.
No, I started from the other direction:
for (i = 0; i < 2; i++) {
skb = get_buf();
if (!skb)
break;
kfree_skb(skb);
}
ie. free two packets for every one we're about to add. For steady state
that would work really well.
Sure, with indirect buffers, but if we
don't use indirect (and we discussed switching indirect off
dynamically in the past) this becomes harder to
be sure about. I think I understand why but
does not a simple capacity check make it more obvious?
Then we hit the case where the ring
seems full after we do the add: at that point, screw latency, and just
try to free all the buffers we can.
I see. But the code currently does this:
for(..)
get_buf
add_buf
if (capacity < max_sk_frags+2) {
if (!enable_cb)
for(..)
get_buf
}
In other words the second get_buf is only called
in the unlikely case of race condition.
So we'll need to add *another* call to get_buf.
Is it just me or is this becoming messy?
I was also be worried that we are adding more
"modes" to the code: high and low latency
depending on different speeds between host and guest,
which would be hard to trigger and test.
That's why I tried hard to make the code behave the
same all the time and free up just a bit more than
the minimum necessary.
quoted
on the normal path min == 2 so we're low latency but we keep ahead on
average. min == 0 for the "we're out of capacity, we may have to stop
the queue".
Does the above make sense at all?
It makes sense, but I think it's a classic case where incremental
improvements aren't as good as starting from scratch.
Cheers,
Rusty.
The only difference on good path seems an extra capacity check,
so I don't expect the difference will be testable, do you?
--
MST
From: Rusty Russell <hidden> Date: 2011-05-30 06:31:52
On Sat, 28 May 2011 23:02:04 +0300, "Michael S. Tsirkin" [off-list ref] wrote:
On Thu, May 26, 2011 at 12:58:23PM +0930, Rusty Russell wrote:
quoted
ie. free two packets for every one we're about to add. For steady state
that would work really well.
Sure, with indirect buffers, but if we
don't use indirect (and we discussed switching indirect off
dynamically in the past) this becomes harder to
be sure about. I think I understand why but
does not a simple capacity check make it more obvious?
...
quoted
Then we hit the case where the ring
seems full after we do the add: at that point, screw latency, and just
try to free all the buffers we can.
I see. But the code currently does this:
for(..)
get_buf
add_buf
if (capacity < max_sk_frags+2) {
if (!enable_cb)
for(..)
get_buf
}
In other words the second get_buf is only called
in the unlikely case of race condition.
So we'll need to add *another* call to get_buf.
Is it just me or is this becoming messy?
Yes, good point. I really wonder if anyone would be able to measure the
difference between simply freeing 2 every time (with possible extra
stalls for strange cases) and the more complete version.
But it runs against my grain to implement heuristics when one more call
would make it provably reliable.
Please find a way to make that for loop less ugly though!
Thanks,
Rusty.