Re: recursive spinlocks. Shoot.

[Daniel Phillips <phillips@arcor.de>]

On Monday 19 May 2003 13:37, Nikita Danilov wrote:
> There, however, are cases when recursive locking is needed. Take, for
> example, top-to-bottom insertion into balanced tree with per-node
> locking. Once modifications are done at the "leaf" level, parents should
> be locked and modified, but one cannot tell in advance whether different
> leaves have the same or different parents. Simplest (and, sometimes, the
> only) solution here is to lock parents of all children in turn, even if
> this may lock the same parent node several times---recursively.

Having locked the parent of one child you then check whether the parent of the 
second child is in fact the same, in which case you already hold the lock and 
must remember to unlock it only once, otherwise lock the second parent.  Do 
you see a hole in that?

Regards,

Daniel