Michael Ernst Peter / Eigen

src/Core/GenericPacketMath.h@0:13a5d365ba16, 2016-10-13 (annotated)

Committer:
ykuroda
Date:
Thu Oct 13 04:07:23 2016 +0000
Revision:
0:13a5d365ba16
First commint, Eigne Matrix Class Library

Who changed what in which revision?

UserRevisionLine numberNew contents of line
ykuroda 0:13a5d365ba16 1 // This file is part of Eigen, a lightweight C++ template library
ykuroda 0:13a5d365ba16 2 // for linear algebra.
ykuroda 0:13a5d365ba16 3 //
ykuroda 0:13a5d365ba16 4 // Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
ykuroda 0:13a5d365ba16 5 // Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
ykuroda 0:13a5d365ba16 6 //
ykuroda 0:13a5d365ba16 7 // This Source Code Form is subject to the terms of the Mozilla
ykuroda 0:13a5d365ba16 8 // Public License v. 2.0. If a copy of the MPL was not distributed
ykuroda 0:13a5d365ba16 9 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
ykuroda 0:13a5d365ba16 10
ykuroda 0:13a5d365ba16 11 #ifndef EIGEN_GENERIC_PACKET_MATH_H
ykuroda 0:13a5d365ba16 12 #define EIGEN_GENERIC_PACKET_MATH_H
ykuroda 0:13a5d365ba16 13
ykuroda 0:13a5d365ba16 14 namespace Eigen {
ykuroda 0:13a5d365ba16 15
ykuroda 0:13a5d365ba16 16 namespace internal {
ykuroda 0:13a5d365ba16 17
ykuroda 0:13a5d365ba16 18 /** \internal
ykuroda 0:13a5d365ba16 19 * \file GenericPacketMath.h
ykuroda 0:13a5d365ba16 20 *
ykuroda 0:13a5d365ba16 21 * Default implementation for types not supported by the vectorization.
ykuroda 0:13a5d365ba16 22 * In practice these functions are provided to make easier the writing
ykuroda 0:13a5d365ba16 23 * of generic vectorized code.
ykuroda 0:13a5d365ba16 24 */
ykuroda 0:13a5d365ba16 25
ykuroda 0:13a5d365ba16 26 #ifndef EIGEN_DEBUG_ALIGNED_LOAD
ykuroda 0:13a5d365ba16 27 #define EIGEN_DEBUG_ALIGNED_LOAD
ykuroda 0:13a5d365ba16 28 #endif
ykuroda 0:13a5d365ba16 29
ykuroda 0:13a5d365ba16 30 #ifndef EIGEN_DEBUG_UNALIGNED_LOAD
ykuroda 0:13a5d365ba16 31 #define EIGEN_DEBUG_UNALIGNED_LOAD
ykuroda 0:13a5d365ba16 32 #endif
ykuroda 0:13a5d365ba16 33
ykuroda 0:13a5d365ba16 34 #ifndef EIGEN_DEBUG_ALIGNED_STORE
ykuroda 0:13a5d365ba16 35 #define EIGEN_DEBUG_ALIGNED_STORE
ykuroda 0:13a5d365ba16 36 #endif
ykuroda 0:13a5d365ba16 37
ykuroda 0:13a5d365ba16 38 #ifndef EIGEN_DEBUG_UNALIGNED_STORE
ykuroda 0:13a5d365ba16 39 #define EIGEN_DEBUG_UNALIGNED_STORE
ykuroda 0:13a5d365ba16 40 #endif
ykuroda 0:13a5d365ba16 41
ykuroda 0:13a5d365ba16 42 struct default_packet_traits
ykuroda 0:13a5d365ba16 43 {
ykuroda 0:13a5d365ba16 44 enum {
ykuroda 0:13a5d365ba16 45 HasAdd = 1,
ykuroda 0:13a5d365ba16 46 HasSub = 1,
ykuroda 0:13a5d365ba16 47 HasMul = 1,
ykuroda 0:13a5d365ba16 48 HasNegate = 1,
ykuroda 0:13a5d365ba16 49 HasAbs = 1,
ykuroda 0:13a5d365ba16 50 HasAbs2 = 1,
ykuroda 0:13a5d365ba16 51 HasMin = 1,
ykuroda 0:13a5d365ba16 52 HasMax = 1,
ykuroda 0:13a5d365ba16 53 HasConj = 1,
ykuroda 0:13a5d365ba16 54 HasSetLinear = 1,
ykuroda 0:13a5d365ba16 55
ykuroda 0:13a5d365ba16 56 HasDiv = 0,
ykuroda 0:13a5d365ba16 57 HasSqrt = 0,
ykuroda 0:13a5d365ba16 58 HasExp = 0,
ykuroda 0:13a5d365ba16 59 HasLog = 0,
ykuroda 0:13a5d365ba16 60 HasPow = 0,
ykuroda 0:13a5d365ba16 61
ykuroda 0:13a5d365ba16 62 HasSin = 0,
ykuroda 0:13a5d365ba16 63 HasCos = 0,
ykuroda 0:13a5d365ba16 64 HasTan = 0,
ykuroda 0:13a5d365ba16 65 HasASin = 0,
ykuroda 0:13a5d365ba16 66 HasACos = 0,
ykuroda 0:13a5d365ba16 67 HasATan = 0
ykuroda 0:13a5d365ba16 68 };
ykuroda 0:13a5d365ba16 69 };
ykuroda 0:13a5d365ba16 70
ykuroda 0:13a5d365ba16 71 template<typename T> struct packet_traits : default_packet_traits
ykuroda 0:13a5d365ba16 72 {
ykuroda 0:13a5d365ba16 73 typedef T type;
ykuroda 0:13a5d365ba16 74 enum {
ykuroda 0:13a5d365ba16 75 Vectorizable = 0,
ykuroda 0:13a5d365ba16 76 size = 1,
ykuroda 0:13a5d365ba16 77 AlignedOnScalar = 0
ykuroda 0:13a5d365ba16 78 };
ykuroda 0:13a5d365ba16 79 enum {
ykuroda 0:13a5d365ba16 80 HasAdd = 0,
ykuroda 0:13a5d365ba16 81 HasSub = 0,
ykuroda 0:13a5d365ba16 82 HasMul = 0,
ykuroda 0:13a5d365ba16 83 HasNegate = 0,
ykuroda 0:13a5d365ba16 84 HasAbs = 0,
ykuroda 0:13a5d365ba16 85 HasAbs2 = 0,
ykuroda 0:13a5d365ba16 86 HasMin = 0,
ykuroda 0:13a5d365ba16 87 HasMax = 0,
ykuroda 0:13a5d365ba16 88 HasConj = 0,
ykuroda 0:13a5d365ba16 89 HasSetLinear = 0
ykuroda 0:13a5d365ba16 90 };
ykuroda 0:13a5d365ba16 91 };
ykuroda 0:13a5d365ba16 92
ykuroda 0:13a5d365ba16 93 /** \internal \returns a + b (coeff-wise) */
ykuroda 0:13a5d365ba16 94 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 95 padd(const Packet& a,
ykuroda 0:13a5d365ba16 96 const Packet& b) { return a+b; }
ykuroda 0:13a5d365ba16 97
ykuroda 0:13a5d365ba16 98 /** \internal \returns a - b (coeff-wise) */
ykuroda 0:13a5d365ba16 99 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 100 psub(const Packet& a,
ykuroda 0:13a5d365ba16 101 const Packet& b) { return a-b; }
ykuroda 0:13a5d365ba16 102
ykuroda 0:13a5d365ba16 103 /** \internal \returns -a (coeff-wise) */
ykuroda 0:13a5d365ba16 104 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 105 pnegate(const Packet& a) { return -a; }
ykuroda 0:13a5d365ba16 106
ykuroda 0:13a5d365ba16 107 /** \internal \returns conj(a) (coeff-wise) */
ykuroda 0:13a5d365ba16 108 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 109 pconj(const Packet& a) { return numext::conj(a); }
ykuroda 0:13a5d365ba16 110
ykuroda 0:13a5d365ba16 111 /** \internal \returns a * b (coeff-wise) */
ykuroda 0:13a5d365ba16 112 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 113 pmul(const Packet& a,
ykuroda 0:13a5d365ba16 114 const Packet& b) { return a*b; }
ykuroda 0:13a5d365ba16 115
ykuroda 0:13a5d365ba16 116 /** \internal \returns a / b (coeff-wise) */
ykuroda 0:13a5d365ba16 117 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 118 pdiv(const Packet& a,
ykuroda 0:13a5d365ba16 119 const Packet& b) { return a/b; }
ykuroda 0:13a5d365ba16 120
ykuroda 0:13a5d365ba16 121 /** \internal \returns the min of \a a and \a b (coeff-wise) */
ykuroda 0:13a5d365ba16 122 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 123 pmin(const Packet& a,
ykuroda 0:13a5d365ba16 124 const Packet& b) { using std::min; return (min)(a, b); }
ykuroda 0:13a5d365ba16 125
ykuroda 0:13a5d365ba16 126 /** \internal \returns the max of \a a and \a b (coeff-wise) */
ykuroda 0:13a5d365ba16 127 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 128 pmax(const Packet& a,
ykuroda 0:13a5d365ba16 129 const Packet& b) { using std::max; return (max)(a, b); }
ykuroda 0:13a5d365ba16 130
ykuroda 0:13a5d365ba16 131 /** \internal \returns the absolute value of \a a */
ykuroda 0:13a5d365ba16 132 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 133 pabs(const Packet& a) { using std::abs; return abs(a); }
ykuroda 0:13a5d365ba16 134
ykuroda 0:13a5d365ba16 135 /** \internal \returns the bitwise and of \a a and \a b */
ykuroda 0:13a5d365ba16 136 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 137 pand(const Packet& a, const Packet& b) { return a & b; }
ykuroda 0:13a5d365ba16 138
ykuroda 0:13a5d365ba16 139 /** \internal \returns the bitwise or of \a a and \a b */
ykuroda 0:13a5d365ba16 140 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 141 por(const Packet& a, const Packet& b) { return a | b; }
ykuroda 0:13a5d365ba16 142
ykuroda 0:13a5d365ba16 143 /** \internal \returns the bitwise xor of \a a and \a b */
ykuroda 0:13a5d365ba16 144 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 145 pxor(const Packet& a, const Packet& b) { return a ^ b; }
ykuroda 0:13a5d365ba16 146
ykuroda 0:13a5d365ba16 147 /** \internal \returns the bitwise andnot of \a a and \a b */
ykuroda 0:13a5d365ba16 148 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 149 pandnot(const Packet& a, const Packet& b) { return a & (!b); }
ykuroda 0:13a5d365ba16 150
ykuroda 0:13a5d365ba16 151 /** \internal \returns a packet version of \a *from, from must be 16 bytes aligned */
ykuroda 0:13a5d365ba16 152 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 153 pload(const typename unpacket_traits<Packet>::type* from) { return *from; }
ykuroda 0:13a5d365ba16 154
ykuroda 0:13a5d365ba16 155 /** \internal \returns a packet version of \a *from, (un-aligned load) */
ykuroda 0:13a5d365ba16 156 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 157 ploadu(const typename unpacket_traits<Packet>::type* from) { return *from; }
ykuroda 0:13a5d365ba16 158
ykuroda 0:13a5d365ba16 159 /** \internal \returns a packet with elements of \a *from duplicated.
ykuroda 0:13a5d365ba16 160 * For instance, for a packet of 8 elements, 4 scalar will be read from \a *from and
ykuroda 0:13a5d365ba16 161 * duplicated to form: {from[0],from[0],from[1],from[1],,from[2],from[2],,from[3],from[3]}
ykuroda 0:13a5d365ba16 162 * Currently, this function is only used for scalar * complex products.
ykuroda 0:13a5d365ba16 163 */
ykuroda 0:13a5d365ba16 164 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 165 ploaddup(const typename unpacket_traits<Packet>::type* from) { return *from; }
ykuroda 0:13a5d365ba16 166
ykuroda 0:13a5d365ba16 167 /** \internal \returns a packet with constant coefficients \a a, e.g.: (a,a,a,a) */
ykuroda 0:13a5d365ba16 168 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 169 pset1(const typename unpacket_traits<Packet>::type& a) { return a; }
ykuroda 0:13a5d365ba16 170
ykuroda 0:13a5d365ba16 171 /** \internal \brief Returns a packet with coefficients (a,a+1,...,a+packet_size-1). */
ykuroda 0:13a5d365ba16 172 template<typename Scalar> inline typename packet_traits<Scalar>::type
ykuroda 0:13a5d365ba16 173 plset(const Scalar& a) { return a; }
ykuroda 0:13a5d365ba16 174
ykuroda 0:13a5d365ba16 175 /** \internal copy the packet \a from to \a *to, \a to must be 16 bytes aligned */
ykuroda 0:13a5d365ba16 176 template<typename Scalar, typename Packet> inline void pstore(Scalar* to, const Packet& from)
ykuroda 0:13a5d365ba16 177 { (*to) = from; }
ykuroda 0:13a5d365ba16 178
ykuroda 0:13a5d365ba16 179 /** \internal copy the packet \a from to \a *to, (un-aligned store) */
ykuroda 0:13a5d365ba16 180 template<typename Scalar, typename Packet> inline void pstoreu(Scalar* to, const Packet& from)
ykuroda 0:13a5d365ba16 181 { (*to) = from; }
ykuroda 0:13a5d365ba16 182
ykuroda 0:13a5d365ba16 183 /** \internal tries to do cache prefetching of \a addr */
ykuroda 0:13a5d365ba16 184 template<typename Scalar> inline void prefetch(const Scalar* addr)
ykuroda 0:13a5d365ba16 185 {
ykuroda 0:13a5d365ba16 186 #if !defined(_MSC_VER)
ykuroda 0:13a5d365ba16 187 __builtin_prefetch(addr);
ykuroda 0:13a5d365ba16 188 #endif
ykuroda 0:13a5d365ba16 189 }
ykuroda 0:13a5d365ba16 190
ykuroda 0:13a5d365ba16 191 /** \internal \returns the first element of a packet */
ykuroda 0:13a5d365ba16 192 template<typename Packet> inline typename unpacket_traits<Packet>::type pfirst(const Packet& a)
ykuroda 0:13a5d365ba16 193 { return a; }
ykuroda 0:13a5d365ba16 194
ykuroda 0:13a5d365ba16 195 /** \internal \returns a packet where the element i contains the sum of the packet of \a vec[i] */
ykuroda 0:13a5d365ba16 196 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 197 preduxp(const Packet* vecs) { return vecs[0]; }
ykuroda 0:13a5d365ba16 198
ykuroda 0:13a5d365ba16 199 /** \internal \returns the sum of the elements of \a a*/
ykuroda 0:13a5d365ba16 200 template<typename Packet> inline typename unpacket_traits<Packet>::type predux(const Packet& a)
ykuroda 0:13a5d365ba16 201 { return a; }
ykuroda 0:13a5d365ba16 202
ykuroda 0:13a5d365ba16 203 /** \internal \returns the product of the elements of \a a*/
ykuroda 0:13a5d365ba16 204 template<typename Packet> inline typename unpacket_traits<Packet>::type predux_mul(const Packet& a)
ykuroda 0:13a5d365ba16 205 { return a; }
ykuroda 0:13a5d365ba16 206
ykuroda 0:13a5d365ba16 207 /** \internal \returns the min of the elements of \a a*/
ykuroda 0:13a5d365ba16 208 template<typename Packet> inline typename unpacket_traits<Packet>::type predux_min(const Packet& a)
ykuroda 0:13a5d365ba16 209 { return a; }
ykuroda 0:13a5d365ba16 210
ykuroda 0:13a5d365ba16 211 /** \internal \returns the max of the elements of \a a*/
ykuroda 0:13a5d365ba16 212 template<typename Packet> inline typename unpacket_traits<Packet>::type predux_max(const Packet& a)
ykuroda 0:13a5d365ba16 213 { return a; }
ykuroda 0:13a5d365ba16 214
ykuroda 0:13a5d365ba16 215 /** \internal \returns the reversed elements of \a a*/
ykuroda 0:13a5d365ba16 216 template<typename Packet> inline Packet preverse(const Packet& a)
ykuroda 0:13a5d365ba16 217 { return a; }
ykuroda 0:13a5d365ba16 218
ykuroda 0:13a5d365ba16 219
ykuroda 0:13a5d365ba16 220 /** \internal \returns \a a with real and imaginary part flipped (for complex type only) */
ykuroda 0:13a5d365ba16 221 template<typename Packet> inline Packet pcplxflip(const Packet& a)
ykuroda 0:13a5d365ba16 222 {
ykuroda 0:13a5d365ba16 223 // FIXME: uncomment the following in case we drop the internal imag and real functions.
ykuroda 0:13a5d365ba16 224 // using std::imag;
ykuroda 0:13a5d365ba16 225 // using std::real;
ykuroda 0:13a5d365ba16 226 return Packet(imag(a),real(a));
ykuroda 0:13a5d365ba16 227 }
ykuroda 0:13a5d365ba16 228
ykuroda 0:13a5d365ba16 229 /**************************
ykuroda 0:13a5d365ba16 230 * Special math functions
ykuroda 0:13a5d365ba16 231 ***************************/
ykuroda 0:13a5d365ba16 232
ykuroda 0:13a5d365ba16 233 /** \internal \returns the sine of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 234 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 235 Packet psin(const Packet& a) { using std::sin; return sin(a); }
ykuroda 0:13a5d365ba16 236
ykuroda 0:13a5d365ba16 237 /** \internal \returns the cosine of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 238 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 239 Packet pcos(const Packet& a) { using std::cos; return cos(a); }
ykuroda 0:13a5d365ba16 240
ykuroda 0:13a5d365ba16 241 /** \internal \returns the tan of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 242 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 243 Packet ptan(const Packet& a) { using std::tan; return tan(a); }
ykuroda 0:13a5d365ba16 244
ykuroda 0:13a5d365ba16 245 /** \internal \returns the arc sine of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 246 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 247 Packet pasin(const Packet& a) { using std::asin; return asin(a); }
ykuroda 0:13a5d365ba16 248
ykuroda 0:13a5d365ba16 249 /** \internal \returns the arc cosine of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 250 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 251 Packet pacos(const Packet& a) { using std::acos; return acos(a); }
ykuroda 0:13a5d365ba16 252
ykuroda 0:13a5d365ba16 253 /** \internal \returns the exp of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 254 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 255 Packet pexp(const Packet& a) { using std::exp; return exp(a); }
ykuroda 0:13a5d365ba16 256
ykuroda 0:13a5d365ba16 257 /** \internal \returns the log of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 258 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 259 Packet plog(const Packet& a) { using std::log; return log(a); }
ykuroda 0:13a5d365ba16 260
ykuroda 0:13a5d365ba16 261 /** \internal \returns the square-root of \a a (coeff-wise) */
ykuroda 0:13a5d365ba16 262 template<typename Packet> EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS
ykuroda 0:13a5d365ba16 263 Packet psqrt(const Packet& a) { using std::sqrt; return sqrt(a); }
ykuroda 0:13a5d365ba16 264
ykuroda 0:13a5d365ba16 265 /***************************************************************************
ykuroda 0:13a5d365ba16 266 * The following functions might not have to be overwritten for vectorized types
ykuroda 0:13a5d365ba16 267 ***************************************************************************/
ykuroda 0:13a5d365ba16 268
ykuroda 0:13a5d365ba16 269 /** \internal copy a packet with constant coeficient \a a (e.g., [a,a,a,a]) to \a *to. \a to must be 16 bytes aligned */
ykuroda 0:13a5d365ba16 270 // NOTE: this function must really be templated on the packet type (think about different packet types for the same scalar type)
ykuroda 0:13a5d365ba16 271 template<typename Packet>
ykuroda 0:13a5d365ba16 272 inline void pstore1(typename unpacket_traits<Packet>::type* to, const typename unpacket_traits<Packet>::type& a)
ykuroda 0:13a5d365ba16 273 {
ykuroda 0:13a5d365ba16 274 pstore(to, pset1<Packet>(a));
ykuroda 0:13a5d365ba16 275 }
ykuroda 0:13a5d365ba16 276
ykuroda 0:13a5d365ba16 277 /** \internal \returns a * b + c (coeff-wise) */
ykuroda 0:13a5d365ba16 278 template<typename Packet> inline Packet
ykuroda 0:13a5d365ba16 279 pmadd(const Packet& a,
ykuroda 0:13a5d365ba16 280 const Packet& b,
ykuroda 0:13a5d365ba16 281 const Packet& c)
ykuroda 0:13a5d365ba16 282 { return padd(pmul(a, b),c); }
ykuroda 0:13a5d365ba16 283
ykuroda 0:13a5d365ba16 284 /** \internal \returns a packet version of \a *from.
ykuroda 0:13a5d365ba16 285 * If LoadMode equals #Aligned, \a from must be 16 bytes aligned */
ykuroda 0:13a5d365ba16 286 template<typename Packet, int LoadMode>
ykuroda 0:13a5d365ba16 287 inline Packet ploadt(const typename unpacket_traits<Packet>::type* from)
ykuroda 0:13a5d365ba16 288 {
ykuroda 0:13a5d365ba16 289 if(LoadMode == Aligned)
ykuroda 0:13a5d365ba16 290 return pload<Packet>(from);
ykuroda 0:13a5d365ba16 291 else
ykuroda 0:13a5d365ba16 292 return ploadu<Packet>(from);
ykuroda 0:13a5d365ba16 293 }
ykuroda 0:13a5d365ba16 294
ykuroda 0:13a5d365ba16 295 /** \internal copy the packet \a from to \a *to.
ykuroda 0:13a5d365ba16 296 * If StoreMode equals #Aligned, \a to must be 16 bytes aligned */
ykuroda 0:13a5d365ba16 297 template<typename Scalar, typename Packet, int LoadMode>
ykuroda 0:13a5d365ba16 298 inline void pstoret(Scalar* to, const Packet& from)
ykuroda 0:13a5d365ba16 299 {
ykuroda 0:13a5d365ba16 300 if(LoadMode == Aligned)
ykuroda 0:13a5d365ba16 301 pstore(to, from);
ykuroda 0:13a5d365ba16 302 else
ykuroda 0:13a5d365ba16 303 pstoreu(to, from);
ykuroda 0:13a5d365ba16 304 }
ykuroda 0:13a5d365ba16 305
ykuroda 0:13a5d365ba16 306 /** \internal default implementation of palign() allowing partial specialization */
ykuroda 0:13a5d365ba16 307 template<int Offset,typename PacketType>
ykuroda 0:13a5d365ba16 308 struct palign_impl
ykuroda 0:13a5d365ba16 309 {
ykuroda 0:13a5d365ba16 310 // by default data are aligned, so there is nothing to be done :)
ykuroda 0:13a5d365ba16 311 static inline void run(PacketType&, const PacketType&) {}
ykuroda 0:13a5d365ba16 312 };
ykuroda 0:13a5d365ba16 313
ykuroda 0:13a5d365ba16 314 /** \internal update \a first using the concatenation of the packet_size minus \a Offset last elements
ykuroda 0:13a5d365ba16 315 * of \a first and \a Offset first elements of \a second.
ykuroda 0:13a5d365ba16 316 *
ykuroda 0:13a5d365ba16 317 * This function is currently only used to optimize matrix-vector products on unligned matrices.
ykuroda 0:13a5d365ba16 318 * It takes 2 packets that represent a contiguous memory array, and returns a packet starting
ykuroda 0:13a5d365ba16 319 * at the position \a Offset. For instance, for packets of 4 elements, we have:
ykuroda 0:13a5d365ba16 320 * Input:
ykuroda 0:13a5d365ba16 321 * - first = {f0,f1,f2,f3}
ykuroda 0:13a5d365ba16 322 * - second = {s0,s1,s2,s3}
ykuroda 0:13a5d365ba16 323 * Output:
ykuroda 0:13a5d365ba16 324 * - if Offset==0 then {f0,f1,f2,f3}
ykuroda 0:13a5d365ba16 325 * - if Offset==1 then {f1,f2,f3,s0}
ykuroda 0:13a5d365ba16 326 * - if Offset==2 then {f2,f3,s0,s1}
ykuroda 0:13a5d365ba16 327 * - if Offset==3 then {f3,s0,s1,s3}
ykuroda 0:13a5d365ba16 328 */
ykuroda 0:13a5d365ba16 329 template<int Offset,typename PacketType>
ykuroda 0:13a5d365ba16 330 inline void palign(PacketType& first, const PacketType& second)
ykuroda 0:13a5d365ba16 331 {
ykuroda 0:13a5d365ba16 332 palign_impl<Offset,PacketType>::run(first,second);
ykuroda 0:13a5d365ba16 333 }
ykuroda 0:13a5d365ba16 334
ykuroda 0:13a5d365ba16 335 /***************************************************************************
ykuroda 0:13a5d365ba16 336 * Fast complex products (GCC generates a function call which is very slow)
ykuroda 0:13a5d365ba16 337 ***************************************************************************/
ykuroda 0:13a5d365ba16 338
ykuroda 0:13a5d365ba16 339 template<> inline std::complex<float> pmul(const std::complex<float>& a, const std::complex<float>& b)
ykuroda 0:13a5d365ba16 340 { return std::complex<float>(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }
ykuroda 0:13a5d365ba16 341
ykuroda 0:13a5d365ba16 342 template<> inline std::complex<double> pmul(const std::complex<double>& a, const std::complex<double>& b)
ykuroda 0:13a5d365ba16 343 { return std::complex<double>(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }
ykuroda 0:13a5d365ba16 344
ykuroda 0:13a5d365ba16 345 } // end namespace internal
ykuroda 0:13a5d365ba16 346
ykuroda 0:13a5d365ba16 347 } // end namespace Eigen
ykuroda 0:13a5d365ba16 348
ykuroda 0:13a5d365ba16 349 #endif // EIGEN_GENERIC_PACKET_MATH_H