mirror of
https://github.com/paboyle/Grid.git
synced 2024-11-14 01:35:36 +00:00
224 lines
7.4 KiB
C++
224 lines
7.4 KiB
C++
/*************************************************************************************
|
|
|
|
Grid physics library, www.github.com/paboyle/Grid
|
|
|
|
Source file: ./tests/Test_cshift_red_black.cc
|
|
|
|
Copyright (C) 2015
|
|
|
|
Author: Azusa Yamaguchi <ayamaguc@staffmail.ed.ac.uk>
|
|
Author: Peter Boyle <paboyle@ph.ed.ac.uk>
|
|
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 */
|
|
#include <Grid.h>
|
|
|
|
using namespace Grid;
|
|
using namespace Grid::QCD;
|
|
|
|
int main (int argc, char ** argv)
|
|
{
|
|
Grid_init(&argc,&argv);
|
|
|
|
std::vector<int> latt_size = GridDefaultLatt();
|
|
int Nd = latt_size.size();
|
|
std::vector<int> simd_layout = GridDefaultSimd(Nd,vComplex::Nsimd());
|
|
std::vector<int> mpi_layout = GridDefaultMpi();
|
|
|
|
std::vector<int> mask(Nd,1);
|
|
mask[0]=0;
|
|
|
|
GridCartesian Fine (latt_size,simd_layout,mpi_layout);
|
|
GridRedBlackCartesian RBFine(latt_size,simd_layout,mpi_layout,mask,1);
|
|
|
|
GridParallelRNG FineRNG(&Fine); FineRNG.SeedRandomDevice();
|
|
|
|
LatticeComplex U(&Fine);
|
|
LatticeComplex ShiftU(&Fine);
|
|
LatticeComplex rbShiftU(&Fine);
|
|
LatticeComplex Ue(&RBFine);
|
|
LatticeComplex Uo(&RBFine);
|
|
LatticeComplex ShiftUe(&RBFine);
|
|
LatticeComplex ShiftUo(&RBFine);
|
|
LatticeComplex lex(&Fine);
|
|
lex=zero;
|
|
Integer stride =1;
|
|
{
|
|
double nrm;
|
|
LatticeComplex coor(&Fine);
|
|
|
|
for(int d=0;d<Nd;d++){
|
|
// Integer i=10000;
|
|
Integer i=0;
|
|
LatticeCoordinate(coor,d);
|
|
lex = lex + coor*stride+i;
|
|
stride=stride*latt_size[d];
|
|
}
|
|
U=lex;
|
|
}
|
|
|
|
pickCheckerboard(Even,Ue,U);
|
|
pickCheckerboard(Odd,Uo,U);
|
|
|
|
// std::cout<<GridLogMessage << U<<std::endl;
|
|
std::cout<<GridLogMessage << "Ue " <<norm2(Ue)<<std::endl;
|
|
std::cout<<GridLogMessage << "Uo " <<norm2(Uo)<<std::endl;
|
|
|
|
|
|
TComplex cm;
|
|
TComplex cmeo;
|
|
for(int dir=0;dir<Nd;dir++){
|
|
// if ( dir!=1 ) continue;
|
|
for(int shift=0;shift<latt_size[dir];shift++){
|
|
|
|
std::cout<<GridLogMessage<<"Shifting by "<<shift<<" in direction"<<dir<<std::endl;
|
|
|
|
std::cout<<GridLogMessage<<"Even grid"<<std::endl;
|
|
ShiftUe = Cshift(Ue,dir,shift); // Shift everything cb by cb
|
|
std::cout<<GridLogMessage << "\tShiftUe " <<norm2(ShiftUe)<<std::endl;
|
|
|
|
std::cout<<GridLogMessage<<"Odd grid"<<std::endl;
|
|
ShiftUo = Cshift(Uo,dir,shift);
|
|
std::cout<<GridLogMessage << "\tShiftUo " <<norm2(ShiftUo)<<std::endl;
|
|
|
|
std::cout<<GridLogMessage<<"Recombined Even/Odd grids"<<std::endl;
|
|
setCheckerboard(rbShiftU,ShiftUe);
|
|
setCheckerboard(rbShiftU,ShiftUo);
|
|
std::cout<<GridLogMessage << "\trbShiftU " <<norm2(rbShiftU)<<std::endl;
|
|
|
|
std::cout<<GridLogMessage<<"Full grid shift"<<std::endl;
|
|
ShiftU = Cshift(U,dir,shift); // Shift everything
|
|
std::cout<<GridLogMessage << "\tShiftU " <<norm2(rbShiftU)<<std::endl;
|
|
|
|
std::vector<int> coor(4);
|
|
|
|
std::cout<<GridLogMessage << "Checking the non-checkerboard shift"<<std::endl;
|
|
for(coor[3]=0;coor[3]<latt_size[3];coor[3]++){
|
|
for(coor[2]=0;coor[2]<latt_size[2];coor[2]++){
|
|
for(coor[1]=0;coor[1]<latt_size[1];coor[1]++){
|
|
for(coor[0]=0;coor[0]<latt_size[0];coor[0]++){
|
|
|
|
peekSite(cm,ShiftU,coor);
|
|
|
|
///////// double nrm=norm2(U);
|
|
|
|
std::vector<int> scoor(coor);
|
|
scoor[dir] = (scoor[dir]+shift)%latt_size[dir];
|
|
|
|
Integer slex = scoor[0]
|
|
+ latt_size[0]*scoor[1]
|
|
+ latt_size[0]*latt_size[1]*scoor[2]
|
|
+ latt_size[0]*latt_size[1]*latt_size[2]*scoor[3];
|
|
|
|
Complex scm(slex);
|
|
|
|
double nrm = abs(scm-cm()()());
|
|
std::vector<int> peer(4);
|
|
Complex ctmp = cm;
|
|
Integer index=real(ctmp);
|
|
Lexicographic::CoorFromIndex(peer,index,latt_size);
|
|
|
|
if (nrm > 0){
|
|
std::cout<<"FAIL shift "<< shift<<" in dir "<< dir
|
|
<<" ["<<coor[0]<<","<<coor[1]<<","<<coor[2]<<","<<coor[3]<<"] = "
|
|
<< cm()()()<<" expect "<<scm<<" "<<nrm<<std::endl;
|
|
std::cout<<"Got "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
index=real(scm);
|
|
Lexicographic::CoorFromIndex(peer,index,latt_size);
|
|
std::cout<<"Expect "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
exit(-1);
|
|
}
|
|
}}}}
|
|
|
|
int exx=0;
|
|
std::cout<<GridLogMessage << "Checking the checkerboard shift"<<std::endl;
|
|
for(coor[3]=0;coor[3]<latt_size[3];coor[3]++){
|
|
for(coor[2]=0;coor[2]<latt_size[2];coor[2]++){
|
|
for(coor[1]=0;coor[1]<latt_size[1];coor[1]++){
|
|
for(coor[0]=0;coor[0]<latt_size[0];coor[0]++){
|
|
|
|
peekSite(cm,rbShiftU,coor);
|
|
|
|
Integer checkerboard = RBFine.CheckerBoard(coor);
|
|
|
|
// std::cout << " coor "<<" ["<<coor[0]<<","<<coor[1]<<","<<coor[2]<<","<<coor[3]<<"] \n ";
|
|
// std::cout << "shift "<< shift <<" dir "<<dir<< " checker board "<< checkerboard << " ";
|
|
// std::cout << "Uo " << ShiftUo.checkerboard << " Ue "<<ShiftUe.checkerboard<<std::endl;
|
|
if ( checkerboard == ShiftUo.checkerboard ) {
|
|
peekSite(cmeo,ShiftUo,coor);
|
|
} else {
|
|
peekSite(cmeo,ShiftUe,coor);
|
|
}
|
|
|
|
|
|
std::vector<int> scoor(coor);
|
|
scoor[dir] = (scoor[dir]+shift)%latt_size[dir];
|
|
|
|
Integer slex = scoor[0]
|
|
+ latt_size[0]*scoor[1]
|
|
+ latt_size[0]*latt_size[1]*scoor[2]
|
|
+ latt_size[0]*latt_size[1]*latt_size[2]*scoor[3];
|
|
|
|
Complex scm(slex);
|
|
|
|
std::vector<int> peer(4);
|
|
Complex ctmp=cmeo;
|
|
Integer index=real(ctmp);
|
|
Lexicographic::CoorFromIndex(peer,index,latt_size);
|
|
|
|
double nrm = abs(cmeo()()()-scm);
|
|
if (nrm != 0) {
|
|
std::cout<<"EOFAIL shift "<< shift<<" in dir "<< dir
|
|
<<" ["<<coor[0]<<","<<coor[1]<<","<<coor[2]<<","<<coor[3]<<"] = "
|
|
<< cmeo()()()<<" expect "<<scm<<" "<<nrm<<std::endl;
|
|
std::cout<<"Got "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
index=real(scm);
|
|
Lexicographic::CoorFromIndex(peer,index,latt_size);
|
|
std::cout<<"Expect "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
exx=1;
|
|
|
|
}
|
|
|
|
ctmp=cm;
|
|
index=real(ctmp);
|
|
nrm = abs(scm-cm()()());
|
|
|
|
if (nrm > 0){
|
|
std::cout<<"FAIL shift "<< shift<<" in dir "<< dir
|
|
<<" ["<<coor[0]<<","<<coor[1]<<","<<coor[2]<<","<<coor[3]<<"] = "
|
|
<< cm()()()<<" expect "<<scm<<" "<<nrm<<std::endl;
|
|
std::cout<<"Got "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
index=real(scm);
|
|
Lexicographic::CoorFromIndex(peer,index,latt_size);
|
|
std::cout<<"Expect "<<index<<" " << peer[0]<<","<<peer[1]<<","<<peer[2]<<","<<peer[3]<<std::endl;
|
|
exx=1;
|
|
} else if (1) {
|
|
std::cout<<GridLogMessage<<"PASS shift "<< shift<<" in dir "<< dir
|
|
<<" ["<<coor[0]<<","<<coor[1]<<","<<coor[2]<<","<<coor[3]<<"] = "
|
|
<< cm()()()<<" expect "<<scm<<" "<<nrm<<std::endl;
|
|
}
|
|
}}}}
|
|
if (exx) exit(-1);
|
|
|
|
}
|
|
}
|
|
|
|
Grid_finalize();
|
|
}
|