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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
|
#include <cassert>
#include <cstdlib>
#include <iostream>
#include "cctk.h"
#include "cctk_Parameters.h"
#include "defs.hh"
#include "dh.hh"
#include "th.hh"
#include "gh.hh"
using namespace std;
// Constructors
gh::gh (const int reffact_, const centering refcent_,
const int mgfact_, const centering mgcent_,
const ibbox baseextent_)
: reffact(reffact_), refcent(refcent_),
mgfact(mgfact_), mgcent(mgcent_),
baseextent(baseextent_)
{
}
// Destructors
gh::~gh () { }
// Modifiers
void gh::recompose (const mexts& exts,
const rbnds& outer_bounds,
const rprocs& procs,
const bool do_prolongate)
{
DECLARE_CCTK_PARAMETERS;
_extents = exts;
_outer_boundaries = outer_bounds;
_processors = procs;
// Consistency checks
// nota bene: there might be 0 refinement levels.
check_processor_number_consistency ();
check_multigrid_consistency ();
check_component_consistency ();
check_base_grid_extent ();
check_refinement_levels ();
calculate_base_extents_of_all_levels ();
if (output_bboxes) {
do_output_bboxes (cout);
do_output_bases (cout);
}
// Recompose the other hierarchies
for (list<th*>::iterator t=ths.begin(); t!=ths.end(); ++t) {
(*t)->recompose();
}
for (list<dh*>::iterator d=dhs.begin(); d!=dhs.end(); ++d) {
(*d)->recompose (do_prolongate);
}
}
void gh::check_processor_number_consistency ()
{
for (int rl=0; rl<reflevels(); ++rl) {
assert (processors().size() == extents().at(0).size());
assert (outer_boundaries().size() == extents().at(0).size());
for (int c=0; c<components(rl); ++c) {
assert (processors().at(rl).size() == extents().at(0).at(rl).size());
assert (outer_boundaries().at(rl).size() == extents().at(0).at(rl).size());
}
}
}
void gh::check_multigrid_consistency ()
{
assert (mglevels()>0);
for (int ml=1; ml<mglevels(); ++ml) {
for (int rl=0; rl<reflevels(); ++rl) {
for (int c=0; c<components(rl); ++c) {
assert (all(extents().at(ml).at(rl).at(c).stride()
== ivect(mgfact) * extents().at(ml-1).at(rl).at(c).stride()));
// TODO: put the check back in, taking outer boundaries into
// account
#if 0
assert (extents().at(ml).at(rl).at(c)
.contracted_for(extents().at(ml-1).at(rl).at(c))
.is_contained_in(extents().at(ml-1).at(rl).at(c)));
#endif
}
}
}
}
void gh::check_component_consistency ()
{
for (int ml=0; ml<mglevels(); ++ml) {
for (int rl=0; rl<reflevels(); ++rl) {
assert (components(rl)>0);
for (int c=0; c<components(rl); ++c) {
const ibbox &b = extents().at(ml).at(rl).at(c);
const ibbox &b0 = extents().at(ml).at(rl).at(0);
assert (all(b.stride() == b0.stride()));
assert (b.is_aligned_with(b0));
for (int cc=c+1; cc<components(rl); ++cc) {
assert ((b & extents().at(ml).at(rl).at(cc)).empty());
}
}
}
}
}
void gh::check_base_grid_extent ()
{
if (reflevels()>0) {
for (int c=0; c<components(0); ++c) {
// TODO: put the check back in, taking outer boundaries into
// account
#if 0
assert (extents().at(0).at(c).at(0).is_contained_in(baseextent));
#endif
}
}
}
void gh::check_refinement_levels ()
{
for (int ml=0; ml<mglevels(); ++ml) {
for (int rl=1; rl<reflevels(); ++rl) {
assert (all(extents().at(ml).at(rl-1).at(0).stride()
== ivect(reffact) * extents().at(ml).at(rl).at(0).stride()));
// Check contained-ness:
// first take all coarse grids ...
ibset all;
for (int c=0; c<components(rl-1); ++c) {
all |= extents().at(ml).at(rl-1).at(c);
}
// ... remember their size ...
const int sz = all.size();
// ... then add the coarsified fine grids ...
for (int c=0; c<components(rl); ++c) {
all |= extents().at(ml).at(rl).at(c).contracted_for(extents().at(ml).at(rl-1).at(0));
}
// ... and then check the sizes:
assert (all.size() == sz);
}
}
}
void gh::calculate_base_extents_of_all_levels ()
{
_bases.resize(mglevels());
for (int ml=0; ml<mglevels(); ++ml) {
_bases.at(ml).resize(reflevels());
for (int rl=0; rl<reflevels(); ++rl) {
_bases.at(ml).at(rl) = ibbox();
ibbox &bb = _bases.at(ml).at(rl);
for (int c=0; c<components(rl); ++c) {
bb = bb.expanded_containing(extents().at(ml).at(rl).at(c));
}
}
}
}
// Accessors
int gh::local_components (const int rl) const
{
int lc = 0;
for (int c=0; c<components(rl); ++c) {
if (is_local(rl,c)) ++lc;
}
return lc;
}
// Time hierarchy management
void gh::add (th* t)
{
ths.push_back(t);
}
void gh::remove (th* t)
{
ths.remove(t);
}
// Data hierarchy management
void gh::add (dh* d)
{
dhs.push_back(d);
}
void gh::remove (dh* d)
{
dhs.remove(d);
}
void gh::do_output_bboxes (ostream& os) const
{
for (int ml=0; ml<mglevels(); ++ml) {
for (int rl=0; rl<reflevels(); ++rl) {
for (int c=0; c<components(rl); ++c) {
os << endl;
os << "gh bboxes:" << endl;
os << "ml=" << ml << " rl=" << rl << " c=" << c << endl;
os << "extent=" << extents().at(ml).at(rl).at(c) << endl;
os << "outer_boundary=" << outer_boundaries().at(rl).at(c) << endl;
os << "processor=" << processors().at(rl).at(c) << endl;
}
}
}
}
void gh::do_output_bases (ostream& os) const
{
for (int ml=0; ml<mglevels(); ++ml) {
for (int rl=0; rl<reflevels(); ++rl) {
if (components(rl)>0) {
os << endl;
os << "gh bases:" << endl;
os << "ml=" << ml << " rl=" << rl << endl;
os << "base=" << bases().at(ml).at(rl) << endl;
}
}
}
}
ostream& gh::output (ostream& os) const
{
os << "gh:"
<< "reffactor=" << reffact << ",refcentering=" << refcent << ","
<< "mgfactor=" << mgfact << ",mgcentering=" << mgcent << ","
<< "extents=" << extents() << ","
<< "outer_boundaries=" << outer_boundaries() << ","
<< "processors=" << processors() << ","
<< "dhs={";
const char * sep = "";
for (list<dh*>::const_iterator d = dhs.begin();
d != dhs.end(); ++d)
{
os << sep;
(*d)->output(os);
sep = ",";
}
os << "}";
return os;
}
|
