611 	struct rb_node		rb_node;  member
616 	struct rb_node **p = &tree->rb_root.rb_node;  in srcline__tree_insert()
617 	struct rb_node *parent = NULL;  in srcline__tree_insert()
632 		i = rb_entry(parent, struct srcline_node, rb_node);  in srcline__tree_insert()
640 	rb_link_node(&node->rb_node, parent, p);  in srcline__tree_insert()
641 	rb_insert_color_cached(&node->rb_node, tree, leftmost);  in srcline__tree_insert()
646 	struct rb_node *n = tree->rb_root.rb_node;  in srcline__tree_find()
650 						  rb_node);  in srcline__tree_find()
666 	struct rb_node *next = rb_first_cached(tree);  in srcline__tree_delete()
669 		pos = rb_entry(next, struct srcline_node, rb_node);  in srcline__tree_delete()
670 		next = rb_next(&pos->rb_node);  in srcline__tree_delete()
671 		rb_erase_cached(&pos->rb_node, tree);  in srcline__tree_delete()
708 	struct rb_node **p = &tree->rb_root.rb_node;  in inlines__tree_insert()
709 	struct rb_node *parent = NULL;  in inlines__tree_insert()
716 		i = rb_entry(parent, struct inline_node, rb_node);  in inlines__tree_insert()
724 	rb_link_node(&inlines->rb_node, parent, p);  in inlines__tree_insert()
725 	rb_insert_color_cached(&inlines->rb_node, tree, leftmost);  in inlines__tree_insert()
730 	struct rb_node *n = tree->rb_root.rb_node;  in inlines__tree_find()
734 						 rb_node);  in inlines__tree_find()
750 	struct rb_node *next = rb_first_cached(tree);  in inlines__tree_delete()
753 		pos = rb_entry(next, struct inline_node, rb_node);  in inlines__tree_delete()
754 		next = rb_next(&pos->rb_node);  in inlines__tree_delete()
755 		rb_erase_cached(&pos->rb_node, tree);  in inlines__tree_delete()