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
|
#ifndef CLAUSE_HH
#define CLAUSE_HH
#include <cctk_Schedule.h>
#include <vector>
using namespace std;
// Use this macro AT instead of vector's operator[] or at(). Depending
// on the macro NDEBUG, this macro AT either checks for valid indices
// or not.
#ifndef AT
# ifndef NDEBUG
# define AT(index) at(index)
# else
# define AT(index) operator[](index)
# endif
#endif
namespace Requirements {
// Represent scheduled functions and their dependencies
// This reflects exactly what was written in the schedule.ccl file
struct clause_t {
bool everywhere; // all grid points (everywhere)
bool interior; // all interior points
bool boundary; // all boundary points, excluding
// ghostzones
bool boundary_ghostzones; // all boundary ghost points
bool timelevel0, timelevel1, timelevel2;
bool all_timelevels; // all time levels
bool all_maps; // all maps (i.e. level mode)
bool all_reflevels; // all refinement levels (i.e. global mode)
vector<int> vars;
clause_t():
everywhere(false),
interior(false), boundary(false), boundary_ghostzones(false),
timelevel0(false), timelevel1(false), timelevel2(false),
all_timelevels(false), all_maps(false), all_reflevels(false)
{}
void interpret_options(cFunctionData const* function_data);
void parse_clause(char const* clause);
int min_num_timelevels() const;
bool active_on_timelevel(int tl) const;
// Input/Output helpers
void input (istream& is);
void output (ostream& os) const;
};
inline ostream& operator<< (ostream& os, const clause_t& a) {
a.output(os);
return os;
}
};
#endif
|
