//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // template // bool // atomic_compare_exchange_weak_explicit(volatile atomic* obj, T* expc, // T desr, // memory_order s, memory_order f); // // template // bool // atomic_compare_exchange_weak_explicit(atomic* obj, T* expc, T desr, // memory_order s, memory_order f); #include #include #include template void test() { { typedef std::atomic A; A a; T t(T(1)); std::atomic_init(&a, t); assert(std::atomic_compare_exchange_weak_explicit(&a, &t, T(2), std::memory_order_seq_cst, std::memory_order_seq_cst) == true); assert(a == T(2)); assert(t == T(1)); assert(std::atomic_compare_exchange_weak_explicit(&a, &t, T(3), std::memory_order_seq_cst, std::memory_order_seq_cst) == false); assert(a == T(2)); assert(t == T(2)); } { typedef std::atomic A; volatile A a; T t(T(1)); std::atomic_init(&a, t); assert(std::atomic_compare_exchange_weak_explicit(&a, &t, T(2), std::memory_order_seq_cst, std::memory_order_seq_cst) == true); assert(a == T(2)); assert(t == T(1)); assert(std::atomic_compare_exchange_weak_explicit(&a, &t, T(3), std::memory_order_seq_cst, std::memory_order_seq_cst) == false); assert(a == T(2)); assert(t == T(2)); } } struct A { int i; explicit A(int d = 0) : i(d) {} friend bool operator==(const A& x, const A& y) {return x.i == y.i;} }; int main() { test(); test(); test(); test(); test(); test(); test(); test(); test(); test(); test(); test(); test(); #ifndef _LIBCPP_HAS_NO_UNICODE_CHARS test(); test(); #endif // _LIBCPP_HAS_NO_UNICODE_CHARS test(); test(); }