-
Notifications
You must be signed in to change notification settings - Fork 2
/
stencil.c
105 lines (101 loc) · 4.64 KB
/
stencil.c
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
// ************************************************************************
//
// miniAMR: stencil computations with boundary exchange and AMR.
//
// Copyright (2014) Sandia Corporation. Under the terms of Contract
// DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government
// retains certain rights in this software.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
// Questions? Contact Courtenay T. Vaughan ([email protected])
// Richard F. Barrett ([email protected])
//
// ************************************************************************
#include <mpi.h>
#include "block.h"
#include "comm.h"
#include "proto.h"
// This routine does the stencil calculations.
void stencil_calc(int var)
{
int n, i, j, k, in;
double sb, sm, sf, work[x_block_size+2][y_block_size+2][z_block_size+2];
block *bp;
if (stencil == 7) {
for (in = 0; in < sorted_index[num_refine+1]; in++) {
n = sorted_list[in].n;
bp = &blocks[n];
if (bp->number >= 0) {
for (i = 1; i <= x_block_size; i++)
for (j = 1; j <= y_block_size; j++)
for (k = 1; k <= z_block_size; k++)
work[i][j][k] = (bp->array[var][i-1][j ][k ] +
bp->array[var][i ][j-1][k ] +
bp->array[var][i ][j ][k-1] +
bp->array[var][i ][j ][k ] +
bp->array[var][i ][j ][k+1] +
bp->array[var][i ][j+1][k ] +
bp->array[var][i+1][j ][k ])/7.0;
for (i = 1; i <= x_block_size; i++)
for (j = 1; j <= y_block_size; j++)
for (k = 1; k <= z_block_size; k++)
bp->array[var][i][j][k] = work[i][j][k];
}
}
} else {
for (in = 0; in < sorted_index[num_refine+1]; in++) {
n = sorted_list[in].n;
bp = &blocks[n];
if (bp->number >= 0) {
for (i = 1; i <= x_block_size; i++)
for (j = 1; j <= y_block_size; j++)
for (k = 1; k <= z_block_size; k++) {
sb = bp->array[var][i-1][j-1][k-1] +
bp->array[var][i-1][j-1][k ] +
bp->array[var][i-1][j-1][k+1] +
bp->array[var][i-1][j ][k-1] +
bp->array[var][i-1][j ][k ] +
bp->array[var][i-1][j ][k+1] +
bp->array[var][i-1][j+1][k-1] +
bp->array[var][i-1][j+1][k ] +
bp->array[var][i-1][j+1][k+1];
sm = bp->array[var][i ][j-1][k-1] +
bp->array[var][i ][j-1][k ] +
bp->array[var][i ][j-1][k+1] +
bp->array[var][i ][j ][k-1] +
bp->array[var][i ][j ][k ] +
bp->array[var][i ][j ][k+1] +
bp->array[var][i ][j+1][k-1] +
bp->array[var][i ][j+1][k ] +
bp->array[var][i ][j+1][k+1];
sf = bp->array[var][i+1][j-1][k-1] +
bp->array[var][i+1][j-1][k ] +
bp->array[var][i+1][j-1][k+1] +
bp->array[var][i+1][j ][k-1] +
bp->array[var][i+1][j ][k ] +
bp->array[var][i+1][j ][k+1] +
bp->array[var][i+1][j+1][k-1] +
bp->array[var][i+1][j+1][k ] +
bp->array[var][i+1][j+1][k+1];
work[i][j][k] = (sb + sm + sf)/27.0;
}
for (i = 1; i <= x_block_size; i++)
for (j = 1; j <= y_block_size; j++)
for (k = 1; k <= z_block_size; k++)
bp->array[var][i][j][k] = work[i][j][k];
}
}
}
}