mirror of
https://github.com/paboyle/Grid.git
synced 2024-09-20 09:15:38 +01:00
04072a5e1f
permutes as rotates of length 2, and make any rotate active over any subset of lane bits. This is hard, and requires general permute; current intrinsics mean this is only really possible for specific case by case encodings as presently performed. Intel could produce a general permute.. would help. IBM did it in VMX.
235 lines
9.5 KiB
C++
235 lines
9.5 KiB
C++
/*************************************************************************************
|
|
|
|
Grid physics library, www.github.com/paboyle/Grid
|
|
|
|
Source file: ./lib/Simd.h
|
|
|
|
Copyright (C) 2015
|
|
|
|
Author: Peter Boyle <paboyle@ph.ed.ac.uk>
|
|
Author: neo <cossu@post.kek.jp>
|
|
Author: paboyle <paboyle@ph.ed.ac.uk>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License along
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
See the full license in the file "LICENSE" in the top level distribution directory
|
|
*************************************************************************************/
|
|
/* END LEGAL */
|
|
#ifndef GRID_SIMD_H
|
|
#define GRID_SIMD_H
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
// Define scalar and vector floating point types
|
|
//
|
|
// Scalar: RealF, RealD, ComplexF, ComplexD
|
|
//
|
|
// Vector: vRealF, vRealD, vComplexF, vComplexD
|
|
//
|
|
// Vector types are arch dependent
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
#define _MM_SELECT_FOUR_FOUR(A,B,C,D) ((A<<6)|(B<<4)|(C<<2)|(D))
|
|
#define _MM_SELECT_FOUR_FOUR_STRING(A,B,C,D) "((" #A "<<6)|(" #B "<<4)|(" #C "<<2)|(" #D "))"
|
|
#define _MM_SELECT_EIGHT_TWO(A,B,C,D,E,F,G,H) ((A<<7)|(B<<6)|(C<<5)|(D<<4)|(E<<3)|(F<<2)|(G<<4)|(H))
|
|
#define _MM_SELECT_FOUR_TWO (A,B,C,D) _MM_SELECT_EIGHT_TWO(0,0,0,0,A,B,C,D)
|
|
#define _MM_SELECT_TWO_TWO (A,B) _MM_SELECT_FOUR_TWO(0,0,A,B)
|
|
|
|
#define RotateBit (0x100)
|
|
|
|
namespace Grid {
|
|
|
|
typedef uint32_t Integer;
|
|
|
|
typedef float RealF;
|
|
typedef double RealD;
|
|
#ifdef GRID_DEFAULT_PRECISION_DOUBLE
|
|
typedef RealD Real;
|
|
#else
|
|
typedef RealF Real;
|
|
#endif
|
|
|
|
typedef std::complex<RealF> ComplexF;
|
|
typedef std::complex<RealD> ComplexD;
|
|
typedef std::complex<Real> Complex;
|
|
|
|
inline RealF adj(const RealF & r){ return r; }
|
|
inline RealF conjugate(const RealF & r){ return r; }
|
|
inline RealF real(const RealF & r){ return r; }
|
|
|
|
inline RealD adj(const RealD & r){ return r; }
|
|
inline RealD conjugate(const RealD & r){ return r; }
|
|
inline RealD real(const RealD & r){ return r; }
|
|
|
|
inline RealD sqrt(const RealD & r){ return std::sqrt(r); }
|
|
|
|
inline ComplexD conjugate(const ComplexD& r){ return(conj(r)); }
|
|
inline ComplexD adj(const ComplexD& r){ return(conjugate(r)); }
|
|
inline ComplexF conjugate(const ComplexF& r ){ return(conj(r)); }
|
|
inline ComplexF adj(const ComplexF& r ){ return(conjugate(r)); }
|
|
|
|
inline ComplexD innerProduct(const ComplexD & l, const ComplexD & r) { return conjugate(l)*r; }
|
|
inline ComplexF innerProduct(const ComplexF & l, const ComplexF & r) { return conjugate(l)*r; }
|
|
inline RealD innerProduct(const RealD & l, const RealD & r) { return l*r; }
|
|
inline RealF innerProduct(const RealF & l, const RealF & r) { return l*r; }
|
|
|
|
inline ComplexD Reduce(const ComplexD& r){ return r; }
|
|
inline ComplexF Reduce(const ComplexF& r){ return r; }
|
|
inline RealD Reduce(const RealD& r){ return r; }
|
|
inline RealF Reduce(const RealF& r){ return r; }
|
|
|
|
inline RealD toReal(const ComplexD& r){ return real(r); }
|
|
inline RealF toReal(const ComplexF& r){ return real(r); }
|
|
inline RealD toReal(const RealD& r){ return r; }
|
|
inline RealF toReal(const RealF& r){ return r; }
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
//Provide support functions for basic real and complex data types required by Grid
|
|
//Single and double precision versions. Should be able to template this once only.
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
inline void mac (ComplexD * __restrict__ y,const ComplexD * __restrict__ a,const ComplexD *__restrict__ x){ *y = (*a) * (*x)+(*y); };
|
|
inline void mult(ComplexD * __restrict__ y,const ComplexD * __restrict__ l,const ComplexD *__restrict__ r){ *y = (*l) * (*r);}
|
|
inline void sub (ComplexD * __restrict__ y,const ComplexD * __restrict__ l,const ComplexD *__restrict__ r){ *y = (*l) - (*r);}
|
|
inline void add (ComplexD * __restrict__ y,const ComplexD * __restrict__ l,const ComplexD *__restrict__ r){ *y = (*l) + (*r);}
|
|
// conjugate already supported for complex
|
|
|
|
inline void mac (ComplexF * __restrict__ y,const ComplexF * __restrict__ a,const ComplexF *__restrict__ x){ *y = (*a) * (*x)+(*y); }
|
|
inline void mult(ComplexF * __restrict__ y,const ComplexF * __restrict__ l,const ComplexF *__restrict__ r){ *y = (*l) * (*r); }
|
|
inline void sub (ComplexF * __restrict__ y,const ComplexF * __restrict__ l,const ComplexF *__restrict__ r){ *y = (*l) - (*r); }
|
|
inline void add (ComplexF * __restrict__ y,const ComplexF * __restrict__ l,const ComplexF *__restrict__ r){ *y = (*l) + (*r); }
|
|
|
|
//conjugate already supported for complex
|
|
|
|
inline ComplexF timesI(const ComplexF &r) { return(r*ComplexF(0.0,1.0));}
|
|
inline ComplexD timesI(const ComplexD &r) { return(r*ComplexD(0.0,1.0));}
|
|
inline ComplexF timesMinusI(const ComplexF &r){ return(r*ComplexF(0.0,-1.0));}
|
|
inline ComplexD timesMinusI(const ComplexD &r){ return(r*ComplexD(0.0,-1.0));}
|
|
inline void timesI(ComplexF &ret,const ComplexF &r) { ret = timesI(r);}
|
|
inline void timesI(ComplexD &ret,const ComplexD &r) { ret = timesI(r);}
|
|
inline void timesMinusI(ComplexF &ret,const ComplexF &r){ ret = timesMinusI(r);}
|
|
inline void timesMinusI(ComplexD &ret,const ComplexD &r){ ret = timesMinusI(r);}
|
|
|
|
inline void mac (RealD * __restrict__ y,const RealD * __restrict__ a,const RealD *__restrict__ x){ *y = (*a) * (*x)+(*y);}
|
|
inline void mult(RealD * __restrict__ y,const RealD * __restrict__ l,const RealD *__restrict__ r){ *y = (*l) * (*r);}
|
|
inline void sub (RealD * __restrict__ y,const RealD * __restrict__ l,const RealD *__restrict__ r){ *y = (*l) - (*r);}
|
|
inline void add (RealD * __restrict__ y,const RealD * __restrict__ l,const RealD *__restrict__ r){ *y = (*l) + (*r);}
|
|
|
|
inline void mac (RealF * __restrict__ y,const RealF * __restrict__ a,const RealF *__restrict__ x){ *y = (*a) * (*x)+(*y); }
|
|
inline void mult(RealF * __restrict__ y,const RealF * __restrict__ l,const RealF *__restrict__ r){ *y = (*l) * (*r); }
|
|
inline void sub (RealF * __restrict__ y,const RealF * __restrict__ l,const RealF *__restrict__ r){ *y = (*l) - (*r); }
|
|
inline void add (RealF * __restrict__ y,const RealF * __restrict__ l,const RealF *__restrict__ r){ *y = (*l) + (*r); }
|
|
|
|
inline void vstream(ComplexF &l, const ComplexF &r){ l=r;}
|
|
inline void vstream(ComplexD &l, const ComplexD &r){ l=r;}
|
|
inline void vstream(RealF &l, const RealF &r){ l=r;}
|
|
inline void vstream(RealD &l, const RealD &r){ l=r;}
|
|
|
|
|
|
class Zero{};
|
|
static Zero zero;
|
|
template<class itype> inline void zeroit(itype &arg){ arg=zero;};
|
|
template<> inline void zeroit(ComplexF &arg){ arg=0; };
|
|
template<> inline void zeroit(ComplexD &arg){ arg=0; };
|
|
template<> inline void zeroit(RealF &arg){ arg=0; };
|
|
template<> inline void zeroit(RealD &arg){ arg=0; };
|
|
|
|
|
|
//////////////////////////////////////////////////////////
|
|
// Permute
|
|
// Permute 0 every ABCDEFGH -> BA DC FE HG
|
|
// Permute 1 every ABCDEFGH -> CD AB GH EF
|
|
// Permute 2 every ABCDEFGH -> EFGH ABCD
|
|
// Permute 3 possible on longer iVector lengths (512bit = 8 double = 16 single)
|
|
// Permute 4 possible on half precision @512bit vectors.
|
|
//
|
|
// Defined inside SIMD specialization files
|
|
//////////////////////////////////////////////////////////
|
|
template<class VectorSIMD>
|
|
inline void Gpermute(VectorSIMD &y,const VectorSIMD &b,int perm);
|
|
|
|
};
|
|
|
|
#include <simd/Grid_vector_types.h>
|
|
#include <simd/Grid_vector_unops.h>
|
|
|
|
namespace Grid {
|
|
// Default precision
|
|
#ifdef GRID_DEFAULT_PRECISION_DOUBLE
|
|
typedef vRealD vReal;
|
|
typedef vComplexD vComplex;
|
|
#else
|
|
typedef vRealF vReal;
|
|
typedef vComplexF vComplex;
|
|
#endif
|
|
|
|
|
|
inline std::ostream& operator<< (std::ostream& stream, const vComplexF &o){
|
|
int nn=vComplexF::Nsimd();
|
|
std::vector<ComplexF,alignedAllocator<ComplexF> > buf(nn);
|
|
vstore(o,&buf[0]);
|
|
stream<<"<";
|
|
for(int i=0;i<nn;i++){
|
|
stream<<buf[i];
|
|
if(i<nn-1) stream<<",";
|
|
}
|
|
stream<<">";
|
|
return stream;
|
|
}
|
|
|
|
inline std::ostream& operator<< (std::ostream& stream, const vComplexD &o){
|
|
int nn=vComplexD::Nsimd();
|
|
std::vector<ComplexD,alignedAllocator<ComplexD> > buf(nn);
|
|
vstore(o,&buf[0]);
|
|
stream<<"<";
|
|
for(int i=0;i<nn;i++){
|
|
stream<<buf[i];
|
|
if(i<nn-1) stream<<",";
|
|
}
|
|
stream<<">";
|
|
return stream;
|
|
}
|
|
|
|
inline std::ostream& operator<< (std::ostream& stream, const vRealF &o){
|
|
int nn=vRealF::Nsimd();
|
|
std::vector<RealF,alignedAllocator<RealF> > buf(nn);
|
|
vstore(o,&buf[0]);
|
|
stream<<"<";
|
|
for(int i=0;i<nn;i++){
|
|
stream<<buf[i];
|
|
if(i<nn-1) stream<<",";
|
|
}
|
|
stream<<">";
|
|
return stream;
|
|
}
|
|
|
|
inline std::ostream& operator<< (std::ostream& stream, const vRealD &o){
|
|
int nn=vRealD::Nsimd();
|
|
std::vector<RealD,alignedAllocator<RealD> > buf(nn);
|
|
vstore(o,&buf[0]);
|
|
stream<<"<";
|
|
for(int i=0;i<nn;i++){
|
|
stream<<buf[i];
|
|
if(i<nn-1) stream<<",";
|
|
}
|
|
stream<<">";
|
|
return stream;
|
|
}
|
|
|
|
|
|
}
|
|
#endif
|