Home | History | Annotate | Download | only in products

Lines Matching refs:CJ

106   #define MADD(CJ,A,B,C,T)  C = CJ.pmadd(A,B,C);
111 template<typename CJ, typename A, typename B, typename C, typename T> struct gebp_madd_selector {
112 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, A& a, B& b, C& c, T& /*t*/)
114 c = cj.pmadd(a,b,c);
118 template<typename CJ, typename T> struct gebp_madd_selector<CJ,T,T,T,T> {
119 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, T& a, T& b, T& c, T& t)
121 t = b; t = cj.pmul(a,t); c = padd(c,t);
125 template<typename CJ, typename A, typename B, typename C, typename T>
126 EIGEN_STRONG_INLINE void gebp_madd(const CJ& cj, A& a, B& b, C& c, T& t)
128 gebp_madd_selector<CJ,A,B,C,T>::run(cj,a,b,c,t);
131 #define MADD(CJ,A,B,C,T) gebp_madd(CJ,A,B,C,T);
132 // #define MADD(CJ,A,B,C,T) T = B; T = CJ.pmul(A,T); C = padd(C,T);
217 // conj_helper<LhsScalar,RhsScalar,ConjLhs,ConjRhs> cj;
294 r = cj.pmadd(c,alpha,r);
298 conj_helper<ResPacket,ResPacket,ConjLhs,false> cj;
387 c = cj.pmadd(a,b,c);
421 conj_helper<LhsScalar,RhsScalar,ConjLhs,ConjRhs> cj;
499 r = cj.pmadd(alpha,c,r);
503 conj_helper<ResPacket,ResPacket,false,ConjRhs> cj;
545 conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj;
977 MADD(cj,A0,B_0,C0,B_0);
978 MADD(cj,A0,B1,C1,B1);
991 MADD(cj,A0,B_0,C0,B_0);
992 MADD(cj,A0,B1,C1,B1);
993 MADD(cj,A0,B2,C2,B2);
994 MADD(cj,A0,B3,C3,B3);
1093 MADD(cj, A0, B_0, C0, B_0);
1135 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj;
1152 if(Pack1>=1*PacketSize) { pstore(blockA+count, cj.pconj(A)); count+=PacketSize; }
1153 if(Pack1>=2*PacketSize) { pstore(blockA+count, cj.pconj(B)); count+=PacketSize; }
1154 if(Pack1>=3*PacketSize) { pstore(blockA+count, cj.pconj(C)); count+=PacketSize; }
1155 if(Pack1>=4*PacketSize) { pstore(blockA+count, cj.pconj(D)); count+=PacketSize; }
1166 Scalar a(cj(lhs(i+w+0, k))),
1167 b(cj(lhs(i+w+1, k))),
1168 c(cj(lhs(i+w+2, k))),
1169 d(cj(lhs(i+w+3, k)));
1177 blockA[count++] = cj(lhs(i+w, k));
1187 blockA[count++] = cj(lhs(peeled_mc+w, k));
1195 blockA[count++] = cj(lhs(i, k));
1223 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj;
1236 blockB[count+0] = cj(b0[k]);
1237 blockB[count+1] = cj(b1[k]);
1238 if(nr==4) blockB[count+2] = cj(b2[k]);
1239 if(nr==4) blockB[count+3] = cj(b3[k]);
1253 blockB[count] = cj(b0[k]);
1276 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj;
1286 blockB[count+0] = cj(b0[0]);
1287 blockB[count+1] = cj(b0[1]);
1288 if(nr==4) blockB[count+2] = cj(b0[2]);
1289 if(nr==4) blockB[count+3] = cj(b0[3]);
1302 blockB[count] = cj(b0[k*rhsStride]);