mirror of
https://github.com/torvalds/linux.git
synced 2024-12-14 15:13:52 +00:00
6d499a6b3d
Like the normal 'perf lock contention' output, it'd print the number of
lost entries for BPF if exists or -v option is passed.
Currently it uses BROKEN_CONTENDED stat for the lost count (due to full
stack maps).
$ sudo perf lock con -a -b --map-nr-entries 128 sleep 5
...
=== output for debug===
bad: 43, total: 14903
bad rate: 0.29 %
histogram of events caused bad sequence
acquire: 0
acquired: 0
contended: 43
release: 0
Signed-off-by: Namhyung Kim <namhyung@kernel.org>
Cc: Blake Jones <blakejones@google.com>
Cc: Boqun Feng <boqun.feng@gmail.com>
Cc: Davidlohr Bueso <dave@stgolabs.net>
Cc: Ian Rogers <irogers@google.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Jiri Olsa <jolsa@kernel.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Song Liu <songliubraving@fb.com>
Cc: Waiman Long <longman@redhat.com>
Cc: Will Deacon <will@kernel.org>
Link: https://lore.kernel.org/r/20220802191004.347740-3-namhyung@kernel.org
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
148 lines
3.4 KiB
C
148 lines
3.4 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
#ifndef PERF_LOCK_CONTENTION_H
|
|
#define PERF_LOCK_CONTENTION_H
|
|
|
|
#include <linux/list.h>
|
|
#include <linux/rbtree.h>
|
|
|
|
struct lock_stat {
|
|
struct hlist_node hash_entry;
|
|
struct rb_node rb; /* used for sorting */
|
|
|
|
u64 addr; /* address of lockdep_map, used as ID */
|
|
char *name; /* for strcpy(), we cannot use const */
|
|
|
|
unsigned int nr_acquire;
|
|
unsigned int nr_acquired;
|
|
unsigned int nr_contended;
|
|
unsigned int nr_release;
|
|
|
|
union {
|
|
unsigned int nr_readlock;
|
|
unsigned int flags;
|
|
};
|
|
unsigned int nr_trylock;
|
|
|
|
/* these times are in nano sec. */
|
|
u64 avg_wait_time;
|
|
u64 wait_time_total;
|
|
u64 wait_time_min;
|
|
u64 wait_time_max;
|
|
|
|
int broken; /* flag of blacklist */
|
|
int combined;
|
|
};
|
|
|
|
/*
|
|
* States of lock_seq_stat
|
|
*
|
|
* UNINITIALIZED is required for detecting first event of acquire.
|
|
* As the nature of lock events, there is no guarantee
|
|
* that the first event for the locks are acquire,
|
|
* it can be acquired, contended or release.
|
|
*/
|
|
#define SEQ_STATE_UNINITIALIZED 0 /* initial state */
|
|
#define SEQ_STATE_RELEASED 1
|
|
#define SEQ_STATE_ACQUIRING 2
|
|
#define SEQ_STATE_ACQUIRED 3
|
|
#define SEQ_STATE_READ_ACQUIRED 4
|
|
#define SEQ_STATE_CONTENDED 5
|
|
|
|
/*
|
|
* MAX_LOCK_DEPTH
|
|
* Imported from include/linux/sched.h.
|
|
* Should this be synchronized?
|
|
*/
|
|
#define MAX_LOCK_DEPTH 48
|
|
|
|
/*
|
|
* struct lock_seq_stat:
|
|
* Place to put on state of one lock sequence
|
|
* 1) acquire -> acquired -> release
|
|
* 2) acquire -> contended -> acquired -> release
|
|
* 3) acquire (with read or try) -> release
|
|
* 4) Are there other patterns?
|
|
*/
|
|
struct lock_seq_stat {
|
|
struct list_head list;
|
|
int state;
|
|
u64 prev_event_time;
|
|
u64 addr;
|
|
|
|
int read_count;
|
|
};
|
|
|
|
struct thread_stat {
|
|
struct rb_node rb;
|
|
|
|
u32 tid;
|
|
struct list_head seq_list;
|
|
};
|
|
|
|
/*
|
|
* CONTENTION_STACK_DEPTH
|
|
* Number of stack trace entries to find callers
|
|
*/
|
|
#define CONTENTION_STACK_DEPTH 8
|
|
|
|
/*
|
|
* CONTENTION_STACK_SKIP
|
|
* Number of stack trace entries to skip when finding callers.
|
|
* The first few entries belong to the locking implementation itself.
|
|
*/
|
|
#define CONTENTION_STACK_SKIP 3
|
|
|
|
/*
|
|
* flags for lock:contention_begin
|
|
* Imported from include/trace/events/lock.h.
|
|
*/
|
|
#define LCB_F_SPIN (1U << 0)
|
|
#define LCB_F_READ (1U << 1)
|
|
#define LCB_F_WRITE (1U << 2)
|
|
#define LCB_F_RT (1U << 3)
|
|
#define LCB_F_PERCPU (1U << 4)
|
|
#define LCB_F_MUTEX (1U << 5)
|
|
|
|
struct evlist;
|
|
struct machine;
|
|
struct target;
|
|
|
|
struct lock_contention {
|
|
struct evlist *evlist;
|
|
struct target *target;
|
|
struct machine *machine;
|
|
struct hlist_head *result;
|
|
unsigned long map_nr_entries;
|
|
unsigned long lost;
|
|
};
|
|
|
|
#ifdef HAVE_BPF_SKEL
|
|
|
|
int lock_contention_prepare(struct lock_contention *con);
|
|
int lock_contention_start(void);
|
|
int lock_contention_stop(void);
|
|
int lock_contention_read(struct lock_contention *con);
|
|
int lock_contention_finish(void);
|
|
|
|
#else /* !HAVE_BPF_SKEL */
|
|
|
|
static inline int lock_contention_prepare(struct lock_contention *con __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static inline int lock_contention_start(void) { return 0; }
|
|
static inline int lock_contention_stop(void) { return 0; }
|
|
static inline int lock_contention_finish(void) { return 0; }
|
|
|
|
static inline int lock_contention_read(struct lock_contention *con __maybe_unused)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
#endif /* HAVE_BPF_SKEL */
|
|
|
|
bool is_lock_function(struct machine *machine, u64 addr);
|
|
|
|
#endif /* PERF_LOCK_CONTENTION_H */
|