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
|
#include <cassert>
#include <cstdlib>
#include <vector>
#include <cctk.h>
#include <cctk_Parameters.h>
#include <util_ErrorCodes.h>
#include <util_Table.h>
#include <Timer.hh>
#include <gh.hh>
#include <carpet.hh>
namespace Carpet {
using namespace std;
// Checksum information
struct ckdesc {
bool valid;
unsigned long sum;
};
// Helper class
struct ckdesc4 {
vector<vector<vector<vector<ckdesc> > > > a; // [m][c][var][tl]
};
// Checksum information
vector<vector<vector<ckdesc4> > > checksums; // [rl][ml][group]
// Calculate the internet checksum (see RFC 1071)
static unsigned short
internet_checksum (void const * restrict const addr,
size_t const len)
{
unsigned long chk = 0;
#pragma omp parallel for reduction (+: chk)
for (ptrdiff_t i=0; i<(ptrdiff_t)len; i+=2) {
unsigned long const lb = ((unsigned char const*)addr)[i];
unsigned long const ub = ((unsigned char const*)addr)[i+1];
chk += lb + (ub << 8);
}
if (len % 1) {
unsigned long const lb = ((unsigned char const*)addr)[len-1];
chk += lb;
}
while (chk >> 16) {
chk = (chk & 0xffffUL) + (chk >> 16);
}
return ~chk;
}
// The parameter where specifies which time levels should be
// poisoned. what specifies what kind of grid variables should be
// poisoned.
void CalculateChecksums (const cGH* cgh, const checktimes where)
{
DECLARE_CCTK_PARAMETERS;
if (! checksum_timelevels) return;
Timers::Timer timer("CalculateChecksums");
timer.start();
Checkpoint ("CalculateChecksums");
checksums.resize(maxreflevels);
checksums.at(reflevel).resize(mglevels);
checksums.at(reflevel).at(mglevel).resize(CCTK_NumGroups());
for (int group=0; group<CCTK_NumGroups(); ++group) {
if (CCTK_QueryGroupStorageI(cgh, group)) {
const int grouptype = CCTK_GroupTypeI(group);
if (reflevel == 0 or grouptype == CCTK_GF) {
checksums.at(reflevel).at(mglevel).at(group).a.resize(arrdata.at(group).size());
BEGIN_LOCAL_MAP_LOOP(cgh, grouptype) {
checksums.at(reflevel).at(mglevel).at(group).a.at(map).resize(arrdata.at(group).at(map).hh->local_components(reflevel));
BEGIN_LOCAL_COMPONENT_LOOP(cgh, grouptype) {
const int nvars = CCTK_NumVarsInGroupI(group);
checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).resize(nvars);
if (nvars > 0) {
const int n0 = CCTK_FirstVarIndexI(group);
const int sz = CCTK_VarTypeSize(CCTK_VarTypeI(n0));
assert (sz>0);
ivect size(1);
const int gpdim = groupdata.at(group).info.dim;
for (int d=0; d<gpdim; ++d) {
size[d] = groupdata.at(group).info.lsh[d];
}
const int np = prod(size);
int const table = CCTK_GroupTagsTableI (group);
assert (table >= 0);
bool persistent;
char buf[100];
int const ilen =
Util_TableGetString (table, sizeof buf, buf, "Persistent");
if (ilen > 0) {
if (CCTK_EQUALS(buf, "yes")) {
persistent = true;
} else if (CCTK_EQUALS(buf, "no")) {
persistent = false;
} else {
assert (0);
}
} else if (ilen == UTIL_ERROR_TABLE_NO_SUCH_KEY) {
// default
persistent = true;
} else {
assert (0);
}
const int num_tl = CCTK_NumTimeLevelsFromVarI(n0);
assert (num_tl>0);
const int min_tl = min_timelevel(where, num_tl, persistent);
const int max_tl = max_timelevel(where, num_tl, persistent);
for (int var=0; var<nvars; ++var) {
checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).resize(num_tl);
for (int tl=min_tl; tl<=max_tl; ++tl) {
const int n = n0 + var;
const void* data = cgh->data[n][tl];
unsigned long const chk = internet_checksum (data, np*sz);
checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).at(tl).sum = chk;
checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).at(tl).valid = true;
} // for tl
} // for var
} // if group has vars
} END_LOCAL_COMPONENT_LOOP;
} END_LOCAL_MAP_LOOP;
} // if grouptype fits
} // if storage
} // for group
timer.stop();
}
void CheckChecksums (const cGH* cgh, const checktimes where)
{
DECLARE_CCTK_PARAMETERS;
if (! checksum_timelevels) return;
Checkpoint ("CheckChecksums");
assert ((int)checksums.size()==maxreflevels);
assert ((int)checksums.at(reflevel).size()==mglevels);
assert ((int)checksums.at(reflevel).at(mglevel).size()==CCTK_NumGroups());
for (int group=0; group<CCTK_NumGroups(); ++group) {
if (CCTK_QueryGroupStorageI(cgh, group)) {
const int grouptype = CCTK_GroupTypeI(group);
if (reflevel == 0 or grouptype == CCTK_GF) {
assert (checksums.at(reflevel).at(mglevel).at(group).a.size()==arrdata.at(group).size());
BEGIN_LOCAL_MAP_LOOP(cgh, grouptype) {
assert ((int)checksums.at(reflevel).at(mglevel).at(group).a.at(map).size()==arrdata.at(group).at(map).hh->local_components(reflevel));
BEGIN_LOCAL_COMPONENT_LOOP(cgh, grouptype) {
const int nvars = CCTK_NumVarsInGroupI(group);
assert ((int)checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).size()==nvars);
if (nvars > 0) {
const int n0 = CCTK_FirstVarIndexI(group);
const int sz = CCTK_VarTypeSize(CCTK_VarTypeI(n0));
assert (sz>0);
ivect size(1);
const int gpdim = groupdata.at(group).info.dim;
for (int d=0; d<gpdim; ++d) {
size[d] = groupdata.at(group).info.lsh[d];
}
const int np = prod(size);
int const table = CCTK_GroupTagsTableI (group);
assert (table >= 0);
bool persistent;
char buf[100];
int const ilen =
Util_TableGetString (table, sizeof buf, buf, "Persistent");
if (ilen > 0) {
if (CCTK_EQUALS(buf, "yes")) {
persistent = true;
} else if (CCTK_EQUALS(buf, "no")) {
persistent = false;
} else {
assert (0);
}
} else if (ilen == UTIL_ERROR_TABLE_NO_SUCH_KEY) {
// default
persistent = true;
} else {
assert (0);
}
const int num_tl = CCTK_NumTimeLevelsFromVarI(n0);
assert (num_tl>0);
const int min_tl = min_timelevel(where, num_tl, persistent);
const int max_tl = max_timelevel(where, num_tl, persistent);
for (int var=0; var<nvars; ++var) {
assert ((int)checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).size()==num_tl);
for (int tl=min_tl; tl<=max_tl; ++tl) {
if (checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).at(tl).valid) {
const int n = n0 + var;
const void* data = cgh->data[n][tl];
unsigned long const chk = internet_checksum (data, np*sz);
const bool unexpected_change =
chk != checksums.at(reflevel).at(mglevel).at(group).a.at(map).at(local_component).at(var).at(tl).sum;
if (unexpected_change) {
char* fullname = CCTK_FullName(n);
CCTK_VWarn (1, __LINE__, __FILE__, CCTK_THORNSTRING,
"Timelevel %d, component %d, refinement level %d of the variable \"%s\" has changed unexpectedly",
tl, component, reflevel, fullname);
free (fullname);
}
} // if valid
} // for tl
} // for var
} // if group has vars
} END_LOCAL_COMPONENT_LOOP;
} END_LOCAL_MAP_LOOP;
} // if grouptype fits
} // if storage
} // for group
}
} // namespace Carpet
|
