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
|
#include <assert.h>
#include <stdlib.h>
#include "cctk.h"
#include "Carpet/CarpetLib/src/ggf.hh"
#include "Carpet/CarpetLib/src/gh.hh"
#include "carpet.hh"
static const char* rcsid = "$Header: /home/eschnett/C/carpet/Carpet/Carpet/Carpet/src/Restrict.cc,v 1.1 2001/07/04 12:29:47 schnetter Exp $";
namespace Carpet {
using namespace std;
void Restrict (cGH* cgh)
{
assert (component == -1);
Checkpoint ("%*sRestrict", 2*reflevel, "");
if (reflevel == hh->reflevels()-1) return;
for (int group=0; group<CCTK_NumGroups(); ++group) {
// Restrict only groups with storage
if (CCTK_QueryGroupStorageI(cgh, group)) {
const int tl = 0;
switch (CCTK_GroupTypeI(group)) {
case CCTK_SCALAR:
break;
case CCTK_ARRAY:
for (int var=0; var<(int)arrdata[group].data.size(); ++var) {
for (int c=0; c<hh->components(reflevel); ++c) {
arrdata[group].data[var]->ref_restrict
(tl, reflevel, c, mglevel);
}
for (int c=0; c<arrdata[group].hh->components(reflevel); ++c) {
arrdata[group].data[var]->sync (tl, reflevel, c, mglevel);
}
}
break;
case CCTK_GF:
for (int var=0; var<(int)gfdata[group].data.size(); ++var) {
for (int c=0; c<hh->components(reflevel); ++c) {
gfdata[group].data[var]->ref_restrict
(tl, reflevel, c, mglevel);
}
for (int c=0; c<hh->components(reflevel); ++c) {
gfdata[group].data[var]->sync (tl, reflevel, c, mglevel);
}
}
break;
default:
abort();
}
} // if group has storage
} // loop over groups
}
} // namespace Carpet
|
