main.c revision 1.5 1 1.5 ad /* $NetBSD: main.c,v 1.5 2006/11/08 23:12:57 ad Exp $ */
2 1.1 ad
3 1.1 ad /*-
4 1.1 ad * Copyright (c) 2006 The NetBSD Foundation, Inc.
5 1.1 ad * All rights reserved.
6 1.1 ad *
7 1.1 ad * This code is derived from software contributed to The NetBSD Foundation
8 1.1 ad * by Andrew Doran.
9 1.1 ad *
10 1.1 ad * Redistribution and use in source and binary forms, with or without
11 1.1 ad * modification, are permitted provided that the following conditions
12 1.1 ad * are met:
13 1.1 ad * 1. Redistributions of source code must retain the above copyright
14 1.1 ad * notice, this list of conditions and the following disclaimer.
15 1.1 ad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 ad * notice, this list of conditions and the following disclaimer in the
17 1.1 ad * documentation and/or other materials provided with the distribution.
18 1.1 ad * 3. All advertising materials mentioning features or use of this software
19 1.1 ad * must display the following acknowledgement:
20 1.1 ad * This product includes software developed by the NetBSD
21 1.1 ad * Foundation, Inc. and its contributors.
22 1.1 ad * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 ad * contributors may be used to endorse or promote products derived
24 1.1 ad * from this software without specific prior written permission.
25 1.1 ad *
26 1.1 ad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 ad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 ad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 ad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 ad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 ad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 ad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 ad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 ad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 ad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 ad * POSSIBILITY OF SUCH DAMAGE.
37 1.1 ad */
38 1.1 ad
39 1.1 ad /*
40 1.1 ad * TODO:
41 1.1 ad *
42 1.1 ad * - Need better analysis and tracking of events.
43 1.1 ad * - Should be binary format agnostic, but given that we're likely to be using
44 1.1 ad * ELF for quite a while that's not a big problem.
45 1.1 ad * - Shouldn't have to parse the namelist here. We should use something like
46 1.1 ad * FreeBSD's libelf.
47 1.1 ad * - The way the namelist is searched sucks, is it worth doing something
48 1.1 ad * better?
49 1.3 ad * - Might be nice to record events and replay later, like ktrace/kdump.
50 1.1 ad */
51 1.1 ad
52 1.1 ad #include <sys/cdefs.h>
53 1.1 ad #ifndef lint
54 1.5 ad __RCSID("$NetBSD: main.c,v 1.5 2006/11/08 23:12:57 ad Exp $");
55 1.1 ad #endif /* not lint */
56 1.1 ad
57 1.1 ad #include <sys/types.h>
58 1.1 ad #include <sys/param.h>
59 1.1 ad #include <sys/time.h>
60 1.1 ad #include <sys/fcntl.h>
61 1.1 ad #include <sys/ioctl.h>
62 1.1 ad #include <sys/wait.h>
63 1.1 ad #include <sys/signal.h>
64 1.1 ad #include <sys/sysctl.h>
65 1.1 ad
66 1.2 ad #include <dev/lockstat.h>
67 1.2 ad
68 1.1 ad #include <stdio.h>
69 1.1 ad #include <stdlib.h>
70 1.1 ad #include <string.h>
71 1.1 ad #include <limits.h>
72 1.1 ad #include <unistd.h>
73 1.1 ad #include <err.h>
74 1.1 ad #include <paths.h>
75 1.1 ad #include <util.h>
76 1.1 ad #include <ctype.h>
77 1.1 ad #include <errno.h>
78 1.1 ad
79 1.1 ad #include "extern.h"
80 1.1 ad
81 1.1 ad #define _PATH_DEV_LOCKSTAT "/dev/lockstat"
82 1.1 ad
83 1.1 ad #define MILLI 1000.0
84 1.1 ad #define MICRO 1000000.0
85 1.1 ad #define NANO 1000000000.0
86 1.1 ad #define PICO 1000000000000.0
87 1.1 ad
88 1.1 ad TAILQ_HEAD(lock_head, lockstruct);
89 1.1 ad typedef struct lock_head locklist_t;
90 1.1 ad TAILQ_HEAD(buf_head, lsbuf);
91 1.1 ad typedef struct buf_head buflist_t;
92 1.1 ad
93 1.1 ad typedef struct lockstruct {
94 1.1 ad TAILQ_ENTRY(lockstruct) chain;
95 1.1 ad buflist_t bufs;
96 1.1 ad uintptr_t lock;
97 1.1 ad double times[LB_NEVENT];
98 1.1 ad uint32_t counts[LB_NEVENT];
99 1.1 ad u_int flags;
100 1.5 ad u_int nbufs;
101 1.1 ad } lock_t;
102 1.1 ad
103 1.1 ad typedef struct name {
104 1.1 ad const char *name;
105 1.1 ad int mask;
106 1.1 ad } name_t;
107 1.1 ad
108 1.1 ad const name_t locknames[] = {
109 1.1 ad { "adaptive_mutex", LB_ADAPTIVE_MUTEX },
110 1.1 ad { "adaptive_rwlock", LB_ADAPTIVE_RWLOCK },
111 1.1 ad { "spin_mutex", LB_SPIN_MUTEX },
112 1.1 ad { "spin_rwlock", LB_SPIN_RWLOCK },
113 1.1 ad { "lockmgr", LB_LOCKMGR },
114 1.1 ad { NULL, 0 }
115 1.1 ad };
116 1.1 ad
117 1.1 ad const name_t eventnames[] = {
118 1.1 ad { "spin", LB_SPIN },
119 1.1 ad { "sleep", LB_SLEEP },
120 1.1 ad { NULL, 0 },
121 1.1 ad };
122 1.1 ad
123 1.1 ad const name_t alltypes[] = {
124 1.1 ad { "Adaptive mutex spin", LB_ADAPTIVE_MUTEX | LB_SPIN },
125 1.1 ad { "Adaptive mutex sleep", LB_ADAPTIVE_MUTEX | LB_SLEEP },
126 1.1 ad { "Adaptive RW lock spin", LB_ADAPTIVE_RWLOCK | LB_SPIN },
127 1.3 ad { "Adaptive RW lock sleep", LB_ADAPTIVE_RWLOCK | LB_SLEEP },
128 1.1 ad { "Spin mutex spin", LB_SPIN_MUTEX | LB_SPIN },
129 1.1 ad { "lockmgr sleep", LB_LOCKMGR | LB_SLEEP },
130 1.5 ad #ifdef LB_KERNEL_LOCK
131 1.5 ad /* XXX newlock2 */
132 1.5 ad { "Kernel lock spin", LB_KERNEL_LOCK | LB_SPIN },
133 1.5 ad #endif
134 1.1 ad { NULL, 0 }
135 1.1 ad };
136 1.1 ad
137 1.5 ad locklist_t locklist[LB_NLOCK >> LB_LOCK_SHIFT];
138 1.1 ad
139 1.1 ad lsbuf_t *bufs;
140 1.1 ad lsdisable_t ld;
141 1.1 ad int lflag;
142 1.1 ad int nbufs;
143 1.1 ad int cflag;
144 1.1 ad int lsfd;
145 1.1 ad int displayed;
146 1.1 ad int bin64;
147 1.1 ad double tscale;
148 1.1 ad double cscale;
149 1.1 ad double cpuscale[sizeof(ld.ld_freq) / sizeof(ld.ld_freq[0])];
150 1.1 ad FILE *outfp;
151 1.1 ad
152 1.1 ad void findsym(findsym_t, char *, uintptr_t *, uintptr_t *);
153 1.1 ad void spawn(int, char **);
154 1.1 ad void display(int, const char *name);
155 1.1 ad void listnames(const name_t *);
156 1.1 ad int matchname(const name_t *, const char *);
157 1.1 ad void makelists(void);
158 1.1 ad void nullsig(int);
159 1.1 ad void usage(void);
160 1.1 ad void resort(int, int);
161 1.1 ad int ncpu(void);
162 1.1 ad
163 1.1 ad int
164 1.1 ad main(int argc, char **argv)
165 1.1 ad {
166 1.1 ad int eventtype, locktype, ch, nlfd, sflag, fd, i, pflag;
167 1.1 ad const char *nlistf, *outf;
168 1.1 ad char *lockname, *funcname;
169 1.1 ad const name_t *name;
170 1.1 ad lsenable_t le;
171 1.1 ad double ms;
172 1.1 ad char *p;
173 1.1 ad
174 1.1 ad nlistf = NULL;
175 1.1 ad outf = NULL;
176 1.1 ad lockname = NULL;
177 1.1 ad funcname = NULL;
178 1.1 ad eventtype = -1;
179 1.1 ad locktype = -1;
180 1.1 ad nbufs = 0;
181 1.1 ad sflag = 0;
182 1.1 ad pflag = 0;
183 1.1 ad
184 1.1 ad while ((ch = getopt(argc, argv, "E:F:L:M:N:T:b:ceflo:pst")) != -1)
185 1.1 ad switch (ch) {
186 1.1 ad case 'E':
187 1.1 ad eventtype = matchname(eventnames, optarg);
188 1.1 ad break;
189 1.1 ad case 'F':
190 1.1 ad funcname = optarg;
191 1.1 ad break;
192 1.1 ad case 'L':
193 1.1 ad lockname = optarg;
194 1.1 ad break;
195 1.1 ad case 'N':
196 1.1 ad nlistf = optarg;
197 1.1 ad break;
198 1.1 ad case 'T':
199 1.1 ad locktype = matchname(locknames, optarg);
200 1.1 ad break;
201 1.1 ad case 'b':
202 1.1 ad nbufs = (int)strtol(optarg, &p, 0);
203 1.1 ad if (!isdigit((u_int)*optarg) || *p != '\0')
204 1.1 ad usage();
205 1.1 ad break;
206 1.1 ad case 'c':
207 1.1 ad cflag = 1;
208 1.1 ad break;
209 1.1 ad case 'e':
210 1.1 ad listnames(eventnames);
211 1.1 ad break;
212 1.1 ad case 'l':
213 1.1 ad lflag = 1;
214 1.1 ad break;
215 1.1 ad case 'o':
216 1.1 ad outf = optarg;
217 1.1 ad break;
218 1.1 ad case 'p':
219 1.1 ad pflag = 1;
220 1.1 ad break;
221 1.1 ad case 's':
222 1.1 ad sflag = 1;
223 1.1 ad break;
224 1.1 ad case 't':
225 1.1 ad listnames(locknames);
226 1.1 ad break;
227 1.1 ad default:
228 1.1 ad usage();
229 1.1 ad }
230 1.1 ad argc -= optind;
231 1.1 ad argv += optind;
232 1.1 ad
233 1.1 ad if (*argv == NULL)
234 1.1 ad usage();
235 1.1 ad
236 1.1 ad if (outf) {
237 1.5 ad fd = open(outf, O_WRONLY | O_CREAT | O_TRUNC, 0600);
238 1.5 ad if (fd == -1)
239 1.1 ad err(EXIT_FAILURE, "opening %s", outf);
240 1.1 ad outfp = fdopen(fd, "w");
241 1.1 ad } else
242 1.1 ad outfp = stdout;
243 1.1 ad
244 1.1 ad /*
245 1.1 ad * Find the name list for resolving symbol names, and load it into
246 1.1 ad * memory.
247 1.1 ad */
248 1.1 ad if (nlistf == NULL) {
249 1.1 ad nlfd = open(_PATH_KSYMS, O_RDONLY);
250 1.1 ad nlistf = getbootfile();
251 1.1 ad } else
252 1.1 ad nlfd = -1;
253 1.1 ad if (nlfd == -1) {
254 1.1 ad if ((nlfd = open(nlistf, O_RDONLY)) < 0)
255 1.1 ad err(EXIT_FAILURE, "cannot open " _PATH_KSYMS " or %s",
256 1.1 ad nlistf);
257 1.1 ad }
258 1.1 ad if (loadsym32(nlfd) != 0) {
259 1.1 ad if (loadsym64(nlfd) != 0)
260 1.1 ad errx(EXIT_FAILURE, "unable to load symbol table");
261 1.1 ad bin64 = 1;
262 1.1 ad }
263 1.1 ad close(nlfd);
264 1.1 ad
265 1.1 ad memset(&le, 0, sizeof(le));
266 1.1 ad le.le_nbufs = nbufs;
267 1.1 ad
268 1.1 ad /*
269 1.1 ad * Set up initial filtering.
270 1.1 ad */
271 1.1 ad if (lockname != NULL) {
272 1.1 ad findsym(LOCK_BYNAME, lockname, &le.le_lock, NULL);
273 1.1 ad le.le_flags |= LE_ONE_LOCK;
274 1.1 ad }
275 1.1 ad if (!lflag)
276 1.1 ad le.le_flags |= LE_CALLSITE;
277 1.1 ad if (funcname != NULL) {
278 1.1 ad if (lflag)
279 1.1 ad usage();
280 1.1 ad findsym(FUNC_BYNAME, funcname, &le.le_csstart, &le.le_csend);
281 1.1 ad le.le_flags |= LE_ONE_CALLSITE;
282 1.1 ad }
283 1.1 ad le.le_mask = (eventtype & LB_EVENT_MASK) | (locktype & LB_LOCK_MASK);
284 1.1 ad
285 1.1 ad /*
286 1.1 ad * Start tracing.
287 1.1 ad */
288 1.1 ad if ((lsfd = open(_PATH_DEV_LOCKSTAT, O_RDONLY)) < 0)
289 1.1 ad err(EXIT_FAILURE, "cannot open " _PATH_DEV_LOCKSTAT);
290 1.1 ad if (ioctl(lsfd, IOC_LOCKSTAT_GVERSION, &ch) < 0)
291 1.1 ad err(EXIT_FAILURE, "ioctl");
292 1.1 ad if (ch != LS_VERSION)
293 1.1 ad errx(EXIT_FAILURE, "incompatible lockstat interface version");
294 1.1 ad if (ioctl(lsfd, IOC_LOCKSTAT_ENABLE, &le))
295 1.1 ad err(EXIT_FAILURE, "cannot enable tracing");
296 1.1 ad
297 1.1 ad /*
298 1.1 ad * Execute the traced program.
299 1.1 ad */
300 1.1 ad spawn(argc, argv);
301 1.1 ad
302 1.1 ad /*
303 1.1 ad * Stop tracing, and read the trace buffers from the kernel.
304 1.1 ad */
305 1.1 ad if (ioctl(lsfd, IOC_LOCKSTAT_DISABLE, &ld) == -1) {
306 1.1 ad if (errno == EOVERFLOW) {
307 1.1 ad warnx("overflowed available kernel trace buffers");
308 1.1 ad exit(EXIT_FAILURE);
309 1.1 ad }
310 1.1 ad err(EXIT_FAILURE, "cannot disable tracing");
311 1.1 ad }
312 1.1 ad if ((bufs = malloc(ld.ld_size)) == NULL)
313 1.1 ad err(EXIT_FAILURE, "cannot allocate memory for user buffers");
314 1.1 ad if (read(lsfd, bufs, ld.ld_size) != ld.ld_size)
315 1.1 ad err(EXIT_FAILURE, "reading from " _PATH_DEV_LOCKSTAT);
316 1.1 ad if (close(lsfd))
317 1.1 ad err(EXIT_FAILURE, "close(" _PATH_DEV_LOCKSTAT ")");
318 1.1 ad
319 1.1 ad /*
320 1.1 ad * Figure out how to scale the results, and build the lists. For
321 1.1 ad * internal use we convert all times from CPU frequency based to
322 1.1 ad * picoseconds, and values are eventually displayed in ms.
323 1.1 ad */
324 1.1 ad for (i = 0; i < sizeof(ld.ld_freq) / sizeof(ld.ld_freq[0]); i++)
325 1.1 ad if (ld.ld_freq[i] != 0)
326 1.1 ad cpuscale[i] = PICO / ld.ld_freq[i];
327 1.1 ad ms = ld.ld_time.tv_sec * MILLI + ld.ld_time.tv_nsec / MICRO;
328 1.1 ad if (pflag)
329 1.1 ad cscale = 1.0 / ncpu();
330 1.1 ad else
331 1.1 ad cscale = 1.0;
332 1.1 ad cscale *= (sflag ? MILLI / ms : 1.0);
333 1.1 ad tscale = cscale / NANO;
334 1.1 ad nbufs = (int)(ld.ld_size / sizeof(lsbuf_t));
335 1.1 ad makelists();
336 1.1 ad
337 1.1 ad /*
338 1.1 ad * Display the results.
339 1.1 ad */
340 1.1 ad fprintf(outfp, "Elapsed time: %.2f seconds.", ms / MILLI);
341 1.1 ad if (sflag || pflag) {
342 1.1 ad fprintf(outfp, " Displaying ");
343 1.1 ad if (pflag)
344 1.1 ad fprintf(outfp, "per-CPU ");
345 1.1 ad if (sflag)
346 1.1 ad fprintf(outfp, "per-second ");
347 1.1 ad fprintf(outfp, "averages.");
348 1.1 ad }
349 1.1 ad putc('\n', outfp);
350 1.1 ad
351 1.1 ad for (name = alltypes; name->name != NULL; name++) {
352 1.1 ad if (eventtype != -1 &&
353 1.1 ad (name->mask & LB_EVENT_MASK) != eventtype)
354 1.1 ad continue;
355 1.1 ad if (locktype != -1 &&
356 1.1 ad (name->mask & LB_LOCK_MASK) != locktype)
357 1.1 ad continue;
358 1.1 ad
359 1.1 ad display(name->mask, name->name);
360 1.1 ad }
361 1.1 ad
362 1.1 ad if (displayed == 0)
363 1.1 ad fprintf(outfp, "None of the selected events were recorded.\n");
364 1.1 ad exit(EXIT_SUCCESS);
365 1.1 ad }
366 1.1 ad
367 1.1 ad void
368 1.1 ad usage(void)
369 1.1 ad {
370 1.1 ad
371 1.1 ad fprintf(stderr,
372 1.1 ad "%s: usage:\n"
373 1.1 ad "%s [options] <command>\n\n"
374 1.1 ad "-b nbuf\t\tset number of event buffers to allocate\n"
375 1.1 ad "-c\t\treport percentage of total events by count, not time\n"
376 1.4 wiz "-E evt\t\tdisplay only one type of event\n"
377 1.1 ad "-e\t\tlist event types\n"
378 1.4 wiz "-F func\t\tlimit trace to one function\n"
379 1.4 wiz "-L lock\t\tlimit trace to one lock (name, or address)\n"
380 1.1 ad "-l\t\ttrace only by lock\n"
381 1.4 wiz "-N nlist\tspecify name list file\n"
382 1.1 ad "-o file\t\tsend output to named file, not stdout\n"
383 1.1 ad "-p\t\tshow average count/time per CPU, not total\n"
384 1.1 ad "-s\t\tshow average count/time per second, not total\n"
385 1.4 wiz "-T type\t\tdisplay only one type of lock\n"
386 1.1 ad "-t\t\tlist lock types\n",
387 1.1 ad getprogname(), getprogname());
388 1.1 ad
389 1.1 ad exit(EXIT_FAILURE);
390 1.1 ad }
391 1.1 ad
392 1.1 ad void
393 1.1 ad nullsig(int junk)
394 1.1 ad {
395 1.1 ad
396 1.1 ad (void)junk;
397 1.1 ad }
398 1.1 ad
399 1.1 ad void
400 1.1 ad listnames(const name_t *name)
401 1.1 ad {
402 1.1 ad
403 1.1 ad for (; name->name != NULL; name++)
404 1.1 ad printf("%s\n", name->name);
405 1.1 ad
406 1.1 ad exit(EXIT_SUCCESS);
407 1.1 ad }
408 1.1 ad
409 1.1 ad int
410 1.1 ad matchname(const name_t *name, const char *string)
411 1.1 ad {
412 1.1 ad
413 1.1 ad for (; name->name != NULL; name++)
414 1.1 ad if (strcasecmp(name->name, string) == 0)
415 1.1 ad return name->mask;
416 1.1 ad
417 1.1 ad warnx("unknown type `%s'", string);
418 1.1 ad usage();
419 1.1 ad return 0;
420 1.1 ad }
421 1.1 ad
422 1.1 ad /*
423 1.1 ad * Return the number of CPUs in the running system.
424 1.1 ad */
425 1.1 ad int
426 1.1 ad ncpu(void)
427 1.1 ad {
428 1.1 ad int rv, mib[2];
429 1.1 ad size_t varlen;
430 1.1 ad
431 1.1 ad mib[0] = CTL_HW;
432 1.1 ad mib[1] = HW_NCPU;
433 1.1 ad varlen = sizeof(rv);
434 1.1 ad if (sysctl(mib, 2, &rv, &varlen, NULL, (size_t)0) < 0)
435 1.1 ad rv = 1;
436 1.1 ad
437 1.1 ad return (rv);
438 1.1 ad }
439 1.1 ad
440 1.1 ad /*
441 1.1 ad * Call into the ELF parser and look up a symbol by name or by address.
442 1.1 ad */
443 1.1 ad void
444 1.1 ad findsym(findsym_t find, char *name, uintptr_t *start, uintptr_t *end)
445 1.1 ad {
446 1.1 ad uintptr_t tend;
447 1.1 ad char *p;
448 1.1 ad int rv;
449 1.1 ad
450 1.1 ad if (end == NULL)
451 1.1 ad end = &tend;
452 1.1 ad
453 1.1 ad if (find == LOCK_BYNAME) {
454 1.1 ad if (isdigit((u_int)name[0])) {
455 1.1 ad *start = (uintptr_t)strtoul(name, &p, 0);
456 1.1 ad if (*p == '\0')
457 1.1 ad return;
458 1.1 ad }
459 1.1 ad }
460 1.1 ad
461 1.1 ad if (bin64)
462 1.1 ad rv = findsym64(find, name, start, end);
463 1.1 ad else
464 1.1 ad rv = findsym32(find, name, start, end);
465 1.1 ad
466 1.1 ad if (find == FUNC_BYNAME || find == LOCK_BYNAME) {
467 1.1 ad if (rv == -1)
468 1.1 ad errx(EXIT_FAILURE, "unable to find symbol `%s'", name);
469 1.1 ad return;
470 1.1 ad }
471 1.1 ad
472 1.1 ad if (rv == -1)
473 1.1 ad sprintf(name, "0x%016lx", (long)*start);
474 1.1 ad }
475 1.1 ad
476 1.1 ad /*
477 1.1 ad * Fork off the child process and wait for it to complete. We trap SIGINT
478 1.1 ad * so that the caller can use Ctrl-C to stop tracing early and still get
479 1.1 ad * useful results.
480 1.1 ad */
481 1.1 ad void
482 1.1 ad spawn(int argc, char **argv)
483 1.1 ad {
484 1.1 ad pid_t pid;
485 1.1 ad
486 1.1 ad switch (pid = fork()) {
487 1.1 ad case 0:
488 1.1 ad close(lsfd);
489 1.1 ad if (execvp(argv[0], argv) == -1)
490 1.1 ad err(EXIT_FAILURE, "cannot exec");
491 1.1 ad break;
492 1.1 ad case -1:
493 1.1 ad err(EXIT_FAILURE, "cannot fork to exec");
494 1.1 ad break;
495 1.1 ad default:
496 1.1 ad signal(SIGINT, nullsig);
497 1.1 ad wait(NULL);
498 1.1 ad signal(SIGINT, SIG_DFL);
499 1.1 ad break;
500 1.1 ad }
501 1.1 ad }
502 1.1 ad
503 1.1 ad /*
504 1.1 ad * From the kernel supplied data, construct two dimensional lists of locks
505 1.1 ad * and event buffers, indexed by lock type.
506 1.1 ad */
507 1.1 ad void
508 1.1 ad makelists(void)
509 1.1 ad {
510 1.1 ad lsbuf_t *lb, *lb2, *max;
511 1.1 ad int i, type;
512 1.1 ad lock_t *l;
513 1.1 ad
514 1.5 ad for (i = 0; i < LB_NLOCK >> LB_LOCK_SHIFT; i++)
515 1.1 ad TAILQ_INIT(&locklist[i]);
516 1.1 ad
517 1.1 ad for (lb = bufs, max = bufs + nbufs; lb < max; lb++) {
518 1.1 ad if (lb->lb_flags == 0)
519 1.1 ad continue;
520 1.1 ad
521 1.1 ad /*
522 1.1 ad * Look for a record descibing this lock, and allocate a
523 1.1 ad * new one if needed.
524 1.1 ad */
525 1.1 ad type = ((lb->lb_flags & LB_LOCK_MASK) >> LB_LOCK_SHIFT) - 1;
526 1.1 ad TAILQ_FOREACH(l, &locklist[type], chain) {
527 1.1 ad if (l->lock == lb->lb_lock)
528 1.1 ad break;
529 1.1 ad }
530 1.1 ad if (l == NULL) {
531 1.1 ad l = (lock_t *)malloc(sizeof(*l));
532 1.1 ad l->flags = lb->lb_flags;
533 1.1 ad l->lock = lb->lb_lock;
534 1.5 ad l->nbufs = 0;
535 1.1 ad memset(&l->counts, 0, sizeof(l->counts));
536 1.1 ad memset(&l->times, 0, sizeof(l->times));
537 1.1 ad TAILQ_INIT(&l->bufs);
538 1.1 ad TAILQ_INSERT_TAIL(&locklist[type], l, chain);
539 1.1 ad }
540 1.1 ad
541 1.1 ad /*
542 1.1 ad * Scale the time values per buffer and summarise
543 1.1 ad * times+counts per lock.
544 1.1 ad */
545 1.1 ad for (i = 0; i < LB_NEVENT; i++) {
546 1.1 ad lb->lb_times[i] *= cpuscale[lb->lb_cpu];
547 1.1 ad l->counts[i] += lb->lb_counts[i];
548 1.1 ad l->times[i] += lb->lb_times[i];
549 1.1 ad }
550 1.1 ad
551 1.1 ad /*
552 1.1 ad * Merge same lock+callsite pairs from multiple CPUs
553 1.1 ad * together.
554 1.1 ad */
555 1.1 ad TAILQ_FOREACH(lb2, &l->bufs, lb_chain.tailq) {
556 1.1 ad if (lb->lb_callsite == lb2->lb_callsite)
557 1.1 ad break;
558 1.1 ad }
559 1.1 ad if (lb2 != NULL) {
560 1.1 ad for (i = 0; i < LB_NEVENT; i++) {
561 1.1 ad lb2->lb_counts[i] += lb->lb_counts[i];
562 1.1 ad lb2->lb_times[i] += lb->lb_times[i];
563 1.1 ad }
564 1.5 ad } else {
565 1.1 ad TAILQ_INSERT_HEAD(&l->bufs, lb, lb_chain.tailq);
566 1.5 ad l->nbufs++;
567 1.5 ad }
568 1.1 ad }
569 1.1 ad }
570 1.1 ad
571 1.1 ad /*
572 1.1 ad * Re-sort one list of locks / lock buffers by event type.
573 1.1 ad */
574 1.1 ad void
575 1.1 ad resort(int type, int event)
576 1.1 ad {
577 1.1 ad lsbuf_t *lb, *lb2;
578 1.1 ad locklist_t llist;
579 1.1 ad buflist_t blist;
580 1.1 ad lock_t *l, *l2;
581 1.1 ad
582 1.1 ad TAILQ_INIT(&llist);
583 1.1 ad while ((l = TAILQ_FIRST(&locklist[type])) != NULL) {
584 1.1 ad TAILQ_REMOVE(&locklist[type], l, chain);
585 1.1 ad
586 1.1 ad /*
587 1.1 ad * Sort the buffers into the per-lock list.
588 1.1 ad */
589 1.1 ad TAILQ_INIT(&blist);
590 1.1 ad while ((lb = TAILQ_FIRST(&l->bufs)) != NULL) {
591 1.1 ad TAILQ_REMOVE(&l->bufs, lb, lb_chain.tailq);
592 1.1 ad
593 1.1 ad lb2 = TAILQ_FIRST(&blist);
594 1.1 ad while (lb2 != NULL) {
595 1.1 ad if (cflag) {
596 1.1 ad if (lb->lb_counts[event] >
597 1.1 ad lb2->lb_counts[event])
598 1.1 ad break;
599 1.1 ad } else if (lb->lb_times[event] >
600 1.1 ad lb2->lb_times[event])
601 1.1 ad break;
602 1.1 ad lb2 = TAILQ_NEXT(lb2, lb_chain.tailq);
603 1.1 ad }
604 1.1 ad if (lb2 == NULL)
605 1.1 ad TAILQ_INSERT_TAIL(&blist, lb, lb_chain.tailq);
606 1.1 ad else
607 1.1 ad TAILQ_INSERT_BEFORE(lb2, lb, lb_chain.tailq);
608 1.1 ad }
609 1.1 ad l->bufs = blist;
610 1.1 ad
611 1.1 ad /*
612 1.1 ad * Sort this lock into the per-type list, based on the
613 1.1 ad * totals per lock.
614 1.1 ad */
615 1.1 ad l2 = TAILQ_FIRST(&llist);
616 1.1 ad while (l2 != NULL) {
617 1.1 ad if (cflag) {
618 1.1 ad if (l->counts[event] > l2->counts[event])
619 1.1 ad break;
620 1.1 ad } else if (l->times[event] > l2->times[event])
621 1.1 ad break;
622 1.1 ad l2 = TAILQ_NEXT(l2, chain);
623 1.1 ad }
624 1.1 ad if (l2 == NULL)
625 1.1 ad TAILQ_INSERT_TAIL(&llist, l, chain);
626 1.1 ad else
627 1.1 ad TAILQ_INSERT_BEFORE(l2, l, chain);
628 1.1 ad }
629 1.1 ad locklist[type] = llist;
630 1.1 ad }
631 1.1 ad
632 1.1 ad /*
633 1.1 ad * Display a summary table for one lock type / event type pair.
634 1.1 ad */
635 1.1 ad void
636 1.1 ad display(int mask, const char *name)
637 1.1 ad {
638 1.1 ad lock_t *l;
639 1.1 ad lsbuf_t *lb;
640 1.1 ad int event, type;
641 1.1 ad double pcscale, metric;
642 1.1 ad char lname[256], fname[256];
643 1.1 ad
644 1.1 ad type = ((mask & LB_LOCK_MASK) >> LB_LOCK_SHIFT) - 1;
645 1.5 ad if (TAILQ_EMPTY(&locklist[type]))
646 1.1 ad return;
647 1.1 ad
648 1.1 ad event = (mask & LB_EVENT_MASK) - 1;
649 1.1 ad resort(type, event);
650 1.1 ad
651 1.1 ad fprintf(outfp, "\n-- %s\n\n"
652 1.5 ad "Total%% Count Time/ms Lock Caller\n"
653 1.5 ad "------ ------- --------- ---------------------- ------------------------------\n",
654 1.1 ad name);
655 1.1 ad
656 1.1 ad /*
657 1.1 ad * Sum up all events for this type of lock + event.
658 1.1 ad */
659 1.1 ad pcscale = 0;
660 1.1 ad TAILQ_FOREACH(l, &locklist[type], chain) {
661 1.1 ad if (cflag)
662 1.1 ad pcscale += l->counts[event];
663 1.1 ad else
664 1.1 ad pcscale += l->times[event];
665 1.1 ad displayed++;
666 1.1 ad }
667 1.1 ad if (pcscale == 0)
668 1.1 ad pcscale = 100;
669 1.1 ad else
670 1.1 ad pcscale = (100.0 / pcscale);
671 1.1 ad
672 1.1 ad /*
673 1.1 ad * For each lock, print a summary total, followed by a breakdown by
674 1.1 ad * caller.
675 1.1 ad */
676 1.1 ad TAILQ_FOREACH(l, &locklist[type], chain) {
677 1.1 ad if (cflag)
678 1.1 ad metric = l->counts[event];
679 1.1 ad else
680 1.1 ad metric = l->times[event];
681 1.1 ad metric *= pcscale;
682 1.1 ad
683 1.1 ad findsym(LOCK_BYADDR, lname, &l->lock, NULL);
684 1.1 ad
685 1.5 ad if (l->nbufs > 1)
686 1.5 ad fprintf(outfp, "%6.2f %7d %9.2f %-22s <all>\n", metric,
687 1.5 ad (int)(l->counts[event] * cscale),
688 1.5 ad l->times[event] * tscale, lname);
689 1.1 ad
690 1.1 ad if (lflag)
691 1.1 ad continue;
692 1.1 ad
693 1.1 ad TAILQ_FOREACH(lb, &l->bufs, lb_chain.tailq) {
694 1.1 ad if (cflag)
695 1.1 ad metric = lb->lb_counts[event];
696 1.1 ad else
697 1.1 ad metric = lb->lb_times[event];
698 1.1 ad metric *= pcscale;
699 1.1 ad
700 1.1 ad findsym(FUNC_BYADDR, fname, &lb->lb_callsite, NULL);
701 1.5 ad fprintf(outfp, "%6.2f %7d %9.2f %-22s %s\n", metric,
702 1.1 ad (int)(lb->lb_counts[event] * cscale),
703 1.1 ad lb->lb_times[event] * tscale,
704 1.1 ad lname, fname);
705 1.1 ad }
706 1.1 ad }
707 1.1 ad }
708