/* [<][>][^][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-orig.c
31 * Test program to do matrix multiplication on large arrays.
32 *
33 * Intended to stress virtual memory system.
34 *
35 * This is the original CS161 matmult program. Unfortunately,
36 * because matrix multiplication is order N^2 in space and N^3 in
37 * time, when this is made large enough to be an interesting VM
38 * test, it becomes so large that it takes hours to run.
39 *
40 * So you probably want to just run matmult, which has been
41 * gimmicked up to be order N^3 in space and thus have a tolerable
42 * running time. This version is provided for reference only.
43 *
44 * Once the VM assignment is complete your system should be able to
45 * survive this, if you have the patience to run it.
46 */
47
48 #include <unistd.h>
49 #include <stdio.h>
50
51 #define Dim 360 /* sum total of the arrays doesn't fit in
52 * physical memory
53 */
54
55 #define RIGHT 46397160 /* correct answer */
56
57 int A[Dim][Dim];
58 int B[Dim][Dim];
59 int C[Dim][Dim];
60
61 int
62 main()
63 {
64 int i, j, k, r;
65
66 for (i = 0; i < Dim; i++) /* first initialize the matrices */
67 for (j = 0; j < Dim; j++) {
68 A[i][j] = i;
69 B[i][j] = j;
70 C[i][j] = 0;
71 }
72
73 for (i = 0; i < Dim; i++) /* then multiply them together */
74 for (j = 0; j < Dim; j++)
75 for (k = 0; k < Dim; k++)
76 C[i][j] += A[i][k] * B[k][j];
77
78 printf("matmult-orig finished.\n");
79 r = C[Dim-1][Dim-1];
80 printf("answer is: %d (should be %d)\n", r, RIGHT);
81 if (r != RIGHT) {
82 printf("FAILED\n");
83 }
84 else {
85 printf("Passed.\n");
86 }
87 return 0;
88 }