lkml.org 
[lkml]   [2019]   [Apr]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: [PATCH v4 14/16] locking/rwsem: Guard against making count negative
From
Date
On 04/19/2019 09:15 AM, Peter Zijlstra wrote:
> On Fri, Apr 19, 2019 at 03:03:04PM +0200, Peter Zijlstra wrote:
>> On Fri, Apr 19, 2019 at 02:02:07PM +0200, Peter Zijlstra wrote:
>>> On Fri, Apr 19, 2019 at 12:26:47PM +0200, Peter Zijlstra wrote:
>>>> I thought of a horrible horrible alternative:
>>> Hurm, that's broken as heck. Let me try again.
>> So I can't make that scheme work, it all ends up wanting to have
>> cmpxchg().
>>
>> Do we have a performance comparison somewhere of xadd vs cmpxchg
>> readers? I tried looking in the old threads, but I can't seem to locate
>> it.
>>
>> We need new instructions :/ Or more clever than I can muster just now.
> In particular, an (unsigned) saturation arithmetic variant of XADD would
> be very nice to have at this point.

I just want to clear about my current scheme. There will be 16 bits
allocated for reader count. I use the MS bit for signaling that there
are too many readers. So the fast path will fail and the readers will be
put into the wait list. This effectively limit readers to 32k-1, but it
doesn't mean the actual reader count cannot go over that. As long as the
actual count is less than 64k, everything should still work perfectly.
IOW, even though we have reached the limit of 32k, we need to pile on an
additional 32k readers to really overflow the count and cause problem.

Cheers,
Longman



\
 
 \ /
  Last update: 2019-04-19 21:42    [W:2.038 / U:3.476 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site