/* [<][>][^][v][top][bottom][index][help] */
DEFINITIONS
This source file includes following definitions.
- main
1 /*
2 * Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
3 * The President and Fellows of Harvard College.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30 /* matmult.c
31 * Test program to do matrix multiplication on large arrays.
32 *
33 * This version uses a storage-inefficient technique to get a
34 * shorter running time for the same memory usage.
35 *
36 * Intended to stress virtual memory system.
37 *
38 * Once the VM system assignment is complete your system should be
39 * able to survive this.
40 */
41
42 #include <unistd.h>
43 #include <stdio.h>
44
45 #define Dim 72 /* sum total of the arrays doesn't fit in
46 * physical memory
47 */
48
49 #define RIGHT 8772192 /* correct answer */
50
51 int A[Dim][Dim];
52 int B[Dim][Dim];
53 int C[Dim][Dim];
54 int T[Dim][Dim][Dim];
55
56 int
57 main()
58 {
59 int i, j, k, r;
60
61 for (i = 0; i < Dim; i++) /* first initialize the matrices */
62 for (j = 0; j < Dim; j++) {
63 A[i][j] = i;
64 B[i][j] = j;
65 C[i][j] = 0;
66 }
67
68 for (i = 0; i < Dim; i++) /* then multiply them together */
69 for (j = 0; j < Dim; j++)
70 for (k = 0; k < Dim; k++)
71 T[i][j][k] = A[i][k] * B[k][j];
72
73 for (i = 0; i < Dim; i++)
74 for (j = 0; j < Dim; j++)
75 for (k = 0; k < Dim; k++)
76 C[i][j] += T[i][j][k];
77
78 r = 0;
79 for (i = 0; i < Dim; i++)
80 r += C[i][i];
81
82 printf("matmult finished.\n");
83 printf("answer is: %d (should be %d)\n", r, RIGHT);
84 if (r != RIGHT) {
85 printf("FAILED\n");
86 return 1;
87 }
88 printf("Passed.\n");
89 return 0;
90 }