[net-next-2.6.git] / tools / perf / util / callchain.c

/*
 * Copyright (C) 2009-2010, Frederic Weisbecker <fweisbec@gmail.com>
 *
 * Handle the callchains from the stream in an ad-hoc radix tree and then
 * sort them in an rbtree.
 *
 * Using a radix for code path provides a fast retrieval and factorizes
 * memory use. Also that lets us use the paths in a hierarchical graph view.
 *
 */

#include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
#include <errno.h>
#include <math.h>

#include "util.h"
#include "callchain.h"

bool ip_callchain__valid(struct ip_callchain *chain, event_t *event)
{
	unsigned int chain_size = event->header.size;
	chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;
	return chain->nr * sizeof(u64) <= chain_size;
}

#define chain_for_each_child(child, parent)	\
	list_for_each_entry(child, &parent->children, brothers)

static void
rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
		    enum chain_mode mode)
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct callchain_node *rnode;
	u64 chain_cumul = cumul_hits(chain);

	while (*p) {
		u64 rnode_cumul;

		parent = *p;
		rnode = rb_entry(parent, struct callchain_node, rb_node);
		rnode_cumul = cumul_hits(rnode);

		switch (mode) {
		case CHAIN_FLAT:
			if (rnode->hit < chain->hit)
				p = &(*p)->rb_left;
			else
				p = &(*p)->rb_right;
			break;
		case CHAIN_GRAPH_ABS: /* Falldown */
		case CHAIN_GRAPH_REL:
			if (rnode_cumul < chain_cumul)
				p = &(*p)->rb_left;
			else
				p = &(*p)->rb_right;
			break;
		case CHAIN_NONE:
		default:
			break;
		}
	}

	rb_link_node(&chain->rb_node, parent, p);
	rb_insert_color(&chain->rb_node, root);
}

static void
__sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
		  u64 min_hit)
{
	struct callchain_node *child;

	chain_for_each_child(child, node)
		__sort_chain_flat(rb_root, child, min_hit);

	if (node->hit && node->hit >= min_hit)
		rb_insert_callchain(rb_root, node, CHAIN_FLAT);
}

/*
 * Once we get every callchains from the stream, we can now
 * sort them by hit
 */
static void
sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
		u64 min_hit, struct callchain_param *param __used)
{
	__sort_chain_flat(rb_root, node, min_hit);
}

static void __sort_chain_graph_abs(struct callchain_node *node,
				   u64 min_hit)
{
	struct callchain_node *child;

	node->rb_root = RB_ROOT;

	chain_for_each_child(child, node) {
		__sort_chain_graph_abs(child, min_hit);
		if (cumul_hits(child) >= min_hit)
			rb_insert_callchain(&node->rb_root, child,
					    CHAIN_GRAPH_ABS);
	}
}

static void
sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_node *chain_root,
		     u64 min_hit, struct callchain_param *param __used)
{
	__sort_chain_graph_abs(chain_root, min_hit);
	rb_root->rb_node = chain_root->rb_root.rb_node;
}

static void __sort_chain_graph_rel(struct callchain_node *node,
				   double min_percent)
{
	struct callchain_node *child;
	u64 min_hit;

	node->rb_root = RB_ROOT;
	min_hit = ceil(node->children_hit * min_percent);

	chain_for_each_child(child, node) {
		__sort_chain_graph_rel(child, min_percent);
		if (cumul_hits(child) >= min_hit)
			rb_insert_callchain(&node->rb_root, child,
					    CHAIN_GRAPH_REL);
	}
}

static void
sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_node *chain_root,
		     u64 min_hit __used, struct callchain_param *param)
{
	__sort_chain_graph_rel(chain_root, param->min_percent / 100.0);
	rb_root->rb_node = chain_root->rb_root.rb_node;
}

int register_callchain_param(struct callchain_param *param)
{
	switch (param->mode) {
	case CHAIN_GRAPH_ABS:
		param->sort = sort_chain_graph_abs;
		break;
	case CHAIN_GRAPH_REL:
		param->sort = sort_chain_graph_rel;
		break;
	case CHAIN_FLAT:
		param->sort = sort_chain_flat;
		break;
	case CHAIN_NONE:
	default:
		return -1;
	}
	return 0;
}

/*
 * Create a child for a parent. If inherit_children, then the new child
 * will become the new parent of it's parent children
 */
