arm64: dts: Revert "specify console via command line"
[linux/fpc-iii.git] / arch / x86 / kernel / unwind_orc.c
blobe9cc182aa97eed1d6d23858f5a89b2f663b1c6e9
1 // SPDX-License-Identifier: GPL-2.0-only
2 #include <linux/module.h>
3 #include <linux/sort.h>
4 #include <asm/ptrace.h>
5 #include <asm/stacktrace.h>
6 #include <asm/unwind.h>
7 #include <asm/orc_types.h>
8 #include <asm/orc_lookup.h>
10 #define orc_warn(fmt, ...) \
11 printk_deferred_once(KERN_WARNING pr_fmt("WARNING: " fmt), ##__VA_ARGS__)
13 extern int __start_orc_unwind_ip[];
14 extern int __stop_orc_unwind_ip[];
15 extern struct orc_entry __start_orc_unwind[];
16 extern struct orc_entry __stop_orc_unwind[];
18 static DEFINE_MUTEX(sort_mutex);
19 int *cur_orc_ip_table = __start_orc_unwind_ip;
20 struct orc_entry *cur_orc_table = __start_orc_unwind;
22 unsigned int lookup_num_blocks;
23 bool orc_init;
25 static inline unsigned long orc_ip(const int *ip)
27 return (unsigned long)ip + *ip;
30 static struct orc_entry *__orc_find(int *ip_table, struct orc_entry *u_table,
31 unsigned int num_entries, unsigned long ip)
33 int *first = ip_table;
34 int *last = ip_table + num_entries - 1;
35 int *mid = first, *found = first;
37 if (!num_entries)
38 return NULL;
41 * Do a binary range search to find the rightmost duplicate of a given
42 * starting address. Some entries are section terminators which are
43 * "weak" entries for ensuring there are no gaps. They should be
44 * ignored when they conflict with a real entry.
46 while (first <= last) {
47 mid = first + ((last - first) / 2);
49 if (orc_ip(mid) <= ip) {
50 found = mid;
51 first = mid + 1;
52 } else
53 last = mid - 1;
56 return u_table + (found - ip_table);
59 #ifdef CONFIG_MODULES
60 static struct orc_entry *orc_module_find(unsigned long ip)
62 struct module *mod;
64 mod = __module_address(ip);
65 if (!mod || !mod->arch.orc_unwind || !mod->arch.orc_unwind_ip)
66 return NULL;
67 return __orc_find(mod->arch.orc_unwind_ip, mod->arch.orc_unwind,
68 mod->arch.num_orcs, ip);
70 #else
71 static struct orc_entry *orc_module_find(unsigned long ip)
73 return NULL;
75 #endif
77 #ifdef CONFIG_DYNAMIC_FTRACE
78 static struct orc_entry *orc_find(unsigned long ip);
81 * Ftrace dynamic trampolines do not have orc entries of their own.
82 * But they are copies of the ftrace entries that are static and
83 * defined in ftrace_*.S, which do have orc entries.
85 * If the unwinder comes across a ftrace trampoline, then find the
86 * ftrace function that was used to create it, and use that ftrace
87 * function's orc entry, as the placement of the return code in
88 * the stack will be identical.
90 static struct orc_entry *orc_ftrace_find(unsigned long ip)
92 struct ftrace_ops *ops;
93 unsigned long caller;
95 ops = ftrace_ops_trampoline(ip);
96 if (!ops)
97 return NULL;
99 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
100 caller = (unsigned long)ftrace_regs_call;
101 else
102 caller = (unsigned long)ftrace_call;
104 /* Prevent unlikely recursion */
105 if (ip == caller)
106 return NULL;
108 return orc_find(caller);
110 #else
111 static struct orc_entry *orc_ftrace_find(unsigned long ip)
113 return NULL;
115 #endif
118 * If we crash with IP==0, the last successfully executed instruction
119 * was probably an indirect function call with a NULL function pointer,
120 * and we don't have unwind information for NULL.
121 * This hardcoded ORC entry for IP==0 allows us to unwind from a NULL function
122 * pointer into its parent and then continue normally from there.
124 static struct orc_entry null_orc_entry = {
125 .sp_offset = sizeof(long),
126 .sp_reg = ORC_REG_SP,
127 .bp_reg = ORC_REG_UNDEFINED,
128 .type = ORC_TYPE_CALL
131 /* Fake frame pointer entry -- used as a fallback for generated code */
132 static struct orc_entry orc_fp_entry = {
133 .type = ORC_TYPE_CALL,
134 .sp_reg = ORC_REG_BP,
135 .sp_offset = 16,
136 .bp_reg = ORC_REG_PREV_SP,
137 .bp_offset = -16,
138 .end = 0,
141 static struct orc_entry *orc_find(unsigned long ip)
143 static struct orc_entry *orc;
145 if (!orc_init)
146 return NULL;
148 if (ip == 0)
149 return &null_orc_entry;
151 /* For non-init vmlinux addresses, use the fast lookup table: */
152 if (ip >= LOOKUP_START_IP && ip < LOOKUP_STOP_IP) {
153 unsigned int idx, start, stop;
155 idx = (ip - LOOKUP_START_IP) / LOOKUP_BLOCK_SIZE;
157 if (unlikely((idx >= lookup_num_blocks-1))) {
158 orc_warn("WARNING: bad lookup idx: idx=%u num=%u ip=%pB\n",
159 idx, lookup_num_blocks, (void *)ip);
160 return NULL;
163 start = orc_lookup[idx];
164 stop = orc_lookup[idx + 1] + 1;
166 if (unlikely((__start_orc_unwind + start >= __stop_orc_unwind) ||
167 (__start_orc_unwind + stop > __stop_orc_unwind))) {
168 orc_warn("WARNING: bad lookup value: idx=%u num=%u start=%u stop=%u ip=%pB\n",
169 idx, lookup_num_blocks, start, stop, (void *)ip);
170 return NULL;
173 return __orc_find(__start_orc_unwind_ip + start,
174 __start_orc_unwind + start, stop - start, ip);
177 /* vmlinux .init slow lookup: */
178 if (init_kernel_text(ip))
179 return __orc_find(__start_orc_unwind_ip, __start_orc_unwind,
180 __stop_orc_unwind_ip - __start_orc_unwind_ip, ip);
182 /* Module lookup: */
183 orc = orc_module_find(ip);
184 if (orc)
185 return orc;
187 return orc_ftrace_find(ip);
190 #ifdef CONFIG_MODULES
192 static void orc_sort_swap(void *_a, void *_b, int size)
194 struct orc_entry *orc_a, *orc_b;
195 struct orc_entry orc_tmp;
196 int *a = _a, *b = _b, tmp;
197 int delta = _b - _a;
199 /* Swap the .orc_unwind_ip entries: */
200 tmp = *a;
201 *a = *b + delta;
202 *b = tmp - delta;
204 /* Swap the corresponding .orc_unwind entries: */
205 orc_a = cur_orc_table + (a - cur_orc_ip_table);
206 orc_b = cur_orc_table + (b - cur_orc_ip_table);
207 orc_tmp = *orc_a;
208 *orc_a = *orc_b;
209 *orc_b = orc_tmp;
212 static int orc_sort_cmp(const void *_a, const void *_b)
214 struct orc_entry *orc_a;
215 const int *a = _a, *b = _b;
216 unsigned long a_val = orc_ip(a);
217 unsigned long b_val = orc_ip(b);
219 if (a_val > b_val)
220 return 1;
221 if (a_val < b_val)
222 return -1;
225 * The "weak" section terminator entries need to always be on the left
226 * to ensure the lookup code skips them in favor of real entries.
227 * These terminator entries exist to handle any gaps created by
228 * whitelisted .o files which didn't get objtool generation.
230 orc_a = cur_orc_table + (a - cur_orc_ip_table);
231 return orc_a->sp_reg == ORC_REG_UNDEFINED && !orc_a->end ? -1 : 1;
234 void unwind_module_init(struct module *mod, void *_orc_ip, size_t orc_ip_size,
235 void *_orc, size_t orc_size)
237 int *orc_ip = _orc_ip;
238 struct orc_entry *orc = _orc;
239 unsigned int num_entries = orc_ip_size / sizeof(int);
241 WARN_ON_ONCE(orc_ip_size % sizeof(int) != 0 ||
242 orc_size % sizeof(*orc) != 0 ||
243 num_entries != orc_size / sizeof(*orc));
246 * The 'cur_orc_*' globals allow the orc_sort_swap() callback to
247 * associate an .orc_unwind_ip table entry with its corresponding
248 * .orc_unwind entry so they can both be swapped.
250 mutex_lock(&sort_mutex);
251 cur_orc_ip_table = orc_ip;
252 cur_orc_table = orc;
253 sort(orc_ip, num_entries, sizeof(int), orc_sort_cmp, orc_sort_swap);
254 mutex_unlock(&sort_mutex);
256 mod->arch.orc_unwind_ip = orc_ip;
257 mod->arch.orc_unwind = orc;
258 mod->arch.num_orcs = num_entries;
260 #endif
262 void __init unwind_init(void)
264 size_t orc_ip_size = (void *)__stop_orc_unwind_ip - (void *)__start_orc_unwind_ip;
265 size_t orc_size = (void *)__stop_orc_unwind - (void *)__start_orc_unwind;
266 size_t num_entries = orc_ip_size / sizeof(int);
267 struct orc_entry *orc;
268 int i;
270 if (!num_entries || orc_ip_size % sizeof(int) != 0 ||
271 orc_size % sizeof(struct orc_entry) != 0 ||
272 num_entries != orc_size / sizeof(struct orc_entry)) {
273 orc_warn("WARNING: Bad or missing .orc_unwind table. Disabling unwinder.\n");
274 return;
278 * Note, the orc_unwind and orc_unwind_ip tables were already
279 * sorted at build time via the 'sorttable' tool.
280 * It's ready for binary search straight away, no need to sort it.
283 /* Initialize the fast lookup table: */
284 lookup_num_blocks = orc_lookup_end - orc_lookup;
285 for (i = 0; i < lookup_num_blocks-1; i++) {
286 orc = __orc_find(__start_orc_unwind_ip, __start_orc_unwind,
287 num_entries,
288 LOOKUP_START_IP + (LOOKUP_BLOCK_SIZE * i));
289 if (!orc) {
290 orc_warn("WARNING: Corrupt .orc_unwind table. Disabling unwinder.\n");
291 return;
294 orc_lookup[i] = orc - __start_orc_unwind;
297 /* Initialize the ending block: */
298 orc = __orc_find(__start_orc_unwind_ip, __start_orc_unwind, num_entries,
299 LOOKUP_STOP_IP);
300 if (!orc) {
301 orc_warn("WARNING: Corrupt .orc_unwind table. Disabling unwinder.\n");
302 return;
304 orc_lookup[lookup_num_blocks-1] = orc - __start_orc_unwind;
306 orc_init = true;
309 unsigned long unwind_get_return_address(struct unwind_state *state)
311 if (unwind_done(state))
312 return 0;
314 return __kernel_text_address(state->ip) ? state->ip : 0;
316 EXPORT_SYMBOL_GPL(unwind_get_return_address);
318 unsigned long *unwind_get_return_address_ptr(struct unwind_state *state)
320 if (unwind_done(state))
321 return NULL;
323 if (state->regs)
324 return &state->regs->ip;
326 if (state->sp)
327 return (unsigned long *)state->sp - 1;
329 return NULL;
332 static bool stack_access_ok(struct unwind_state *state, unsigned long _addr,
333 size_t len)
335 struct stack_info *info = &state->stack_info;
336 void *addr = (void *)_addr;
338 if (!on_stack(info, addr, len) &&
339 (get_stack_info(addr, state->task, info, &state->stack_mask)))
340 return false;
342 return true;
345 static bool deref_stack_reg(struct unwind_state *state, unsigned long addr,
346 unsigned long *val)
348 if (!stack_access_ok(state, addr, sizeof(long)))
349 return false;
351 *val = READ_ONCE_NOCHECK(*(unsigned long *)addr);
352 return true;
355 static bool deref_stack_regs(struct unwind_state *state, unsigned long addr,
356 unsigned long *ip, unsigned long *sp)
358 struct pt_regs *regs = (struct pt_regs *)addr;
360 /* x86-32 support will be more complicated due to the &regs->sp hack */
361 BUILD_BUG_ON(IS_ENABLED(CONFIG_X86_32));
363 if (!stack_access_ok(state, addr, sizeof(struct pt_regs)))
364 return false;
366 *ip = regs->ip;
367 *sp = regs->sp;
368 return true;
371 static bool deref_stack_iret_regs(struct unwind_state *state, unsigned long addr,
372 unsigned long *ip, unsigned long *sp)
374 struct pt_regs *regs = (void *)addr - IRET_FRAME_OFFSET;
376 if (!stack_access_ok(state, addr, IRET_FRAME_SIZE))
377 return false;
379 *ip = regs->ip;
380 *sp = regs->sp;
381 return true;
384 bool unwind_next_frame(struct unwind_state *state)
386 unsigned long ip_p, sp, orig_ip = state->ip, prev_sp = state->sp;
387 enum stack_type prev_type = state->stack_info.type;
388 struct orc_entry *orc;
389 bool indirect = false;
391 if (unwind_done(state))
392 return false;
394 /* Don't let modules unload while we're reading their ORC data. */
395 preempt_disable();
397 /* End-of-stack check for user tasks: */
398 if (state->regs && user_mode(state->regs))
399 goto the_end;
402 * Find the orc_entry associated with the text address.
404 * Decrement call return addresses by one so they work for sibling
405 * calls and calls to noreturn functions.
407 orc = orc_find(state->signal ? state->ip : state->ip - 1);
408 if (!orc) {
410 * As a fallback, try to assume this code uses a frame pointer.
411 * This is useful for generated code, like BPF, which ORC
412 * doesn't know about. This is just a guess, so the rest of
413 * the unwind is no longer considered reliable.
415 orc = &orc_fp_entry;
416 state->error = true;
419 /* End-of-stack check for kernel threads: */
420 if (orc->sp_reg == ORC_REG_UNDEFINED) {
421 if (!orc->end)
422 goto err;
424 goto the_end;
427 /* Find the previous frame's stack: */
428 switch (orc->sp_reg) {
429 case ORC_REG_SP:
430 sp = state->sp + orc->sp_offset;
431 break;
433 case ORC_REG_BP:
434 sp = state->bp + orc->sp_offset;
435 break;
437 case ORC_REG_SP_INDIRECT:
438 sp = state->sp + orc->sp_offset;
439 indirect = true;
440 break;
442 case ORC_REG_BP_INDIRECT:
443 sp = state->bp + orc->sp_offset;
444 indirect = true;
445 break;
447 case ORC_REG_R10:
448 if (!state->regs || !state->full_regs) {
449 orc_warn("missing regs for base reg R10 at ip %pB\n",
450 (void *)state->ip);
451 goto err;
453 sp = state->regs->r10;
454 break;
456 case ORC_REG_R13:
457 if (!state->regs || !state->full_regs) {
458 orc_warn("missing regs for base reg R13 at ip %pB\n",
459 (void *)state->ip);
460 goto err;
462 sp = state->regs->r13;
463 break;
465 case ORC_REG_DI:
466 if (!state->regs || !state->full_regs) {
467 orc_warn("missing regs for base reg DI at ip %pB\n",
468 (void *)state->ip);
469 goto err;
471 sp = state->regs->di;
472 break;
474 case ORC_REG_DX:
475 if (!state->regs || !state->full_regs) {
476 orc_warn("missing regs for base reg DX at ip %pB\n",
477 (void *)state->ip);
478 goto err;
480 sp = state->regs->dx;
481 break;
483 default:
484 orc_warn("unknown SP base reg %d for ip %pB\n",
485 orc->sp_reg, (void *)state->ip);
486 goto err;
489 if (indirect) {
490 if (!deref_stack_reg(state, sp, &sp))
491 goto err;
494 /* Find IP, SP and possibly regs: */
495 switch (orc->type) {
496 case ORC_TYPE_CALL:
497 ip_p = sp - sizeof(long);
499 if (!deref_stack_reg(state, ip_p, &state->ip))
500 goto err;
502 state->ip = ftrace_graph_ret_addr(state->task, &state->graph_idx,
503 state->ip, (void *)ip_p);
505 state->sp = sp;
506 state->regs = NULL;
507 state->signal = false;
508 break;
510 case ORC_TYPE_REGS:
511 if (!deref_stack_regs(state, sp, &state->ip, &state->sp)) {
512 orc_warn("can't dereference registers at %p for ip %pB\n",
513 (void *)sp, (void *)orig_ip);
514 goto err;
517 state->regs = (struct pt_regs *)sp;
518 state->full_regs = true;
519 state->signal = true;
520 break;
522 case ORC_TYPE_REGS_IRET:
523 if (!deref_stack_iret_regs(state, sp, &state->ip, &state->sp)) {
524 orc_warn("can't dereference iret registers at %p for ip %pB\n",
525 (void *)sp, (void *)orig_ip);
526 goto err;
529 state->regs = (void *)sp - IRET_FRAME_OFFSET;
530 state->full_regs = false;
531 state->signal = true;
532 break;
534 default:
535 orc_warn("unknown .orc_unwind entry type %d for ip %pB\n",
536 orc->type, (void *)orig_ip);
537 break;
540 /* Find BP: */
541 switch (orc->bp_reg) {
542 case ORC_REG_UNDEFINED:
543 if (state->regs && state->full_regs)
544 state->bp = state->regs->bp;
545 break;
547 case ORC_REG_PREV_SP:
548 if (!deref_stack_reg(state, sp + orc->bp_offset, &state->bp))
549 goto err;
550 break;
552 case ORC_REG_BP:
553 if (!deref_stack_reg(state, state->bp + orc->bp_offset, &state->bp))
554 goto err;
555 break;
557 default:
558 orc_warn("unknown BP base reg %d for ip %pB\n",
559 orc->bp_reg, (void *)orig_ip);
560 goto err;
563 /* Prevent a recursive loop due to bad ORC data: */
564 if (state->stack_info.type == prev_type &&
565 on_stack(&state->stack_info, (void *)state->sp, sizeof(long)) &&
566 state->sp <= prev_sp) {
567 orc_warn("stack going in the wrong direction? ip=%pB\n",
568 (void *)orig_ip);
569 goto err;
572 preempt_enable();
573 return true;
575 err:
576 state->error = true;
578 the_end:
579 preempt_enable();
580 state->stack_info.type = STACK_TYPE_UNKNOWN;
581 return false;
583 EXPORT_SYMBOL_GPL(unwind_next_frame);
585 void __unwind_start(struct unwind_state *state, struct task_struct *task,
586 struct pt_regs *regs, unsigned long *first_frame)
588 memset(state, 0, sizeof(*state));
589 state->task = task;
592 * Refuse to unwind the stack of a task while it's executing on another
593 * CPU. This check is racy, but that's ok: the unwinder has other
594 * checks to prevent it from going off the rails.
596 if (task_on_another_cpu(task))
597 goto done;
599 if (regs) {
600 if (user_mode(regs))
601 goto done;
603 state->ip = regs->ip;
604 state->sp = regs->sp;
605 state->bp = regs->bp;
606 state->regs = regs;
607 state->full_regs = true;
608 state->signal = true;
610 } else if (task == current) {
611 asm volatile("lea (%%rip), %0\n\t"
612 "mov %%rsp, %1\n\t"
613 "mov %%rbp, %2\n\t"
614 : "=r" (state->ip), "=r" (state->sp),
615 "=r" (state->bp));
617 } else {
618 struct inactive_task_frame *frame = (void *)task->thread.sp;
620 state->sp = task->thread.sp;
621 state->bp = READ_ONCE_NOCHECK(frame->bp);
622 state->ip = READ_ONCE_NOCHECK(frame->ret_addr);
625 if (get_stack_info((unsigned long *)state->sp, state->task,
626 &state->stack_info, &state->stack_mask)) {
628 * We weren't on a valid stack. It's possible that
629 * we overflowed a valid stack into a guard page.
630 * See if the next page up is valid so that we can
631 * generate some kind of backtrace if this happens.
633 void *next_page = (void *)PAGE_ALIGN((unsigned long)state->sp);
634 if (get_stack_info(next_page, state->task, &state->stack_info,
635 &state->stack_mask))
636 return;
640 * The caller can provide the address of the first frame directly
641 * (first_frame) or indirectly (regs->sp) to indicate which stack frame
642 * to start unwinding at. Skip ahead until we reach it.
645 /* When starting from regs, skip the regs frame: */
646 if (regs) {
647 unwind_next_frame(state);
648 return;
651 /* Otherwise, skip ahead to the user-specified starting frame: */
652 while (!unwind_done(state) &&
653 (!on_stack(&state->stack_info, first_frame, sizeof(long)) ||
654 state->sp <= (unsigned long)first_frame))
655 unwind_next_frame(state);
657 return;
659 done:
660 state->stack_info.type = STACK_TYPE_UNKNOWN;
661 return;
663 EXPORT_SYMBOL_GPL(__unwind_start);