127 lines
4.9 KiB
Plaintext
127 lines
4.9 KiB
Plaintext
/*
|
|
Copyright (c) 2010-2011, Intel Corporation
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
|
|
* Neither the name of Intel Corporation nor the names of its
|
|
contributors may be used to endorse or promote products derived from
|
|
this software without specific prior written permission.
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
|
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
|
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
static inline void
|
|
stencil_step(uniform int x0, uniform int x1,
|
|
uniform int y0, uniform int y1,
|
|
uniform int z0, uniform int z1,
|
|
uniform int Nx, uniform int Ny, uniform int Nz,
|
|
uniform const double coef[4], uniform const double vsq[],
|
|
uniform const double Ain[], uniform double Aout[]) {
|
|
const uniform int Nxy = Nx * Ny;
|
|
|
|
foreach (z = z0 ... z1, y = y0 ... y1, x = x0 ... x1)
|
|
{
|
|
int index = (z * Nxy) + (y * Nx) + x;
|
|
#define A_cur(x, y, z) Ain[index + (x) + ((y) * Nx) + ((z) * Nxy)]
|
|
#define A_next(x, y, z) Aout[index + (x) + ((y) * Nx) + ((z) * Nxy)]
|
|
double div = coef[0] * A_cur(0, 0, 0) +
|
|
coef[1] * (A_cur(+1, 0, 0) + A_cur(-1, 0, 0) +
|
|
A_cur(0, +1, 0) + A_cur(0, -1, 0) +
|
|
A_cur(0, 0, +1) + A_cur(0, 0, -1)) +
|
|
coef[2] * (A_cur(+2, 0, 0) + A_cur(-2, 0, 0) +
|
|
A_cur(0, +2, 0) + A_cur(0, -2, 0) +
|
|
A_cur(0, 0, +2) + A_cur(0, 0, -2)) +
|
|
coef[3] * (A_cur(+3, 0, 0) + A_cur(-3, 0, 0) +
|
|
A_cur(0, +3, 0) + A_cur(0, -3, 0) +
|
|
A_cur(0, 0, +3) + A_cur(0, 0, -3));
|
|
|
|
A_next(0, 0, 0) = 2.0 * A_cur(0, 0, 0) - A_next(0, 0, 0) +
|
|
vsq[index] * div;
|
|
|
|
}
|
|
}
|
|
|
|
#define SPANX 32
|
|
#define SPANY 8
|
|
#define SPANZ 8
|
|
|
|
static task void
|
|
stencil_step_task(uniform int x0, uniform int x1,
|
|
uniform int y0, uniform int y1,
|
|
uniform int z0, uniform int z1,
|
|
uniform int Nx, uniform int Ny, uniform int Nz,
|
|
uniform const double coef[4], uniform const double vsq[],
|
|
uniform const double Ain[], uniform double Aout[]) {
|
|
if (taskIndex0 >= taskCount0 ||
|
|
taskIndex1 >= taskCount1 ||
|
|
taskIndex2 >= taskCount2)
|
|
return;
|
|
|
|
const uniform int xfirst = x0 + taskIndex0 * SPANX;
|
|
const uniform int xlast = min(x1, xfirst + SPANX);
|
|
|
|
const uniform int yfirst = y0 + taskIndex1 * SPANY;
|
|
const uniform int ylast = min(y1, yfirst + SPANY);
|
|
|
|
const uniform int zfirst = z0 + taskIndex2 * SPANZ;
|
|
const uniform int zlast = min(z1, zfirst + SPANZ);
|
|
|
|
stencil_step(xfirst,xlast, yfirst,ylast, zfirst,zlast,
|
|
Nx, Ny, Nz, coef, vsq, Ain, Aout);
|
|
}
|
|
|
|
|
|
|
|
export void
|
|
loop_stencil_ispc_tasks(uniform int t0, uniform int t1,
|
|
uniform int x0, uniform int x1,
|
|
uniform int y0, uniform int y1,
|
|
uniform int z0, uniform int z1,
|
|
uniform int Nx, uniform int Ny, uniform int Nz,
|
|
uniform const double coef[4],
|
|
uniform const double vsq[],
|
|
uniform double Aeven[], uniform double Aodd[])
|
|
{
|
|
#define NB(x,n) (((x)+(n)-1)/(n))
|
|
|
|
for (uniform int t = t0; t < t1; ++t)
|
|
{
|
|
// Parallelize across cores as well: each task will work on a slice
|
|
// of 1 in the z extent of the volume.
|
|
if ((t & 1) == 0)
|
|
launch[NB(z1-z0,SPANZ)][NB(y1-y0,SPANY)][NB(x1-x0,SPANX)]
|
|
stencil_step_task(x0, x1, y0, y1, z0, z1, Nx, Ny, Nz,
|
|
coef, vsq, Aeven, Aodd);
|
|
else
|
|
launch[NB(z1-z0,SPANZ)][NB(y1-y0,SPANY)][NB(x1-x0,SPANX)]
|
|
stencil_step_task(x0, x1, y0, y1, z0, z1, Nx, Ny, Nz,
|
|
coef, vsq, Aodd, Aeven);
|
|
|
|
// We need to wait for all of the launched tasks to finish before
|
|
// starting the next iteration.
|
|
sync;
|
|
}
|
|
}
|
|
|