72 	struct rb_node node;  member
90 	struct rb_node **node = &root_alloc_stat.rb_node;  in insert_alloc_stat()  local
94 	while (*node) {  in insert_alloc_stat()
95 		parent = *node;  in insert_alloc_stat()
96 		data = rb_entry(*node, struct alloc_stat, node);  in insert_alloc_stat()
99 			node = &(*node)->rb_right;  in insert_alloc_stat()
101 			node = &(*node)->rb_left;  in insert_alloc_stat()
122 		rb_link_node(&data->node, parent, node);  in insert_alloc_stat()
123 		rb_insert_color(&data->node, &root_alloc_stat);  in insert_alloc_stat()
135 	struct rb_node **node = &root_caller_stat.rb_node;  in insert_caller_stat()  local
139 	while (*node) {  in insert_caller_stat()
140 		parent = *node;  in insert_caller_stat()
141 		data = rb_entry(*node, struct alloc_stat, node);  in insert_caller_stat()
144 			node = &(*node)->rb_right;  in insert_caller_stat()
146 			node = &(*node)->rb_left;  in insert_caller_stat()
167 		rb_link_node(&data->node, parent, node);  in insert_caller_stat()
168 		rb_insert_color(&data->node, &root_caller_stat);  in insert_caller_stat()
226 	struct rb_node *node = root->rb_node;  in search_alloc_stat()  local
229 	while (node) {  in search_alloc_stat()
233 		data = rb_entry(node, struct alloc_stat, node);  in search_alloc_stat()
237 			node = node->rb_left;  in search_alloc_stat()
239 			node = node->rb_right;  in search_alloc_stat()
291 	struct rb_node 	node;  member
348 	struct rb_node *node;  in build_alloc_func_list()  local
369 	map__for_each_symbol(kernel_map, sym, node) {  in build_alloc_func_list()
401 	struct callchain_cursor_node *node;  in find_callsite()  local
424 		node = callchain_cursor_current(cursor);  in find_callsite()
425 		if (node == NULL)  in find_callsite()
428 		key.start = key.end = node->ip;  in find_callsite()
433 			if (node->ms.map)  in find_callsite()
434 				addr = map__dso_unmap_ip(node->ms.map, node->ip);  in find_callsite()
436 				addr = node->ip;  in find_callsite()
464 	struct rb_node **node = &page_live_tree.rb_node;  in __page_stat__findnew_page()  local
468 	while (*node) {  in __page_stat__findnew_page()
471 		parent = *node;  in __page_stat__findnew_page()
472 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_page()
476 			node = &parent->rb_left;  in __page_stat__findnew_page()
478 			node = &parent->rb_right;  in __page_stat__findnew_page()
493 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_page()
494 		rb_insert_color(&data->node, &page_live_tree);  in __page_stat__findnew_page()
513 	struct rb_node **node = &page_alloc_tree.rb_node;  in __page_stat__findnew_alloc()  local
518 	while (*node) {  in __page_stat__findnew_alloc()
521 		parent = *node;  in __page_stat__findnew_alloc()
522 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_alloc()
531 			node = &parent->rb_left;  in __page_stat__findnew_alloc()
533 			node = &parent->rb_right;  in __page_stat__findnew_alloc()
548 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_alloc()
549 		rb_insert_color(&data->node, &page_alloc_tree);  in __page_stat__findnew_alloc()
568 	struct rb_node **node = &page_caller_tree.rb_node;  in __page_stat__findnew_caller()  local
573 	while (*node) {  in __page_stat__findnew_caller()
576 		parent = *node;  in __page_stat__findnew_caller()
577 		data = rb_entry(*node, struct page_stat, node);  in __page_stat__findnew_caller()
586 			node = &parent->rb_left;  in __page_stat__findnew_caller()
588 			node = &parent->rb_right;  in __page_stat__findnew_caller()
603 		rb_link_node(&data->node, parent, node);  in __page_stat__findnew_caller()
604 		rb_insert_color(&data->node, &page_caller_tree);  in __page_stat__findnew_caller()
914 	rb_erase(&pstat->node, &page_live_tree);  in evsel__process_page_free_event()
940 			rb_erase(&pstat->node, &page_caller_tree);  in evsel__process_page_free_event()
1015 						   node);  in __print_slab_result()
1087 		data = rb_entry(next, struct page_stat, node);  in __print_page_alloc_result()
1129 		data = rb_entry(next, struct page_stat, node);  in __print_page_caller_result()
1274 		this = rb_entry(*new, struct alloc_stat, node);  in sort_slab_insert()
1289 	rb_link_node(&data->node, parent, new);  in sort_slab_insert()
1290 	rb_insert_color(&data->node, root);  in sort_slab_insert()
1296 	struct rb_node *node;  in __sort_slab_result()  local
1300 		node = rb_first(root);  in __sort_slab_result()
1301 		if (!node)  in __sort_slab_result()
1304 		rb_erase(node, root);  in __sort_slab_result()
1305 		data = rb_entry(node, struct alloc_stat, node);  in __sort_slab_result()
1321 		this = rb_entry(*new, struct page_stat, node);  in sort_page_insert()
1336 	rb_link_node(&data->node, parent, new);  in sort_page_insert()
1337 	rb_insert_color(&data->node, root);  in sort_page_insert()
1343 	struct rb_node *node;  in __sort_page_result()  local
1347 		node = rb_first(root);  in __sort_page_result()
1348 		if (!node)  in __sort_page_result()
1351 		rb_erase(node, root);  in __sort_page_result()
1352 		data = rb_entry(node, struct page_stat, node);  in __sort_page_result()