mirror of
https://github.com/baldurk/renderdoc.git
synced 2026-07-22 23:41:39 +00:00
baldurk
768e812e45
* On windows it's strongly desired to be able to compile straight out of a clean checkout or source download. This means anyone can download the source and investigate something quickly, without having to worry about the hassle of figuring out how the project downloads 3rd party dependencies, fetching them, getting them registered in the right place. * This can't be put in a submodule as git submodules don't get downloaded by default so people new to git will get confusing compilation messages, and someone downloading the source from github directly without cloning via git won't get submodules included. * It does add some extra size to a fresh download/checkout which is unfortunate, but absolutely worth the cost. Shallow checkouts still aren't unfeasibly large, and it's only a one-off cost at clone time.
387 lines
15 KiB
C++
387 lines
15 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2011 Thiago Macieira <thiago@kde.org>
|
|
** Copyright (C) 2016 Intel Corporation.
|
|
** Contact: https://www.qt.io/licensing/
|
|
**
|
|
** This file is part of the QtCore module of the Qt Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:LGPL$
|
|
** Commercial License Usage
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
** accordance with the commercial license agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
**
|
|
** GNU Lesser General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
** General Public License version 3 as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.LGPL3 included in the
|
|
** packaging of this file. Please review the following information to
|
|
** ensure the GNU Lesser General Public License version 3 requirements
|
|
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
|
|
**
|
|
** GNU General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
** General Public License version 2.0 or (at your option) the GNU General
|
|
** Public license version 3 or any later version approved by the KDE Free
|
|
** Qt Foundation. The licenses are as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
|
|
** included in the packaging of this file. Please review the following
|
|
** information to ensure the GNU General Public License requirements will
|
|
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
|
|
** https://www.gnu.org/licenses/gpl-3.0.html.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#ifndef QGENERICATOMIC_H
|
|
#define QGENERICATOMIC_H
|
|
|
|
#include <QtCore/qglobal.h>
|
|
#include <QtCore/qtypeinfo.h>
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
#if 0
|
|
// silence syncqt warnings
|
|
QT_END_NAMESPACE
|
|
#pragma qt_sync_skip_header_check
|
|
#pragma qt_sync_stop_processing
|
|
#endif
|
|
|
|
template<int> struct QAtomicOpsSupport { enum { IsSupported = 0 }; };
|
|
template<> struct QAtomicOpsSupport<4> { enum { IsSupported = 1 }; };
|
|
|
|
template <typename T> struct QAtomicAdditiveType
|
|
{
|
|
typedef T AdditiveT;
|
|
static const int AddScale = 1;
|
|
};
|
|
template <typename T> struct QAtomicAdditiveType<T *>
|
|
{
|
|
typedef qptrdiff AdditiveT;
|
|
static const int AddScale = sizeof(T);
|
|
};
|
|
|
|
// not really atomic...
|
|
template <typename BaseClass> struct QGenericAtomicOps
|
|
{
|
|
template <typename T> struct AtomicType { typedef T Type; typedef T *PointerType; };
|
|
|
|
template <typename T> static void acquireMemoryFence(const T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
}
|
|
template <typename T> static void releaseMemoryFence(const T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
}
|
|
template <typename T> static void orderedMemoryFence(const T &) Q_DECL_NOTHROW
|
|
{
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T load(const T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
return _q_value;
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
void store(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
_q_value = newValue;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T loadAcquire(const T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = *static_cast<const volatile T *>(&_q_value);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
void storeRelease(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
*static_cast<volatile T *>(&_q_value) = newValue;
|
|
}
|
|
|
|
static inline Q_DECL_CONSTEXPR bool isReferenceCountingNative() Q_DECL_NOTHROW
|
|
{ return BaseClass::isFetchAndAddNative(); }
|
|
static inline Q_DECL_CONSTEXPR bool isReferenceCountingWaitFree() Q_DECL_NOTHROW
|
|
{ return BaseClass::isFetchAndAddWaitFree(); }
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
bool ref(T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
return BaseClass::fetchAndAddRelaxed(_q_value, 1) != T(-1);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
bool deref(T &_q_value) Q_DECL_NOTHROW
|
|
{
|
|
return BaseClass::fetchAndAddRelaxed(_q_value, -1) != 1;
|
|
}
|
|
|
|
#if 0
|
|
// These functions have no default implementation
|
|
// Archictectures must implement them
|
|
static inline Q_DECL_CONSTEXPR bool isTestAndSetNative() Q_DECL_NOTHROW;
|
|
static inline Q_DECL_CONSTEXPR bool isTestAndSetWaitFree() Q_DECL_NOTHROW;
|
|
template <typename T, typename X> static inline
|
|
bool testAndSetRelaxed(T &_q_value, X expectedValue, X newValue) Q_DECL_NOTHROW;
|
|
template <typename T, typename X> static inline
|
|
bool testAndSetRelaxed(T &_q_value, X expectedValue, X newValue, X *currentValue) Q_DECL_NOTHROW;
|
|
#endif
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetAcquire(T &_q_value, X expectedValue, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
bool tmp = BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetRelease(T &_q_value, X expectedValue, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue);
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetOrdered(T &_q_value, X expectedValue, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue);
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetAcquire(T &_q_value, X expectedValue, X newValue, X *currentValue) Q_DECL_NOTHROW
|
|
{
|
|
bool tmp = BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue, currentValue);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetRelease(T &_q_value, X expectedValue, X newValue, X *currentValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue, currentValue);
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
bool testAndSetOrdered(T &_q_value, X expectedValue, X newValue, X *currentValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::testAndSetRelaxed(_q_value, expectedValue, newValue, currentValue);
|
|
}
|
|
|
|
static inline Q_DECL_CONSTEXPR bool isFetchAndStoreNative() Q_DECL_NOTHROW { return false; }
|
|
static inline Q_DECL_CONSTEXPR bool isFetchAndStoreWaitFree() Q_DECL_NOTHROW { return false; }
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
T fetchAndStoreRelaxed(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndStore on top of testAndSet
|
|
Q_FOREVER {
|
|
T tmp = load(_q_value);
|
|
if (BaseClass::testAndSetRelaxed(_q_value, tmp, newValue))
|
|
return tmp;
|
|
}
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
T fetchAndStoreAcquire(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndStoreRelaxed(_q_value, newValue);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
T fetchAndStoreRelease(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndStoreRelaxed(_q_value, newValue);
|
|
}
|
|
|
|
template <typename T, typename X> static Q_ALWAYS_INLINE
|
|
T fetchAndStoreOrdered(T &_q_value, X newValue) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndStoreRelaxed(_q_value, newValue);
|
|
}
|
|
|
|
static inline Q_DECL_CONSTEXPR bool isFetchAndAddNative() Q_DECL_NOTHROW { return false; }
|
|
static inline Q_DECL_CONSTEXPR bool isFetchAndAddWaitFree() Q_DECL_NOTHROW { return false; }
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAddRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndAdd on top of testAndSet
|
|
Q_FOREVER {
|
|
T tmp = BaseClass::load(_q_value);
|
|
if (BaseClass::testAndSetRelaxed(_q_value, tmp, T(tmp + valueToAdd)))
|
|
return tmp;
|
|
}
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAddAcquire(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAddRelease(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAddOrdered(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT valueToAdd) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndAddRelaxed(_q_value, valueToAdd);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndSubRelaxed(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT operand) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndSub on top of fetchAndAdd
|
|
return fetchAndAddRelaxed(_q_value, -operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndSubAcquire(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT operand) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndSubRelaxed(_q_value, operand);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndSubRelease(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndSubRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndSubOrdered(T &_q_value, typename QAtomicAdditiveType<T>::AdditiveT operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndSubRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAndRelaxed(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndAnd on top of testAndSet
|
|
T tmp = BaseClass::load(_q_value);
|
|
Q_FOREVER {
|
|
if (BaseClass::testAndSetRelaxed(_q_value, tmp, T(tmp & operand), &tmp))
|
|
return tmp;
|
|
}
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAndAcquire(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndAndRelaxed(_q_value, operand);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAndRelease(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndAndRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndAndOrdered(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndAndRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndOrRelaxed(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndOr on top of testAndSet
|
|
T tmp = BaseClass::load(_q_value);
|
|
Q_FOREVER {
|
|
if (BaseClass::testAndSetRelaxed(_q_value, tmp, T(tmp | operand), &tmp))
|
|
return tmp;
|
|
}
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndOrAcquire(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndOrRelaxed(_q_value, operand);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndOrRelease(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndOrRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndOrOrdered(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndOrRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndXorRelaxed(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
// implement fetchAndXor on top of testAndSet
|
|
T tmp = BaseClass::load(_q_value);
|
|
Q_FOREVER {
|
|
if (BaseClass::testAndSetRelaxed(_q_value, tmp, T(tmp ^ operand), &tmp))
|
|
return tmp;
|
|
}
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndXorAcquire(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
T tmp = BaseClass::fetchAndXorRelaxed(_q_value, operand);
|
|
BaseClass::acquireMemoryFence(_q_value);
|
|
return tmp;
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndXorRelease(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::releaseMemoryFence(_q_value);
|
|
return BaseClass::fetchAndXorRelaxed(_q_value, operand);
|
|
}
|
|
|
|
template <typename T> static Q_ALWAYS_INLINE
|
|
T fetchAndXorOrdered(T &_q_value, typename std::enable_if<QTypeInfo<T>::isIntegral, T>::type operand) Q_DECL_NOTHROW
|
|
{
|
|
BaseClass::orderedMemoryFence(_q_value);
|
|
return BaseClass::fetchAndXorRelaxed(_q_value, operand);
|
|
}
|
|
};
|
|
|
|
QT_END_NAMESPACE
|
|
#endif // QGENERICATOMIC_H
|