summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
Diffstat (limited to '3rdParty/Boost/src/boost/memory_order.hpp')
-rw-r--r--3rdParty/Boost/src/boost/memory_order.hpp22
1 files changed, 20 insertions, 2 deletions
diff --git a/3rdParty/Boost/src/boost/memory_order.hpp b/3rdParty/Boost/src/boost/memory_order.hpp
index 2524e8a..4945af6 100644
--- a/3rdParty/Boost/src/boost/memory_order.hpp
+++ b/3rdParty/Boost/src/boost/memory_order.hpp
@@ -11,7 +11,7 @@
//
// 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.
// See accompanying file LICENSE_1_0.txt or copy at
@@ -21,13 +21,31 @@
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
{
memory_order_relaxed = 0,
memory_order_acquire = 1,
memory_order_release = 2,
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