Lines Matching +full:2 +full:nd
53 return hpp__fmt(fmt, hpp, he, he_get_##_field, " %*.2f%%", \
67 return hpp__fmt_acc(fmt, hpp, he, he_get_acc_##_field, " %*.2f%%", \
100 struct rb_node *nd; in perf_gtk__add_callchain_flat() local
103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
109 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_flat()
163 struct rb_node *nd; in perf_gtk__add_callchain_folded() local
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
173 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_folded()
223 struct rb_node *nd; in perf_gtk__add_callchain_graph() local
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
233 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_graph()
300 struct rb_node *nd; in perf_gtk__show_hists() local
358 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) { in perf_gtk__show_hists()
359 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in perf_gtk__show_hists()
460 advance_hpp(hpp, ret + 2); in perf_gtk__add_hierarchy_entries()
477 snprintf(buf, sizeof(buf), "no entry >= %.2f%%", in perf_gtk__add_hierarchy_entries()