1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/***************************************************************************
gh.hh - Grid Hierarchy
bounding boxes for each multigrid level of each
component of each refinement level
-------------------
begin : Sun Jun 11 2000
copyright : (C) 2000 by Erik Schnetter
email : schnetter@astro.psu.edu
$Header: /home/eschnett/C/carpet/Carpet/Carpet/CarpetLib/src/gh.hh,v 1.8 2001/12/14 16:39:43 schnetter Exp $
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#ifndef GH_HH
#define GH_HH
#include <assert.h>
#include <iostream>
#include <list>
#include <vector>
#include "bbox.hh"
#include "defs.hh"
#include "dggh.hh"
#include "dist.hh"
#include "vect.hh"
using namespace std;
// Forward declaration
template<int D> class dh;
template<int D> class gh;
// A refinement hierarchy, where higher levels are finer than the base
// level. The extents do not include ghost zones.
template<int D>
class gh: public dimgeneric_gh {
public:
// Types
typedef vect<int,D> ivect;
typedef bbox<int,D> ibbox;
typedef vector<ibbox> mexts; // ... for each multigrid level
typedef vector<mexts> cexts; // ... for each component
typedef vector<cexts> rexts; // ... for each refinement level
typedef vector<int> cprocs; // ... for each component
typedef vector<cprocs> rprocs; // ... for each refinement level
public: // should be readonly
ibbox baseextent; // bounds (inclusive) of base level
vector<vector<ibbox> > bases; // [rl][ml]
rexts extents; // bounds of all grids
rprocs processors; // processor numbers of all grids
list<dh<D>*> dhs; // list of all data hierarchies
public:
// Constructors
gh (const int reffact, const centering refcent,
const int mgfact, const centering mgcent,
const ibbox& baseextent);
// Destructors
virtual ~gh ();
// Modifiers
void recompose (const rexts& exts, const rprocs& procs);
// Helpers
cexts make_reflevel_multigrid_boxes (const vector<ibbox>& exts,
const int mglevels)
const;
rexts make_multigrid_boxes (const vector<vector<ibbox> >& exts,
const int mglevels)
const;
// Accessors
int reflevels () const {
return (int)extents.size();
}
int components (const int rl) const {
assert (rl>=0 && rl<reflevels());
return (int)extents[rl].size();
}
int mglevels (const int rl, const int c) const {
assert (rl>=0 && rl<reflevels());
assert (c>=0 && c<components(rl));
return (int)extents[rl][c].size();
}
int proc (const int rl, const int c) const {
assert (rl>=0 && rl<reflevels());
assert (c>=0 && c<components(rl));
return processors[rl][c];
}
bool is_local (const int rl, const int c) const {
int rank;
MPI_Comm_rank (dist::comm, &rank);
return proc(rl,c) == rank;
}
// Data hierarchy management
void add (dh<D>* d);
void remove (dh<D>* d);
// Output
virtual ostream& output (ostream& os) const;
};
#if defined(TMPL_IMPLICIT)
# include "gh.cc"
#endif
#endif // GH_HH
|
