Debian Codegraph @

libgomp/testsuite/libgomp.c-c++-common/matrix-constant-iter.h

raw
1 #include <stdlib.h>
2 #include <string.h>
3 #include <stdio.h>
4 #include <math.h>
5
6 #ifndef FUN_NAME_SUFFIX
7 #define FUN_NAME_SUFFIX
8 #endif
9
10 #ifdef MULT
11 #undef MULT
12 #endif
13 #define MULT CAT(mult, FUN_NAME_SUFFIX)
14
15 #ifdef MAIN
16 #undef MAIN
17 #endif
18 #define MAIN CAT(main, FUN_NAME_SUFFIX)
19
20 void
21 MULT (float *matrix1, float *matrix2, float *result)
22 {
23 const unsigned dim0 = 20;
24 const unsigned dim1 = 20;
25
26 memset (result, 0, sizeof (float) * dim0 * dim1);
27 DIRECTIVE
28 TRANSFORMATION1
29 for (unsigned i = 0; i < dim0; i++)
30 TRANSFORMATION2
31 for (unsigned j = 0; j < dim1; j++)
32 TRANSFORMATION3
33 for (unsigned k = 0; k < dim1; k++)
34 result[i * dim1 + j] += matrix1[i * dim1 + k] * matrix2[k * dim0 + j];
35 }
36
37 int
38 MAIN ()
39 {
40 const unsigned dim0 = 20;
41 const unsigned dim1 = 20;
42
43 float *result = (float *) malloc (sizeof (float) * dim0 * dim1);
44 float *matrix1 = (float *) malloc (sizeof (float) * dim0 * dim1);
45 float *matrix2 = (float *) malloc (sizeof (float) * dim0 * dim1);
46
47 for (unsigned i = 0; i < dim0; i++)
48 for (unsigned j = 0; j < dim1; j++)
49 matrix1[i * dim1 + j] = j;
50
51 for (unsigned i = 0; i < dim0; i++)
52 for (unsigned j = 0; j < dim1; j++)
53 if (i == j)
54 matrix2[i * dim1 + j] = 1;
55 else
56 matrix2[i * dim1 + j] = 0;
57
58 MULT (matrix1, matrix2, result);
59
60 for (unsigned i = 0; i < dim0; i++)
61 for (unsigned j = 0; j < dim1; j++)
62 {
63 if (matrix1[i * dim1 + j] != result[i * dim1 + j])
64 {
65 printf ("%s: error at %d, %d\n", __FUNCTION__, i, j);
66 print_matrix (matrix1, dim0, dim1);
67 print_matrix (matrix2, dim0, dim1);
68 print_matrix (result, dim0, dim1);
69 printf ("\n");
70 abort ();
71 }
72 }
73
74 free (matrix2);
75 free (matrix1);
76 free (result);
77
78 return 0;
79 }
80
81 #undef DIRECTIVE
82 #undef TRANSFORMATION1
83 #undef TRANSFORMATION2
84 #undef TRANSFORMATION3
85 #undef FUN_NAME_SUFFIX