blob: 89e65ae14a663c50445a30a991a967dc5f17bb13 [file] [log] [blame]
/**
* seidel-2d.c: This file is part of the PolyBench/C 3.2 test suite.
*
*
* Contact: Louis-Noel Pouchet <pouchet@cse.ohio-state.edu>
* Web address: http://polybench.sourceforge.net
*/
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
/* Include polybench common header. */
#include <polybench.h>
/* Include benchmark-specific header. */
/* Default data type is double, default size is 20x1000. */
#include "seidel-2d.h"
/* Array initialization. */
static
void init_array (int n,
DATA_TYPE POLYBENCH_2D(A,N,N,n,n))
{
#pragma STDC FP_CONTRACT OFF
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
A[i][j] = ((DATA_TYPE) i*(j+2) + 2) / n;
}
/* DCE code. Must scan the entire live-out data.
Can be used also to check the correctness of the output. */
static
void print_array(int n,
DATA_TYPE POLYBENCH_2D(A,N,N,n,n))
{
int i, j;
char *printmat = malloc(n*16 + 1); printmat[n*16] = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
print_element(A[i][j], j*16, printmat);
fputs(printmat, stderr);
}
free(printmat);
}
/* Main computational kernel. The whole function will be timed,
including the call and return. */
static
void kernel_seidel_2d(int tsteps,
int n,
DATA_TYPE POLYBENCH_2D(A,N,N,n,n))
{
int t, i, j;
#pragma scop
for (t = 0; t <= _PB_TSTEPS - 1; t++)
for (i = 1; i<= _PB_N - 2; i++)
for (j = 1; j <= _PB_N - 2; j++)
A[i][j] = (A[i-1][j-1] + A[i-1][j] + A[i-1][j+1]
+ A[i][j-1] + A[i][j] + A[i][j+1]
+ A[i+1][j-1] + A[i+1][j] + A[i+1][j+1])/9.0;
#pragma endscop
}
#if !FMA_DISABLED
// NOTE: FMA_DISABLED is true for targets where FMA contraction causes
// discrepancies which cause the accuracy checks to fail.
// In this case, the test runs with the option -ffp-contract=off
static void
kernel_seidel_2d_StrictFP(int tsteps,
int n,
DATA_TYPE POLYBENCH_2D(A,N,N,n,n))
{
#pragma STDC FP_CONTRACT OFF
int t, i, j;
for (t = 0; t <= _PB_TSTEPS - 1; t++)
for (i = 1; i<= _PB_N - 2; i++)
for (j = 1; j <= _PB_N - 2; j++)
A[i][j] = (A[i-1][j-1] + A[i-1][j] + A[i-1][j+1]
+ A[i][j-1] + A[i][j] + A[i][j+1]
+ A[i+1][j-1] + A[i+1][j] + A[i+1][j+1])/9.0;
}
/* Return 0 when one of the elements of arrays A and B do not match within the
allowed FP_ABSTOLERANCE. Return 1 when all elements match. */
static inline int
check_FP(int n,
DATA_TYPE POLYBENCH_2D(A,N,N,n,n),
DATA_TYPE POLYBENCH_2D(B,N,N,n,n)) {
int i, j;
double AbsTolerance = FP_ABSTOLERANCE;
for (i = 0; i < _PB_N; i++)
for (j = 0; j < _PB_N; j++)
{
double V1 = A[i][j];
double V2 = B[i][j];
double Diff = fabs(V1 - V2);
if (Diff > AbsTolerance) {
fprintf(stderr, "A[%d][%d] = %lf and B[%d][%d] = %lf differ more than"
" FP_ABSTOLERANCE = %lf\n", i, j, V1, i, j, V2, AbsTolerance);
return 0;
}
}
/* All elements are within the allowed FP_ABSTOLERANCE error margin. */
return 1;
}
#endif
int main(int argc, char** argv)
{
/* Retrieve problem size. */
int n = N;
int tsteps = TSTEPS;
/* Variable declaration/allocation. */
POLYBENCH_2D_ARRAY_DECL(A, DATA_TYPE, N, N, n, n);
#if !FMA_DISABLED
POLYBENCH_2D_ARRAY_DECL(A_StrictFP, DATA_TYPE, N, N, n, n);
#endif
/* Initialize array(s). */
init_array (n, POLYBENCH_ARRAY(A));
/* Start timer. */
polybench_start_instruments;
/* Run kernel. */
kernel_seidel_2d (tsteps, n, POLYBENCH_ARRAY(A));
/* Stop and print timer. */
polybench_stop_instruments;
polybench_print_instruments;
#if FMA_DISABLED
/* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */
polybench_prevent_dce(print_array(n, POLYBENCH_ARRAY(A)));
#else
init_array (n, POLYBENCH_ARRAY(A_StrictFP));
kernel_seidel_2d (tsteps, n, POLYBENCH_ARRAY(A_StrictFP));
if (!check_FP(n, POLYBENCH_ARRAY(A), POLYBENCH_ARRAY(A_StrictFP)))
return 1;
/* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */
polybench_prevent_dce(print_array(n, POLYBENCH_ARRAY(A_StrictFP)));
#endif
/* Be clean. */
POLYBENCH_FREE_ARRAY(A);
#if !FMA_DISABLED
POLYBENCH_FREE_ARRAY(A_StrictFP);
#endif
return 0;
}