Skip to contentSkip to conversation

Two other ways to do latched seqcounts

DISCUSSION George Spelvin 2 participants 2 messages Apr 13, 2015 1 message not in the archive

lore
Share & tools
lore
#1 lore raw
In reply to a message not in the archive
Quoted 2 lines

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.

#2 lore raw
Quoted 10 lines · George Spelvin
Quoted 2 lines

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.