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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
|
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <limits>
#include <vector>
#include "cctk.h"
#include "util_Table.h"
#include "bbox.hh"
#include "bboxset.hh"
#include "dh.hh"
#include "gdata.hh"
#include "gh.hh"
#include "ggf.hh"
#include "vect.hh"
#include "carpet.hh"
#include "mapping.hh"
#include "slab.hh"
namespace CarpetSlab {
using namespace std;
using namespace Carpet;
void
FillSlab (const cGH* const cgh,
const int dest_proc,
const int n,
const int ti,
const int hdim,
const int origin[/*vdim*/],
const int dirs[/*hdim*/],
const int stride[/*hdim*/],
const int length[/*hdim*/],
void* const hdata)
{
int ierr;
// Check Cactus grid hierarchy
assert (cgh);
// Check destination processor
assert (dest_proc>=-1 && dest_proc<CCTK_nProcs(cgh));
// Check variable index
assert (n>=0 && n<CCTK_NumVars());
// Get info about variable
const int group = CCTK_GroupIndexFromVarI(n);
assert (group>=0);
const int n0 = CCTK_FirstVarIndexI(group);
assert (n0>=0);
const int var = n - n0;
assert (var>=0);
// Get info about group
cGroup gp;
ierr = CCTK_GroupData (group, &gp);
assert (! ierr);
assert (gp.dim<=dim);
assert (CCTK_QueryGroupStorageI(cgh, group));
const int typesize = CCTK_VarTypeSize(gp.vartype);
assert (typesize>0);
if (gp.grouptype==CCTK_GF && reflevel==-1) {
CCTK_WARN (0, "It is not possible to use hyperslabbing for a grid function in meta mode or global mode (use singlemap mode instead)");
}
const int rl = gp.grouptype==CCTK_GF ? reflevel : 0;
assert (rl>=0);
if (gp.grouptype==CCTK_GF && Carpet::map==-1 && maps>1) {
CCTK_WARN (0, "It is not possible to use hyperslabbing for a grid function in level mode when there are multiple maps (use singlemap mode instead, or make sure that there is only one map)");
}
const int m = gp.grouptype==CCTK_GF ? (maps>1 ? Carpet::map : 0) : 0;
assert (m>=0);
const int oldmap = Carpet::map;
if (gp.grouptype==CCTK_GF && oldmap==-1) {
enter_singlemap_mode(const_cast<cGH*>(cgh), m, gp.grouptype);
}
// Check dimension
assert (hdim>=0 && hdim<=gp.dim);
// Get more info about group
cGroupDynamicData gd;
ierr = CCTK_GroupDynamicData (cgh, group, &gd);
assert (! ierr);
const vect<int,dim> sizes = vect<int,dim>::ref(gd.gsh);
for (int d=0; d<dim; ++d) {
assert (sizes[d] >= 0);
}
// Check timelevel
const int num_tl = gp.numtimelevels;
assert (ti>=0 && ti<num_tl);
const int tl = -ti;
// Check origin
for (int d=0; d<dim; ++d) {
assert (origin[d]>=0 && origin[d]<=sizes[d]);
}
// Check directions
for (int dd=0; dd<hdim; ++dd) {
assert (dirs[dd]>=1 && dirs[dd]<=dim);
}
// Check stride
for (int dd=0; dd<hdim; ++dd) {
assert (stride[dd]>0);
}
// Check length
for (int dd=0; dd<hdim; ++dd) {
assert (length[dd]>=0);
}
// Check extent
for (int dd=0; dd<hdim; ++dd) {
assert (origin[dirs[dd]-1] + length[dd] <= sizes[dirs[dd]-1]);
}
// Get insider information about variable
const gh* myhh;
const dh* mydd;
const ggf* myff;
assert (group < (int)arrdata.size());
myhh = arrdata.at(group).at(m).hh;
assert (myhh);
mydd = arrdata.at(group).at(m).dd;
assert (mydd);
assert (var < (int)arrdata.at(group).at(m).data.size());
myff = arrdata.at(group).at(m).data.at(var);
assert (myff);
// Detemine collecting processor
const int collect_proc = dest_proc<0 ? 0 : dest_proc;
// Determine own rank
const int rank = CCTK_MyProc(cgh);
// Sanity check
// (if this fails, someone requested an insane number of grid points)
{
int max = numeric_limits<int>::max();
for (int dd=0; dd<hdim; ++dd) {
assert (length[dd] >= 0 && length[dd] <= max);
if (length[dd] > 0) max /= length[dd];
}
assert (typesize <= max);
}
// Calculate global size
int totalsize = 1;
for (int dd=0; dd<hdim; ++dd) {
totalsize *= length[dd];
}
// Allocate memory
assert (hdata);
if (dest_proc==-1 || rank==dest_proc) {
memset (hdata, 0, totalsize * typesize);
}
// Get sample data
const gdata* mydata;
mydata = (*myff)(tl, rl, 0, 0);
// Stride of data in memory
const vect<int,dim> str = mydata->extent().stride();
// Stride of collected data
vect<int,dim> hstr = str;
for (int dd=0; dd<hdim; ++dd) {
hstr[dirs[dd]-1] *= stride[dd];
}
// Lower bound of collected data
vect<int,dim> hlb(0);
for (int d=0; d<gp.dim; ++d) {
hlb[d] = origin[d] * str[d];
}
// Upper bound of collected data
vect<int,dim> hub = hlb;
for (int dd=0; dd<hdim; ++dd) {
hub[dirs[dd]-1] += (length[dd]-1) * hstr[dirs[dd]-1];
}
// Calculate extent to collect
const bbox<int,dim> hextent (hlb, hub, hstr);
assert (hextent.size() == totalsize);
// Create collector data object
void* myhdata = rank==collect_proc ? hdata : 0;
gdata* const alldata = mydata->make_typed (-1, error_centered, op_sync);
alldata->allocate (hextent, collect_proc, myhdata);
// Done with the temporary stuff
mydata = 0;
for (comm_state state; !state.done(); state.step()) {
// Loop over all components, copying data from them
BEGIN_COMPONENT_LOOP (cgh, gp.grouptype) {
// Get data object
mydata = (*myff)(tl, rl, component, mglevel);
// Calculate overlapping extents
const bboxset<int,dim> myextents =
mydd->boxes.at(mglevel).at(rl).at(component).interior & hextent;
// Loop over overlapping extents
for (bboxset<int,dim>::const_iterator ext_iter = myextents.begin();
ext_iter != myextents.end();
++ext_iter) {
// Copy data
alldata->copy_from (state, mydata, *ext_iter);
}
} END_COMPONENT_LOOP;
} // for step
// Copy result to all processors
if (dest_proc == -1) {
vector<gdata*> tmpdata(CCTK_nProcs(cgh));
vector<comm_state> state;
for (int proc=0; proc<CCTK_nProcs(cgh); ++proc) {
if (proc != collect_proc) {
void* myhdata = rank==proc ? hdata : 0;
tmpdata.at(proc) = mydata->make_typed (-1, error_centered, op_sync);
tmpdata.at(proc)->allocate (alldata->extent(), proc, myhdata);
tmpdata.at(proc)->copy_from (state.at(proc), alldata, alldata->extent());
}
}
for (int proc=0; proc<CCTK_nProcs(cgh); ++proc) {
if (proc != collect_proc) {
tmpdata.at(proc)->copy_from (state.at(proc), alldata, alldata->extent());
}
}
for (int proc=0; proc<CCTK_nProcs(cgh); ++proc) {
if (proc != collect_proc) {
tmpdata.at(proc)->copy_from (state.at(proc), alldata, alldata->extent());
delete tmpdata.at(proc);
}
}
} // Copy result
if (gp.grouptype==CCTK_GF && oldmap==-1) {
leave_singlemap_mode(const_cast<cGH*>(cgh));
}
delete alldata;
}
} // namespace CarpetSlab
|