From mboxrd@z Thu Jan 1 00:00:00 1970 From: Rusty Russell Subject: Re: [PATCH 2/3] virtio-net: correct capacity math on ring full Date: Thu, 04 Oct 2012 09:54:01 +0930 Message-ID: <878vbn2ify.fsf@rustcorp.com.au> References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Cc: Sasha Levin , virtualization@lists.linux-foundation.org, linux-kernel@vger.kernel.org, avi@redhat.com, kvm@vger.kernel.org, netdev@vger.kernel.org To: "Michael S. Tsirkin" , Thomas Lendacky Return-path: Received: from ozlabs.org ([203.10.76.45]:46029 "EHLO ozlabs.org" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1753320Ab2JDBYE (ORCPT ); Wed, 3 Oct 2012 21:24:04 -0400 In-Reply-To: Sender: kvm-owner@vger.kernel.org List-ID: "Michael S. Tsirkin" writes: > Capacity math on ring full is wrong: we are > looking at num_sg but that might be optimistic > because of indirect buffer use. > > The implementation also penalizes fast path > with extra memory accesses for the benefit of > ring full condition handling which is slow path. > > It's easy to query ring capacity so let's do just that. This path will reduce the actual queue use to worst-case assumptions. With bufferbloat maybe that's a good thing, but it's true. If we do this, the code is now wrong: /* This can happen with OOM and indirect buffers. */ if (unlikely(capacity < 0)) { Because this should now *never* happen. But I do like the cleanup; returning capacity from add_buf() was always hacky. I've got an idea, we'll see what it looks like... Cheers, Rusty.