| #include "../perf.h" |
| #include <stdlib.h> |
| #include <stdio.h> |
| #include <string.h> |
| #include "session.h" |
| #include "thread.h" |
| #include "thread-stack.h" |
| #include "util.h" |
| #include "debug.h" |
| #include "comm.h" |
| #include "unwind.h" |
| |
| #include <api/fs/fs.h> |
| |
| int thread__init_map_groups(struct thread *thread, struct machine *machine) |
| { |
| pid_t pid = thread->pid_; |
| |
| if (pid == thread->tid || pid == -1) { |
| thread->mg = map_groups__new(machine); |
| } else { |
| struct thread *leader = __machine__findnew_thread(machine, pid, pid); |
| if (leader) { |
| thread->mg = map_groups__get(leader->mg); |
| thread__put(leader); |
| } |
| } |
| |
| return thread->mg ? 0 : -1; |
| } |
| |
| struct thread *thread__new(pid_t pid, pid_t tid) |
| { |
| char *comm_str; |
| struct comm *comm; |
| struct thread *thread = zalloc(sizeof(*thread)); |
| |
| if (thread != NULL) { |
| thread->pid_ = pid; |
| thread->tid = tid; |
| thread->ppid = -1; |
| thread->cpu = -1; |
| INIT_LIST_HEAD(&thread->comm_list); |
| |
| comm_str = malloc(32); |
| if (!comm_str) |
| goto err_thread; |
| |
| snprintf(comm_str, 32, ":%d", tid); |
| comm = comm__new(comm_str, 0, false); |
| free(comm_str); |
| if (!comm) |
| goto err_thread; |
| |
| list_add(&comm->list, &thread->comm_list); |
| atomic_set(&thread->refcnt, 1); |
| RB_CLEAR_NODE(&thread->rb_node); |
| } |
| |
| return thread; |
| |
| err_thread: |
| free(thread); |
| return NULL; |
| } |
| |
| void thread__delete(struct thread *thread) |
| { |
| struct comm *comm, *tmp; |
| |
| BUG_ON(!RB_EMPTY_NODE(&thread->rb_node)); |
| |
| thread_stack__free(thread); |
| |
| if (thread->mg) { |
| map_groups__put(thread->mg); |
| thread->mg = NULL; |
| } |
| list_for_each_entry_safe(comm, tmp, &thread->comm_list, list) { |
| list_del(&comm->list); |
| comm__free(comm); |
| } |
| unwind__finish_access(thread); |
| |
| free(thread); |
| } |
| |
| struct thread *thread__get(struct thread *thread) |
| { |
| if (thread) |
| atomic_inc(&thread->refcnt); |
| return thread; |
| } |
| |
| void thread__put(struct thread *thread) |
| { |
| if (thread && atomic_dec_and_test(&thread->refcnt)) { |
| /* |
| * Remove it from the dead_threads list, as last reference |
| * is gone. |
| */ |
| list_del_init(&thread->node); |
| thread__delete(thread); |
| } |
| } |
| |
| struct comm *thread__comm(const struct thread *thread) |
| { |
| if (list_empty(&thread->comm_list)) |
| return NULL; |
| |
| return list_first_entry(&thread->comm_list, struct comm, list); |
| } |
| |
| struct comm *thread__exec_comm(const struct thread *thread) |
| { |
| struct comm *comm, *last = NULL, *second_last = NULL; |
| |
| list_for_each_entry(comm, &thread->comm_list, list) { |
| if (comm->exec) |
| return comm; |
| second_last = last; |
| last = comm; |
| } |
| |
| /* |
| * 'last' with no start time might be the parent's comm of a synthesized |
| * thread (created by processing a synthesized fork event). For a main |
| * thread, that is very probably wrong. Prefer a later comm to avoid |
| * that case. |
| */ |
| if (second_last && !last->start && thread->pid_ == thread->tid) |
| return second_last; |
| |
| return last; |
| } |
| |
| int __thread__set_comm(struct thread *thread, const char *str, u64 timestamp, |
| bool exec) |
| { |
| struct comm *new, *curr = thread__comm(thread); |
| |
| /* Override the default :tid entry */ |
| if (!thread->comm_set) { |
| int err = comm__override(curr, str, timestamp, exec); |
| if (err) |
| return err; |
| } else { |
| new = comm__new(str, timestamp, exec); |
| if (!new) |
| return -ENOMEM; |
| list_add(&new->list, &thread->comm_list); |
| |
| if (exec) |
| unwind__flush_access(thread); |
| } |
| |
| thread->comm_set = true; |
| |
| return 0; |
| } |
| |
| int thread__set_comm_from_proc(struct thread *thread) |
| { |
| char path[64]; |
| char *comm = NULL; |
| size_t sz; |
| int err = -1; |
| |
| if (!(snprintf(path, sizeof(path), "%d/task/%d/comm", |
| thread->pid_, thread->tid) >= (int)sizeof(path)) && |
| procfs__read_str(path, &comm, &sz) == 0) { |
| comm[sz - 1] = '\0'; |
| err = thread__set_comm(thread, comm, 0); |
| } |
| |
| return err; |
| } |
| |
| const char *thread__comm_str(const struct thread *thread) |
| { |
| const struct comm *comm = thread__comm(thread); |
| |
| if (!comm) |
| return NULL; |
| |
| return comm__str(comm); |
| } |
| |
| /* CHECKME: it should probably better return the max comm len from its comm list */ |
| int thread__comm_len(struct thread *thread) |
| { |
| if (!thread->comm_len) { |
| const char *comm = thread__comm_str(thread); |
| if (!comm) |
| return 0; |
| thread->comm_len = strlen(comm); |
| } |
| |
| return thread->comm_len; |
| } |
| |
| size_t thread__fprintf(struct thread *thread, FILE *fp) |
| { |
| return fprintf(fp, "Thread %d %s\n", thread->tid, thread__comm_str(thread)) + |
| map_groups__fprintf(thread->mg, fp); |
| } |
| |
| int thread__insert_map(struct thread *thread, struct map *map) |
| { |
| int ret; |
| |
| ret = unwind__prepare_access(thread, map, NULL); |
| if (ret) |
| return ret; |
| |
| map_groups__fixup_overlappings(thread->mg, map, stderr); |
| map_groups__insert(thread->mg, map); |
| |
| return 0; |
| } |
| |
| static int __thread__prepare_access(struct thread *thread) |
| { |
| bool initialized = false; |
| int i, err = 0; |
| |
| for (i = 0; i < MAP__NR_TYPES; ++i) { |
| struct maps *maps = &thread->mg->maps[i]; |
| struct map *map; |
| |
| pthread_rwlock_rdlock(&maps->lock); |
| |
| for (map = maps__first(maps); map; map = map__next(map)) { |
| err = unwind__prepare_access(thread, map, &initialized); |
| if (err || initialized) |
| break; |
| } |
| |
| pthread_rwlock_unlock(&maps->lock); |
| } |
| |
| return err; |
| } |
| |
| static int thread__prepare_access(struct thread *thread) |
| { |
| int err = 0; |
| |
| if (symbol_conf.use_callchain) |
| err = __thread__prepare_access(thread); |
| |
| return err; |
| } |
| |
| static int thread__clone_map_groups(struct thread *thread, |
| struct thread *parent) |
| { |
| int i; |
| |
| /* This is new thread, we share map groups for process. */ |
| if (thread->pid_ == parent->pid_) |
| return thread__prepare_access(thread); |
| |
| if (thread->mg == parent->mg) { |
| pr_debug("broken map groups on thread %d/%d parent %d/%d\n", |
| thread->pid_, thread->tid, parent->pid_, parent->tid); |
| return 0; |
| } |
| |
| /* But this one is new process, copy maps. */ |
| for (i = 0; i < MAP__NR_TYPES; ++i) |
| if (map_groups__clone(thread, parent->mg, i) < 0) |
| return -ENOMEM; |
| |
| return 0; |
| } |
| |
| int thread__fork(struct thread *thread, struct thread *parent, u64 timestamp) |
| { |
| if (parent->comm_set) { |
| const char *comm = thread__comm_str(parent); |
| int err; |
| if (!comm) |
| return -ENOMEM; |
| err = thread__set_comm(thread, comm, timestamp); |
| if (err) |
| return err; |
| } |
| |
| thread->ppid = parent->tid; |
| return thread__clone_map_groups(thread, parent); |
| } |
| |
| void thread__find_cpumode_addr_location(struct thread *thread, |
| enum map_type type, u64 addr, |
| struct addr_location *al) |
| { |
| size_t i; |
| const u8 cpumodes[] = { |
| PERF_RECORD_MISC_USER, |
| PERF_RECORD_MISC_KERNEL, |
| PERF_RECORD_MISC_GUEST_USER, |
| PERF_RECORD_MISC_GUEST_KERNEL |
| }; |
| |
| for (i = 0; i < ARRAY_SIZE(cpumodes); i++) { |
| thread__find_addr_location(thread, cpumodes[i], type, addr, al); |
| if (al->map) |
| break; |
| } |
| } |
| |
| struct thread *thread__main_thread(struct machine *machine, struct thread *thread) |
| { |
| if (thread->pid_ == thread->tid) |
| return thread__get(thread); |
| |
| if (thread->pid_ == -1) |
| return NULL; |
| |
| return machine__find_thread(machine, thread->pid_, thread->pid_); |
| } |