|
|
Net/2
/*
* Sequential page access benchmark.
*/
#include <sys/vadvise.h>
char *valloc();
main(argc, argv)
char *argv[];
{
register i, niter;
register char *pf, *lastpage;
int npages = 4096, pagesize, vflag = 0;
char *pages, *name;
name = argv[0];
argc--, argv++;
again:
if (argc < 1) {
usage:
printf("usage: %s [ -v ] [ -p #pages ] niter\n", name);
exit(1);
}
if (strcmp(*argv, "-p") == 0) {
argc--, argv++;
if (argc < 1)
goto usage;
npages = atoi(*argv);
if (npages <= 0) {
printf("%s: Bad page count.\n", *argv);
exit(2);
}
argc--, argv++;
goto again;
}
if (strcmp(*argv, "-v") == 0) {
argc--, argv++;
vflag++;
goto again;
}
niter = atoi(*argv);
pagesize = getpagesize();
pages = valloc(npages * pagesize);
if (pages == (char *)0) {
printf("Can't allocate %d pages (%2.1f megabytes).\n",
npages, (npages * pagesize) / (1024. * 1024.));
exit(3);
}
lastpage = pages + (npages * pagesize);
if (vflag)
vadvise(VA_SEQL);
for (i = 0; i < niter; i++)
for (pf = pages; pf < lastpage; pf += pagesize)
*pf = 1;
}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.