[linux-2.6-block.git] / tools / perf / tests / hists_link.c

#include "perf.h"
#include "tests.h"
#include "debug.h"
#include "symbol.h"
#include "sort.h"
#include "evsel.h"
#include "evlist.h"
#include "machine.h"
#include "thread.h"
#include "parse-events.h"
#include "hists_common.h"

struct sample {
	u32 pid;
	u64 ip;
	struct thread *thread;
	struct map *map;
	struct symbol *sym;
};

/* For the numbers, see hists_common.c */
static struct sample fake_common_samples[] = {
	/* perf [kernel] schedule() */
	{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_KERNEL_SCHEDULE, },
	/* perf [perf]   main() */
	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_PERF_MAIN, },
	/* perf [perf]   cmd_record() */
	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_PERF_CMD_RECORD, },
	/* bash [bash]   xmalloc() */
	{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_BASH_XMALLOC, },
	/* bash [libc]   malloc() */
	{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_LIBC_MALLOC, },
};

static struct sample fake_samples[][5] = {
	{
		/* perf [perf]   run_command() */
		{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_PERF_RUN_COMMAND, },
		/* perf [libc]   malloc() */
		{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_LIBC_MALLOC, },
		/* perf [kernel] page_fault() */
		{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_KERNEL_PAGE_FAULT, },
		/* perf [kernel] sys_perf_event_open() */
		{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_KERNEL_SYS_PERF_EVENT_OPEN, },
		/* bash [libc]   free() */
		{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_LIBC_FREE, },
	},
	{
		/* perf [libc]   free() */
		{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_LIBC_FREE, },
		/* bash [libc]   malloc() */
		{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_LIBC_MALLOC, }, /* will be merged */
		/* bash [bash]   xfee() */
		{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_BASH_XFREE, },
		/* bash [libc]   realloc() */
		{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_LIBC_REALLOC, },
		/* bash [kernel] page_fault() */
		{ .pid = FAKE_PID_BASH,  .ip = FAKE_IP_KERNEL_PAGE_FAULT, },
	},
};

static int add_hist_entries(struct perf_evlist *evlist, struct machine *machine)
{
	struct perf_evsel *evsel;
	struct addr_location al;
	struct hist_entry *he;
	struct perf_sample sample = { .period = 1, };
	size_t i = 0, k;

	/*
	 * each evsel will have 10 samples - 5 common and 5 distinct.
	 * However the second evsel also has a collapsed entry for
	 * "bash [libc] malloc" so total 9 entries will be in the tree.
	 */
	evlist__for_each(evlist, evsel) {
		struct hists *hists = evsel__hists(evsel);

		for (k = 0; k < ARRAY_SIZE(fake_common_samples); k++) {
			const union perf_event event = {
				.header = {
					.misc = PERF_RECORD_MISC_USER,
				},
			};

			sample.pid = fake_common_samples[k].pid;
			sample.tid = fake_common_samples[k].pid;
			sample.ip = fake_common_samples[k].ip;
			if (perf_event__preprocess_sample(&event, machine, &al,
							  &sample) < 0)
				goto out;

			he = __hists__add_entry(hists, &al, NULL,
						NULL, NULL, 1, 1, 0, true);
			if (he == NULL) {
				addr_location__put(&al);
				goto out;
			}

			fake_common_samples[k].thread = al.thread;
			fake_common_samples[k].map = al.map;
			fake_common_samples[k].sym = al.sym;
		}

		for (k = 0; k < ARRAY_SIZE(fake_samples[i]); k++) {
			const union perf_event event = {
				.header = {
					.misc = PERF_RECORD_MISC_USER,
				},
			};

			sample.pid = fake_samples[i][k].pid;
			sample.tid = fake_samples[i][k].pid;
			sample.ip = fake_samples[i][k].ip;
			if (perf_event__preprocess_sample(&event, machine, &al,
							  &sample) < 0)
				goto out;

			he = __hists__add_entry(hists, &al, NULL,
						NULL, NULL, 1, 1, 0, true);
			if (he == NULL) {
				addr_location__put(&al);
				goto out;
			}

			fake_samples[i][k].thread = al.thread;
			fake_samples[i][k].map = al.map;
			fake_samples[i][k].sym = al.sym;
		}
		i++;
	}

	return 0;

out:
	pr_debug("Not enough memory for adding a hist entry\n");
	return -1;
}

