57 	struct rb_node node;  member
71 	struct rb_node **node = &root_alloc_stat.rb_node;  in insert_alloc_stat()  local
75 	while (*node) {  in insert_alloc_stat()
76 		parent = *node;  in insert_alloc_stat()
77 		data = rb_entry(*node, struct alloc_stat, node);  in insert_alloc_stat()
80 			node = &(*node)->rb_right;  in insert_alloc_stat()
82 			node = &(*node)->rb_left;  in insert_alloc_stat()
103 		rb_link_node(&data->node, parent, node);  in insert_alloc_stat()
104 		rb_insert_color(&data->node, &root_alloc_stat);  in insert_alloc_stat()
114 	struct rb_node **node = &root_caller_stat.rb_node;  in insert_caller_stat()  local
118 	while (*node) {  in insert_caller_stat()
119 		parent = *node;  in insert_caller_stat()
120 		data = rb_entry(*node, struct alloc_stat, node);  in insert_caller_stat()
123 			node = &(*node)->rb_right;  in insert_caller_stat()
125 			node = &(*node)->rb_left;  in insert_caller_stat()
146 		rb_link_node(&data->node, parent, node);  in insert_caller_stat()
147 		rb_insert_color(&data->node, &root_caller_stat);  in insert_caller_stat()
196 	struct rb_node *node = root->rb_node;  in search_alloc_stat()  local
199 	while (node) {  in search_alloc_stat()
203 		data = rb_entry(node, struct alloc_stat, node);  in search_alloc_stat()
207 			node = node->rb_left;  in search_alloc_stat()
209 			node = node->rb_right;  in search_alloc_stat()
260 	struct rb_node 	node;  member
317 	struct rb_node *node;  in build_alloc_func_list()  local
338 	map__for_each_symbol(kernel_map, sym, node) {  in build_alloc_func_list()
370 	struct callchain_cursor_node *node;  in find_callsite()  local
385 		node = callchain_cursor_current(&callchain_cursor);  in find_callsite()
386 		if (node == NULL)  in find_callsite()
389 		key.start = key.end = node->ip;  in find_callsite()
394 			if (node->map)  in find_callsite()
395 				addr = map__unmap_ip(node->map, node->ip);  in find_callsite()
397 				addr = node->ip;  in find_callsite()
423 	struct rb_node **node = &page_live_tree.rb_node;  in __page_stat__findnew_page()  local
427 	while (*node) {  in __page_stat__findnew_page()
430 		parent = *node;  in __page_stat__findnew_page()
431 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_page()
435 			node = &parent->rb_left;  in __page_stat__findnew_page()
437 			node = &parent->rb_right;  in __page_stat__findnew_page()
452 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_page()
453 		rb_insert_color(&data->node, &page_live_tree);  in __page_stat__findnew_page()
472 	struct rb_node **node = &page_alloc_tree.rb_node;  in __page_stat__findnew_alloc()  local
477 	while (*node) {  in __page_stat__findnew_alloc()
480 		parent = *node;  in __page_stat__findnew_alloc()
481 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_alloc()
490 			node = &parent->rb_left;  in __page_stat__findnew_alloc()
492 			node = &parent->rb_right;  in __page_stat__findnew_alloc()
507 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_alloc()
508 		rb_insert_color(&data->node, &page_alloc_tree);  in __page_stat__findnew_alloc()
527 	struct rb_node **node = &page_caller_tree.rb_node;  in __page_stat__findnew_caller()  local
532 	while (*node) {  in __page_stat__findnew_caller()
535 		parent = *node;  in __page_stat__findnew_caller()
536 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_caller()
545 			node = &parent->rb_left;  in __page_stat__findnew_caller()
547 			node = &parent->rb_right;  in __page_stat__findnew_caller()
562 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_caller()
563 		rb_insert_color(&data->node, &page_caller_tree);  in __page_stat__findnew_caller()
866 	rb_erase(&pstat->node, &page_live_tree);  in perf_evsel__process_page_free_event()
892 			rb_erase(&pstat->node, &page_caller_tree);  in perf_evsel__process_page_free_event()
963 						   node);  in __print_slab_result()
1035 		data = rb_entry(next, struct page_stat, node);  in __print_page_alloc_result()
1078 		data = rb_entry(next, struct page_stat, node);  in __print_page_caller_result()
1219 		this = rb_entry(*new, struct alloc_stat, node);  in sort_slab_insert()
1234 	rb_link_node(&data->node, parent, new);  in sort_slab_insert()
1235 	rb_insert_color(&data->node, root);  in sort_slab_insert()
1241 	struct rb_node *node;  in __sort_slab_result()  local
1245 		node = rb_first(root);  in __sort_slab_result()
1246 		if (!node)  in __sort_slab_result()
1249 		rb_erase(node, root);  in __sort_slab_result()
1250 		data = rb_entry(node, struct alloc_stat, node);  in __sort_slab_result()
1266 		this = rb_entry(*new, struct page_stat, node);  in sort_page_insert()
1281 	rb_link_node(&data->node, parent, new);  in sort_page_insert()
1282 	rb_insert_color(&data->node, root);  in sort_page_insert()
1288 	struct rb_node *node;  in __sort_page_result()  local
1292 		node = rb_first(root);  in __sort_page_result()
1293 		if (!node)  in __sort_page_result()
1296 		rb_erase(node, root);  in __sort_page_result()
1297 		data = rb_entry(node, struct page_stat, node);  in __sort_page_result()