hash table

Olof Johansson olof at austin.ibm.com
Wed Dec 10 07:39:05 EST 2003

Olof Johansson wrote:

> There's even more subtle races in the sense that the tree is walked
> while someone might update it
> underneath of the lookup, but maybe they can be ignored?

Hmm, I'm used to thinking about this in 2.4, where we don't have the
HPTE lock bit. I'm guessing that will protect us here.


** Sent via the linuxppc64-dev mail list. See http://lists.linuxppc.org/

More information about the Linuxppc64-dev mailing list