/* [<][>][^][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 /*
31 * huge.c
32 *
33 * Tests the VM system by accessing a large array (sparse) that
34 * cannot fit into memory.
35 *
36 * When the VM system assignment is done, your system should be able
37 * to run this successfully.
38 */
39
40 #include <stdio.h>
41 #include <stdlib.h>
42
43 #define PageSize 4096
44 #define NumPages 512
45
46 int sparse[NumPages][PageSize]; /* use only the first element in the row */
47
48 int
49 main()
50 {
51 int i,j;
52
53 printf("Entering the huge program - I will stress test your VM\n");
54
55 /* move number in so that sparse[i][0]=i */
56 for (i=0; i<NumPages; i++) {
57 sparse[i][0]=i;
58 }
59
60 printf("stage [1] done\n");
61
62 /* increment each location 5 times */
63 for (j=0; j<5; j++) {
64 for (i=0; i<NumPages; i++) {
65 sparse[i][0]++;
66 }
67 printf("stage [2.%d] done\n", j);
68 }
69
70 printf("stage [2] done\n");
71
72 /* check if the numbers are sane */
73 for (i=NumPages-1; i>=0; i--) {
74 if (sparse[i][0]!=i+5) {
75 printf("BAD NEWS!!! - your VM mechanism has a bug!\n");
76 exit(1);
77 }
78 }
79
80 printf("You passed!\n");
81
82 return 0;
83 }
84