mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-29 13:53:33 +00:00
8f12692b7e
Add reference count checking to make sure of good use of get and put. Add and use accessors to reduce RC_CHK clutter. The only significant issue was in tests/thread-maps-share.c where reference counts were released in the reverse order to acquisition, leading to a use after put. This was fixed by reversing the put order. Committer notes: Extracted from a larger patch removing bits that were covered by the use of pre-existing maps__ accessors (e.g. maps__nr_maps()) and new ones added (maps__refcnt()) to reduce RC_CHK_ACCESS(maps)-> source code pollution. Signed-off-by: Ian Rogers <irogers@google.com> Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Alexey Bayduraev <alexey.v.bayduraev@linux.intel.com> Cc: Dmitriy Vyukov <dvyukov@google.com> Cc: Jiri Olsa <jolsa@kernel.org> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Riccardo Mancini <rickyman7@gmail.com> Cc: Stephane Eranian <eranian@google.com> Cc: Stephen Brennan <stephen.s.brennan@oracle.com> Link: https://lore.kernel.org/lkml/20230407230405.2931830-5-irogers@google.com Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
129 lines
3.3 KiB
C
129 lines
3.3 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __PERF_MAPS_H
|
|
#define __PERF_MAPS_H
|
|
|
|
#include <linux/refcount.h>
|
|
#include <linux/rbtree.h>
|
|
#include <stdio.h>
|
|
#include <stdbool.h>
|
|
#include <linux/types.h>
|
|
#include "rwsem.h"
|
|
#include <internal/rc_check.h>
|
|
|
|
struct ref_reloc_sym;
|
|
struct machine;
|
|
struct map;
|
|
struct maps;
|
|
struct thread;
|
|
|
|
struct map_rb_node {
|
|
struct rb_node rb_node;
|
|
struct map *map;
|
|
};
|
|
|
|
struct map_rb_node *maps__first(struct maps *maps);
|
|
struct map_rb_node *map_rb_node__next(struct map_rb_node *node);
|
|
struct map_rb_node *maps__find_node(struct maps *maps, struct map *map);
|
|
struct map *maps__find(struct maps *maps, u64 addr);
|
|
|
|
#define maps__for_each_entry(maps, map) \
|
|
for (map = maps__first(maps); map; map = map_rb_node__next(map))
|
|
|
|
#define maps__for_each_entry_safe(maps, map, next) \
|
|
for (map = maps__first(maps), next = map_rb_node__next(map); map; \
|
|
map = next, next = map_rb_node__next(map))
|
|
|
|
DECLARE_RC_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;
|
|
const 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 *maps);
|
|
bool maps__empty(struct maps *maps);
|
|
int maps__clone(struct thread *thread, struct maps *parent);
|
|
|
|
struct maps *maps__get(struct maps *maps);
|
|
void maps__put(struct maps *maps);
|
|
|
|
static inline struct rb_root *maps__entries(struct maps *maps)
|
|
{
|
|
return &RC_CHK_ACCESS(maps)->entries;
|
|
}
|
|
|
|
static inline struct machine *maps__machine(struct maps *maps)
|
|
{
|
|
return RC_CHK_ACCESS(maps)->machine;
|
|
}
|
|
|
|
static inline struct rw_semaphore *maps__lock(struct maps *maps)
|
|
{
|
|
return &RC_CHK_ACCESS(maps)->lock;
|
|
}
|
|
|
|
static inline struct map **maps__maps_by_name(struct maps *maps)
|
|
{
|
|
return RC_CHK_ACCESS(maps)->maps_by_name;
|
|
}
|
|
|
|
static inline unsigned int maps__nr_maps(const struct maps *maps)
|
|
{
|
|
return RC_CHK_ACCESS(maps)->nr_maps;
|
|
}
|
|
|
|
static inline refcount_t *maps__refcnt(struct maps *maps)
|
|
{
|
|
return &RC_CHK_ACCESS(maps)->refcnt;
|
|
}
|
|
|
|
#ifdef HAVE_LIBUNWIND_SUPPORT
|
|
static inline void *maps__addr_space(struct maps *maps)
|
|
{
|
|
return RC_CHK_ACCESS(maps)->addr_space;
|
|
}
|
|
|
|
static inline const struct unwind_libunwind_ops *maps__unwind_libunwind_ops(const struct maps *maps)
|
|
{
|
|
return RC_CHK_ACCESS(maps)->unwind_libunwind_ops;
|
|
}
|
|
#endif
|
|
|
|
size_t maps__fprintf(struct maps *maps, FILE *fp);
|
|
|
|
int maps__insert(struct maps *maps, struct map *map);
|
|
void maps__remove(struct maps *maps, struct map *map);
|
|
|
|
struct symbol *maps__find_symbol(struct maps *maps, u64 addr, struct map **mapp);
|
|
struct symbol *maps__find_symbol_by_name(struct maps *maps, const char *name, struct map **mapp);
|
|
|
|
struct addr_map_symbol;
|
|
|
|
int maps__find_ams(struct maps *maps, struct addr_map_symbol *ams);
|
|
|
|
int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp);
|
|
|
|
struct map *maps__find_by_name(struct maps *maps, const char *name);
|
|
|
|
int maps__merge_in(struct maps *kmaps, struct map *new_map);
|
|
|
|
void __maps__sort_by_name(struct maps *maps);
|
|
|
|
#endif // __PERF_MAPS_H
|