2014-04-25 11:28:13 +08:00
|
|
|
#include "perf.h"
|
|
|
|
#include "util/debug.h"
|
|
|
|
#include "util/symbol.h"
|
|
|
|
#include "util/sort.h"
|
|
|
|
#include "util/evsel.h"
|
|
|
|
#include "util/evlist.h"
|
|
|
|
#include "util/machine.h"
|
|
|
|
#include "util/thread.h"
|
|
|
|
#include "tests/hists_common.h"
|
|
|
|
|
|
|
|
static struct {
|
|
|
|
u32 pid;
|
|
|
|
const char *comm;
|
|
|
|
} fake_threads[] = {
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_PID_PERF1, "perf" },
|
|
|
|
{ FAKE_PID_PERF2, "perf" },
|
|
|
|
{ FAKE_PID_BASH, "bash" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct {
|
|
|
|
u32 pid;
|
|
|
|
u64 start;
|
|
|
|
const char *filename;
|
|
|
|
} fake_mmap_info[] = {
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_PID_PERF1, FAKE_MAP_PERF, "perf" },
|
|
|
|
{ FAKE_PID_PERF1, FAKE_MAP_LIBC, "libc" },
|
|
|
|
{ FAKE_PID_PERF1, FAKE_MAP_KERNEL, "[kernel]" },
|
|
|
|
{ FAKE_PID_PERF2, FAKE_MAP_PERF, "perf" },
|
|
|
|
{ FAKE_PID_PERF2, FAKE_MAP_LIBC, "libc" },
|
|
|
|
{ FAKE_PID_PERF2, FAKE_MAP_KERNEL, "[kernel]" },
|
|
|
|
{ FAKE_PID_BASH, FAKE_MAP_BASH, "bash" },
|
|
|
|
{ FAKE_PID_BASH, FAKE_MAP_LIBC, "libc" },
|
|
|
|
{ FAKE_PID_BASH, FAKE_MAP_KERNEL, "[kernel]" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
struct fake_sym {
|
|
|
|
u64 start;
|
|
|
|
u64 length;
|
|
|
|
const char *name;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct fake_sym perf_syms[] = {
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_SYM_OFFSET1, FAKE_SYM_LENGTH, "main" },
|
|
|
|
{ FAKE_SYM_OFFSET2, FAKE_SYM_LENGTH, "run_command" },
|
|
|
|
{ FAKE_SYM_OFFSET3, FAKE_SYM_LENGTH, "cmd_record" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct fake_sym bash_syms[] = {
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_SYM_OFFSET1, FAKE_SYM_LENGTH, "main" },
|
|
|
|
{ FAKE_SYM_OFFSET2, FAKE_SYM_LENGTH, "xmalloc" },
|
|
|
|
{ FAKE_SYM_OFFSET3, FAKE_SYM_LENGTH, "xfree" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct fake_sym libc_syms[] = {
|
|
|
|
{ 700, 100, "malloc" },
|
|
|
|
{ 800, 100, "free" },
|
|
|
|
{ 900, 100, "realloc" },
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_SYM_OFFSET1, FAKE_SYM_LENGTH, "malloc" },
|
|
|
|
{ FAKE_SYM_OFFSET2, FAKE_SYM_LENGTH, "free" },
|
|
|
|
{ FAKE_SYM_OFFSET3, FAKE_SYM_LENGTH, "realloc" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct fake_sym kernel_syms[] = {
|
2014-05-23 13:59:57 +08:00
|
|
|
{ FAKE_SYM_OFFSET1, FAKE_SYM_LENGTH, "schedule" },
|
|
|
|
{ FAKE_SYM_OFFSET2, FAKE_SYM_LENGTH, "page_fault" },
|
|
|
|
{ FAKE_SYM_OFFSET3, FAKE_SYM_LENGTH, "sys_perf_event_open" },
|
2014-04-25 11:28:13 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct {
|
|
|
|
const char *dso_name;
|
|
|
|
struct fake_sym *syms;
|
|
|
|
size_t nr_syms;
|
|
|
|
} fake_symbols[] = {
|
|
|
|
{ "perf", perf_syms, ARRAY_SIZE(perf_syms) },
|
|
|
|
{ "bash", bash_syms, ARRAY_SIZE(bash_syms) },
|
|
|
|
{ "libc", libc_syms, ARRAY_SIZE(libc_syms) },
|
|
|
|
{ "[kernel]", kernel_syms, ARRAY_SIZE(kernel_syms) },
|
|
|
|
};
|
|
|
|
|
|
|
|
struct machine *setup_fake_machine(struct machines *machines)
|
|
|
|
{
|
|
|
|
struct machine *machine = machines__find(machines, HOST_KERNEL_ID);
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
if (machine == NULL) {
|
|
|
|
pr_debug("Not enough memory for machine setup\n");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(fake_threads); i++) {
|
|
|
|
struct thread *thread;
|
|
|
|
|
|
|
|
thread = machine__findnew_thread(machine, fake_threads[i].pid,
|
|
|
|
fake_threads[i].pid);
|
|
|
|
if (thread == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
thread__set_comm(thread, fake_threads[i].comm, 0);
|
perf machine: Protect the machine->threads with a rwlock
In addition to using refcounts for the struct thread lifetime
management, we need to protect access to machine->threads from
concurrent access.
That happens in 'perf top', where a thread processes events, inserting
and deleting entries from that rb_tree while another thread decays
hist_entries, that end up dropping references and ultimately deleting
threads from the rb_tree and releasing its resources when no further
hist_entry (or other data structures, like in 'perf sched') references
it.
So the rule is the same for refcounts + protected trees in the kernel,
get the tree lock, find object, bump the refcount, drop the tree lock,
return, use object, drop the refcount if no more use of it is needed,
keep it if storing it in some other data structure, drop when releasing
that data structure.
I.e. pair "t = machine__find(new)_thread()" with a "thread__put(t)", and
"perf_event__preprocess_sample(&al)" with "addr_location__put(&al)".
The addr_location__put() one is because as we return references to
several data structures, we may end up adding more reference counting
for the other data structures and then we'll drop it at
addr_location__put() time.
Acked-by: David Ahern <dsahern@gmail.com>
Cc: Adrian Hunter <adrian.hunter@intel.com>
Cc: Borislav Petkov <bp@suse.de>
Cc: Don Zickus <dzickus@redhat.com>
Cc: Frederic Weisbecker <fweisbec@gmail.com>
Cc: Jiri Olsa <jolsa@redhat.com>
Cc: Namhyung Kim <namhyung@kernel.org>
Cc: Stephane Eranian <eranian@google.com>
Link: http://lkml.kernel.org/n/tip-bs9rt4n0jw3hi9f3zxyy3xln@git.kernel.org
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
2015-04-07 07:43:22 +08:00
|
|
|
thread__put(thread);
|
2014-04-25 11:28:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(fake_mmap_info); i++) {
|
2016-03-23 05:23:43 +08:00
|
|
|
struct perf_sample sample = {
|
|
|
|
.cpumode = PERF_RECORD_MISC_USER,
|
|
|
|
};
|
2014-04-25 11:28:13 +08:00
|
|
|
union perf_event fake_mmap_event = {
|
|
|
|
.mmap = {
|
|
|
|
.pid = fake_mmap_info[i].pid,
|
|
|
|
.tid = fake_mmap_info[i].pid,
|
|
|
|
.start = fake_mmap_info[i].start,
|
2014-05-23 13:59:57 +08:00
|
|
|
.len = FAKE_MAP_LENGTH,
|
2014-04-25 11:28:13 +08:00
|
|
|
.pgoff = 0ULL,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
strcpy(fake_mmap_event.mmap.filename,
|
|
|
|
fake_mmap_info[i].filename);
|
|
|
|
|
2016-03-23 05:23:43 +08:00
|
|
|
machine__process_mmap_event(machine, &fake_mmap_event, &sample);
|
2014-04-25 11:28:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(fake_symbols); i++) {
|
|
|
|
size_t k;
|
|
|
|
struct dso *dso;
|
|
|
|
|
2015-05-29 22:31:12 +08:00
|
|
|
dso = machine__findnew_dso(machine, fake_symbols[i].dso_name);
|
2014-04-25 11:28:13 +08:00
|
|
|
if (dso == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* emulate dso__load() */
|
|
|
|
dso__set_loaded(dso, MAP__FUNCTION);
|
|
|
|
|
|
|
|
for (k = 0; k < fake_symbols[i].nr_syms; k++) {
|
|
|
|
struct symbol *sym;
|
|
|
|
struct fake_sym *fsym = &fake_symbols[i].syms[k];
|
|
|
|
|
|
|
|
sym = symbol__new(fsym->start, fsym->length,
|
|
|
|
STB_GLOBAL, fsym->name);
|
2015-06-02 22:53:26 +08:00
|
|
|
if (sym == NULL) {
|
|
|
|
dso__put(dso);
|
2014-04-25 11:28:13 +08:00
|
|
|
goto out;
|
2015-06-02 22:53:26 +08:00
|
|
|
}
|
2014-04-25 11:28:13 +08:00
|
|
|
|
|
|
|
symbols__insert(&dso->symbols[MAP__FUNCTION], sym);
|
|
|
|
}
|
2015-06-02 22:53:26 +08:00
|
|
|
|
|
|
|
dso__put(dso);
|
2014-04-25 11:28:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return machine;
|
|
|
|
|
|
|
|
out:
|
|
|
|
pr_debug("Not enough memory for machine setup\n");
|
|
|
|
machine__delete_threads(machine);
|
|
|
|
return NULL;
|
|
|
|
}
|
2014-05-12 09:06:18 +08:00
|
|
|
|
|
|
|
void print_hists_in(struct hists *hists)
|
|
|
|
{
|
|
|
|
int i = 0;
|
|
|
|
struct rb_root *root;
|
|
|
|
struct rb_node *node;
|
|
|
|
|
2016-05-03 19:54:42 +08:00
|
|
|
if (hists__has(hists, need_collapse))
|
2014-05-12 09:06:18 +08:00
|
|
|
root = &hists->entries_collapsed;
|
|
|
|
else
|
|
|
|
root = hists->entries_in;
|
|
|
|
|
|
|
|
pr_info("----- %s --------\n", __func__);
|
|
|
|
node = rb_first(root);
|
|
|
|
while (node) {
|
|
|
|
struct hist_entry *he;
|
|
|
|
|
|
|
|
he = rb_entry(node, struct hist_entry, rb_node_in);
|
|
|
|
|
|
|
|
if (!he->filtered) {
|
|
|
|
pr_info("%2d: entry: %-8s [%-8s] %20s: period = %"PRIu64"\n",
|
|
|
|
i, thread__comm_str(he->thread),
|
|
|
|
he->ms.map->dso->short_name,
|
|
|
|
he->ms.sym->name, he->stat.period);
|
|
|
|
}
|
|
|
|
|
|
|
|
i++;
|
|
|
|
node = rb_next(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_hists_out(struct hists *hists)
|
|
|
|
{
|
|
|
|
int i = 0;
|
|
|
|
struct rb_root *root;
|
|
|
|
struct rb_node *node;
|
|
|
|
|
|
|
|
root = &hists->entries;
|
|
|
|
|
|
|
|
pr_info("----- %s --------\n", __func__);
|
|
|
|
node = rb_first(root);
|
|
|
|
while (node) {
|
|
|
|
struct hist_entry *he;
|
|
|
|
|
|
|
|
he = rb_entry(node, struct hist_entry, rb_node);
|
|
|
|
|
|
|
|
if (!he->filtered) {
|
2014-05-23 17:04:42 +08:00
|
|
|
pr_info("%2d: entry: %8s:%5d [%-8s] %20s: period = %"PRIu64"/%"PRIu64"\n",
|
2014-05-12 13:43:18 +08:00
|
|
|
i, thread__comm_str(he->thread), he->thread->tid,
|
2014-05-12 09:06:18 +08:00
|
|
|
he->ms.map->dso->short_name,
|
2014-05-23 17:04:42 +08:00
|
|
|
he->ms.sym->name, he->stat.period,
|
|
|
|
he->stat_acc ? he->stat_acc->period : 0);
|
2014-05-12 09:06:18 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
i++;
|
|
|
|
node = rb_next(node);
|
|
|
|
}
|
|
|
|
}
|