boostorg/smart_ptr
1
0
Fork 1
mirror of https://github.com/boostorg/smart_ptr.git synced 2025-07-31 13:17:23 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge [58094] to release.

Browse Source 
[SVN r58122]
This commit is contained in:
Peter Dimov
2009-12-03 17:50:37 +00:00
parent b0fd8a6b08
commit a3b84f8586
1 changed files with 20 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
include/boost/memory_order.hpp
View File

@ -11,7 +11,7 @@
// //
// Defines enum boost::memory_order per the C++0x working draft // Defines enum boost::memory_order per the C++0x working draft
// //
// Copyright (c) 2008 Peter Dimov // Copyright (c) 2008, 2009 Peter Dimov
// //
// Distributed under the Boost Software License, Version 1.0. // Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE_1_0.txt or copy at // See accompanying file LICENSE_1_0.txt or copy at
@ -21,13 +21,31 @@
namespace boost namespace boost
{ {
//
// Enum values are chosen so that code that needs to insert
// a trailing fence for acquire semantics can use a single
// test such as:
//
// if( mo & memory_order_acquire ) { ...fence... }
//
// For leading fences one can use:
//
// if( mo & memory_order_release ) { ...fence... }
//
// Architectures such as Alpha that need a fence on consume
// can use:
//
// if( mo & ( memory_order_acquire | memory_order_consume ) ) { ...fence... }
//
enum memory_order enum memory_order
{ {
memory_order_relaxed = 0, memory_order_relaxed = 0,
memory_order_acquire = 1, memory_order_acquire = 1,
memory_order_release = 2, memory_order_release = 2,
memory_order_acq_rel = 3, // acquire | release memory_order_acq_rel = 3, // acquire | release
memory_order_seq_cst = 7 // acq_rel | 4 memory_order_seq_cst = 7, // acq_rel | 4
memory_order_consume = 8
}; };
} // namespace boost } // namespace boost