1 // SPDX-License-Identifier: GPL-2.0
3 * Performance events callchain code, extracted from core.c:
5 * Copyright (C) 2008 Thomas Gleixner <tglx@linutronix.de>
6 * Copyright (C) 2008-2011 Red Hat, Inc., Ingo Molnar
7 * Copyright (C) 2008-2011 Red Hat, Inc., Peter Zijlstra
8 * Copyright © 2009 Paul Mackerras, IBM Corp. <paulus@au1.ibm.com>
11 #include <linux/perf_event.h>
12 #include <linux/slab.h>
13 #include <linux/sched/task_stack.h>
14 #include <linux/uprobes.h>
18 struct callchain_cpus_entries
{
19 struct rcu_head rcu_head
;
20 struct perf_callchain_entry
*cpu_entries
[];
23 int sysctl_perf_event_max_stack __read_mostly
= PERF_MAX_STACK_DEPTH
;
24 int sysctl_perf_event_max_contexts_per_stack __read_mostly
= PERF_MAX_CONTEXTS_PER_STACK
;
26 static inline size_t perf_callchain_entry__sizeof(void)
28 return (sizeof(struct perf_callchain_entry
) +
29 sizeof(__u64
) * (sysctl_perf_event_max_stack
+
30 sysctl_perf_event_max_contexts_per_stack
));
33 static DEFINE_PER_CPU(u8
, callchain_recursion
[PERF_NR_CONTEXTS
]);
34 static atomic_t nr_callchain_events
;
35 static DEFINE_MUTEX(callchain_mutex
);
36 static struct callchain_cpus_entries
*callchain_cpus_entries
;
39 __weak
void perf_callchain_kernel(struct perf_callchain_entry_ctx
*entry
,
44 __weak
void perf_callchain_user(struct perf_callchain_entry_ctx
*entry
,
49 static void release_callchain_buffers_rcu(struct rcu_head
*head
)
51 struct callchain_cpus_entries
*entries
;
54 entries
= container_of(head
, struct callchain_cpus_entries
, rcu_head
);
56 for_each_possible_cpu(cpu
)
57 kfree(entries
->cpu_entries
[cpu
]);
62 static void release_callchain_buffers(void)
64 struct callchain_cpus_entries
*entries
;
66 entries
= callchain_cpus_entries
;
67 RCU_INIT_POINTER(callchain_cpus_entries
, NULL
);
68 call_rcu(&entries
->rcu_head
, release_callchain_buffers_rcu
);
71 static int alloc_callchain_buffers(void)
75 struct callchain_cpus_entries
*entries
;
78 * We can't use the percpu allocation API for data that can be
79 * accessed from NMI. Use a temporary manual per cpu allocation
80 * until that gets sorted out.
82 size
= offsetof(struct callchain_cpus_entries
, cpu_entries
[nr_cpu_ids
]);
84 entries
= kzalloc(size
, GFP_KERNEL
);
88 size
= perf_callchain_entry__sizeof() * PERF_NR_CONTEXTS
;
90 for_each_possible_cpu(cpu
) {
91 entries
->cpu_entries
[cpu
] = kmalloc_node(size
, GFP_KERNEL
,
93 if (!entries
->cpu_entries
[cpu
])
97 rcu_assign_pointer(callchain_cpus_entries
, entries
);
102 for_each_possible_cpu(cpu
)
103 kfree(entries
->cpu_entries
[cpu
]);
109 int get_callchain_buffers(int event_max_stack
)
114 mutex_lock(&callchain_mutex
);
116 count
= atomic_inc_return(&nr_callchain_events
);
117 if (WARN_ON_ONCE(count
< 1)) {
123 * If requesting per event more than the global cap,
124 * return a different error to help userspace figure
127 * And also do it here so that we have &callchain_mutex held.
129 if (event_max_stack
> sysctl_perf_event_max_stack
) {
135 err
= alloc_callchain_buffers();
138 atomic_dec(&nr_callchain_events
);
140 mutex_unlock(&callchain_mutex
);
145 void put_callchain_buffers(void)
147 if (atomic_dec_and_mutex_lock(&nr_callchain_events
, &callchain_mutex
)) {
148 release_callchain_buffers();
149 mutex_unlock(&callchain_mutex
);
153 struct perf_callchain_entry
*get_callchain_entry(int *rctx
)
156 struct callchain_cpus_entries
*entries
;
158 *rctx
= get_recursion_context(this_cpu_ptr(callchain_recursion
));
162 entries
= rcu_dereference(callchain_cpus_entries
);
164 put_recursion_context(this_cpu_ptr(callchain_recursion
), *rctx
);
168 cpu
= smp_processor_id();
170 return (((void *)entries
->cpu_entries
[cpu
]) +
171 (*rctx
* perf_callchain_entry__sizeof()));
175 put_callchain_entry(int rctx
)
177 put_recursion_context(this_cpu_ptr(callchain_recursion
), rctx
);
180 static void fixup_uretprobe_trampoline_entries(struct perf_callchain_entry
*entry
,
183 #ifdef CONFIG_UPROBES
184 struct uprobe_task
*utask
= current
->utask
;
185 struct return_instance
*ri
;
186 __u64
*cur_ip
, *last_ip
, tramp_addr
;
188 if (likely(!utask
|| !utask
->return_instances
))
191 cur_ip
= &entry
->ip
[start_entry_idx
];
192 last_ip
= &entry
->ip
[entry
->nr
- 1];
193 ri
= utask
->return_instances
;
194 tramp_addr
= uprobe_get_trampoline_vaddr();
197 * If there are pending uretprobes for the current thread, they are
198 * recorded in a list inside utask->return_instances; each such
199 * pending uretprobe replaces traced user function's return address on
200 * the stack, so when stack trace is captured, instead of seeing
201 * actual function's return address, we'll have one or many uretprobe
202 * trampoline addresses in the stack trace, which are not helpful and
203 * misleading to users.
204 * So here we go over the pending list of uretprobes, and each
205 * encountered trampoline address is replaced with actual return
208 while (ri
&& cur_ip
<= last_ip
) {
209 if (*cur_ip
== tramp_addr
) {
210 *cur_ip
= ri
->orig_ret_vaddr
;
218 struct perf_callchain_entry
*
219 get_perf_callchain(struct pt_regs
*regs
, u32 init_nr
, bool kernel
, bool user
,
220 u32 max_stack
, bool crosstask
, bool add_mark
)
222 struct perf_callchain_entry
*entry
;
223 struct perf_callchain_entry_ctx ctx
;
224 int rctx
, start_entry_idx
;
226 entry
= get_callchain_entry(&rctx
);
231 ctx
.max_stack
= max_stack
;
232 ctx
.nr
= entry
->nr
= init_nr
;
234 ctx
.contexts_maxed
= false;
236 if (kernel
&& !user_mode(regs
)) {
238 perf_callchain_store_context(&ctx
, PERF_CONTEXT_KERNEL
);
239 perf_callchain_kernel(&ctx
, regs
);
243 if (!user_mode(regs
)) {
245 regs
= task_pt_regs(current
);
255 perf_callchain_store_context(&ctx
, PERF_CONTEXT_USER
);
257 start_entry_idx
= entry
->nr
;
258 perf_callchain_user(&ctx
, regs
);
259 fixup_uretprobe_trampoline_entries(entry
, start_entry_idx
);
264 put_callchain_entry(rctx
);
270 * Used for sysctl_perf_event_max_stack and
271 * sysctl_perf_event_max_contexts_per_stack.
273 int perf_event_max_stack_handler(const struct ctl_table
*table
, int write
,
274 void *buffer
, size_t *lenp
, loff_t
*ppos
)
276 int *value
= table
->data
;
277 int new_value
= *value
, ret
;
278 struct ctl_table new_table
= *table
;
280 new_table
.data
= &new_value
;
281 ret
= proc_dointvec_minmax(&new_table
, write
, buffer
, lenp
, ppos
);
285 mutex_lock(&callchain_mutex
);
286 if (atomic_read(&nr_callchain_events
))
291 mutex_unlock(&callchain_mutex
);