42 	struct rb_node **p = &self->entries.rb_node;  in strlist__add()
43 	struct rb_node *parent = NULL;  in strlist__add()
50 		sn = rb_entry(parent, struct str_node, rb_node);  in strlist__add()
65 	rb_link_node(&sn->rb_node, parent, p);  in strlist__add()
66 	rb_insert_color(&sn->rb_node, &self->entries);  in strlist__add()
101 	rb_erase(&sn->rb_node, &self->entries);  in strlist__remove()
107 	struct rb_node **p = &self->entries.rb_node;  in strlist__find()
108 	struct rb_node *parent = NULL;  in strlist__find()
115 		sn = rb_entry(parent, struct str_node, rb_node);  in strlist__find()
176 		struct rb_node *next = rb_first(&self->entries);  in strlist__delete()
179 			pos = rb_entry(next, struct str_node, rb_node);  in strlist__delete()
180 			next = rb_next(&pos->rb_node);  in strlist__delete()
190 	struct rb_node *nd;  in strlist__entry()
193 		struct str_node *pos = rb_entry(nd, struct str_node, rb_node);  in strlist__entry()