Lines Matching refs:maps
8 #include "maps.h"
13 static void maps__init(struct maps *maps, struct machine *machine)
15 refcount_set(maps__refcnt(maps), 1);
16 init_rwsem(maps__lock(maps));
17 RC_CHK_ACCESS(maps)->entries = RB_ROOT;
18 RC_CHK_ACCESS(maps)->machine = machine;
19 RC_CHK_ACCESS(maps)->last_search_by_name = NULL;
20 RC_CHK_ACCESS(maps)->nr_maps = 0;
21 RC_CHK_ACCESS(maps)->maps_by_name = NULL;
24 static void __maps__free_maps_by_name(struct maps *maps)
29 for (unsigned int i = 0; i < maps__nr_maps(maps); i++)
30 map__put(maps__maps_by_name(maps)[i]);
32 zfree(&RC_CHK_ACCESS(maps)->maps_by_name);
33 RC_CHK_ACCESS(maps)->nr_maps_allocated = 0;
36 static int __maps__insert(struct maps *maps, struct map *map)
38 struct rb_node **p = &maps__entries(maps)->rb_node;
60 rb_insert_color(&new_rb_node->rb_node, maps__entries(maps));
64 int maps__insert(struct maps *maps, struct map *map)
69 down_write(maps__lock(maps));
70 err = __maps__insert(maps, map);
74 ++RC_CHK_ACCESS(maps)->nr_maps;
80 kmap->kmaps = maps;
90 if (maps__maps_by_name(maps)) {
91 if (maps__nr_maps(maps) > RC_CHK_ACCESS(maps)->nr_maps_allocated) {
92 int nr_allocate = maps__nr_maps(maps) * 2;
93 struct map **maps_by_name = realloc(maps__maps_by_name(maps),
97 __maps__free_maps_by_name(maps);
102 RC_CHK_ACCESS(maps)->maps_by_name = maps_by_name;
103 RC_CHK_ACCESS(maps)->nr_maps_allocated = nr_allocate;
105 maps__maps_by_name(maps)[maps__nr_maps(maps) - 1] = map__get(map);
106 __maps__sort_by_name(maps);
109 up_write(maps__lock(maps));
113 static void __maps__remove(struct maps *maps, struct map_rb_node *rb_node)
115 rb_erase_init(&rb_node->rb_node, maps__entries(maps));
120 void maps__remove(struct maps *maps, struct map *map)
124 down_write(maps__lock(maps));
125 if (RC_CHK_ACCESS(maps)->last_search_by_name == map)
126 RC_CHK_ACCESS(maps)->last_search_by_name = NULL;
128 rb_node = maps__find_node(maps, map);
130 __maps__remove(maps, rb_node);
131 if (maps__maps_by_name(maps))
132 __maps__free_maps_by_name(maps);
133 --RC_CHK_ACCESS(maps)->nr_maps;
134 up_write(maps__lock(maps));
137 static void __maps__purge(struct maps *maps)
141 if (maps__maps_by_name(maps))
142 __maps__free_maps_by_name(maps);
144 maps__for_each_entry_safe(maps, pos, next) {
145 rb_erase_init(&pos->rb_node, maps__entries(maps));
151 static void maps__exit(struct maps *maps)
153 down_write(maps__lock(maps));
154 __maps__purge(maps);
155 up_write(maps__lock(maps));
158 bool maps__empty(struct maps *maps)
160 return !maps__first(maps);
163 struct maps *maps__new(struct machine *machine)
165 struct maps *result;
166 RC_STRUCT(maps) *maps = zalloc(sizeof(*maps));
168 if (ADD_RC_CHK(result, maps))
174 static void maps__delete(struct maps *maps)
176 maps__exit(maps);
177 unwind__finish_access(maps);
178 RC_CHK_FREE(maps);
181 struct maps *maps__get(struct maps *maps)
183 struct maps *result;
185 if (RC_CHK_GET(result, maps))
186 refcount_inc(maps__refcnt(maps));
191 void maps__put(struct maps *maps)
193 if (maps && refcount_dec_and_test(maps__refcnt(maps)))
194 maps__delete(maps);
196 RC_CHK_PUT(maps);
199 struct symbol *maps__find_symbol(struct maps *maps, u64 addr, struct map **mapp)
201 struct map *map = maps__find(maps, addr);
213 struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name, struct map **mapp)
218 down_read(maps__lock(maps));
220 maps__for_each_entry(maps, pos) {
236 up_read(maps__lock(maps));
240 int maps__find_ams(struct maps *maps, struct addr_map_symbol *ams)
243 if (maps == NULL)
245 ams->ms.map = maps__find(maps, ams->addr);
256 size_t maps__fprintf(struct maps *maps, FILE *fp)
261 down_read(maps__lock(maps));
263 maps__for_each_entry(maps, pos) {
272 up_read(maps__lock(maps));
277 int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
283 down_write(maps__lock(maps));
285 root = maps__entries(maps);
320 pr_debug("overlapping maps in %s (disable tui for more info)\n",
323 fputs("overlapping maps:\n", fp);
331 * Now check if we need to create new maps for areas not
343 err = __maps__insert(maps, before);
366 err = __maps__insert(maps, after);
379 up_write(maps__lock(maps));
384 * XXX This should not really _copy_ te maps, but refcount them.
386 int maps__clone(struct thread *thread, struct maps *parent)
388 struct maps *maps = thread__maps(thread);
402 err = unwind__prepare_access(maps, new, NULL);
406 err = maps__insert(maps, new);
419 struct map_rb_node *maps__find_node(struct maps *maps, struct map *map)
423 maps__for_each_entry(maps, rb_node) {
430 struct map *maps__find(struct maps *maps, u64 ip)
436 down_read(maps__lock(maps));
438 p = maps__entries(maps)->rb_node;
451 up_read(maps__lock(maps));
455 struct map_rb_node *maps__first(struct maps *maps)
457 struct rb_node *first = rb_first(maps__entries(maps));