Lines Matching defs:pos
2476 struct hist_entry *pos, *pair;
2479 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2480 pair = hists__find_hierarchy_entry(other_root, pos);
2483 hist_entry__add_pair(pair, pos);
2484 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2496 struct hist_entry *pos, *pair;
2510 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2511 pair = hists__find_entry(other, pos);
2514 hist_entry__add_pair(pair, pos);
2524 struct hist_entry *pos, *leader;
2527 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2529 if (hist_entry__has_pairs(pos)) {
2532 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2542 leader_root, pos);
2546 /* do not point parent in the pos */
2549 hist_entry__add_pair(pos, leader);
2552 if (!pos->leaf) {
2555 &pos->hroot_in) < 0)
2571 struct hist_entry *pos, *pair;
2586 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2588 if (!hist_entry__has_pairs(pos)) {
2589 pair = hists__add_dummy_entry(leader, pos);
2592 hist_entry__add_pair(pos, pair);
2603 struct hist_entry *pos;
2611 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2612 list_del_init(&pos->pairs.node);
2663 struct evsel *pos;
2666 evlist__for_each_entry(evlist, pos) {
2667 ret += fprintf(fp, "%s stats:\n", evsel__name(pos));
2668 ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
2703 struct evsel *pos;
2708 for_each_group_member(pos, evsel) {
2709 struct hists *pos_hists = evsel__hists(pos);
2822 struct perf_hpp_fmt *fmt, *pos;
2828 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {