Eigen  3.3.0
 
Loading...
Searching...
No Matches
ZVector/Complex.h
1// This file is part of Eigen, a lightweight C++ template library
2// for linear algebra.
3//
4// Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
5//
6// This Source Code Form is subject to the terms of the Mozilla
7// Public License v. 2.0. If a copy of the MPL was not distributed
8// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9
10#ifndef EIGEN_COMPLEX32_ALTIVEC_H
11#define EIGEN_COMPLEX32_ALTIVEC_H
12
13namespace Eigen {
14
15namespace internal {
16
17static Packet2ul p2ul_CONJ_XOR1 = (Packet2ul) vec_sld((Packet4ui) p2d_ZERO_, (Packet4ui) p2l_ZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 };
18static Packet2ul p2ul_CONJ_XOR2 = (Packet2ul) vec_sld((Packet4ui) p2l_ZERO, (Packet4ui) p2d_ZERO_, 8);//{ 0x8000000000000000, 0x0000000000000000 };
19
20struct Packet1cd
21{
22 EIGEN_STRONG_INLINE Packet1cd() {}
23 EIGEN_STRONG_INLINE explicit Packet1cd(const Packet2d& a) : v(a) {}
24 Packet2d v;
25};
26
27template<> struct packet_traits<std::complex<double> > : default_packet_traits
28{
29 typedef Packet1cd type;
30 typedef Packet1cd half;
31 enum {
32 Vectorizable = 1,
33 AlignedOnScalar = 0,
34 size = 1,
35 HasHalfPacket = 0,
36
37 HasAdd = 1,
38 HasSub = 1,
39 HasMul = 1,
40 HasDiv = 1,
41 HasNegate = 1,
42 HasAbs = 0,
43 HasAbs2 = 0,
44 HasMin = 0,
45 HasMax = 0,
46 HasSetLinear = 0
47 };
48};
49
50template<> struct unpacket_traits<Packet1cd> { typedef std::complex<double> type; enum {size=1, alignment=Aligned16}; typedef Packet1cd half; };
51
52template<> EIGEN_STRONG_INLINE Packet1cd pload <Packet1cd>(const std::complex<double>* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet1cd(pload<Packet2d>((const double*)from)); }
53template<> EIGEN_STRONG_INLINE Packet1cd ploadu<Packet1cd>(const std::complex<double>* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet1cd(ploadu<Packet2d>((const double*)from)); }
54template<> EIGEN_STRONG_INLINE void pstore <std::complex<double> >(std::complex<double> * to, const Packet1cd& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((double*)to, from.v); }
55template<> EIGEN_STRONG_INLINE void pstoreu<std::complex<double> >(std::complex<double> * to, const Packet1cd& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((double*)to, from.v); }
56
57template<> EIGEN_STRONG_INLINE Packet1cd pset1<Packet1cd>(const std::complex<double>& from)
58{ /* here we really have to use unaligned loads :( */ return ploadu<Packet1cd>(&from); }
59
60template<> EIGEN_STRONG_INLINE Packet1cd padd<Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v + b.v); }
61template<> EIGEN_STRONG_INLINE Packet1cd psub<Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v - b.v); }
62template<> EIGEN_STRONG_INLINE Packet1cd pnegate(const Packet1cd& a) { return Packet1cd(pnegate(Packet2d(a.v))); }
63template<> EIGEN_STRONG_INLINE Packet1cd pconj(const Packet1cd& a) { return Packet1cd((Packet2d)vec_xor((Packet2d)a.v, (Packet2d)p2ul_CONJ_XOR2)); }
64
65template<> EIGEN_STRONG_INLINE Packet1cd pmul<Packet1cd>(const Packet1cd& a, const Packet1cd& b)
66{
67 Packet2d a_re, a_im, v1, v2;
68
69 // Permute and multiply the real parts of a and b
70 a_re = vec_perm(a.v, a.v, p16uc_PSET64_HI);
71 // Get the imaginary parts of a
72 a_im = vec_perm(a.v, a.v, p16uc_PSET64_LO);
73 // multiply a_re * b
74 v1 = vec_madd(a_re, b.v, p2d_ZERO);
75 // multiply a_im * b and get the conjugate result
76 v2 = vec_madd(a_im, b.v, p2d_ZERO);
77 v2 = (Packet2d) vec_sld((Packet4ui)v2, (Packet4ui)v2, 8);
78 v2 = (Packet2d) vec_xor((Packet2d)v2, (Packet2d) p2ul_CONJ_XOR1);
79
80 return Packet1cd(v1 + v2);
81}
82
83template<> EIGEN_STRONG_INLINE Packet1cd pand <Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_and(a.v,b.v)); }
84template<> EIGEN_STRONG_INLINE Packet1cd por <Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_or(a.v,b.v)); }
85template<> EIGEN_STRONG_INLINE Packet1cd pxor <Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_xor(a.v,b.v)); }
86template<> EIGEN_STRONG_INLINE Packet1cd pandnot<Packet1cd>(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_and(a.v, vec_nor(b.v,b.v))); }
87
88template<> EIGEN_STRONG_INLINE Packet1cd ploaddup<Packet1cd>(const std::complex<double>* from)
89{
90 return pset1<Packet1cd>(*from);
91}
92
93template<> EIGEN_STRONG_INLINE void prefetch<std::complex<double> >(const std::complex<double> * addr) { EIGEN_ZVECTOR_PREFETCH(addr); }
94
95template<> EIGEN_STRONG_INLINE std::complex<double> pfirst<Packet1cd>(const Packet1cd& a)
96{
97 std::complex<double> EIGEN_ALIGN16 res[2];
98 pstore<std::complex<double> >(res, a);
99
100 return res[0];
101}
102
103template<> EIGEN_STRONG_INLINE Packet1cd preverse(const Packet1cd& a) { return a; }
104
105template<> EIGEN_STRONG_INLINE std::complex<double> predux<Packet1cd>(const Packet1cd& a)
106{
107 return pfirst(a);
108}
109
110template<> EIGEN_STRONG_INLINE Packet1cd preduxp<Packet1cd>(const Packet1cd* vecs)
111{
112 return vecs[0];
113}
114
115template<> EIGEN_STRONG_INLINE std::complex<double> predux_mul<Packet1cd>(const Packet1cd& a)
116{
117 return pfirst(a);
118}
119
120template<int Offset>
121struct palign_impl<Offset,Packet1cd>
122{
123 static EIGEN_STRONG_INLINE void run(Packet1cd& /*first*/, const Packet1cd& /*second*/)
124 {
125 // FIXME is it sure we never have to align a Packet1cd?
126 // Even though a std::complex<double> has 16 bytes, it is not necessarily aligned on a 16 bytes boundary...
127 }
128};
129
130template<> struct conj_helper<Packet1cd, Packet1cd, false,true>
131{
132 EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const
133 { return padd(pmul(x,y),c); }
134
135 EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const
136 {
137 return internal::pmul(a, pconj(b));
138 }
139};
140
141template<> struct conj_helper<Packet1cd, Packet1cd, true,false>
142{
143 EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const
144 { return padd(pmul(x,y),c); }
145
146 EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const
147 {
148 return internal::pmul(pconj(a), b);
149 }
150};
151
152template<> struct conj_helper<Packet1cd, Packet1cd, true,true>
153{
154 EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const
155 { return padd(pmul(x,y),c); }
156
157 EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const
158 {
159 return pconj(internal::pmul(a, b));
160 }
161};
162
163template<> EIGEN_STRONG_INLINE Packet1cd pdiv<Packet1cd>(const Packet1cd& a, const Packet1cd& b)
164{
165 // TODO optimize it for AltiVec
166 Packet1cd res = conj_helper<Packet1cd,Packet1cd,false,true>().pmul(a,b);
167 Packet2d s = vec_madd(b.v, b.v, p2d_ZERO_);
168 return Packet1cd(pdiv(res.v, s + vec_perm(s, s, p16uc_REVERSE64)));
169}
170
171EIGEN_STRONG_INLINE Packet1cd pcplxflip/*<Packet1cd>*/(const Packet1cd& x)
172{
173 return Packet1cd(preverse(Packet2d(x.v)));
174}
175
176EIGEN_STRONG_INLINE void ptranspose(PacketBlock<Packet1cd,2>& kernel)
177{
178 Packet2d tmp = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_HI);
179 kernel.packet[1].v = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_LO);
180 kernel.packet[0].v = tmp;
181}
182} // end namespace internal
183
184} // end namespace Eigen
185
186#endif // EIGEN_COMPLEX32_ALTIVEC_H
@ Aligned16
Definition: Constants.h:230
Namespace containing all symbols from the Eigen library.
Definition: Core:287