1994-09-26 21:22:57 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1994 Christopher G. Demetriou
|
|
|
|
* 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 Christopher G. Demetriou.
|
|
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
|
|
|
*/
|
|
|
|
|
2003-05-03 21:06:42 +00:00
|
|
|
#if 0
|
1997-10-15 06:41:19 +00:00
|
|
|
#ifndef lint
|
|
|
|
static const char copyright[] =
|
1994-09-26 21:22:57 +00:00
|
|
|
"@(#) Copyright (c) 1994 Christopher G. Demetriou\n\
|
|
|
|
All rights reserved.\n";
|
|
|
|
#endif
|
2003-05-03 21:06:42 +00:00
|
|
|
#endif
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
1997-10-15 06:41:19 +00:00
|
|
|
|
1994-09-26 21:22:57 +00:00
|
|
|
/*
|
|
|
|
* sa: system accounting
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/acct.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <err.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <signal.h>
|
2002-07-15 16:05:15 +00:00
|
|
|
#include <stdint.h>
|
1994-09-26 21:22:57 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1996-01-22 09:02:08 +00:00
|
|
|
#include <string.h>
|
1994-09-26 21:22:57 +00:00
|
|
|
#include <unistd.h>
|
|
|
|
#include "extern.h"
|
|
|
|
#include "pathnames.h"
|
|
|
|
|
2005-02-10 12:43:16 +00:00
|
|
|
static int acct_load(const char *, int);
|
2002-07-11 22:11:20 +00:00
|
|
|
static u_quad_t decode_comp_t(comp_t);
|
|
|
|
static int cmp_comm(const char *, const char *);
|
|
|
|
static int cmp_usrsys(const DBT *, const DBT *);
|
|
|
|
static int cmp_avgusrsys(const DBT *, const DBT *);
|
|
|
|
static int cmp_dkio(const DBT *, const DBT *);
|
|
|
|
static int cmp_avgdkio(const DBT *, const DBT *);
|
|
|
|
static int cmp_cpumem(const DBT *, const DBT *);
|
|
|
|
static int cmp_avgcpumem(const DBT *, const DBT *);
|
|
|
|
static int cmp_calls(const DBT *, const DBT *);
|
|
|
|
static void usage(void);
|
1994-09-26 21:22:57 +00:00
|
|
|
|
|
|
|
int aflag, bflag, cflag, dflag, Dflag, fflag, iflag, jflag, kflag;
|
|
|
|
int Kflag, lflag, mflag, qflag, rflag, sflag, tflag, uflag, vflag;
|
2002-07-11 22:11:20 +00:00
|
|
|
u_quad_t cutoff = 1;
|
2007-05-18 12:36:10 +00:00
|
|
|
const char *pdb_file = _PATH_SAVACCT;
|
|
|
|
const char *usrdb_file = _PATH_USRACCT;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2002-07-11 22:11:20 +00:00
|
|
|
static char *dfltargv[] = { NULL };
|
1994-09-26 21:22:57 +00:00
|
|
|
static int dfltargc = (sizeof dfltargv/sizeof(char *));
|
|
|
|
|
|
|
|
/* default to comparing by sum of user + system time */
|
|
|
|
cmpf_t sa_cmp = cmp_usrsys;
|
|
|
|
|
|
|
|
int
|
2002-07-11 22:11:20 +00:00
|
|
|
main(int argc, char **argv)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2002-07-11 22:11:20 +00:00
|
|
|
char pathacct[] = _PATH_ACCT;
|
2004-01-22 07:23:36 +00:00
|
|
|
int ch, error = 0;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2002-07-11 22:11:20 +00:00
|
|
|
dfltargv[0] = pathacct;
|
|
|
|
|
2007-05-18 12:36:10 +00:00
|
|
|
while ((ch = getopt(argc, argv, "abcdDfijkKlmnP:qrstuU:v:")) != -1)
|
1994-09-26 21:22:57 +00:00
|
|
|
switch (ch) {
|
|
|
|
case 'a':
|
|
|
|
/* print all commands */
|
|
|
|
aflag = 1;
|
|
|
|
break;
|
|
|
|
case 'b':
|
|
|
|
/* sort by per-call user/system time average */
|
|
|
|
bflag = 1;
|
|
|
|
sa_cmp = cmp_avgusrsys;
|
|
|
|
break;
|
|
|
|
case 'c':
|
|
|
|
/* print percentage total time */
|
|
|
|
cflag = 1;
|
|
|
|
break;
|
|
|
|
case 'd':
|
|
|
|
/* sort by averge number of disk I/O ops */
|
|
|
|
dflag = 1;
|
|
|
|
sa_cmp = cmp_avgdkio;
|
|
|
|
break;
|
|
|
|
case 'D':
|
|
|
|
/* print and sort by total disk I/O ops */
|
|
|
|
Dflag = 1;
|
|
|
|
sa_cmp = cmp_dkio;
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
/* force no interactive threshold comprison */
|
|
|
|
fflag = 1;
|
|
|
|
break;
|
|
|
|
case 'i':
|
|
|
|
/* do not read in summary file */
|
|
|
|
iflag = 1;
|
|
|
|
break;
|
|
|
|
case 'j':
|
|
|
|
/* instead of total minutes, give sec/call */
|
|
|
|
jflag = 1;
|
|
|
|
break;
|
|
|
|
case 'k':
|
|
|
|
/* sort by cpu-time average memory usage */
|
|
|
|
kflag = 1;
|
|
|
|
sa_cmp = cmp_avgcpumem;
|
|
|
|
break;
|
|
|
|
case 'K':
|
|
|
|
/* print and sort by cpu-storage integral */
|
|
|
|
sa_cmp = cmp_cpumem;
|
|
|
|
Kflag = 1;
|
|
|
|
break;
|
|
|
|
case 'l':
|
2001-02-06 11:21:58 +00:00
|
|
|
/* separate system and user time */
|
1994-09-26 21:22:57 +00:00
|
|
|
lflag = 1;
|
|
|
|
break;
|
|
|
|
case 'm':
|
|
|
|
/* print procs and time per-user */
|
|
|
|
mflag = 1;
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
/* sort by number of calls */
|
|
|
|
sa_cmp = cmp_calls;
|
|
|
|
break;
|
2007-05-18 12:36:10 +00:00
|
|
|
case 'P':
|
|
|
|
/* specify program database summary file */
|
|
|
|
pdb_file = optarg;
|
|
|
|
break;
|
1994-09-26 21:22:57 +00:00
|
|
|
case 'q':
|
|
|
|
/* quiet; error messages only */
|
|
|
|
qflag = 1;
|
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
/* reverse order of sort */
|
|
|
|
rflag = 1;
|
|
|
|
break;
|
|
|
|
case 's':
|
|
|
|
/* merge accounting file into summaries */
|
|
|
|
sflag = 1;
|
|
|
|
break;
|
|
|
|
case 't':
|
|
|
|
/* report ratio of user and system times */
|
|
|
|
tflag = 1;
|
|
|
|
break;
|
|
|
|
case 'u':
|
|
|
|
/* first, print uid and command name */
|
|
|
|
uflag = 1;
|
|
|
|
break;
|
2007-05-18 12:36:10 +00:00
|
|
|
case 'U':
|
|
|
|
/* specify user database summary file */
|
|
|
|
usrdb_file = optarg;
|
|
|
|
break;
|
1994-09-26 21:22:57 +00:00
|
|
|
case 'v':
|
|
|
|
/* cull junk */
|
|
|
|
vflag = 1;
|
|
|
|
cutoff = atoi(optarg);
|
|
|
|
break;
|
|
|
|
case '?':
|
|
|
|
default:
|
1997-10-15 06:41:19 +00:00
|
|
|
usage();
|
1994-09-26 21:22:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
argc -= optind;
|
|
|
|
argv += optind;
|
|
|
|
|
|
|
|
/* various argument checking */
|
|
|
|
if (fflag && !vflag)
|
|
|
|
errx(1, "only one of -f requires -v");
|
|
|
|
if (fflag && aflag)
|
|
|
|
errx(1, "only one of -a and -v may be specified");
|
|
|
|
/* XXX need more argument checking */
|
|
|
|
|
|
|
|
if (!uflag) {
|
|
|
|
/* initialize tables */
|
|
|
|
if ((sflag || (!mflag && !qflag)) && pacct_init() != 0)
|
|
|
|
errx(1, "process accounting initialization failed");
|
|
|
|
if ((sflag || (mflag && !qflag)) && usracct_init() != 0)
|
|
|
|
errx(1, "user accounting initialization failed");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (argc == 0) {
|
|
|
|
argc = dfltargc;
|
|
|
|
argv = dfltargv;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* for each file specified */
|
|
|
|
for (; argc > 0; argc--, argv++) {
|
|
|
|
int fd;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* load the accounting data from the file.
|
|
|
|
* if it fails, go on to the next file.
|
|
|
|
*/
|
|
|
|
fd = acct_load(argv[0], sflag);
|
|
|
|
if (fd < 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!uflag && sflag) {
|
|
|
|
#ifndef DEBUG
|
|
|
|
sigset_t nmask, omask;
|
|
|
|
int unmask = 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* block most signals so we aren't interrupted during
|
|
|
|
* the update.
|
|
|
|
*/
|
|
|
|
if (sigfillset(&nmask) == -1) {
|
|
|
|
warn("sigfillset");
|
|
|
|
unmask = 0;
|
|
|
|
error = 1;
|
|
|
|
}
|
1995-05-30 03:57:47 +00:00
|
|
|
if (unmask &&
|
1994-09-26 21:22:57 +00:00
|
|
|
(sigprocmask(SIG_BLOCK, &nmask, &omask) == -1)) {
|
1997-10-15 06:41:19 +00:00
|
|
|
warn("couldn't set signal mask");
|
1994-09-26 21:22:57 +00:00
|
|
|
unmask = 0;
|
|
|
|
error = 1;
|
|
|
|
}
|
|
|
|
#endif /* DEBUG */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* truncate the accounting data file ASAP, to avoid
|
|
|
|
* losing data. don't worry about errors in updating
|
|
|
|
* the saved stats; better to underbill than overbill,
|
|
|
|
* but we want every accounting record intact.
|
|
|
|
*/
|
|
|
|
if (ftruncate(fd, 0) == -1) {
|
2002-07-11 22:11:20 +00:00
|
|
|
warn("couldn't truncate %s", *argv);
|
1994-09-26 21:22:57 +00:00
|
|
|
error = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* update saved user and process accounting data.
|
|
|
|
* note errors for later.
|
|
|
|
*/
|
|
|
|
if (pacct_update() != 0 || usracct_update() != 0)
|
|
|
|
error = 1;
|
|
|
|
|
|
|
|
#ifndef DEBUG
|
|
|
|
/*
|
|
|
|
* restore signals
|
|
|
|
*/
|
|
|
|
if (unmask &&
|
|
|
|
(sigprocmask(SIG_SETMASK, &omask, NULL) == -1)) {
|
|
|
|
warn("couldn't restore signal mask");
|
|
|
|
error = 1;
|
|
|
|
}
|
|
|
|
#endif /* DEBUG */
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* close the opened accounting file
|
|
|
|
*/
|
|
|
|
if (close(fd) == -1) {
|
2002-07-11 22:11:20 +00:00
|
|
|
warn("close %s", *argv);
|
1994-09-26 21:22:57 +00:00
|
|
|
error = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!uflag && !qflag) {
|
|
|
|
/* print any results we may have obtained. */
|
|
|
|
if (!mflag)
|
|
|
|
pacct_print();
|
|
|
|
else
|
|
|
|
usracct_print();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!uflag) {
|
|
|
|
/* finally, deallocate databases */
|
|
|
|
if (sflag || (!mflag && !qflag))
|
|
|
|
pacct_destroy();
|
|
|
|
if (sflag || (mflag && !qflag))
|
|
|
|
usracct_destroy();
|
|
|
|
}
|
|
|
|
|
|
|
|
exit(error);
|
|
|
|
}
|
|
|
|
|
1997-10-15 06:41:19 +00:00
|
|
|
static void
|
|
|
|
usage()
|
|
|
|
{
|
|
|
|
(void)fprintf(stderr,
|
2007-05-18 12:36:10 +00:00
|
|
|
"usage: sa [-abcdDfijkKlmnqrstu] [-P file] [-U file] [-v cutoff] [file ...]\n");
|
1997-10-15 06:41:19 +00:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
1994-09-26 21:22:57 +00:00
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
acct_load(const char *pn, int wr)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
|
|
|
struct acct ac;
|
|
|
|
struct cmdinfo ci;
|
|
|
|
ssize_t rv;
|
|
|
|
int fd, i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* open the file
|
|
|
|
*/
|
|
|
|
fd = open(pn, wr ? O_RDWR : O_RDONLY, 0);
|
|
|
|
if (fd == -1) {
|
|
|
|
warn("open %s %s", pn, wr ? "for read/write" : "read-only");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* read all we can; don't stat and open because more processes
|
|
|
|
* could exit, and we'd miss them
|
|
|
|
*/
|
|
|
|
while (1) {
|
|
|
|
/* get one accounting entry and punt if there's an error */
|
|
|
|
rv = read(fd, &ac, sizeof(struct acct));
|
|
|
|
if (rv == -1)
|
|
|
|
warn("error reading %s", pn);
|
2002-07-11 22:11:20 +00:00
|
|
|
else if (rv > 0 && rv < (int)sizeof(struct acct))
|
1994-09-26 21:22:57 +00:00
|
|
|
warnx("short read of accounting data in %s", pn);
|
|
|
|
if (rv != sizeof(struct acct))
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* decode it */
|
|
|
|
ci.ci_calls = 1;
|
2002-07-11 22:11:20 +00:00
|
|
|
for (i = 0; i < (int)sizeof ac.ac_comm && ac.ac_comm[i] != '\0';
|
1994-09-26 21:22:57 +00:00
|
|
|
i++) {
|
|
|
|
char c = ac.ac_comm[i];
|
|
|
|
|
|
|
|
if (!isascii(c) || iscntrl(c)) {
|
|
|
|
ci.ci_comm[i] = '?';
|
|
|
|
ci.ci_flags |= CI_UNPRINTABLE;
|
|
|
|
} else
|
|
|
|
ci.ci_comm[i] = c;
|
|
|
|
}
|
|
|
|
if (ac.ac_flag & AFORK)
|
|
|
|
ci.ci_comm[i++] = '*';
|
|
|
|
ci.ci_comm[i++] = '\0';
|
|
|
|
ci.ci_etime = decode_comp_t(ac.ac_etime);
|
|
|
|
ci.ci_utime = decode_comp_t(ac.ac_utime);
|
|
|
|
ci.ci_stime = decode_comp_t(ac.ac_stime);
|
|
|
|
ci.ci_uid = ac.ac_uid;
|
|
|
|
ci.ci_mem = ac.ac_mem;
|
|
|
|
ci.ci_io = decode_comp_t(ac.ac_io) / AHZ;
|
|
|
|
|
|
|
|
if (!uflag) {
|
|
|
|
/* and enter it into the usracct and pacct databases */
|
|
|
|
if (sflag || (!mflag && !qflag))
|
|
|
|
pacct_add(&ci);
|
|
|
|
if (sflag || (mflag && !qflag))
|
|
|
|
usracct_add(&ci);
|
|
|
|
} else if (!qflag)
|
2002-07-15 16:05:15 +00:00
|
|
|
printf("%6lu %12.2f cpu %12juk mem %12ju io %s\n",
|
1994-09-26 21:22:57 +00:00
|
|
|
ci.ci_uid,
|
|
|
|
(ci.ci_utime + ci.ci_stime) / (double) AHZ,
|
2002-07-15 16:05:15 +00:00
|
|
|
(uintmax_t)ci.ci_mem, (uintmax_t)ci.ci_io,
|
|
|
|
ci.ci_comm);
|
1994-09-26 21:22:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* finally, return the file descriptor for possible truncation */
|
|
|
|
return (fd);
|
|
|
|
}
|
|
|
|
|
|
|
|
static u_quad_t
|
2005-02-10 07:07:32 +00:00
|
|
|
decode_comp_t(comp_t comp)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
|
|
|
u_quad_t rv;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* for more info on the comp_t format, see:
|
|
|
|
* /usr/src/sys/kern/kern_acct.c
|
|
|
|
* /usr/src/sys/sys/acct.h
|
|
|
|
* /usr/src/usr.bin/lastcomm/lastcomm.c
|
|
|
|
*/
|
|
|
|
rv = comp & 0x1fff; /* 13 bit fraction */
|
|
|
|
comp >>= 13; /* 3 bit base-8 exponent */
|
|
|
|
while (comp--)
|
|
|
|
rv <<= 3;
|
|
|
|
|
|
|
|
return (rv);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort commands, doing the right thing in terms of reversals */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_comm(const char *s1, const char *s2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
|
|
|
int rv;
|
|
|
|
|
|
|
|
rv = strcmp(s1, s2);
|
|
|
|
if (rv == 0)
|
|
|
|
rv = -1;
|
|
|
|
return (rflag ? rv : -rv);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by total user and system time */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_usrsys(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
u_quad_t t1, t2;
|
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
t1 = c1.ci_utime + c1.ci_stime;
|
|
|
|
t2 = c2.ci_utime + c2.ci_stime;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
|
|
|
if (t1 < t2)
|
|
|
|
return -1;
|
|
|
|
else if (t1 == t2)
|
2000-10-26 17:35:46 +00:00
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by average user and system time */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_avgusrsys(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
double t1, t2;
|
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
t1 = c1.ci_utime + c1.ci_stime;
|
|
|
|
t1 /= (double) (c1.ci_calls ? c1.ci_calls : 1);
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
t2 = c2.ci_utime + c2.ci_stime;
|
|
|
|
t2 /= (double) (c2.ci_calls ? c2.ci_calls : 1);
|
1994-09-26 21:22:57 +00:00
|
|
|
|
|
|
|
if (t1 < t2)
|
|
|
|
return -1;
|
|
|
|
else if (t1 == t2)
|
2000-10-26 17:35:46 +00:00
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by total number of disk I/O operations */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_dkio(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
if (c1.ci_io < c2.ci_io)
|
1994-09-26 21:22:57 +00:00
|
|
|
return -1;
|
2000-10-26 17:35:46 +00:00
|
|
|
else if (c1.ci_io == c2.ci_io)
|
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by average number of disk I/O operations */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_avgdkio(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
double n1, n2;
|
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
n1 = (double) c1.ci_io / (double) (c1.ci_calls ? c1.ci_calls : 1);
|
|
|
|
n2 = (double) c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1);
|
1994-09-26 21:22:57 +00:00
|
|
|
|
|
|
|
if (n1 < n2)
|
|
|
|
return -1;
|
|
|
|
else if (n1 == n2)
|
2000-10-26 17:35:46 +00:00
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by the cpu-storage integral */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_cpumem(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
if (c1.ci_mem < c2.ci_mem)
|
1994-09-26 21:22:57 +00:00
|
|
|
return -1;
|
2000-10-26 17:35:46 +00:00
|
|
|
else if (c1.ci_mem == c2.ci_mem)
|
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by the cpu-time average memory usage */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_avgcpumem(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
u_quad_t t1, t2;
|
|
|
|
double n1, n2;
|
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
t1 = c1.ci_utime + c1.ci_stime;
|
|
|
|
t2 = c2.ci_utime + c2.ci_stime;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
n1 = (double) c1.ci_mem / (double) (t1 ? t1 : 1);
|
|
|
|
n2 = (double) c2.ci_mem / (double) (t2 ? t2 : 1);
|
1994-09-26 21:22:57 +00:00
|
|
|
|
|
|
|
if (n1 < n2)
|
|
|
|
return -1;
|
|
|
|
else if (n1 == n2)
|
2000-10-26 17:35:46 +00:00
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sort by the number of invocations */
|
|
|
|
static int
|
2005-02-10 12:43:16 +00:00
|
|
|
cmp_calls(const DBT *d1, const DBT *d2)
|
1994-09-26 21:22:57 +00:00
|
|
|
{
|
2000-10-26 17:35:46 +00:00
|
|
|
struct cmdinfo c1, c2;
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
memcpy(&c1, d1->data, sizeof(c1));
|
|
|
|
memcpy(&c2, d2->data, sizeof(c2));
|
1994-09-26 21:22:57 +00:00
|
|
|
|
2000-10-26 17:35:46 +00:00
|
|
|
if (c1.ci_calls < c2.ci_calls)
|
1994-09-26 21:22:57 +00:00
|
|
|
return -1;
|
2000-10-26 17:35:46 +00:00
|
|
|
else if (c1.ci_calls == c2.ci_calls)
|
|
|
|
return (cmp_comm(c1.ci_comm, c2.ci_comm));
|
1994-09-26 21:22:57 +00:00
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|