diff options
author | Rich Felker <dalias@aerifal.cx> | 2015-07-28 18:40:18 +0000 |
---|---|---|
committer | Rich Felker <dalias@aerifal.cx> | 2015-07-28 18:40:18 +0000 |
commit | 3c43c0761e1725fd5f89a9c028cbf43250abb913 (patch) | |
tree | f8f504aaafc22502a8aec0a4ba58c60856096495 /src/stdio/putchar_unlocked.c | |
parent | fe7582f4f92152ab60e9523bf146fe28ceae51f6 (diff) | |
download | musl-3c43c0761e1725fd5f89a9c028cbf43250abb913.tar.gz musl-3c43c0761e1725fd5f89a9c028cbf43250abb913.tar.bz2 musl-3c43c0761e1725fd5f89a9c028cbf43250abb913.tar.xz musl-3c43c0761e1725fd5f89a9c028cbf43250abb913.zip |
fix missing synchronization in atomic store on i386 and x86_64
despite being strongly ordered, the x86 memory model does not preclude
reordering of loads across earlier stores. while a plain store
suffices as a release barrier, we actually need a full barrier, since
users of a_store subsequently load a waiter count to determine whether
to issue a futex wait, and using a stale count will result in soft
(fail-to-wake) deadlocks. these deadlocks were observed in malloc and
possible with stdio locks and other libc-internal locking.
on i386, an atomic operation on the caller's stack is used as the
barrier rather than performing the store itself using xchg; this
avoids the need to read the cache line on which the store is being
performed. mfence is used on x86_64 where it's always available, and
could be used on i386 with the appropriate cpu model checks if it's
shown to perform better.
Diffstat (limited to 'src/stdio/putchar_unlocked.c')
0 files changed, 0 insertions, 0 deletions