GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-09-12 17:33:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

improve packetmath unit test for sum reductions

Browse Source
This commit is contained in:
Gael Guennebaud 2010-07-05 10:54:24 +02:00
parent fffaa58ac2
commit 6249d60715
1 changed files with 36 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
test/packetmath.cpp
View File

@ -29,16 +29,38 @@
template<typename T> T ei_negate(const T& x) { return -x; } template<typename T> T ei_negate(const T& x) { return -x; }
template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int size) template<typename Scalar> bool isApproxAbs(const Scalar& a, const Scalar& b, const typename NumTraits<Scalar>::Real& refvalue)
{
return ei_isMuchSmallerThan(a-b, refvalue);
}
template<typename Scalar> bool areApproxAbs(const Scalar* a, const Scalar* b, int size, const typename NumTraits<Scalar>::Real& refvalue)
{ {
for (int i=0; i<size; ++i) for (int i=0; i<size; ++i)
if (!ei_isApprox(a[i],b[i])) { {
std::cout << "a[" << i << "]: " << a[i] << ", b[" << i << "]: " << b[i] << std::endl; if (!isApproxAbs(a[i],b[i],refvalue))
{
std::cout << "a[" << i << "]: " << a[i] << " != b[" << i << "]: " << b[i] << std::endl;
return false; return false;
} }
}
return true; return true;
} }
template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int size)
{
for (int i=0; i<size; ++i)
{
if (!ei_isApprox(a[i],b[i]))
{
std::cout << "a[" << i << "]: " << a[i] << " != b[" << i << "]: " << b[i] << std::endl;
return false;
}
}
return true;
}
#define CHECK_CWISE2(REFOP, POP) { \ #define CHECK_CWISE2(REFOP, POP) { \
for (int i=0; i<PacketSize; ++i) \ for (int i=0; i<PacketSize; ++i) \
ref[i] = REFOP(data1[i], data1[i+PacketSize]); \ ref[i] = REFOP(data1[i], data1[i+PacketSize]); \
@ -100,16 +122,19 @@ template<typename Scalar> void packetmath()
{ {
typedef typename ei_packet_traits<Scalar>::type Packet; typedef typename ei_packet_traits<Scalar>::type Packet;
const int PacketSize = ei_packet_traits<Scalar>::size; const int PacketSize = ei_packet_traits<Scalar>::size;
typedef typename NumTraits<Scalar>::Real RealScalar;
const int size = PacketSize*4; const int size = PacketSize*4;
EIGEN_ALIGN16 Scalar data1[ei_packet_traits<Scalar>::size*4]; EIGEN_ALIGN16 Scalar data1[ei_packet_traits<Scalar>::size*4];
EIGEN_ALIGN16 Scalar data2[ei_packet_traits<Scalar>::size*4]; EIGEN_ALIGN16 Scalar data2[ei_packet_traits<Scalar>::size*4];
EIGEN_ALIGN16 Packet packets[PacketSize*2]; EIGEN_ALIGN16 Packet packets[PacketSize*2];
EIGEN_ALIGN16 Scalar ref[ei_packet_traits<Scalar>::size*4]; EIGEN_ALIGN16 Scalar ref[ei_packet_traits<Scalar>::size*4];
RealScalar refvalue = 0;
for (int i=0; i<size; ++i) for (int i=0; i<size; ++i)
{ {
data1[i] = ei_random<Scalar>(); data1[i] = ei_random<Scalar>();
data2[i] = ei_random<Scalar>(); data2[i] = ei_random<Scalar>();
refvalue = std::max(refvalue,ei_abs(data1[i]));
} }
ei_pstore(data2, ei_pload(data1)); ei_pstore(data2, ei_pload(data1));
@ -166,7 +191,7 @@ template<typename Scalar> void packetmath()
ref[0] = 0; ref[0] = 0;
for (int i=0; i<PacketSize; ++i) for (int i=0; i<PacketSize; ++i)
ref[0] += data1[i]; ref[0] += data1[i];
VERIFY(ei_isApprox(ref[0], ei_predux(ei_pload(data1))) && "ei_predux"); VERIFY(isApproxAbs(ref[0], ei_predux(ei_pload(data1)), refvalue) && "ei_predux");
ref[0] = 1; ref[0] = 1;
for (int i=0; i<PacketSize; ++i) for (int i=0; i<PacketSize; ++i)
@ -191,7 +216,7 @@ template<typename Scalar> void packetmath()
packets[j] = ei_pload(data1+j*PacketSize); packets[j] = ei_pload(data1+j*PacketSize);
} }
ei_pstore(data2, ei_preduxp(packets)); ei_pstore(data2, ei_preduxp(packets));
VERIFY(areApprox(ref, data2, PacketSize) && "ei_preduxp"); VERIFY(areApproxAbs(ref, data2, PacketSize, refvalue) && "ei_preduxp");
for (int i=0; i<PacketSize; ++i) for (int i=0; i<PacketSize; ++i)
ref[i] = data1[PacketSize-i-1]; ref[i] = data1[PacketSize-i-1];