perf/util/hist.c

255 	struct rb_node *next = rb_first_cached(&hists->entries);
262 		n = rb_entry(next, struct hist_entry, rb_node);
265 		next = rb_next(&n->rb_node);
346 		struct rb_node *node = rb_first_cached(&he->hroot_out);
348 			child = rb_entry(node, struct hist_entry, rb_node);
376 	rb_erase_cached(&he->rb_node, root_out);
387 	struct rb_node *next = rb_first_cached(&hists->entries);
391 		n = rb_entry(next, struct hist_entry, rb_node);
392 		next = rb_next(&n->rb_node);
403 	struct rb_node *next = rb_first_cached(&hists->entries);
407 		n = rb_entry(next, struct hist_entry, rb_node);
408 		next = rb_next(&n->rb_node);
416 	struct rb_node *next = rb_first_cached(&hists->entries);
421 		n = rb_entry(next, struct hist_entry, rb_node);
425 		next = rb_next(&n->rb_node);
595 	struct rb_node **p;
596 	struct rb_node *parent = NULL;
602 	p = &hists->entries_in->rb_root.rb_node;
1478 	struct rb_node **p = &root->rb_root.rb_node;
1479 	struct rb_node *parent = NULL;
1600 	struct rb_node **p = &root->rb_root.rb_node;
1601 	struct rb_node *parent = NULL;
1677 	struct rb_node *next;
1764 	struct rb_node *node;
1778 		he = rb_entry(node, struct hist_entry, rb_node);
1790 	struct rb_node **p = &root->rb_root.rb_node;
1791 	struct rb_node *parent = NULL;
1798 		iter = rb_entry(parent, struct hist_entry, rb_node);
1808 	rb_link_node(&he->rb_node, parent, p);
1809 	rb_insert_color_cached(&he->rb_node, root, leftmost);
1825 	struct rb_node *node;
1877 	struct rb_node **p = &entries->rb_root.rb_node;
1878 	struct rb_node *parent = NULL;
1898 		iter = rb_entry(parent, struct hist_entry, rb_node);
1908 	rb_link_node(&he->rb_node, parent, p);
1909 	rb_insert_color_cached(&he->rb_node, entries, leftmost);
1923 	struct rb_node *next;
2015 struct rb_node *rb_hierarchy_last(struct rb_node *node)
2017 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2021 		he = rb_entry(node, struct hist_entry, rb_node);
2026 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
2028 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2040 		node = rb_next(&he->rb_node);
2045 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2047 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2057 	return &he->rb_node;
2062 	struct rb_node *node;
2070 	child = rb_entry(node, struct hist_entry, rb_node);
2074 		child = rb_entry(node, struct hist_entry, rb_node);
2180 	struct rb_node *nd;
2188 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2200 	struct rb_node **p = &root->rb_root.rb_node;
2201 	struct rb_node *parent = NULL;
2204 	struct rb_node *nd;
2209 		iter = rb_entry(parent, struct hist_entry, rb_node);
2219 	rb_link_node(&he->rb_node, parent, p);
2220 	rb_insert_color_cached(&he->rb_node, root, leftmost);
2227 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2230 		rb_erase_cached(&h->rb_node, &he->hroot_out);
2240 	struct rb_node *nd;
2250 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2263 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2272 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2282 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2294 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2297 		rb_erase_cached(&h->rb_node, &hists->entries);
2377 	struct rb_node **p;
2378 	struct rb_node *parent = NULL;
2388 	p = &root->rb_root.rb_node;
2426 	struct rb_node **p;
2427 	struct rb_node *parent = NULL;
2432 	p = &root->rb_root.rb_node;
2472 	struct rb_node *n;
2475 		n = hists->entries_collapsed.rb_root.rb_node;
2477 		n = hists->entries_in->rb_root.rb_node;
2497 	struct rb_node *n = root->rb_root.rb_node;
2525 	struct rb_node *nd;
2545 	struct rb_node *nd;
2573 	struct rb_node *nd;
2620 	struct rb_node *nd;
2652 	struct rb_node *nd;
2858 	struct rb_node *node;