static struct callchain_node *
create_child(struct callchain_node *parent, bool inherit_children)
{
	struct callchain_node *new;

	new = zalloc(sizeof(*new));
	if (!new) {
		perror("not enough memory to create child for code path tree");
		return NULL;
	}
	new->parent = parent;
	INIT_LIST_HEAD(&new->children);
	INIT_LIST_HEAD(&new->val);

	if (inherit_children) {
		struct callchain_node *next;

		list_splice(&parent->children, &new->children);
		INIT_LIST_HEAD(&parent->children);

		chain_for_each_child(next, new)
			next->parent = new;
	}
	list_add_tail(&new->brothers, &parent->children);

	return new;
}


struct resolved_ip {
	u64		  ip;
	struct map_symbol ms;
};

struct resolved_chain {
	u64			nr;
	struct resolved_ip	ips[0];
};


/*
 * Fill the node with callchain values
 */
static void
fill_node(struct callchain_node *node, struct resolved_chain *chain, int start)
{
	unsigned int i;

	for (i = start; i < chain->nr; i++) {
		struct callchain_list *call;

		call = zalloc(sizeof(*call));
		if (!call) {
			perror("not enough memory for the code path tree");
			return;
		}
		call->ip = chain->ips[i].ip;
		call->ms = chain->ips[i].ms;
		list_add_tail(&call->list, &node->val);
	}
	node->val_nr = chain->nr - start;
	if (!node->val_nr)
		pr_warning("Warning: empty node in callchain tree\n");
}

static void
add_child(struct callchain_node *parent, struct resolved_chain *chain,
	  int start)
{
	struct callchain_node *new;

	new = create_child(parent, false);
	fill_node(new, chain, start);

	new->children_hit = 0;
	new->hit = 1;
}

/*
 * Split the parent in two parts (a new child is created) and
 * give a part of its callchain to the created child.
 * Then create another child to host the given callchain of new branch
 */
static void
split_add_child(struct callchain_node *parent, struct resolved_chain *chain,
		struct callchain_list *to_split, int idx_parents, int idx_local)
{
	struct callchain_node *new;
	struct list_head *old_tail;
	unsigned int idx_total = idx_parents + idx_local;

	/* split */
	new = create_child(parent, true);

	/* split the callchain and move a part to the new child */
	old_tail = parent->val.prev;
	list_del_range(&to_split->list, old_tail);
	new->val.next = &to_split->list;
	new->val.prev = old_tail;
	to_split->list.prev = &new->val;
	old_tail->next = &new->val;

	/* split the hits */
	new->hit = parent->hit;
	new->children_hit = parent->children_hit;
	parent->children_hit = cumul_hits(new);
	new->val_nr = parent->val_nr - idx_local;
	parent->val_nr = idx_local;

	/* create a new child for the new branch if any */
	if (idx_total < chain->nr) {
		parent->hit = 0;
		add_child(parent, chain, idx_total);
		parent->children_hit++;
	} else {
		parent->hit = 1;
	}
}

static int
__append_chain(struct callchain_node *root, struct resolved_chain *chain,
	       unsigned int start);

static void
__append_chain_children(struct callchain_node *root,
			struct resolved_chain *chain,
			unsigned int start)
{
	struct callchain_node *rnode;

	/* lookup in childrens */
	chain_for_each_child(rnode, root) {
		unsigned int ret = __append_chain(rnode, chain, start);

		if (!ret)
			goto inc_children_hit;
	}
	/* nothing in children, add to the current node */
	add_child(root, chain, start);

inc_children_hit:
	root->children_hit++;
}

static int
__append_chain(struct callchain_node *root, struct resolved_chain *chain,
	       unsigned int start)
{
	struct callchain_list *cnode;
	unsigned int i = start;
	bool found = false;

	/*
	 * Lookup in the current node
	 * If we have a symbol, then compare the start to match
	 * anywhere inside a function.
	 */
	list_for_each_entry(cnode, &root->val, list) {
		struct symbol *sym;

		if (i == chain->nr)
			break;

		sym = chain->ips[i].ms.sym;

		if (cnode->ms.sym && sym) {
			if (cnode->ms.sym->start != sym->start)
				break;
		} else if (cnode->ip != chain->ips[i].ip)
			break;

		if (!found)
			found = true;
		i++;
	}

	/* matches not, relay on the parent */
	if (!found)
		return -1;

	/* we match only a part of the node. Split it and add the new chain */
	if (i - start < root->val_nr) {
		split_add_child(root, chain, cnode, start, i - start);
		return 0;
	}

	/* we match 100% of the path, increment the hit */
	if (i - start == root->val_nr && i == chain->nr) {
		root->hit++;
		return 0;
	}

	/* We match the node and still have a part remaining */
	__append_chain_children(root, chain, i);

	return 0;
}

