From 22098763a10d9c1340827fcf6edab66f153b27f0 Mon Sep 17 00:00:00 2001 From: Linus Torvalds Date: Sun, 13 Sep 2026 12:27:00 -0700 Subject: Merge tag 'trace-v7.3-rc2' of git://git.kernel.org/pub/scm/linux/kernel/git/trace/linux-trace Pull tracing fixes from Steven Rostedt: - Don't destroy user event fields when removal fails User event fields are destroyed before the event is removed from visibility. But that can fail leaving the still visible event with no fields. Move the destroying of the fields to after the event is successfully removed from visibility. - Initialize function graph state is fork before calling copy_exec_state() For non-CLONE_VM forks, copy_exec_state() allocates a new task_exec_state. If that allocation fails, ftrace_graph_exit_task() will free the tasks ret_stack pointer. Since that pointer is still using the parent's ret_stack, it mistakenly frees the parent's pointer too. Call ftrace_graph_init() on the task first which will NULL out the new tasks's ret_stack and if the copy fails, it will not free anything. - Remove FGRAPH_MAX_INDEX The macro FGRAPH_MAX_INDEX was added but never used. Remove it. - Save ent_size in function graph printing of nested functions The function graph tracer needs to look at the next event to see if the next event is the return of the current function entry. If it is, it prints a single line: ktime_get(); Otherwise it prints it like a nested function: tick_nohz_irq_exit() { ktime_get(); kcpustat_irq_exit(); } In order to look at the next event, it must save the current event so that it has the information to print from it. It saves the event in the iterator descriptor called "ent". What it doesn't save is the ent_size of the event which is now used to know if the function graph arguments are to be printed. The peek doesn't save the size so the size used happens to be that of the size of the last event that was seen. Save the entry event size in the iterator descriptor so that the correct size is used. - Fix several errors with freeing data in the histogram code The histogram code had a lot of leaked or or incorrect accounting when failures happen. Correct them. - Fix histogram regression of .percent and .graph modifiers Up until 6.3 histogram values could have "percent" or "graph" modifiers that changed how they were printed. But a change that added restricting histograms values from being strings, stack traces and other modifiers inadvertently prevented them from using the percent and graph modifiers, which were legal use cases for values. Put back the percent and graph modifiers. - Fix various typos in the comments - Set the trace_clock before initializing a histogram with clock argument The histogram API allows the user to specific which trace clock to use via a "clock=" string. The histogram is set up first before the clock is checked. If the passed in clock is not valid, it exits without fully fixing up the histogram leaving it on the list and a use-after-free can trigger. Update the clock argument first and if it fails then exit gracefully before the histogram trigger is placed on any lists. - Restore :mod: trailer after parsing in ftrace_set_clr_event The function ftrace_set_clr_event() modifies the parse string and needs to put it back to what was passed in. It searches for ":mod:" via a strsep() but fails to put back the first ':' in the string. Add back the ':' in the passed in string. - Take trace_array reference when opening a tracer options file The options files are dynamically created and some tracers add their own options. When a tracer adds their own list of options, the trace_array holding them has an array to hold the list of options for each tracer. This array increases in size via a krealloc(), and the new entry gets a newly allocated array to hold the options of the new tracer being added. The element in each entry of the tracer's option array holds a pointer back to the trace_array, a pointer to the tracer it is associated to, a pointer to the flags of the option. The issue is that these arrays are freed when the trace_array is freed when its instance it represents is removed from the instances directory. There's a race that an open of one of these options files can happen when the instance is being removed. Add a new helper function to be called by the open function of the options file to iterate all existing trace_arrays under a lock and find the one that has the given option element in one of it's tracer arrays. If found, then update the associated trace_array's reference counter to keep it from being freed. If not found, have the open call return -ENODEV. - Disable interrupts when acquiring the lock in rb_wake_up_waiters() The function rb_wake_up_waiters() assumes it will be called in interrupt context and does not disable irqs when taking cpu_buffer->reader_lock, which can be called in hard interrupt context. The issue is in PREEMPT_RT, this function is called in thread context leaving this lock open to a deadlock. Take the lock with interrupts disabled. - Use rcu_assign_pointer() for tmp_ops filter hash The tmp_ops used in update_ftrace_direct_mod() assigns its filter_hash field directly, but that field is annotated as __rcu and sparse complains. Assign it with rcu_assign_pointer() - Fix use-after-free in enable_trigger_private_data_free() The trace_event_call is accessed through the event_trigger_data's trace_event_file pointer to put the trace_event_call on freeing. The issue is that the trace_event_file data may have been freed already causing a use-after-free. Add a field to the event_trigger_data that points directly to the trace_event_call so that it can decrement its reference directly without needing to go through the trace_event_file. - Fix accounting of buffer data remote headers trace_buffer_desc_size() and trace_remote_alloc_buffer() undercount the number of pages is needed for the asked for size as it doesn't take into account the meta data on each page. Add a helper function to do the calculation properly and use that in these functions. - Catch nr_page_va overflow in ring_buffer_desc sizing The number of pages per remote ring buffer is capped by ring_buffer_desc::nr_page_va (32 bits). A buffer_size large enough to overflow that field would silently allocate a descriptor smaller than what was asked for. - Do not resize the subbuf order if any per_cpu buffer is disabled The mmapping of ring buffers disables resizing the subbuffers, but it is done per-cpu whereas the subbuf size change is done for all the per_cpu buffers under the buffer->mutex. It could change the size of some while the mapping is happening on others. Have the resize of the subbuf order check all the per_cpu buffers under the lock to see if any of them is disabled before starting and causing an inconsistency between buffers that are being mapped. * tag 'trace-v7.3-rc2' of git://git.kernel.org/pub/scm/linux/kernel/git/trace/linux-trace: (25 commits) ring-buffer: Check resize_disabled before publishing the new subbuf order tracing/remotes: Catch nr_page_va overflow in ring_buffer_desc sizing tracing/remotes: Account for ring buffer page header in size calculation tracing: Don't dereference trace_event_file in deferred trigger free ftrace: Use rcu_assign_pointer() for tmp_ops filter hash ring-buffer: Acquire the lock with irqsave in rb_wake_up_waiters() tracing: Take trace_array reference when opening a tracer options file tracing: Fix ring_buffer_read_page_size() kernel-doc tracing: Restore :mod: trailer after parsing in ftrace_set_clr_event() tracing: Fix memory corruption from a "STACKTRACE" histogram key tracing: Fix memory corruption from the histogram stacktrace modifier tracing: Undo the registration when enabling the histogram trigger fails tracing: Take the reference before publishing the named histogram trigger tracing: Set the trace clock before registering the histogram trigger tracing: Fix typo "preceeded" in comment tracing: Fix typo "availabe" in comment tracing: Let histogram values keep the percent and graph modifiers tracing: Keep the entry count when the histogram stats allocation fails tracing: Free histogram the field rejected for a bad modifier tracing: Free histogram the var ref when its initialization fails ... --- tools/perf/util/thread.c | 638 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 638 insertions(+) create mode 100644 tools/perf/util/thread.c (limited to 'tools/perf/util/thread.c') diff --git a/tools/perf/util/thread.c b/tools/perf/util/thread.c new file mode 100644 index 000000000..e483ffcb5 --- /dev/null +++ b/tools/perf/util/thread.c @@ -0,0 +1,638 @@ +// SPDX-License-Identifier: GPL-2.0 +#include +#include +#include +#include +#include +#include +#include +#include +#include "dso.h" +#include "session.h" +#include "thread.h" +#include "thread-stack.h" +#include "debug.h" +#include "namespaces.h" +#include "comm.h" +#include "map.h" +#include "symbol.h" +#include "unwind.h" +#include "callchain.h" +#include "dwarf-regs.h" + +#include + +int thread__init_maps(struct thread *thread, struct machine *machine) +{ + pid_t pid = thread__pid(thread); + + if (pid == thread__tid(thread) || pid == -1) { + thread__set_maps(thread, maps__new(machine)); + } else { + struct thread *leader = machine__findnew_thread(machine, pid, pid); + + if (leader) { + thread__set_maps(thread, maps__get(thread__maps(leader))); + thread__put(leader); + } + } + + return thread__maps(thread) ? 0 : -1; +} + +struct thread *thread__new(pid_t pid, pid_t tid) + NO_THREAD_SAFETY_ANALYSIS /* Allocation/creation is inherently single threaded. */ +{ + RC_STRUCT(thread) *_thread = zalloc(sizeof(*_thread)); + struct thread *thread; + + if (ADD_RC_CHK(thread, _thread) != NULL) { + struct comm *comm; + char comm_str[32]; + + thread__set_pid(thread, pid); + thread__set_tid(thread, tid); + thread__set_ppid(thread, -1); + thread__set_cpu(thread, -1); + thread__set_guest_cpu(thread, -1); + thread__set_e_machine(thread, EM_NONE); + thread__set_e_is_big_endian(thread, false); + thread__set_lbr_stitch_enable(thread, false); + INIT_LIST_HEAD(thread__namespaces_list(thread)); + INIT_LIST_HEAD(thread__comm_list(thread)); + init_rwsem(thread__namespaces_lock(thread)); + init_rwsem(thread__comm_lock(thread)); + + snprintf(comm_str, sizeof(comm_str), ":%d", tid); + comm = comm__new(comm_str, 0, false); + if (!comm) + goto err_thread; + + list_add(&comm->list, thread__comm_list(thread)); + refcount_set(thread__refcnt(thread), 1); + /* Thread holds first ref to nsdata. */ + RC_CHK_ACCESS(thread)->nsinfo = nsinfo__new(pid); + srccode_state_init(thread__srccode_state(thread)); + } + + return thread; + +err_thread: + thread__delete(thread); + return NULL; +} + +static void (*thread__priv_destructor)(void *priv); + +void thread__set_priv_destructor(void (*destructor)(void *priv)) +{ + assert(thread__priv_destructor == NULL); + + thread__priv_destructor = destructor; +} + +void thread__delete(struct thread *thread) +{ + struct namespaces *namespaces, *tmp_namespaces; + struct comm *comm, *tmp_comm; + + thread_stack__free(thread); + + if (thread__maps(thread)) { + maps__put(thread__maps(thread)); + thread__set_maps(thread, NULL); + } + down_write(thread__namespaces_lock(thread)); + list_for_each_entry_safe(namespaces, tmp_namespaces, + thread__namespaces_list(thread), list) { + list_del_init(&namespaces->list); + namespaces__free(namespaces); + } + up_write(thread__namespaces_lock(thread)); + + down_write(thread__comm_lock(thread)); + list_for_each_entry_safe(comm, tmp_comm, thread__comm_list(thread), list) { + list_del_init(&comm->list); + comm__free(comm); + } + up_write(thread__comm_lock(thread)); + + nsinfo__zput(RC_CHK_ACCESS(thread)->nsinfo); + srccode_state_free(thread__srccode_state(thread)); + + exit_rwsem(thread__namespaces_lock(thread)); + exit_rwsem(thread__comm_lock(thread)); + thread__free_stitch_list(thread); + + if (thread__priv_destructor) + thread__priv_destructor(thread__priv(thread)); + + RC_CHK_FREE(thread); +} + +struct thread *thread__get(struct thread *thread) +{ + struct thread *result; + + if (RC_CHK_GET(result, thread)) + refcount_inc(thread__refcnt(thread)); + + return result; +} + +void thread__put(struct thread *thread) +{ + if (thread && refcount_dec_and_test(thread__refcnt(thread))) + thread__delete(thread); + else + RC_CHK_PUT(thread); +} + +static struct namespaces *__thread__namespaces(struct thread *thread) +{ + if (list_empty(thread__namespaces_list(thread))) + return NULL; + + return list_first_entry(thread__namespaces_list(thread), struct namespaces, list); +} + +struct namespaces *thread__namespaces(struct thread *thread) +{ + struct namespaces *ns; + + down_read(thread__namespaces_lock(thread)); + ns = __thread__namespaces(thread); + up_read(thread__namespaces_lock(thread)); + + return ns; +} + +static int __thread__set_namespaces(struct thread *thread, u64 timestamp, + struct perf_record_namespaces *event) +{ + struct namespaces *new, *curr = __thread__namespaces(thread); + + new = namespaces__new(event); + if (!new) + return -ENOMEM; + + list_add(&new->list, thread__namespaces_list(thread)); + + if (timestamp && curr) { + /* + * setns syscall must have changed few or all the namespaces + * of this thread. Update end time for the namespaces + * previously used. + */ + curr = list_next_entry(new, list); + curr->end_time = timestamp; + } + + return 0; +} + +int thread__set_namespaces(struct thread *thread, u64 timestamp, + struct perf_record_namespaces *event) +{ + int ret; + + down_write(thread__namespaces_lock(thread)); + ret = __thread__set_namespaces(thread, timestamp, event); + up_write(thread__namespaces_lock(thread)); + return ret; +} + +static struct comm *__thread__comm(struct thread *thread) + SHARED_LOCKS_REQUIRED(thread__comm_lock(thread)) +{ + if (list_empty(thread__comm_list(thread))) + return NULL; + + return list_first_entry(thread__comm_list(thread), struct comm, list); +} + +struct comm *thread__comm(struct thread *thread) +{ + struct comm *res = NULL; + + down_read(thread__comm_lock(thread)); + res = __thread__comm(thread); + up_read(thread__comm_lock(thread)); + return res; +} + +struct comm *thread__exec_comm(struct thread *thread) +{ + struct comm *comm, *last = NULL, *second_last = NULL; + + down_read(thread__comm_lock(thread)); + list_for_each_entry(comm, thread__comm_list(thread), list) { + if (comm->exec) { + up_read(thread__comm_lock(thread)); + return comm; + } + second_last = last; + last = comm; + } + up_read(thread__comm_lock(thread)); + + /* + * '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) == thread__tid(thread)) + return second_last; + + return last; +} + +static int ____thread__set_comm(struct thread *thread, const char *str, + u64 timestamp, bool exec) + EXCLUSIVE_LOCKS_REQUIRED(thread__comm_lock(thread)) +{ + struct comm *new, *curr = __thread__comm(thread); + + /* Override the default :tid entry */ + if (!thread__comm_set(thread)) { + 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(thread)); + + if (exec) + unwind__flush_access(thread__maps(thread)); + } + + thread__set_comm_set(thread, true); + + return 0; +} + +int __thread__set_comm(struct thread *thread, const char *str, u64 timestamp, + bool exec) +{ + int ret; + + down_write(thread__comm_lock(thread)); + ret = ____thread__set_comm(thread, str, timestamp, exec); + up_write(thread__comm_lock(thread)); + return ret; +} + +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), thread__tid(thread)) >= (int)sizeof(path)) && + procfs__read_str(path, &comm, &sz) == 0) { + /* sz==0: read got nothing, e.g. race during exit teardown */ + if (sz == 0) { + free(comm); + return -1; + } + comm[sz - 1] = '\0'; + err = thread__set_comm(thread, comm, 0); + } + + return err; +} + +static const char *__thread__comm_str(struct thread *thread) + SHARED_LOCKS_REQUIRED(thread__comm_lock(thread)) +{ + const struct comm *comm = __thread__comm(thread); + + if (!comm) + return NULL; + + return comm__str(comm); +} + +const char *thread__comm_str(struct thread *thread) +{ + const char *str; + + down_read(thread__comm_lock(thread)); + str = __thread__comm_str(thread); + up_read(thread__comm_lock(thread)); + + return str; +} + +static int __thread__comm_len(struct thread *thread, const char *comm) +{ + if (!comm) + return 0; + thread__set_comm_len(thread, strlen(comm)); + + return thread__var_comm_len(thread); +} + +/* CHECKME: it should probably better return the max comm len from its comm list */ +int thread__comm_len(struct thread *thread) +{ + int comm_len = thread__var_comm_len(thread); + + if (!comm_len) { + const char *comm; + + down_read(thread__comm_lock(thread)); + comm = __thread__comm_str(thread); + comm_len = __thread__comm_len(thread, comm); + up_read(thread__comm_lock(thread)); + } + + return comm_len; +} + +size_t thread__fprintf(struct thread *thread, FILE *fp) +{ + return fprintf(fp, "Thread %d %s\n", thread__tid(thread), thread__comm_str(thread)) + + maps__fprintf(thread__maps(thread), fp); +} + +int thread__insert_map(struct thread *thread, struct map *map) +{ + int ret; + uint16_t e_machine; + + ret = maps__fixup_overlap_and_insert(thread__maps(thread), map); + if (ret) + return ret; + + e_machine = thread__e_machine(thread, /*machine=*/NULL, /*e_flags=*/NULL); + return unwind__prepare_access(thread__maps(thread), e_machine); +} + +static int thread__prepare_access(struct thread *thread) +{ + uint16_t e_machine = thread__e_machine(thread, /*machine=*/NULL, /*e_flags=*/NULL); + + return unwind__prepare_access(thread__maps(thread), e_machine); +} + +static int thread__clone_maps(struct thread *thread, struct thread *parent, bool do_maps_clone) +{ + /* This is new thread, we share map groups for process. */ + if (thread__pid(thread) == thread__pid(parent)) + return thread__prepare_access(thread); + + if (maps__equal(thread__maps(thread), thread__maps(parent))) { + pr_debug("broken map groups on thread %d/%d parent %d/%d\n", + thread__pid(thread), thread__tid(thread), + thread__pid(parent), thread__tid(parent)); + return 0; + } + /* But this one is new process, copy maps. */ + return do_maps_clone ? maps__copy_from(thread__maps(thread), thread__maps(parent)) : 0; +} + +int thread__fork(struct thread *thread, struct thread *parent, u64 timestamp, bool do_maps_clone) +{ + if (thread__comm_set(parent)) { + 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__set_ppid(thread, thread__tid(parent)); + return thread__clone_maps(thread, parent, do_maps_clone); +} + +void thread__find_cpumode_addr_location(struct thread *thread, u64 addr, + bool symbols, 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++) { + if (symbols) + thread__find_symbol(thread, cpumodes[i], addr, al); + else + thread__find_map(thread, cpumodes[i], addr, al); + + if (al->map) + break; + } +} + +static uint16_t read_proc_e_machine_for_pid(pid_t pid, uint32_t *e_flags, bool *is_big_endian) +{ + char path[6 /* "/proc/" */ + 11 /* max length of pid */ + 5 /* "/exe\0" */]; + int fd; + uint16_t e_machine = EM_NONE; + + snprintf(path, sizeof(path), "/proc/%d/exe", pid); + fd = open(path, O_RDONLY); + if (fd >= 0) { + e_machine = dso__read_e_machine_endian(/*optional_dso=*/NULL, fd, e_flags, + is_big_endian); + close(fd); + } + return e_machine; +} + +struct thread__e_machine_callback_args { + struct machine *machine; + uint32_t e_flags; + uint16_t e_machine; + bool is_big_endian; +}; + +static int thread__e_machine_callback(struct map *map, void *_args) +{ + struct thread__e_machine_callback_args *args = _args; + struct dso *dso = map__dso(map); + + if (!dso) + return 0; // No dso, continue search. + + args->e_machine = + dso__e_machine_endian(dso, args->machine, &args->e_flags, &args->is_big_endian); + return args->e_machine != EM_NONE ? 1 /* stop search */ : 0 /* continue search */; +} + +uint16_t thread__e_machine_endian(struct thread *thread, struct machine *machine, uint32_t *e_flags, + bool *is_big_endian) +{ + pid_t tid, pid; + uint16_t e_machine; + uint32_t local_e_flags = 0; + struct thread__e_machine_callback_args args; + + if (!thread) { + if (is_big_endian) { + *is_big_endian = perf_arch_is_big_endian( + machine && machine->env ? perf_env__arch(machine->env) : NULL); + } + return perf_env__e_machine(machine ? machine->env : NULL, e_flags); + } + + e_machine = RC_CHK_ACCESS(thread)->e_machine; + args.machine = machine; + args.e_flags = 0; + args.e_machine = EM_NONE; + args.is_big_endian = false; + + if (e_machine != EM_NONE) { + if (e_flags) + *e_flags = thread__e_flags(thread); + if (is_big_endian) + *is_big_endian = thread__e_is_big_endian(thread); + return e_machine; + } + + if (machine == NULL) { + struct maps *maps = thread__maps(thread); + + machine = maps__machine(maps); + args.machine = machine; + } + tid = thread__tid(thread); + pid = thread__pid(thread); + if (pid != tid) { + struct thread *parent = machine__findnew_thread(machine, pid, pid); + + if (parent) { + e_machine = thread__e_machine_endian(parent, machine, &local_e_flags, + &args.is_big_endian); + thread__put(parent); + goto out; + } + /* Something went wrong, fallback. */ + } + /* Reading on the PID thread. First try to find from the maps. */ + maps__for_each_map(thread__maps(thread), thread__e_machine_callback, &args); + + if (args.e_machine != EM_NONE) { + e_machine = args.e_machine; + local_e_flags = args.e_flags; + } else { + /* Maps failed, perhaps we're live with map events disabled. */ + bool is_live = machine->machines == NULL; + + if (!is_live) { + /* Check if the session has a data file. */ + struct perf_session *session = container_of(machine->machines, + struct perf_session, + machines); + + is_live = !!session->data; + } + /* Read from /proc/pid/exe if live. */ + if (is_live) { + e_machine = read_proc_e_machine_for_pid(pid, &local_e_flags, + &args.is_big_endian); + } else if (machine && machine->env) { + /* Offline analysis: fallback to environment metadata. */ + e_machine = perf_env__e_machine(machine->env, &local_e_flags); + args.is_big_endian = perf_arch_is_big_endian(perf_env__arch(machine->env)); + } + } +out: + if (e_machine != EM_NONE) { + thread__set_e_flags(thread, local_e_flags); + thread__set_e_is_big_endian(thread, args.is_big_endian); + thread__set_e_machine(thread, e_machine); + if (is_big_endian) + *is_big_endian = args.is_big_endian; + } else { + e_machine = EM_HOST; + local_e_flags = EF_HOST; + if (is_big_endian) + *is_big_endian = (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__); + } + if (e_flags) + *e_flags = local_e_flags; + return e_machine; +} + +struct thread *thread__main_thread(struct machine *machine, struct thread *thread) +{ + if (thread__pid(thread) == thread__tid(thread)) + return thread__get(thread); + + if (thread__pid(thread) == -1) + return NULL; + + return machine__find_thread(machine, thread__pid(thread), thread__pid(thread)); +} + +int thread__memcpy(struct thread *thread, struct machine *machine, + void *buf, u64 ip, int len, bool *is64bit) +{ + u8 cpumode = PERF_RECORD_MISC_USER; + struct addr_location al; + struct dso *dso; + long offset; + + if (machine__kernel_ip(machine, ip)) + cpumode = PERF_RECORD_MISC_KERNEL; + + addr_location__init(&al); + if (!thread__find_map(thread, cpumode, ip, &al)) { + addr_location__exit(&al); + return -1; + } + + dso = map__dso(al.map); + + if (!dso || dso__data(dso)->status == DSO_DATA_STATUS_ERROR || map__load(al.map) < 0) { + addr_location__exit(&al); + return -1; + } + + offset = map__map_ip(al.map, ip); + if (is64bit) + *is64bit = dso__is_64_bit(dso); + + addr_location__exit(&al); + + return dso__data_read_offset(dso, machine, offset, buf, len); +} + +void thread__free_stitch_list(struct thread *thread) +{ + struct lbr_stitch *lbr_stitch = thread__lbr_stitch(thread); + struct stitch_list *pos, *tmp; + + if (!lbr_stitch) + return; + + list_for_each_entry_safe(pos, tmp, &lbr_stitch->lists, node) { + map_symbol__exit(&pos->cursor.ms); + list_del_init(&pos->node); + free(pos); + } + + list_for_each_entry_safe(pos, tmp, &lbr_stitch->free_lists, node) { + list_del_init(&pos->node); + free(pos); + } + + for (unsigned int i = 0 ; i < lbr_stitch->prev_lbr_cursor_size; i++) + map_symbol__exit(&lbr_stitch->prev_lbr_cursor[i].ms); + + zfree(&lbr_stitch->prev_lbr_cursor); + free(thread__lbr_stitch(thread)); + thread__set_lbr_stitch(thread, NULL); +} -- cgit v1.3.1