51 	struct rb_node node;  member
65 	struct rb_node **node = &root_alloc_stat.rb_node;  in insert_alloc_stat()  local
69 	while (*node) {  in insert_alloc_stat()
70 		parent = *node;  in insert_alloc_stat()
71 		data = rb_entry(*node, struct alloc_stat, node);  in insert_alloc_stat()
74 			node = &(*node)->rb_right;  in insert_alloc_stat()
76 			node = &(*node)->rb_left;  in insert_alloc_stat()
97 		rb_link_node(&data->node, parent, node);  in insert_alloc_stat()
98 		rb_insert_color(&data->node, &root_alloc_stat);  in insert_alloc_stat()
108 	struct rb_node **node = &root_caller_stat.rb_node;  in insert_caller_stat()  local
112 	while (*node) {  in insert_caller_stat()
113 		parent = *node;  in insert_caller_stat()
114 		data = rb_entry(*node, struct alloc_stat, node);  in insert_caller_stat()
117 			node = &(*node)->rb_right;  in insert_caller_stat()
119 			node = &(*node)->rb_left;  in insert_caller_stat()
140 		rb_link_node(&data->node, parent, node);  in insert_caller_stat()
141 		rb_insert_color(&data->node, &root_caller_stat);  in insert_caller_stat()
190 	struct rb_node *node = root->rb_node;  in search_alloc_stat()  local
193 	while (node) {  in search_alloc_stat()
197 		data = rb_entry(node, struct alloc_stat, node);  in search_alloc_stat()
201 			node = node->rb_left;  in search_alloc_stat()
203 			node = node->rb_right;  in search_alloc_stat()
251 	struct rb_node 	node;  member
268 	struct rb_node **node = &page_tree.rb_node;  in search_page()  local
272 	while (*node) {  in search_page()
275 		parent = *node;  in search_page()
276 		data = rb_entry(*node, struct page_stat, node);  in search_page()
280 			node = &parent->rb_left;  in search_page()
282 			node = &parent->rb_right;  in search_page()
294 		rb_link_node(&data->node, parent, node);  in search_page()
295 		rb_insert_color(&data->node, &page_tree);  in search_page()
324 	struct rb_node **node = &page_alloc_tree.rb_node;  in search_page_alloc_stat()  local
328 	while (*node) {  in search_page_alloc_stat()
331 		parent = *node;  in search_page_alloc_stat()
332 		data = rb_entry(*node, struct page_stat, node);  in search_page_alloc_stat()
336 			node = &parent->rb_left;  in search_page_alloc_stat()
338 			node = &parent->rb_right;  in search_page_alloc_stat()
353 		rb_link_node(&data->node, parent, node);  in search_page_alloc_stat()
354 		rb_insert_color(&data->node, &page_alloc_tree);  in search_page_alloc_stat()
459 	rb_erase(&pstat->node, &page_tree);  in perf_evsel__process_page_free_event()
532 						   node);  in __print_slab_result()
599 		data = rb_entry(next, struct page_stat, node);  in __print_page_result()
718 		this = rb_entry(*new, struct alloc_stat, node);  in sort_slab_insert()
733 	rb_link_node(&data->node, parent, new);  in sort_slab_insert()
734 	rb_insert_color(&data->node, root);  in sort_slab_insert()
740 	struct rb_node *node;  in __sort_slab_result()  local
744 		node = rb_first(root);  in __sort_slab_result()
745 		if (!node)  in __sort_slab_result()
748 		rb_erase(node, root);  in __sort_slab_result()
749 		data = rb_entry(node, struct alloc_stat, node);  in __sort_slab_result()
763 		this = rb_entry(*new, struct page_stat, node);  in sort_page_insert()
775 	rb_link_node(&data->node, parent, new);  in sort_page_insert()
776 	rb_insert_color(&data->node, root);  in sort_page_insert()
781 	struct rb_node *node;  in __sort_page_result()  local
785 		node = rb_first(root);  in __sort_page_result()
786 		if (!node)  in __sort_page_result()
789 		rb_erase(node, root);  in __sort_page_result()
790 		data = rb_entry(node, struct page_stat, node);  in __sort_page_result()