Lines Matching refs:iter
905 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, in iter_next_nop_entry()
912 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused, in iter_add_next_nop_entry()
919 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_prepare_mem_entry() argument
921 struct perf_sample *sample = iter->sample; in iter_prepare_mem_entry()
928 iter->mi = mi; in iter_prepare_mem_entry()
933 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_add_single_mem_entry() argument
936 struct mem_info *mi = iter->mi; in iter_add_single_mem_entry()
937 struct hists *hists = evsel__hists(iter->evsel); in iter_add_single_mem_entry()
938 struct perf_sample *sample = iter->sample; in iter_add_single_mem_entry()
957 he = hists__add_entry(hists, al, iter->parent, NULL, mi, NULL, in iter_add_single_mem_entry()
962 iter->he = he; in iter_add_single_mem_entry()
967 iter_finish_mem_entry(struct hist_entry_iter *iter, in iter_finish_mem_entry() argument
970 struct evsel *evsel = iter->evsel; in iter_finish_mem_entry()
972 struct hist_entry *he = iter->he; in iter_finish_mem_entry()
980 err = hist_entry__append_callchain(he, iter->sample); in iter_finish_mem_entry()
983 mem_info__zput(iter->mi); in iter_finish_mem_entry()
985 iter->he = NULL; in iter_finish_mem_entry()
990 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_prepare_branch_entry() argument
993 struct perf_sample *sample = iter->sample; in iter_prepare_branch_entry()
999 iter->curr = 0; in iter_prepare_branch_entry()
1000 iter->total = sample->branch_stack->nr; in iter_prepare_branch_entry()
1002 iter->bi = bi; in iter_prepare_branch_entry()
1007 iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused, in iter_add_single_branch_entry()
1014 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_next_branch_entry() argument
1016 struct branch_info *bi = iter->bi; in iter_next_branch_entry()
1017 int i = iter->curr; in iter_next_branch_entry()
1022 if (iter->curr >= iter->total) in iter_next_branch_entry()
1035 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_add_next_branch_entry() argument
1038 struct evsel *evsel = iter->evsel; in iter_add_next_branch_entry()
1040 struct perf_sample *sample = iter->sample; in iter_add_next_branch_entry()
1042 int i = iter->curr; in iter_add_next_branch_entry()
1045 bi = iter->bi; in iter_add_next_branch_entry()
1047 if (iter->hide_unresolved && !(bi[i].from.ms.sym && bi[i].to.ms.sym)) in iter_add_next_branch_entry()
1057 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, NULL, in iter_add_next_branch_entry()
1063 iter->he = he; in iter_add_next_branch_entry()
1064 iter->curr++; in iter_add_next_branch_entry()
1077 iter_finish_branch_entry(struct hist_entry_iter *iter, in iter_finish_branch_entry() argument
1080 struct evsel *evsel = iter->evsel; in iter_finish_branch_entry()
1083 for (int i = 0; i < iter->total; i++) in iter_finish_branch_entry()
1084 branch_info__exit(&iter->bi[i]); in iter_finish_branch_entry()
1086 if (iter->he) in iter_finish_branch_entry()
1087 hists__inc_nr_samples(hists, iter->he->filtered); in iter_finish_branch_entry()
1089 zfree(&iter->bi); in iter_finish_branch_entry()
1090 iter->he = NULL; in iter_finish_branch_entry()
1092 return iter->curr >= iter->total ? 0 : -1; in iter_finish_branch_entry()
1096 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused, in iter_prepare_normal_entry()
1103 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al) in iter_add_single_normal_entry() argument
1105 struct evsel *evsel = iter->evsel; in iter_add_single_normal_entry()
1106 struct perf_sample *sample = iter->sample; in iter_add_single_normal_entry()
1109 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_single_normal_entry()
1114 iter->he = he; in iter_add_single_normal_entry()
1119 iter_finish_normal_entry(struct hist_entry_iter *iter, in iter_finish_normal_entry() argument
1122 struct hist_entry *he = iter->he; in iter_finish_normal_entry()
1123 struct evsel *evsel = iter->evsel; in iter_finish_normal_entry()
1124 struct perf_sample *sample = iter->sample; in iter_finish_normal_entry()
1129 iter->he = NULL; in iter_finish_normal_entry()
1137 iter_prepare_cumulative_entry(struct hist_entry_iter *iter, in iter_prepare_cumulative_entry() argument
1157 iter->he_cache = he_cache; in iter_prepare_cumulative_entry()
1158 iter->curr = 0; in iter_prepare_cumulative_entry()
1164 iter_add_single_cumulative_entry(struct hist_entry_iter *iter, in iter_add_single_cumulative_entry() argument
1167 struct evsel *evsel = iter->evsel; in iter_add_single_cumulative_entry()
1169 struct perf_sample *sample = iter->sample; in iter_add_single_cumulative_entry()
1170 struct hist_entry **he_cache = iter->he_cache; in iter_add_single_cumulative_entry()
1174 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, NULL, in iter_add_single_cumulative_entry()
1179 iter->he = he; in iter_add_single_cumulative_entry()
1180 he_cache[iter->curr++] = he; in iter_add_single_cumulative_entry()
1196 iter_next_cumulative_entry(struct hist_entry_iter *iter, in iter_next_cumulative_entry() argument
1205 return fill_callchain_info(al, node, iter->hide_unresolved); in iter_next_cumulative_entry()
1223 iter_add_next_cumulative_entry(struct hist_entry_iter *iter, in iter_add_next_cumulative_entry() argument
1226 struct evsel *evsel = iter->evsel; in iter_add_next_cumulative_entry()
1227 struct perf_sample *sample = iter->sample; in iter_add_next_cumulative_entry()
1228 struct hist_entry **he_cache = iter->he_cache; in iter_add_next_cumulative_entry()
1242 .parent = iter->parent, in iter_add_next_cumulative_entry()
1261 for (i = 0; i < iter->curr; i++) { in iter_add_next_cumulative_entry()
1272 iter->he = NULL; in iter_add_next_cumulative_entry()
1277 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_next_cumulative_entry()
1282 iter->he = he; in iter_add_next_cumulative_entry()
1283 he_cache[iter->curr++] = he; in iter_add_next_cumulative_entry()
1291 iter_finish_cumulative_entry(struct hist_entry_iter *iter, in iter_finish_cumulative_entry() argument
1294 mem_info__zput(iter->mi); in iter_finish_cumulative_entry()
1295 zfree(&iter->bi); in iter_finish_cumulative_entry()
1296 zfree(&iter->he_cache); in iter_finish_cumulative_entry()
1297 iter->he = NULL; in iter_finish_cumulative_entry()
1334 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al, in hist_entry_iter__add() argument
1343 err = sample__resolve_callchain(iter->sample, get_tls_callchain_cursor(), &iter->parent, in hist_entry_iter__add()
1344 iter->evsel, al, max_stack_depth); in hist_entry_iter__add()
1350 err = iter->ops->prepare_entry(iter, al); in hist_entry_iter__add()
1354 err = iter->ops->add_single_entry(iter, al); in hist_entry_iter__add()
1358 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1359 err = iter->add_entry_cb(iter, al, true, arg); in hist_entry_iter__add()
1364 while (iter->ops->next_entry(iter, al)) { in hist_entry_iter__add()
1365 err = iter->ops->add_next_entry(iter, al); in hist_entry_iter__add()
1369 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1370 err = iter->add_entry_cb(iter, al, false, arg); in hist_entry_iter__add()
1377 err2 = iter->ops->finish_entry(iter, al); in hist_entry_iter__add()
1633 struct hist_entry *iter, *new; in hierarchy_insert_entry() local
1640 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1641 cmp = hist_entry__collapse_hierarchy(hpp_list, iter, he); in hierarchy_insert_entry()
1643 he_stat__add_stat(&iter->stat, &he->stat); in hierarchy_insert_entry()
1644 hists__add_mem_stat(hists, iter, he); in hierarchy_insert_entry()
1645 return iter; in hierarchy_insert_entry()
1754 struct hist_entry *iter; in hists__collapse_insert_entry() local
1763 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1765 cmp = hist_entry__collapse(iter, he); in hists__collapse_insert_entry()
1770 he_stat__add_stat(&iter->stat, &he->stat); in hists__collapse_insert_entry()
1772 he_stat__add_stat(iter->stat_acc, he->stat_acc); in hists__collapse_insert_entry()
1773 hists__add_mem_stat(hists, iter, he); in hists__collapse_insert_entry()
1780 if (callchain_merge(cursor, iter->callchain, he->callchain) < 0) in hists__collapse_insert_entry()
1937 struct hist_entry *iter; in hierarchy_insert_output_entry() local
1943 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1945 if (hist_entry__sort(he, iter) > 0) in hierarchy_insert_output_entry()
2024 struct hist_entry *iter; in __hists__insert_output_entry() local
2043 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
2045 if (hist_entry__sort(he, iter) > 0) in __hists__insert_output_entry()
2357 struct hist_entry *iter; in resort_filtered_entry() local
2364 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2366 if (hist_entry__sort(he, iter) > 0) in resort_filtered_entry()
2644 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry() local
2645 int64_t cmp = hist_entry__collapse(iter, he); in hists__find_entry()
2652 return iter; in hists__find_entry()
2664 struct hist_entry *iter; in hists__find_hierarchy_entry() local
2667 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2668 cmp = hist_entry__collapse_hierarchy(he->hpp_list, iter, he); in hists__find_hierarchy_entry()
2674 return iter; in hists__find_hierarchy_entry()