xref: /freebsd/share/doc/papers/sysperf/appendix.ms (revision 9a14aa017b21c292740c00ee098195cd46642730) 
 $FreeBSD$
.am vS
..
.am vE
..
'ss 23
'ds _ \d-\u
'ps 9z
'vs 10p
'ds - -
'ds / \\h'\\w' 'u-\\w'/'u'/
'ds /* \\h'\\w' 'u-\\w'/'u'/*
'bd B 3
'bd S B 3
'nr cm 0
'nf
'de vH
'ev 2
'ft 1
'sp .35i
'tl '\s14\f3\\*(=F\s0'\\*(=H'\f3\s14\\*(=F\s0'
'sp .25i
'ft 1
\f2\s12\h'\\n(.lu-\w'\\*(=f'u'\\*(=f\s0\h'|0u'
'ev
'ds =G \\*(=F
..
'de vF
'ev 2
'sp .35i
'ie o 'tl '\f2\\*(=M''Page % of \\*(=G'
'el 'tl '\f2Page % of \\*(=G''\\*(=M'
'bp
'ev
'ft 1
'if \\n(cm=1 'ft 2
..
'de ()
'pn 1
..
'de +C
'nr cm 1
'ft 2
'ds +K
'ds -K
..
'de -C
'nr cm 0
'ft 1
'ds +K \f3
'ds -K 
..
'+C
'-C
'am +C
'ne 3
..
'de FN
\f2\s14\h'\\n(.lu-\w'\\$1'u'\\$1\s0\h'|0u'\c
'ds =f ...\\$1
..
'de FC
'ds =f ...\\$1
..
'de -F
'rm =f
..
'ft 1
'lg 0
'-F
 Copyright (c) 1985 The Regents of the University of California.
 All rights reserved.

 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. All advertising materials mentioning features or use of this software
 must display the following acknowledgement:
 This product includes software developed by the University of
 California, Berkeley and its contributors.
 4. 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 REGENTS 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 REGENTS 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.

 @(#)a1.t 5.1 (Berkeley) 4/17/91

.nr H2 1

..


..
.bp

\s+2Appendix A - Benchmark sources\s-2


The programs shown here run under 4.2 with only routines
from the standard libraries. When run under 4.1 they were augmented
with a getpagesize routine and a copy of the random
function from the C library. The vforks and vexecs
programs are constructed from the forks and execs programs,
respectively, by substituting calls to fork with calls to
vfork.

syscall


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * System call overhead benchmark.
 *\h'\w' 'u-\w'/'u'/\c
'-C

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K ncalls;

\h'|11n'\*(+Kif\*(-K (argc < 2) \*(+K{\*(-K
\h'|21n'printf("usage: %s #syscalls\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'ncalls = atoi(argv[1]);
\h'|11n'\*(+Kwhile\*(-K (ncalls\*-\*- > 0)
\h'|21n'(\*(+Kvoid\*(-K) getpid();
\*(+K}\*(-K\c\c
'-F

.vE

csw


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Context switching benchmark.
 *
 * Force system to context switch 2*nsigs
 * times by forking and exchanging signals.
 * To calculate system overhead for a context
 * switch, the signocsw program must be run
 * with nsigs. Overhead is then estimated by
 *\h'|11n't1 = time csw <n>
 *\h'|11n't2 = time signocsw <n>
 *\h'|11n'overhead = t1 \*- 2 * t2;
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K#include\*(-K <signal.h>

\*(+Kint\*(-K\h'|11n'sigsub();
\*(+Kint\*(-K\h'|11n'otherpid;
\*(+Kint\*(-K\h'|11n'nsigs;

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kint\*(-K pid;

\h'|11n'\*(+Kif\*(-K (argc < 2) \*(+K{\*(-K
\h'|21n'printf("usage: %s nsignals\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'nsigs = atoi(argv[1]);
\h'|11n'signal(SIGALRM, sigsub);
\h'|11n'otherpid = getpid();
\h'|11n'pid = fork();
\h'|11n'\*(+Kif\*(-K (pid != 0) \*(+K{\*(-K
\h'|21n'otherpid = pid;
\h'|21n'kill(otherpid, SIGALRM);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kfor\*(-K (;;)
\h'|21n'sigpause(0);
\*(+K}\*(-K\c\c
'-F


'FN sigsub
sigsub()
\*(+K{\*(-K

\h'|11n'signal(SIGALRM, sigsub);
\h'|11n'kill(otherpid, SIGALRM);
\h'|11n'\*(+Kif\*(-K (\*-\*-nsigs <= 0)
\h'|21n'exit(0);
\*(+K}\*(-K\c\c
'-F

.vE

signocsw


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Signal without context switch benchmark.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K#include\*(-K <signal.h>

\*(+Kint\*(-K\h'|11n'pid;
\*(+Kint\*(-K\h'|11n'nsigs;
\*(+Kint\*(-K\h'|11n'sigsub();

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K i;

\h'|11n'\*(+Kif\*(-K (argc < 2) \*(+K{\*(-K
\h'|21n'printf("usage: %s nsignals\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'nsigs = atoi(argv[1]);
\h'|11n'signal(SIGALRM, sigsub);
\h'|11n'pid = getpid();
\h'|11n'\*(+Kfor\*(-K (i = 0; i < nsigs; i++)
\h'|21n'kill(pid, SIGALRM);
\*(+K}\*(-K\c\c
'-F


'FN sigsub
sigsub()
\*(+K{\*(-K

\h'|11n'signal(SIGALRM, sigsub);
\*(+K}\*(-K\c\c
'-F

.vE

pipeself


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * IPC benchmark,
 * write to self using pipes.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kchar\*(-K buf[512];
\h'|11n'\*(+Kint\*(-K fd[2], msgsize;
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K i, iter;

\h'|11n'\*(+Kif\*(-K (argc < 3) \*(+K{\*(-K
\h'|21n'printf("usage: %s iterations message\*-size\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'argc\*-\*-, argv++;
\h'|11n'iter = atoi(*argv);
\h'|11n'argc\*-\*-, argv++;
\h'|11n'msgsize = atoi(*argv);
\h'|11n'\*(+Kif\*(-K (msgsize > \*(+Ksizeof\*(-K (buf) || msgsize <= 0) \*(+K{\*(-K
\h'|21n'printf("%s: Bad message size.\en", *argv);
\h'|21n'exit(2);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (pipe(fd) < 0) \*(+K{\*(-K
\h'|21n'perror("pipe");
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kfor\*(-K (i = 0; i < iter; i++) \*(+K{\*(-K
\h'|21n'write(fd[1], buf, msgsize);
\h'|21n'read(fd[0], buf, msgsize);
\h'|11n'\*(+K}\*(-K
\*(+K}\*(-K\c\c
'-F

.vE

pipediscard


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * IPC benchmarkl,
 * write and discard using pipes.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kchar\*(-K buf[512];
\h'|11n'\*(+Kint\*(-K fd[2], msgsize;
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K i, iter;

\h'|11n'\*(+Kif\*(-K (argc < 3) \*(+K{\*(-K
\h'|21n'printf("usage: %s iterations message\*-size\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'argc\*-\*-, argv++;
\h'|11n'iter = atoi(*argv);
\h'|11n'argc\*-\*-, argv++;
\h'|11n'msgsize = atoi(*argv);
\h'|11n'\*(+Kif\*(-K (msgsize > \*(+Ksizeof\*(-K (buf) || msgsize <= 0) \*(+K{\*(-K
\h'|21n'printf("%s: Bad message size.\en", *argv);
\h'|21n'exit(2);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (pipe(fd) < 0) \*(+K{\*(-K
\h'|21n'perror("pipe");
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (fork() == 0)
\h'|21n'\*(+Kfor\*(-K (i = 0; i < iter; i++)
\h'|31n'read(fd[0], buf, msgsize);
\h'|11n'\*(+Kelse\*(-K
\h'|21n'\*(+Kfor\*(-K (i = 0; i < iter; i++)
\h'|31n'write(fd[1], buf, msgsize);
\*(+K}\*(-K\c\c
'-F

.vE

pipeback


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * IPC benchmark,
 * read and reply using pipes.
 *
 * Process forks and exchanges messages
 * over a pipe in a request\*-response fashion.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kchar\*(-K buf[512];
\h'|11n'\*(+Kint\*(-K fd[2], fd2[2], msgsize;
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K i, iter;

\h'|11n'\*(+Kif\*(-K (argc < 3) \*(+K{\*(-K
\h'|21n'printf("usage: %s iterations message\*-size\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'argc\*-\*-, argv++;
\h'|11n'iter = atoi(*argv);
\h'|11n'argc\*-\*-, argv++;
\h'|11n'msgsize = atoi(*argv);
\h'|11n'\*(+Kif\*(-K (msgsize > \*(+Ksizeof\*(-K (buf) || msgsize <= 0) \*(+K{\*(-K
\h'|21n'printf("%s: Bad message size.\en", *argv);
\h'|21n'exit(2);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (pipe(fd) < 0) \*(+K{\*(-K
\h'|21n'perror("pipe");
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (pipe(fd2) < 0) \*(+K{\*(-K
\h'|21n'perror("pipe");
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (fork() == 0)
\h'|21n'\*(+Kfor\*(-K (i = 0; i < iter; i++) \*(+K{\*(-K
\h'|31n'read(fd[0], buf, msgsize);
\h'|31n'write(fd2[1], buf, msgsize);
\h'|21n'\*(+K}\*(-K
\h'|11n'\*(+Kelse\*(-K
\h'|21n'\*(+Kfor\*(-K (i = 0; i < iter; i++) \*(+K{\*(-K
\h'|31n'write(fd[1], buf, msgsize);
\h'|31n'read(fd2[0], buf, msgsize);
\h'|21n'\*(+K}\*(-K
\*(+K}\*(-K\c\c
'-F

.vE

forks


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Benchmark program to calculate fork+wait
 * overhead (approximately). Process
 * forks and exits while parent waits.
 * The time to run this program is used
 * in calculating exec overhead.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K nforks, i;
\h'|11n'\*(+Kchar\*(-K *cp;
\h'|11n'\*(+Kint\*(-K pid, child, status, brksize;

\h'|11n'\*(+Kif\*(-K (argc < 2) \*(+K{\*(-K
\h'|21n'printf("usage: %s number\*-of\*-forks sbrk\*-size\en", argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'nforks = atoi(argv[1]);
\h'|11n'\*(+Kif\*(-K (nforks < 0) \*(+K{\*(-K
\h'|21n'printf("%s: bad number of forks\en", argv[1]);
\h'|21n'exit(2);
\h'|11n'\*(+K}\*(-K
\h'|11n'brksize = atoi(argv[2]);
\h'|11n'\*(+Kif\*(-K (brksize < 0) \*(+K{\*(-K
\h'|21n'printf("%s: bad size to sbrk\en", argv[2]);
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'cp = (\*(+Kchar\*(-K *)sbrk(brksize);
\h'|11n'\*(+Kif\*(-K ((\*(+Kint\*(-K)cp == \*-1) \*(+K{\*(-K
\h'|21n'perror("sbrk");
\h'|21n'exit(4);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kfor\*(-K (i = 0; i < brksize; i += 1024)
\h'|21n'cp[i] = i;
\h'|11n'\*(+Kwhile\*(-K (nforks\*-\*- > 0) \*(+K{\*(-K
\h'|21n'child = fork();
\h'|21n'\*(+Kif\*(-K (child == \*-1) \*(+K{\*(-K
\h'|31n'perror("fork");
\h'|31n'exit(\*-1);
\h'|21n'\*(+K}\*(-K
\h'|21n'\*(+Kif\*(-K (child == 0)
\h'|31n'\*_exit(\*-1);
\h'|21n'\*(+Kwhile\*(-K ((pid = wait(&status)) != \*-1 && pid != child)
\h'|31n';
\h'|11n'\*(+K}\*(-K
\h'|11n'exit(0);
\*(+K}\*(-K\c\c
'-F

.vE

execs


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Benchmark program to calculate exec
 * overhead (approximately). Process
 * forks and execs "null" test program.
 * The time to run the fork program should
 * then be deducted from this one to
 * estimate the overhead for the exec.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K nexecs, i;
\h'|11n'\*(+Kchar\*(-K *cp, *sbrk();
\h'|11n'\*(+Kint\*(-K pid, child, status, brksize;

\h'|11n'\*(+Kif\*(-K (argc < 3) \*(+K{\*(-K
\h'|21n'printf("usage: %s number\*-of\*-execs sbrk\*-size job\*-name\en",
\h'|21n' argv[0]);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'nexecs = atoi(argv[1]);
\h'|11n'\*(+Kif\*(-K (nexecs < 0) \*(+K{\*(-K
\h'|21n'printf("%s: bad number of execs\en", argv[1]);
\h'|21n'exit(2);
\h'|11n'\*(+K}\*(-K
\h'|11n'brksize = atoi(argv[2]);
\h'|11n'\*(+Kif\*(-K (brksize < 0) \*(+K{\*(-K
\h'|21n'printf("%s: bad size to sbrk\en", argv[2]);
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'cp = sbrk(brksize);
\h'|11n'\*(+Kif\*(-K ((\*(+Kint\*(-K)cp == \*-1) \*(+K{\*(-K
\h'|21n'perror("sbrk");
\h'|21n'exit(4);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kfor\*(-K (i = 0; i < brksize; i += 1024)
\h'|21n'cp[i] = i;
\h'|11n'\*(+Kwhile\*(-K (nexecs\*-\*- > 0) \*(+K{\*(-K
\h'|21n'child = fork();
\h'|21n'\*(+Kif\*(-K (child == \*-1) \*(+K{\*(-K
\h'|31n'perror("fork");
\h'|31n'exit(\*-1);
\h'|21n'\*(+K}\*(-K
\h'|21n'\*(+Kif\*(-K (child == 0) \*(+K{\*(-K
\h'|31n'execv(argv[3], argv);
\h'|31n'perror("execv");
\h'|31n'\*_exit(\*-1);
\h'|21n'\*(+K}\*(-K
\h'|21n'\*(+Kwhile\*(-K ((pid = wait(&status)) != \*-1 && pid != child)
\h'|31n';
\h'|11n'\*(+K}\*(-K
\h'|11n'exit(0);
\*(+K}\*(-K\c\c
'-F

.vE

nulljob


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Benchmark "null job" program.
 *\h'\w' 'u-\w'/'u'/\c
'-C


'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K

\h'|11n'exit(0);
\*(+K}\*(-K\c\c
'-F

.vE

bigjob


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Benchmark "null big job" program.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\h'\w' 'u-\w'/'u'/*\c\c
'+C
 250 here is intended to approximate vi\'s text+data size *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+Kchar\*(-K\h'|11n'space[1024 * 250] = "force into data segment";

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K

\h'|11n'exit(0);
\*(+K}\*(-K\c\c
'-F

.vE
.bp

seqpage


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Sequential page access benchmark.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K#include\*(-K <sys\h'\w' 'u-\w'/'u'/vadvise.h>

\*(+Kchar\*(-K\h'|11n'*valloc();

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K i, niter;
\h'|11n'\*(+Kregister\*(-K \*(+Kchar\*(-K *pf, *lastpage;
\h'|11n'\*(+Kint\*(-K npages = 4096, pagesize, vflag = 0;
\h'|11n'\*(+Kchar\*(-K *pages, *name;

\h'|11n'name = argv[0];
\h'|11n'argc\*-\*-, argv++;
again:
\h'|11n'\*(+Kif\*(-K (argc < 1) \*(+K{\*(-K
usage:
\h'|21n'printf("usage: %s [ \*-v ] [ \*-p #pages ] niter\en", name);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-p") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kif\*(-K (argc < 1)
\h'|31n'\*(+Kgoto\*(-K usage;
\h'|21n'npages = atoi(*argv);
\h'|21n'\*(+Kif\*(-K (npages <= 0) \*(+K{\*(-K
\h'|31n'printf("%s: Bad page count.\en", *argv);
\h'|31n'exit(2);
\h'|21n'\*(+K}\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-v") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'vflag++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'niter = atoi(*argv);
\h'|11n'pagesize = getpagesize();
\h'|11n'pages = valloc(npages * pagesize);
\h'|11n'\*(+Kif\*(-K (pages == (\*(+Kchar\*(-K *)0) \*(+K{\*(-K
\h'|21n'printf("Can\'t allocate %d pages (%2.1f megabytes).\en",
\h'|21n' npages, (npages * pagesize) \h'\w' 'u-\w'/'u'/ (1024. * 1024.));
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'lastpage = pages + (npages * pagesize);
\h'|11n'\*(+Kif\*(-K (vflag)
\h'|21n'vadvise(VA\*_SEQL);
\h'|11n'\*(+Kfor\*(-K (i = 0; i < niter; i++)
\h'|21n'\*(+Kfor\*(-K (pf = pages; pf < lastpage; pf += pagesize)
\h'|31n'*pf = 1;
\*(+K}\*(-K\c\c
'-F

.vE

randpage


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Random page access benchmark.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K#include\*(-K <sys\h'\w' 'u-\w'/'u'/vadvise.h>

\*(+Kchar\*(-K\h'|11n'*valloc();
\*(+Kint\*(-K\h'|11n'rand();

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K npages = 4096, pagesize, pn, i, niter;
\h'|11n'\*(+Kint\*(-K vflag = 0, debug = 0;
\h'|11n'\*(+Kchar\*(-K *pages, *name;

\h'|11n'name = argv[0];
\h'|11n'argc\*-\*-, argv++;
again:
\h'|11n'\*(+Kif\*(-K (argc < 1) \*(+K{\*(-K
usage:
\h'|21n'printf("usage: %s [ \*-d ] [ \*-v ] [ \*-p #pages ] niter\en", name);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-p") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kif\*(-K (argc < 1)
\h'|31n'\*(+Kgoto\*(-K usage;
\h'|21n'npages = atoi(*argv);
\h'|21n'\*(+Kif\*(-K (npages <= 0) \*(+K{\*(-K
\h'|31n'printf("%s: Bad page count.\en", *argv);
\h'|31n'exit(2);
\h'|21n'\*(+K}\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-v") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'vflag++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-d") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'debug++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'niter = atoi(*argv);
\h'|11n'pagesize = getpagesize();
\h'|11n'pages = valloc(npages * pagesize);
\h'|11n'\*(+Kif\*(-K (pages == (\*(+Kchar\*(-K *)0) \*(+K{\*(-K
\h'|21n'printf("Can\'t allocate %d pages (%2.1f megabytes).\en",
\h'|21n' npages, (npages * pagesize) \h'\w' 'u-\w'/'u'/ (1024. * 1024.));
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (vflag)
\h'|21n'vadvise(VA\*_ANOM);
\h'|11n'\*(+Kfor\*(-K (i = 0; i < niter; i++) \*(+K{\*(-K
\h'|21n'pn = random() % npages;
\h'|21n'\*(+Kif\*(-K (debug)
\h'|31n'printf("touch page %d\en", pn);
\h'|21n'pages[pagesize * pn] = 1;
\h'|11n'\*(+K}\*(-K
\*(+K}\*(-K\c\c
'-F

.vE

gausspage


.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Random page access with
 * a gaussian distribution.
 *
 * Allocate a large (zero fill on demand) address
 * space and fault the pages in a random gaussian
 * order.
 *\h'\w' 'u-\w'/'u'/\c
'-C


\*(+Kfloat\*(-K\h'|11n'sqrt(), log(), rnd(), cos(), gauss();
\*(+Kchar\*(-K\h'|11n'*valloc();
\*(+Kint\*(-K\h'|11n'rand();

'FN main
main(argc, argv)
\h'|11n'\*(+Kchar\*(-K *argv[];
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kint\*(-K pn, i, niter, delta;
\h'|11n'\*(+Kregister\*(-K \*(+Kchar\*(-K *pages;
\h'|11n'\*(+Kfloat\*(-K sd = 10.0;
\h'|11n'\*(+Kint\*(-K npages = 4096, pagesize, debug = 0;
\h'|11n'\*(+Kchar\*(-K *name;

\h'|11n'name = argv[0];
\h'|11n'argc\*-\*-, argv++;
again:
\h'|11n'\*(+Kif\*(-K (argc < 1) \*(+K{\*(-K
usage:
\h'|21n'printf(
"usage: %s [ \*-d ] [ \*-p #pages ] [ \*-s standard\*-deviation ] iterations\en", name);
\h'|21n'exit(1);
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-s") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kif\*(-K (argc < 1)
\h'|31n'\*(+Kgoto\*(-K usage;
\h'|21n'sscanf(*argv, "%f", &sd);
\h'|21n'\*(+Kif\*(-K (sd <= 0) \*(+K{\*(-K
\h'|31n'printf("%s: Bad standard deviation.\en", *argv);
\h'|31n'exit(2);
\h'|21n'\*(+K}\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-p") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kif\*(-K (argc < 1)
\h'|31n'\*(+Kgoto\*(-K usage;
\h'|21n'npages = atoi(*argv);
\h'|21n'\*(+Kif\*(-K (npages <= 0) \*(+K{\*(-K
\h'|31n'printf("%s: Bad page count.\en", *argv);
\h'|31n'exit(2);
\h'|21n'\*(+K}\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'\*(+Kif\*(-K (strcmp(*argv, "\*-d") == 0) \*(+K{\*(-K
\h'|21n'argc\*-\*-, argv++;
\h'|21n'debug++;
\h'|21n'\*(+Kgoto\*(-K again;
\h'|11n'\*(+K}\*(-K
\h'|11n'niter = atoi(*argv);
\h'|11n'pagesize = getpagesize();
\h'|11n'pages = valloc(npages*pagesize);
\h'|11n'\*(+Kif\*(-K (pages == (\*(+Kchar\*(-K *)0) \*(+K{\*(-K
\h'|21n'printf("Can\'t allocate %d pages (%2.1f megabytes).\en",
\h'|21n' npages, (npages*pagesize) \h'\w' 'u-\w'/'u'/ (1024. * 1024.));
\h'|21n'exit(3);
\h'|11n'\*(+K}\*(-K
\h'|11n'pn = 0;
\h'|11n'\*(+Kfor\*(-K (i = 0; i < niter; i++) \*(+K{\*(-K
\h'|21n'delta = gauss(sd, 0.0);
\h'|21n'\*(+Kwhile\*(-K (pn + delta < 0 || pn + delta > npages)
\h'|31n'delta = gauss(sd, 0.0);
\h'|21n'pn += delta;
\h'|21n'\*(+Kif\*(-K (debug)
\h'|31n'printf("touch page %d\en", pn);
\h'|21n'\*(+Kelse\*(-K
\h'|31n'pages[pn * pagesize] = 1;
\h'|11n'\*(+K}\*(-K
\*(+K}\*(-K\c\c
'-F


\*(+Kfloat\*(-K
'FN gauss
gauss(sd, mean)
\h'|11n'\*(+Kfloat\*(-K sd, mean;
\*(+K{\*(-K
\h'|11n'\*(+Kregister\*(-K \*(+Kfloat\*(-K qa, qb;

\h'|11n'qa = sqrt(log(rnd()) * \*-2.0);
\h'|11n'qb = 3.14159 * rnd();
\h'|11n'\*(+Kreturn\*(-K (qa * cos(qb) * sd + mean);
\*(+K}\*(-K\c\c
'-F


\*(+Kfloat\*(-K
'FN rnd
rnd()
\*(+K{\*(-K
\h'|11n'\*(+Kstatic\*(-K \*(+Kint\*(-K seed = 1;
\h'|11n'\*(+Kstatic\*(-K \*(+Kint\*(-K biggest = 0x7fffffff;

\h'|11n'\*(+Kreturn\*(-K ((\*(+Kfloat\*(-K)rand(seed) \h'\w' 'u-\w'/'u'/ (\*(+Kfloat\*(-K)biggest);
\*(+K}\*(-K\c\c
'-F

.vE
'-F
 $FreeBSD$
.am vS
..
.am vE
..
'ss 23
'ds _ \d-\u
'ps 9z
'vs 10p
'ds - -
'ds / \\h'\\w' 'u-\\w'/'u'/
'ds /* \\h'\\w' 'u-\\w'/'u'/*
'bd B 3
'bd S B 3
'nr cm 0
'nf
'de vH
'ev 2
'ft 1
'sp .35i
'tl '\s14\f3\\*(=F\s0'\\*(=H'\f3\s14\\*(=F\s0'
'sp .25i
'ft 1
\f2\s12\h'\\n(.lu-\w'\\*(=f'u'\\*(=f\s0\h'|0u'
'ev
'ds =G \\*(=F
..
'de vF
'ev 2
'sp .35i
'ie o 'tl '\f2\\*(=M''Page % of \\*(=G'
'el 'tl '\f2Page % of \\*(=G''\\*(=M'
'bp
'ev
'ft 1
'if \\n(cm=1 'ft 2
..
'de ()
'pn 1
..
'de +C
'nr cm 1
'ft 2
'ds +K
'ds -K
..
'de -C
'nr cm 0
'ft 1
'ds +K \f3
'ds -K 
..
'+C
'-C
'am +C
'ne 3
..
'de FN
\f2\s14\h'\\n(.lu-\w'\\$1'u'\\$1\s0\h'|0u'\c
'ds =f ...\\$1
..
'de FC
'ds =f ...\\$1
..
'de -F
'rm =f
..
'ft 1
'lg 0
'-F
 Copyright (c) 1985 The Regents of the University of California.
 All rights reserved.

 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. All advertising materials mentioning features or use of this software
 must display the following acknowledgement:
 This product includes software developed by the University of
 California, Berkeley and its contributors.
 4. 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 REGENTS 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 REGENTS 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.

 @(#)a2.t 5.1 (Berkeley) 4/17/91

run (shell script)


.vS
\*(+K#\*(-K! \h'\w' 'u-\w'/'u'/bin\h'\w' 'u-\w'/'u'/csh \*-fx
\*(+K#\*(-K Script to run benchmark programs.
\*(+K#\*(-K
date
make clean; time make
time syscall 100000
time seqpage \*-p 7500 10
time seqpage \*-v \*-p 7500 10
time randpage \*-p 7500 30000
time randpage \*-v \*-p 7500 30000
time gausspage \*-p 7500 \*-s 1 30000
time gausspage \*-p 7500 \*-s 10 30000
time gausspage \*-p 7500 \*-s 30 30000
time gausspage \*-p 7500 \*-s 40 30000
time gausspage \*-p 7500 \*-s 50 30000
time gausspage \*-p 7500 \*-s 60 30000
time gausspage \*-p 7500 \*-s 80 30000
time gausspage \*-p 7500 \*-s 10000 30000
time csw 10000
time signocsw 10000
time pipeself 10000 512
time pipeself 10000 4
time udgself 10000 512
time udgself 10000 4
time pipediscard 10000 512
time pipediscard 10000 4
time udgdiscard 10000 512
time udgdiscard 10000 4
time pipeback 10000 512
time pipeback 10000 4
time udgback 10000 512
time udgback 10000 4
size forks
time forks 1000 0
time forks 1000 1024
time forks 1000 102400
size vforks
time vforks 1000 0
time vforks 1000 1024
time vforks 1000 102400
countenv
size nulljob
time execs 1000 0 nulljob
time execs 1000 1024 nulljob
time execs 1000 102400 nulljob
time vexecs 1000 0 nulljob
time vexecs 1000 1024 nulljob
time vexecs 1000 102400 nulljob
size bigjob
time execs 1000 0 bigjob
time execs 1000 1024 bigjob
time execs 1000 102400 bigjob
time vexecs 1000 0 bigjob
time vexecs 1000 1024 bigjob
time vexecs 1000 102400 bigjob
\*(+K#\*(-K fill environment with ~1024 bytes
setenv a 012345678901234567890123456789012345678901234567890123456780123456789
setenv b 012345678901234567890123456789012345678901234567890123456780123456789
setenv c 012345678901234567890123456789012345678901234567890123456780123456789
setenv d 012345678901234567890123456789012345678901234567890123456780123456789
setenv e 012345678901234567890123456789012345678901234567890123456780123456789
setenv f 012345678901234567890123456789012345678901234567890123456780123456789
setenv g 012345678901234567890123456789012345678901234567890123456780123456789
setenv h 012345678901234567890123456789012345678901234567890123456780123456789
setenv i 012345678901234567890123456789012345678901234567890123456780123456789
setenv j 012345678901234567890123456789012345678901234567890123456780123456789
setenv k 012345678901234567890123456789012345678901234567890123456780123456789
setenv l 012345678901234567890123456789012345678901234567890123456780123456789
setenv m 012345678901234567890123456789012345678901234567890123456780123456789
setenv n 012345678901234567890123456789012345678901234567890123456780123456789
setenv o 012345678901234567890123456789012345678901234567890123456780123456789
countenv
time execs 1000 0 nulljob
time execs 1000 1024 nulljob
time execs 1000 102400 nulljob
time execs 1000 0 bigjob
time execs 1000 1024 bigjob
time execs 1000 102400 bigjob
.vE
.bp
'-F