From mboxrd@z Thu Jan 1 00:00:00 1970 From: Raghavendra K T Subject: Re: [PATCH] x86 spinlock: Fix memory corruption on completing completions Date: Tue, 10 Feb 2015 15:00:47 +0530 Message-ID: <54D9CFC7.5020007@linux.vnet.ibm.com> References: <1423234148-13886-1-git-send-email-raghavendra.kt@linux.vnet.ibm.com> <54D7D19B.1000103@goop.org> <54D87F1E.9060307@linux.vnet.ibm.com> <20150209120227.GT21418@twins.programming.kicks-ass.net> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; Format="flowed" Content-Transfer-Encoding: 7bit Return-path: In-Reply-To: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Sender: virtualization-bounces@lists.linux-foundation.org Errors-To: virtualization-bounces@lists.linux-foundation.org To: Linus Torvalds , Jeremy Fitzhardinge , Sasha Levin , Davidlohr Bueso Cc: KVM list , Peter Zijlstra , Linux Kernel Mailing List , Paul Gortmaker , Peter Anvin , Andi Kleen , Andrey Ryabinin , the arch/x86 maintainers , Christian Borntraeger , Ingo Molnar , xen-devel@lists.xenproject.org, Paul McKenney , Rik van Riel , Konrad Rzeszutek Wilk , Dave Jones , Thomas Gleixner , virtualization , Waiman Long , Oleg Nesterov , Paolo Bonzini , Andrew Morton List-Id: virtualization@lists.linuxfoundation.org On 02/10/2015 06:23 AM, Linus Torvalds wrote: > On Mon, Feb 9, 2015 at 4:02 AM, Peter Zijlstra wrote: >> On Mon, Feb 09, 2015 at 03:04:22PM +0530, Raghavendra K T wrote: >>> So we have 3 choices, >>> 1. xadd >>> 2. continue with current approach. >>> 3. a read before unlock and also after that. >> >> For the truly paranoid we have probe_kernel_address(), suppose the lock >> was in module space and the module just got unloaded under us. > > That's much too expensive. > > The xadd shouldn't be noticeably more expensive than the current > "add_smp()". Yes, "lock xadd" used to be several cycles slower than > just "lock add" on some early cores, but I think these days it's down > to a single-cycle difference, which is not really different from doing > a separate load after the add. > > The real problem with xadd used to be that we always had to do magic > special-casing for i386, but that's one of the reasons we dropped > support for original 80386. > > So I think Raghavendra's last version (which hopefully fixes the > lockup problem that Sasha reported) together with changing that V2 did pass the stress, but getting confirmation Sasha would help. > add_smp(&lock->tickets.head, TICKET_LOCK_INC); > if (READ_ONCE(lock->tickets.tail) & TICKET_SLOWPATH_FLAG) .. > > into something like > > val = xadd((&lock->ticket.head_tail, TICKET_LOCK_INC << TICKET_SHIFT); > if (unlikely(val & TICKET_SLOWPATH_FLAG)) ... > > would be the right thing to do. Somebody should just check that I got > that shift right, and that the tail is in the high bytes (head really > needs to be high to work, if it's in the low byte(s) the xadd would > overflow from head into tail which would be wrong). Unfortunately xadd could result in head overflow as tail is high. The other option was repeated cmpxchg which is bad I believe. Any suggestions? ( I have the V3 with Oleg's suggestion and performance numbers but without this getting resolved, It will be one unnecessary iteration). How about getting rid off SLOW_PATH_FLAG in spinlock (i.e. use it only as hint for paravirt), but do unlock_kick whenever we see that (tail-head) > TICKET_LOCK_INC?. (but this also may need cmpxchg in loop in unlock but we will be able to get rid of clear slowpath logic) Only problem is we may do unnecessary kicks even in 1x load.