lkml.org 
[lkml]   [2015]   [Apr]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: Two other ways to do latched seqcounts
On Mon, Apr 13, 2015 at 05:26:05AM -0400, George Spelvin wrote:
> > I'm assuming you're writing to me because of the latched rb-tree;
> > because that's the most recent related thing I posted ;-)
>
> Basically yes, although it was the documentation you added to the
> latched seqlock code in particular.
>
> I haven't checked the users of your rb-tree code to see how large and
> frequently read the trees are, but if a read is expensive, then avoiding
> retries by incrementing the seqlock twice per update starts to become
> interesting.

Right, so I use it for modules, and updates are near non existent
under normal usage.


\
 
 \ /
  Last update: 2015-04-13 13:01    [W:0.072 / U:0.436 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site