38 	struct rb_node **p = &maps__entries(maps)->rb_node;  in __maps__insert()
39 	struct rb_node *parent = NULL;  in __maps__insert()
47 	RB_CLEAR_NODE(&new_rb_node->rb_node);  in __maps__insert()
52 		m = rb_entry(parent, struct map_rb_node, rb_node);  in __maps__insert()
59 	rb_link_node(&new_rb_node->rb_node, parent, p);  in __maps__insert()
60 	rb_insert_color(&new_rb_node->rb_node, maps__entries(maps));  in __maps__insert()
113 static void __maps__remove(struct maps *maps, struct map_rb_node *rb_node)  in __maps__remove()  argument
115 	rb_erase_init(&rb_node->rb_node, maps__entries(maps));  in __maps__remove()
116 	map__put(rb_node->map);  in __maps__remove()
117 	free(rb_node);  in __maps__remove()
122 	struct map_rb_node *rb_node;  in maps__remove()  local
128 	rb_node = maps__find_node(maps, map);  in maps__remove()
129 	assert(rb_node->RC_CHK_ACCESS(map) == RC_CHK_ACCESS(map));  in maps__remove()
130 	__maps__remove(maps, rb_node);  in maps__remove()
145 		rb_erase_init(&pos->rb_node,  maps__entries(maps));  in __maps__purge()
280 	struct rb_node *next, *first;  in maps__fixup_overlappings()
291 	next = root->rb_node;  in maps__fixup_overlappings()
294 		struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);  in maps__fixup_overlappings()
307 		struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);  in maps__fixup_overlappings()
308 		next = rb_next(&pos->rb_node);  in maps__fixup_overlappings()
329 		rb_erase_init(&pos->rb_node, root);  in maps__fixup_overlappings()
390 	struct map_rb_node *rb_node;  in maps__clone()  local
394 	maps__for_each_entry(parent, rb_node) {  in maps__clone()
395 		struct map *new = map__clone(rb_node->map);  in maps__clone()
421 	struct map_rb_node *rb_node;  in maps__find_node()  local
423 	maps__for_each_entry(maps, rb_node) {  in maps__find_node()
424 		if (rb_node->RC_CHK_ACCESS(map) == RC_CHK_ACCESS(map))  in maps__find_node()
425 			return rb_node;  in maps__find_node()
432 	struct rb_node *p;  in maps__find()
438 	p = maps__entries(maps)->rb_node;  in maps__find()
440 		m = rb_entry(p, struct map_rb_node, rb_node);  in maps__find()
457 	struct rb_node *first = rb_first(maps__entries(maps));  in maps__first()
460 		return rb_entry(first, struct map_rb_node, rb_node);  in maps__first()
466 	struct rb_node *next;  in map_rb_node__next()
471 	next = rb_next(&node->rb_node);  in map_rb_node__next()
476 	return rb_entry(next, struct map_rb_node, rb_node);  in map_rb_node__next()