static int find_sample(struct sample *samples, size_t nr_samples,
		       struct thread *t, struct map *m, struct symbol *s)
{
	while (nr_samples--) {
		if (samples->thread == t && samples->map == m &&
		    samples->sym == s)
			return 1;
		samples++;
	}
	return 0;
}

static int __validate_match(struct hists *hists)
{
	size_t count = 0;
	struct rb_root *root;
	struct rb_node *node;

	/*
	 * Only entries from fake_common_samples should have a pair.
	 */
	if (sort__need_collapse)
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	node = rb_first(root);
	while (node) {
		struct hist_entry *he;

		he = rb_entry(node, struct hist_entry, rb_node_in);

		if (hist_entry__has_pairs(he)) {
			if (find_sample(fake_common_samples,
					ARRAY_SIZE(fake_common_samples),
					he->thread, he->ms.map, he->ms.sym)) {
				count++;
			} else {
				pr_debug("Can't find the matched entry\n");
				return -1;
			}
		}

		node = rb_next(node);
	}

	if (count != ARRAY_SIZE(fake_common_samples)) {
		pr_debug("Invalid count for matched entries: %zd of %zd\n",
			 count, ARRAY_SIZE(fake_common_samples));
		return -1;
	}

	return 0;
}

static int validate_match(struct hists *leader, struct hists *other)
{
	return __validate_match(leader) || __validate_match(other);
}

static int __validate_link(struct hists *hists, int idx)
{
	size_t count = 0;
	size_t count_pair = 0;
	size_t count_dummy = 0;
	struct rb_root *root;
	struct rb_node *node;

	/*
	 * Leader hists (idx = 0) will have dummy entries from other,
	 * and some entries will have no pair.  However every entry
	 * in other hists should have (dummy) pair.
	 */
	if (sort__need_collapse)
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	node = rb_first(root);
	while (node) {
		struct hist_entry *he;

		he = rb_entry(node, struct hist_entry, rb_node_in);

		if (hist_entry__has_pairs(he)) {
			if (!find_sample(fake_common_samples,
					 ARRAY_SIZE(fake_common_samples),
					 he->thread, he->ms.map, he->ms.sym) &&
			    !find_sample(fake_samples[idx],
					 ARRAY_SIZE(fake_samples[idx]),
					 he->thread, he->ms.map, he->ms.sym)) {
				count_dummy++;
			}
			count_pair++;
		} else if (idx) {
			pr_debug("A entry from the other hists should have pair\n");
			return -1;
		}

		count++;
		node = rb_next(node);
	}

	/*
	 * Note that we have a entry collapsed in the other (idx = 1) hists.
	 */
	if (idx == 0) {
		if (count_dummy != ARRAY_SIZE(fake_samples[1]) - 1) {
			pr_debug("Invalid count of dummy entries: %zd of %zd\n",
				 count_dummy, ARRAY_SIZE(fake_samples[1]) - 1);
			return -1;
		}
		if (count != count_pair + ARRAY_SIZE(fake_samples[0])) {
			pr_debug("Invalid count of total leader entries: %zd of %zd\n",
				 count, count_pair + ARRAY_SIZE(fake_samples[0]));
			return -1;
		}
	} else {
		if (count != count_pair) {
			pr_debug("Invalid count of total other entries: %zd of %zd\n",
				 count, count_pair);
			return -1;
		}
		if (count_dummy > 0) {
			pr_debug("Other hists should not have dummy entries: %zd\n",
				 count_dummy);
			return -1;
		}
	}

	return 0;
}

