Re: Segfault hidden in list.h

[Linus Torvalds]

On Sun, 12 May 2002, Rose, Billy wrote:
>
> If something is accessing the list in reverse at the time of insertion and
> "next->prev = new;" has been executed, there exists a moment when new->prev

No.

If the coder doesn't lock his data structures, it doesn't matter _what_
order we execute the list modifications in - different architectures will
do different thing with inter-CPU memory ordering, and trying to order
memory accesses on a source level is futile.

		Linus