blob: 8ede1ebcdd435e87da6ecb3fb304e2a16e3bc4e7 (
plain)
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
|
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cctk.h>
#include <cctk_Parameters.h>
#include <ggf.hh>
#include <gh.hh>
#include <carpet.hh>
namespace Carpet {
using namespace std;
// restricts a set of groups
static void RestrictGroups (const cGH* cctkGH, const vector<int>& groups);
void Restrict (const cGH* cctkGH)
{
DECLARE_CCTK_PARAMETERS;
assert (is_level_mode());
if (suppress_restriction) {
Checkpoint ("Restriction suppressed");
return;
}
Checkpoint ("Restrict");
// all but the finest level are restricted
if (reflevel == reflevels-1) {
return;
}
// remove all groups with are non-GFs, empty, or have no storage assigned
vector<int> groups;
groups.reserve (CCTK_NumGroups());
for (int group = 0; group < CCTK_NumGroups(); ++group) {
if (CCTK_GroupTypeI(group) == CCTK_GF
and CCTK_NumVarsInGroupI(group) > 0
and CCTK_QueryGroupStorageI(cctkGH, group)) {
groups.push_back (group);
}
}
// Restrict
RestrictGroups (cctkGH, groups);
// Synchronise
SyncGroups (cctkGH, groups);
}
// restrict a set of groups
static void RestrictGroups (const cGH* cctkGH, const vector<int>& groups) {
DECLARE_CCTK_PARAMETERS;
for (comm_state state; not state.done(); state.step()) {
for (int group = 0; group < (int)groups.size(); ++group) {
const int g = groups.AT(group);
const int active_tl = CCTK_ActiveTimeLevelsGI (cctkGH, g);
assert (active_tl>=0);
const int tl = active_tl > 1 ? timelevel : 0;
for (int m=0; m<(int)arrdata.AT(g).size(); ++m) {
for (int v = 0; v < (int)arrdata.AT(g).AT(m).data.size(); ++v) {
ggf *const gv = arrdata.AT(g).AT(m).data.AT(v);
gv->ref_restrict_all (state, tl, reflevel, mglevel);
}
}
} // loop over groups
} // for state
}
} // namespace Carpet
|