sampleip_user.c 4.8 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0-only
2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 * sampleip: sample instruction pointer and frequency count in a BPF map.
 *
 * Copyright 2016 Netflix, Inc.
 */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <signal.h>
#include <string.h>
#include <linux/perf_event.h>
#include <linux/ptrace.h>
#include <linux/bpf.h>
16
#include <bpf/bpf.h>
17
#include <bpf/libbpf.h>
18
#include "perf-sys.h"
19
#include "trace_helpers.h"
20 21 22 23 24 25

#define DEFAULT_FREQ	99
#define DEFAULT_SECS	5
#define MAX_IPS		8192
#define PAGE_OFFSET	0xffff880000000000

26
static int map_fd;
27 28 29 30 31 32 33 34 35
static int nr_cpus;

static void usage(void)
{
	printf("USAGE: sampleip [-F freq] [duration]\n");
	printf("       -F freq    # sample frequency (Hertz), default 99\n");
	printf("       duration   # sampling duration (seconds), default 5\n");
}

36 37
static int sampling_start(int freq, struct bpf_program *prog,
			  struct bpf_link *links[])
38
{
39
	int i, pmu_fd;
40 41 42 43 44 45 46 47 48 49

	struct perf_event_attr pe_sample_attr = {
		.type = PERF_TYPE_SOFTWARE,
		.freq = 1,
		.sample_period = freq,
		.config = PERF_COUNT_SW_CPU_CLOCK,
		.inherit = 1,
	};

	for (i = 0; i < nr_cpus; i++) {
50
		pmu_fd = sys_perf_event_open(&pe_sample_attr, -1 /* pid */, i,
51
					    -1 /* group_fd */, 0 /* flags */);
52
		if (pmu_fd < 0) {
53 54 55
			fprintf(stderr, "ERROR: Initializing perf sampling\n");
			return 1;
		}
56
		links[i] = bpf_program__attach_perf_event(prog, pmu_fd);
57
		if (libbpf_get_error(links[i])) {
58 59 60 61 62
			fprintf(stderr, "ERROR: Attach perf event\n");
			links[i] = NULL;
			close(pmu_fd);
			return 1;
		}
63 64 65 66 67
	}

	return 0;
}

68
static void sampling_end(struct bpf_link *links[])
69 70 71 72
{
	int i;

	for (i = 0; i < nr_cpus; i++)
73
		bpf_link__destroy(links[i]);
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
}

struct ipcount {
	__u64 ip;
	__u32 count;
};

/* used for sorting */
struct ipcount counts[MAX_IPS];

static int count_cmp(const void *p1, const void *p2)
{
	return ((struct ipcount *)p1)->count - ((struct ipcount *)p2)->count;
}

static void print_ip_map(int fd)
{
	struct ksym *sym;
	__u64 key, next_key;
	__u32 value;
	int i, max;

	printf("%-19s %-32s %s\n", "ADDR", "KSYM", "COUNT");

	/* fetch IPs and counts */
	key = 0, i = 0;
100 101
	while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
		bpf_map_lookup_elem(fd, &next_key, &value);
102 103 104 105 106 107 108 109 110 111 112
		counts[i].ip = next_key;
		counts[i++].count = value;
		key = next_key;
	}
	max = i;

	/* sort and print */
	qsort(counts, max, sizeof(struct ipcount), count_cmp);
	for (i = 0; i < max; i++) {
		if (counts[i].ip > PAGE_OFFSET) {
			sym = ksym_search(counts[i].ip);
113 114 115 116 117
			if (!sym) {
				printf("ksym not found. Is kallsyms loaded?\n");
				continue;
			}

118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134
			printf("0x%-17llx %-32s %u\n", counts[i].ip, sym->name,
			       counts[i].count);
		} else {
			printf("0x%-17llx %-32s %u\n", counts[i].ip, "(user)",
			       counts[i].count);
		}
	}

	if (max == MAX_IPS) {
		printf("WARNING: IP hash was full (max %d entries); ", max);
		printf("may have dropped samples\n");
	}
}

static void int_exit(int sig)
{
	printf("\n");
135
	print_ip_map(map_fd);
136 137 138 139 140
	exit(0);
}

int main(int argc, char **argv)
{
141 142 143 144
	int opt, freq = DEFAULT_FREQ, secs = DEFAULT_SECS, error = 1;
	struct bpf_object *obj = NULL;
	struct bpf_program *prog;
	struct bpf_link **links;
145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172
	char filename[256];

	/* process arguments */
	while ((opt = getopt(argc, argv, "F:h")) != -1) {
		switch (opt) {
		case 'F':
			freq = atoi(optarg);
			break;
		case 'h':
		default:
			usage();
			return 0;
		}
	}
	if (argc - optind == 1)
		secs = atoi(argv[optind]);
	if (freq == 0 || secs == 0) {
		usage();
		return 1;
	}

	/* initialize kernel symbol translation */
	if (load_kallsyms()) {
		fprintf(stderr, "ERROR: loading /proc/kallsyms\n");
		return 2;
	}

	/* create perf FDs for each CPU */
173 174 175 176 177
	nr_cpus = sysconf(_SC_NPROCESSORS_ONLN);
	links = calloc(nr_cpus, sizeof(struct bpf_link *));
	if (!links) {
		fprintf(stderr, "ERROR: malloc of links\n");
		goto cleanup;
178 179 180
	}

	snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
181
	obj = bpf_object__open_file(filename, NULL);
182
	if (libbpf_get_error(obj)) {
183 184 185 186 187 188 189 190 191
		fprintf(stderr, "ERROR: opening BPF object file failed\n");
		obj = NULL;
		goto cleanup;
	}

	prog = bpf_object__find_program_by_name(obj, "do_sample");
	if (!prog) {
		fprintf(stderr, "ERROR: finding a prog in obj file failed\n");
		goto cleanup;
192
	}
193 194 195 196 197 198 199 200 201 202 203 204 205

	/* load BPF program */
	if (bpf_object__load(obj)) {
		fprintf(stderr, "ERROR: loading BPF object file failed\n");
		goto cleanup;
	}

	map_fd = bpf_object__find_map_fd_by_name(obj, "ip_map");
	if (map_fd < 0) {
		fprintf(stderr, "ERROR: finding a map in obj file failed\n");
		goto cleanup;
	}

206
	signal(SIGINT, int_exit);
207
	signal(SIGTERM, int_exit);
208 209 210 211

	/* do sampling */
	printf("Sampling at %d Hertz for %d seconds. Ctrl-C also ends.\n",
	       freq, secs);
212 213 214
	if (sampling_start(freq, prog, links) != 0)
		goto cleanup;

215
	sleep(secs);
216
	error = 0;
217

218 219
cleanup:
	sampling_end(links);
220
	/* output sample counts */
221 222
	if (!error)
		print_ip_map(map_fd);
223

224 225 226
	free(links);
	bpf_object__close(obj);
	return error;
227
}