Commit 4f70835e authored by Matthieu Schaller's avatar Matthieu Schaller
Browse files

Also communicate the maximal end of time-step

parent 65db26f9
......@@ -296,7 +296,9 @@ int cell_pack_end_step(struct cell *restrict c,
/* Pack this cell's data. */
pcells[0].ti_hydro_end_min = c->ti_hydro_end_min;
pcells[0].ti_hydro_end_max = c->ti_hydro_end_max;
pcells[0].ti_gravity_end_min = c->ti_gravity_end_min;
pcells[0].ti_gravity_end_max = c->ti_gravity_end_max;
pcells[0].dx_max_part = c->dx_max_part;
pcells[0].dx_max_gpart = c->dx_max_gpart;
......@@ -331,7 +333,9 @@ int cell_unpack_end_step(struct cell *restrict c,
/* Unpack this cell's data. */
c->ti_hydro_end_min = pcells[0].ti_hydro_end_min;
c->ti_hydro_end_max = pcells[0].ti_hydro_end_max;
c->ti_gravity_end_min = pcells[0].ti_gravity_end_min;
c->ti_gravity_end_max = pcells[0].ti_gravity_end_max;
c->dx_max_part = pcells[0].dx_max_part;
c->dx_max_gpart = pcells[0].dx_max_gpart;
......
......@@ -137,9 +137,15 @@ struct pcell_step {
/*! Minimal integer end-of-timestep in this cell (hydro) */
integertime_t ti_hydro_end_min;
/*! Minimal integer end-of-timestep in this cell (hydro) */
integertime_t ti_hydro_end_max;
/*! Minimal integer end-of-timestep in this cell (gravity) */
integertime_t ti_gravity_end_min;
/*! Minimal integer end-of-timestep in this cell (gravity) */
integertime_t ti_gravity_end_max;
/*! Maximal distance any #part has travelled since last rebuild */
float dx_max_part;
......
......@@ -3490,15 +3490,15 @@ void engine_print_task_counts(struct engine *e) {
if (tasks[k].type == task_type_send &&
tasks[k].subtype == task_subtype_rho) {
count_send_rho++;
message("Send_rho: nodeID_i=%d cellID_i=%ld nodeID_j=%d cellID_j=%ld",
tasks[k].ci->nodeID, tasks[k].ci - e->s->cells_top,
tasks[k].cj->nodeID, tasks[k].cj - e->s->cells_top);
/* message("Send_rho: nodeID_i=%d cellID_i=%ld nodeID_j=%d cellID_j=%ld", */
/* tasks[k].ci->nodeID, tasks[k].ci - e->s->cells_top, */
/* tasks[k].cj->nodeID, tasks[k].cj - e->s->cells_top); */
}
if (tasks[k].type == task_type_recv &&
tasks[k].subtype == task_subtype_rho) {
count_recv_rho++;
message("recv_rho: nodeID_i=%d cellID_i=%ld nodeID_j=n/a cellID_j=n/a",
tasks[k].ci->nodeID, tasks[k].ci - e->s->cells_top);
/* message("recv_rho: nodeID_i=%d cellID_i=%ld nodeID_j=n/a cellID_j=n/a", */
/* tasks[k].ci->nodeID, tasks[k].ci - e->s->cells_top); */
}
}
}
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment