Files
LBPM/tests/lbpm_refine_pp.cpp

163 lines
4.1 KiB
C++
Raw Normal View History

2017-03-26 14:10:59 -04:00
/*
2017-03-27 22:16:26 -04:00
* Pre-processor to refine signed distance mesh
* this is a good way to increase the resolution
2017-03-26 14:10:59 -04:00
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <fstream>
#include <sstream>
#include "common/Array.h"
2017-03-27 22:16:26 -04:00
#include "common/Communication.h"
2017-03-26 14:10:59 -04:00
#include "common/Domain.h"
#include "common/pmmc.h"
int main(int argc, char **argv)
{
// Initialize MPI
int rank, nprocs;
MPI_Init(&argc,&argv);
MPI_Comm comm = MPI_COMM_WORLD;
MPI_Comm_rank(comm,&rank);
MPI_Comm_size(comm,&nprocs);
2017-03-27 22:16:26 -04:00
{
2017-03-26 14:10:59 -04:00
//.......................................................................
// Reading the domain information file
//.......................................................................
int nprocx, nprocy, nprocz, nx, ny, nz, nspheres;
double Lx, Ly, Lz;
int i,j,k,n;
int BC=0;
2017-03-27 22:16:26 -04:00
if ( rank==0 ) {
printf("lbpm_refine_pp: Refining signed distance mesh (x2) \n");
}
2017-03-26 14:10:59 -04:00
if (rank==0){
ifstream domain("Domain.in");
domain >> nprocx;
domain >> nprocy;
domain >> nprocz;
domain >> nx;
domain >> ny;
domain >> nz;
domain >> nspheres;
domain >> Lx;
domain >> Ly;
domain >> Lz;
}
MPI_Barrier(comm);
// Computational domain
MPI_Bcast(&nx,1,MPI_INT,0,comm);
MPI_Bcast(&ny,1,MPI_INT,0,comm);
MPI_Bcast(&nz,1,MPI_INT,0,comm);
MPI_Bcast(&nprocx,1,MPI_INT,0,comm);
MPI_Bcast(&nprocy,1,MPI_INT,0,comm);
MPI_Bcast(&nprocz,1,MPI_INT,0,comm);
MPI_Bcast(&nspheres,1,MPI_INT,0,comm);
MPI_Bcast(&Lx,1,MPI_DOUBLE,0,comm);
MPI_Bcast(&Ly,1,MPI_DOUBLE,0,comm);
MPI_Bcast(&Lz,1,MPI_DOUBLE,0,comm);
//.................................................
MPI_Barrier(comm);
// Check that the number of processors >= the number of ranks
if ( rank==0 ) {
printf("Number of MPI ranks required: %i \n", nprocx*nprocy*nprocz);
printf("Number of MPI ranks used: %i \n", nprocs);
printf("Full domain size: %i x %i x %i \n",nx*nprocx,ny*nprocy,nz*nprocz);
}
if ( nprocs < nprocx*nprocy*nprocz ){
ERROR("Insufficient number of processors");
}
char LocalRankFilename[40];
2017-03-27 22:16:26 -04:00
int rnx,rny,rnz;
rnx=2*(nx-1)+1;
rny=2*(ny-1)+1;
rnz=2*(nz-1)+1;
rnx=2*nx;
rny=2*ny;
rnz=2*nz;
if (rank==0) printf("Refining mesh to %i x %i x %i \n",rnx,rny,rnz);
2017-03-26 14:10:59 -04:00
int BoundaryCondition=0;
2017-03-27 22:16:26 -04:00
Domain Dm(rnx,rny,rnz,rank,nprocx,nprocy,nprocz,Lx,Ly,Lz,BoundaryCondition);
// Communication the halos
const RankInfoStruct rank_info(rank,nprocx,nprocy,nprocz);
fillHalo<double> fillData(comm,rank_info,rnx,rny,rnz,1,1,1,0,1);
2017-03-26 14:10:59 -04:00
nx+=2; ny+=2; nz+=2;
2017-03-27 22:16:26 -04:00
rnx+=2; rny+=2; rnz+=2;
2017-03-26 14:10:59 -04:00
int N = nx*ny*nz;
// Define communication sub-domain -- everywhere
2017-03-27 22:16:26 -04:00
for (int k=0; k<rnz; k++){
for (int j=0; j<rny; j++){
for (int i=0; i<rnx; i++){
n = k*rnx*rny+j*rnx+i;
2017-03-26 14:10:59 -04:00
Dm.id[n] = 1;
}
}
}
Dm.CommInit(comm);
2017-03-27 20:41:13 -04:00
2017-03-26 14:10:59 -04:00
DoubleArray SignDist(nx,ny,nz);
// Read the signed distance from file
sprintf(LocalRankFilename,"SignDist.%05i",rank);
FILE *DIST = fopen(LocalRankFilename,"rb");
size_t ReadSignDist;
ReadSignDist=fread(SignDist.data(),8,N,DIST);
2017-03-27 20:41:13 -04:00
if (ReadSignDist != size_t(N)) printf("lbpm_refine_pp: Error reading signed distance function (rank=%i)\n",rank);
2017-03-26 14:10:59 -04:00
fclose(DIST);
2017-03-27 22:16:26 -04:00
if ( rank==0 ) printf("Set up Domain, read input distance \n");
2017-03-26 14:10:59 -04:00
DoubleArray RefinedSignDist(rnx,rny,rnz);
TriLinPoly LocalApprox;
Point pt;
int ri,rj,rk,rn; //refined mesh indices
2017-03-27 22:16:26 -04:00
for (rk=1; rk<rnz-2; rk++){
for (rj=1; rj<rny-2; rj++){
for (ri=1; ri<rnx-2; ri++){
2017-03-27 20:11:55 -04:00
n = rk*rnx*rny+rj*rnx+ri;
// starting node for each processor matches exactly
2017-03-27 22:16:26 -04:00
i = (ri-1)/2+1;
j = (rj-1)/2+1;
k = (rk-1)/2+1;
//printf("(%i,%i,%i -> %i,%i,%i) \n",ri,rj,rk,i,j,k);
2017-03-26 14:10:59 -04:00
// Assign local tri-linear polynomial
2017-03-27 20:11:55 -04:00
LocalApprox.assign(SignDist,i,j,k);
pt.x=0.5*(ri-1)+1.f;
pt.y=0.5*(rj-1)+1.f;
pt.z=0.5*(rk-1)+1.f;
RefinedSignDist(ri,rj,rk) = LocalApprox.eval(pt);
}
2017-03-26 14:10:59 -04:00
}
}
2017-03-27 22:16:26 -04:00
fillData.fill(RefinedSignDist);
2017-03-27 20:41:13 -04:00
// sprintf(LocalRankFilename,"ID.%05i",rank);
//FILE *ID = fopen(LocalRankFilename,"wb");
//fwrite(id,1,N,ID);
//fclose(ID);
sprintf(LocalRankFilename,"RefineDist.%05i",rank);
2017-03-27 22:16:26 -04:00
FILE *REFINEDIST = fopen(LocalRankFilename,"wb");
2017-03-27 20:41:13 -04:00
fwrite(RefinedSignDist.data(),8,rnx*rny*rnz,REFINEDIST);
fclose(REFINEDIST);
2017-03-26 14:10:59 -04:00
2017-03-27 22:16:26 -04:00
}
2017-03-26 14:10:59 -04:00
MPI_Barrier(comm);
MPI_Finalize();
return 0;
}