mirror of
https://gitlab.com/libeigen/eigen.git
synced 2026-04-10 11:34:33 +08:00
Merged eigen/eigen into default
This commit is contained in:
@@ -201,7 +201,7 @@ template<typename Scalar> void packetmath()
|
||||
internal::pstore(data2+3*PacketSize, A3);
|
||||
VERIFY(areApprox(ref, data2, 4*PacketSize) && "internal::pbroadcast4");
|
||||
}
|
||||
|
||||
|
||||
{
|
||||
for (int i=0; i<PacketSize*2; ++i)
|
||||
ref[i] = data1[i/PacketSize];
|
||||
@@ -211,9 +211,9 @@ template<typename Scalar> void packetmath()
|
||||
internal::pstore(data2+1*PacketSize, A1);
|
||||
VERIFY(areApprox(ref, data2, 2*PacketSize) && "internal::pbroadcast2");
|
||||
}
|
||||
|
||||
|
||||
VERIFY(internal::isApprox(data1[0], internal::pfirst(internal::pload<Packet>(data1))) && "internal::pfirst");
|
||||
|
||||
|
||||
if(PacketSize>1)
|
||||
{
|
||||
for(int offset=0;offset<4;++offset)
|
||||
@@ -323,7 +323,7 @@ template<typename Scalar> void packetmath_real()
|
||||
CHECK_CWISE1_IF(PacketTraits::HasRound, numext::round, internal::pround);
|
||||
CHECK_CWISE1_IF(PacketTraits::HasCeil, numext::ceil, internal::pceil);
|
||||
CHECK_CWISE1_IF(PacketTraits::HasFloor, numext::floor, internal::pfloor);
|
||||
|
||||
|
||||
for (int i=0; i<size; ++i)
|
||||
{
|
||||
data1[i] = internal::random<Scalar>(-1,1);
|
||||
@@ -448,12 +448,9 @@ template<typename Scalar> void packetmath_real()
|
||||
data1[0] = Scalar(-1.0f);
|
||||
h.store(data2, internal::plog(h.load(data1)));
|
||||
VERIFY((numext::isnan)(data2[0]));
|
||||
#if !EIGEN_FAST_MATH
|
||||
h.store(data2, internal::psqrt(h.load(data1)));
|
||||
VERIFY((numext::isnan)(data2[0]));
|
||||
VERIFY((numext::isnan)(data2[1]));
|
||||
#endif
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
@@ -467,7 +464,7 @@ template<typename Scalar> void packetmath_notcomplex()
|
||||
EIGEN_ALIGN_MAX Scalar data1[PacketTraits::size*4];
|
||||
EIGEN_ALIGN_MAX Scalar data2[PacketTraits::size*4];
|
||||
EIGEN_ALIGN_MAX Scalar ref[PacketTraits::size*4];
|
||||
|
||||
|
||||
Array<Scalar,Dynamic,1>::Map(data1, PacketTraits::size*4).setRandom();
|
||||
|
||||
ref[0] = data1[0];
|
||||
@@ -486,7 +483,7 @@ template<typename Scalar> void packetmath_notcomplex()
|
||||
for (int i=0; i<PacketSize; ++i)
|
||||
ref[0] = (std::max)(ref[0],data1[i]);
|
||||
VERIFY(internal::isApprox(ref[0], internal::predux_max(internal::pload<Packet>(data1))) && "internal::predux_max");
|
||||
|
||||
|
||||
for (int i=0; i<PacketSize; ++i)
|
||||
ref[i] = data1[0]+Scalar(i);
|
||||
internal::pstore(data2, internal::plset<Packet>(data1[0]));
|
||||
@@ -498,12 +495,12 @@ template<typename Scalar,bool ConjLhs,bool ConjRhs> void test_conj_helper(Scalar
|
||||
typedef internal::packet_traits<Scalar> PacketTraits;
|
||||
typedef typename PacketTraits::type Packet;
|
||||
const int PacketSize = PacketTraits::size;
|
||||
|
||||
|
||||
internal::conj_if<ConjLhs> cj0;
|
||||
internal::conj_if<ConjRhs> cj1;
|
||||
internal::conj_helper<Scalar,Scalar,ConjLhs,ConjRhs> cj;
|
||||
internal::conj_helper<Packet,Packet,ConjLhs,ConjRhs> pcj;
|
||||
|
||||
|
||||
for(int i=0;i<PacketSize;++i)
|
||||
{
|
||||
ref[i] = cj0(data1[i]) * cj1(data2[i]);
|
||||
@@ -511,7 +508,7 @@ template<typename Scalar,bool ConjLhs,bool ConjRhs> void test_conj_helper(Scalar
|
||||
}
|
||||
internal::pstore(pval,pcj.pmul(internal::pload<Packet>(data1),internal::pload<Packet>(data2)));
|
||||
VERIFY(areApprox(ref, pval, PacketSize) && "conj_helper pmul");
|
||||
|
||||
|
||||
for(int i=0;i<PacketSize;++i)
|
||||
{
|
||||
Scalar tmp = ref[i];
|
||||
@@ -539,12 +536,12 @@ template<typename Scalar> void packetmath_complex()
|
||||
data1[i] = internal::random<Scalar>() * Scalar(1e2);
|
||||
data2[i] = internal::random<Scalar>() * Scalar(1e2);
|
||||
}
|
||||
|
||||
|
||||
test_conj_helper<Scalar,false,false> (data1,data2,ref,pval);
|
||||
test_conj_helper<Scalar,false,true> (data1,data2,ref,pval);
|
||||
test_conj_helper<Scalar,true,false> (data1,data2,ref,pval);
|
||||
test_conj_helper<Scalar,true,true> (data1,data2,ref,pval);
|
||||
|
||||
|
||||
{
|
||||
for(int i=0;i<PacketSize;++i)
|
||||
ref[i] = Scalar(std::imag(data1[i]),std::real(data1[i]));
|
||||
@@ -564,9 +561,9 @@ template<typename Scalar> void packetmath_scatter_gather()
|
||||
for (int i=0; i<PacketSize; ++i) {
|
||||
data1[i] = internal::random<Scalar>()/RealScalar(PacketSize);
|
||||
}
|
||||
|
||||
|
||||
int stride = internal::random<int>(1,20);
|
||||
|
||||
|
||||
EIGEN_ALIGN_MAX Scalar buffer[PacketSize*20];
|
||||
memset(buffer, 0, 20*sizeof(Packet));
|
||||
Packet packet = internal::pload<Packet>(data1);
|
||||
@@ -602,7 +599,7 @@ void test_packetmath()
|
||||
CALL_SUBTEST_1( packetmath_notcomplex<float>() );
|
||||
CALL_SUBTEST_2( packetmath_notcomplex<double>() );
|
||||
CALL_SUBTEST_3( packetmath_notcomplex<int>() );
|
||||
|
||||
|
||||
CALL_SUBTEST_1( packetmath_real<float>() );
|
||||
CALL_SUBTEST_2( packetmath_real<double>() );
|
||||
|
||||
|
||||
Reference in New Issue
Block a user