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
|
#ifndef DH_HH
#define DH_HH
#include <cassert>
#include <iostream>
#include <list>
#include <string>
#include <vector>
#include "bbox.hh"
#include "bboxset.hh"
#include "defs.hh"
#include "gh.hh"
#include "vect.hh"
using namespace std;
// A pseudoregion is almost a region; it is a bbox that lives on a
// certain processor. Pseudoregions are a compact way to store
// information about what processors needs to send data to what other
// processor during synchronisation or regridding.
struct pseudoregion {
ibbox extent;
int processor;
};
// Forward declaration
class ggf;
class dh;
// Output
ostream& operator<< (ostream& os, const dh& d);
// A data hierarchy (grid hierarchy plus ghost zones)
class dh {
// Types
public:
typedef list<ibbox> iblist;
typedef vector<iblist> iblistvect; // vector of lists
typedef vector <pseudoregion> pvect;
// in here, the term "boundary" means both ghost zones and
// refinement boundaries, but does not refer to outer (physical)
// boundaries.
// ghost zones and outer boundaries are not used as sources for
// synchronisation. refinement boundaries are used. this design
// choice might not be good.
struct dboxes {
ibbox exterior; // whole region (including boundaries)
bbvect is_interproc; // the whole boundary is an
// interprocessor boundary
ibbox interior; // interior (without boundaries)
ibset owned; // can be used for synchronisation
iblist send_mg_fine;
iblist send_mg_coarse;
iblist recv_mg_fine;
iblist recv_mg_coarse;
iblistvect send_ref_fine;
iblistvect send_ref_coarse;
iblistvect recv_ref_fine;
pvect recv_ref_fine_fast;
iblistvect recv_ref_coarse;
pvect recv_ref_coarse_fast;
iblistvect send_sync; // send while syncing
iblistvect send_ref_bnd_fine; // sent to finer grids
ibset boundaries; // boundaries
iblistvect recv_sync; // received while syncing
pvect recv_sync_fast;
iblistvect recv_ref_bnd_coarse; // received from coarser grids
pvect recv_ref_bnd_coarse_fast;
ibset sync_not; // not received while syncing (outer
// boundary of that level)
ibset recv_not; // not received while syncing or
// prolongating (globally outer
// boundary)
};
private:
struct dbases {
ibbox exterior; // whole region (including boundaries)
ibbox interior; // interior (without boundaries)
ibset boundaries; // boundaries
};
typedef vector<dboxes> cboxes; // ... for each component
typedef vector<cboxes> rboxes; // ... for each refinement level
typedef vector<rboxes> mboxes; // ... for each multigrid level
typedef vector<dbases> rbases; // ... for each refinement level
typedef vector<rbases> mbases; // ... for each multigrid level
void allocate_bboxes ();
// generic member function taking a dboxes, a refinement level, a
// component, and a multigrid level
typedef void (dh::*boxesop) (dboxes &, int rl, int c, int ml);
void foreach_reflevel_component_mglevel (boxesop op);
// these all of form 'boxesop'
void setup_allocate (dboxes & b, int rl, int c, int ml);
void setup_sync_boxes (dboxes & b, int rl, int c, int ml);
void setup_multigrid_boxes (dboxes & b, int rl, int c, int ml);
void setup_refinement_prolongation_boxes (dboxes & b, int rl, int c, int ml);
void setup_refinement_boundary_prolongation_boxes (dboxes & b, int rl, int c, int ml);
void setup_refinement_restriction_boxes (dboxes & b, int rl, int c, int ml);
void optimise_field (dboxes & b,
iblistvect const dboxes::* field,
pvect dboxes::* field_fast,
int rl, int c, int ml);
void optimise_fields (dboxes & b,
int rl, int c, int ml);
void trim_unsynced_boundaries (dboxes & b, int rl, int c, int ml);
void do_output_bboxes (dboxes & b, int rl, int c, int ml);
void check_bboxes (dboxes & b, int rl, int c, int ml);
void calculate_bases ();
void output_bases ();
void save_time (bool do_prolongate);
void save_memory (bool do_prolongate);
public: // should be readonly
// Fields
gh& h; // hierarchy
i2vect ghosts; // ghost zones
int prolongation_order_space; // order of spatial prolongation operator
int inner_buffer_width; // buffer inside refined grids
i2vect buffers; // buffer outside refined grids
mboxes boxes; // grid hierarchy
mbases bases; // bounding boxes around the grid
// hierarchy
list<ggf*> gfs; // list of all grid functions
public:
// Constructors
dh (gh& h, const ivect& lghosts, const ivect& ughosts,
int prolongation_order_space, int inner_buffer_width,
const ivect& lbuffers, const ivect& ubuffers);
// Destructors
~dh ();
// Helpers
int prolongation_stencil_size () const;
// Modifiers
void regrid ();
void recompose (const int rl, const bool do_prolongate);
// Grid function management
void add (ggf* f);
void remove (ggf* f);
// Output
void output (ostream& os) const;
};
inline ostream& operator<< (ostream& os, const dh& d)
{
d.output (os);
return os;
}
#endif // DH_HH
|
