perf/util/metricgroup.c

39 	struct rb_node *nd;
49 	nd = rblist__find(metric_events, &me);
50 	if (nd)
51 		return container_of(nd, struct metric_event, nd);
54 		nd = rblist__find(metric_events, &me);
55 		if (nd)
56 			return container_of(nd, struct metric_event, nd);
65 					      nd);
86 	return &me->nd;
92 	struct metric_event *me = container_of(rb_node, struct metric_event, nd);
95 	list_for_each_entry_safe(expr, tmp, &me->head, nd) {
123 	struct list_head nd;
387 	/** nd - RB-tree element. */
388 	struct rb_node nd;
401 	struct mep *a = container_of(rb_node, struct mep, nd);
420 	return &me->nd;
424 		       struct rb_node *nd)
426 	struct mep *me = container_of(nd, struct mep, nd);
435 	struct rb_node *nd;
440 	nd = rblist__find(groups, &me);
441 	if (nd) {
443 		return container_of(nd, struct mep, nd);
446 	nd = rblist__find(groups, &me);
447 	if (nd)
448 		return container_of(nd, struct mep, nd);
543 		struct mep *me = container_of(node, struct mep, nd);
1033 		list_add(&root_metric->nd, metric_list);
1144 	const struct metric *left = container_of(l, struct metric, nd);
1145 	const struct metric *right = container_of(r, struct metric, nd);
1173 	const struct metric *left = container_of(l, struct metric, nd);
1174 	const struct metric *right = container_of(r, struct metric, nd);
1364 	list_for_each_entry_safe (m, tmp, metric_list, nd) {
1365 		list_del_init(&m->nd);
1381 	list_for_each_entry(m, metric_list, nd) {
1414 	list_for_each_entry(m, metric_list, nd) {
1576 	list_for_each_entry(m, &metric_list, nd) {
1590 			list_for_each_entry(n, &metric_list, nd) {
1666 		list_add(&expr->nd, &me->head);
1675 	list_for_each_entry(m, &metric_list, nd) {
1785 		struct rb_node *nd;
1792 		nd = rblist__entry(old_metric_events, i);
1793 		old_me = container_of(nd, struct metric_event, nd);
1805 		list_for_each_entry(old_expr, &old_me->head, nd) {
1860 			list_add(&new_expr->nd, &new_me->head);