src/expde/grid/brick.cc

Go to the documentation of this file.

//    expde: expression templates for partial differential equations.
//    Copyright (C) 2001  Christoph Pflaum
//    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.
//
//                 SEE  Notice1.doc made by 
//                 LAWRENCE LIVERMORE NATIONAL LABORATORY
//

// ------------------------------------------------------------
//
// brick.cc
//
// ------------------------------------------------------------


//
// construction for Andreas Adelmann
// construct set of processors 
//



// Include level 0:
#ifdef COMP_GNUOLD
 #include <iostream.h>
 #include <fstream.h>
 #include <math.h>
 #include <time.h>
#else
 #include <iostream>
 #include <fstream>
 #include <cmath>
 #include <ctime>
#endif           

#ifdef WITH_BRICK

// Include level 0:
#include "../parser.h"

// Include level 1:
#include "../paramete.h"
#include "../abbrevi.h"
#include "../math_lib/math_lib.h"
 
// Include level 2:
#include "../basic/basic.h"

// Include level 3:
#include "../domain/domain.h"

// Include level 4:
#include "../formulas/boundy.h"
#include "../formulas/loc_sten.h"

// for Andreas Adelmann
#include "brick.h"

// Include level 5:
#include "gpar.h"
#include "parallel.h"
#include "mgcoeff.h"
#include "sto_man.h"
#include "gridbase.h"
#include "grid.h"


BrickInfo *Grid_base::getBrickInfo() {
  
  D3vector v_WSD;
  D3vector v_ENT;

  BrickInfo *brick_info;
  BInfoT     brick;
  int result_len;
  int ierror; 

  // 1. new brick
  brick_info = new BrickInfo();
  // 2. set cells in brick
  iterate_hash_proc {
    if(point_proc!=NULL) {
      if(point_proc->Give_Index().Tiefe()==n_parallel) {
        v_WSD = transform_coord(
                point_proc->Give_Index().neighbour(WSDd).coordinate());
        v_ENT = transform_coord(
                point_proc->Give_Index().neighbour(ENTd).coordinate());
          
        brick.localXMin[0]  = v_WSD.x - finest_meshsize * 0.5;
        brick.localXMin[1]  = v_WSD.y - finest_meshsize * 0.5;
        brick.localXMin[2]  = v_WSD.z - finest_meshsize * 0.5;
        
        brick.localXMax[0]  = v_ENT.x - finest_meshsize * 0.5;
        brick.localXMax[1]  = v_ENT.y - finest_meshsize * 0.5;
        brick.localXMax[2]  = v_ENT.z - finest_meshsize * 0.5;
        
        brick.eps           = finest_meshsize * 0.001;
        brick.rank = point_proc->Give_num_proc();
        brick_info->add(brick);
      }
    }
  }
  return brick_info;
}
#endif

---