static int validate_link(struct hists *leader, struct hists *other)
{
	return __validate_link(leader, 0) || __validate_link(other, 1);
}

int test__hists_link(void)
{
	int err = -1;
	struct hists *hists, *first_hists;
	struct machines machines;
	struct machine *machine = NULL;
	struct perf_evsel *evsel, *first;
	struct perf_evlist *evlist = perf_evlist__new();

	if (evlist == NULL)
                return -ENOMEM;

	err = parse_events(evlist, "cpu-clock", NULL);
	if (err)
		goto out;
	err = parse_events(evlist, "task-clock", NULL);
	if (err)
		goto out;

	/* default sort order (comm,dso,sym) will be used */
	if (setup_sorting() < 0)
		goto out;

	machines__init(&machines);

	/* setup threads/dso/map/symbols also */
	machine = setup_fake_machine(&machines);
	if (!machine)
		goto out;

	if (verbose > 1)
		machine__fprintf(machine, stderr);

	/* process sample events */
	err = add_hist_entries(evlist, machine);
	if (err < 0)
		goto out;

	evlist__for_each(evlist, evsel) {
		hists = evsel__hists(evsel);
		hists__collapse_resort(hists, NULL);

		if (verbose > 2)
			print_hists_in(hists);
	}

	first = perf_evlist__first(evlist);
	evsel = perf_evlist__last(evlist);

	first_hists = evsel__hists(first);
	hists = evsel__hists(evsel);

	/* match common entries */
	hists__match(first_hists, hists);
	err = validate_match(first_hists, hists);
	if (err)
		goto out;

	/* link common and/or dummy entries */
	hists__link(first_hists, hists);
	err = validate_link(first_hists, hists);
	if (err)
		goto out;

	err = 0;

out:
	/* tear down everything */
	perf_evlist__delete(evlist);
	reset_output_field();
	machines__exit(&machines);

	return err;
}
Commit	Line	Data
f8ebb0cd NK	1	#include "perf.h"
	2	#include "tests.h"
	3	#include "debug.h"
	4	#include "symbol.h"
	5	#include "sort.h"
	6	#include "evsel.h"
	7	#include "evlist.h"
	8	#include "machine.h"
	9	#include "thread.h"
	10	#include "parse-events.h"
6e344a95	11	#include "hists_common.h"
f8ebb0cd NK	12
	13	struct sample {
	14	u32 pid;
	15	u64 ip;
	16	struct thread *thread;
	17	struct map *map;
	18	struct symbol *sym;
	19	};
	20
