main.c revision 1.9 1 1.9 cgd /* $NetBSD: main.c,v 1.9 2000/06/14 06:49:26 cgd Exp $ */
2 1.9 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1994 Christopher G. Demetriou
5 1.1 cgd * All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by Christopher G. Demetriou.
18 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
19 1.1 cgd * derived from this software without specific prior written permission
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 1.1 cgd */
32 1.1 cgd
33 1.7 lukem #include <sys/cdefs.h>
34 1.7 lukem #ifndef lint
35 1.7 lukem __COPYRIGHT("@(#) Copyright (c) 1994 Christopher G. Demetriou\n\
36 1.7 lukem All rights reserved.\n");
37 1.1 cgd
38 1.9 cgd __RCSID("$NetBSD: main.c,v 1.9 2000/06/14 06:49:26 cgd Exp $");
39 1.1 cgd #endif
40 1.1 cgd
41 1.1 cgd /*
42 1.1 cgd * sa: system accounting
43 1.1 cgd */
44 1.1 cgd
45 1.1 cgd #include <sys/types.h>
46 1.1 cgd #include <sys/acct.h>
47 1.1 cgd #include <ctype.h>
48 1.1 cgd #include <err.h>
49 1.1 cgd #include <fcntl.h>
50 1.1 cgd #include <signal.h>
51 1.1 cgd #include <stdio.h>
52 1.1 cgd #include <stdlib.h>
53 1.5 cgd #include <string.h>
54 1.1 cgd #include <unistd.h>
55 1.1 cgd #include "extern.h"
56 1.1 cgd #include "pathnames.h"
57 1.1 cgd
58 1.1 cgd static int acct_load __P((char *, int));
59 1.1 cgd static u_quad_t decode_comp_t __P((comp_t));
60 1.1 cgd static int cmp_comm __P((const char *, const char *));
61 1.1 cgd static int cmp_usrsys __P((const DBT *, const DBT *));
62 1.1 cgd static int cmp_avgusrsys __P((const DBT *, const DBT *));
63 1.1 cgd static int cmp_dkio __P((const DBT *, const DBT *));
64 1.1 cgd static int cmp_avgdkio __P((const DBT *, const DBT *));
65 1.1 cgd static int cmp_cpumem __P((const DBT *, const DBT *));
66 1.1 cgd static int cmp_avgcpumem __P((const DBT *, const DBT *));
67 1.1 cgd static int cmp_calls __P((const DBT *, const DBT *));
68 1.1 cgd
69 1.1 cgd int aflag, bflag, cflag, dflag, Dflag, fflag, iflag, jflag, kflag;
70 1.1 cgd int Kflag, lflag, mflag, qflag, rflag, sflag, tflag, uflag, vflag;
71 1.1 cgd int cutoff = 1;
72 1.1 cgd
73 1.1 cgd static char *dfltargv[] = { _PATH_ACCT };
74 1.4 mycroft static int dfltargc = (sizeof(dfltargv)/sizeof(char *));
75 1.1 cgd
76 1.1 cgd /* default to comparing by sum of user + system time */
77 1.1 cgd cmpf_t sa_cmp = cmp_usrsys;
78 1.1 cgd
79 1.1 cgd int
80 1.1 cgd main(argc, argv)
81 1.1 cgd int argc;
82 1.1 cgd char **argv;
83 1.1 cgd {
84 1.6 mark int ch;
85 1.1 cgd int error;
86 1.1 cgd
87 1.7 lukem error = 0;
88 1.1 cgd while ((ch = getopt(argc, argv, "abcdDfijkKlmnqrstuv:")) != -1)
89 1.1 cgd switch (ch) {
90 1.1 cgd case 'a':
91 1.1 cgd /* print all commands */
92 1.1 cgd aflag = 1;
93 1.1 cgd break;
94 1.1 cgd case 'b':
95 1.1 cgd /* sort by per-call user/system time average */
96 1.1 cgd bflag = 1;
97 1.1 cgd sa_cmp = cmp_avgusrsys;
98 1.1 cgd break;
99 1.1 cgd case 'c':
100 1.1 cgd /* print percentage total time */
101 1.1 cgd cflag = 1;
102 1.1 cgd break;
103 1.1 cgd case 'd':
104 1.1 cgd /* sort by averge number of disk I/O ops */
105 1.1 cgd dflag = 1;
106 1.1 cgd sa_cmp = cmp_avgdkio;
107 1.1 cgd break;
108 1.1 cgd case 'D':
109 1.1 cgd /* print and sort by total disk I/O ops */
110 1.1 cgd Dflag = 1;
111 1.1 cgd sa_cmp = cmp_dkio;
112 1.1 cgd break;
113 1.1 cgd case 'f':
114 1.1 cgd /* force no interactive threshold comprison */
115 1.1 cgd fflag = 1;
116 1.1 cgd break;
117 1.1 cgd case 'i':
118 1.1 cgd /* do not read in summary file */
119 1.1 cgd iflag = 1;
120 1.1 cgd break;
121 1.1 cgd case 'j':
122 1.1 cgd /* instead of total minutes, give sec/call */
123 1.1 cgd jflag = 1;
124 1.1 cgd break;
125 1.1 cgd case 'k':
126 1.1 cgd /* sort by cpu-time average memory usage */
127 1.1 cgd kflag = 1;
128 1.1 cgd sa_cmp = cmp_avgcpumem;
129 1.1 cgd break;
130 1.1 cgd case 'K':
131 1.1 cgd /* print and sort by cpu-storage integral */
132 1.1 cgd sa_cmp = cmp_cpumem;
133 1.1 cgd Kflag = 1;
134 1.1 cgd break;
135 1.1 cgd case 'l':
136 1.1 cgd /* seperate system and user time */
137 1.1 cgd lflag = 1;
138 1.1 cgd break;
139 1.1 cgd case 'm':
140 1.1 cgd /* print procs and time per-user */
141 1.1 cgd mflag = 1;
142 1.1 cgd break;
143 1.1 cgd case 'n':
144 1.1 cgd /* sort by number of calls */
145 1.1 cgd sa_cmp = cmp_calls;
146 1.1 cgd break;
147 1.1 cgd case 'q':
148 1.1 cgd /* quiet; error messages only */
149 1.1 cgd qflag = 1;
150 1.1 cgd break;
151 1.1 cgd case 'r':
152 1.1 cgd /* reverse order of sort */
153 1.1 cgd rflag = 1;
154 1.1 cgd break;
155 1.1 cgd case 's':
156 1.1 cgd /* merge accounting file into summaries */
157 1.1 cgd sflag = 1;
158 1.1 cgd break;
159 1.1 cgd case 't':
160 1.1 cgd /* report ratio of user and system times */
161 1.1 cgd tflag = 1;
162 1.1 cgd break;
163 1.1 cgd case 'u':
164 1.1 cgd /* first, print uid and command name */
165 1.1 cgd uflag = 1;
166 1.1 cgd break;
167 1.1 cgd case 'v':
168 1.1 cgd /* cull junk */
169 1.1 cgd vflag = 1;
170 1.1 cgd cutoff = atoi(optarg);
171 1.1 cgd break;
172 1.1 cgd case '?':
173 1.1 cgd default:
174 1.1 cgd (void)fprintf(stderr,
175 1.1 cgd "usage: sa [-abcdDfijkKlmnqrstu] [-v cutoff] [file ...]\n");
176 1.1 cgd exit(1);
177 1.1 cgd }
178 1.1 cgd
179 1.1 cgd argc -= optind;
180 1.1 cgd argv += optind;
181 1.1 cgd
182 1.1 cgd /* various argument checking */
183 1.1 cgd if (fflag && !vflag)
184 1.1 cgd errx(1, "only one of -f requires -v");
185 1.1 cgd if (fflag && aflag)
186 1.1 cgd errx(1, "only one of -a and -v may be specified");
187 1.1 cgd /* XXX need more argument checking */
188 1.1 cgd
189 1.1 cgd if (!uflag) {
190 1.1 cgd /* initialize tables */
191 1.1 cgd if ((sflag || (!mflag && !qflag)) && pacct_init() != 0)
192 1.1 cgd errx(1, "process accounting initialization failed");
193 1.1 cgd if ((sflag || (mflag && !qflag)) && usracct_init() != 0)
194 1.1 cgd errx(1, "user accounting initialization failed");
195 1.1 cgd }
196 1.1 cgd
197 1.1 cgd if (argc == 0) {
198 1.1 cgd argc = dfltargc;
199 1.1 cgd argv = dfltargv;
200 1.1 cgd }
201 1.1 cgd
202 1.1 cgd /* for each file specified */
203 1.1 cgd for (; argc > 0; argc--, argv++) {
204 1.1 cgd int fd;
205 1.1 cgd
206 1.1 cgd /*
207 1.1 cgd * load the accounting data from the file.
208 1.1 cgd * if it fails, go on to the next file.
209 1.1 cgd */
210 1.1 cgd fd = acct_load(argv[0], sflag);
211 1.1 cgd if (fd < 0)
212 1.1 cgd continue;
213 1.1 cgd
214 1.1 cgd if (!uflag && sflag) {
215 1.1 cgd #ifndef DEBUG
216 1.1 cgd sigset_t nmask, omask;
217 1.1 cgd int unmask = 1;
218 1.1 cgd
219 1.1 cgd /*
220 1.1 cgd * block most signals so we aren't interrupted during
221 1.1 cgd * the update.
222 1.1 cgd */
223 1.1 cgd if (sigfillset(&nmask) == -1) {
224 1.1 cgd warn("sigfillset");
225 1.1 cgd unmask = 0;
226 1.1 cgd error = 1;
227 1.1 cgd }
228 1.1 cgd if (unmask &&
229 1.1 cgd (sigprocmask(SIG_BLOCK, &nmask, &omask) == -1)) {
230 1.1 cgd warn("couldn't set signal mask ");
231 1.1 cgd unmask = 0;
232 1.1 cgd error = 1;
233 1.1 cgd }
234 1.1 cgd #endif /* DEBUG */
235 1.1 cgd
236 1.1 cgd /*
237 1.1 cgd * truncate the accounting data file ASAP, to avoid
238 1.1 cgd * losing data. don't worry about errors in updating
239 1.1 cgd * the saved stats; better to underbill than overbill,
240 1.1 cgd * but we want every accounting record intact.
241 1.1 cgd */
242 1.1 cgd if (ftruncate(fd, 0) == -1) {
243 1.7 lukem warn("couldn't truncate %s", *argv);
244 1.1 cgd error = 1;
245 1.1 cgd }
246 1.1 cgd
247 1.1 cgd /*
248 1.1 cgd * update saved user and process accounting data.
249 1.1 cgd * note errors for later.
250 1.1 cgd */
251 1.1 cgd if (pacct_update() != 0 || usracct_update() != 0)
252 1.1 cgd error = 1;
253 1.1 cgd
254 1.1 cgd #ifndef DEBUG
255 1.1 cgd /*
256 1.1 cgd * restore signals
257 1.1 cgd */
258 1.1 cgd if (unmask &&
259 1.1 cgd (sigprocmask(SIG_SETMASK, &omask, NULL) == -1)) {
260 1.1 cgd warn("couldn't restore signal mask");
261 1.1 cgd error = 1;
262 1.1 cgd }
263 1.1 cgd #endif /* DEBUG */
264 1.1 cgd }
265 1.1 cgd
266 1.1 cgd /*
267 1.1 cgd * close the opened accounting file
268 1.1 cgd */
269 1.1 cgd if (close(fd) == -1) {
270 1.7 lukem warn("close %s", *argv);
271 1.1 cgd error = 1;
272 1.1 cgd }
273 1.1 cgd }
274 1.1 cgd
275 1.1 cgd if (!uflag && !qflag) {
276 1.1 cgd /* print any results we may have obtained. */
277 1.1 cgd if (!mflag)
278 1.1 cgd pacct_print();
279 1.1 cgd else
280 1.1 cgd usracct_print();
281 1.1 cgd }
282 1.1 cgd
283 1.1 cgd if (!uflag) {
284 1.1 cgd /* finally, deallocate databases */
285 1.1 cgd if (sflag || (!mflag && !qflag))
286 1.1 cgd pacct_destroy();
287 1.1 cgd if (sflag || (mflag && !qflag))
288 1.1 cgd usracct_destroy();
289 1.1 cgd }
290 1.1 cgd
291 1.1 cgd exit(error);
292 1.1 cgd }
293 1.1 cgd
294 1.1 cgd static int
295 1.1 cgd acct_load(pn, wr)
296 1.1 cgd char *pn;
297 1.1 cgd int wr;
298 1.1 cgd {
299 1.1 cgd struct acct ac;
300 1.1 cgd struct cmdinfo ci;
301 1.1 cgd ssize_t rv;
302 1.1 cgd int fd, i;
303 1.1 cgd
304 1.1 cgd /*
305 1.1 cgd * open the file
306 1.1 cgd */
307 1.1 cgd fd = open(pn, wr ? O_RDWR : O_RDONLY, 0);
308 1.1 cgd if (fd == -1) {
309 1.1 cgd warn("open %s %s", pn, wr ? "for read/write" : "read-only");
310 1.1 cgd return (-1);
311 1.1 cgd }
312 1.1 cgd
313 1.1 cgd /*
314 1.1 cgd * read all we can; don't stat and open because more processes
315 1.1 cgd * could exit, and we'd miss them
316 1.1 cgd */
317 1.1 cgd while (1) {
318 1.1 cgd /* get one accounting entry and punt if there's an error */
319 1.1 cgd rv = read(fd, &ac, sizeof(struct acct));
320 1.1 cgd if (rv == -1)
321 1.1 cgd warn("error reading %s", pn);
322 1.1 cgd else if (rv > 0 && rv < sizeof(struct acct))
323 1.1 cgd warnx("short read of accounting data in %s", pn);
324 1.1 cgd if (rv != sizeof(struct acct))
325 1.1 cgd break;
326 1.1 cgd
327 1.1 cgd /* decode it */
328 1.1 cgd ci.ci_calls = 1;
329 1.4 mycroft for (i = 0; i < sizeof(ac.ac_comm) && ac.ac_comm[i] != '\0';
330 1.1 cgd i++) {
331 1.1 cgd char c = ac.ac_comm[i];
332 1.1 cgd
333 1.1 cgd if (!isascii(c) || iscntrl(c)) {
334 1.1 cgd ci.ci_comm[i] = '?';
335 1.1 cgd ci.ci_flags |= CI_UNPRINTABLE;
336 1.1 cgd } else
337 1.1 cgd ci.ci_comm[i] = c;
338 1.1 cgd }
339 1.1 cgd if (ac.ac_flag & AFORK)
340 1.1 cgd ci.ci_comm[i++] = '*';
341 1.1 cgd ci.ci_comm[i++] = '\0';
342 1.1 cgd ci.ci_etime = decode_comp_t(ac.ac_etime);
343 1.1 cgd ci.ci_utime = decode_comp_t(ac.ac_utime);
344 1.1 cgd ci.ci_stime = decode_comp_t(ac.ac_stime);
345 1.1 cgd ci.ci_uid = ac.ac_uid;
346 1.1 cgd ci.ci_mem = ac.ac_mem;
347 1.1 cgd ci.ci_io = decode_comp_t(ac.ac_io) / AHZ;
348 1.1 cgd
349 1.1 cgd if (!uflag) {
350 1.1 cgd /* and enter it into the usracct and pacct databases */
351 1.1 cgd if (sflag || (!mflag && !qflag))
352 1.1 cgd pacct_add(&ci);
353 1.1 cgd if (sflag || (mflag && !qflag))
354 1.1 cgd usracct_add(&ci);
355 1.1 cgd } else if (!qflag)
356 1.7 lukem printf("%6u %12.2f cpu %12quk mem %12qu io %s\n",
357 1.1 cgd ci.ci_uid,
358 1.1 cgd (ci.ci_utime + ci.ci_stime) / (double) AHZ,
359 1.8 mrg (unsigned long long)ci.ci_mem,
360 1.8 mrg (unsigned long long)ci.ci_io, ci.ci_comm);
361 1.1 cgd }
362 1.1 cgd
363 1.1 cgd /* finally, return the file descriptor for possible truncation */
364 1.1 cgd return (fd);
365 1.1 cgd }
366 1.1 cgd
367 1.1 cgd static u_quad_t
368 1.1 cgd decode_comp_t(comp)
369 1.1 cgd comp_t comp;
370 1.1 cgd {
371 1.1 cgd u_quad_t rv;
372 1.1 cgd
373 1.1 cgd /*
374 1.1 cgd * for more info on the comp_t format, see:
375 1.1 cgd * /usr/src/sys/kern/kern_acct.c
376 1.1 cgd * /usr/src/sys/sys/acct.h
377 1.1 cgd * /usr/src/usr.bin/lastcomm/lastcomm.c
378 1.1 cgd */
379 1.1 cgd rv = comp & 0x1fff; /* 13 bit fraction */
380 1.1 cgd comp >>= 13; /* 3 bit base-8 exponent */
381 1.1 cgd while (comp--)
382 1.1 cgd rv <<= 3;
383 1.1 cgd
384 1.1 cgd return (rv);
385 1.1 cgd }
386 1.1 cgd
387 1.1 cgd /* sort commands, doing the right thing in terms of reversals */
388 1.1 cgd static int
389 1.1 cgd cmp_comm(s1, s2)
390 1.1 cgd const char *s1, *s2;
391 1.1 cgd {
392 1.1 cgd int rv;
393 1.1 cgd
394 1.1 cgd rv = strcmp(s1, s2);
395 1.1 cgd if (rv == 0)
396 1.1 cgd rv = -1;
397 1.1 cgd return (rflag ? rv : -rv);
398 1.1 cgd }
399 1.1 cgd
400 1.1 cgd /* sort by total user and system time */
401 1.1 cgd static int
402 1.1 cgd cmp_usrsys(d1, d2)
403 1.1 cgd const DBT *d1, *d2;
404 1.1 cgd {
405 1.3 mycroft struct cmdinfo c1, c2;
406 1.1 cgd u_quad_t t1, t2;
407 1.1 cgd
408 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
409 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
410 1.1 cgd
411 1.3 mycroft t1 = c1.ci_utime + c1.ci_stime;
412 1.3 mycroft t2 = c2.ci_utime + c2.ci_stime;
413 1.1 cgd
414 1.1 cgd if (t1 < t2)
415 1.1 cgd return -1;
416 1.1 cgd else if (t1 == t2)
417 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
418 1.1 cgd else
419 1.1 cgd return 1;
420 1.1 cgd }
421 1.1 cgd
422 1.1 cgd /* sort by average user and system time */
423 1.1 cgd static int
424 1.1 cgd cmp_avgusrsys(d1, d2)
425 1.1 cgd const DBT *d1, *d2;
426 1.1 cgd {
427 1.3 mycroft struct cmdinfo c1, c2;
428 1.1 cgd double t1, t2;
429 1.1 cgd
430 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
431 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
432 1.1 cgd
433 1.3 mycroft t1 = c1.ci_utime + c1.ci_stime;
434 1.3 mycroft t1 /= (double) (c1.ci_calls ? c1.ci_calls : 1);
435 1.1 cgd
436 1.3 mycroft t2 = c2.ci_utime + c2.ci_stime;
437 1.3 mycroft t2 /= (double) (c2.ci_calls ? c2.ci_calls : 1);
438 1.1 cgd
439 1.1 cgd if (t1 < t2)
440 1.1 cgd return -1;
441 1.1 cgd else if (t1 == t2)
442 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
443 1.1 cgd else
444 1.1 cgd return 1;
445 1.1 cgd }
446 1.1 cgd
447 1.1 cgd /* sort by total number of disk I/O operations */
448 1.1 cgd static int
449 1.1 cgd cmp_dkio(d1, d2)
450 1.1 cgd const DBT *d1, *d2;
451 1.1 cgd {
452 1.3 mycroft struct cmdinfo c1, c2;
453 1.1 cgd
454 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
455 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
456 1.1 cgd
457 1.3 mycroft if (c1.ci_io < c2.ci_io)
458 1.1 cgd return -1;
459 1.3 mycroft else if (c1.ci_io == c2.ci_io)
460 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
461 1.1 cgd else
462 1.1 cgd return 1;
463 1.1 cgd }
464 1.1 cgd
465 1.1 cgd /* sort by average number of disk I/O operations */
466 1.1 cgd static int
467 1.1 cgd cmp_avgdkio(d1, d2)
468 1.1 cgd const DBT *d1, *d2;
469 1.1 cgd {
470 1.3 mycroft struct cmdinfo c1, c2;
471 1.1 cgd double n1, n2;
472 1.1 cgd
473 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
474 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
475 1.1 cgd
476 1.3 mycroft n1 = (double) c1.ci_io / (double) (c1.ci_calls ? c1.ci_calls : 1);
477 1.3 mycroft n2 = (double) c2.ci_io / (double) (c2.ci_calls ? c2.ci_calls : 1);
478 1.1 cgd
479 1.1 cgd if (n1 < n2)
480 1.1 cgd return -1;
481 1.1 cgd else if (n1 == n2)
482 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
483 1.1 cgd else
484 1.1 cgd return 1;
485 1.1 cgd }
486 1.1 cgd
487 1.1 cgd /* sort by the cpu-storage integral */
488 1.1 cgd static int
489 1.1 cgd cmp_cpumem(d1, d2)
490 1.1 cgd const DBT *d1, *d2;
491 1.1 cgd {
492 1.3 mycroft struct cmdinfo c1, c2;
493 1.1 cgd
494 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
495 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
496 1.1 cgd
497 1.3 mycroft if (c1.ci_mem < c2.ci_mem)
498 1.1 cgd return -1;
499 1.3 mycroft else if (c1.ci_mem == c2.ci_mem)
500 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
501 1.1 cgd else
502 1.1 cgd return 1;
503 1.1 cgd }
504 1.1 cgd
505 1.1 cgd /* sort by the cpu-time average memory usage */
506 1.1 cgd static int
507 1.1 cgd cmp_avgcpumem(d1, d2)
508 1.1 cgd const DBT *d1, *d2;
509 1.1 cgd {
510 1.3 mycroft struct cmdinfo c1, c2;
511 1.1 cgd u_quad_t t1, t2;
512 1.1 cgd double n1, n2;
513 1.1 cgd
514 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
515 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
516 1.1 cgd
517 1.3 mycroft t1 = c1.ci_utime + c1.ci_stime;
518 1.3 mycroft t2 = c2.ci_utime + c2.ci_stime;
519 1.1 cgd
520 1.3 mycroft n1 = (double) c1.ci_mem / (double) (t1 ? t1 : 1);
521 1.3 mycroft n2 = (double) c2.ci_mem / (double) (t2 ? t2 : 1);
522 1.1 cgd
523 1.1 cgd if (n1 < n2)
524 1.1 cgd return -1;
525 1.1 cgd else if (n1 == n2)
526 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
527 1.1 cgd else
528 1.1 cgd return 1;
529 1.1 cgd }
530 1.1 cgd
531 1.1 cgd /* sort by the number of invocations */
532 1.1 cgd static int
533 1.1 cgd cmp_calls(d1, d2)
534 1.1 cgd const DBT *d1, *d2;
535 1.1 cgd {
536 1.3 mycroft struct cmdinfo c1, c2;
537 1.1 cgd
538 1.3 mycroft memcpy(&c1, d1->data, sizeof(c1));
539 1.3 mycroft memcpy(&c2, d2->data, sizeof(c2));
540 1.1 cgd
541 1.3 mycroft if (c1.ci_calls < c2.ci_calls)
542 1.1 cgd return -1;
543 1.3 mycroft else if (c1.ci_calls == c2.ci_calls)
544 1.3 mycroft return (cmp_comm(c1.ci_comm, c2.ci_comm));
545 1.1 cgd else
546 1.1 cgd return 1;
547 1.1 cgd }
548