mirror of git://git.musl-libc.org/musl
de7e99c585
when manipulating the robust list, the order of stores matters, because the code may be asynchronously interrupted by a fatal signal and the kernel will then access the robust list in what is essentially an async-signal context. previously, aliasing considerations made it seem unlikely that a compiler could reorder the stores, but proving that they could not be reordered incorrectly would have been extremely difficult. instead I've opted to make all the pointers used as part of the robust list, including those in the robust list head and in the individual mutexes, volatile. in addition, the format of the robust list has been changed to point back to the head at the end, rather than ending with a null pointer. this is to match the documented kernel robust list ABI. the null pointer, which was previously used, only worked because faults during access terminate the robust list processing. |
||
|---|---|---|
| .. | ||
| arm | ||
| i386 | ||
| microblaze | ||
| mips | ||
| or1k | ||
| powerpc | ||
| sh | ||
| x32 | ||
| x86_64 | ||