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
|
c -*-Fortran-*-
c $Header:$
#include "cctk.h"
#define CHKIDX(i,j,k, imax,jmax,kmax, where) \
if ((i).lt.1 .or. (i).gt.(imax) \
.or. (j).lt.1 .or. (j).gt.(jmax) \
.or. (k).lt.1 .or. (k).gt.(kmax)) then &&\
write (msg, '(a, " array index out of bounds: shape is (",i4,",",i4,",",i4,"), index is (",i4,",",i4,",",i4,")")') \
(where), (imax), (jmax), (kmax), (i), (j), (k) &&\
call CCTK_WARN (0, msg(1:len_trim(msg))) &&\
end if
subroutine prolongate_3d_real8 (
$ src, srciext, srcjext, srckext,
$ dst, dstiext, dstjext, dstkext,
$ srcbbox, dstbbox, regbbox)
implicit none
CCTK_REAL8 one
parameter (one = 1)
integer srciext, srcjext, srckext
CCTK_REAL8 src(srciext,srcjext,srckext)
integer dstiext, dstjext, dstkext
CCTK_REAL8 dst(dstiext,dstjext,dstkext)
c bbox(:,1) is lower boundary (inclusive)
c bbox(:,2) is upper boundary (inclusive)
c bbox(:,3) is stride
integer srcbbox(3,3), dstbbox(3,3), regbbox(3,3)
integer regiext, regjext, regkext
integer dstifac, dstjfac, dstkfac
integer srcioff, srcjoff, srckoff
integer dstioff, dstjoff, dstkoff
CCTK_REAL8 dstdiv
integer i, j, k
integer i0, j0, k0
integer fi, fj, fk
integer ifac(2), jfac(2), kfac(2)
integer ii, jj, kk
integer fac
CCTK_REAL8 res
integer d
character msg*1000
do d=1,3
if (srcbbox(d,3).eq.0 .or. dstbbox(d,3).eq.0
$ .or. regbbox(d,3).eq.0) then
call CCTK_WARN (0, "Internal error: stride is zero")
end if
if (srcbbox(d,3).le.regbbox(d,3)
$ .or. dstbbox(d,3).ne.regbbox(d,3)) then
call CCTK_WARN (0, "Internal error: strides disagree")
end if
if (mod(srcbbox(d,3), dstbbox(d,3)).ne.0) then
call CCTK_WARN (0, "Internal error: destination strides are not integer multiples of the source strides")
end if
if (mod(srcbbox(d,1), srcbbox(d,3)).ne.0
$ .or. mod(dstbbox(d,1), dstbbox(d,3)).ne.0
$ .or. mod(regbbox(d,1), regbbox(d,3)).ne.0) then
call CCTK_WARN (0, "Internal error: array origins are not integer multiples of the strides")
end if
if (regbbox(d,1).gt.regbbox(d,2)) then
c This could be handled, but is likely to point to an error elsewhere
call CCTK_WARN (0, "Internal error: region extent is empty")
end if
if (mod(srcbbox(d,2) - srcbbox(d,1), srcbbox(d,3)).ne.0
$ .or. mod(dstbbox(d,2) - dstbbox(d,1), dstbbox(d,3)).ne.0
$ .or. mod(regbbox(d,2) - regbbox(d,1), regbbox(d,3)).ne.0) then
call CCTK_WARN (0, "Internal error: array extents are not integer multiples of the strides")
end if
if (regbbox(d,1).lt.srcbbox(d,1)
$ .or. regbbox(d,1).lt.dstbbox(d,1)
$ .or. regbbox(d,2).gt.srcbbox(d,2)
$ .or. regbbox(d,2).gt.dstbbox(d,2)) then
call CCTK_WARN (0, "Internal error: region extent is not contained in array extent")
end if
end do
if (srciext.ne.(srcbbox(1,2)-srcbbox(1,1))/srcbbox(1,3)+1
$ .or. srcjext.ne.(srcbbox(2,2)-srcbbox(2,1))/srcbbox(2,3)+1
$ .or. srckext.ne.(srcbbox(3,2)-srcbbox(3,1))/srcbbox(3,3)+1
$ .or. dstiext.ne.(dstbbox(1,2)-dstbbox(1,1))/dstbbox(1,3)+1
$ .or. dstjext.ne.(dstbbox(2,2)-dstbbox(2,1))/dstbbox(2,3)+1
$ .or. dstkext.ne.(dstbbox(3,2)-dstbbox(3,1))/dstbbox(3,3)+1) then
call CCTK_WARN (0, "Internal error: array sizes don't agree with bounding boxes")
end if
regiext = (regbbox(1,2) - regbbox(1,1)) / regbbox(1,3) + 1
regjext = (regbbox(2,2) - regbbox(2,1)) / regbbox(2,3) + 1
regkext = (regbbox(3,2) - regbbox(3,1)) / regbbox(3,3) + 1
dstifac = srcbbox(1,3) / dstbbox(1,3)
dstjfac = srcbbox(2,3) / dstbbox(2,3)
dstkfac = srcbbox(3,3) / dstbbox(3,3)
srcioff = (regbbox(1,1) - srcbbox(1,1)) / dstbbox(1,3)
srcjoff = (regbbox(2,1) - srcbbox(2,1)) / dstbbox(2,3)
srckoff = (regbbox(3,1) - srcbbox(3,1)) / dstbbox(3,3)
dstioff = (regbbox(1,1) - dstbbox(1,1)) / dstbbox(1,3)
dstjoff = (regbbox(2,1) - dstbbox(2,1)) / dstbbox(2,3)
dstkoff = (regbbox(3,1) - dstbbox(3,1)) / dstbbox(3,3)
c Loop over fine region
dstdiv = one / (dstifac * dstjfac * dstkfac)
do k = 0, regkext-1
k0 = (srckoff + k) / dstkfac
fk = mod(srckoff + k, dstkfac)
kfac(1) = (fk-dstkfac) * (-1)
kfac(2) = (fk ) * 1
do j = 0, regjext-1
j0 = (srcjoff + j) / dstjfac
fj = mod(srcjoff + j, dstjfac)
jfac(1) = (fj-dstjfac) * (-1)
jfac(2) = (fj ) * 1
do i = 0, regiext-1
i0 = (srcioff + i) / dstifac
fi = mod(srcioff + i, dstifac)
ifac(1) = (fi-dstifac) * (-1)
ifac(2) = (fi ) * 1
res = 0
do kk=1,2
do jj=1,2
do ii=1,2
fac = ifac(ii) * jfac(jj) * kfac(kk)
if (fac.ne.0) then
CHKIDX (i0+ii, j0+jj, k0+kk, \
srciext,srcjext,srckext, "source")
res = res + fac * src(i0+ii, j0+jj, k0+kk)
end if
end do
end do
end do
c$$$ fac = ifac(1) * jfac(1) * kfac(1)
c$$$ if (fac.ne.0) res = res + fac * src(i0+1, j0+1, k0+1)
c$$$
c$$$ fac = ifac(2) * jfac(1) * kfac(1)
c$$$ if (fac.ne.0) res = res + fac * src(i0+2, j0+1, k0+1)
c$$$
c$$$ fac = ifac(1) * jfac(2) * kfac(1)
c$$$ if (fac.ne.0) res = res + fac * src(i0+1, j0+2, k0+1)
c$$$
c$$$ fac = ifac(2) * jfac(2) * kfac(1)
c$$$ if (fac.ne.0) res = res + fac * src(i0+2, j0+2, k0+1)
c$$$
c$$$ fac = ifac(1) * jfac(1) * kfac(2)
c$$$ if (fac.ne.0) res = res + fac * src(i0+1, j0+1, k0+2)
c$$$
c$$$ fac = ifac(2) * jfac(1) * kfac(2)
c$$$ if (fac.ne.0) res = res + fac * src(i0+2, j0+1, k0+2)
c$$$
c$$$ fac = ifac(1) * jfac(2) * kfac(2)
c$$$ if (fac.ne.0) res = res + fac * src(i0+1, j0+2, k0+2)
c$$$
c$$$ fac = ifac(2) * jfac(2) * kfac(2)
c$$$ if (fac.ne.0) res = res + fac * src(i0+2, j0+2, k0+2)
CHKIDX (dstioff+i+1, dstjoff+j+1, dstkoff+k+1, \
dstiext,dstjext,dstkext, "destination")
dst (dstioff+i+1, dstjoff+j+1, dstkoff+k+1) = dstdiv * res
end do
end do
end do
end
|
