hugetlb: introduce generic version of hugetlb_free_pgd_range
[linux/fpc-iii.git] / arch / x86 / kernel / unwind_orc.c
blob26038eacf74a7130d659f98e5e1348667d4d635e
1 #include <linux/module.h>
2 #include <linux/sort.h>
3 #include <asm/ptrace.h>
4 #include <asm/stacktrace.h>
5 #include <asm/unwind.h>
6 #include <asm/orc_types.h>
7 #include <asm/orc_lookup.h>
9 #define orc_warn(fmt, ...) \
10 printk_deferred_once(KERN_WARNING pr_fmt("WARNING: " fmt), ##__VA_ARGS__)
12 extern int __start_orc_unwind_ip[];
13 extern int __stop_orc_unwind_ip[];
14 extern struct orc_entry __start_orc_unwind[];
15 extern struct orc_entry __stop_orc_unwind[];
17 static DEFINE_MUTEX(sort_mutex);
18 int *cur_orc_ip_table = __start_orc_unwind_ip;
19 struct orc_entry *cur_orc_table = __start_orc_unwind;
21 unsigned int lookup_num_blocks;
22 bool orc_init;
24 static inline unsigned long orc_ip(const int *ip)
26 return (unsigned long)ip + *ip;
29 static struct orc_entry *__orc_find(int *ip_table, struct orc_entry *u_table,
30 unsigned int num_entries, unsigned long ip)
32 int *first = ip_table;
33 int *last = ip_table + num_entries - 1;
34 int *mid = first, *found = first;
36 if (!num_entries)
37 return NULL;
40 * Do a binary range search to find the rightmost duplicate of a given
41 * starting address. Some entries are section terminators which are
42 * "weak" entries for ensuring there are no gaps. They should be
43 * ignored when they conflict with a real entry.
45 while (first <= last) {
46 mid = first + ((last - first) / 2);
48 if (orc_ip(mid) <= ip) {
49 found = mid;
50 first = mid + 1;
51 } else
52 last = mid - 1;
55 return u_table + (found - ip_table);
58 #ifdef CONFIG_MODULES
59 static struct orc_entry *orc_module_find(unsigned long ip)
61 struct module *mod;
63 mod = __module_address(ip);
64 if (!mod || !mod->arch.orc_unwind || !mod->arch.orc_unwind_ip)
65 return NULL;
66 return __orc_find(mod->arch.orc_unwind_ip, mod->arch.orc_unwind,
67 mod->arch.num_orcs, ip);
69 #else
70 static struct orc_entry *orc_module_find(unsigned long ip)
72 return NULL;
74 #endif
76 #ifdef CONFIG_DYNAMIC_FTRACE
77 static struct orc_entry *orc_find(unsigned long ip);
80 * Ftrace dynamic trampolines do not have orc entries of their own.
81 * But they are copies of the ftrace entries that are static and
82 * defined in ftrace_*.S, which do have orc entries.
84 * If the undwinder comes across a ftrace trampoline, then find the
85 * ftrace function that was used to create it, and use that ftrace
86 * function's orc entrie, as the placement of the return code in
87 * the stack will be identical.
89 static struct orc_entry *orc_ftrace_find(unsigned long ip)
91 struct ftrace_ops *ops;
92 unsigned long caller;
94 ops = ftrace_ops_trampoline(ip);
95 if (!ops)
96 return NULL;
98 if (ops->flags & FTRACE_OPS_FL_SAVE_REGS)
99 caller = (unsigned long)ftrace_regs_call;
100 else
101 caller = (unsigned long)ftrace_call;
103 /* Prevent unlikely recursion */
104 if (ip == caller)
105 return NULL;
107 return orc_find(caller);
109 #else
110 static struct orc_entry *orc_ftrace_find(unsigned long ip)
112 return NULL;
114 #endif
116 static struct orc_entry *orc_find(unsigned long ip)
118 static struct orc_entry *orc;
120 if (!orc_init)
121 return NULL;
123 /* For non-init vmlinux addresses, use the fast lookup table: */
124 if (ip >= LOOKUP_START_IP && ip < LOOKUP_STOP_IP) {
125 unsigned int idx, start, stop;
127 idx = (ip - LOOKUP_START_IP) / LOOKUP_BLOCK_SIZE;
129 if (unlikely((idx >= lookup_num_blocks-1))) {
130 orc_warn("WARNING: bad lookup idx: idx=%u num=%u ip=%pB\n",
131 idx, lookup_num_blocks, (void *)ip);
132 return NULL;
135 start = orc_lookup[idx];
136 stop = orc_lookup[idx + 1] + 1;
138 if (unlikely((__start_orc_unwind + start >= __stop_orc_unwind) ||
139 (__start_orc_unwind + stop > __stop_orc_unwind))) {
140 orc_warn("WARNING: bad lookup value: idx=%u num=%u start=%u stop=%u ip=%pB\n",
141 idx, lookup_num_blocks, start, stop, (void *)ip);
142 return NULL;
145 return __orc_find(__start_orc_unwind_ip + start,
146 __start_orc_unwind + start, stop - start, ip);
149 /* vmlinux .init slow lookup: */
150 if (init_kernel_text(ip))
151 return __orc_find(__start_orc_unwind_ip, __start_orc_unwind,
152 __stop_orc_unwind_ip - __start_orc_unwind_ip, ip);
154 /* Module lookup: */
155 orc = orc_module_find(ip);
156 if (orc)
157 return orc;
159 return orc_ftrace_find(ip);
162 static void orc_sort_swap(void *_a, void *_b, int size)
164 struct orc_entry *orc_a, *orc_b;
165 struct orc_entry orc_tmp;
166 int *a = _a, *b = _b, tmp;
167 int delta = _b - _a;
169 /* Swap the .orc_unwind_ip entries: */
170 tmp = *a;
171 *a = *b + delta;
172 *b = tmp - delta;
174 /* Swap the corresponding .orc_unwind entries: */
175 orc_a = cur_orc_table + (a - cur_orc_ip_table);
176 orc_b = cur_orc_table + (b - cur_orc_ip_table);
177 orc_tmp = *orc_a;
178 *orc_a = *orc_b;
179 *orc_b = orc_tmp;
182 static int orc_sort_cmp(const void *_a, const void *_b)
184 struct orc_entry *orc_a;
185 const int *a = _a, *b = _b;
186 unsigned long a_val = orc_ip(a);
187 unsigned long b_val = orc_ip(b);
189 if (a_val > b_val)
190 return 1;
191 if (a_val < b_val)
192 return -1;
195 * The "weak" section terminator entries need to always be on the left
196 * to ensure the lookup code skips them in favor of real entries.
197 * These terminator entries exist to handle any gaps created by
198 * whitelisted .o files which didn't get objtool generation.
200 orc_a = cur_orc_table + (a - cur_orc_ip_table);
201 return orc_a->sp_reg == ORC_REG_UNDEFINED && !orc_a->end ? -1 : 1;
204 #ifdef CONFIG_MODULES
205 void unwind_module_init(struct module *mod, void *_orc_ip, size_t orc_ip_size,
206 void *_orc, size_t orc_size)
208 int *orc_ip = _orc_ip;
209 struct orc_entry *orc = _orc;
210 unsigned int num_entries = orc_ip_size / sizeof(int);
212 WARN_ON_ONCE(orc_ip_size % sizeof(int) != 0 ||
213 orc_size % sizeof(*orc) != 0 ||
214 num_entries != orc_size / sizeof(*orc));
217 * The 'cur_orc_*' globals allow the orc_sort_swap() callback to
218 * associate an .orc_unwind_ip table entry with its corresponding
219 * .orc_unwind entry so they can both be swapped.
221 mutex_lock(&sort_mutex);
222 cur_orc_ip_table = orc_ip;
223 cur_orc_table = orc;
224 sort(orc_ip, num_entries, sizeof(int), orc_sort_cmp, orc_sort_swap);
225 mutex_unlock(&sort_mutex);
227 mod->arch.orc_unwind_ip = orc_ip;
228 mod->arch.orc_unwind = orc;
229 mod->arch.num_orcs = num_entries;
231 #endif
233 void __init unwind_init(void)
235 size_t orc_ip_size = (void *)__stop_orc_unwind_ip - (void *)__start_orc_unwind_ip;
236 size_t orc_size = (void *)__stop_orc_unwind - (void *)__start_orc_unwind;
237 size_t num_entries = orc_ip_size / sizeof(int);
238 struct orc_entry *orc;
239 int i;
241 if (!num_entries || orc_ip_size % sizeof(int) != 0 ||
242 orc_size % sizeof(struct orc_entry) != 0 ||
243 num_entries != orc_size / sizeof(struct orc_entry)) {
244 orc_warn("WARNING: Bad or missing .orc_unwind table. Disabling unwinder.\n");
245 return;
248 /* Sort the .orc_unwind and .orc_unwind_ip tables: */
249 sort(__start_orc_unwind_ip, num_entries, sizeof(int), orc_sort_cmp,
250 orc_sort_swap);
252 /* Initialize the fast lookup table: */
253 lookup_num_blocks = orc_lookup_end - orc_lookup;
254 for (i = 0; i < lookup_num_blocks-1; i++) {
255 orc = __orc_find(__start_orc_unwind_ip, __start_orc_unwind,
256 num_entries,
257 LOOKUP_START_IP + (LOOKUP_BLOCK_SIZE * i));
258 if (!orc) {
259 orc_warn("WARNING: Corrupt .orc_unwind table. Disabling unwinder.\n");
260 return;
263 orc_lookup[i] = orc - __start_orc_unwind;
266 /* Initialize the ending block: */
267 orc = __orc_find(__start_orc_unwind_ip, __start_orc_unwind, num_entries,
268 LOOKUP_STOP_IP);
269 if (!orc) {
270 orc_warn("WARNING: Corrupt .orc_unwind table. Disabling unwinder.\n");
271 return;
273 orc_lookup[lookup_num_blocks-1] = orc - __start_orc_unwind;
275 orc_init = true;
278 unsigned long unwind_get_return_address(struct unwind_state *state)
280 if (unwind_done(state))
281 return 0;
283 return __kernel_text_address(state->ip) ? state->ip : 0;
285 EXPORT_SYMBOL_GPL(unwind_get_return_address);
287 unsigned long *unwind_get_return_address_ptr(struct unwind_state *state)
289 if (unwind_done(state))
290 return NULL;
292 if (state->regs)
293 return &state->regs->ip;
295 if (state->sp)
296 return (unsigned long *)state->sp - 1;
298 return NULL;
301 static bool stack_access_ok(struct unwind_state *state, unsigned long _addr,
302 size_t len)
304 struct stack_info *info = &state->stack_info;
305 void *addr = (void *)_addr;
307 if (!on_stack(info, addr, len) &&
308 (get_stack_info(addr, state->task, info, &state->stack_mask)))
309 return false;
311 return true;
314 static bool deref_stack_reg(struct unwind_state *state, unsigned long addr,
315 unsigned long *val)
317 if (!stack_access_ok(state, addr, sizeof(long)))
318 return false;
320 *val = READ_ONCE_NOCHECK(*(unsigned long *)addr);
321 return true;
324 static bool deref_stack_regs(struct unwind_state *state, unsigned long addr,
325 unsigned long *ip, unsigned long *sp)
327 struct pt_regs *regs = (struct pt_regs *)addr;
329 /* x86-32 support will be more complicated due to the &regs->sp hack */
330 BUILD_BUG_ON(IS_ENABLED(CONFIG_X86_32));
332 if (!stack_access_ok(state, addr, sizeof(struct pt_regs)))
333 return false;
335 *ip = regs->ip;
336 *sp = regs->sp;
337 return true;
340 static bool deref_stack_iret_regs(struct unwind_state *state, unsigned long addr,
341 unsigned long *ip, unsigned long *sp)
343 struct pt_regs *regs = (void *)addr - IRET_FRAME_OFFSET;
345 if (!stack_access_ok(state, addr, IRET_FRAME_SIZE))
346 return false;
348 *ip = regs->ip;
349 *sp = regs->sp;
350 return true;
353 bool unwind_next_frame(struct unwind_state *state)
355 unsigned long ip_p, sp, orig_ip = state->ip, prev_sp = state->sp;
356 enum stack_type prev_type = state->stack_info.type;
357 struct orc_entry *orc;
358 bool indirect = false;
360 if (unwind_done(state))
361 return false;
363 /* Don't let modules unload while we're reading their ORC data. */
364 preempt_disable();
366 /* End-of-stack check for user tasks: */
367 if (state->regs && user_mode(state->regs))
368 goto the_end;
371 * Find the orc_entry associated with the text address.
373 * Decrement call return addresses by one so they work for sibling
374 * calls and calls to noreturn functions.
376 orc = orc_find(state->signal ? state->ip : state->ip - 1);
377 if (!orc)
378 goto err;
380 /* End-of-stack check for kernel threads: */
381 if (orc->sp_reg == ORC_REG_UNDEFINED) {
382 if (!orc->end)
383 goto err;
385 goto the_end;
388 /* Find the previous frame's stack: */
389 switch (orc->sp_reg) {
390 case ORC_REG_SP:
391 sp = state->sp + orc->sp_offset;
392 break;
394 case ORC_REG_BP:
395 sp = state->bp + orc->sp_offset;
396 break;
398 case ORC_REG_SP_INDIRECT:
399 sp = state->sp + orc->sp_offset;
400 indirect = true;
401 break;
403 case ORC_REG_BP_INDIRECT:
404 sp = state->bp + orc->sp_offset;
405 indirect = true;
406 break;
408 case ORC_REG_R10:
409 if (!state->regs || !state->full_regs) {
410 orc_warn("missing regs for base reg R10 at ip %pB\n",
411 (void *)state->ip);
412 goto err;
414 sp = state->regs->r10;
415 break;
417 case ORC_REG_R13:
418 if (!state->regs || !state->full_regs) {
419 orc_warn("missing regs for base reg R13 at ip %pB\n",
420 (void *)state->ip);
421 goto err;
423 sp = state->regs->r13;
424 break;
426 case ORC_REG_DI:
427 if (!state->regs || !state->full_regs) {
428 orc_warn("missing regs for base reg DI at ip %pB\n",
429 (void *)state->ip);
430 goto err;
432 sp = state->regs->di;
433 break;
435 case ORC_REG_DX:
436 if (!state->regs || !state->full_regs) {
437 orc_warn("missing regs for base reg DX at ip %pB\n",
438 (void *)state->ip);
439 goto err;
441 sp = state->regs->dx;
442 break;
444 default:
445 orc_warn("unknown SP base reg %d for ip %pB\n",
446 orc->sp_reg, (void *)state->ip);
447 goto err;
450 if (indirect) {
451 if (!deref_stack_reg(state, sp, &sp))
452 goto err;
455 /* Find IP, SP and possibly regs: */
456 switch (orc->type) {
457 case ORC_TYPE_CALL:
458 ip_p = sp - sizeof(long);
460 if (!deref_stack_reg(state, ip_p, &state->ip))
461 goto err;
463 state->ip = ftrace_graph_ret_addr(state->task, &state->graph_idx,
464 state->ip, (void *)ip_p);
466 state->sp = sp;
467 state->regs = NULL;
468 state->signal = false;
469 break;
471 case ORC_TYPE_REGS:
472 if (!deref_stack_regs(state, sp, &state->ip, &state->sp)) {
473 orc_warn("can't dereference registers at %p for ip %pB\n",
474 (void *)sp, (void *)orig_ip);
475 goto err;
478 state->regs = (struct pt_regs *)sp;
479 state->full_regs = true;
480 state->signal = true;
481 break;
483 case ORC_TYPE_REGS_IRET:
484 if (!deref_stack_iret_regs(state, sp, &state->ip, &state->sp)) {
485 orc_warn("can't dereference iret registers at %p for ip %pB\n",
486 (void *)sp, (void *)orig_ip);
487 goto err;
490 state->regs = (void *)sp - IRET_FRAME_OFFSET;
491 state->full_regs = false;
492 state->signal = true;
493 break;
495 default:
496 orc_warn("unknown .orc_unwind entry type %d for ip %pB\n",
497 orc->type, (void *)orig_ip);
498 break;
501 /* Find BP: */
502 switch (orc->bp_reg) {
503 case ORC_REG_UNDEFINED:
504 if (state->regs && state->full_regs)
505 state->bp = state->regs->bp;
506 break;
508 case ORC_REG_PREV_SP:
509 if (!deref_stack_reg(state, sp + orc->bp_offset, &state->bp))
510 goto err;
511 break;
513 case ORC_REG_BP:
514 if (!deref_stack_reg(state, state->bp + orc->bp_offset, &state->bp))
515 goto err;
516 break;
518 default:
519 orc_warn("unknown BP base reg %d for ip %pB\n",
520 orc->bp_reg, (void *)orig_ip);
521 goto err;
524 /* Prevent a recursive loop due to bad ORC data: */
525 if (state->stack_info.type == prev_type &&
526 on_stack(&state->stack_info, (void *)state->sp, sizeof(long)) &&
527 state->sp <= prev_sp) {
528 orc_warn("stack going in the wrong direction? ip=%pB\n",
529 (void *)orig_ip);
530 goto err;
533 preempt_enable();
534 return true;
536 err:
537 state->error = true;
539 the_end:
540 preempt_enable();
541 state->stack_info.type = STACK_TYPE_UNKNOWN;
542 return false;
544 EXPORT_SYMBOL_GPL(unwind_next_frame);
546 void __unwind_start(struct unwind_state *state, struct task_struct *task,
547 struct pt_regs *regs, unsigned long *first_frame)
549 memset(state, 0, sizeof(*state));
550 state->task = task;
553 * Refuse to unwind the stack of a task while it's executing on another
554 * CPU. This check is racy, but that's ok: the unwinder has other
555 * checks to prevent it from going off the rails.
557 if (task_on_another_cpu(task))
558 goto done;
560 if (regs) {
561 if (user_mode(regs))
562 goto done;
564 state->ip = regs->ip;
565 state->sp = kernel_stack_pointer(regs);
566 state->bp = regs->bp;
567 state->regs = regs;
568 state->full_regs = true;
569 state->signal = true;
571 } else if (task == current) {
572 asm volatile("lea (%%rip), %0\n\t"
573 "mov %%rsp, %1\n\t"
574 "mov %%rbp, %2\n\t"
575 : "=r" (state->ip), "=r" (state->sp),
576 "=r" (state->bp));
578 } else {
579 struct inactive_task_frame *frame = (void *)task->thread.sp;
581 state->sp = task->thread.sp;
582 state->bp = READ_ONCE_NOCHECK(frame->bp);
583 state->ip = READ_ONCE_NOCHECK(frame->ret_addr);
586 if (get_stack_info((unsigned long *)state->sp, state->task,
587 &state->stack_info, &state->stack_mask)) {
589 * We weren't on a valid stack. It's possible that
590 * we overflowed a valid stack into a guard page.
591 * See if the next page up is valid so that we can
592 * generate some kind of backtrace if this happens.
594 void *next_page = (void *)PAGE_ALIGN((unsigned long)state->sp);
595 if (get_stack_info(next_page, state->task, &state->stack_info,
596 &state->stack_mask))
597 return;
601 * The caller can provide the address of the first frame directly
602 * (first_frame) or indirectly (regs->sp) to indicate which stack frame
603 * to start unwinding at. Skip ahead until we reach it.
606 /* When starting from regs, skip the regs frame: */
607 if (regs) {
608 unwind_next_frame(state);
609 return;
612 /* Otherwise, skip ahead to the user-specified starting frame: */
613 while (!unwind_done(state) &&
614 (!on_stack(&state->stack_info, first_frame, sizeof(long)) ||
615 state->sp <= (unsigned long)first_frame))
616 unwind_next_frame(state);
618 return;
620 done:
621 state->stack_info.type = STACK_TYPE_UNKNOWN;
622 return;
624 EXPORT_SYMBOL_GPL(__unwind_start);