do reduction to find level extend in LEVEL mode

this is to avoid cuasing an MPI lockup if there are different numbers of
components per level


git-svn-id: http://svn.cactuscode.org/arrangements/CactusNumerical/RotatingSymmetry180/trunk@77 20f44201-0f4f-0410-9130-e5fc2714a787

1 files changed, 72 insertions, 41 deletions

diff --git a/src/rotatingsymmetry180.c b/src/rotatingsymmetry180.c
index ce5d085..8524e4b 100644
--- a/src/rotatingsymmetry180.c
+++ b/src/rotatingsymmetry180.c
@@ -14,6 +14,10 @@
 #include <stdlib.h>
 #include <string.h>
 
+/* bbox, lbnd and ubnd of combined level box */
+static int global_bbox[6];
+static int global_lbnd[3], global_ubnd[3];
+static int extent_valid_for_iteration = -1;
 
 
 int BndRot180VI (cGH const * restrict const cctkGH,
@@ -32,8 +36,6 @@ int BndRot180VI (cGH const * restrict const cctkGH,
   
   int (* restrict paritiess)[3];
   
-  int global_bbox[6];
-  int global_lbnd[3], global_ubnd[3];
   int fake_bbox[6];
   
   CCTK_REAL x0[3], dx[3];
@@ -61,7 +63,7 @@ int BndRot180VI (cGH const * restrict const cctkGH,
   for (var=0; var<nvars; ++var) {
     assert (vis[var]>=0 && vis[var]<CCTK_NumVars());
   }
-  
+
   if (verbose) {
     for (var=0; var<nvars; ++var) {
       fullname = CCTK_FullName(vis[var]);
@@ -266,44 +268,8 @@ int BndRot180VI (cGH const * restrict const cctkGH,
   } /* for var */
   
   {
-#if 0
-    int min_handle, max_handle;
-    CCTK_REAL local[6], global[6];
-    min_handle = CCTK_ReductionArrayHandle ("minimum");
-    if (min_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
-    max_handle = CCTK_ReductionArrayHandle ("maximum");
-    if (max_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
-    
-    for (d=0; d<6; ++d) local[d] = cctkGH->cctk_bbox[d];
-    ierr = CCTK_ReduceLocArrayToArray1D
-      (cctkGH, -1, max_handle, local, global, 6, CCTK_VARIABLE_REAL);
-    for (d=0; d<6; ++d) global_bbox[d] = (int)global[d];
-    
-    for (d=0; d<3; ++d) local[d] = cctkGH->cctk_lbnd[d];
-    ierr = CCTK_ReduceLocArrayToArray1D
-      (cctkGH, -1, min_handle, local, global, 3, CCTK_VARIABLE_REAL);
-    for (d=0; d<3; ++d) global_lbnd[d] = (int)global[d];
-    
-    for (d=0; d<3; ++d) local[d] = cctkGH->cctk_ubnd[d];
-    ierr = CCTK_ReduceLocArrayToArray1D
-      (cctkGH, -1, max_handle, local, global, 3, CCTK_VARIABLE_REAL);
-    for (d=0; d<3; ++d) global_ubnd[d] = (int)global[d];
-#else
-    int max_handle;
-    CCTK_INT local[12], global[12];
-    max_handle = CCTK_ReductionArrayHandle ("maximum");
-    if (max_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
-    
-    for (d=0; d<6; ++d) local[  d] =  cctkGH->cctk_bbox[d];
-    for (d=0; d<3; ++d) local[6+d] = -cctkGH->cctk_lbnd[d];
-    for (d=0; d<3; ++d) local[9+d] =  cctkGH->cctk_ubnd[d];
-    ierr = CCTK_ReduceLocArrayToArray1D
-      (cctkGH, -1, max_handle, local, global, 12, CCTK_VARIABLE_INT);
-    for (d=0; d<6; ++d) global_bbox[d] =  global[  d];
-    for (d=0; d<3; ++d) global_lbnd[d] = -global[6+d];
-    for (d=0; d<3; ++d) global_ubnd[d] =  global[9+d];
-#endif
-    
+    assert(extent_valid_for_iteration == cctk_iteration);
+  
     for (d=0; d<3; ++d) {
       fake_bbox[2*d  ] = data.lbnd[d] == global_lbnd[d];
       fake_bbox[2*d+1] = data.ubnd[d] == global_ubnd[d];
@@ -731,6 +697,71 @@ int BndRot180VI (cGH const * restrict const cctkGH,
 
 
 
+void Rot180_ComputeLevelExtent (CCTK_ARGUMENTS)
+{
+  DECLARE_CCTK_ARGUMENTS;
+  
+  int nvars;
+
+  assert (cctkGH);
+  
+  nvars = Boundary_SelectedGVs (cctkGH, 0, 0, 0, 0, 0, 0);
+  assert (nvars>=0);
+  
+  if (nvars==0) return;
+  
+  {
+#if 0
+    int min_handle, max_handle;
+    int d;                        /* 0..group.dim-1 */
+    int ierr;
+    CCTK_REAL local[6], global[6];
+    min_handle = CCTK_ReductionArrayHandle ("minimum");
+    if (min_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
+    max_handle = CCTK_ReductionArrayHandle ("maximum");
+    if (max_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
+    
+    for (d=0; d<6; ++d) local[d] = cctkGH->cctk_bbox[d];
+    ierr = CCTK_ReduceLocArrayToArray1D
+      (cctkGH, -1, max_handle, local, global, 6, CCTK_VARIABLE_REAL);
+    for (d=0; d<6; ++d) global_bbox[d] = (int)global[d];
+    
+    for (d=0; d<3; ++d) local[d] = cctkGH->cctk_lbnd[d];
+    ierr = CCTK_ReduceLocArrayToArray1D
+      (cctkGH, -1, min_handle, local, global, 3, CCTK_VARIABLE_REAL);
+    for (d=0; d<3; ++d) global_lbnd[d] = (int)global[d];
+    
+    for (d=0; d<3; ++d) local[d] = cctkGH->cctk_ubnd[d];
+    ierr = CCTK_ReduceLocArrayToArray1D
+      (cctkGH, -1, max_handle, local, global, 3, CCTK_VARIABLE_REAL);
+    for (d=0; d<3; ++d) global_ubnd[d] = (int)global[d];
+#else
+    int max_handle;
+    int d;                        /* 0..group.dim-1 */
+    int ierr;
+    CCTK_INT local[12], global[12];
+    max_handle = CCTK_ReductionArrayHandle ("maximum");
+    if (max_handle<0) CCTK_WARN (0, "Could not obtain reduction handle");
+    
+    for (d=0; d<6; ++d) local[  d] =  cctkGH->cctk_bbox[d];
+    for (d=0; d<3; ++d) local[6+d] = -cctkGH->cctk_lbnd[d];
+    for (d=0; d<3; ++d) local[9+d] =  cctkGH->cctk_ubnd[d];
+    ierr = CCTK_ReduceLocArrayToArray1D
+      (cctkGH, -1, max_handle, local, global, 12, CCTK_VARIABLE_INT);
+    assert(!ierr);
+    for (d=0; d<6; ++d) global_bbox[d] =  global[  d];
+    for (d=0; d<3; ++d) global_lbnd[d] = -global[6+d];
+    for (d=0; d<3; ++d) global_ubnd[d] =  global[9+d];
+
+    /* record when we ran to have some sanity check against using old data in
+     * global variables */
+    extent_valid_for_iteration = cctk_iteration;
+#endif
+  }
+}
+
+
+
 void Rot180_ApplyBC (CCTK_ARGUMENTS)
 {
   DECLARE_CCTK_ARGUMENTS;