8 #include "maps.h"
18 #define maps__for_each_entry(maps, map) \  argument
19 	for (map = maps__first(maps); map; map = map_rb_node__next(map))
21 #define maps__for_each_entry_safe(maps, map, next) \  argument
22 	for (map = maps__first(maps), next = map_rb_node__next(map); map; \
25 static struct rb_root *maps__entries(struct maps *maps)  in maps__entries()  argument
27 	return &RC_CHK_ACCESS(maps)->entries;  in maps__entries()
30 static struct rw_semaphore *maps__lock(struct maps *maps)  in maps__lock()  argument
32 	return &RC_CHK_ACCESS(maps)->lock;  in maps__lock()
35 static struct map **maps__maps_by_name(struct maps *maps)  in maps__maps_by_name()  argument
37 	return RC_CHK_ACCESS(maps)->maps_by_name;  in maps__maps_by_name()
40 static struct map_rb_node *maps__first(struct maps *maps)  in maps__first()  argument
42 	struct rb_node *first = rb_first(maps__entries(maps));  in maps__first()
64 static struct map_rb_node *maps__find_node(struct maps *maps, struct map *map)  in maps__find_node()  argument
68 	maps__for_each_entry(maps, rb_node) {  in maps__find_node()
75 static void maps__init(struct maps *maps, struct machine *machine)  in maps__init()  argument
77 	refcount_set(maps__refcnt(maps), 1);  in maps__init()
78 	init_rwsem(maps__lock(maps));  in maps__init()
79 	RC_CHK_ACCESS(maps)->entries = RB_ROOT;  in maps__init()
80 	RC_CHK_ACCESS(maps)->machine = machine;  in maps__init()
81 	RC_CHK_ACCESS(maps)->last_search_by_name = NULL;  in maps__init()
82 	RC_CHK_ACCESS(maps)->nr_maps = 0;  in maps__init()
83 	RC_CHK_ACCESS(maps)->maps_by_name = NULL;  in maps__init()
86 static void __maps__free_maps_by_name(struct maps *maps)  in __maps__free_maps_by_name()  argument
91 	for (unsigned int i = 0; i < maps__nr_maps(maps); i++)  in __maps__free_maps_by_name()
92 		map__put(maps__maps_by_name(maps)[i]);  in __maps__free_maps_by_name()
94 	zfree(&RC_CHK_ACCESS(maps)->maps_by_name);  in __maps__free_maps_by_name()
95 	RC_CHK_ACCESS(maps)->nr_maps_allocated = 0;  in __maps__free_maps_by_name()
98 static int __maps__insert(struct maps *maps, struct map *map)  in __maps__insert()  argument
100 	struct rb_node **p = &maps__entries(maps)->rb_node;  in __maps__insert()
122 	rb_insert_color(&new_rb_node->rb_node, maps__entries(maps));  in __maps__insert()
126 int maps__insert(struct maps *maps, struct map *map)  in maps__insert()  argument
131 	down_write(maps__lock(maps));  in maps__insert()
132 	err = __maps__insert(maps, map);  in maps__insert()
136 	++RC_CHK_ACCESS(maps)->nr_maps;  in maps__insert()
142 			kmap->kmaps = maps;  in maps__insert()
152 	if (maps__maps_by_name(maps)) {  in maps__insert()
153 		if (maps__nr_maps(maps) > RC_CHK_ACCESS(maps)->nr_maps_allocated) {  in maps__insert()
154 			int nr_allocate = maps__nr_maps(maps) * 2;  in maps__insert()
155 			struct map **maps_by_name = realloc(maps__maps_by_name(maps),  in maps__insert()
159 				__maps__free_maps_by_name(maps);  in maps__insert()
164 			RC_CHK_ACCESS(maps)->maps_by_name = maps_by_name;  in maps__insert()
165 			RC_CHK_ACCESS(maps)->nr_maps_allocated = nr_allocate;  in maps__insert()
167 		maps__maps_by_name(maps)[maps__nr_maps(maps) - 1] = map__get(map);  in maps__insert()  local
168 		__maps__sort_by_name(maps);  in maps__insert()
171 	up_write(maps__lock(maps));  in maps__insert()
175 static void __maps__remove(struct maps *maps, struct map_rb_node *rb_node)  in __maps__remove()  argument
177 	rb_erase_init(&rb_node->rb_node, maps__entries(maps));  in __maps__remove()
182 void maps__remove(struct maps *maps, struct map *map)  in maps__remove()  argument
186 	down_write(maps__lock(maps));  in maps__remove()
187 	if (RC_CHK_ACCESS(maps)->last_search_by_name == map)  in maps__remove()
188 		RC_CHK_ACCESS(maps)->last_search_by_name = NULL;  in maps__remove()
190 	rb_node = maps__find_node(maps, map);  in maps__remove()
192 	__maps__remove(maps, rb_node);  in maps__remove()
193 	if (maps__maps_by_name(maps))  in maps__remove()
194 		__maps__free_maps_by_name(maps);  in maps__remove()
195 	--RC_CHK_ACCESS(maps)->nr_maps;  in maps__remove()
196 	up_write(maps__lock(maps));  in maps__remove()
199 static void __maps__purge(struct maps *maps)  in __maps__purge()  argument
203 	if (maps__maps_by_name(maps))  in __maps__purge()
204 		__maps__free_maps_by_name(maps);  in __maps__purge()
206 	maps__for_each_entry_safe(maps, pos, next) {  in __maps__purge()
207 		rb_erase_init(&pos->rb_node,  maps__entries(maps));  in __maps__purge()
213 static void maps__exit(struct maps *maps)  in maps__exit()  argument
215 	down_write(maps__lock(maps));  in maps__exit()
216 	__maps__purge(maps);  in maps__exit()
217 	up_write(maps__lock(maps));  in maps__exit()
220 bool maps__empty(struct maps *maps)  in maps__empty()  argument
222 	return !maps__first(maps);  in maps__empty()
225 struct maps *maps__new(struct machine *machine)  in maps__new()
227 	struct maps *result;  in maps__new()
228 	RC_STRUCT(maps) *maps = zalloc(sizeof(*maps));  in maps__new()
230 	if (ADD_RC_CHK(result, maps))  in maps__new()
236 static void maps__delete(struct maps *maps)  in maps__delete()  argument
238 	maps__exit(maps);  in maps__delete()
239 	unwind__finish_access(maps);  in maps__delete()
240 	RC_CHK_FREE(maps);  in maps__delete()
243 struct maps *maps__get(struct maps *maps)  in maps__get()  argument
245 	struct maps *result;  in maps__get()
247 	if (RC_CHK_GET(result, maps))  in maps__get()
248 		refcount_inc(maps__refcnt(maps));  in maps__get()
253 void maps__put(struct maps *maps)  in maps__put()  argument
255 	if (maps && refcount_dec_and_test(maps__refcnt(maps)))  in maps__put()
256 		maps__delete(maps);  in maps__put()
258 		RC_CHK_PUT(maps);  in maps__put()
261 int maps__for_each_map(struct maps *maps, int (*cb)(struct map *map, void *data), void *data)  in maps__for_each_map()  argument
266 	down_read(maps__lock(maps));  in maps__for_each_map()
267 	maps__for_each_entry(maps, pos)	{  in maps__for_each_map()
272 	up_read(maps__lock(maps));  in maps__for_each_map()
276 void maps__remove_maps(struct maps *maps, bool (*cb)(struct map *map, void *data), void *data)  in maps__remove_maps()  argument
281 	down_write(maps__lock(maps));  in maps__remove_maps()
283 	start_nr_maps = maps__nr_maps(maps);  in maps__remove_maps()
284 	maps__for_each_entry_safe(maps, pos, next)	{  in maps__remove_maps()
286 			__maps__remove(maps, pos);  in maps__remove_maps()
287 			--RC_CHK_ACCESS(maps)->nr_maps;  in maps__remove_maps()
290 	if (maps__maps_by_name(maps) && start_nr_maps != maps__nr_maps(maps))  in maps__remove_maps()
291 		__maps__free_maps_by_name(maps);  in maps__remove_maps()
293 	up_write(maps__lock(maps));  in maps__remove_maps()
296 struct symbol *maps__find_symbol(struct maps *maps, u64 addr, struct map **mapp)  in maps__find_symbol()  argument
298 	struct map *map = maps__find(maps, addr);  in maps__find_symbol()
334 struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name, struct map **mapp)  in maps__find_symbol_by_name()  argument
342 	maps__for_each_map(maps, maps__find_symbol_by_name_cb, &args);  in maps__find_symbol_by_name()
346 int maps__find_ams(struct maps *maps, struct addr_map_symbol *ams)  in maps__find_ams()  argument
349 		if (maps == NULL)  in maps__find_ams()
351 		ams->ms.map = maps__find(maps, ams->addr);  in maps__find_ams()
380 size_t maps__fprintf(struct maps *maps, FILE *fp)  in maps__fprintf()  argument
387 	maps__for_each_map(maps, maps__fprintf_cb, &args);  in maps__fprintf()
396 static struct rb_node *first_ending_after(struct maps *maps, const struct map *map)  in first_ending_after()  argument
401 	root = maps__entries(maps);  in first_ending_after()
419  * Adds new to maps, if new overlaps existing entries then the existing maps are
422 int maps__fixup_overlap_and_insert(struct maps *maps, struct map *new)  in maps__fixup_overlap_and_insert()  argument
429 	down_write(maps__lock(maps));  in maps__fixup_overlap_and_insert()
431 	next = first_ending_after(maps, new);  in maps__fixup_overlap_and_insert()
438 		 * Maps are ordered by start: next will not overlap for sure.  in maps__fixup_overlap_and_insert()
446 				pr_debug("overlapping maps in %s (disable tui for more info)\n",  in maps__fixup_overlap_and_insert()
449 				pr_debug("overlapping maps:\n");  in maps__fixup_overlap_and_insert()
455 		rb_erase_init(&pos->rb_node, maps__entries(maps));  in maps__fixup_overlap_and_insert()
457 		 * Now check if we need to create new maps for areas not  in maps__fixup_overlap_and_insert()
469 			err = __maps__insert(maps, before);  in maps__fixup_overlap_and_insert()
492 			err = __maps__insert(maps, after);  in maps__fixup_overlap_and_insert()
506 	err = __maps__insert(maps, new);  in maps__fixup_overlap_and_insert()
507 	up_write(maps__lock(maps));  in maps__fixup_overlap_and_insert()
511 int maps__copy_from(struct maps *maps, struct maps *parent)  in maps__copy_from()  argument
526 		err = unwind__prepare_access(maps, new, NULL);  in maps__copy_from()
530 		err = maps__insert(maps, new);  in maps__copy_from()
543 struct map *maps__find(struct maps *maps, u64 ip)  in maps__find()  argument
549 	down_read(maps__lock(maps));  in maps__find()
551 	p = maps__entries(maps)->rb_node;  in maps__find()
564 	up_read(maps__lock(maps));  in maps__find()
578 		 * Ensure distinct but name equal maps have an order in part to  in map__strcmp()
596 void __maps__sort_by_name(struct maps *maps)  in __maps__sort_by_name()  argument
598 	qsort(maps__maps_by_name(maps), maps__nr_maps(maps), sizeof(struct map *), map__strcmp);  in __maps__sort_by_name()
601 static int map__groups__sort_by_name_from_rbtree(struct maps *maps)  in map__groups__sort_by_name_from_rbtree()  argument
604 	struct map **maps_by_name = realloc(maps__maps_by_name(maps),  in map__groups__sort_by_name_from_rbtree()
605 					    maps__nr_maps(maps) * sizeof(struct map *));  in map__groups__sort_by_name_from_rbtree()
611 	up_read(maps__lock(maps));  in map__groups__sort_by_name_from_rbtree()
612 	down_write(maps__lock(maps));  in map__groups__sort_by_name_from_rbtree()
614 	RC_CHK_ACCESS(maps)->maps_by_name = maps_by_name;  in map__groups__sort_by_name_from_rbtree()
615 	RC_CHK_ACCESS(maps)->nr_maps_allocated = maps__nr_maps(maps);  in map__groups__sort_by_name_from_rbtree()
617 	maps__for_each_entry(maps, rb_node)  in map__groups__sort_by_name_from_rbtree()
620 	__maps__sort_by_name(maps);  in map__groups__sort_by_name_from_rbtree()
622 	up_write(maps__lock(maps));  in map__groups__sort_by_name_from_rbtree()
623 	down_read(maps__lock(maps));  in map__groups__sort_by_name_from_rbtree()
628 static struct map *__maps__find_by_name(struct maps *maps, const char *name)  in __maps__find_by_name()  argument
632 	if (maps__maps_by_name(maps) == NULL &&  in __maps__find_by_name()
633 	    map__groups__sort_by_name_from_rbtree(maps))  in __maps__find_by_name()
636 	mapp = bsearch(name, maps__maps_by_name(maps), maps__nr_maps(maps),  in __maps__find_by_name()
643 struct map *maps__find_by_name(struct maps *maps, const char *name)  in maps__find_by_name()  argument
648 	down_read(maps__lock(maps));  in maps__find_by_name()
651 	if (RC_CHK_ACCESS(maps)->last_search_by_name) {  in maps__find_by_name()
652 		const struct dso *dso = map__dso(RC_CHK_ACCESS(maps)->last_search_by_name);  in maps__find_by_name()
655 			map = RC_CHK_ACCESS(maps)->last_search_by_name;  in maps__find_by_name()
660 	 * If we have maps->maps_by_name, then the name isn't in the rbtree,  in maps__find_by_name()
661 	 * as maps->maps_by_name mirrors the rbtree when lookups by name are  in maps__find_by_name()
664 	map = __maps__find_by_name(maps, name);  in maps__find_by_name()
665 	if (map || maps__maps_by_name(maps) != NULL)  in maps__find_by_name()
669 	maps__for_each_entry(maps, rb_node) {  in maps__find_by_name()
675 			RC_CHK_ACCESS(maps)->last_search_by_name = map;  in maps__find_by_name()
682 	up_read(maps__lock(maps));  in maps__find_by_name()
686 struct map *maps__find_next_entry(struct maps *maps, struct map *map)  in maps__find_next_entry()  argument
688 	struct map_rb_node *rb_node = maps__find_node(maps, map);  in maps__find_next_entry()
697 void maps__fixup_end(struct maps *maps)  in maps__fixup_end()  argument
701 	down_write(maps__lock(maps));  in maps__fixup_end()
703 	maps__for_each_entry(maps, curr) {  in maps__fixup_end()
717 	up_write(maps__lock(maps));  in maps__fixup_end()
721  * Merges map into maps by splitting the new map within the existing map
724 int maps__merge_in(struct maps *kmaps, struct map *new_map)  in maps__merge_in()
828 void maps__load_first(struct maps *maps)  in maps__load_first()  argument
832 	down_read(maps__lock(maps));  in maps__load_first()
834 	first = maps__first(maps);  in maps__load_first()
838 	up_read(maps__lock(maps));  in maps__load_first()