1b2ca2e50SMatt Macy /*-
2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause
3b2ca2e50SMatt Macy *
4b2ca2e50SMatt Macy * Copyright (c) 2018, Matthew Macy
5b2ca2e50SMatt Macy *
6b2ca2e50SMatt Macy * Redistribution and use in source and binary forms, with or without
7b2ca2e50SMatt Macy * modification, are permitted provided that the following conditions
8b2ca2e50SMatt Macy * are met:
9b2ca2e50SMatt Macy * 1. Redistributions of source code must retain the above copyright
10b2ca2e50SMatt Macy * notice, this list of conditions and the following disclaimer.
11b2ca2e50SMatt Macy * 2. Redistributions in binary form must reproduce the above copyright
12b2ca2e50SMatt Macy * notice, this list of conditions and the following disclaimer in the
13b2ca2e50SMatt Macy * documentation and/or other materials provided with the distribution.
14b2ca2e50SMatt Macy *
15b2ca2e50SMatt Macy * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16b2ca2e50SMatt Macy * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17b2ca2e50SMatt Macy * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18b2ca2e50SMatt Macy * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19b2ca2e50SMatt Macy * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20b2ca2e50SMatt Macy * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21b2ca2e50SMatt Macy * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22b2ca2e50SMatt Macy * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23b2ca2e50SMatt Macy * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24b2ca2e50SMatt Macy * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25b2ca2e50SMatt Macy * SUCH DAMAGE.
26b2ca2e50SMatt Macy *
27b2ca2e50SMatt Macy */
28b2ca2e50SMatt Macy
29b2ca2e50SMatt Macy #include <sys/param.h>
30b2ca2e50SMatt Macy #include <sys/cpuset.h>
31b2ca2e50SMatt Macy #include <sys/event.h>
32b2ca2e50SMatt Macy #include <sys/queue.h>
33b2ca2e50SMatt Macy #include <sys/socket.h>
34b2ca2e50SMatt Macy #include <sys/stat.h>
35b2ca2e50SMatt Macy #include <sys/sysctl.h>
36b2ca2e50SMatt Macy #include <sys/time.h>
37b2ca2e50SMatt Macy #include <sys/ttycom.h>
38b2ca2e50SMatt Macy #include <sys/user.h>
39b2ca2e50SMatt Macy #include <sys/wait.h>
40b2ca2e50SMatt Macy
41b2ca2e50SMatt Macy #include <assert.h>
42b2ca2e50SMatt Macy #include <curses.h>
43b2ca2e50SMatt Macy #include <err.h>
44b2ca2e50SMatt Macy #include <errno.h>
45b2ca2e50SMatt Macy #include <fcntl.h>
46b2ca2e50SMatt Macy #include <getopt.h>
47b2ca2e50SMatt Macy #include <kvm.h>
48b2ca2e50SMatt Macy #include <libgen.h>
49b2ca2e50SMatt Macy #include <limits.h>
50b2ca2e50SMatt Macy #include <locale.h>
51b2ca2e50SMatt Macy #include <math.h>
52b2ca2e50SMatt Macy #include <pmc.h>
53b2ca2e50SMatt Macy #include <pmclog.h>
54b2ca2e50SMatt Macy #include <regex.h>
55b2ca2e50SMatt Macy #include <signal.h>
56b2ca2e50SMatt Macy #include <stdarg.h>
57b2ca2e50SMatt Macy #include <stdint.h>
58b2ca2e50SMatt Macy #include <stdio.h>
59b2ca2e50SMatt Macy #include <stdlib.h>
60b2ca2e50SMatt Macy #include <stddef.h>
61b2ca2e50SMatt Macy #include <string.h>
62b2ca2e50SMatt Macy #include <sysexits.h>
63b2ca2e50SMatt Macy #include <unistd.h>
64b2ca2e50SMatt Macy
65b2ca2e50SMatt Macy #include <libpmcstat.h>
66b2ca2e50SMatt Macy #include "cmd_pmc.h"
67b2ca2e50SMatt Macy
68b2ca2e50SMatt Macy #include <iostream>
69b2ca2e50SMatt Macy #include <string>
70b2ca2e50SMatt Macy #include <vector>
71b2ca2e50SMatt Macy #include <unordered_map>
72b2ca2e50SMatt Macy
73b2ca2e50SMatt Macy using std::unordered_map;
74b2ca2e50SMatt Macy typedef unordered_map <int, std::string> idmap;
75b2ca2e50SMatt Macy typedef unordered_map <uint32_t, uint64_t> intmap;
76b2ca2e50SMatt Macy typedef unordered_map <std::string, intmap> strintmap;
77b2ca2e50SMatt Macy typedef std::pair<uint64_t, uint32_t> sampleid;
78b2ca2e50SMatt Macy typedef std::pair<uint64_t, std::string> samplename;
79b2ca2e50SMatt Macy typedef unordered_map <uint32_t, std::vector<samplename>> eventcountmap;
80b2ca2e50SMatt Macy
8132b68c46SEitan Adler static void __dead2
usage(void)82b2ca2e50SMatt Macy usage(void)
83b2ca2e50SMatt Macy {
84b2ca2e50SMatt Macy errx(EX_USAGE,
85b2ca2e50SMatt Macy "\t summarize log file\n"
86b2ca2e50SMatt Macy "\t -k <k>, --topk <k> show topk processes for each counter\n"
87b2ca2e50SMatt Macy );
88b2ca2e50SMatt Macy }
89b2ca2e50SMatt Macy
90b2ca2e50SMatt Macy static int
pmc_summary_handler(int logfd,int k,bool do_full)91b2ca2e50SMatt Macy pmc_summary_handler(int logfd, int k, bool do_full)
92b2ca2e50SMatt Macy {
93b2ca2e50SMatt Macy struct pmclog_parse_state *ps;
94b2ca2e50SMatt Macy struct pmclog_ev ev;
95b2ca2e50SMatt Macy idmap pidmap, tidmap, eventnamemap;
96b2ca2e50SMatt Macy strintmap tideventmap, pideventmap;
97b2ca2e50SMatt Macy intmap eventmap, pmcidmap, ratemap;
98b2ca2e50SMatt Macy intmap kerntidmap, kernpidmap;
99b2ca2e50SMatt Macy eventcountmap countmap;
100b2ca2e50SMatt Macy
101b2ca2e50SMatt Macy ps = static_cast<struct pmclog_parse_state*>(pmclog_open(logfd));
102b2ca2e50SMatt Macy if (ps == NULL)
103b2ca2e50SMatt Macy errx(EX_OSERR, "ERROR: Cannot allocate pmclog parse state: %s\n",
104b2ca2e50SMatt Macy strerror(errno));
105b2ca2e50SMatt Macy while (pmclog_read(ps, &ev) == 0) {
106b2ca2e50SMatt Macy if (ev.pl_type == PMCLOG_TYPE_PMCALLOCATE) {
107b2ca2e50SMatt Macy pmcidmap[ev.pl_u.pl_a.pl_pmcid] = ev.pl_u.pl_a.pl_event;
108b2ca2e50SMatt Macy ratemap[ev.pl_u.pl_a.pl_event] = ev.pl_u.pl_a.pl_rate;
109b2ca2e50SMatt Macy eventnamemap[ev.pl_u.pl_a.pl_event] = ev.pl_u.pl_a.pl_evname;
110b2ca2e50SMatt Macy }
111b2ca2e50SMatt Macy if (ev.pl_type == PMCLOG_TYPE_THR_CREATE) {
112b2ca2e50SMatt Macy tidmap[ev.pl_u.pl_tc.pl_tid] = ev.pl_u.pl_tc.pl_tdname;
113b2ca2e50SMatt Macy kerntidmap[ev.pl_u.pl_tc.pl_tid] = !!(ev.pl_u.pl_tc.pl_flags & P_KPROC);
114b2ca2e50SMatt Macy if (tideventmap.find(ev.pl_u.pl_tc.pl_tdname) == tideventmap.end())
115b2ca2e50SMatt Macy tideventmap[ev.pl_u.pl_tc.pl_tdname] = intmap();
116b2ca2e50SMatt Macy }
117b2ca2e50SMatt Macy if (ev.pl_type == PMCLOG_TYPE_PROC_CREATE) {
118b2ca2e50SMatt Macy pidmap[ev.pl_u.pl_pc.pl_pid] = ev.pl_u.pl_pc.pl_pcomm;
119b2ca2e50SMatt Macy kernpidmap[ev.pl_u.pl_pc.pl_pid] = !!(ev.pl_u.pl_pc.pl_flags & P_KPROC);
120b2ca2e50SMatt Macy if (pideventmap.find(ev.pl_u.pl_pc.pl_pcomm) == pideventmap.end())
121b2ca2e50SMatt Macy pideventmap[ev.pl_u.pl_pc.pl_pcomm] = intmap();
122b2ca2e50SMatt Macy }
123b2ca2e50SMatt Macy if (ev.pl_type == PMCLOG_TYPE_CALLCHAIN) {
124b2ca2e50SMatt Macy auto event = pmcidmap[ev.pl_u.pl_cc.pl_pmcid];
125b2ca2e50SMatt Macy
126b2ca2e50SMatt Macy if (event == 0)
127b2ca2e50SMatt Macy continue;
128b2ca2e50SMatt Macy eventmap[event]++;
129b2ca2e50SMatt Macy auto tidname = tidmap.find(ev.pl_u.pl_cc.pl_tid);
130b2ca2e50SMatt Macy auto pidname = pidmap.find(ev.pl_u.pl_cc.pl_pid);
131b2ca2e50SMatt Macy if (tidname != tidmap.end()) {
132b2ca2e50SMatt Macy auto &teventmap = tideventmap[tidname->second];
133b2ca2e50SMatt Macy teventmap[event]++;
134b2ca2e50SMatt Macy }
135b2ca2e50SMatt Macy if (pidname != pidmap.end()) {
136b2ca2e50SMatt Macy auto &peventmap = pideventmap[pidname->second];
137b2ca2e50SMatt Macy peventmap[event]++;
138b2ca2e50SMatt Macy }
139b2ca2e50SMatt Macy }
140b2ca2e50SMatt Macy }
141b2ca2e50SMatt Macy for (auto &pkv : pideventmap)
142b2ca2e50SMatt Macy for (auto &ekv : pkv.second) {
143b2ca2e50SMatt Macy auto &samplevec = countmap[ekv.first];
144b2ca2e50SMatt Macy samplevec.emplace_back(ekv.second, pkv.first);
145b2ca2e50SMatt Macy }
146b2ca2e50SMatt Macy for (auto &kv : countmap)
147b2ca2e50SMatt Macy std::sort(kv.second.begin(), kv.second.end(), [](auto &a, auto &b) {return (a.first < b.first);});
148b2ca2e50SMatt Macy if (do_full) {
149b2ca2e50SMatt Macy for (auto &kv : countmap) {
150b2ca2e50SMatt Macy auto &name = eventnamemap[kv.first];
151b2ca2e50SMatt Macy auto rate = ratemap[kv.first];
152b2ca2e50SMatt Macy std::cout << "idx: " << kv.first << " name: " << name << " rate: " << rate << std::endl;
153b2ca2e50SMatt Macy while (!kv.second.empty()) {
1542e47aedfSEric van Gyzen auto val = kv.second.back();
155b2ca2e50SMatt Macy kv.second.pop_back();
156b2ca2e50SMatt Macy std::cout << val.second << ": " << val.first << std::endl;
157b2ca2e50SMatt Macy }
158b2ca2e50SMatt Macy }
159b2ca2e50SMatt Macy return (0);
160b2ca2e50SMatt Macy }
161b2ca2e50SMatt Macy for (auto &kv : countmap) {
162b2ca2e50SMatt Macy auto &name = eventnamemap[kv.first];
163b2ca2e50SMatt Macy auto rate = ratemap[kv.first];
164b2ca2e50SMatt Macy std::cout << name << ":" << std::endl;
165b2ca2e50SMatt Macy for (auto i = 0; i < k; i++) {
166b2ca2e50SMatt Macy auto largest = kv.second.back();
167b2ca2e50SMatt Macy kv.second.pop_back();
168b2ca2e50SMatt Macy std::cout << "\t" << largest.second << ": " << largest.first*rate << std::endl;
169b2ca2e50SMatt Macy }
170b2ca2e50SMatt Macy }
171b2ca2e50SMatt Macy return (0);
172b2ca2e50SMatt Macy }
173b2ca2e50SMatt Macy
174b2ca2e50SMatt Macy static struct option longopts[] = {
175b2ca2e50SMatt Macy {"full", no_argument, NULL, 'f'},
176b2ca2e50SMatt Macy {"topk", required_argument, NULL, 'k'},
177b2ca2e50SMatt Macy {NULL, 0, NULL, 0}
178b2ca2e50SMatt Macy };
179b2ca2e50SMatt Macy
180b2ca2e50SMatt Macy int
cmd_pmc_summary(int argc,char ** argv)181b2ca2e50SMatt Macy cmd_pmc_summary(int argc, char **argv)
182b2ca2e50SMatt Macy {
183b2ca2e50SMatt Macy int option, logfd, k;
184b2ca2e50SMatt Macy bool do_full;
185b2ca2e50SMatt Macy
186b2ca2e50SMatt Macy do_full = false;
187b2ca2e50SMatt Macy k = 5;
188b2ca2e50SMatt Macy while ((option = getopt_long(argc, argv, "k:f", longopts, NULL)) != -1) {
189b2ca2e50SMatt Macy switch (option) {
190b2ca2e50SMatt Macy case 'f':
191b2ca2e50SMatt Macy do_full = 1;
192b2ca2e50SMatt Macy break;
193b2ca2e50SMatt Macy case 'k':
194b2ca2e50SMatt Macy k = atoi(optarg);
195b2ca2e50SMatt Macy break;
196b2ca2e50SMatt Macy case '?':
197b2ca2e50SMatt Macy default:
198b2ca2e50SMatt Macy usage();
199b2ca2e50SMatt Macy }
200b2ca2e50SMatt Macy }
201b2ca2e50SMatt Macy argc -= optind;
202b2ca2e50SMatt Macy argv += optind;
203b2ca2e50SMatt Macy if (argc != 1) {
204b2ca2e50SMatt Macy printf("argc: %d\n", argc);
205b2ca2e50SMatt Macy for (int i = 0; i < argc; i++)
206b2ca2e50SMatt Macy printf("%s\n", argv[i]);
207b2ca2e50SMatt Macy usage();
208b2ca2e50SMatt Macy }
209b2ca2e50SMatt Macy if ((logfd = open(argv[0], O_RDONLY,
210b2ca2e50SMatt Macy S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH)) < 0)
211b2ca2e50SMatt Macy errx(EX_OSERR, "ERROR: Cannot open \"%s\" for reading: %s.", argv[0],
212b2ca2e50SMatt Macy strerror(errno));
213b2ca2e50SMatt Macy
214b2ca2e50SMatt Macy return (pmc_summary_handler(logfd, k, do_full));
215b2ca2e50SMatt Macy }
216