Lines Matching refs:data1
55 ref[i] = REFOP(data1[i], data1[i+PacketSize]); \
56 internal::pstore(data2, POP(internal::pload<Packet>(data1), internal::pload<Packet>(data1+PacketSize))); \
62 ref[i] = REFOP(data1[i]); \
63 internal::pstore(data2, POP(internal::pload<Packet>(data1))); \
90 ref[i] = REFOP(data1[i]); \
91 h.store(data2, POP(h.load(data1))); \
107 EIGEN_ALIGN16 Scalar data1[internal::packet_traits<Scalar>::size*4];
114 data1[i] = internal::random<Scalar>()/RealScalar(PacketSize);
116 refvalue = (std::max)(refvalue,internal::abs(data1[i]));
119 internal::pstore(data2, internal::pload<Packet>(data1));
120 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store");
124 internal::pstore(data2, internal::ploadu<Packet>(data1+offset));
125 VERIFY(areApprox(data1+offset, data2, PacketSize) && "internal::ploadu");
130 internal::pstoreu(data2+offset, internal::pload<Packet>(data1));
131 VERIFY(areApprox(data1, data2+offset, PacketSize) && "internal::pstoreu");
136 packets[0] = internal::pload<Packet>(data1);
137 packets[1] = internal::pload<Packet>(data1+PacketSize);
145 ref[i] = data1[i+offset];
164 ref[i] = data1[offset];
165 internal::pstore(data2, internal::pset1<Packet>(data1[offset]));
169 VERIFY(internal::isApprox(data1[0], internal::pfirst(internal::pload<Packet>(data1))) && "internal::pfirst");
176 ref[2*i+0] = ref[2*i+1] = data1[offset+i];
177 internal::pstore(data2,internal::ploaddup<Packet>(data1+offset));
184 ref[0] += data1[i];
185 VERIFY(isApproxAbs(ref[0], internal::predux(internal::pload<Packet>(data1)), refvalue) && "internal::predux");
189 ref[0] *= data1[i];
190 VERIFY(internal::isApprox(ref[0], internal::predux_mul(internal::pload<Packet>(data1))) && "internal::predux_mul");
196 ref[j] += data1[i+j*PacketSize];
197 packets[j] = internal::pload<Packet>(data1+j*PacketSize);
203 ref[i] = data1[PacketSize-i-1];
204 internal::pstore(data2, internal::preverse(internal::pload<Packet>(data1)));
214 EIGEN_ALIGN16 Scalar data1[internal::packet_traits<Scalar>::size*4];
220 data1[i] = internal::random<Scalar>(-1e3,1e3);
229 data1[i] = internal::random<Scalar>(-1,1);
237 data1[i] = internal::random<Scalar>(-87,88);
244 data1[i] = internal::random<Scalar>(0,1e6);
250 ref[0] = data1[0];
252 ref[0] = (std::min)(ref[0],data1[i]);
253 VERIFY(internal::isApprox(ref[0], internal::predux_min(internal::pload<Packet>(data1))) && "internal::predux_min");
259 ref[0] = data1[0];
261 ref[0] = (std::max)(ref[0],data1[i]);
262 VERIFY(internal::isApprox(ref[0], internal::predux_max(internal::pload<Packet>(data1))) && "internal::predux_max");
265 ref[i] = data1[0]+Scalar(i);
266 internal::pstore(data2, internal::plset(data1[0]));
270 template<typename Scalar,bool ConjLhs,bool ConjRhs> void test_conj_helper(Scalar* data1, Scalar* data2, Scalar* ref, Scalar* pval)
282 ref[i] = cj0(data1[i]) * cj1(data2[i]);
283 VERIFY(internal::isApprox(ref[i], cj.pmul(data1[i],data2[i])) && "conj_helper pmul");
285 internal::pstore(pval,pcj.pmul(internal::pload<Packet>(data1),internal::pload<Packet>(data2)));
291 ref[i] += cj0(data1[i]) * cj1(data2[i]);
292 VERIFY(internal::isApprox(ref[i], cj.pmadd(data1[i],data2[i],tmp)) && "conj_helper pmadd");
294 internal::pstore(pval,pcj.pmadd(internal::pload<Packet>(data1),internal::pload<Packet>(data2),internal::pload<Packet>(pval)));
304 EIGEN_ALIGN16 Scalar data1[PacketSize*4];
311 data1[i] = internal::random<Scalar>() * Scalar(1e2);
315 test_conj_helper<Scalar,false,false> (data1,data2,ref,pval);
316 test_conj_helper<Scalar,false,true> (data1,data2,ref,pval);
317 test_conj_helper<Scalar,true,false> (data1,data2,ref,pval);
318 test_conj_helper<Scalar,true,true> (data1,data2,ref,pval);
322 ref[i] = Scalar(std::imag(data1[i]),std::real(data1[i]));
323 internal::pstore(pval,internal::pcplxflip(internal::pload<Packet>(data1)));