static void filter_context(struct ip_callchain *old, struct resolved_chain *new,
			   struct map_symbol *syms)
{
	int i, j = 0;

	for (i = 0; i < (int)old->nr; i++) {
		if (old->ips[i] >= PERF_CONTEXT_MAX)
			continue;

		new->ips[j].ip = old->ips[i];
		new->ips[j].ms = syms[i];
		j++;
	}

	new->nr = j;
}


int append_chain(struct callchain_node *root, struct ip_callchain *chain,
		 struct map_symbol *syms)
{
	struct resolved_chain *filtered;

	if (!chain->nr)
		return 0;

	filtered = zalloc(sizeof(*filtered) +
			  chain->nr * sizeof(struct resolved_ip));
	if (!filtered)
		return -ENOMEM;

	filter_context(chain, filtered, syms);

	if (!filtered->nr)
		goto end;

	__append_chain_children(root, filtered, 0);
end:
	free(filtered);

	return 0;
}
Commit	Line	Data
8cb76d99	1	/*
301fde27	2	* Copyright (C) 2009-2010, Frederic Weisbecker <fweisbec@gmail.com>
8cb76d99 FW	3	*
	4	* Handle the callchains from the stream in an ad-hoc radix tree and then
	5	* sort them in an rbtree.
	6	*
deac911c FW	7	* Using a radix for code path provides a fast retrieval and factorizes
	8	* memory use. Also that lets us use the paths in a hierarchical graph view.
	9	*
8cb76d99 FW	10	*/
	11
	12	#include <stdlib.h>
	13	#include <stdio.h>
	14	#include <stdbool.h>
	15	#include <errno.h>
c0a8865e	16	#include <math.h>
8cb76d99	17
b36f19d5	18	#include "util.h"
8cb76d99 FW	19	#include "callchain.h"
8cb76d99 FW	20
139633c6 ACM	21	bool ip_callchain__valid(struct ip_callchain chain, event_t event)
	22	{
	23	unsigned int chain_size = event->header.size;
	24	chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;
	25	return chain->nr * sizeof(u64) <= chain_size;
	26	}
	27
14f4654c FW	28	#define chain_for_each_child(child, parent) \
	29	list_for_each_entry(child, &parent->children, brothers)
	30
deac911c	31	static void
4eb3e478 FW	32	rb_insert_callchain(struct rb_root root, struct callchain_node chain,
4eb3e478 FW	33	enum chain_mode mode)
8cb76d99 FW	34	{
	35	struct rb_node **p = &root->rb_node;
	36	struct rb_node *parent = NULL;
	37	struct callchain_node *rnode;
1953287b	38	u64 chain_cumul = cumul_hits(chain);
8cb76d99 FW	39
8cb76d99 FW	40	while (*p) {
1953287b FW	41	u64 rnode_cumul;
1953287b FW	42
8cb76d99 FW	43	parent = *p;
8cb76d99 FW	44	rnode = rb_entry(parent, struct callchain_node, rb_node);
1953287b	45	rnode_cumul = cumul_hits(rnode);
8cb76d99	46
4eb3e478	47	switch (mode) {
805d127d	48	case CHAIN_FLAT:
4eb3e478 FW	49	if (rnode->hit < chain->hit)
	50	p = &(*p)->rb_left;
	51	else
	52	p = &(*p)->rb_right;
	53	break;
805d127d FW	54	case CHAIN_GRAPH_ABS: /* Falldown */
805d127d FW	55	case CHAIN_GRAPH_REL:
1953287b	56	if (rnode_cumul < chain_cumul)
4eb3e478 FW	57	p = &(*p)->rb_left;
	58	else
	59	p = &(*p)->rb_right;
	60	break;
83a0944f	61	case CHAIN_NONE:
4eb3e478 FW	62	default:
	63	break;
	64	}
8cb76d99 FW	65	}
	66
	67	rb_link_node(&chain->rb_node, parent, p);
	68	rb_insert_color(&chain->rb_node, root);
	69	}
	70
