Lines Matching refs:node
346 struct rb_node *node = rb_first_cached(&he->hroot_out);
347 while (node) {
348 child = rb_entry(node, struct hist_entry, rb_node);
349 node = rb_next(node);
500 INIT_LIST_HEAD(&he->pairs.node);
1090 struct callchain_cursor_node *node;
1092 node = callchain_cursor_current(get_tls_callchain_cursor());
1093 if (node == NULL)
1096 return fill_callchain_info(al, node, iter->hide_unresolved);
1550 struct perf_hpp_list_node *node;
1556 list_for_each_entry(node, &hists->hpp_formats, list) {
1558 if (node->level == 0 || node->skip)
1562 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1766 struct rb_node *node;
1769 node = rb_first_cached(&hists->entries);
1779 while (node) {
1780 he = rb_entry(node, struct hist_entry, rb_node);
1781 node = rb_next(node);
1827 struct rb_node *node;
1831 node = rb_first_cached(root_in);
1833 while (node) {
1834 he = rb_entry(node, struct hist_entry, rb_node_in);
1835 node = rb_next(node);
2017 struct rb_node *rb_hierarchy_last(struct rb_node *node)
2019 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2022 node = rb_last(&he->hroot_out.rb_root);
2023 he = rb_entry(node, struct hist_entry, rb_node);
2025 return node;
2028 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
2030 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2033 node = rb_first_cached(&he->hroot_out);
2035 node = rb_next(node);
2037 while (node == NULL) {
2042 node = rb_next(&he->rb_node);
2044 return node;
2047 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2049 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2051 node = rb_prev(node);
2052 if (node)
2053 return rb_hierarchy_last(node);
2064 struct rb_node *node;
2071 node = rb_first_cached(&he->hroot_out);
2072 child = rb_entry(node, struct hist_entry, rb_node);
2074 while (node && child->filtered) {
2075 node = rb_next(node);
2076 child = rb_entry(node, struct hist_entry, rb_node);
2079 if (node)
2084 return node && percent >= limit;
2584 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2664 list_del_init(&pos->pairs.node);
2862 struct rb_node *node;
2866 node = rb_first_cached(root);
2867 rb_erase_cached(node, root);
2869 he = rb_entry(node, struct hist_entry, rb_node_in);
2886 struct perf_hpp_list_node *node, *tmp;
2890 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2891 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2895 list_del_init(&node->list);
2896 free(node);