builtin-list.c 3.5 KB
Newer Older
1 2 3 4 5 6 7
/*
 * builtin-list.c
 *
 * Builtin list command: list all event types
 *
 * Copyright (C) 2009, Thomas Gleixner <tglx@linutronix.de>
 * Copyright (C) 2008-2009, Red Hat Inc, Ingo Molnar <mingo@redhat.com>
8
 * Copyright (C) 2011, Red Hat Inc, Arnaldo Carvalho de Melo <acme@redhat.com>
9 10 11 12 13 14
 */
#include "builtin.h"

#include "perf.h"

#include "util/parse-events.h"
15
#include "util/cache.h"
16
#include "util/pmu.h"
17
#include "util/debug.h"
18
#include <subcmd/parse-options.h>
19

A
Andi Kleen 已提交
20
static bool desc_flag = true;
21
static bool details_flag;
A
Andi Kleen 已提交
22

23
int cmd_list(int argc, const char **argv, const char *prefix __maybe_unused)
24
{
25
	int i;
T
Taesoo Kim 已提交
26
	bool raw_dump = false;
27
	bool long_desc_flag = false;
T
Taesoo Kim 已提交
28 29
	struct option list_options[] = {
		OPT_BOOLEAN(0, "raw-dump", &raw_dump, "Dump raw events"),
A
Andi Kleen 已提交
30 31
		OPT_BOOLEAN('d', "desc", &desc_flag,
			    "Print extra event descriptions. --no-desc to not print."),
32 33
		OPT_BOOLEAN('v', "long-desc", &long_desc_flag,
			    "Print longer event descriptions."),
34 35
		OPT_BOOLEAN(0, "details", &details_flag,
			    "Print information on the perf event names and expressions used internally by events."),
36 37
		OPT_INCR(0, "debug", &verbose,
			     "Enable debugging output"),
D
David Ahern 已提交
38 39 40
		OPT_END()
	};
	const char * const list_usage[] = {
41
		"perf list [<options>] [hw|sw|cache|tracepoint|pmu|sdt|event_glob]",
D
David Ahern 已提交
42 43 44
		NULL
	};

T
Taesoo Kim 已提交
45 46
	set_option_flag(list_options, 0, "raw-dump", PARSE_OPT_HIDDEN);

D
David Ahern 已提交
47 48
	argc = parse_options(argc, argv, list_options, list_usage,
			     PARSE_OPT_STOP_AT_NON_OPTION);
49

50
	setup_pager();
51

52
	if (!raw_dump && pager_in_use())
53 54
		printf("\nList of pre-defined events (to be used in -e):\n\n");

D
David Ahern 已提交
55
	if (argc == 0) {
56 57
		print_events(NULL, raw_dump, !desc_flag, long_desc_flag,
				details_flag);
58 59
		return 0;
	}
60

D
David Ahern 已提交
61
	for (i = 0; i < argc; ++i) {
62 63
		char *sep, *s;

64
		if (strcmp(argv[i], "tracepoint") == 0)
65
			print_tracepoint_events(NULL, NULL, raw_dump);
66 67
		else if (strcmp(argv[i], "hw") == 0 ||
			 strcmp(argv[i], "hardware") == 0)
68
			print_symbol_events(NULL, PERF_TYPE_HARDWARE,
69
					event_symbols_hw, PERF_COUNT_HW_MAX, raw_dump);
70 71
		else if (strcmp(argv[i], "sw") == 0 ||
			 strcmp(argv[i], "software") == 0)
72
			print_symbol_events(NULL, PERF_TYPE_SOFTWARE,
73
					event_symbols_sw, PERF_COUNT_SW_MAX, raw_dump);
74 75
		else if (strcmp(argv[i], "cache") == 0 ||
			 strcmp(argv[i], "hwcache") == 0)
76
			print_hwcache_events(NULL, raw_dump);
77
		else if (strcmp(argv[i], "pmu") == 0)
78
			print_pmu_events(NULL, raw_dump, !desc_flag,
79
						long_desc_flag, details_flag);
80 81
		else if (strcmp(argv[i], "sdt") == 0)
			print_sdt_events(NULL, NULL, raw_dump);
82
		else if ((sep = strchr(argv[i], ':')) != NULL) {
83
			int sep_idx;
84

85
			if (sep == NULL) {
86
				print_events(argv[i], raw_dump, !desc_flag,
87 88
							long_desc_flag,
							details_flag);
89
				continue;
90
			}
91 92 93 94 95 96
			sep_idx = sep - argv[i];
			s = strdup(argv[i]);
			if (s == NULL)
				return -1;

			s[sep_idx] = '\0';
97
			print_tracepoint_events(s, s + sep_idx + 1, raw_dump);
98
			print_sdt_events(s, s + sep_idx + 1, raw_dump);
99
			free(s);
100 101 102 103 104 105 106 107 108 109
		} else {
			if (asprintf(&s, "*%s*", argv[i]) < 0) {
				printf("Critical: Not enough memory! Trying to continue...\n");
				continue;
			}
			print_symbol_events(s, PERF_TYPE_HARDWARE,
					    event_symbols_hw, PERF_COUNT_HW_MAX, raw_dump);
			print_symbol_events(s, PERF_TYPE_SOFTWARE,
					    event_symbols_sw, PERF_COUNT_SW_MAX, raw_dump);
			print_hwcache_events(s, raw_dump);
110
			print_pmu_events(s, raw_dump, !desc_flag,
111 112
						long_desc_flag,
						details_flag);
113
			print_tracepoint_events(NULL, s, raw_dump);
114
			print_sdt_events(NULL, s, raw_dump);
115
			free(s);
116 117
		}
	}
118 119
	return 0;
}