805d127d FW	71	static void
	72	__sort_chain_flat(struct rb_root rb_root, struct callchain_node node,
	73	u64 min_hit)
	74	{
	75	struct callchain_node *child;
	76
	77	chain_for_each_child(child, node)
	78	__sort_chain_flat(rb_root, child, min_hit);
	79
	80	if (node->hit && node->hit >= min_hit)
	81	rb_insert_callchain(rb_root, node, CHAIN_FLAT);
	82	}
	83
8cb76d99 FW	84	/*
	85	* Once we get every callchains from the stream, we can now
	86	* sort them by hit
	87	*/
805d127d FW	88	static void
	89	sort_chain_flat(struct rb_root rb_root, struct callchain_node node,
	90	u64 min_hit, struct callchain_param *param __used)
	91	{
	92	__sort_chain_flat(rb_root, node, min_hit);
	93	}
	94
	95	static void __sort_chain_graph_abs(struct callchain_node *node,
	96	u64 min_hit)
8cb76d99 FW	97	{
	98	struct callchain_node *child;
	99
805d127d	100	node->rb_root = RB_ROOT;
8cb76d99	101
805d127d FW	102	chain_for_each_child(child, node) {
805d127d FW	103	__sort_chain_graph_abs(child, min_hit);
1953287b	104	if (cumul_hits(child) >= min_hit)
805d127d FW	105	rb_insert_callchain(&node->rb_root, child,
	106	CHAIN_GRAPH_ABS);
	107	}
	108	}
	109
	110	static void
	111	sort_chain_graph_abs(struct rb_root rb_root, struct callchain_node chain_root,
	112	u64 min_hit, struct callchain_param *param __used)
	113	{
	114	__sort_chain_graph_abs(chain_root, min_hit);
	115	rb_root->rb_node = chain_root->rb_root.rb_node;
4eb3e478 FW	116	}
4eb3e478 FW	117
805d127d FW	118	static void __sort_chain_graph_rel(struct callchain_node *node,
805d127d FW	119	double min_percent)
4eb3e478 FW	120	{
4eb3e478 FW	121	struct callchain_node *child;
805d127d	122	u64 min_hit;
4eb3e478 FW	123
4eb3e478 FW	124	node->rb_root = RB_ROOT;
c0a8865e	125	min_hit = ceil(node->children_hit * min_percent);
4eb3e478 FW	126
4eb3e478 FW	127	chain_for_each_child(child, node) {
805d127d	128	__sort_chain_graph_rel(child, min_percent);
1953287b	129	if (cumul_hits(child) >= min_hit)
805d127d FW	130	rb_insert_callchain(&node->rb_root, child,
805d127d FW	131	CHAIN_GRAPH_REL);
4eb3e478 FW	132	}
	133	}
	134
805d127d FW	135	static void
	136	sort_chain_graph_rel(struct rb_root rb_root, struct callchain_node chain_root,
	137	u64 min_hit __used, struct callchain_param *param)
4eb3e478	138	{
c0a8865e	139	__sort_chain_graph_rel(chain_root, param->min_percent / 100.0);
4eb3e478	140	rb_root->rb_node = chain_root->rb_root.rb_node;
8cb76d99 FW	141	}
8cb76d99 FW	142
805d127d FW	143	int register_callchain_param(struct callchain_param *param)
	144	{
	145	switch (param->mode) {
	146	case CHAIN_GRAPH_ABS:
	147	param->sort = sort_chain_graph_abs;
	148	break;
	149	case CHAIN_GRAPH_REL:
	150	param->sort = sort_chain_graph_rel;
	151	break;
	152	case CHAIN_FLAT:
	153	param->sort = sort_chain_flat;
	154	break;
83a0944f	155	case CHAIN_NONE:
805d127d FW	156	default:
	157	return -1;
	158	}
	159	return 0;
	160	}
	161
deac911c FW	162	/*
	163	* Create a child for a parent. If inherit_children, then the new child
	164	* will become the new parent of it's parent children
	165	*/
	166	static struct callchain_node *
	167	create_child(struct callchain_node *parent, bool inherit_children)
