[lkml]   [2015]   [Apr]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: Two other ways to do latched seqcounts
> 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

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