amr/Constants.h at master · UIUC-PPL/amr · GitHub

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
#ifndef __CONSTANTS__
#define __CONSTANTS__

#ifndef AMR_REVISION
#define AMR_REVISION Unknown
#endif
#define _QUOTEIT(x) #x

#define INQUOTES(x) _QUOTEIT(x)
#ifdef LOGGER
#define VB(x)  x
#else
#define VB(x)
#endif

#define NUM_NEIGHBORS (2*numDims)
#define NUM_CHILDREN (1 << numDims)

#define FOR_EACH_ZONE for ( int i=1; i<=block_width; i++) for(int j=1; j<=block_height; j++) for (int k = 1; k <= block_depth; ++k) {
#define FOR_EACH_NEIGHBOR for( int i=0; i<NUM_NEIGHBORS; i++){
#define FOR_EACH_CHILD for( int i=0; i<NUM_CHILDREN; i++){
#define END_FOR }

extern int block_width, block_height, block_depth;

static inline int index2d(int a, int b, int width) { return b*width + a; }
static inline int index_xz(int x, int z) { return z*block_width + x; }
static inline int index_xy(int x, int y) { return y*block_width + x; }
static inline int index_yz(int y, int z) { return z*block_height + y; }

static inline int index(int i, int j, int k) {
  return (k*(block_height+2) + j)*(block_width+2) + i;
}

static inline int index_l(int i, int j, int k) {
  return (k*block_height + j)*block_width + i;
}

static inline int index_c(int i, int j, int k) {
  return (k*(block_height/2) + j)*(block_width/2) + i;
}

static inline bool liesin(int x, int st, int end) {
  return x <= end && x >= st;
}

#define isLeaf !isRefined

const int numBitsForStorage = 8*sizeof(unsigned int);
const int numDims = 3;
const int numDims2 = numDims*numDims;

enum Dir { UP=0, DOWN=1, LEFT=2, RIGHT=3, FORWARD=4, BACKWARD=5 };
PUPbytes(Dir);

enum Decision {INV=-1, COARSEN=0, STAY=1, REFINE=2};
PUPbytes(Decision);

#endif