aboutsummaryrefslogtreecommitdiffhomepage
path: root/test
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2009-03-09 18:40:09 +0000
committerGravatar Gael Guennebaud <g.gael@free.fr>2009-03-09 18:40:09 +0000
commit3f80c68be52543d1463eec4461c3b79f49f33ed9 (patch)
treee79a9bd83fc0d95cf4428598cd05c4052ad94302 /test
parentbd8107c90c795322eb863d2f0bf2a3d49e3bc019 (diff)
add the vectorization of abs
Diffstat (limited to 'test')
-rw-r--r--test/packetmath.cpp28
1 files changed, 18 insertions, 10 deletions
diff --git a/test/packetmath.cpp b/test/packetmath.cpp
index c7694b660..892777538 100644
--- a/test/packetmath.cpp
+++ b/test/packetmath.cpp
@@ -33,13 +33,20 @@ template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int s
return true;
}
-#define CHECK_CWISE(REFOP, POP) { \
+#define CHECK_CWISE2(REFOP, POP) { \
for (int i=0; i<PacketSize; ++i) \
ref[i] = REFOP(data1[i], data1[i+PacketSize]); \
ei_pstore(data2, POP(ei_pload(data1), ei_pload(data1+PacketSize))); \
VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
}
+#define CHECK_CWISE1(REFOP, POP) { \
+ for (int i=0; i<PacketSize; ++i) \
+ ref[i] = REFOP(data1[i]); \
+ ei_pstore(data2, POP(ei_pload(data1))); \
+ VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
+}
+
#define REF_ADD(a,b) ((a)+(b))
#define REF_SUB(a,b) ((a)-(b))
#define REF_MUL(a,b) ((a)*(b))
@@ -103,15 +110,16 @@ template<typename Scalar> void packetmath()
VERIFY(areApprox(ref, data2, PacketSize) && "ei_palign");
}
- CHECK_CWISE(REF_ADD, ei_padd);
- CHECK_CWISE(REF_SUB, ei_psub);
- CHECK_CWISE(REF_MUL, ei_pmul);
+ CHECK_CWISE2(REF_ADD, ei_padd);
+ CHECK_CWISE2(REF_SUB, ei_psub);
+ CHECK_CWISE2(REF_MUL, ei_pmul);
#ifndef EIGEN_VECTORIZE_ALTIVEC
if (!ei_is_same_type<Scalar,int>::ret)
- CHECK_CWISE(REF_DIV, ei_pdiv);
+ CHECK_CWISE2(REF_DIV, ei_pdiv);
#endif
- CHECK_CWISE(std::min, ei_pmin);
- CHECK_CWISE(std::max, ei_pmax);
+ CHECK_CWISE2(std::min, ei_pmin);
+ CHECK_CWISE2(std::max, ei_pmax);
+ CHECK_CWISE1(ei_abs, ei_pabs);
for (int i=0; i<PacketSize; ++i)
ref[i] = data1[0];
@@ -124,17 +132,17 @@ template<typename Scalar> void packetmath()
for (int i=0; i<PacketSize; ++i)
ref[0] += data1[i];
VERIFY(ei_isApprox(ref[0], ei_predux(ei_pload(data1))) && "ei_predux");
-
+
ref[0] = 1;
for (int i=0; i<PacketSize; ++i)
ref[0] *= data1[i];
VERIFY(ei_isApprox(ref[0], ei_predux_mul(ei_pload(data1))) && "ei_predux_mul");
-
+
ref[0] = data1[0];
for (int i=0; i<PacketSize; ++i)
ref[0] = std::min(ref[0],data1[i]);
VERIFY(ei_isApprox(ref[0], ei_predux_min(ei_pload(data1))) && "ei_predux_min");
-
+
ref[0] = data1[0];
for (int i=0; i<PacketSize; ++i)
ref[0] = std::max(ref[0],data1[i]);