260 	struct rb_node		rb_node;  member
265 	struct rb_node **p = &tree->rb_root.rb_node;  in srcline__tree_insert()
266 	struct rb_node *parent = NULL;  in srcline__tree_insert()
281 		i = rb_entry(parent, struct srcline_node, rb_node);  in srcline__tree_insert()
289 	rb_link_node(&node->rb_node, parent, p);  in srcline__tree_insert()
290 	rb_insert_color_cached(&node->rb_node, tree, leftmost);  in srcline__tree_insert()
295 	struct rb_node *n = tree->rb_root.rb_node;  in srcline__tree_find()
299 						  rb_node);  in srcline__tree_find()
315 	struct rb_node *next = rb_first_cached(tree);  in srcline__tree_delete()
318 		pos = rb_entry(next, struct srcline_node, rb_node);  in srcline__tree_delete()
319 		next = rb_next(&pos->rb_node);  in srcline__tree_delete()
320 		rb_erase_cached(&pos->rb_node, tree);  in srcline__tree_delete()
357 	struct rb_node **p = &tree->rb_root.rb_node;  in inlines__tree_insert()
358 	struct rb_node *parent = NULL;  in inlines__tree_insert()
365 		i = rb_entry(parent, struct inline_node, rb_node);  in inlines__tree_insert()
373 	rb_link_node(&inlines->rb_node, parent, p);  in inlines__tree_insert()
374 	rb_insert_color_cached(&inlines->rb_node, tree, leftmost);  in inlines__tree_insert()
379 	struct rb_node *n = tree->rb_root.rb_node;  in inlines__tree_find()
383 						 rb_node);  in inlines__tree_find()
399 	struct rb_node *next = rb_first_cached(tree);  in inlines__tree_delete()
402 		pos = rb_entry(next, struct inline_node, rb_node);  in inlines__tree_delete()
403 		next = rb_next(&pos->rb_node);  in inlines__tree_delete()
404 		rb_erase_cached(&pos->rb_node, tree);  in inlines__tree_delete()