ACStone/142.array.c at master · ArchC/ACStone · GitHub

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
/**
 * @file      142.array.c
 * @author    The ArchC Team
 *            http://www.archc.org/
 *
 *            Computer Systems Laboratory (LSC)
 *            IC-UNICAMP
 *            http://www.lsc.ic.unicamp.br
 *
 * @version   1.0
 * @date      Mon, 19 Jun 2006 15:33:22 -0300
 * @brief     It is a simple main function that uses a kind of square matrix multiplication.
 *
 * @attention Copyright (C) 2002-2006 --- The ArchC Team
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */

/* The file begin.h is included if compiler flag -DBEGINCODE is used */
#ifdef BEGINCODE
#include "begin.h"
#endif

int main() {

  signed long long int a[10][10];
  signed long long int b[10][10];
  signed long long int c[10][10];

  unsigned char i,j,k;

  unsigned char error=0;

  for(i=0 ; i<10 ; i++) /* A = I */
    for(j=0 ; j<10 ; j++) {
      if(i==j)
	a[i][j]=1;
      else
	a[i][j]=0;
    }

  for(i=0 ; i<10 ; i++) /* B = X */
    for(j=0 ; j<10 ; j++)
      b[i][j]=((signed long long int)i+(signed long long int)j);

  for(i=0 ; i<10 ; i++) /* C = 0 */
    for(j=0 ; j<10 ; j++)
      c[i][j]=0;

  for(i=0 ; i<10 ; i++) /* C = A . B */
    for(j=0 ; j<10 ; j++)
      for(k=0 ; k<10 ; k++)
	c[i][j]=c[i][j]+(a[i][k]*b[k][j]);

  for(i=0 ; i<10 ; i++) /* B = C ? */
    for(j=0 ; j<10 ; j++)
      if(b[i][j] != c[i][j])
	error=1;

  /* Before error must be 0 */ error=0;

  return 0;
  /* Return 0 only */
}

/* The file end.h is included if compiler flag -DENDCODE is used */
#ifdef ENDCODE
#include "end.h"
#endif