79b6bb73f8
And pick the shortest name: 'struct maps'. The split existed because we used to have two groups of maps, one for functions and one for variables, but that only complicated things, sometimes we needed to figure out what was at some address and then had to first try it on the functions group and if that failed, fall back to the variables one. That split is long gone, so for quite a while we had only one struct maps per struct map_groups, simplify things by combining those structs. First patch is the minimum needed to merge both, follow up patches will rename 'thread->mg' to 'thread->maps', etc. Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Andi Kleen <ak@linux.intel.com> Cc: Jiri Olsa <jolsa@kernel.org> Cc: Namhyung Kim <namhyung@kernel.org> Link: https://lkml.kernel.org/n/tip-hom6639ro7020o708trhxh59@git.kernel.org Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
88 lines
2.3 KiB
C
88 lines
2.3 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __PERF_MAP_GROUPS_H
|
|
#define __PERF_MAP_GROUPS_H
|
|
|
|
#include <linux/refcount.h>
|
|
#include <linux/rbtree.h>
|
|
#include <stdio.h>
|
|
#include <stdbool.h>
|
|
#include <linux/types.h>
|
|
#include "rwsem.h"
|
|
|
|
struct ref_reloc_sym;
|
|
struct machine;
|
|
struct map;
|
|
struct maps;
|
|
struct thread;
|
|
|
|
struct map *maps__find(struct maps *maps, u64 addr);
|
|
struct map *maps__first(struct maps *maps);
|
|
struct map *map__next(struct map *map);
|
|
|
|
#define maps__for_each_entry(maps, map) \
|
|
for (map = maps__first(maps); map; map = map__next(map))
|
|
|
|
#define maps__for_each_entry_safe(maps, map, next) \
|
|
for (map = maps__first(maps), next = map__next(map); map; map = next, next = map__next(map))
|
|
|
|
struct maps {
|
|
struct rb_root entries;
|
|
struct rw_semaphore lock;
|
|
struct machine *machine;
|
|
struct map *last_search_by_name;
|
|
struct map **maps_by_name;
|
|
refcount_t refcnt;
|
|
unsigned int nr_maps;
|
|
unsigned int nr_maps_allocated;
|
|
#ifdef HAVE_LIBUNWIND_SUPPORT
|
|
void *addr_space;
|
|
struct unwind_libunwind_ops *unwind_libunwind_ops;
|
|
#endif
|
|
};
|
|
|
|
#define KMAP_NAME_LEN 256
|
|
|
|
struct kmap {
|
|
struct ref_reloc_sym *ref_reloc_sym;
|
|
struct maps *kmaps;
|
|
char name[KMAP_NAME_LEN];
|
|
};
|
|
|
|
struct maps *maps__new(struct machine *machine);
|
|
void maps__delete(struct maps *mg);
|
|
bool maps__empty(struct maps *mg);
|
|
|
|
static inline struct maps *maps__get(struct maps *mg)
|
|
{
|
|
if (mg)
|
|
refcount_inc(&mg->refcnt);
|
|
return mg;
|
|
}
|
|
|
|
void maps__put(struct maps *mg);
|
|
void maps__init(struct maps *mg, struct machine *machine);
|
|
void maps__exit(struct maps *mg);
|
|
int maps__clone(struct thread *thread, struct maps *parent);
|
|
size_t maps__fprintf(struct maps *mg, FILE *fp);
|
|
|
|
void maps__insert(struct maps *mg, struct map *map);
|
|
|
|
void maps__remove(struct maps *mg, struct map *map);
|
|
|
|
struct symbol *maps__find_symbol(struct maps *mg, u64 addr, struct map **mapp);
|
|
struct symbol *maps__find_symbol_by_name(struct maps *mg, const char *name, struct map **mapp);
|
|
|
|
struct addr_map_symbol;
|
|
|
|
int maps__find_ams(struct maps *mg, struct addr_map_symbol *ams);
|
|
|
|
int maps__fixup_overlappings(struct maps *mg, struct map *map, FILE *fp);
|
|
|
|
struct map *maps__find_by_name(struct maps *mg, const char *name);
|
|
|
|
int maps__merge_in(struct maps *kmaps, struct map *new_map);
|
|
|
|
void __maps__sort_by_name(struct maps *mg);
|
|
|
|
#endif // __PERF_MAP_GROUPS_H
|