Messages in this thread | | | Date | Sun, 12 May 2002 17:59:27 -0700 (PDT) | From | Linus Torvalds <> | Subject | Re: Segfault hidden in list.h |
| |
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
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |