153c0267b6
more periodic progress in some cases due to the large slow down that happens when swapping is implemented (ASST3.3).
93 lines
2.8 KiB
C
93 lines
2.8 KiB
C
/*
|
|
* Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
|
|
* The President and Fellows of Harvard College.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* huge.c
|
|
*
|
|
* Tests the VM system by accessing a large array (sparse) that
|
|
* cannot fit into memory.
|
|
*
|
|
* When the VM system assignment is done, your system should be able
|
|
* to run this successfully.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <test161/test161.h>
|
|
#include <test/test.h>
|
|
|
|
#define PageSize 4096
|
|
#define NumPages 512
|
|
|
|
int sparse[NumPages][PageSize]; /* use only the first element in the row */
|
|
|
|
#define PROGRESS_INTERVAL 20
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i,j;
|
|
|
|
tprintf("Entering the huge program - I will stress test your VM\n");
|
|
|
|
/* move number in so that sparse[i][0]=i */
|
|
for (i=0; i<NumPages; i++) {
|
|
TEST161_LPROGRESS_N(i, PROGRESS_INTERVAL);
|
|
sparse[i][0]=i;
|
|
}
|
|
|
|
lsay("\nstage [1] done\n");
|
|
|
|
/* increment each location 5 times */
|
|
for (j=0; j<5; j++) {
|
|
for (i=0; i<NumPages; i++) {
|
|
TEST161_LPROGRESS_N(i, PROGRESS_INTERVAL);
|
|
sparse[i][0]++;
|
|
}
|
|
lsay("\nstage [2.%d] done\n", j);
|
|
}
|
|
|
|
lsay("\nstage [2] done\n");
|
|
|
|
/* check if the numbers are sane */
|
|
for (i=NumPages-1; i>=0; i--) {
|
|
TEST161_LPROGRESS_N(i, PROGRESS_INTERVAL);
|
|
if (sparse[i][0]!=i+5) {
|
|
lsay("BAD NEWS!!! - your VM mechanism has a bug!\n");
|
|
success(TEST161_FAIL, SECRET, "/testbin/huge");
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
success(TEST161_SUCCESS, SECRET, "/testbin/huge");
|
|
|
|
return 0;
|
|
}
|
|
|