8cb76d99 FW	168	{
	169	struct callchain_node *new;
	170
cdd5b75b	171	new = zalloc(sizeof(*new));
8cb76d99 FW	172	if (!new) {
	173	perror("not enough memory to create child for code path tree");
	174	return NULL;
	175	}
	176	new->parent = parent;
	177	INIT_LIST_HEAD(&new->children);
	178	INIT_LIST_HEAD(&new->val);
deac911c FW	179
	180	if (inherit_children) {
	181	struct callchain_node *next;
	182
	183	list_splice(&parent->children, &new->children);
	184	INIT_LIST_HEAD(&parent->children);
	185
14f4654c	186	chain_for_each_child(next, new)
deac911c FW	187	next->parent = new;
deac911c FW	188	}
8cb76d99 FW	189	list_add_tail(&new->brothers, &parent->children);
	190
	191	return new;
	192	}
	193
301fde27 FW	194
301fde27 FW	195	struct resolved_ip {
b3c9ac08 ACM	196	u64 ip;
b3c9ac08 ACM	197	struct map_symbol ms;
301fde27 FW	198	};
	199
	200	struct resolved_chain {
	201	u64 nr;
	202	struct resolved_ip ips[0];
	203	};
	204
	205
deac911c FW	206	/*
	207	* Fill the node with callchain values
	208	*/
8cb76d99	209	static void
301fde27	210	fill_node(struct callchain_node node, struct resolved_chain chain, int start)
8cb76d99	211	{
f37a291c	212	unsigned int i;
8cb76d99 FW	213
	214	for (i = start; i < chain->nr; i++) {
	215	struct callchain_list *call;
	216
cdd5b75b	217	call = zalloc(sizeof(*call));
8cb76d99 FW	218	if (!call) {
	219	perror("not enough memory for the code path tree");
	220	return;
	221	}
301fde27	222	call->ip = chain->ips[i].ip;
b3c9ac08	223	call->ms = chain->ips[i].ms;
8cb76d99 FW	224	list_add_tail(&call->list, &node->val);
8cb76d99 FW	225	}
deac911c FW	226	node->val_nr = chain->nr - start;
deac911c FW	227	if (!node->val_nr)
6beba7ad	228	pr_warning("Warning: empty node in callchain tree\n");
8cb76d99 FW	229	}
8cb76d99 FW	230
deac911c	231	static void
301fde27 FW	232	add_child(struct callchain_node parent, struct resolved_chain chain,
301fde27 FW	233	int start)
8cb76d99 FW	234	{
	235	struct callchain_node *new;
	236
deac911c	237	new = create_child(parent, false);
301fde27	238	fill_node(new, chain, start);
8cb76d99	239
1953287b FW	240	new->children_hit = 0;
1953287b FW	241	new->hit = 1;
8cb76d99 FW	242	}
8cb76d99 FW	243
deac911c FW	244	/*
	245	* Split the parent in two parts (a new child is created) and
	246	* give a part of its callchain to the created child.
	247	* Then create another child to host the given callchain of new branch
	248	*/
8cb76d99	249	static void
301fde27 FW	250	split_add_child(struct callchain_node parent, struct resolved_chain chain,
301fde27 FW	251	struct callchain_list *to_split, int idx_parents, int idx_local)
8cb76d99 FW	252	{
8cb76d99 FW	253	struct callchain_node *new;
deac911c	254	struct list_head *old_tail;
f37a291c	255	unsigned int idx_total = idx_parents + idx_local;
8cb76d99 FW	256
8cb76d99 FW	257	/* split */
deac911c FW	258	new = create_child(parent, true);
	259
	260	/* split the callchain and move a part to the new child */
	261	old_tail = parent->val.prev;
	262	list_del_range(&to_split->list, old_tail);
	263	new->val.next = &to_split->list;
	264	new->val.prev = old_tail;
	265	to_split->list.prev = &new->val;
	266	old_tail->next = &new->val;
8cb76d99	267
deac911c FW	268	/* split the hits */
deac911c FW	269	new->hit = parent->hit;
1953287b FW	270	new->children_hit = parent->children_hit;
1953287b FW	271	parent->children_hit = cumul_hits(new);
deac911c FW	272	new->val_nr = parent->val_nr - idx_local;
	273	parent->val_nr = idx_local;
	274
	275	/* create a new child for the new branch if any */
	276	if (idx_total < chain->nr) {
	277	parent->hit = 0;
301fde27	278	add_child(parent, chain, idx_total);
1953287b	279	parent->children_hit++;
deac911c FW	280	} else {
	281	parent->hit = 1;
	282	}
8cb76d99 FW	283	}
	284
	285	static int
301fde27 FW	286	__append_chain(struct callchain_node root, struct resolved_chain chain,
301fde27 FW	287	unsigned int start);
8cb76d99	288
deac911c	289	static void
301fde27 FW	290	__append_chain_children(struct callchain_node *root,
	291	struct resolved_chain *chain,
	292	unsigned int start)
