You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
501 lines
15 KiB
501 lines
15 KiB
14 years ago
|
/****************************************************************************
|
||
|
**
|
||
|
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
|
||
|
** All rights reserved.
|
||
|
** Contact: Nokia Corporation (qt-info@nokia.com)
|
||
|
**
|
||
|
** This file is part of the QtCore module of the Qt Toolkit.
|
||
|
**
|
||
|
** $QT_BEGIN_LICENSE:LGPL$
|
||
|
** Commercial Usage
|
||
|
** Licensees holding valid Qt Commercial licenses may use this file in
|
||
|
** accordance with the Qt Commercial License Agreement provided with the
|
||
|
** Software or, alternatively, in accordance with the terms contained in
|
||
|
** a written agreement between you and Nokia.
|
||
|
**
|
||
|
** GNU Lesser General Public License Usage
|
||
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
||
|
** General Public License version 2.1 as published by the Free Software
|
||
|
** Foundation and appearing in the file LICENSE.LGPL included in the
|
||
|
** packaging of this file. Please review the following information to
|
||
|
** ensure the GNU Lesser General Public License version 2.1 requirements
|
||
|
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
||
|
**
|
||
|
** In addition, as a special exception, Nokia gives you certain additional
|
||
|
** rights. These rights are described in the Nokia Qt LGPL Exception
|
||
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
||
|
**
|
||
|
** GNU General Public License Usage
|
||
|
** Alternatively, this file may be used under the terms of the GNU
|
||
|
** General Public License version 3.0 as published by the Free Software
|
||
|
** Foundation and appearing in the file LICENSE.GPL included in the
|
||
|
** packaging of this file. Please review the following information to
|
||
|
** ensure the GNU General Public License version 3.0 requirements will be
|
||
|
** met: http://www.gnu.org/copyleft/gpl.html.
|
||
|
**
|
||
|
** If you have questions regarding the use of this file, please contact
|
||
|
** Nokia at qt-info@nokia.com.
|
||
|
** $QT_END_LICENSE$
|
||
|
**
|
||
|
****************************************************************************/
|
||
|
|
||
|
#ifndef QATOMIC_ARMV6_H
|
||
|
#define QATOMIC_ARMV6_H
|
||
|
|
||
|
QT_BEGIN_HEADER
|
||
|
|
||
|
QT_BEGIN_NAMESPACE
|
||
|
#define Q_ATOMIC_INT_REFERENCE_COUNTING_IS_ALWAYS_NATIVE
|
||
|
|
||
|
inline bool QBasicAtomicInt::isReferenceCountingNative()
|
||
|
{ return true; }
|
||
|
inline bool QBasicAtomicInt::isReferenceCountingWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_INT_TEST_AND_SET_IS_ALWAYS_NATIVE
|
||
|
|
||
|
inline bool QBasicAtomicInt::isTestAndSetNative()
|
||
|
{ return true; }
|
||
|
inline bool QBasicAtomicInt::isTestAndSetWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_INT_FETCH_AND_STORE_IS_ALWAYS_NATIVE
|
||
|
|
||
|
inline bool QBasicAtomicInt::isFetchAndStoreNative()
|
||
|
{ return true; }
|
||
|
inline bool QBasicAtomicInt::isFetchAndStoreWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_INT_FETCH_AND_ADD_IS_ALWAYS_NATIVE
|
||
|
|
||
|
inline bool QBasicAtomicInt::isFetchAndAddNative()
|
||
|
{ return true; }
|
||
|
inline bool QBasicAtomicInt::isFetchAndAddWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_POINTER_TEST_AND_SET_IS_ALWAYS_NATIVE
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isTestAndSetNative()
|
||
|
{ return true; }
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isTestAndSetWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_POINTER_FETCH_AND_STORE_IS_ALWAYS_NATIVE
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isFetchAndStoreNative()
|
||
|
{ return true; }
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isFetchAndStoreWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#define Q_ATOMIC_POINTER_FETCH_AND_ADD_IS_ALWAYS_NATIVE
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isFetchAndAddNative()
|
||
|
{ return true; }
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::isFetchAndAddWaitFree()
|
||
|
{ return false; }
|
||
|
|
||
|
#ifndef Q_CC_RVCT
|
||
|
|
||
|
inline bool QBasicAtomicInt::ref()
|
||
|
{
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[newValue], [%[_q_value]]\n"
|
||
|
"add %[newValue], %[newValue], #1\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [newValue] "=&r" (newValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return newValue != 0;
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::deref()
|
||
|
{
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[newValue], [%[_q_value]]\n"
|
||
|
"sub %[newValue], %[newValue], #1\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [newValue] "=&r" (newValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return newValue != 0;
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::testAndSetOrdered(int expectedValue, int newValue)
|
||
|
{
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[result], [%[_q_value]]\n"
|
||
|
"eors %[result], %[result], %[expectedValue]\n"
|
||
|
"strexeq %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teqeq %[result], #1\n"
|
||
|
"beq 0b\n"
|
||
|
: [result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [expectedValue] "r" (expectedValue),
|
||
|
[newValue] "r" (newValue),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return result == 0;
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndStoreOrdered(int newValue)
|
||
|
{
|
||
|
register int originalValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[originalValue], [%[_q_value]]\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [originalValue] "=&r" (originalValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [newValue] "r" (newValue),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndAddOrdered(int valueToAdd)
|
||
|
{
|
||
|
register int originalValue;
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[originalValue], [%[_q_value]]\n"
|
||
|
"add %[newValue], %[originalValue], %[valueToAdd]\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [originalValue] "=&r" (originalValue),
|
||
|
[newValue] "=&r" (newValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [valueToAdd] "r" (valueToAdd),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::testAndSetOrdered(T *expectedValue, T *newValue)
|
||
|
{
|
||
|
register T *result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[result], [%[_q_value]]\n"
|
||
|
"eors %[result], %[result], %[expectedValue]\n"
|
||
|
"strexeq %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teqeq %[result], #1\n"
|
||
|
"beq 0b\n"
|
||
|
: [result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [expectedValue] "r" (expectedValue),
|
||
|
[newValue] "r" (newValue),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return result == 0;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndStoreOrdered(T *newValue)
|
||
|
{
|
||
|
register T *originalValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[originalValue], [%[_q_value]]\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [originalValue] "=&r" (originalValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [newValue] "r" (newValue),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndAddOrdered(qptrdiff valueToAdd)
|
||
|
{
|
||
|
register T *originalValue;
|
||
|
register T *newValue;
|
||
|
register int result;
|
||
|
asm volatile("0:\n"
|
||
|
"ldrex %[originalValue], [%[_q_value]]\n"
|
||
|
"add %[newValue], %[originalValue], %[valueToAdd]\n"
|
||
|
"strex %[result], %[newValue], [%[_q_value]]\n"
|
||
|
"teq %[result], #0\n"
|
||
|
"bne 0b\n"
|
||
|
: [originalValue] "=&r" (originalValue),
|
||
|
[newValue] "=&r" (newValue),
|
||
|
[result] "=&r" (result),
|
||
|
"+m" (_q_value)
|
||
|
: [valueToAdd] "r" (valueToAdd * sizeof(T)),
|
||
|
[_q_value] "r" (&_q_value)
|
||
|
: "cc", "memory");
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
#else
|
||
|
// This is Q_CC_RVCT
|
||
|
|
||
|
// RVCT inline assembly documentation:
|
||
|
// http://www.keil.com/support/man/docs/armcc/armcc_chdcffdb.htm
|
||
|
// RVCT embedded assembly documentation:
|
||
|
// http://www.keil.com/support/man/docs/armcc/armcc_chddbeib.htm
|
||
|
|
||
|
// save our pragma state and switch to ARM mode
|
||
|
#pragma push
|
||
|
#pragma arm
|
||
|
|
||
|
inline bool QBasicAtomicInt::ref()
|
||
|
{
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex newValue, [&_q_value]
|
||
|
add newValue, newValue, #1
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return newValue != 0;
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::deref()
|
||
|
{
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex newValue, [&_q_value]
|
||
|
sub newValue, newValue, #1
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return newValue != 0;
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::testAndSetOrdered(int expectedValue, int newValue)
|
||
|
{
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex result, [&_q_value]
|
||
|
eors result, result, expectedValue
|
||
|
strexeq result, newValue, [&_q_value]
|
||
|
teqeq result, #1
|
||
|
beq retry
|
||
|
}
|
||
|
return result == 0;
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndStoreOrdered(int newValue)
|
||
|
{
|
||
|
register int originalValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex originalValue, [&_q_value]
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndAddOrdered(int valueToAdd)
|
||
|
{
|
||
|
register int originalValue;
|
||
|
register int newValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex originalValue, [&_q_value]
|
||
|
add newValue, originalValue, valueToAdd
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::testAndSetOrdered(T *expectedValue, T *newValue)
|
||
|
{
|
||
|
register T *result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex result, [&_q_value]
|
||
|
eors result, result, expectedValue
|
||
|
strexeq result, newValue, [&_q_value]
|
||
|
teqeq result, #1
|
||
|
beq retry
|
||
|
}
|
||
|
return result == 0;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndStoreOrdered(T *newValue)
|
||
|
{
|
||
|
register T *originalValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex originalValue, [&_q_value]
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndAddOrdered(qptrdiff valueToAdd)
|
||
|
{
|
||
|
register T *originalValue;
|
||
|
register T *newValue;
|
||
|
register int result;
|
||
|
retry:
|
||
|
__asm {
|
||
|
ldrex originalValue, [&_q_value]
|
||
|
add newValue, originalValue, valueToAdd * sizeof(T)
|
||
|
strex result, newValue, [&_q_value]
|
||
|
teq result, #0
|
||
|
bne retry
|
||
|
}
|
||
|
return originalValue;
|
||
|
}
|
||
|
|
||
|
// go back to the previous pragma state (probably Thumb mode)
|
||
|
#pragma pop
|
||
|
#endif
|
||
|
|
||
|
// common code
|
||
|
|
||
|
inline bool QBasicAtomicInt::testAndSetRelaxed(int expectedValue, int newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::testAndSetAcquire(int expectedValue, int newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
inline bool QBasicAtomicInt::testAndSetRelease(int expectedValue, int newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndStoreRelaxed(int newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndStoreAcquire(int newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndStoreRelease(int newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndAddRelaxed(int valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndAddAcquire(int valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
inline int QBasicAtomicInt::fetchAndAddRelease(int valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::testAndSetRelaxed(T *expectedValue, T *newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::testAndSetAcquire(T *expectedValue, T *newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE bool QBasicAtomicPointer<T>::testAndSetRelease(T *expectedValue, T *newValue)
|
||
|
{
|
||
|
return testAndSetOrdered(expectedValue, newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndStoreRelaxed(T *newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndStoreAcquire(T *newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndStoreRelease(T *newValue)
|
||
|
{
|
||
|
return fetchAndStoreOrdered(newValue);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndAddRelaxed(qptrdiff valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndAddAcquire(qptrdiff valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
Q_INLINE_TEMPLATE T *QBasicAtomicPointer<T>::fetchAndAddRelease(qptrdiff valueToAdd)
|
||
|
{
|
||
|
return fetchAndAddOrdered(valueToAdd);
|
||
|
}
|
||
|
|
||
|
QT_END_NAMESPACE
|
||
|
|
||
|
QT_END_HEADER
|
||
|
|
||
|
#endif // QATOMIC_ARMV6_H
|