CMake: remove unused config.tests (atomicfptr, avx512 and stl)
Change-Id: Ib42b3adc93bf4d43bd55fffd16c10873018acb04 Reviewed-by: Kai Koehne <kai.koehne@qt.io>
This commit is contained in:
Thiago Macieira
parent
37a25fce94
commit
d9f1d2c9df
@ -1,18 +0,0 @@
|
||||
Patch for fixing std::atomic support for function pointers for the Intel
|
||||
Composer XE 2016 (compiler version 16.0).
|
||||
|
||||
To apply:
|
||||
cd /opt/intel/compilers_and_libraries_2016/mac/include
|
||||
sudo patch -p1 < /path-to-this-file/icc2016_mac.diff
|
||||
|
||||
--- include/stdatomic.h.orig 2015-08-28 15:05:13.000000000 -0700
|
||||
+++ include/stdatomic.h 2015-08-28 15:19:25.000000000 -0700
|
||||
@@ -451,7 +451,7 @@
|
||||
}
|
||||
_STRONG_INLINE atomic() _DEFAULTED
|
||||
_STRONG_INLINE _CONSTEXPR atomic(T* _Ptr)
|
||||
- : atomic_address(_Ptr)
|
||||
+ : atomic_address((void*)_Ptr)
|
||||
{
|
||||
}
|
||||
_STRONG_INLINE T* operator+=(ptrdiff_t _V) volatile
|
||||
@ -1,3 +0,0 @@
|
||||
Patch is available from QNX. Please see
|
||||
|
||||
http://www.qnx.com/download/feature.html?programid=27555
|
||||
@ -1,111 +0,0 @@
|
||||
/****************************************************************************
|
||||
**
|
||||
** Copyright (C) 2017 Intel Corporation.
|
||||
** Contact: https://www.qt.io/licensing/
|
||||
**
|
||||
** This file is part of the configuration 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$
|
||||
**
|
||||
****************************************************************************/
|
||||
|
||||
#include <immintrin.h>
|
||||
|
||||
#ifndef __AVX512F__
|
||||
# error "There doesn't seem to be AVX-512 support in this compiler"
|
||||
#endif
|
||||
#ifndef WANT_AVX512
|
||||
# error ".pro file must define WANT_AVX512 macro to the AVX-512 feature to be tested"
|
||||
#endif
|
||||
|
||||
// The following checks if __AVXx__ is defined, where x is the value in
|
||||
// WANT_AVX512
|
||||
#define HAS2(x) __AVX512 ## x ## __
|
||||
#define HAS(x) HAS2(x)
|
||||
#if !HAS(WANT_AVX512)
|
||||
# error "Feature not supported"
|
||||
#endif
|
||||
|
||||
int main(int, char**argv)
|
||||
{
|
||||
/* AVX512 Foundation */
|
||||
__m512i i;
|
||||
__m512d d;
|
||||
__m512 f;
|
||||
__mmask16 m = ~1;
|
||||
i = _mm512_maskz_loadu_epi32(0, argv);
|
||||
d = _mm512_loadu_pd((double *)argv + 64);
|
||||
f = _mm512_loadu_ps((float *)argv + 128);
|
||||
|
||||
// some intrinsic that GCC forgot until GCC 8
|
||||
i = _mm512_maskz_set1_epi32(m, '?');
|
||||
_mm512_mask_cvtepi32_storeu_epi8(argv, m, i);
|
||||
|
||||
#ifdef WANT_AVX512ER
|
||||
/* AVX512 Exponential and Reciprocal */
|
||||
f = _mm512_exp2a23_round_ps(f, 8);
|
||||
#endif
|
||||
#ifdef WANT_AVX512CD
|
||||
/* AVX512 Conflict Detection */
|
||||
i = _mm512_maskz_conflict_epi32(m, i);
|
||||
#endif
|
||||
#ifdef WANT_AVX512PF
|
||||
/* AVX512 Prefetch */
|
||||
_mm512_mask_prefetch_i64scatter_pd(argv, 0xf, i, 2, 2);
|
||||
#endif
|
||||
#ifdef WANT_AVX512DQ
|
||||
/* AVX512 Doubleword and Quadword support */
|
||||
m = _mm512_movepi32_mask(i);
|
||||
#endif
|
||||
#ifdef WANT_AVX512BW
|
||||
/* AVX512 Byte and Word support */
|
||||
i = _mm512_mask_loadu_epi8(i, m, argv - 8);
|
||||
_mm512_mask_cvtepi16_storeu_epi8(argv + 8, m, i);
|
||||
#endif
|
||||
#ifdef WANT_AVX512VL
|
||||
/* AVX512 Vector Length */
|
||||
__m256i i2 = _mm256_maskz_loadu_epi32(0, argv);
|
||||
_mm256_mask_storeu_epi32(argv + 1, m, i2);
|
||||
#endif
|
||||
#ifdef WANT_AVX512IFMA
|
||||
/* AVX512 Integer Fused Multiply-Add */
|
||||
i = _mm512_madd52lo_epu64(i, i, i);
|
||||
#endif
|
||||
#ifdef WANT_AVX512VBMI
|
||||
/* AVX512 Vector Byte Manipulation Instructions */
|
||||
i = _mm512_permutexvar_epi8(i, i);
|
||||
#endif
|
||||
|
||||
_mm512_mask_storeu_epi64(argv, m, i);
|
||||
_mm512_mask_storeu_ps(argv + 64, m, f);
|
||||
_mm512_mask_storeu_pd(argv + 128, m, d);
|
||||
return 0;
|
||||
}
|
||||
@ -1,149 +0,0 @@
|
||||
/****************************************************************************
|
||||
**
|
||||
** Copyright (C) 2016 The Qt Company Ltd.
|
||||
** Contact: https://www.qt.io/licensing/
|
||||
**
|
||||
** This file is part of the config.tests 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$
|
||||
**
|
||||
****************************************************************************/
|
||||
|
||||
/* Sample program for configure to test STL support on target
|
||||
platforms. We are mainly concerned with being able to instantiate
|
||||
templates for common STL container classes.
|
||||
*/
|
||||
|
||||
#include <iterator>
|
||||
#include <map>
|
||||
#include <vector>
|
||||
#include <algorithm>
|
||||
#include <iostream>
|
||||
#include <cstddef>
|
||||
|
||||
// something mean to see if the compiler and C++ standard lib are good enough
|
||||
template<class K, class T>
|
||||
class DummyClass
|
||||
{
|
||||
// everything in std namespace ?
|
||||
typedef std::bidirectional_iterator_tag i;
|
||||
typedef std::ptrdiff_t d;
|
||||
// typename implemented ?
|
||||
typedef typename std::map<K,T>::iterator MyIterator;
|
||||
};
|
||||
|
||||
// extracted from QVector's strict iterator
|
||||
template<class T>
|
||||
class DummyIterator
|
||||
{
|
||||
typedef DummyIterator<int> iterator;
|
||||
public:
|
||||
T *i;
|
||||
typedef std::random_access_iterator_tag iterator_category;
|
||||
typedef std::ptrdiff_t difference_type;
|
||||
typedef T value_type;
|
||||
typedef T *pointer;
|
||||
typedef T &reference;
|
||||
|
||||
inline DummyIterator() : i(0) {}
|
||||
inline DummyIterator(T *n) : i(n) {}
|
||||
inline DummyIterator(const DummyIterator &o): i(o.i){}
|
||||
inline T &operator*() const { return *i; }
|
||||
inline T *operator->() const { return i; }
|
||||
inline T &operator[](int j) const { return *(i + j); }
|
||||
inline bool operator==(const DummyIterator &o) const { return i == o.i; }
|
||||
inline bool operator!=(const DummyIterator &o) const { return i != o.i; }
|
||||
inline bool operator<(const DummyIterator& other) const { return i < other.i; }
|
||||
inline bool operator<=(const DummyIterator& other) const { return i <= other.i; }
|
||||
inline bool operator>(const DummyIterator& other) const { return i > other.i; }
|
||||
inline bool operator>=(const DummyIterator& other) const { return i >= other.i; }
|
||||
inline DummyIterator &operator++() { ++i; return *this; }
|
||||
inline DummyIterator operator++(int) { T *n = i; ++i; return n; }
|
||||
inline DummyIterator &operator--() { i--; return *this; }
|
||||
inline DummyIterator operator--(int) { T *n = i; i--; return n; }
|
||||
inline DummyIterator &operator+=(int j) { i+=j; return *this; }
|
||||
inline DummyIterator &operator-=(int j) { i-=j; return *this; }
|
||||
inline DummyIterator operator+(int j) const { return DummyIterator(i+j); }
|
||||
inline DummyIterator operator-(int j) const { return DummyIterator(i-j); }
|
||||
inline int operator-(DummyIterator j) const { return i - j.i; }
|
||||
};
|
||||
|
||||
int main()
|
||||
{
|
||||
std::vector<int> v1;
|
||||
v1.push_back( 0 );
|
||||
v1.push_back( 1 );
|
||||
v1.push_back( 2 );
|
||||
v1.push_back( 3 );
|
||||
v1.push_back( 4 );
|
||||
int v1size = v1.size();
|
||||
v1size = 0;
|
||||
int v1capacity = v1.capacity();
|
||||
v1capacity = 0;
|
||||
|
||||
std::vector<int>::iterator v1it = std::find( v1.begin(), v1.end(), 99 );
|
||||
bool v1notfound = (v1it == v1.end());
|
||||
v1notfound = false;
|
||||
|
||||
v1it = std::find( v1.begin(), v1.end(), 3 );
|
||||
bool v1found = (v1it != v1.end());
|
||||
v1found = false;
|
||||
|
||||
std::vector<int> v2;
|
||||
std::copy( v1.begin(), v1it, std::back_inserter( v2 ) );
|
||||
int v2size = v2.size();
|
||||
v2size = 0;
|
||||
|
||||
std::map<int, double> m1;
|
||||
m1.insert( std::make_pair( 1, 2.0 ) );
|
||||
m1.insert( std::make_pair( 3, 2.0 ) );
|
||||
m1.insert( std::make_pair( 5, 2.0 ) );
|
||||
m1.insert( std::make_pair( 7, 2.0 ) );
|
||||
int m1size = m1.size();
|
||||
m1size = 0;
|
||||
std::map<int,double>::iterator m1it = m1.begin();
|
||||
for ( ; m1it != m1.end(); ++m1it ) {
|
||||
int first = (*m1it).first;
|
||||
first = 0;
|
||||
double second = (*m1it).second;
|
||||
second = 0.0;
|
||||
}
|
||||
std::map< int, double > m2( m1 );
|
||||
int m2size = m2.size();
|
||||
m2size = 0;
|
||||
|
||||
DummyIterator<int> it1, it2;
|
||||
int n = std::distance(it1, it2);
|
||||
std::advance(it1, 3);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user