about summary refs log tree commit diff
path: root/src/test/codegen/src-hash-algorithm/src-hash-algorithm-sha1.rs
diff options
context:
space:
mode:
authorMara Bos <m-ou.se@m-ou.se>2020-11-18 15:46:27 +0100
committerGitHub <noreply@github.com>2020-11-18 15:46:27 +0100
commitad6fd9b0372e9948658eab6779e636dd7f1eede1 (patch)
treef3d4c05999977cea37512536a3789f1798ac2193 /src/test/codegen/src-hash-algorithm/src-hash-algorithm-sha1.rs
parent92dcf6d733e48189f7c9fdd9da66fb55370590c3 (diff)
parent55d7f736d8c62cc0a03594302538001ef3f3411d (diff)
downloadrust-ad6fd9b0372e9948658eab6779e636dd7f1eede1.tar.gz
rust-ad6fd9b0372e9948658eab6779e636dd7f1eede1.zip
Rollup merge of #79039 - thomcc:weakly-relaxing, r=Amanieu
Tighten the bounds on atomic Ordering in std::sys::unix::weak::Weak

This moves reading this from multiple SeqCst reads to Relaxed read + Acquire fence if we are actually going to use the data.

Would love to avoid the Acquire fence, but doing so would need Ordering::Consume, which neither Rust, nor LLVM supports (a shame, since this fence is hardly free on ARM, which is what I was hoping to improve).

r? ``@Amanieu`` (Sorry for always picking you, but I know a lot of people wouldn't feel comfortable reviewing atomic ordering changes)
Diffstat (limited to 'src/test/codegen/src-hash-algorithm/src-hash-algorithm-sha1.rs')
0 files changed, 0 insertions, 0 deletions