8cb76d99 FW	293	{
	294	struct callchain_node *rnode;
	295
	296	/* lookup in childrens */
14f4654c	297	chain_for_each_child(rnode, root) {
301fde27	298	unsigned int ret = __append_chain(rnode, chain, start);
f37a291c	299
8cb76d99	300	if (!ret)
1953287b	301	goto inc_children_hit;
8cb76d99	302	}
deac911c	303	/* nothing in children, add to the current node */
301fde27	304	add_child(root, chain, start);
e05b876c	305
1953287b FW	306	inc_children_hit:
1953287b FW	307	root->children_hit++;
8cb76d99 FW	308	}
	309
	310	static int
301fde27 FW	311	__append_chain(struct callchain_node root, struct resolved_chain chain,
301fde27 FW	312	unsigned int start)
8cb76d99 FW	313	{
8cb76d99 FW	314	struct callchain_list *cnode;
f37a291c	315	unsigned int i = start;
8cb76d99 FW	316	bool found = false;
8cb76d99 FW	317
deac911c FW	318	/*
	319	* Lookup in the current node
	320	* If we have a symbol, then compare the start to match
	321	* anywhere inside a function.
	322	*/
8cb76d99	323	list_for_each_entry(cnode, &root->val, list) {
301fde27 FW	324	struct symbol *sym;
301fde27 FW	325
deac911c FW	326	if (i == chain->nr)
deac911c FW	327	break;
301fde27	328
b3c9ac08	329	sym = chain->ips[i].ms.sym;
301fde27	330
b3c9ac08 ACM	331	if (cnode->ms.sym && sym) {
b3c9ac08 ACM	332	if (cnode->ms.sym->start != sym->start)
deac911c	333	break;
301fde27	334	} else if (cnode->ip != chain->ips[i].ip)
8cb76d99	335	break;
301fde27	336
8cb76d99 FW	337	if (!found)
8cb76d99 FW	338	found = true;
deac911c	339	i++;
8cb76d99 FW	340	}
	341
	342	/* matches not, relay on the parent */
	343	if (!found)
	344	return -1;
	345
	346	/* we match only a part of the node. Split it and add the new chain */
deac911c	347	if (i - start < root->val_nr) {
301fde27	348	split_add_child(root, chain, cnode, start, i - start);
8cb76d99 FW	349	return 0;
	350	}
	351
	352	/* we match 100% of the path, increment the hit */
deac911c	353	if (i - start == root->val_nr && i == chain->nr) {
8cb76d99 FW	354	root->hit++;
	355	return 0;
	356	}
	357
deac911c	358	/* We match the node and still have a part remaining */
301fde27	359	__append_chain_children(root, chain, i);
deac911c FW	360
deac911c FW	361	return 0;
8cb76d99 FW	362	}
8cb76d99 FW	363
b3c9ac08 ACM	364	static void filter_context(struct ip_callchain old, struct resolved_chain new,
b3c9ac08 ACM	365	struct map_symbol *syms)
301fde27 FW	366	{
	367	int i, j = 0;
	368
	369	for (i = 0; i < (int)old->nr; i++) {
	370	if (old->ips[i] >= PERF_CONTEXT_MAX)
	371	continue;
	372
	373	new->ips[j].ip = old->ips[i];
b3c9ac08	374	new->ips[j].ms = syms[i];
301fde27 FW	375	j++;
	376	}
	377
	378	new->nr = j;
	379	}
	380
	381
	382	int append_chain(struct callchain_node root, struct ip_callchain chain,
b3c9ac08	383	struct map_symbol *syms)
8cb76d99	384	{
301fde27 FW	385	struct resolved_chain *filtered;
301fde27 FW	386
b0efe213	387	if (!chain->nr)
301fde27 FW	388	return 0;
301fde27 FW	389
cdd5b75b	390	filtered = zalloc(sizeof(*filtered) +
301fde27 FW	391	chain->nr * sizeof(struct resolved_ip));
	392	if (!filtered)
	393	return -ENOMEM;
	394
	395	filter_context(chain, filtered, syms);
	396
	397	if (!filtered->nr)
	398	goto end;
	399
	400	__append_chain_children(root, filtered, 0);
	401	end:
	402	free(filtered);
	403
	404	return 0;
8cb76d99	405	}