mirror of
https://github.com/ETLCPP/etl.git
synced 2026-06-30 06:18:50 +08:00
795 lines
18 KiB
C++
795 lines
18 KiB
C++
/******************************************************************************
|
|
The MIT License(MIT)
|
|
|
|
Embedded Template Library.
|
|
https://github.com/ETLCPP/etl
|
|
https://www.etlcpp.com
|
|
|
|
Copyright(c) 2017 jwellbelove
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files(the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions :
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
SOFTWARE.
|
|
******************************************************************************/
|
|
|
|
#ifndef ETL_ATOMIC_GCC_SYNC_INCLUDED
|
|
#define ETL_ATOMIC_GCC_SYNC_INCLUDED
|
|
|
|
#include "../platform.h"
|
|
#include "../type_traits.h"
|
|
#include "../static_assert.h"
|
|
#include "../nullptr.h"
|
|
#include "../char_traits.h"
|
|
|
|
#include <stdint.h>
|
|
|
|
#if defined(ETL_COMPILER_GCC)
|
|
#pragma GCC diagnostic push
|
|
#pragma GCC diagnostic ignored "-Wunused-parameter"
|
|
#endif
|
|
|
|
namespace etl
|
|
{
|
|
//***************************************************************************
|
|
// Atomic type for pre C++11 GCC compilers that support the builtin '__sync' functions.
|
|
// Only integral and pointer types are supported.
|
|
//***************************************************************************
|
|
|
|
typedef enum memory_order
|
|
{
|
|
memory_order_relaxed,
|
|
memory_order_consume,
|
|
memory_order_acquire,
|
|
memory_order_release,
|
|
memory_order_acq_rel,
|
|
memory_order_seq_cst
|
|
} memory_order;
|
|
|
|
template <typename T>
|
|
class atomic
|
|
{
|
|
public:
|
|
|
|
ETL_STATIC_ASSERT(etl::is_integral<T>::value, "Only integral types are supported");
|
|
|
|
atomic()
|
|
: value(0)
|
|
{
|
|
}
|
|
|
|
atomic(T v)
|
|
: value(v)
|
|
{
|
|
}
|
|
|
|
// Assignment
|
|
T operator =(T v)
|
|
{
|
|
store(v);
|
|
|
|
return v;
|
|
}
|
|
|
|
T operator =(T v) volatile
|
|
{
|
|
store(v);
|
|
|
|
return v;
|
|
}
|
|
|
|
// Pre-increment
|
|
T operator ++()
|
|
{
|
|
return fetch_add(1) + 1;
|
|
}
|
|
|
|
T operator ++() volatile
|
|
{
|
|
return fetch_add(1) + 1;
|
|
}
|
|
|
|
// Post-increment
|
|
T operator ++(int)
|
|
{
|
|
return fetch_add(1);
|
|
}
|
|
|
|
T operator ++(int) volatile
|
|
{
|
|
return fetch_add(1);
|
|
}
|
|
|
|
// Pre-decrement
|
|
T operator --()
|
|
{
|
|
return fetch_sub(1) + 1;
|
|
}
|
|
|
|
T operator --() volatile
|
|
{
|
|
return fetch_sub(1) + 1;
|
|
}
|
|
|
|
// Post-decrement
|
|
T operator --(int)
|
|
{
|
|
return fetch_sub(1);
|
|
}
|
|
|
|
T operator --(int) volatile
|
|
{
|
|
return fetch_sub(1);
|
|
}
|
|
|
|
// Add
|
|
T operator +=(T v)
|
|
{
|
|
return fetch_add(v) + v;
|
|
}
|
|
|
|
T operator +=(T v) volatile
|
|
{
|
|
return fetch_add(v) + v;
|
|
}
|
|
|
|
// Subtract
|
|
T operator -=(T v)
|
|
{
|
|
return fetch_sub(v) - v;
|
|
}
|
|
|
|
T operator -=(T v) volatile
|
|
{
|
|
return fetch_sub(v) - v;
|
|
}
|
|
|
|
// And
|
|
T operator &=(T v)
|
|
{
|
|
return fetch_and(v) & v;
|
|
}
|
|
|
|
T operator &=(T v) volatile
|
|
{
|
|
return fetch_and(v) & v;
|
|
}
|
|
|
|
// Or
|
|
T operator |=(T v)
|
|
{
|
|
return fetch_or(v) | v;
|
|
}
|
|
|
|
T operator |=(T v) volatile
|
|
{
|
|
return fetch_or(v) | v;
|
|
}
|
|
|
|
// Exclusive or
|
|
T operator ^=(T v)
|
|
{
|
|
return fetch_xor(v) ^ v;
|
|
}
|
|
|
|
T operator ^=(T v) volatile
|
|
{
|
|
return fetch_xor(v) ^ v;
|
|
}
|
|
|
|
// Conversion operator
|
|
operator T () const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
operator T() volatile const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
// Is lock free?
|
|
bool is_lock_free() const
|
|
{
|
|
return true;
|
|
}
|
|
|
|
bool is_lock_free() const volatile
|
|
{
|
|
return true;
|
|
}
|
|
|
|
// Store
|
|
void store(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
__sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
void store(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
__sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
// Load
|
|
T load(etl::memory_order order = etl::memory_order_seq_cst) const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
T load(etl::memory_order order = etl::memory_order_seq_cst) const volatile
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
// Fetch add
|
|
T fetch_add(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_add(&value, v);
|
|
}
|
|
|
|
T fetch_add(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_add(&value, v);
|
|
}
|
|
|
|
// Fetch subtract
|
|
T fetch_sub(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_sub(&value, v);
|
|
}
|
|
|
|
T fetch_sub(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_sub(&value, v);
|
|
}
|
|
|
|
// Fetch or
|
|
T fetch_or(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_or(&value, v);
|
|
}
|
|
|
|
T fetch_or(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_or(&value, v);
|
|
}
|
|
|
|
// Fetch and
|
|
T fetch_and(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_and(&value, v);
|
|
}
|
|
|
|
T fetch_and(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_and(&value, v);
|
|
}
|
|
|
|
// Fetch exclusive or
|
|
T fetch_xor(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_xor(&value, v);
|
|
}
|
|
|
|
T fetch_xor(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_xor(&value, v);
|
|
}
|
|
|
|
// Exchange
|
|
T exchange(T v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
T exchange(T v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
// Compare exchange weak
|
|
bool compare_exchange_weak(T& expected, T desired, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
T old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T& expected, T desired, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
T old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T& expected, T desired, etl::memory_order success, etl::memory_order failure)
|
|
{
|
|
T old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T& expected, T desired, etl::memory_order success, etl::memory_order failure) volatile
|
|
{
|
|
T old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// Compare exchange strong
|
|
bool compare_exchange_strong(T& expected, T desired, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
T old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T& expected, T desired, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
T old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T& expected, T desired, etl::memory_order success, etl::memory_order failure)
|
|
{
|
|
T old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T& expected, T desired, etl::memory_order success, etl::memory_order failure) volatile
|
|
{
|
|
T old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
private:
|
|
|
|
atomic& operator =(const atomic&);
|
|
atomic& operator =(const atomic&) volatile;
|
|
|
|
mutable volatile T value;
|
|
};
|
|
|
|
template <typename T>
|
|
class atomic<T*>
|
|
{
|
|
public:
|
|
|
|
atomic()
|
|
: value(nullptr)
|
|
{
|
|
}
|
|
|
|
atomic(T* v)
|
|
: value(v)
|
|
{
|
|
}
|
|
|
|
// Assignment
|
|
T* operator =(T* v)
|
|
{
|
|
store(v);
|
|
|
|
return v;
|
|
}
|
|
|
|
T* operator =(T* v) volatile
|
|
{
|
|
store(v);
|
|
|
|
return v;
|
|
}
|
|
|
|
// Pre-increment
|
|
T* operator ++()
|
|
{
|
|
return fetch_add(1) + 1;
|
|
}
|
|
|
|
T* operator ++() volatile
|
|
{
|
|
return fetch_add(1) + 1;
|
|
}
|
|
|
|
// Post-increment
|
|
T* operator ++(int)
|
|
{
|
|
return fetch_add(1);
|
|
}
|
|
|
|
T* operator ++(int) volatile
|
|
{
|
|
return fetch_add(1);
|
|
}
|
|
|
|
// Pre-decrement
|
|
T* operator --()
|
|
{
|
|
return fetch_sub(1) + 1;
|
|
}
|
|
|
|
T* operator --() volatile
|
|
{
|
|
return fetch_sub(1) + 1;
|
|
}
|
|
|
|
// Post-decrement
|
|
T* operator --(int)
|
|
{
|
|
return fetch_sub(1);
|
|
}
|
|
|
|
T* operator --(int) volatile
|
|
{
|
|
return fetch_sub(1);
|
|
}
|
|
|
|
// Add
|
|
T* operator +=(ptrdiff_t v)
|
|
{
|
|
return fetch_add(v) + v;
|
|
}
|
|
|
|
T* operator +=(ptrdiff_t v) volatile
|
|
{
|
|
return fetch_add(v) + v;
|
|
}
|
|
|
|
// Subtract
|
|
T* operator -=(ptrdiff_t v)
|
|
{
|
|
return fetch_sub(v) - v;
|
|
}
|
|
|
|
T* operator -=(ptrdiff_t v) volatile
|
|
{
|
|
return fetch_sub(v) - v;
|
|
}
|
|
|
|
// Conversion operator
|
|
operator T* () const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
operator T*() volatile const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
// Is lock free?
|
|
bool is_lock_free() const
|
|
{
|
|
return true;
|
|
}
|
|
|
|
bool is_lock_free() const volatile
|
|
{
|
|
return true;
|
|
}
|
|
|
|
// Store
|
|
void store(T* v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
__sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
void store(T* v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
__sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
// Load
|
|
T* load(etl::memory_order order = etl::memory_order_seq_cst) const
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
T* load(etl::memory_order order = etl::memory_order_seq_cst) const volatile
|
|
{
|
|
return __sync_fetch_and_add(&value, 0);
|
|
}
|
|
|
|
// Fetch add
|
|
T* fetch_add(ptrdiff_t v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_add(&value, v);
|
|
}
|
|
|
|
T* fetch_add(ptrdiff_t v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_add(&value, v);
|
|
}
|
|
|
|
// Fetch subtract
|
|
T* fetch_sub(ptrdiff_t v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_fetch_and_sub(&value, v);
|
|
}
|
|
|
|
T* fetch_sub(ptrdiff_t v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_fetch_and_sub(&value, v);
|
|
}
|
|
|
|
// Exchange
|
|
T* exchange(T* v, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
return __sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
T* exchange(T* v, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
return __sync_lock_test_and_set(&value, v);
|
|
}
|
|
|
|
// Compare exchange weak
|
|
bool compare_exchange_weak(T*& expected, T* desired, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
T* old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T*& expected, T* desired, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
T* old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T*& expected, T* desired, etl::memory_order success, etl::memory_order failure)
|
|
{
|
|
T* old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool compare_exchange_weak(T*& expected, T* desired, etl::memory_order success, etl::memory_order failure) volatile
|
|
{
|
|
T* old = __sync_val_compare_and_swap(&value, expected, desired);
|
|
|
|
if (old == expected)
|
|
{
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// Compare exchange strong
|
|
bool compare_exchange_strong(T*& expected, T* desired, etl::memory_order order = etl::memory_order_seq_cst)
|
|
{
|
|
T* old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T*)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T*& expected, T* desired, etl::memory_order order = etl::memory_order_seq_cst) volatile
|
|
{
|
|
T* old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T*)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T*& expected, T* desired, etl::memory_order success, etl::memory_order failure)
|
|
{
|
|
T* old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T*)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool compare_exchange_strong(T*& expected, T* desired, etl::memory_order success, etl::memory_order failure) volatile
|
|
{
|
|
T* old = expected;
|
|
|
|
while (!compare_exchange_weak(old, desired))
|
|
{
|
|
if (memcmp(&old, &expected, sizeof(T*)))
|
|
{
|
|
expected = old;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
private:
|
|
|
|
atomic& operator =(const atomic&);
|
|
atomic& operator =(const atomic&) volatile;
|
|
|
|
mutable volatile T* value;
|
|
};
|
|
|
|
typedef etl::atomic<char> atomic_char;
|
|
typedef etl::atomic<signed char> atomic_schar;
|
|
typedef etl::atomic<unsigned char> atomic_uchar;
|
|
typedef etl::atomic<short> atomic_short;
|
|
typedef etl::atomic<unsigned short> atomic_ushort;
|
|
typedef etl::atomic<int> atomic_int;
|
|
typedef etl::atomic<unsigned int> atomic_uint;
|
|
typedef etl::atomic<long> atomic_long;
|
|
typedef etl::atomic<unsigned long> atomic_ulong;
|
|
typedef etl::atomic<long long> atomic_llong;
|
|
typedef etl::atomic<unsigned long long> atomic_ullong;
|
|
typedef etl::atomic<wchar_t> atomic_wchar_t;
|
|
typedef etl::atomic<char16_t> atomic_char16_t;
|
|
typedef etl::atomic<char32_t> atomic_char32_t;
|
|
typedef etl::atomic<uint8_t> atomic_uint8_t;
|
|
typedef etl::atomic<int8_t> atomic_int8_t;
|
|
typedef etl::atomic<uint16_t> atomic_uint16_t;
|
|
typedef etl::atomic<int16_t> atomic_int16_t;
|
|
typedef etl::atomic<uint32_t> atomic_uint32_t;
|
|
typedef etl::atomic<int32_t> atomic_int32_t;
|
|
typedef etl::atomic<uint64_t> atomic_uint64_t;
|
|
typedef etl::atomic<int64_t> atomic_int64_t;
|
|
typedef etl::atomic<int_least8_t> atomic_int_least8_t;
|
|
typedef etl::atomic<uint_least8_t> atomic_uint_least8_t;
|
|
typedef etl::atomic<int_least16_t> atomic_int_least16_t;
|
|
typedef etl::atomic<uint_least16_t> atomic_uint_least16_t;
|
|
typedef etl::atomic<int_least32_t> atomic_int_least32_t;
|
|
typedef etl::atomic<uint_least32_t> atomic_uint_least32_t;
|
|
typedef etl::atomic<int_least64_t> atomic_int_least64_t;
|
|
typedef etl::atomic<uint_least64_t> atomic_uint_least64_t;
|
|
typedef etl::atomic<int_fast8_t> atomic_int_fast8_t;
|
|
typedef etl::atomic<uint_fast8_t> atomic_uint_fast8_t;
|
|
typedef etl::atomic<int_fast16_t> atomic_int_fast16_t;
|
|
typedef etl::atomic<uint_fast16_t> atomic_uint_fast16_t;
|
|
typedef etl::atomic<int_fast32_t> atomic_int_fast32_t;
|
|
typedef etl::atomic<uint_fast32_t> atomic_uint_fast32_t;
|
|
typedef etl::atomic<int_fast64_t> atomic_int_fast64_t;
|
|
typedef etl::atomic<uint_fast64_t> atomic_uint_fast64_t;
|
|
typedef etl::atomic<intptr_t> atomic_intptr_t;
|
|
typedef etl::atomic<uintptr_t> atomic_uintptr_t;
|
|
typedef etl::atomic<size_t> atomic_size_t;
|
|
typedef etl::atomic<ptrdiff_t> atomic_ptrdiff_t;
|
|
typedef etl::atomic<intmax_t> atomic_intmax_t;
|
|
typedef etl::atomic<uintmax_t> atomic_uintmax_t;
|
|
}
|
|
|
|
#if defined(ETL_COMPILER_GCC)
|
|
#pragma GCC diagnostic pop
|
|
#endif
|
|
|
|
#endif
|