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
|
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
#include "instrument.h"
/* Default problem size. */
#ifndef TSTEPS
# define TSTEPS 10
#endif
#ifndef N
# define N 1024
#endif
/* Default data type is double. */
#ifndef DATA_TYPE
# define DATA_TYPE double
#endif
#ifndef DATA_PRINTF_MODIFIER
# define DATA_PRINTF_MODIFIER "%0.2lf "
#endif
/* Array declaration. Enable malloc if POLYBENCH_TEST_MALLOC. */
#ifndef POLYBENCH_TEST_MALLOC
DATA_TYPE X[N][N];
DATA_TYPE A[N][N];
DATA_TYPE B[N][N];
#else
DATA_TYPE** X = (DATA_TYPE**)malloc(MAXGRID * sizeof(DATA_TYPE*));
DATA_TYPE** A = (DATA_TYPE**)malloc(MAXGRID * sizeof(DATA_TYPE*));
DATA_TYPE** B = (DATA_TYPE**)malloc(MAXGRID * sizeof(DATA_TYPE*));
{
int i;
for (i = 0; i < N; ++i)
{
X[i] = (DATA_TYPE*)malloc(N * sizeof(DATA_TYPE));
A[i] = (DATA_TYPE*)malloc(N * sizeof(DATA_TYPE));
B[i] = (DATA_TYPE*)malloc(N * sizeof(DATA_TYPE));
}
}
#endif
inline
void init_array()
{
int i, j;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
{
X[i][j] = ((DATA_TYPE) i*j + 1) / N;
A[i][j] = ((DATA_TYPE) i*j + 2) / N;
B[i][j] = ((DATA_TYPE) i*j + 3) / N;
}
}
/* Define the live-out variables. Code is not executed unless
POLYBENCH_DUMP_ARRAYS is defined. */
inline
void print_array(int argc, char** argv)
{
int i, j;
#ifndef POLYBENCH_DUMP_ARRAYS
if (argc > 42 && ! strcmp(argv[0], ""))
#endif
{
for (i = 0; i < N; i++)
for (j = 0; j < N; j++) {
fprintf(stderr, DATA_PRINTF_MODIFIER, A[i][j]);
if ((i * N + j) % 80 == 20) fprintf(stderr, "\n");
}
fprintf(stderr, "\n");
}
}
#ifndef SCOP_PARAM
void scop_func() {
long n = N;
#else
void scop_func(long n) {
#endif
long t, i1, i2;
long tsteps = TSTEPS;
#pragma scop
#pragma live-out X
for (t = 0; t < tsteps; t++)
{
for (i1 = 0; i1 < n; i1++)
for (i2 = 1; i2 < n; i2++)
{
X[i1][i2] = X[i1][i2] - X[i1][i2-1] * A[i1][i2] / B[i1][i2-1];
B[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1][i2-1];
}
for (i1 = 0; i1 < n; i1++)
X[i1][n-1] = X[i1][n-1] / B[i1][n-1];
for (i1 = 0; i1 < n; i1++)
for (i2 = 0; i2 < n-2; i2++)
X[i1][n-i2-2] = (X[i1][n-2-i2] - X[i1][n-2-i2-1] * A[i1][n-i2-3]) / B[i1][n-3-i2];
for (i1 = 1; i1 < n; i1++)
for (i2 = 0; i2 < n; i2++) {
X[i1][i2] = X[i1][i2] - X[i1-1][i2] * A[i1][i2] / B[i1-1][i2];
B[i1][i2] = B[i1][i2] - A[i1][i2] * A[i1][i2] / B[i1-1][i2];
}
for (i2 = 0; i2 < n; i2++)
X[n-1][i2] = X[n-1][i2] / B[n-1][i2];
for (i1 = 0; i1 < n-2; i1++)
for (i2 = 0; i2 < n; i2++)
X[n-2-i1][i2] = (X[n-2-i1][i2] - X[n-i1-3][i2] * A[n-3-i1][i2]) / B[n-2-i1][i2];
}
#pragma endscop
}
int main(int argc, char** argv)
{
int t, i1, i2;
int n = N;
int tsteps = TSTEPS;
/* Initialize array. */
init_array();
/* Start timer. */
polybench_start_instruments;
#ifndef SCOP_PARAM
scop_func();
#else
scop_func(n);
#endif
/* Stop and print timer. */
polybench_stop_instruments;
polybench_print_instruments;
print_array(argc, argv);
return 0;
}
|
