int main(int argc, char **argv)
{
// OP initialisation
op_init(argc,argv,2);
//MPI for user I/O
int my_rank;
int comm_size;
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
MPI_Comm_size(MPI_COMM_WORLD, &comm_size);
//timer
double cpu_t1, cpu_t2, wall_t1, wall_t2;
int *becell, *ecell, *bound, *bedge, *edge, *cell;
double *x, *q, *qold, *adt, *res;
int nnode,ncell,nedge,nbedge,niter;
double rms;
/**------------------------BEGIN I/O and PARTITIONING -------------------**/
op_timers(&cpu_t1, &wall_t1);
/* read in grid from disk on root processor */
FILE *fp;
if ( (fp = fopen("new_grid.dat","r")) == NULL) {
op_printf("can't open file new_grid.dat\n"); exit(-1);
}
int g_nnode,g_ncell,g_nedge,g_nbedge;
check_scan(fscanf(fp,"%d %d %d %d \n",&g_nnode, &g_ncell, &g_nedge, &g_nbedge), 4);
int *g_becell = 0, *g_ecell = 0, *g_bound = 0, *g_bedge = 0, *g_edge = 0, *g_cell = 0;
double *g_x = 0,*g_q = 0, *g_qold = 0, *g_adt = 0, *g_res = 0;
// set constants
op_printf("initialising flow field\n");
gam = 1.4f;
gm1 = gam - 1.0f;
cfl = 0.9f;
eps = 0.05f;
double mach = 0.4f;
double alpha = 3.0f*atan(1.0f)/45.0f;
double p = 1.0f;
double r = 1.0f;
double u = sqrt(gam*p/r)*mach;
double e = p/(r*gm1) + 0.5f*u*u;
qinf[0] = r;
qinf[1] = r*u;
qinf[2] = 0.0f;
qinf[3] = r*e;
op_printf("reading in grid \n");
op_printf("Global number of nodes, cells, edges, bedges = %d, %d, %d, %d\n"
,g_nnode,g_ncell,g_nedge,g_nbedge);
if(my_rank == MPI_ROOT) {
g_cell = (int *) malloc(4*g_ncell*sizeof(int));
g_edge = (int *) malloc(2*g_nedge*sizeof(int));
g_ecell = (int *) malloc(2*g_nedge*sizeof(int));
g_bedge = (int *) malloc(2*g_nbedge*sizeof(int));
g_becell = (int *) malloc( g_nbedge*sizeof(int));
g_bound = (int *) malloc( g_nbedge*sizeof(int));
g_x = (double *) malloc(2*g_nnode*sizeof(double));
g_q = (double *) malloc(4*g_ncell*sizeof(double));
g_qold = (double *) malloc(4*g_ncell*sizeof(double));
g_res = (double *) malloc(4*g_ncell*sizeof(double));
g_adt = (double *) malloc( g_ncell*sizeof(double));
for (int n=0; n<g_nnode; n++){
check_scan(fscanf(fp,"%lf %lf \n",&g_x[2*n], &g_x[2*n+1]), 2);
}
for (int n=0; n<g_ncell; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_cell[4*n ], &g_cell[4*n+1],
&g_cell[4*n+2], &g_cell[4*n+3]), 4);
}
for (int n=0; n<g_nedge; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_edge[2*n],&g_edge[2*n+1],
&g_ecell[2*n],&g_ecell[2*n+1]), 4);
}
for (int n=0; n<g_nbedge; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_bedge[2*n],&g_bedge[2*n+1],
&g_becell[n],&g_bound[n]), 4);
}
//initialise flow field and residual
for (int n=0; n<g_ncell; n++) {
for (int m=0; m<4; m++) {
g_q[4*n+m] = qinf[m];
g_res[4*n+m] = 0.0f;
}
}
}
fclose(fp);
nnode = compute_local_size (g_nnode, comm_size, my_rank);
ncell = compute_local_size (g_ncell, comm_size, my_rank);
nedge = compute_local_size (g_nedge, comm_size, my_rank);
nbedge = compute_local_size (g_nbedge, comm_size, my_rank);
op_printf("Number of nodes, cells, edges, bedges on process %d = %d, %d, %d, %d\n"
,my_rank,nnode,ncell,nedge,nbedge);
/*Allocate memory to hold local sets, mapping tables and data*/
cell = (int *) malloc(4*ncell*sizeof(int));
edge = (int *) malloc(2*nedge*sizeof(int));
ecell = (int *) malloc(2*nedge*sizeof(int));
bedge = (int *) malloc(2*nbedge*sizeof(int));
becell = (int *) malloc( nbedge*sizeof(int));
bound = (int *) malloc( nbedge*sizeof(int));
x = (double *) malloc(2*nnode*sizeof(double));
q = (double *) malloc(4*ncell*sizeof(double));
qold = (double *) malloc(4*ncell*sizeof(double));
res = (double *) malloc(4*ncell*sizeof(double));
adt = (double *) malloc( ncell*sizeof(double));
/* scatter sets, mappings and data on sets*/
scatter_int_array(g_cell, cell, comm_size, g_ncell,ncell, 4);
scatter_int_array(g_edge, edge, comm_size, g_nedge,nedge, 2);
scatter_int_array(g_ecell, ecell, comm_size, g_nedge,nedge, 2);
scatter_int_array(g_bedge, bedge, comm_size, g_nbedge,nbedge, 2);
scatter_int_array(g_becell, becell, comm_size, g_nbedge,nbedge, 1);
scatter_int_array(g_bound, bound, comm_size, g_nbedge,nbedge, 1);
scatter_double_array(g_x, x, comm_size, g_nnode,nnode, 2);
scatter_double_array(g_q, q, comm_size, g_ncell,ncell, 4);
scatter_double_array(g_qold, qold, comm_size, g_ncell,ncell, 4);
scatter_double_array(g_res, res, comm_size, g_ncell,ncell, 4);
scatter_double_array(g_adt, adt, comm_size, g_ncell,ncell, 1);
/*Freeing memory allocated to gloabal arrays on rank 0
after scattering to all processes*/
if(my_rank == MPI_ROOT) {
free(g_cell);
free(g_edge);
free(g_ecell);
free(g_bedge);
free(g_becell);
free(g_bound);
free(g_x );
free(g_q);
free(g_qold);
free(g_adt);
free(g_res);
}
op_timers(&cpu_t2, &wall_t2);
op_printf("Max total file read time = %f\n", wall_t2-wall_t1);
/**------------------------END I/O and PARTITIONING -----------------------**/
// declare sets, pointers, datasets and global constants
op_set nodes = op_decl_set(nnode, "nodes");
op_set edges = op_decl_set(nedge, "edges");
op_set bedges = op_decl_set(nbedge, "bedges");
op_set cells = op_decl_set(ncell, "cells");
op_map pedge = op_decl_map(edges, nodes,2,edge, "pedge");
op_map pecell = op_decl_map(edges, cells,2,ecell, "pecell");
op_map pbedge = op_decl_map(bedges,nodes,2,bedge, "pbedge");
op_map pbecell = op_decl_map(bedges,cells,1,becell,"pbecell");
op_map pcell = op_decl_map(cells, nodes,4,cell, "pcell");
op_dat p_bound = op_decl_dat(bedges,1,"int" ,bound,"p_bound");
op_dat p_x = op_decl_dat(nodes ,2,"double",x ,"p_x");
op_dat p_q = op_decl_dat(cells ,4,"double",q ,"p_q");
//op_dat p_qold = op_decl_dat(cells ,4,"double",qold ,"p_qold");
//op_dat p_adt = op_decl_dat(cells ,1,"double",adt ,"p_adt");
//op_dat p_res = op_decl_dat(cells ,4,"double",res ,"p_res");
// p_res, p_adt and p_qold now declared as a temp op_dats during
// the execution of the time-marching loop
op_decl_const2("gam",1,"double",&gam );
op_decl_const2("gm1",1,"double",&gm1 );
op_decl_const2("cfl",1,"double",&cfl );
op_decl_const2("eps",1,"double",&eps );
op_decl_const2("mach",1,"double",&mach );
op_decl_const2("alpha",1,"double",&alpha);
op_decl_const2("qinf",4,"double",qinf );
op_diagnostic_output();
//trigger partitioning and halo creation routines
op_partition("PTSCOTCH", "KWAY", cells, pecell, p_x);
//initialise timers for total execution wall time
op_timers(&cpu_t1, &wall_t1);
niter = 1000;
for(int iter=1; iter<=niter; iter++) {
double* tmp_elem = NULL;
op_dat p_res = op_decl_dat_temp(cells ,4,"double",tmp_elem,"p_res");
op_dat p_adt = op_decl_dat_temp(cells ,1,"double",tmp_elem,"p_adt");
op_dat p_qold = op_decl_dat_temp(cells ,4,"double",qold ,"p_qold");
//save old flow solution
op_par_loop_save_soln("save_soln",cells,
op_arg_dat(p_q,-1,OP_ID,4,"double",OP_READ),
op_arg_dat(p_qold,-1,OP_ID,4,"double",OP_WRITE));
// predictor/corrector update loop
for(int k=0; k<2; k++) {
// calculate area/timstep
op_par_loop_adt_calc("adt_calc",cells,
op_arg_dat(p_x,0,pcell,2,"double",OP_READ),
op_arg_dat(p_x,1,pcell,2,"double",OP_READ),
op_arg_dat(p_x,2,pcell,2,"double",OP_READ),
op_arg_dat(p_x,3,pcell,2,"double",OP_READ),
op_arg_dat(p_q,-1,OP_ID,4,"double",OP_READ),
op_arg_dat(p_adt,-1,OP_ID,1,"double",OP_WRITE));
// calculate flux residual
op_par_loop_res_calc("res_calc",edges,
op_arg_dat(p_x,0,pedge,2,"double",OP_READ),
op_arg_dat(p_x,1,pedge,2,"double",OP_READ),
op_arg_dat(p_q,0,pecell,4,"double",OP_READ),
op_arg_dat(p_q,1,pecell,4,"double",OP_READ),
op_arg_dat(p_adt,0,pecell,1,"double",OP_READ),
op_arg_dat(p_adt,1,pecell,1,"double",OP_READ),
op_arg_dat(p_res,0,pecell,4,"double",OP_INC),
op_arg_dat(p_res,1,pecell,4,"double",OP_INC));
op_par_loop_bres_calc("bres_calc",bedges,
op_arg_dat(p_x,0,pbedge,2,"double",OP_READ),
op_arg_dat(p_x,1,pbedge,2,"double",OP_READ),
op_arg_dat(p_q,0,pbecell,4,"double",OP_READ),
op_arg_dat(p_adt,0,pbecell,1,"double",OP_READ),
op_arg_dat(p_res,0,pbecell,4,"double",OP_INC),
op_arg_dat(p_bound,-1,OP_ID,1,"int",OP_READ));
// update flow field
rms = 0.0;
op_par_loop_update("update",cells,
op_arg_dat(p_qold,-1,OP_ID,4,"double",OP_READ),
op_arg_dat(p_q,-1,OP_ID,4,"double",OP_WRITE),
op_arg_dat(p_res,-1,OP_ID,4,"double",OP_RW),
op_arg_dat(p_adt,-1,OP_ID,1,"double",OP_READ),
op_arg_gbl(&rms,1,"double",OP_INC));
}
//print iteration history
rms = sqrt(rms/(double) g_ncell);
if (iter%100 == 0)
op_printf("%d %10.5e \n",iter,rms);
if (op_free_dat_temp(p_res) < 0)
op_printf("Error: temporary op_dat %s cannot be removed\n",p_res->name);
if (op_free_dat_temp(p_adt) < 0)
op_printf("Error: temporary op_dat %s cannot be removed\n",p_adt->name);
if (op_free_dat_temp(p_qold) < 0)
op_printf("Error: temporary op_dat %s cannot be removed\n",p_qold->name);
}
op_timers(&cpu_t2, &wall_t2);
op_timing_output();
//print total time for niter interations
op_printf("Max total runtime = %f\n",wall_t2-wall_t1);
op_exit();
free(cell);
free(edge);
free(ecell);
free(bedge);
free(becell);
free(bound);
free(x);
free(q);
free(qold);
free(res);
free(adt);
}
int main(int argc, char **argv) {
// OP initialisation
op_init(argc, argv, 2);
// MPI for user I/O
int my_rank;
int comm_size;
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
MPI_Comm_size(MPI_COMM_WORLD, &comm_size);
// timer
double cpu_t1, cpu_t2, wall_t1, wall_t2;
int *becell, *ecell, *bound, *bedge, *edge, *cell;
double *x, *q, *qold, *adt, *res;
int nnode, ncell, nedge, nbedge, niter;
/**------------------------BEGIN I/O and PARTITIONING -------------------**/
op_timers(&cpu_t1, &wall_t1);
/* read in grid from disk on root processor */
FILE *fp;
if ((fp = fopen("new_grid.dat", "r")) == NULL) {
op_printf("can't open file new_grid.dat\n");
exit(-1);
}
int g_nnode, g_ncell, g_nedge, g_nbedge;
check_scan(
fscanf(fp, "%d %d %d %d \n", &g_nnode, &g_ncell, &g_nedge, &g_nbedge), 4);
int *g_becell = 0, *g_ecell = 0, *g_bound = 0, *g_bedge = 0, *g_edge = 0,
*g_cell = 0;
double *g_x = 0, *g_q = 0, *g_qold = 0, *g_adt = 0, *g_res = 0;
op_printf("reading in grid \n");
op_printf("Global number of nodes, cells, edges, bedges = %d, %d, %d, %d\n",
g_nnode, g_ncell, g_nedge, g_nbedge);
if (my_rank == MPI_ROOT) {
g_cell = (int *)malloc(4 * g_ncell * sizeof(int));
g_edge = (int *)malloc(2 * g_nedge * sizeof(int));
g_ecell = (int *)malloc(2 * g_nedge * sizeof(int));
g_bedge = (int *)malloc(2 * g_nbedge * sizeof(int));
g_becell = (int *)malloc(g_nbedge * sizeof(int));
g_bound = (int *)malloc(g_nbedge * sizeof(int));
g_x = (double *)malloc(2 * g_nnode * sizeof(double));
g_q = (double *)malloc(4 * g_ncell * sizeof(double));
g_qold = (double *)malloc(4 * g_ncell * sizeof(double));
g_res = (double *)malloc(4 * g_ncell * sizeof(double));
g_adt = (double *)malloc(g_ncell * sizeof(double));
for (int n = 0; n < g_nnode; n++) {
check_scan(fscanf(fp, "%lf %lf \n", &g_x[2 * n], &g_x[2 * n + 1]), 2);
}
for (int n = 0; n < g_ncell; n++) {
check_scan(fscanf(fp, "%d %d %d %d \n", &g_cell[4 * n],
&g_cell[4 * n + 1], &g_cell[4 * n + 2],
&g_cell[4 * n + 3]),
4);
}
for (int n = 0; n < g_nedge; n++) {
check_scan(fscanf(fp, "%d %d %d %d \n", &g_edge[2 * n],
&g_edge[2 * n + 1], &g_ecell[2 * n],
&g_ecell[2 * n + 1]),
4);
}
for (int n = 0; n < g_nbedge; n++) {
check_scan(fscanf(fp, "%d %d %d %d \n", &g_bedge[2 * n],
&g_bedge[2 * n + 1], &g_becell[n], &g_bound[n]),
4);
}
// initialise flow field and residual
}
fclose(fp);
nnode = compute_local_size(g_nnode, comm_size, my_rank);
ncell = compute_local_size(g_ncell, comm_size, my_rank);
nedge = compute_local_size(g_nedge, comm_size, my_rank);
nbedge = compute_local_size(g_nbedge, comm_size, my_rank);
op_printf(
"Number of nodes, cells, edges, bedges on process %d = %d, %d, %d, %d\n",
my_rank, nnode, ncell, nedge, nbedge);
/*Allocate memory to hold local sets, mapping tables and data*/
cell = (int *)malloc(4 * ncell * sizeof(int));
edge = (int *)malloc(2 * nedge * sizeof(int));
ecell = (int *)malloc(2 * nedge * sizeof(int));
bedge = (int *)malloc(2 * nbedge * sizeof(int));
becell = (int *)malloc(nbedge * sizeof(int));
bound = (int *)malloc(nbedge * sizeof(int));
x = (double *)malloc(2 * nnode * sizeof(double));
q = (double *)malloc(4 * ncell * sizeof(double));
qold = (double *)malloc(4 * ncell * sizeof(double));
res = (double *)malloc(4 * ncell * sizeof(double));
adt = (double *)malloc(ncell * sizeof(double));
/* scatter sets, mappings and data on sets*/
scatter_int_array(g_cell, cell, comm_size, g_ncell, ncell, 4);
scatter_int_array(g_edge, edge, comm_size, g_nedge, nedge, 2);
scatter_int_array(g_ecell, ecell, comm_size, g_nedge, nedge, 2);
scatter_int_array(g_bedge, bedge, comm_size, g_nbedge, nbedge, 2);
scatter_int_array(g_becell, becell, comm_size, g_nbedge, nbedge, 1);
scatter_int_array(g_bound, bound, comm_size, g_nbedge, nbedge, 1);
scatter_double_array(g_x, x, comm_size, g_nnode, nnode, 2);
scatter_double_array(g_q, q, comm_size, g_ncell, ncell, 4);
scatter_double_array(g_qold, qold, comm_size, g_ncell, ncell, 4);
scatter_double_array(g_res, res, comm_size, g_ncell, ncell, 4);
scatter_double_array(g_adt, adt, comm_size, g_ncell, ncell, 1);
/*Freeing memory allocated to gloabal arrays on rank 0
after scattering to all processes*/
if (my_rank == MPI_ROOT) {
free(g_cell);
free(g_edge);
free(g_ecell);
free(g_bedge);
free(g_becell);
free(g_bound);
free(g_x);
free(g_q);
free(g_qold);
free(g_adt);
free(g_res);
}
op_timers(&cpu_t2, &wall_t2);
op_printf("Max total file read time = %f\n", wall_t2 - wall_t1);
/**------------------------END I/O and PARTITIONING -----------------------**/
op_set edges = op_decl_set(nedge, "edges");
op_set cells = op_decl_set(ncell, "cells");
op_map pecell = op_decl_map(edges, cells, 2, ecell, "pecell");
op_dat p_res = op_decl_dat(cells, 4, "double", res, "p_res");
int count;
// trigger partitioning and halo creation routines
op_partition("PTSCOTCH", "KWAY", cells, pecell, NULL);
op_diagnostic_output();
// initialise timers for total execution wall time
op_timers(&cpu_t1, &wall_t1);
// indirect reduction
count = 0;
op_par_loop_res_calc("res_calc", edges,
op_arg_dat(p_res, 0, pecell, 4, "double", OP_INC),
op_arg_gbl(&count, 1, "int", OP_INC));
op_printf("number of edges:: %d should be: %d \n", count, g_nedge);
if (count != g_nedge)
op_printf("indirect reduction FAILED\n");
else
op_printf("indirect reduction PASSED\n");
// direct reduction
count = 0;
op_par_loop_update("update", cells,
op_arg_dat(p_res, -1, OP_ID, 4, "double", OP_RW),
op_arg_gbl(&count, 1, "int", OP_INC));
op_printf("number of cells: %d should be: %d \n", count, g_ncell);
if (count != g_ncell)
op_printf("direct reduction FAILED\n");
else
op_printf("direct reduction PASSED\n");
op_timers(&cpu_t2, &wall_t2);
op_timing_output();
op_exit();
free(cell);
free(edge);
free(ecell);
free(bedge);
free(becell);
free(bound);
free(x);
free(q);
free(qold);
free(res);
free(adt);
}
void Simulation::updatePlayers() {
/*NOTE: The Simulation behaves as if events during a turn happen simultaneous.
* That way the simulation is deterministic, even though (partial) events may
* occur in an arbitrary order. This is archived by applying types of event in
* a particular order. E.g. player movements never influence each other.
* Collisions never influence each other. But movement influences Collision.
* Therefor if movement and collision were interleaved, the order of events
* would matter. By splitting movement and collision, the order of events does
* not matter.
* If an event can influence events of its type, this system won’t work. One
* solution to this problem is to split the event in parts, that influence
* each other but not themselves.
*/
// set vision for all players
for (auto &player : players) {
check_scan(player.second);
}
// Player Actions(Movement)
for (auto &player : players) {
player.second.update();
}
// resolve Player Actions(Shooting)
for (auto &player : players) {
// see if any player wants to shoot
if (player.second.shooting) {
// reset the shooting flag
player.second.shooting = false;
// calculate the direction in which the Robot shoots
double direction =
player.second.getRotation() + player.second.getTurretAngle();
Vector_d porjectilePosition = player.second.getPosition();
// make sure we create the Projectile outside the player
porjectilePosition += Vector_d::polar(
direction,
Vector_d(rules.robot_size.x, rules.projectile_size.x).magnitude());
// create the Projectile
projectiles.push_back(
Projectile(rules, porjectilePosition, direction, player.first));
}
}
// resolve Player collision
for (auto &player : players) {
// check collision between playeres
// NOTE: currently we check each pair of players twice, once for
// Collision(A,B) and once for Collision(B,A).
for (auto const &player2 : players) {
if (&player == &player2) {
// don't check collision with self.
continue;
}
if (Collision(player.second, player2.second)) {
collisionSignal(player.first, player2.first);
player.second.takeDamage(rules.collision_damage);
}
}
}
// resolve out-of-Bound events
for (auto &player : players) {
// check if any player is outside the arena
Vector_d pos = player.second.getPosition();
if (pos.x > rules.arena_size.x || pos.y > rules.arena_size.y || pos.x < 0 ||
pos.y < 0) {
outOfBoundsSignal(player.first);
player.second.takeDamage(rules.collision_damage);
}
}
// resolve collision between players and projectiles
for (auto &player : players) {
// check collision between player and projectile
for (auto projectile = projectiles.begin();
projectile != projectiles.end();) {
Collision collision(player.second, *projectile);
if (collision) {
// deal damage to the player
player.second.takeDamage(rules.projectile_damage);
hitSignal(player.first, projectile->owner);
// remove projectile, and advance the iterator
projectile = projectiles.erase(projectile);
} else {
// advance the iterator
++projectile;
}
}
}
}
int main(int argc, char *argv[])
{
int i, j, ns, flag, flagr, ierror, nsects, nh=NDEPTHS, nd=NDISTAS ;
long int nerr ;
double **GFs,*S,*TH,*PH,*x_conv ;
double *b1, *b2, *a1, *a2, gain, dt=1.0 ;
double *tv, *dv ;
float dist,az,baz,xdeg;
char i_master[FSIZE], i_wpfilname[FSIZE], datafile[FSIZE], buf[200] ;
char o_dir[FSIZE], *o_file,stnm[9],netwk[9],cmpnm[9], khole[9];
char stacmp[]= {'Z','N','E','1','2'} ;
char itype[2]="l", ori;
str_quake_params eq ;
sachdr hd_data, hd_synt ;
FILE *i_wp ;
/* Input params */
if (argc < 5)
{
fprintf(stderr,"Error input params \n");
fprintf(stderr,"Syntax : %s i_master cmtfile i_wpinversion o_direct [stftype]\n", argv[0]);
fprintf(stderr,"stftype (optionnal) can be either:\n g (gaussian),\n q (parabolic),\n l (triangle,\n default),\n b(boxcar) or\n c (cosine)\n");
exit(1);
}
strcpy( i_master, argv[1]) ;
strcpy(i_wpfilname, argv[3]) ;
strcpy( o_dir, argv[4]) ;
get_params(i_master, &eq) ;
strcpy( eq.cmtfile, argv[2]) ;
if (argc==6)
{
if (strlen(argv[5])==1)
strcpy(itype,argv[5]);
else
{
fprintf(stderr,"Error input params \n");
fprintf(stderr,"Syntax : %s i_master cmtfile i_wpinversion o_direct [stftype]\n", argv[0]);
fprintf(stderr,"stftype (optionnal) can be either:\n g (gaussian),\n q (parabolic),\n l (triangle,\n default),\n b(boxcar) or\n c (cosine)\n");
exit(1);
}
}
/* Allocates memory */
eq.vm = double_alloc2p(2) ;
eq.vm[0] = double_calloc(6) ;
eq.vm[1] = double_calloc(6) ;
GFs = double_alloc2(10,__LEN_SIG__) ;/* GFs: Rrr, Rtt, Rpp, Rrt */
S = double_alloc(__LEN_SIG__) ;/* Vertical components */
TH = double_alloc(__LEN_SIG__) ;/* Radial components */
PH = double_alloc(__LEN_SIG__) ;/* Transverse components */
x_conv = double_alloc(__LEN_SIG__) ;
hdr_init(&hd_data) ;
hdr_init(&hd_synt) ;
nsects = (eq.flow > 0.)? eq.filtorder : eq.filtorder/2 ;
b1 = double_alloc(nsects) ;
b2 = double_alloc(nsects) ;
a1 = double_alloc(nsects) ;
a2 = double_alloc(nsects) ;
tv = double_alloc(nd); /* travel times */
dv = double_alloc(nd); /* distances */
/* Read CMTFILE */
get_cmtf(&eq,2) ;
/* Set travel time table for depth = dep */
ierror = 1 ;
trav_time_init(nh,nd,eq.evdp,dv,tv,&ierror) ;
/* Read list of data files */
flag = 0 ;
i_wp = openfile_rt(i_wpfilname, &ns);
for(i=0; i<ns; i++)
{
flagr = fscanf (i_wp, "%s", datafile) ;
fgets(buf,200,i_wp); /* end of line */
check_scan(1, flagr, i_wpfilname, i_wp) ;
rhdrsac(datafile, &hd_data, &ierror) ;
/* Calculate azimuths, back-azimuths */
dist = 0. ;
az = 0. ;
baz = 0. ;
xdeg = 0. ;
distaz(eq.evla,eq.evlo,&hd_data.stla,&hd_data.stlo,1,&dist,&az,&baz,&xdeg,&nerr) ;
ori = hd_data.kcmpnm[2];
if ( ori == 'Z' )
fast_synth_only_Z_sub(az,baz,xdeg, tv,dv,nd,&eq,&hd_synt,GFs,S);
else if ( ori == 'N' || ori == 'E' || ori == '1' || ori == '2' )
{
fast_synth_only_Hs_sub(az,baz,xdeg,tv,dv,nd,&eq,&hd_synt,GFs,TH,PH);
rotate_traces(TH, PH, baz-hd_data.cmpaz,hd_synt.npts, S) ; /*Rotating TH, PH to H*/
}
else
continue;
sscanf(hd_data.kstnm,"%s",stnm);
sscanf(hd_data.knetwk,"%s",netwk);
sscanf(hd_data.kcmpnm,"%s",cmpnm);
strcpy(khole, hd_data.khole); // It can contain blanks
for(j=0; j<5; j++)
{
if (cmpnm[2] == stacmp[j])
break;
}
if (j==5)
{
fprintf(stderr,"*** ERROR: Unknownk component %s for sta %s\n",cmpnm,stnm) ;
fprintf(stderr," -> Exiting\n") ;
fflush(stderr);
exit(1);
}
conv_by_stf(eq.ts,eq.hd,itype,&hd_synt,S,x_conv) ;/* Perform convolution */
strcpy(hd_synt.kstnm,hd_data.kstnm) ;
strcpy(hd_synt.kcmpnm,hd_data.kcmpnm) ;
strcpy(hd_synt.knetwk,hd_data.knetwk) ;
hd_synt.stla = hd_data.stla ;
hd_synt.stlo = hd_data.stlo ;
hd_synt.evla = eq.pde_evla;
hd_synt.evlo = eq.pde_evlo;
hd_synt.evdp = eq.pde_evdp;
/* Write output file 1 */
o_file = get_gf_filename(o_dir,stnm,netwk,cmpnm,khole,".complete_synth.sac") ;
wsac(o_file,&hd_synt,x_conv);
free((void*)o_file) ;
if (flag == 0) /* Set the butterworth sos (dt must be the same for all stations) */
{
flag = 1 ;
dt = (double)hd_data.delta;
if (eq.flow>0.)
bpbu2sos(eq.flow,eq.fhigh,dt,eq.filtorder,&gain,b1,b2,a1,a2);
else
lpbu2sos(eq.fhigh,dt,eq.filtorder,&gain,b1,b2,a1,a2);
}
else if ((int)(dt*1000+0.5) != (int)((double)hd_data.delta*1000+0.5))
{
fprintf(stderr, "ERROR: non uniform samp. period between sac files, file : %s\n",datafile);
exit(1);
}
filter_with_sos(gain,b1,b2,a1,a2,nsects,x_conv,hd_synt.npts) ; /* Apply sos */
/* Write output file 2 */
o_file = get_gf_filename(o_dir,stnm,netwk,cmpnm,khole,".complete_synth.bp.sac") ;
printf("Writing sac file : %s\n",o_file) ;
wsac(o_file,&hd_synt,x_conv);
free((void*)o_file) ;
}
fclose(i_wp);
free((void*)S);
free((void*)TH);
free((void*)PH);
for(j=0; j<10; j++)
free((void*)GFs[j]);
free((void**)GFs);
free((void*)x_conv);
free((void*)b1);
free((void*)b2);
free((void*)a1);
free((void*)a2);
return 0;
}
int main(int argc, char **argv)
{
// OP initialisation
op_init(argc,argv,2);
//MPI for user I/O
int my_rank;
int comm_size;
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
MPI_Comm_size(MPI_COMM_WORLD, &comm_size);
int *becell, *ecell, *bound, *bedge, *edge, *cell;
float *x, *q, *qold, *adt, *res;
int nnode,ncell,nedge,nbedge;
/**------------------------BEGIN I/O -------------------**/
char file[] = "new_grid.dat";
char file_out[] = "new_grid_out.h5";
/* read in grid from disk on root processor */
FILE *fp;
if ( (fp = fopen(file,"r")) == NULL) {
op_printf("can't open file %s\n",file); exit(-1);
}
int g_nnode,g_ncell,g_nedge,g_nbedge;
check_scan(fscanf(fp,"%d %d %d %d \n",&g_nnode, &g_ncell, &g_nedge, &g_nbedge), 4);
int *g_becell = 0, *g_ecell = 0, *g_bound = 0, *g_bedge = 0, *g_edge = 0, *g_cell = 0;
float *g_x = 0,*g_q = 0, *g_qold = 0, *g_adt = 0, *g_res = 0;
// set constants
op_printf("initialising flow field\n");
gam = 1.4f;
gm1 = gam - 1.0f;
cfl = 0.9f;
eps = 0.05f;
float mach = 0.4f;
float alpha = 3.0f*atan(1.0f)/45.0f;
float p = 1.0f;
float r = 1.0f;
float u = sqrt(gam*p/r)*mach;
float e = p/(r*gm1) + 0.5f*u*u;
qinf[0] = r;
qinf[1] = r*u;
qinf[2] = 0.0f;
qinf[3] = r*e;
op_printf("reading in grid \n");
op_printf("Global number of nodes, cells, edges, bedges = %d, %d, %d, %d\n"
,g_nnode,g_ncell,g_nedge,g_nbedge);
if(my_rank == MPI_ROOT) {
g_cell = (int *) malloc(4*g_ncell*sizeof(int));
g_edge = (int *) malloc(2*g_nedge*sizeof(int));
g_ecell = (int *) malloc(2*g_nedge*sizeof(int));
g_bedge = (int *) malloc(2*g_nbedge*sizeof(int));
g_becell = (int *) malloc( g_nbedge*sizeof(int));
g_bound = (int *) malloc( g_nbedge*sizeof(int));
g_x = (float *) malloc(2*g_nnode*sizeof(float));
g_q = (float *) malloc(4*g_ncell*sizeof(float));
g_qold = (float *) malloc(4*g_ncell*sizeof(float));
g_res = (float *) malloc(4*g_ncell*sizeof(float));
g_adt = (float *) malloc( g_ncell*sizeof(float));
for (int n=0; n<g_nnode; n++){
check_scan(fscanf(fp,"%f %f \n",&g_x[2*n], &g_x[2*n+1]), 2);
}
for (int n=0; n<g_ncell; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_cell[4*n ], &g_cell[4*n+1],
&g_cell[4*n+2], &g_cell[4*n+3]), 4);
}
for (int n=0; n<g_nedge; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_edge[2*n],&g_edge[2*n+1],
&g_ecell[2*n],&g_ecell[2*n+1]), 4);
}
for (int n=0; n<g_nbedge; n++) {
check_scan(fscanf(fp,"%d %d %d %d \n",&g_bedge[2*n],&g_bedge[2*n+1],
&g_becell[n],&g_bound[n]), 4);
}
//initialise flow field and residual
for (int n=0; n<g_ncell; n++) {
for (int m=0; m<4; m++) {
g_q[4*n+m] = qinf[m];
g_res[4*n+m] = 0.0f;
}
}
}
fclose(fp);
nnode = compute_local_size (g_nnode, comm_size, my_rank);
ncell = compute_local_size (g_ncell, comm_size, my_rank);
nedge = compute_local_size (g_nedge, comm_size, my_rank);
nbedge = compute_local_size (g_nbedge, comm_size, my_rank);
op_printf("Number of nodes, cells, edges, bedges on process %d = %d, %d, %d, %d\n"
,my_rank,nnode,ncell,nedge,nbedge);
/*Allocate memory to hold local sets, mapping tables and data*/
cell = (int *) malloc(4*ncell*sizeof(int));
edge = (int *) malloc(2*nedge*sizeof(int));
ecell = (int *) malloc(2*nedge*sizeof(int));
bedge = (int *) malloc(2*nbedge*sizeof(int));
becell = (int *) malloc( nbedge*sizeof(int));
bound = (int *) malloc( nbedge*sizeof(int));
x = (float *) malloc(2*nnode*sizeof(float));
q = (float *) malloc(4*ncell*sizeof(float));
qold = (float *) malloc(4*ncell*sizeof(float));
res = (float *) malloc(4*ncell*sizeof(float));
adt = (float *) malloc( ncell*sizeof(float));
/* scatter sets, mappings and data on sets*/
scatter_int_array(g_cell, cell, comm_size, g_ncell,ncell, 4);
scatter_int_array(g_edge, edge, comm_size, g_nedge,nedge, 2);
scatter_int_array(g_ecell, ecell, comm_size, g_nedge,nedge, 2);
scatter_int_array(g_bedge, bedge, comm_size, g_nbedge,nbedge, 2);
scatter_int_array(g_becell, becell, comm_size, g_nbedge,nbedge, 1);
scatter_int_array(g_bound, bound, comm_size, g_nbedge,nbedge, 1);
scatter_float_array(g_x, x, comm_size, g_nnode,nnode, 2);
scatter_float_array(g_q, q, comm_size, g_ncell,ncell, 4);
scatter_float_array(g_qold, qold, comm_size, g_ncell,ncell, 4);
scatter_float_array(g_res, res, comm_size, g_ncell,ncell, 4);
scatter_float_array(g_adt, adt, comm_size, g_ncell,ncell, 1);
/*Freeing memory allocated to gloabal arrays on rank 0
after scattering to all processes*/
if(my_rank == MPI_ROOT) {
free(g_cell);
free(g_edge);
free(g_ecell);
free(g_bedge);
free(g_becell);
free(g_bound);
free(g_x );
free(g_q);
free(g_qold);
free(g_adt);
free(g_res);
}
/**------------------------END I/O -----------------------**/
/* FIXME: It's not clear to the compiler that sth. is going on behind the
scenes here. Hence theses variables are reported as unused */
op_set nodes = op_decl_set(nnode, "nodes");
op_set edges = op_decl_set(nedge, "edges");
op_set bedges = op_decl_set(nbedge, "bedges");
op_set cells = op_decl_set(ncell, "cells");
op_map pedge = op_decl_map(edges, nodes,2,edge, "pedge");
op_map pecell = op_decl_map(edges, cells,2,ecell, "pecell");
op_map pbedge = op_decl_map(bedges,nodes,2,bedge, "pbedge");
op_map pbecell = op_decl_map(bedges,cells,1,becell,"pbecell");
op_map pcell = op_decl_map(cells, nodes,4,cell, "pcell");
op_dat p_bound = op_decl_dat(bedges,1,"int" ,bound,"p_bound");
op_dat p_x = op_decl_dat(nodes ,2,"float",x ,"p_x");
op_dat p_q = op_decl_dat(cells ,4,"float",q ,"p_q");
op_dat p_qold = op_decl_dat(cells ,4,"float",qold ,"p_qold");
op_dat p_adt = op_decl_dat(cells ,1,"float",adt ,"p_adt");
op_dat p_res = op_decl_dat(cells ,4,"float",res ,"p_res");
op_decl_const(1,"float",&gam );
op_decl_const(1,"float",&gm1 );
op_decl_const(1,"float",&cfl );
op_decl_const(1,"float",&eps );
op_decl_const(1,"float",&mach );
op_decl_const(1,"float",&alpha);
op_decl_const(4,"float",qinf );
op_dump_to_hdf5(file_out);
op_write_const_hdf5("gam", 1,"float",(char *)&gam, "new_grid_out.h5");
op_write_const_hdf5("gm1", 1,"float",(char *)&gm1, "new_grid_out.h5");
op_write_const_hdf5("cfl", 1,"float",(char *)&cfl, "new_grid_out.h5");
op_write_const_hdf5("eps", 1,"float",(char *)&eps, "new_grid_out.h5");
op_write_const_hdf5("mach", 1,"float",(char *)&mach, "new_grid_out.h5");
op_write_const_hdf5("alpha",1,"float",(char *)&alpha,"new_grid_out.h5");
op_write_const_hdf5("qinf", 4,"float",(char *)qinf, "new_grid_out.h5");
//create halos - for sanity check
op_halo_create();
op_exit();
}
