mirror of
https://github.com/paboyle/Grid.git
synced 2024-11-14 01:35:36 +00:00
36b8f35eed
Now need to construct pseudofermion two flavour, ratio, one flavour, ratio action fragments.
310 lines
8.6 KiB
C++
310 lines
8.6 KiB
C++
#ifndef GRID_LATTICE_BASE_H
|
|
#define GRID_LATTICE_BASE_H
|
|
|
|
#define STREAMING_STORES
|
|
|
|
namespace Grid {
|
|
|
|
// TODO:
|
|
// mac,real,imag
|
|
|
|
// Functionality:
|
|
// -=,+=,*=,()
|
|
// add,+,sub,-,mult,mac,*
|
|
// adj,conjugate
|
|
// real,imag
|
|
// transpose,transposeIndex
|
|
// trace,traceIndex
|
|
// peekIndex
|
|
// innerProduct,outerProduct,
|
|
// localNorm2
|
|
// localInnerProduct
|
|
|
|
extern int GridCshiftPermuteMap[4][16];
|
|
|
|
////////////////////////////////////////////////
|
|
// Basic expressions used in Expression Template
|
|
////////////////////////////////////////////////
|
|
|
|
class LatticeBase {};
|
|
class LatticeExpressionBase {};
|
|
|
|
template <typename Op, typename T1>
|
|
class LatticeUnaryExpression : public std::pair<Op,std::tuple<T1> > , public LatticeExpressionBase {
|
|
public:
|
|
LatticeUnaryExpression(const std::pair<Op,std::tuple<T1> > &arg): std::pair<Op,std::tuple<T1> >(arg) {};
|
|
};
|
|
|
|
template <typename Op, typename T1, typename T2>
|
|
class LatticeBinaryExpression : public std::pair<Op,std::tuple<T1,T2> > , public LatticeExpressionBase {
|
|
public:
|
|
LatticeBinaryExpression(const std::pair<Op,std::tuple<T1,T2> > &arg): std::pair<Op,std::tuple<T1,T2> >(arg) {};
|
|
};
|
|
|
|
template <typename Op, typename T1, typename T2, typename T3>
|
|
class LatticeTrinaryExpression :public std::pair<Op,std::tuple<T1,T2,T3> >, public LatticeExpressionBase {
|
|
public:
|
|
LatticeTrinaryExpression(const std::pair<Op,std::tuple<T1,T2,T3> > &arg): std::pair<Op,std::tuple<T1,T2,T3> >(arg) {};
|
|
};
|
|
|
|
void inline conformable(GridBase *lhs,GridBase *rhs)
|
|
{
|
|
assert(lhs == rhs);
|
|
}
|
|
|
|
template<class vobj>
|
|
class Lattice : public LatticeBase
|
|
{
|
|
public:
|
|
|
|
GridBase *_grid;
|
|
int checkerboard;
|
|
std::vector<vobj,alignedAllocator<vobj> > _odata;
|
|
|
|
// to pthread need a computable loop where loop induction is not required
|
|
int begin(void) { return 0;};
|
|
int end(void) { return _odata.size(); }
|
|
vobj & operator[](int i) { return _odata[i]; };
|
|
|
|
public:
|
|
typedef typename vobj::scalar_type scalar_type;
|
|
typedef typename vobj::vector_type vector_type;
|
|
typedef vobj vector_object;
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
// Expression Template closure support
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
template <typename Op, typename T1> strong_inline Lattice<vobj> & operator=(const LatticeUnaryExpression<Op,T1> &expr)
|
|
{
|
|
GridBase *egrid(nullptr);
|
|
GridFromExpression(egrid,expr);
|
|
assert(egrid!=nullptr);
|
|
conformable(_grid,egrid);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
#ifdef STREAMING_STORES
|
|
vobj tmp = eval(ss,expr);
|
|
vstream(_odata[ss] ,tmp);
|
|
#else
|
|
_odata[ss]=eval(ss,expr);
|
|
#endif
|
|
}
|
|
return *this;
|
|
}
|
|
template <typename Op, typename T1,typename T2> strong_inline Lattice<vobj> & operator=(const LatticeBinaryExpression<Op,T1,T2> &expr)
|
|
{
|
|
GridBase *egrid(nullptr);
|
|
GridFromExpression(egrid,expr);
|
|
assert(egrid!=nullptr);
|
|
conformable(_grid,egrid);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
#ifdef STREAMING_STORES
|
|
vobj tmp = eval(ss,expr);
|
|
vstream(_odata[ss] ,tmp);
|
|
#else
|
|
_odata[ss]=eval(ss,expr);
|
|
#endif
|
|
}
|
|
return *this;
|
|
}
|
|
template <typename Op, typename T1,typename T2,typename T3> strong_inline Lattice<vobj> & operator=(const LatticeTrinaryExpression<Op,T1,T2,T3> &expr)
|
|
{
|
|
GridBase *egrid(nullptr);
|
|
GridFromExpression(egrid,expr);
|
|
assert(egrid!=nullptr);
|
|
conformable(_grid,egrid);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
#ifdef STREAMING_STORES
|
|
//vobj tmp = eval(ss,expr);
|
|
vstream(_odata[ss] ,eval(ss,expr));
|
|
#else
|
|
_odata[ss] = eval(ss,expr);
|
|
#endif
|
|
}
|
|
return *this;
|
|
}
|
|
//GridFromExpression is tricky to do
|
|
template<class Op,class T1>
|
|
Lattice(const LatticeUnaryExpression<Op,T1> & expr): _grid(nullptr){
|
|
|
|
GridFromExpression(_grid,expr);
|
|
assert(_grid!=nullptr);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
_odata.resize(_grid->oSites());
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
#ifdef STREAMING_STORES
|
|
vobj tmp = eval(ss,expr);
|
|
vstream(_odata[ss] ,tmp);
|
|
#else
|
|
_odata[ss]=eval(ss,expr);
|
|
#endif
|
|
}
|
|
};
|
|
template<class Op,class T1, class T2>
|
|
Lattice(const LatticeBinaryExpression<Op,T1,T2> & expr): _grid(nullptr){
|
|
GridFromExpression(_grid,expr);
|
|
assert(_grid!=nullptr);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
_odata.resize(_grid->oSites());
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
#ifdef STREAMING_STORES
|
|
vobj tmp = eval(ss,expr);
|
|
vstream(_odata[ss] ,tmp);
|
|
#else
|
|
_odata[ss]=eval(ss,expr);
|
|
#endif
|
|
}
|
|
};
|
|
template<class Op,class T1, class T2, class T3>
|
|
Lattice(const LatticeTrinaryExpression<Op,T1,T2,T3> & expr): _grid(nullptr){
|
|
GridFromExpression(_grid,expr);
|
|
assert(_grid!=nullptr);
|
|
|
|
int cb=-1;
|
|
CBFromExpression(cb,expr);
|
|
assert( (cb==Odd) || (cb==Even));
|
|
checkerboard=cb;
|
|
|
|
_odata.resize(_grid->oSites());
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
vstream(_odata[ss] ,eval(ss,expr));
|
|
}
|
|
};
|
|
|
|
//////////////////////////////////////////////////////////////////
|
|
// Constructor requires "grid" passed.
|
|
// what about a default grid?
|
|
//////////////////////////////////////////////////////////////////
|
|
Lattice(GridBase *grid) : _grid(grid), _odata(_grid->oSites()) {
|
|
// _odata.reserve(_grid->oSites());
|
|
// _odata.resize(_grid->oSites());
|
|
assert((((uint64_t)&_odata[0])&0xF) ==0);
|
|
checkerboard=0;
|
|
}
|
|
|
|
template<class sobj> strong_inline Lattice<vobj> & operator = (const sobj & r){
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
this->_odata[ss]=r;
|
|
}
|
|
return *this;
|
|
}
|
|
template<class robj> strong_inline Lattice<vobj> & operator = (const Lattice<robj> & r){
|
|
this->checkerboard = r.checkerboard;
|
|
conformable(*this,r);
|
|
std::cout<<GridLogMessage<<"Lattice operator ="<<std::endl;
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<_grid->oSites();ss++){
|
|
this->_odata[ss]=r._odata[ss];
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
// *=,+=,-= operators inherit behvour from correspond */+/- operation
|
|
template<class T> strong_inline Lattice<vobj> &operator *=(const T &r) {
|
|
*this = (*this)*r;
|
|
return *this;
|
|
}
|
|
|
|
template<class T> strong_inline Lattice<vobj> &operator -=(const T &r) {
|
|
*this = (*this)-r;
|
|
return *this;
|
|
}
|
|
template<class T> strong_inline Lattice<vobj> &operator +=(const T &r) {
|
|
*this = (*this)+r;
|
|
return *this;
|
|
}
|
|
|
|
strong_inline friend Lattice<vobj> operator / (const Lattice<vobj> &lhs,const Lattice<vobj> &rhs){
|
|
conformable(lhs,rhs);
|
|
Lattice<vobj> ret(lhs._grid);
|
|
PARALLEL_FOR_LOOP
|
|
for(int ss=0;ss<lhs._grid->oSites();ss++){
|
|
ret._odata[ss] = lhs._odata[ss]*pow(rhs._odata[ss],-1.0);
|
|
}
|
|
return ret;
|
|
};
|
|
|
|
}; // class Lattice
|
|
|
|
template<class vobj> std::ostream& operator<< (std::ostream& stream, const Lattice<vobj> &o){
|
|
std::vector<int> gcoor;
|
|
typedef typename vobj::scalar_object sobj;
|
|
sobj ss;
|
|
for(int g=0;g<o._grid->_gsites;g++){
|
|
o._grid->GlobalIndexToGlobalCoor(g,gcoor);
|
|
peekSite(ss,o,gcoor);
|
|
stream<<"[";
|
|
for(int d=0;d<gcoor.size();d++){
|
|
stream<<gcoor[d];
|
|
if(d!=gcoor.size()-1) stream<<",";
|
|
}
|
|
stream<<"]\t";
|
|
stream<<ss<<std::endl;
|
|
}
|
|
return stream;
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#include <lattice/Lattice_conformable.h>
|
|
#define GRID_LATTICE_EXPRESSION_TEMPLATES
|
|
#ifdef GRID_LATTICE_EXPRESSION_TEMPLATES
|
|
#include <lattice/Lattice_ET.h>
|
|
#else
|
|
#include <lattice/Lattice_overload.h>
|
|
#endif
|
|
#include <lattice/Lattice_arith.h>
|
|
#include <lattice/Lattice_trace.h>
|
|
#include <lattice/Lattice_transpose.h>
|
|
#include <lattice/Lattice_local.h>
|
|
#include <lattice/Lattice_reduction.h>
|
|
#include <lattice/Lattice_peekpoke.h>
|
|
#include <lattice/Lattice_reality.h>
|
|
#include <lattice/Lattice_comparison_utils.h>
|
|
#include <lattice/Lattice_comparison.h>
|
|
#include <lattice/Lattice_coordinate.h>
|
|
#include <lattice/Lattice_where.h>
|
|
#include <lattice/Lattice_rng.h>
|
|
#include <lattice/Lattice_unary.h>
|
|
#include <lattice/Lattice_transfer.h>
|
|
|
|
|
|
#endif
|