| /** |
| * gesummv.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 4000. */ |
| #include "gesummv.h" |
| |
| |
| /* Array initialization. */ |
| static |
| void init_array(int n, |
| DATA_TYPE *alpha, |
| DATA_TYPE *beta, |
| DATA_TYPE POLYBENCH_2D(A,N,N,n,n), |
| DATA_TYPE POLYBENCH_2D(B,N,N,n,n), |
| DATA_TYPE POLYBENCH_1D(x,N,n)) |
| { |
| #pragma STDC FP_CONTRACT OFF |
| int i, j; |
| |
| *alpha = 43532; |
| *beta = 12313; |
| for (i = 0; i < n; i++) |
| { |
| x[i] = ((DATA_TYPE) i) / n; |
| for (j = 0; j < n; j++) { |
| A[i][j] = ((DATA_TYPE) i*j) / n; |
| B[i][j] = ((DATA_TYPE) i*j) / 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_1D(y,N,n)) |
| |
| { |
| int i; |
| char *printmat = malloc(n*16 + 1); printmat[n*16] = 0; |
| |
| for (i = 0; i < n; i++) |
| print_element(y[i], i*16, printmat); |
| fputs(printmat, stderr); |
| free(printmat); |
| } |
| |
| |
| /* Main computational kernel. The whole function will be timed, |
| including the call and return. */ |
| static |
| void kernel_gesummv(int n, |
| DATA_TYPE alpha, |
| DATA_TYPE beta, |
| DATA_TYPE POLYBENCH_2D(A,N,N,n,n), |
| DATA_TYPE POLYBENCH_2D(B,N,N,n,n), |
| DATA_TYPE POLYBENCH_1D(tmp,N,n), |
| DATA_TYPE POLYBENCH_1D(x,N,n), |
| DATA_TYPE POLYBENCH_1D(y,N,n)) |
| { |
| int i, j; |
| |
| #pragma scop |
| for (i = 0; i < _PB_N; i++) |
| { |
| tmp[i] = 0; |
| y[i] = 0; |
| for (j = 0; j < _PB_N; j++) |
| { |
| tmp[i] = A[i][j] * x[j] + tmp[i]; |
| y[i] = B[i][j] * x[j] + y[i]; |
| } |
| y[i] = alpha * tmp[i] + beta * y[i]; |
| } |
| #pragma endscop |
| |
| } |
| |
| static |
| void kernel_gesummv_StrictFP(int n, |
| DATA_TYPE alpha, |
| DATA_TYPE beta, |
| DATA_TYPE POLYBENCH_2D(A,N,N,n,n), |
| DATA_TYPE POLYBENCH_2D(B,N,N,n,n), |
| DATA_TYPE POLYBENCH_1D(tmp,N,n), |
| DATA_TYPE POLYBENCH_1D(x,N,n), |
| DATA_TYPE POLYBENCH_1D(y,N,n)) |
| { |
| #pragma STDC FP_CONTRACT OFF |
| int i, j; |
| |
| for (i = 0; i < _PB_N; i++) |
| { |
| tmp[i] = 0; |
| y[i] = 0; |
| for (j = 0; j < _PB_N; j++) |
| { |
| tmp[i] = A[i][j] * x[j] + tmp[i]; |
| y[i] = B[i][j] * x[j] + y[i]; |
| } |
| y[i] = alpha * tmp[i] + beta * y[i]; |
| } |
| } |
| |
| /* 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 int |
| check_FP(int n, |
| DATA_TYPE POLYBENCH_1D(A,N,n), |
| DATA_TYPE POLYBENCH_1D(B,N,n)) { |
| int i; |
| double AbsTolerance = FP_ABSTOLERANCE; |
| for (i = 0; i < _PB_N; i++) |
| { |
| double V1 = A[i]; |
| double V2 = B[i]; |
| double Diff = fabs(V1 - V2); |
| if (Diff > AbsTolerance) { |
| fprintf(stderr, "A[%d] = %lf and B[%d] = %lf differ more than" |
| " FP_ABSTOLERANCE = %lf\n", i, V1, i, V2, AbsTolerance); |
| return 0; |
| } |
| } |
| |
| return 1; |
| } |
| |
| int main(int argc, char** argv) |
| { |
| /* Retrieve problem size. */ |
| int n = N; |
| |
| /* Variable declaration/allocation. */ |
| DATA_TYPE alpha; |
| DATA_TYPE beta; |
| POLYBENCH_2D_ARRAY_DECL(A, DATA_TYPE, N, N, n, n); |
| POLYBENCH_2D_ARRAY_DECL(B, DATA_TYPE, N, N, n, n); |
| POLYBENCH_1D_ARRAY_DECL(tmp, DATA_TYPE, N, n); |
| POLYBENCH_1D_ARRAY_DECL(x, DATA_TYPE, N, n); |
| POLYBENCH_1D_ARRAY_DECL(y, DATA_TYPE, N, n); |
| POLYBENCH_1D_ARRAY_DECL(y_StrictFP, DATA_TYPE, N, n); |
| |
| |
| /* Initialize array(s). */ |
| init_array (n, &alpha, &beta, |
| POLYBENCH_ARRAY(A), |
| POLYBENCH_ARRAY(B), |
| POLYBENCH_ARRAY(x)); |
| |
| /* Start timer. */ |
| polybench_start_instruments; |
| |
| /* Run kernel. */ |
| kernel_gesummv (n, alpha, beta, |
| POLYBENCH_ARRAY(A), |
| POLYBENCH_ARRAY(B), |
| POLYBENCH_ARRAY(tmp), |
| POLYBENCH_ARRAY(x), |
| POLYBENCH_ARRAY(y)); |
| |
| /* Stop and print timer. */ |
| polybench_stop_instruments; |
| polybench_print_instruments; |
| |
| kernel_gesummv_StrictFP(n, alpha, beta, |
| POLYBENCH_ARRAY(A), |
| POLYBENCH_ARRAY(B), |
| POLYBENCH_ARRAY(tmp), |
| POLYBENCH_ARRAY(x), |
| POLYBENCH_ARRAY(y_StrictFP)); |
| if (!check_FP(n, POLYBENCH_ARRAY(y), POLYBENCH_ARRAY(y_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(y_StrictFP))); |
| |
| /* Be clean. */ |
| POLYBENCH_FREE_ARRAY(A); |
| POLYBENCH_FREE_ARRAY(B); |
| POLYBENCH_FREE_ARRAY(tmp); |
| POLYBENCH_FREE_ARRAY(x); |
| POLYBENCH_FREE_ARRAY(y); |
| |
| return 0; |
| } |