Debian Codegraph @

libgomp/testsuite/libgomp.c-c++-common/matrix-1.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 unsigned dim0, unsigned dim1)
23 {
24 memset (result, 0, sizeof (float) * dim0 * dim1);
25 DIRECTIVE
26 TRANSFORMATION1
27 for (unsigned i = 0; i < dim0; i++)
28 TRANSFORMATION2
29 for (unsigned j = 0; j < dim1; j++)
30 TRANSFORMATION3
31 for (unsigned k = 0; k < dim1; k++)
32 result[i * dim1 + j] += matrix1[i * dim1 + k] * matrix2[k * dim0 + j];
33 }
34
35 int
36 MAIN ()
37 {
38 unsigned dim0 = 20;
39 unsigned dim1 = 20;
40
41 float *result = (float *) malloc (sizeof (float) * dim0 * dim1);
42 float *matrix1 = (float *) malloc (sizeof (float) * dim0 * dim1);
43 float *matrix2 = (float *) malloc (sizeof (float) * dim0 * dim1);
44
45 for (unsigned i = 0; i < dim0; i++)
46 for (unsigned j = 0; j < dim1; j++)
47 matrix1[i * dim1 + j] = j;
48
49 for (unsigned i = 0; i < dim0; i++)
50 for (unsigned j = 0; j < dim1; j++)
51 if (i == j)
52 matrix2[i * dim1 + j] = 1;
53 else
54 matrix2[i * dim1 + j] = 0;
55
56 MULT (matrix1, matrix2, result, dim0, dim1);
57
58 for (unsigned i = 0; i < dim0; i++)
59 for (unsigned j = 0; j < dim1; j++)
60 {
61 if (matrix1[i * dim1 + j] != result[i * dim1 + j])
62 {
63 print_matrix (matrix1, dim0, dim1);
64 print_matrix (matrix2, dim0, dim1);
65 print_matrix (result, dim0, dim1);
66 fprintf (stderr, "%s: ERROR at %d, %d\n", __FUNCTION__, i, j);
67 abort ();
68 }
69 }
70
71 free (matrix2);
72 free (matrix1);
73 free (result);
74
75 return 0;
76 }
77
78 #undef DIRECTIVE
79 #undef TRANSFORMATION1
80 #undef TRANSFORMATION2
81 #undef TRANSFORMATION3
82 #undef FUN_NAME_SUFFIX