597 	struct rb_node		rb_node;  member
602 	struct rb_node **p = &tree->rb_root.rb_node;  in srcline__tree_insert()
603 	struct rb_node *parent = NULL;  in srcline__tree_insert()
618 		i = rb_entry(parent, struct srcline_node, rb_node);  in srcline__tree_insert()
626 	rb_link_node(&node->rb_node, parent, p);  in srcline__tree_insert()
627 	rb_insert_color_cached(&node->rb_node, tree, leftmost);  in srcline__tree_insert()
632 	struct rb_node *n = tree->rb_root.rb_node;  in srcline__tree_find()
636 						  rb_node);  in srcline__tree_find()
652 	struct rb_node *next = rb_first_cached(tree);  in srcline__tree_delete()
655 		pos = rb_entry(next, struct srcline_node, rb_node);  in srcline__tree_delete()
656 		next = rb_next(&pos->rb_node);  in srcline__tree_delete()
657 		rb_erase_cached(&pos->rb_node, tree);  in srcline__tree_delete()
694 	struct rb_node **p = &tree->rb_root.rb_node;  in inlines__tree_insert()
695 	struct rb_node *parent = NULL;  in inlines__tree_insert()
702 		i = rb_entry(parent, struct inline_node, rb_node);  in inlines__tree_insert()
710 	rb_link_node(&inlines->rb_node, parent, p);  in inlines__tree_insert()
711 	rb_insert_color_cached(&inlines->rb_node, tree, leftmost);  in inlines__tree_insert()
716 	struct rb_node *n = tree->rb_root.rb_node;  in inlines__tree_find()
720 						 rb_node);  in inlines__tree_find()
736 	struct rb_node *next = rb_first_cached(tree);  in inlines__tree_delete()
739 		pos = rb_entry(next, struct inline_node, rb_node);  in inlines__tree_delete()
740 		next = rb_next(&pos->rb_node);  in inlines__tree_delete()
741 		rb_erase_cached(&pos->rb_node, tree);  in inlines__tree_delete()