blob: 4989f7ea1e59925ff9eda5ac68c7ac3cedb3d4fe [file] [log] [blame]
Catalin Marinas60ffc302012-03-05 11:49:27 +00001/*
2 * Stack tracing support
3 *
4 * Copyright (C) 2012 ARM Ltd.
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
17 */
18#include <linux/kernel.h>
19#include <linux/export.h>
AKASHI Takahiro20380bb2015-12-15 17:33:41 +090020#include <linux/ftrace.h>
Catalin Marinas60ffc302012-03-05 11:49:27 +000021#include <linux/sched.h>
Ingo Molnarb17b0152017-02-08 18:51:35 +010022#include <linux/sched/debug.h>
Ingo Molnar68db0cf2017-02-08 18:51:37 +010023#include <linux/sched/task_stack.h>
Catalin Marinas60ffc302012-03-05 11:49:27 +000024#include <linux/stacktrace.h>
25
AKASHI Takahiro132cd882015-12-04 11:02:26 +000026#include <asm/irq.h>
Mark Rutlanda9ea0012016-11-03 20:23:05 +000027#include <asm/stack_pointer.h>
Catalin Marinas60ffc302012-03-05 11:49:27 +000028#include <asm/stacktrace.h>
29
30/*
31 * AArch64 PCS assigns the frame pointer to x29.
32 *
33 * A simple function prologue looks like this:
34 * sub sp, sp, #0x10
35 * stp x29, x30, [sp]
36 * mov x29, sp
37 *
38 * A simple function epilogue looks like this:
39 * mov sp, x29
40 * ldp x29, x30, [sp]
41 * add sp, sp, #0x10
42 */
AKASHI Takahirofe13f952015-12-15 17:33:40 +090043int notrace unwind_frame(struct task_struct *tsk, struct stackframe *frame)
Catalin Marinas60ffc302012-03-05 11:49:27 +000044{
Catalin Marinas60ffc302012-03-05 11:49:27 +000045 unsigned long fp = frame->fp;
Ard Biesheuvelc7365332017-07-22 12:48:34 +010046
47 if (fp & 0xf)
48 return -EINVAL;
AKASHI Takahiro132cd882015-12-04 11:02:26 +000049
Mark Rutlandb5e73072016-09-23 17:55:05 +010050 if (!tsk)
51 tsk = current;
52
Laura Abbott8a1ccfb2018-07-20 14:41:53 -070053 if (!on_accessible_stack(tsk, fp, NULL))
Catalin Marinas60ffc302012-03-05 11:49:27 +000054 return -EINVAL;
55
Yang Shibcaf6692016-02-08 09:13:09 -080056 frame->fp = READ_ONCE_NOCHECK(*(unsigned long *)(fp));
57 frame->pc = READ_ONCE_NOCHECK(*(unsigned long *)(fp + 8));
Catalin Marinas60ffc302012-03-05 11:49:27 +000058
AKASHI Takahiro20380bb2015-12-15 17:33:41 +090059#ifdef CONFIG_FUNCTION_GRAPH_TRACER
Mark Rutlandb5e73072016-09-23 17:55:05 +010060 if (tsk->ret_stack &&
AKASHI Takahiro20380bb2015-12-15 17:33:41 +090061 (frame->pc == (unsigned long)return_to_handler)) {
Pratyush Anand9f416312018-02-05 14:28:01 +010062 if (WARN_ON_ONCE(frame->graph == -1))
63 return -EINVAL;
64 if (frame->graph < -1)
65 frame->graph += FTRACE_NOTRACE_DEPTH;
66
AKASHI Takahiro20380bb2015-12-15 17:33:41 +090067 /*
68 * This is a case where function graph tracer has
69 * modified a return address (LR) in a stack frame
70 * to hook a function return.
71 * So replace it to an original value.
72 */
73 frame->pc = tsk->ret_stack[frame->graph--].ret;
74 }
75#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
76
AKASHI Takahiro132cd882015-12-04 11:02:26 +000077 /*
Ard Biesheuvel73267492017-07-22 18:45:33 +010078 * Frames created upon entry from EL0 have NULL FP and PC values, so
79 * don't bother reporting these. Frames created by __noreturn functions
80 * might have a valid FP even if PC is bogus, so only terminate where
81 * both are NULL.
AKASHI Takahiro132cd882015-12-04 11:02:26 +000082 */
Ard Biesheuvel73267492017-07-22 18:45:33 +010083 if (!frame->fp && !frame->pc)
84 return -EINVAL;
AKASHI Takahiro132cd882015-12-04 11:02:26 +000085
Catalin Marinas60ffc302012-03-05 11:49:27 +000086 return 0;
87}
88
AKASHI Takahirofe13f952015-12-15 17:33:40 +090089void notrace walk_stackframe(struct task_struct *tsk, struct stackframe *frame,
Catalin Marinas60ffc302012-03-05 11:49:27 +000090 int (*fn)(struct stackframe *, void *), void *data)
91{
92 while (1) {
93 int ret;
94
95 if (fn(frame, data))
96 break;
AKASHI Takahirofe13f952015-12-15 17:33:40 +090097 ret = unwind_frame(tsk, frame);
Catalin Marinas60ffc302012-03-05 11:49:27 +000098 if (ret < 0)
99 break;
100 }
101}
Catalin Marinas60ffc302012-03-05 11:49:27 +0000102
103#ifdef CONFIG_STACKTRACE
104struct stack_trace_data {
105 struct stack_trace *trace;
106 unsigned int no_sched_functions;
107 unsigned int skip;
108};
109
110static int save_trace(struct stackframe *frame, void *d)
111{
112 struct stack_trace_data *data = d;
113 struct stack_trace *trace = data->trace;
114 unsigned long addr = frame->pc;
115
116 if (data->no_sched_functions && in_sched_functions(addr))
117 return 0;
118 if (data->skip) {
119 data->skip--;
120 return 0;
121 }
122
123 trace->entries[trace->nr_entries++] = addr;
124
125 return trace->nr_entries >= trace->max_entries;
126}
127
Pratyush Anand98ab10e2016-09-05 08:03:16 +0530128void save_stack_trace_regs(struct pt_regs *regs, struct stack_trace *trace)
129{
130 struct stack_trace_data data;
131 struct stackframe frame;
132
133 data.trace = trace;
134 data.skip = trace->skip;
135 data.no_sched_functions = 0;
136
137 frame.fp = regs->regs[29];
Pratyush Anand98ab10e2016-09-05 08:03:16 +0530138 frame.pc = regs->pc;
139#ifdef CONFIG_FUNCTION_GRAPH_TRACER
140 frame.graph = current->curr_ret_stack;
141#endif
142
143 walk_stackframe(current, &frame, save_trace, &data);
144 if (trace->nr_entries < trace->max_entries)
145 trace->entries[trace->nr_entries++] = ULONG_MAX;
146}
147
Prakash Guptabb53c822017-09-13 16:28:32 -0700148static noinline void __save_stack_trace(struct task_struct *tsk,
149 struct stack_trace *trace, unsigned int nosched)
Catalin Marinas60ffc302012-03-05 11:49:27 +0000150{
151 struct stack_trace_data data;
152 struct stackframe frame;
153
Mark Rutland9bbd4c52016-11-03 20:23:08 +0000154 if (!try_get_task_stack(tsk))
155 return;
156
Catalin Marinas60ffc302012-03-05 11:49:27 +0000157 data.trace = trace;
158 data.skip = trace->skip;
Prakash Guptabb53c822017-09-13 16:28:32 -0700159 data.no_sched_functions = nosched;
Catalin Marinas60ffc302012-03-05 11:49:27 +0000160
161 if (tsk != current) {
Catalin Marinas60ffc302012-03-05 11:49:27 +0000162 frame.fp = thread_saved_fp(tsk);
Catalin Marinas60ffc302012-03-05 11:49:27 +0000163 frame.pc = thread_saved_pc(tsk);
164 } else {
Prakash Guptabb53c822017-09-13 16:28:32 -0700165 /* We don't want this function nor the caller */
166 data.skip += 2;
Catalin Marinas60ffc302012-03-05 11:49:27 +0000167 frame.fp = (unsigned long)__builtin_frame_address(0);
Prakash Guptabb53c822017-09-13 16:28:32 -0700168 frame.pc = (unsigned long)__save_stack_trace;
Catalin Marinas60ffc302012-03-05 11:49:27 +0000169 }
AKASHI Takahiro20380bb2015-12-15 17:33:41 +0900170#ifdef CONFIG_FUNCTION_GRAPH_TRACER
171 frame.graph = tsk->curr_ret_stack;
172#endif
Catalin Marinas60ffc302012-03-05 11:49:27 +0000173
AKASHI Takahirofe13f952015-12-15 17:33:40 +0900174 walk_stackframe(tsk, &frame, save_trace, &data);
Catalin Marinas60ffc302012-03-05 11:49:27 +0000175 if (trace->nr_entries < trace->max_entries)
176 trace->entries[trace->nr_entries++] = ULONG_MAX;
Mark Rutland9bbd4c52016-11-03 20:23:08 +0000177
178 put_task_stack(tsk);
Catalin Marinas60ffc302012-03-05 11:49:27 +0000179}
Dustin Browne27c7fa2017-06-13 11:40:56 -0700180EXPORT_SYMBOL_GPL(save_stack_trace_tsk);
Catalin Marinas60ffc302012-03-05 11:49:27 +0000181
Prakash Guptabb53c822017-09-13 16:28:32 -0700182void save_stack_trace_tsk(struct task_struct *tsk, struct stack_trace *trace)
183{
184 __save_stack_trace(tsk, trace, 1);
185}
186
Catalin Marinas60ffc302012-03-05 11:49:27 +0000187void save_stack_trace(struct stack_trace *trace)
188{
Prakash Guptabb53c822017-09-13 16:28:32 -0700189 __save_stack_trace(current, trace, 0);
Catalin Marinas60ffc302012-03-05 11:49:27 +0000190}
Prakash Guptabb53c822017-09-13 16:28:32 -0700191
Catalin Marinas60ffc302012-03-05 11:49:27 +0000192EXPORT_SYMBOL_GPL(save_stack_trace);
193#endif