#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 class LatticeUnaryExpression : public std::pair > , public LatticeExpressionBase { public: LatticeUnaryExpression(const std::pair > &arg): std::pair >(arg) {}; }; template class LatticeBinaryExpression : public std::pair > , public LatticeExpressionBase { public: LatticeBinaryExpression(const std::pair > &arg): std::pair >(arg) {}; }; template class LatticeTrinaryExpression :public std::pair >, public LatticeExpressionBase { public: LatticeTrinaryExpression(const std::pair > &arg): std::pair >(arg) {}; }; void inline conformable(GridBase *lhs,GridBase *rhs) { assert(lhs == rhs); } template class Lattice : public LatticeBase { public: GridBase *_grid; int checkerboard; std::vector > _odata; public: typedef typename vobj::scalar_type scalar_type; typedef typename vobj::vector_type vector_type; typedef vobj vector_object; //////////////////////////////////////////////////////////////////////////////// // Expression Template closure support //////////////////////////////////////////////////////////////////////////////// template strong_inline Lattice & operator=(const LatticeUnaryExpression &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 strong_inline Lattice & operator=(const LatticeBinaryExpression &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 strong_inline Lattice & operator=(const LatticeTrinaryExpression &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; } //GridFromExpression is tricky to do template Lattice(const LatticeUnaryExpression & 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 Lattice(const LatticeBinaryExpression & 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 Lattice(const LatticeTrinaryExpression & 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 } }; ////////////////////////////////////////////////////////////////// // 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 strong_inline Lattice & operator = (const sobj & r){ PARALLEL_FOR_LOOP for(int ss=0;ss<_grid->oSites();ss++){ this->_odata[ss]=r; } return *this; } template strong_inline Lattice & operator = (const Lattice & r){ this->checkerboard = r.checkerboard; conformable(*this,r); std::cout<<"Lattice operator ="<oSites();ss++){ this->_odata[ss]=r._odata[ss]; } return *this; } // *=,+=,-= operators inherit behvour from correspond */+/- operation template strong_inline Lattice &operator *=(const T &r) { *this = (*this)*r; return *this; } template strong_inline Lattice &operator -=(const T &r) { *this = (*this)-r; return *this; } template strong_inline Lattice &operator +=(const T &r) { *this = (*this)+r; return *this; } strong_inline friend Lattice operator / (const Lattice &lhs,const Lattice &rhs){ conformable(lhs,rhs); Lattice ret(lhs._grid); PARALLEL_FOR_LOOP for(int ss=0;ssoSites();ss++){ ret._odata[ss] = lhs._odata[ss]/rhs._odata[ss]; } return ret; }; }; // class Lattice template std::ostream& operator<< (std::ostream& stream, const Lattice &o){ std::vector gcoor; typedef typename vobj::scalar_object sobj; sobj ss; for(int g=0;g_gsites;g++){ o._grid->GlobalIndexToGlobalCoor(g,gcoor); peekSite(ss,o,gcoor); stream<<"["; for(int d=0;d #define GRID_LATTICE_EXPRESSION_TEMPLATES #ifdef GRID_LATTICE_EXPRESSION_TEMPLATES #include #else #include #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif