Lines Matching refs:node
336 struct rb_node *node = rb_first_cached(&he->hroot_out);
337 while (node) {
338 child = rb_entry(node, struct hist_entry, rb_node);
339 node = rb_next(node);
489 INIT_LIST_HEAD(&he->pairs.node);
1064 struct callchain_cursor_node *node;
1066 node = callchain_cursor_current(&callchain_cursor);
1067 if (node == NULL)
1070 return fill_callchain_info(al, node, iter->hide_unresolved);
1517 struct perf_hpp_list_node *node;
1523 list_for_each_entry(node, &hists->hpp_formats, list) {
1525 if (node->level == 0 || node->skip)
1529 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1724 struct rb_node *node;
1727 node = rb_first_cached(&hists->entries);
1737 while (node) {
1738 he = rb_entry(node, struct hist_entry, rb_node);
1739 node = rb_next(node);
1785 struct rb_node *node;
1789 node = rb_first_cached(root_in);
1791 while (node) {
1792 he = rb_entry(node, struct hist_entry, rb_node_in);
1793 node = rb_next(node);
1975 struct rb_node *rb_hierarchy_last(struct rb_node *node)
1977 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1980 node = rb_last(&he->hroot_out.rb_root);
1981 he = rb_entry(node, struct hist_entry, rb_node);
1983 return node;
1986 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1991 node = rb_first_cached(&he->hroot_out);
1993 node = rb_next(node);
1995 while (node == NULL) {
2000 node = rb_next(&he->rb_node);
2002 return node;
2005 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2007 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2009 node = rb_prev(node);
2010 if (node)
2011 return rb_hierarchy_last(node);
2022 struct rb_node *node;
2029 node = rb_first_cached(&he->hroot_out);
2030 child = rb_entry(node, struct hist_entry, rb_node);
2032 while (node && child->filtered) {
2033 node = rb_next(node);
2034 child = rb_entry(node, struct hist_entry, rb_node);
2037 if (node)
2042 return node && percent >= limit;
2532 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2612 list_del_init(&pos->pairs.node);
2799 struct rb_node *node;
2803 node = rb_first_cached(root);
2804 rb_erase_cached(node, root);
2806 he = rb_entry(node, struct hist_entry, rb_node_in);
2823 struct perf_hpp_list_node *node, *tmp;
2827 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2828 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2832 list_del_init(&node->list);
2833 free(node);