6e344a95	21	/* For the numbers, see hists_common.c */
f8ebb0cd NK	22	static struct sample fake_common_samples[] = {
f8ebb0cd NK	23	/* perf [kernel] schedule() */
a1891aa4	24	{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_KERNEL_SCHEDULE, },
f8ebb0cd	25	/* perf [perf] main() */
a1891aa4	26	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_PERF_MAIN, },
f8ebb0cd	27	/* perf [perf] cmd_record() */
a1891aa4	28	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_PERF_CMD_RECORD, },
f8ebb0cd	29	/* bash [bash] xmalloc() */
a1891aa4	30	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_BASH_XMALLOC, },
f8ebb0cd	31	/* bash [libc] malloc() */
a1891aa4	32	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_LIBC_MALLOC, },
f8ebb0cd NK	33	};
	34
	35	static struct sample fake_samples[][5] = {
	36	{
	37	/* perf [perf] run_command() */
a1891aa4	38	{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_PERF_RUN_COMMAND, },
f8ebb0cd	39	/* perf [libc] malloc() */
a1891aa4	40	{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_LIBC_MALLOC, },
f8ebb0cd	41	/* perf [kernel] page_fault() */
a1891aa4	42	{ .pid = FAKE_PID_PERF1, .ip = FAKE_IP_KERNEL_PAGE_FAULT, },
f8ebb0cd	43	/* perf [kernel] sys_perf_event_open() */
a1891aa4	44	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_KERNEL_SYS_PERF_EVENT_OPEN, },
f8ebb0cd	45	/* bash [libc] free() */
a1891aa4	46	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_LIBC_FREE, },
f8ebb0cd NK	47	},
	48	{
	49	/* perf [libc] free() */
a1891aa4	50	{ .pid = FAKE_PID_PERF2, .ip = FAKE_IP_LIBC_FREE, },
f8ebb0cd	51	/* bash [libc] malloc() */
a1891aa4	52	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_LIBC_MALLOC, }, /* will be merged */
f8ebb0cd	53	/* bash [bash] xfee() */
a1891aa4	54	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_BASH_XFREE, },
f8ebb0cd	55	/* bash [libc] realloc() */
a1891aa4	56	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_LIBC_REALLOC, },
f8ebb0cd	57	/* bash [kernel] page_fault() */
a1891aa4	58	{ .pid = FAKE_PID_BASH, .ip = FAKE_IP_KERNEL_PAGE_FAULT, },
f8ebb0cd NK	59	},
	60	};
	61
	62	static int add_hist_entries(struct perf_evlist evlist, struct machine machine)
	63	{
	64	struct perf_evsel *evsel;
	65	struct addr_location al;
	66	struct hist_entry *he;
a1891aa4	67	struct perf_sample sample = { .period = 1, };
f8ebb0cd NK	68	size_t i = 0, k;
	69
	70	/*
	71	* each evsel will have 10 samples - 5 common and 5 distinct.
	72	* However the second evsel also has a collapsed entry for
	73	* "bash [libc] malloc" so total 9 entries will be in the tree.
	74	*/
0050f7aa	75	evlist__for_each(evlist, evsel) {
4ea062ed ACM	76	struct hists *hists = evsel__hists(evsel);
4ea062ed ACM	77
f8ebb0cd NK	78	for (k = 0; k < ARRAY_SIZE(fake_common_samples); k++) {
f8ebb0cd NK	79	const union perf_event event = {
ef89325f AH	80	.header = {
ef89325f AH	81	.misc = PERF_RECORD_MISC_USER,
f8ebb0cd NK	82	},
	83	};
	84
ef89325f	85	sample.pid = fake_common_samples[k].pid;
13ce34df	86	sample.tid = fake_common_samples[k].pid;
ef89325f	87	sample.ip = fake_common_samples[k].ip;
f8ebb0cd	88	if (perf_event__preprocess_sample(&event, machine, &al,
e44baa3e	89	&sample) < 0)
f8ebb0cd NK	90	goto out;
f8ebb0cd NK	91
4ea062ed	92	he = __hists__add_entry(hists, &al, NULL,
a0b51af3	93	NULL, NULL, 1, 1, 0, true);
b91fc39f ACM	94	if (he == NULL) {
b91fc39f ACM	95	addr_location__put(&al);
f8ebb0cd	96	goto out;
b91fc39f	97	}
f8ebb0cd NK	98
	99	fake_common_samples[k].thread = al.thread;
	100	fake_common_samples[k].map = al.map;
	101	fake_common_samples[k].sym = al.sym;
	102	}
	103
	104	for (k = 0; k < ARRAY_SIZE(fake_samples[i]); k++) {
	105	const union perf_event event = {
ef89325f AH	106	.header = {
ef89325f AH	107	.misc = PERF_RECORD_MISC_USER,
f8ebb0cd NK	108	},
	109	};
	110
ef89325f	111	sample.pid = fake_samples[i][k].pid;
13ce34df	112	sample.tid = fake_samples[i][k].pid;
ef89325f	113	sample.ip = fake_samples[i][k].ip;
f8ebb0cd	114	if (perf_event__preprocess_sample(&event, machine, &al,
e44baa3e	115	&sample) < 0)
f8ebb0cd NK	116	goto out;
f8ebb0cd NK	117
4ea062ed	118	he = __hists__add_entry(hists, &al, NULL,
a0b51af3	119	NULL, NULL, 1, 1, 0, true);
b91fc39f ACM	120	if (he == NULL) {
b91fc39f ACM	121	addr_location__put(&al);
f8ebb0cd	122	goto out;
b91fc39f	123	}
f8ebb0cd NK	124
	125	fake_samples[i][k].thread = al.thread;
	126	fake_samples[i][k].map = al.map;
	127	fake_samples[i][k].sym = al.sym;
	128	}
	129	i++;
	130	}
	131
	132	return 0;
	133
	134	out:
	135	pr_debug("Not enough memory for adding a hist entry\n");
	136	return -1;
	137	}
	138
	139	static int find_sample(struct sample *samples, size_t nr_samples,
	140	struct thread t, struct map m, struct symbol *s)
	141	{
	142	while (nr_samples--) {
	143	if (samples->thread == t && samples->map == m &&
	144	samples->sym == s)
	145	return 1;
	146	samples++;
	147	}
	148	return 0;
	149	}
	150
	151	static int __validate_match(struct hists *hists)
	152	{
	153	size_t count = 0;
	154	struct rb_root *root;
	155	struct rb_node *node;
	156
	157	/*
	158	* Only entries from fake_common_samples should have a pair.
	159	*/
	160	if (sort__need_collapse)
	161	root = &hists->entries_collapsed;
	162	else
	163	root = hists->entries_in;
	164
	165	node = rb_first(root);
	166	while (node) {
	167	struct hist_entry *he;
	168
	169	he = rb_entry(node, struct hist_entry, rb_node_in);
	170
	171	if (hist_entry__has_pairs(he)) {
	172	if (find_sample(fake_common_samples,
	173	ARRAY_SIZE(fake_common_samples),
	174	he->thread, he->ms.map, he->ms.sym)) {
	175	count++;
	176	} else {
	177	pr_debug("Can't find the matched entry\n");
	178	return -1;
	179	}
	180	}
	181
	182	node = rb_next(node);
	183	}
	184
	185	if (count != ARRAY_SIZE(fake_common_samples)) {
	186	pr_debug("Invalid count for matched entries: %zd of %zd\n",
	187	count, ARRAY_SIZE(fake_common_samples));
188	return -1;
189	}
190
191	return 0;
192	}
193
194	static int validate_match(struct hists leader, struct hists other)
195	{
196	return __validate_match(leader) \|\| __validate_match(other);
197	}
198
199	static int __validate_link(struct hists *hists, int idx)
200	{
201	size_t count = 0;
202	size_t count_pair = 0;
203	size_t count_dummy = 0;
204	struct rb_root *root;
205	struct rb_node *node;
206
207	/*
208	* Leader hists (idx = 0) will have dummy entries from other,
209	* and some entries will have no pair. However every entry
210	* in other hists should have (dummy) pair.
211	*/
212	if (sort__need_collapse)
213	root = &hists->entries_collapsed;
214	else
215	root = hists->entries_in;
216
217	node = rb_first(root);
218	while (node) {
219	struct hist_entry *he;
220
221	he = rb_entry(node, struct hist_entry, rb_node_in);
222
223	if (hist_entry__has_pairs(he)) {
224	if (!find_sample(fake_common_samples,
225	ARRAY_SIZE(fake_common_samples),
226	he->thread, he->ms.map, he->ms.sym) &&
227	!find_sample(fake_samples[idx],
228	ARRAY_SIZE(fake_samples[idx]),
229	he->thread, he->ms.map, he->ms.sym)) {
230	count_dummy++;
231	}
232	count_pair++;
233	} else if (idx) {
234	pr_debug("A entry from the other hists should have pair\n");
235	return -1;
236	}
237
238	count++;
239	node = rb_next(node);
240	}
241
242	/*
243	* Note that we have a entry collapsed in the other (idx = 1) hists.
244	*/
245	if (idx == 0) {
246	if (count_dummy != ARRAY_SIZE(fake_samples[1]) - 1) {
247	pr_debug("Invalid count of dummy entries: %zd of %zd\n",
248	count_dummy, ARRAY_SIZE(fake_samples[1]) - 1);
249	return -1;
250	}
251	if (count != count_pair + ARRAY_SIZE(fake_samples[0])) {
252	pr_debug("Invalid count of total leader entries: %zd of %zd\n",
253	count, count_pair + ARRAY_SIZE(fake_samples[0]));
254	return -1;
255	}
256	} else {
257	if (count != count_pair) {
258	pr_debug("Invalid count of total other entries: %zd of %zd\n",
259	count, count_pair);
260	return -1;
261	}
262	if (count_dummy > 0) {
263	pr_debug("Other hists should not have dummy entries: %zd\n",
264	count_dummy);
265	return -1;
266	}
267	}
268
269	return 0;
270	}
271
272	static int validate_link(struct hists leader, struct hists other)
273	{
274	return __validate_link(leader, 0) \|\| __validate_link(other, 1);
275	}
276
f8ebb0cd NK	277	int test__hists_link(void)
	278	{
	279	int err = -1;
4ea062ed	280	struct hists hists, first_hists;
876650e6	281	struct machines machines;
f8ebb0cd NK	282	struct machine *machine = NULL;
f8ebb0cd NK	283	struct perf_evsel evsel, first;
334fe7a3	284	struct perf_evlist *evlist = perf_evlist__new();
f8ebb0cd NK	285
	286	if (evlist == NULL)
	287	return -ENOMEM;
	288
b39b8393	289	err = parse_events(evlist, "cpu-clock", NULL);
f8ebb0cd NK	290	if (err)
f8ebb0cd NK	291	goto out;
b39b8393	292	err = parse_events(evlist, "task-clock", NULL);
f8ebb0cd NK	293	if (err)
	294	goto out;
	295
	296	/* default sort order (comm,dso,sym) will be used */
55309985 NK	297	if (setup_sorting() < 0)
55309985 NK	298	goto out;
f8ebb0cd	299
876650e6 ACM	300	machines__init(&machines);
876650e6 ACM	301
f8ebb0cd	302	/* setup threads/dso/map/symbols also */
876650e6	303	machine = setup_fake_machine(&machines);
f8ebb0cd NK	304	if (!machine)
	305	goto out;
	306
	307	if (verbose > 1)
	308	machine__fprintf(machine, stderr);
	309
	310	/* process sample events */
	311	err = add_hist_entries(evlist, machine);
	312	if (err < 0)
	313	goto out;
	314
0050f7aa	315	evlist__for_each(evlist, evsel) {
4ea062ed ACM	316	hists = evsel__hists(evsel);
4ea062ed ACM	317	hists__collapse_resort(hists, NULL);
f8ebb0cd NK	318
f8ebb0cd NK	319	if (verbose > 2)
4ea062ed	320	print_hists_in(hists);
f8ebb0cd NK	321	}
	322
	323	first = perf_evlist__first(evlist);
	324	evsel = perf_evlist__last(evlist);
	325
4ea062ed ACM	326	first_hists = evsel__hists(first);
	327	hists = evsel__hists(evsel);
	328
f8ebb0cd	329	/* match common entries */
4ea062ed ACM	330	hists__match(first_hists, hists);
4ea062ed ACM	331	err = validate_match(first_hists, hists);
f8ebb0cd NK	332	if (err)
	333	goto out;
	334
	335	/* link common and/or dummy entries */
4ea062ed ACM	336	hists__link(first_hists, hists);
4ea062ed ACM	337	err = validate_link(first_hists, hists);
f8ebb0cd NK	338	if (err)
	339	goto out;
	340
	341	err = 0;
	342
	343	out:
	344	/* tear down everything */
	345	perf_evlist__delete(evlist);
f21d1815	346	reset_output_field();
876650e6	347	machines__exit(&machines);
f8ebb0cd NK	348
	349	return err;
	350	}