Linux 5.6.12
[linux/fpc-iii.git] / tools / objtool / check.c
blob95c485d3d4d83c56a7bcfd51135cb55795e744b3
1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /*
3 * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
4 */
6 #include <string.h>
7 #include <stdlib.h>
9 #include "builtin.h"
10 #include "check.h"
11 #include "elf.h"
12 #include "special.h"
13 #include "arch.h"
14 #include "warn.h"
16 #include <linux/hashtable.h>
17 #include <linux/kernel.h>
19 #define FAKE_JUMP_OFFSET -1
21 #define C_JUMP_TABLE_SECTION ".rodata..c_jump_table"
23 struct alternative {
24 struct list_head list;
25 struct instruction *insn;
26 bool skip_orig;
29 const char *objname;
30 struct cfi_state initial_func_cfi;
32 struct instruction *find_insn(struct objtool_file *file,
33 struct section *sec, unsigned long offset)
35 struct instruction *insn;
37 hash_for_each_possible(file->insn_hash, insn, hash, offset)
38 if (insn->sec == sec && insn->offset == offset)
39 return insn;
41 return NULL;
44 static struct instruction *next_insn_same_sec(struct objtool_file *file,
45 struct instruction *insn)
47 struct instruction *next = list_next_entry(insn, list);
49 if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
50 return NULL;
52 return next;
55 static struct instruction *next_insn_same_func(struct objtool_file *file,
56 struct instruction *insn)
58 struct instruction *next = list_next_entry(insn, list);
59 struct symbol *func = insn->func;
61 if (!func)
62 return NULL;
64 if (&next->list != &file->insn_list && next->func == func)
65 return next;
67 /* Check if we're already in the subfunction: */
68 if (func == func->cfunc)
69 return NULL;
71 /* Move to the subfunction: */
72 return find_insn(file, func->cfunc->sec, func->cfunc->offset);
75 #define func_for_each_insn_all(file, func, insn) \
76 for (insn = find_insn(file, func->sec, func->offset); \
77 insn; \
78 insn = next_insn_same_func(file, insn))
80 #define func_for_each_insn(file, func, insn) \
81 for (insn = find_insn(file, func->sec, func->offset); \
82 insn && &insn->list != &file->insn_list && \
83 insn->sec == func->sec && \
84 insn->offset < func->offset + func->len; \
85 insn = list_next_entry(insn, list))
87 #define func_for_each_insn_continue_reverse(file, func, insn) \
88 for (insn = list_prev_entry(insn, list); \
89 &insn->list != &file->insn_list && \
90 insn->sec == func->sec && insn->offset >= func->offset; \
91 insn = list_prev_entry(insn, list))
93 #define sec_for_each_insn_from(file, insn) \
94 for (; insn; insn = next_insn_same_sec(file, insn))
96 #define sec_for_each_insn_continue(file, insn) \
97 for (insn = next_insn_same_sec(file, insn); insn; \
98 insn = next_insn_same_sec(file, insn))
100 static bool is_sibling_call(struct instruction *insn)
102 /* An indirect jump is either a sibling call or a jump to a table. */
103 if (insn->type == INSN_JUMP_DYNAMIC)
104 return list_empty(&insn->alts);
106 if (insn->type != INSN_JUMP_CONDITIONAL &&
107 insn->type != INSN_JUMP_UNCONDITIONAL)
108 return false;
110 /* add_jump_destinations() sets insn->call_dest for sibling calls. */
111 return !!insn->call_dest;
115 * This checks to see if the given function is a "noreturn" function.
117 * For global functions which are outside the scope of this object file, we
118 * have to keep a manual list of them.
120 * For local functions, we have to detect them manually by simply looking for
121 * the lack of a return instruction.
123 static bool __dead_end_function(struct objtool_file *file, struct symbol *func,
124 int recursion)
126 int i;
127 struct instruction *insn;
128 bool empty = true;
131 * Unfortunately these have to be hard coded because the noreturn
132 * attribute isn't provided in ELF data.
134 static const char * const global_noreturns[] = {
135 "__stack_chk_fail",
136 "panic",
137 "do_exit",
138 "do_task_dead",
139 "__module_put_and_exit",
140 "complete_and_exit",
141 "__reiserfs_panic",
142 "lbug_with_loc",
143 "fortify_panic",
144 "usercopy_abort",
145 "machine_real_restart",
146 "rewind_stack_do_exit",
147 "kunit_try_catch_throw",
150 if (!func)
151 return false;
153 if (func->bind == STB_WEAK)
154 return false;
156 if (func->bind == STB_GLOBAL)
157 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
158 if (!strcmp(func->name, global_noreturns[i]))
159 return true;
161 if (!func->len)
162 return false;
164 insn = find_insn(file, func->sec, func->offset);
165 if (!insn->func)
166 return false;
168 func_for_each_insn_all(file, func, insn) {
169 empty = false;
171 if (insn->type == INSN_RETURN)
172 return false;
175 if (empty)
176 return false;
179 * A function can have a sibling call instead of a return. In that
180 * case, the function's dead-end status depends on whether the target
181 * of the sibling call returns.
183 func_for_each_insn_all(file, func, insn) {
184 if (is_sibling_call(insn)) {
185 struct instruction *dest = insn->jump_dest;
187 if (!dest)
188 /* sibling call to another file */
189 return false;
191 /* local sibling call */
192 if (recursion == 5) {
194 * Infinite recursion: two functions have
195 * sibling calls to each other. This is a very
196 * rare case. It means they aren't dead ends.
198 return false;
201 return __dead_end_function(file, dest->func, recursion+1);
205 return true;
208 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
210 return __dead_end_function(file, func, 0);
213 static void clear_insn_state(struct insn_state *state)
215 int i;
217 memset(state, 0, sizeof(*state));
218 state->cfa.base = CFI_UNDEFINED;
219 for (i = 0; i < CFI_NUM_REGS; i++) {
220 state->regs[i].base = CFI_UNDEFINED;
221 state->vals[i].base = CFI_UNDEFINED;
223 state->drap_reg = CFI_UNDEFINED;
224 state->drap_offset = -1;
228 * Call the arch-specific instruction decoder for all the instructions and add
229 * them to the global instruction list.
231 static int decode_instructions(struct objtool_file *file)
233 struct section *sec;
234 struct symbol *func;
235 unsigned long offset;
236 struct instruction *insn;
237 int ret;
239 for_each_sec(file, sec) {
241 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
242 continue;
244 if (strcmp(sec->name, ".altinstr_replacement") &&
245 strcmp(sec->name, ".altinstr_aux") &&
246 strncmp(sec->name, ".discard.", 9))
247 sec->text = true;
249 for (offset = 0; offset < sec->len; offset += insn->len) {
250 insn = malloc(sizeof(*insn));
251 if (!insn) {
252 WARN("malloc failed");
253 return -1;
255 memset(insn, 0, sizeof(*insn));
256 INIT_LIST_HEAD(&insn->alts);
257 clear_insn_state(&insn->state);
259 insn->sec = sec;
260 insn->offset = offset;
262 ret = arch_decode_instruction(file->elf, sec, offset,
263 sec->len - offset,
264 &insn->len, &insn->type,
265 &insn->immediate,
266 &insn->stack_op);
267 if (ret)
268 goto err;
270 hash_add(file->insn_hash, &insn->hash, insn->offset);
271 list_add_tail(&insn->list, &file->insn_list);
274 list_for_each_entry(func, &sec->symbol_list, list) {
275 if (func->type != STT_FUNC || func->alias != func)
276 continue;
278 if (!find_insn(file, sec, func->offset)) {
279 WARN("%s(): can't find starting instruction",
280 func->name);
281 return -1;
284 func_for_each_insn(file, func, insn)
285 insn->func = func;
289 return 0;
291 err:
292 free(insn);
293 return ret;
297 * Mark "ud2" instructions and manually annotated dead ends.
299 static int add_dead_ends(struct objtool_file *file)
301 struct section *sec;
302 struct rela *rela;
303 struct instruction *insn;
304 bool found;
307 * By default, "ud2" is a dead end unless otherwise annotated, because
308 * GCC 7 inserts it for certain divide-by-zero cases.
310 for_each_insn(file, insn)
311 if (insn->type == INSN_BUG)
312 insn->dead_end = true;
315 * Check for manually annotated dead ends.
317 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
318 if (!sec)
319 goto reachable;
321 list_for_each_entry(rela, &sec->rela_list, list) {
322 if (rela->sym->type != STT_SECTION) {
323 WARN("unexpected relocation symbol type in %s", sec->name);
324 return -1;
326 insn = find_insn(file, rela->sym->sec, rela->addend);
327 if (insn)
328 insn = list_prev_entry(insn, list);
329 else if (rela->addend == rela->sym->sec->len) {
330 found = false;
331 list_for_each_entry_reverse(insn, &file->insn_list, list) {
332 if (insn->sec == rela->sym->sec) {
333 found = true;
334 break;
338 if (!found) {
339 WARN("can't find unreachable insn at %s+0x%x",
340 rela->sym->sec->name, rela->addend);
341 return -1;
343 } else {
344 WARN("can't find unreachable insn at %s+0x%x",
345 rela->sym->sec->name, rela->addend);
346 return -1;
349 insn->dead_end = true;
352 reachable:
354 * These manually annotated reachable checks are needed for GCC 4.4,
355 * where the Linux unreachable() macro isn't supported. In that case
356 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
357 * not a dead end.
359 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
360 if (!sec)
361 return 0;
363 list_for_each_entry(rela, &sec->rela_list, list) {
364 if (rela->sym->type != STT_SECTION) {
365 WARN("unexpected relocation symbol type in %s", sec->name);
366 return -1;
368 insn = find_insn(file, rela->sym->sec, rela->addend);
369 if (insn)
370 insn = list_prev_entry(insn, list);
371 else if (rela->addend == rela->sym->sec->len) {
372 found = false;
373 list_for_each_entry_reverse(insn, &file->insn_list, list) {
374 if (insn->sec == rela->sym->sec) {
375 found = true;
376 break;
380 if (!found) {
381 WARN("can't find reachable insn at %s+0x%x",
382 rela->sym->sec->name, rela->addend);
383 return -1;
385 } else {
386 WARN("can't find reachable insn at %s+0x%x",
387 rela->sym->sec->name, rela->addend);
388 return -1;
391 insn->dead_end = false;
394 return 0;
398 * Warnings shouldn't be reported for ignored functions.
400 static void add_ignores(struct objtool_file *file)
402 struct instruction *insn;
403 struct section *sec;
404 struct symbol *func;
405 struct rela *rela;
407 sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
408 if (!sec)
409 return;
411 list_for_each_entry(rela, &sec->rela_list, list) {
412 switch (rela->sym->type) {
413 case STT_FUNC:
414 func = rela->sym;
415 break;
417 case STT_SECTION:
418 func = find_symbol_by_offset(rela->sym->sec, rela->addend);
419 if (!func || func->type != STT_FUNC)
420 continue;
421 break;
423 default:
424 WARN("unexpected relocation symbol type in %s: %d", sec->name, rela->sym->type);
425 continue;
428 func_for_each_insn_all(file, func, insn)
429 insn->ignore = true;
434 * This is a whitelist of functions that is allowed to be called with AC set.
435 * The list is meant to be minimal and only contains compiler instrumentation
436 * ABI and a few functions used to implement *_{to,from}_user() functions.
438 * These functions must not directly change AC, but may PUSHF/POPF.
440 static const char *uaccess_safe_builtin[] = {
441 /* KASAN */
442 "kasan_report",
443 "check_memory_region",
444 /* KASAN out-of-line */
445 "__asan_loadN_noabort",
446 "__asan_load1_noabort",
447 "__asan_load2_noabort",
448 "__asan_load4_noabort",
449 "__asan_load8_noabort",
450 "__asan_load16_noabort",
451 "__asan_storeN_noabort",
452 "__asan_store1_noabort",
453 "__asan_store2_noabort",
454 "__asan_store4_noabort",
455 "__asan_store8_noabort",
456 "__asan_store16_noabort",
457 /* KASAN in-line */
458 "__asan_report_load_n_noabort",
459 "__asan_report_load1_noabort",
460 "__asan_report_load2_noabort",
461 "__asan_report_load4_noabort",
462 "__asan_report_load8_noabort",
463 "__asan_report_load16_noabort",
464 "__asan_report_store_n_noabort",
465 "__asan_report_store1_noabort",
466 "__asan_report_store2_noabort",
467 "__asan_report_store4_noabort",
468 "__asan_report_store8_noabort",
469 "__asan_report_store16_noabort",
470 /* KCOV */
471 "write_comp_data",
472 "__sanitizer_cov_trace_pc",
473 "__sanitizer_cov_trace_const_cmp1",
474 "__sanitizer_cov_trace_const_cmp2",
475 "__sanitizer_cov_trace_const_cmp4",
476 "__sanitizer_cov_trace_const_cmp8",
477 "__sanitizer_cov_trace_cmp1",
478 "__sanitizer_cov_trace_cmp2",
479 "__sanitizer_cov_trace_cmp4",
480 "__sanitizer_cov_trace_cmp8",
481 /* UBSAN */
482 "ubsan_type_mismatch_common",
483 "__ubsan_handle_type_mismatch",
484 "__ubsan_handle_type_mismatch_v1",
485 "__ubsan_handle_shift_out_of_bounds",
486 /* misc */
487 "csum_partial_copy_generic",
488 "__memcpy_mcsafe",
489 "mcsafe_handle_tail",
490 "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
491 NULL
494 static void add_uaccess_safe(struct objtool_file *file)
496 struct symbol *func;
497 const char **name;
499 if (!uaccess)
500 return;
502 for (name = uaccess_safe_builtin; *name; name++) {
503 func = find_symbol_by_name(file->elf, *name);
504 if (!func)
505 continue;
507 func->uaccess_safe = true;
512 * FIXME: For now, just ignore any alternatives which add retpolines. This is
513 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
514 * But it at least allows objtool to understand the control flow *around* the
515 * retpoline.
517 static int add_ignore_alternatives(struct objtool_file *file)
519 struct section *sec;
520 struct rela *rela;
521 struct instruction *insn;
523 sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
524 if (!sec)
525 return 0;
527 list_for_each_entry(rela, &sec->rela_list, list) {
528 if (rela->sym->type != STT_SECTION) {
529 WARN("unexpected relocation symbol type in %s", sec->name);
530 return -1;
533 insn = find_insn(file, rela->sym->sec, rela->addend);
534 if (!insn) {
535 WARN("bad .discard.ignore_alts entry");
536 return -1;
539 insn->ignore_alts = true;
542 return 0;
546 * Find the destination instructions for all jumps.
548 static int add_jump_destinations(struct objtool_file *file)
550 struct instruction *insn;
551 struct rela *rela;
552 struct section *dest_sec;
553 unsigned long dest_off;
555 for_each_insn(file, insn) {
556 if (insn->type != INSN_JUMP_CONDITIONAL &&
557 insn->type != INSN_JUMP_UNCONDITIONAL)
558 continue;
560 if (insn->ignore || insn->offset == FAKE_JUMP_OFFSET)
561 continue;
563 rela = find_rela_by_dest_range(insn->sec, insn->offset,
564 insn->len);
565 if (!rela) {
566 dest_sec = insn->sec;
567 dest_off = insn->offset + insn->len + insn->immediate;
568 } else if (rela->sym->type == STT_SECTION) {
569 dest_sec = rela->sym->sec;
570 dest_off = rela->addend + 4;
571 } else if (rela->sym->sec->idx) {
572 dest_sec = rela->sym->sec;
573 dest_off = rela->sym->sym.st_value + rela->addend + 4;
574 } else if (strstr(rela->sym->name, "_indirect_thunk_")) {
576 * Retpoline jumps are really dynamic jumps in
577 * disguise, so convert them accordingly.
579 if (insn->type == INSN_JUMP_UNCONDITIONAL)
580 insn->type = INSN_JUMP_DYNAMIC;
581 else
582 insn->type = INSN_JUMP_DYNAMIC_CONDITIONAL;
584 insn->retpoline_safe = true;
585 continue;
586 } else {
587 /* external sibling call */
588 insn->call_dest = rela->sym;
589 continue;
592 insn->jump_dest = find_insn(file, dest_sec, dest_off);
593 if (!insn->jump_dest) {
596 * This is a special case where an alt instruction
597 * jumps past the end of the section. These are
598 * handled later in handle_group_alt().
600 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
601 continue;
603 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
604 insn->sec, insn->offset, dest_sec->name,
605 dest_off);
606 return -1;
610 * Cross-function jump.
612 if (insn->func && insn->jump_dest->func &&
613 insn->func != insn->jump_dest->func) {
616 * For GCC 8+, create parent/child links for any cold
617 * subfunctions. This is _mostly_ redundant with a
618 * similar initialization in read_symbols().
620 * If a function has aliases, we want the *first* such
621 * function in the symbol table to be the subfunction's
622 * parent. In that case we overwrite the
623 * initialization done in read_symbols().
625 * However this code can't completely replace the
626 * read_symbols() code because this doesn't detect the
627 * case where the parent function's only reference to a
628 * subfunction is through a jump table.
630 if (!strstr(insn->func->name, ".cold.") &&
631 strstr(insn->jump_dest->func->name, ".cold.")) {
632 insn->func->cfunc = insn->jump_dest->func;
633 insn->jump_dest->func->pfunc = insn->func;
635 } else if (insn->jump_dest->func->pfunc != insn->func->pfunc &&
636 insn->jump_dest->offset == insn->jump_dest->func->offset) {
638 /* internal sibling call */
639 insn->call_dest = insn->jump_dest->func;
644 return 0;
648 * Find the destination instructions for all calls.
650 static int add_call_destinations(struct objtool_file *file)
652 struct instruction *insn;
653 unsigned long dest_off;
654 struct rela *rela;
656 for_each_insn(file, insn) {
657 if (insn->type != INSN_CALL)
658 continue;
660 rela = find_rela_by_dest_range(insn->sec, insn->offset,
661 insn->len);
662 if (!rela) {
663 dest_off = insn->offset + insn->len + insn->immediate;
664 insn->call_dest = find_symbol_by_offset(insn->sec,
665 dest_off);
667 if (!insn->call_dest && !insn->ignore) {
668 WARN_FUNC("unsupported intra-function call",
669 insn->sec, insn->offset);
670 if (retpoline)
671 WARN("If this is a retpoline, please patch it in with alternatives and annotate it with ANNOTATE_NOSPEC_ALTERNATIVE.");
672 return -1;
675 } else if (rela->sym->type == STT_SECTION) {
676 insn->call_dest = find_symbol_by_offset(rela->sym->sec,
677 rela->addend+4);
678 if (!insn->call_dest ||
679 insn->call_dest->type != STT_FUNC) {
680 WARN_FUNC("can't find call dest symbol at %s+0x%x",
681 insn->sec, insn->offset,
682 rela->sym->sec->name,
683 rela->addend + 4);
684 return -1;
686 } else
687 insn->call_dest = rela->sym;
690 return 0;
694 * The .alternatives section requires some extra special care, over and above
695 * what other special sections require:
697 * 1. Because alternatives are patched in-place, we need to insert a fake jump
698 * instruction at the end so that validate_branch() skips all the original
699 * replaced instructions when validating the new instruction path.
701 * 2. An added wrinkle is that the new instruction length might be zero. In
702 * that case the old instructions are replaced with noops. We simulate that
703 * by creating a fake jump as the only new instruction.
705 * 3. In some cases, the alternative section includes an instruction which
706 * conditionally jumps to the _end_ of the entry. We have to modify these
707 * jumps' destinations to point back to .text rather than the end of the
708 * entry in .altinstr_replacement.
710 static int handle_group_alt(struct objtool_file *file,
711 struct special_alt *special_alt,
712 struct instruction *orig_insn,
713 struct instruction **new_insn)
715 struct instruction *last_orig_insn, *last_new_insn, *insn, *fake_jump = NULL;
716 unsigned long dest_off;
718 last_orig_insn = NULL;
719 insn = orig_insn;
720 sec_for_each_insn_from(file, insn) {
721 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
722 break;
724 insn->alt_group = true;
725 last_orig_insn = insn;
728 if (next_insn_same_sec(file, last_orig_insn)) {
729 fake_jump = malloc(sizeof(*fake_jump));
730 if (!fake_jump) {
731 WARN("malloc failed");
732 return -1;
734 memset(fake_jump, 0, sizeof(*fake_jump));
735 INIT_LIST_HEAD(&fake_jump->alts);
736 clear_insn_state(&fake_jump->state);
738 fake_jump->sec = special_alt->new_sec;
739 fake_jump->offset = FAKE_JUMP_OFFSET;
740 fake_jump->type = INSN_JUMP_UNCONDITIONAL;
741 fake_jump->jump_dest = list_next_entry(last_orig_insn, list);
742 fake_jump->func = orig_insn->func;
745 if (!special_alt->new_len) {
746 if (!fake_jump) {
747 WARN("%s: empty alternative at end of section",
748 special_alt->orig_sec->name);
749 return -1;
752 *new_insn = fake_jump;
753 return 0;
756 last_new_insn = NULL;
757 insn = *new_insn;
758 sec_for_each_insn_from(file, insn) {
759 if (insn->offset >= special_alt->new_off + special_alt->new_len)
760 break;
762 last_new_insn = insn;
764 insn->ignore = orig_insn->ignore_alts;
765 insn->func = orig_insn->func;
767 if (insn->type != INSN_JUMP_CONDITIONAL &&
768 insn->type != INSN_JUMP_UNCONDITIONAL)
769 continue;
771 if (!insn->immediate)
772 continue;
774 dest_off = insn->offset + insn->len + insn->immediate;
775 if (dest_off == special_alt->new_off + special_alt->new_len) {
776 if (!fake_jump) {
777 WARN("%s: alternative jump to end of section",
778 special_alt->orig_sec->name);
779 return -1;
781 insn->jump_dest = fake_jump;
784 if (!insn->jump_dest) {
785 WARN_FUNC("can't find alternative jump destination",
786 insn->sec, insn->offset);
787 return -1;
791 if (!last_new_insn) {
792 WARN_FUNC("can't find last new alternative instruction",
793 special_alt->new_sec, special_alt->new_off);
794 return -1;
797 if (fake_jump)
798 list_add(&fake_jump->list, &last_new_insn->list);
800 return 0;
804 * A jump table entry can either convert a nop to a jump or a jump to a nop.
805 * If the original instruction is a jump, make the alt entry an effective nop
806 * by just skipping the original instruction.
808 static int handle_jump_alt(struct objtool_file *file,
809 struct special_alt *special_alt,
810 struct instruction *orig_insn,
811 struct instruction **new_insn)
813 if (orig_insn->type == INSN_NOP)
814 return 0;
816 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL) {
817 WARN_FUNC("unsupported instruction at jump label",
818 orig_insn->sec, orig_insn->offset);
819 return -1;
822 *new_insn = list_next_entry(orig_insn, list);
823 return 0;
827 * Read all the special sections which have alternate instructions which can be
828 * patched in or redirected to at runtime. Each instruction having alternate
829 * instruction(s) has them added to its insn->alts list, which will be
830 * traversed in validate_branch().
832 static int add_special_section_alts(struct objtool_file *file)
834 struct list_head special_alts;
835 struct instruction *orig_insn, *new_insn;
836 struct special_alt *special_alt, *tmp;
837 struct alternative *alt;
838 int ret;
840 ret = special_get_alts(file->elf, &special_alts);
841 if (ret)
842 return ret;
844 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
846 orig_insn = find_insn(file, special_alt->orig_sec,
847 special_alt->orig_off);
848 if (!orig_insn) {
849 WARN_FUNC("special: can't find orig instruction",
850 special_alt->orig_sec, special_alt->orig_off);
851 ret = -1;
852 goto out;
855 new_insn = NULL;
856 if (!special_alt->group || special_alt->new_len) {
857 new_insn = find_insn(file, special_alt->new_sec,
858 special_alt->new_off);
859 if (!new_insn) {
860 WARN_FUNC("special: can't find new instruction",
861 special_alt->new_sec,
862 special_alt->new_off);
863 ret = -1;
864 goto out;
868 if (special_alt->group) {
869 ret = handle_group_alt(file, special_alt, orig_insn,
870 &new_insn);
871 if (ret)
872 goto out;
873 } else if (special_alt->jump_or_nop) {
874 ret = handle_jump_alt(file, special_alt, orig_insn,
875 &new_insn);
876 if (ret)
877 goto out;
880 alt = malloc(sizeof(*alt));
881 if (!alt) {
882 WARN("malloc failed");
883 ret = -1;
884 goto out;
887 alt->insn = new_insn;
888 alt->skip_orig = special_alt->skip_orig;
889 orig_insn->ignore_alts |= special_alt->skip_alt;
890 list_add_tail(&alt->list, &orig_insn->alts);
892 list_del(&special_alt->list);
893 free(special_alt);
896 out:
897 return ret;
900 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
901 struct rela *table)
903 struct rela *rela = table;
904 struct instruction *dest_insn;
905 struct alternative *alt;
906 struct symbol *pfunc = insn->func->pfunc;
907 unsigned int prev_offset = 0;
910 * Each @rela is a switch table relocation which points to the target
911 * instruction.
913 list_for_each_entry_from(rela, &table->sec->rela_list, list) {
915 /* Check for the end of the table: */
916 if (rela != table && rela->jump_table_start)
917 break;
919 /* Make sure the table entries are consecutive: */
920 if (prev_offset && rela->offset != prev_offset + 8)
921 break;
923 /* Detect function pointers from contiguous objects: */
924 if (rela->sym->sec == pfunc->sec &&
925 rela->addend == pfunc->offset)
926 break;
928 dest_insn = find_insn(file, rela->sym->sec, rela->addend);
929 if (!dest_insn)
930 break;
932 /* Make sure the destination is in the same function: */
933 if (!dest_insn->func || dest_insn->func->pfunc != pfunc)
934 break;
936 alt = malloc(sizeof(*alt));
937 if (!alt) {
938 WARN("malloc failed");
939 return -1;
942 alt->insn = dest_insn;
943 list_add_tail(&alt->list, &insn->alts);
944 prev_offset = rela->offset;
947 if (!prev_offset) {
948 WARN_FUNC("can't find switch jump table",
949 insn->sec, insn->offset);
950 return -1;
953 return 0;
957 * find_jump_table() - Given a dynamic jump, find the switch jump table in
958 * .rodata associated with it.
960 * There are 3 basic patterns:
962 * 1. jmpq *[rodata addr](,%reg,8)
964 * This is the most common case by far. It jumps to an address in a simple
965 * jump table which is stored in .rodata.
967 * 2. jmpq *[rodata addr](%rip)
969 * This is caused by a rare GCC quirk, currently only seen in three driver
970 * functions in the kernel, only with certain obscure non-distro configs.
972 * As part of an optimization, GCC makes a copy of an existing switch jump
973 * table, modifies it, and then hard-codes the jump (albeit with an indirect
974 * jump) to use a single entry in the table. The rest of the jump table and
975 * some of its jump targets remain as dead code.
977 * In such a case we can just crudely ignore all unreachable instruction
978 * warnings for the entire object file. Ideally we would just ignore them
979 * for the function, but that would require redesigning the code quite a
980 * bit. And honestly that's just not worth doing: unreachable instruction
981 * warnings are of questionable value anyway, and this is such a rare issue.
983 * 3. mov [rodata addr],%reg1
984 * ... some instructions ...
985 * jmpq *(%reg1,%reg2,8)
987 * This is a fairly uncommon pattern which is new for GCC 6. As of this
988 * writing, there are 11 occurrences of it in the allmodconfig kernel.
990 * As of GCC 7 there are quite a few more of these and the 'in between' code
991 * is significant. Esp. with KASAN enabled some of the code between the mov
992 * and jmpq uses .rodata itself, which can confuse things.
994 * TODO: Once we have DWARF CFI and smarter instruction decoding logic,
995 * ensure the same register is used in the mov and jump instructions.
997 * NOTE: RETPOLINE made it harder still to decode dynamic jumps.
999 static struct rela *find_jump_table(struct objtool_file *file,
1000 struct symbol *func,
1001 struct instruction *insn)
1003 struct rela *text_rela, *table_rela;
1004 struct instruction *orig_insn = insn;
1005 struct section *table_sec;
1006 unsigned long table_offset;
1009 * Backward search using the @first_jump_src links, these help avoid
1010 * much of the 'in between' code. Which avoids us getting confused by
1011 * it.
1013 for (;
1014 &insn->list != &file->insn_list && insn->func && insn->func->pfunc == func;
1015 insn = insn->first_jump_src ?: list_prev_entry(insn, list)) {
1017 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1018 break;
1020 /* allow small jumps within the range */
1021 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1022 insn->jump_dest &&
1023 (insn->jump_dest->offset <= insn->offset ||
1024 insn->jump_dest->offset > orig_insn->offset))
1025 break;
1027 /* look for a relocation which references .rodata */
1028 text_rela = find_rela_by_dest_range(insn->sec, insn->offset,
1029 insn->len);
1030 if (!text_rela || text_rela->sym->type != STT_SECTION ||
1031 !text_rela->sym->sec->rodata)
1032 continue;
1034 table_offset = text_rela->addend;
1035 table_sec = text_rela->sym->sec;
1037 if (text_rela->type == R_X86_64_PC32)
1038 table_offset += 4;
1041 * Make sure the .rodata address isn't associated with a
1042 * symbol. GCC jump tables are anonymous data.
1044 * Also support C jump tables which are in the same format as
1045 * switch jump tables. For objtool to recognize them, they
1046 * need to be placed in the C_JUMP_TABLE_SECTION section. They
1047 * have symbols associated with them.
1049 if (find_symbol_containing(table_sec, table_offset) &&
1050 strcmp(table_sec->name, C_JUMP_TABLE_SECTION))
1051 continue;
1053 /* Each table entry has a rela associated with it. */
1054 table_rela = find_rela_by_dest(table_sec, table_offset);
1055 if (!table_rela)
1056 continue;
1059 * Use of RIP-relative switch jumps is quite rare, and
1060 * indicates a rare GCC quirk/bug which can leave dead code
1061 * behind.
1063 if (text_rela->type == R_X86_64_PC32)
1064 file->ignore_unreachables = true;
1066 return table_rela;
1069 return NULL;
1073 * First pass: Mark the head of each jump table so that in the next pass,
1074 * we know when a given jump table ends and the next one starts.
1076 static void mark_func_jump_tables(struct objtool_file *file,
1077 struct symbol *func)
1079 struct instruction *insn, *last = NULL;
1080 struct rela *rela;
1082 func_for_each_insn_all(file, func, insn) {
1083 if (!last)
1084 last = insn;
1087 * Store back-pointers for unconditional forward jumps such
1088 * that find_jump_table() can back-track using those and
1089 * avoid some potentially confusing code.
1091 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1092 insn->offset > last->offset &&
1093 insn->jump_dest->offset > insn->offset &&
1094 !insn->jump_dest->first_jump_src) {
1096 insn->jump_dest->first_jump_src = insn;
1097 last = insn->jump_dest;
1100 if (insn->type != INSN_JUMP_DYNAMIC)
1101 continue;
1103 rela = find_jump_table(file, func, insn);
1104 if (rela) {
1105 rela->jump_table_start = true;
1106 insn->jump_table = rela;
1111 static int add_func_jump_tables(struct objtool_file *file,
1112 struct symbol *func)
1114 struct instruction *insn;
1115 int ret;
1117 func_for_each_insn_all(file, func, insn) {
1118 if (!insn->jump_table)
1119 continue;
1121 ret = add_jump_table(file, insn, insn->jump_table);
1122 if (ret)
1123 return ret;
1126 return 0;
1130 * For some switch statements, gcc generates a jump table in the .rodata
1131 * section which contains a list of addresses within the function to jump to.
1132 * This finds these jump tables and adds them to the insn->alts lists.
1134 static int add_jump_table_alts(struct objtool_file *file)
1136 struct section *sec;
1137 struct symbol *func;
1138 int ret;
1140 if (!file->rodata)
1141 return 0;
1143 for_each_sec(file, sec) {
1144 list_for_each_entry(func, &sec->symbol_list, list) {
1145 if (func->type != STT_FUNC)
1146 continue;
1148 mark_func_jump_tables(file, func);
1149 ret = add_func_jump_tables(file, func);
1150 if (ret)
1151 return ret;
1155 return 0;
1158 static int read_unwind_hints(struct objtool_file *file)
1160 struct section *sec, *relasec;
1161 struct rela *rela;
1162 struct unwind_hint *hint;
1163 struct instruction *insn;
1164 struct cfi_reg *cfa;
1165 int i;
1167 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
1168 if (!sec)
1169 return 0;
1171 relasec = sec->rela;
1172 if (!relasec) {
1173 WARN("missing .rela.discard.unwind_hints section");
1174 return -1;
1177 if (sec->len % sizeof(struct unwind_hint)) {
1178 WARN("struct unwind_hint size mismatch");
1179 return -1;
1182 file->hints = true;
1184 for (i = 0; i < sec->len / sizeof(struct unwind_hint); i++) {
1185 hint = (struct unwind_hint *)sec->data->d_buf + i;
1187 rela = find_rela_by_dest(sec, i * sizeof(*hint));
1188 if (!rela) {
1189 WARN("can't find rela for unwind_hints[%d]", i);
1190 return -1;
1193 insn = find_insn(file, rela->sym->sec, rela->addend);
1194 if (!insn) {
1195 WARN("can't find insn for unwind_hints[%d]", i);
1196 return -1;
1199 cfa = &insn->state.cfa;
1201 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
1202 insn->save = true;
1203 continue;
1205 } else if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
1206 insn->restore = true;
1207 insn->hint = true;
1208 continue;
1211 insn->hint = true;
1213 switch (hint->sp_reg) {
1214 case ORC_REG_UNDEFINED:
1215 cfa->base = CFI_UNDEFINED;
1216 break;
1217 case ORC_REG_SP:
1218 cfa->base = CFI_SP;
1219 break;
1220 case ORC_REG_BP:
1221 cfa->base = CFI_BP;
1222 break;
1223 case ORC_REG_SP_INDIRECT:
1224 cfa->base = CFI_SP_INDIRECT;
1225 break;
1226 case ORC_REG_R10:
1227 cfa->base = CFI_R10;
1228 break;
1229 case ORC_REG_R13:
1230 cfa->base = CFI_R13;
1231 break;
1232 case ORC_REG_DI:
1233 cfa->base = CFI_DI;
1234 break;
1235 case ORC_REG_DX:
1236 cfa->base = CFI_DX;
1237 break;
1238 default:
1239 WARN_FUNC("unsupported unwind_hint sp base reg %d",
1240 insn->sec, insn->offset, hint->sp_reg);
1241 return -1;
1244 cfa->offset = hint->sp_offset;
1245 insn->state.type = hint->type;
1246 insn->state.end = hint->end;
1249 return 0;
1252 static int read_retpoline_hints(struct objtool_file *file)
1254 struct section *sec;
1255 struct instruction *insn;
1256 struct rela *rela;
1258 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
1259 if (!sec)
1260 return 0;
1262 list_for_each_entry(rela, &sec->rela_list, list) {
1263 if (rela->sym->type != STT_SECTION) {
1264 WARN("unexpected relocation symbol type in %s", sec->name);
1265 return -1;
1268 insn = find_insn(file, rela->sym->sec, rela->addend);
1269 if (!insn) {
1270 WARN("bad .discard.retpoline_safe entry");
1271 return -1;
1274 if (insn->type != INSN_JUMP_DYNAMIC &&
1275 insn->type != INSN_CALL_DYNAMIC) {
1276 WARN_FUNC("retpoline_safe hint not an indirect jump/call",
1277 insn->sec, insn->offset);
1278 return -1;
1281 insn->retpoline_safe = true;
1284 return 0;
1287 static void mark_rodata(struct objtool_file *file)
1289 struct section *sec;
1290 bool found = false;
1293 * Search for the following rodata sections, each of which can
1294 * potentially contain jump tables:
1296 * - .rodata: can contain GCC switch tables
1297 * - .rodata.<func>: same, if -fdata-sections is being used
1298 * - .rodata..c_jump_table: contains C annotated jump tables
1300 * .rodata.str1.* sections are ignored; they don't contain jump tables.
1302 for_each_sec(file, sec) {
1303 if ((!strncmp(sec->name, ".rodata", 7) && !strstr(sec->name, ".str1.")) ||
1304 !strcmp(sec->name, C_JUMP_TABLE_SECTION)) {
1305 sec->rodata = true;
1306 found = true;
1310 file->rodata = found;
1313 static int decode_sections(struct objtool_file *file)
1315 int ret;
1317 mark_rodata(file);
1319 ret = decode_instructions(file);
1320 if (ret)
1321 return ret;
1323 ret = add_dead_ends(file);
1324 if (ret)
1325 return ret;
1327 add_ignores(file);
1328 add_uaccess_safe(file);
1330 ret = add_ignore_alternatives(file);
1331 if (ret)
1332 return ret;
1334 ret = add_jump_destinations(file);
1335 if (ret)
1336 return ret;
1338 ret = add_special_section_alts(file);
1339 if (ret)
1340 return ret;
1342 ret = add_call_destinations(file);
1343 if (ret)
1344 return ret;
1346 ret = add_jump_table_alts(file);
1347 if (ret)
1348 return ret;
1350 ret = read_unwind_hints(file);
1351 if (ret)
1352 return ret;
1354 ret = read_retpoline_hints(file);
1355 if (ret)
1356 return ret;
1358 return 0;
1361 static bool is_fentry_call(struct instruction *insn)
1363 if (insn->type == INSN_CALL &&
1364 insn->call_dest->type == STT_NOTYPE &&
1365 !strcmp(insn->call_dest->name, "__fentry__"))
1366 return true;
1368 return false;
1371 static bool has_modified_stack_frame(struct insn_state *state)
1373 int i;
1375 if (state->cfa.base != initial_func_cfi.cfa.base ||
1376 state->cfa.offset != initial_func_cfi.cfa.offset ||
1377 state->stack_size != initial_func_cfi.cfa.offset ||
1378 state->drap)
1379 return true;
1381 for (i = 0; i < CFI_NUM_REGS; i++)
1382 if (state->regs[i].base != initial_func_cfi.regs[i].base ||
1383 state->regs[i].offset != initial_func_cfi.regs[i].offset)
1384 return true;
1386 return false;
1389 static bool has_valid_stack_frame(struct insn_state *state)
1391 if (state->cfa.base == CFI_BP && state->regs[CFI_BP].base == CFI_CFA &&
1392 state->regs[CFI_BP].offset == -16)
1393 return true;
1395 if (state->drap && state->regs[CFI_BP].base == CFI_BP)
1396 return true;
1398 return false;
1401 static int update_insn_state_regs(struct instruction *insn, struct insn_state *state)
1403 struct cfi_reg *cfa = &state->cfa;
1404 struct stack_op *op = &insn->stack_op;
1406 if (cfa->base != CFI_SP)
1407 return 0;
1409 /* push */
1410 if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
1411 cfa->offset += 8;
1413 /* pop */
1414 if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
1415 cfa->offset -= 8;
1417 /* add immediate to sp */
1418 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
1419 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
1420 cfa->offset -= op->src.offset;
1422 return 0;
1425 static void save_reg(struct insn_state *state, unsigned char reg, int base,
1426 int offset)
1428 if (arch_callee_saved_reg(reg) &&
1429 state->regs[reg].base == CFI_UNDEFINED) {
1430 state->regs[reg].base = base;
1431 state->regs[reg].offset = offset;
1435 static void restore_reg(struct insn_state *state, unsigned char reg)
1437 state->regs[reg].base = CFI_UNDEFINED;
1438 state->regs[reg].offset = 0;
1442 * A note about DRAP stack alignment:
1444 * GCC has the concept of a DRAP register, which is used to help keep track of
1445 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
1446 * register. The typical DRAP pattern is:
1448 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
1449 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
1450 * 41 ff 72 f8 pushq -0x8(%r10)
1451 * 55 push %rbp
1452 * 48 89 e5 mov %rsp,%rbp
1453 * (more pushes)
1454 * 41 52 push %r10
1455 * ...
1456 * 41 5a pop %r10
1457 * (more pops)
1458 * 5d pop %rbp
1459 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1460 * c3 retq
1462 * There are some variations in the epilogues, like:
1464 * 5b pop %rbx
1465 * 41 5a pop %r10
1466 * 41 5c pop %r12
1467 * 41 5d pop %r13
1468 * 41 5e pop %r14
1469 * c9 leaveq
1470 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1471 * c3 retq
1473 * and:
1475 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
1476 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
1477 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
1478 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
1479 * c9 leaveq
1480 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1481 * c3 retq
1483 * Sometimes r13 is used as the DRAP register, in which case it's saved and
1484 * restored beforehand:
1486 * 41 55 push %r13
1487 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
1488 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
1489 * ...
1490 * 49 8d 65 f0 lea -0x10(%r13),%rsp
1491 * 41 5d pop %r13
1492 * c3 retq
1494 static int update_insn_state(struct instruction *insn, struct insn_state *state)
1496 struct stack_op *op = &insn->stack_op;
1497 struct cfi_reg *cfa = &state->cfa;
1498 struct cfi_reg *regs = state->regs;
1500 /* stack operations don't make sense with an undefined CFA */
1501 if (cfa->base == CFI_UNDEFINED) {
1502 if (insn->func) {
1503 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
1504 return -1;
1506 return 0;
1509 if (state->type == ORC_TYPE_REGS || state->type == ORC_TYPE_REGS_IRET)
1510 return update_insn_state_regs(insn, state);
1512 switch (op->dest.type) {
1514 case OP_DEST_REG:
1515 switch (op->src.type) {
1517 case OP_SRC_REG:
1518 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
1519 cfa->base == CFI_SP &&
1520 regs[CFI_BP].base == CFI_CFA &&
1521 regs[CFI_BP].offset == -cfa->offset) {
1523 /* mov %rsp, %rbp */
1524 cfa->base = op->dest.reg;
1525 state->bp_scratch = false;
1528 else if (op->src.reg == CFI_SP &&
1529 op->dest.reg == CFI_BP && state->drap) {
1531 /* drap: mov %rsp, %rbp */
1532 regs[CFI_BP].base = CFI_BP;
1533 regs[CFI_BP].offset = -state->stack_size;
1534 state->bp_scratch = false;
1537 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1540 * mov %rsp, %reg
1542 * This is needed for the rare case where GCC
1543 * does:
1545 * mov %rsp, %rax
1546 * ...
1547 * mov %rax, %rsp
1549 state->vals[op->dest.reg].base = CFI_CFA;
1550 state->vals[op->dest.reg].offset = -state->stack_size;
1553 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
1554 cfa->base == CFI_BP) {
1557 * mov %rbp, %rsp
1559 * Restore the original stack pointer (Clang).
1561 state->stack_size = -state->regs[CFI_BP].offset;
1564 else if (op->dest.reg == cfa->base) {
1566 /* mov %reg, %rsp */
1567 if (cfa->base == CFI_SP &&
1568 state->vals[op->src.reg].base == CFI_CFA) {
1571 * This is needed for the rare case
1572 * where GCC does something dumb like:
1574 * lea 0x8(%rsp), %rcx
1575 * ...
1576 * mov %rcx, %rsp
1578 cfa->offset = -state->vals[op->src.reg].offset;
1579 state->stack_size = cfa->offset;
1581 } else {
1582 cfa->base = CFI_UNDEFINED;
1583 cfa->offset = 0;
1587 break;
1589 case OP_SRC_ADD:
1590 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
1592 /* add imm, %rsp */
1593 state->stack_size -= op->src.offset;
1594 if (cfa->base == CFI_SP)
1595 cfa->offset -= op->src.offset;
1596 break;
1599 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
1601 /* lea disp(%rbp), %rsp */
1602 state->stack_size = -(op->src.offset + regs[CFI_BP].offset);
1603 break;
1606 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1608 /* drap: lea disp(%rsp), %drap */
1609 state->drap_reg = op->dest.reg;
1612 * lea disp(%rsp), %reg
1614 * This is needed for the rare case where GCC
1615 * does something dumb like:
1617 * lea 0x8(%rsp), %rcx
1618 * ...
1619 * mov %rcx, %rsp
1621 state->vals[op->dest.reg].base = CFI_CFA;
1622 state->vals[op->dest.reg].offset = \
1623 -state->stack_size + op->src.offset;
1625 break;
1628 if (state->drap && op->dest.reg == CFI_SP &&
1629 op->src.reg == state->drap_reg) {
1631 /* drap: lea disp(%drap), %rsp */
1632 cfa->base = CFI_SP;
1633 cfa->offset = state->stack_size = -op->src.offset;
1634 state->drap_reg = CFI_UNDEFINED;
1635 state->drap = false;
1636 break;
1639 if (op->dest.reg == state->cfa.base) {
1640 WARN_FUNC("unsupported stack register modification",
1641 insn->sec, insn->offset);
1642 return -1;
1645 break;
1647 case OP_SRC_AND:
1648 if (op->dest.reg != CFI_SP ||
1649 (state->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
1650 (state->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
1651 WARN_FUNC("unsupported stack pointer realignment",
1652 insn->sec, insn->offset);
1653 return -1;
1656 if (state->drap_reg != CFI_UNDEFINED) {
1657 /* drap: and imm, %rsp */
1658 cfa->base = state->drap_reg;
1659 cfa->offset = state->stack_size = 0;
1660 state->drap = true;
1664 * Older versions of GCC (4.8ish) realign the stack
1665 * without DRAP, with a frame pointer.
1668 break;
1670 case OP_SRC_POP:
1671 case OP_SRC_POPF:
1672 if (!state->drap && op->dest.type == OP_DEST_REG &&
1673 op->dest.reg == cfa->base) {
1675 /* pop %rbp */
1676 cfa->base = CFI_SP;
1679 if (state->drap && cfa->base == CFI_BP_INDIRECT &&
1680 op->dest.type == OP_DEST_REG &&
1681 op->dest.reg == state->drap_reg &&
1682 state->drap_offset == -state->stack_size) {
1684 /* drap: pop %drap */
1685 cfa->base = state->drap_reg;
1686 cfa->offset = 0;
1687 state->drap_offset = -1;
1689 } else if (regs[op->dest.reg].offset == -state->stack_size) {
1691 /* pop %reg */
1692 restore_reg(state, op->dest.reg);
1695 state->stack_size -= 8;
1696 if (cfa->base == CFI_SP)
1697 cfa->offset -= 8;
1699 break;
1701 case OP_SRC_REG_INDIRECT:
1702 if (state->drap && op->src.reg == CFI_BP &&
1703 op->src.offset == state->drap_offset) {
1705 /* drap: mov disp(%rbp), %drap */
1706 cfa->base = state->drap_reg;
1707 cfa->offset = 0;
1708 state->drap_offset = -1;
1711 if (state->drap && op->src.reg == CFI_BP &&
1712 op->src.offset == regs[op->dest.reg].offset) {
1714 /* drap: mov disp(%rbp), %reg */
1715 restore_reg(state, op->dest.reg);
1717 } else if (op->src.reg == cfa->base &&
1718 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
1720 /* mov disp(%rbp), %reg */
1721 /* mov disp(%rsp), %reg */
1722 restore_reg(state, op->dest.reg);
1725 break;
1727 default:
1728 WARN_FUNC("unknown stack-related instruction",
1729 insn->sec, insn->offset);
1730 return -1;
1733 break;
1735 case OP_DEST_PUSH:
1736 case OP_DEST_PUSHF:
1737 state->stack_size += 8;
1738 if (cfa->base == CFI_SP)
1739 cfa->offset += 8;
1741 if (op->src.type != OP_SRC_REG)
1742 break;
1744 if (state->drap) {
1745 if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1747 /* drap: push %drap */
1748 cfa->base = CFI_BP_INDIRECT;
1749 cfa->offset = -state->stack_size;
1751 /* save drap so we know when to restore it */
1752 state->drap_offset = -state->stack_size;
1754 } else if (op->src.reg == CFI_BP && cfa->base == state->drap_reg) {
1756 /* drap: push %rbp */
1757 state->stack_size = 0;
1759 } else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1761 /* drap: push %reg */
1762 save_reg(state, op->src.reg, CFI_BP, -state->stack_size);
1765 } else {
1767 /* push %reg */
1768 save_reg(state, op->src.reg, CFI_CFA, -state->stack_size);
1771 /* detect when asm code uses rbp as a scratch register */
1772 if (!no_fp && insn->func && op->src.reg == CFI_BP &&
1773 cfa->base != CFI_BP)
1774 state->bp_scratch = true;
1775 break;
1777 case OP_DEST_REG_INDIRECT:
1779 if (state->drap) {
1780 if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1782 /* drap: mov %drap, disp(%rbp) */
1783 cfa->base = CFI_BP_INDIRECT;
1784 cfa->offset = op->dest.offset;
1786 /* save drap offset so we know when to restore it */
1787 state->drap_offset = op->dest.offset;
1790 else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1792 /* drap: mov reg, disp(%rbp) */
1793 save_reg(state, op->src.reg, CFI_BP, op->dest.offset);
1796 } else if (op->dest.reg == cfa->base) {
1798 /* mov reg, disp(%rbp) */
1799 /* mov reg, disp(%rsp) */
1800 save_reg(state, op->src.reg, CFI_CFA,
1801 op->dest.offset - state->cfa.offset);
1804 break;
1806 case OP_DEST_LEAVE:
1807 if ((!state->drap && cfa->base != CFI_BP) ||
1808 (state->drap && cfa->base != state->drap_reg)) {
1809 WARN_FUNC("leave instruction with modified stack frame",
1810 insn->sec, insn->offset);
1811 return -1;
1814 /* leave (mov %rbp, %rsp; pop %rbp) */
1816 state->stack_size = -state->regs[CFI_BP].offset - 8;
1817 restore_reg(state, CFI_BP);
1819 if (!state->drap) {
1820 cfa->base = CFI_SP;
1821 cfa->offset -= 8;
1824 break;
1826 case OP_DEST_MEM:
1827 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
1828 WARN_FUNC("unknown stack-related memory operation",
1829 insn->sec, insn->offset);
1830 return -1;
1833 /* pop mem */
1834 state->stack_size -= 8;
1835 if (cfa->base == CFI_SP)
1836 cfa->offset -= 8;
1838 break;
1840 default:
1841 WARN_FUNC("unknown stack-related instruction",
1842 insn->sec, insn->offset);
1843 return -1;
1846 return 0;
1849 static bool insn_state_match(struct instruction *insn, struct insn_state *state)
1851 struct insn_state *state1 = &insn->state, *state2 = state;
1852 int i;
1854 if (memcmp(&state1->cfa, &state2->cfa, sizeof(state1->cfa))) {
1855 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
1856 insn->sec, insn->offset,
1857 state1->cfa.base, state1->cfa.offset,
1858 state2->cfa.base, state2->cfa.offset);
1860 } else if (memcmp(&state1->regs, &state2->regs, sizeof(state1->regs))) {
1861 for (i = 0; i < CFI_NUM_REGS; i++) {
1862 if (!memcmp(&state1->regs[i], &state2->regs[i],
1863 sizeof(struct cfi_reg)))
1864 continue;
1866 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
1867 insn->sec, insn->offset,
1868 i, state1->regs[i].base, state1->regs[i].offset,
1869 i, state2->regs[i].base, state2->regs[i].offset);
1870 break;
1873 } else if (state1->type != state2->type) {
1874 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
1875 insn->sec, insn->offset, state1->type, state2->type);
1877 } else if (state1->drap != state2->drap ||
1878 (state1->drap && state1->drap_reg != state2->drap_reg) ||
1879 (state1->drap && state1->drap_offset != state2->drap_offset)) {
1880 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
1881 insn->sec, insn->offset,
1882 state1->drap, state1->drap_reg, state1->drap_offset,
1883 state2->drap, state2->drap_reg, state2->drap_offset);
1885 } else
1886 return true;
1888 return false;
1891 static inline bool func_uaccess_safe(struct symbol *func)
1893 if (func)
1894 return func->uaccess_safe;
1896 return false;
1899 static inline const char *call_dest_name(struct instruction *insn)
1901 if (insn->call_dest)
1902 return insn->call_dest->name;
1904 return "{dynamic}";
1907 static int validate_call(struct instruction *insn, struct insn_state *state)
1909 if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
1910 WARN_FUNC("call to %s() with UACCESS enabled",
1911 insn->sec, insn->offset, call_dest_name(insn));
1912 return 1;
1915 if (state->df) {
1916 WARN_FUNC("call to %s() with DF set",
1917 insn->sec, insn->offset, call_dest_name(insn));
1918 return 1;
1921 return 0;
1924 static int validate_sibling_call(struct instruction *insn, struct insn_state *state)
1926 if (has_modified_stack_frame(state)) {
1927 WARN_FUNC("sibling call from callable instruction with modified stack frame",
1928 insn->sec, insn->offset);
1929 return 1;
1932 return validate_call(insn, state);
1936 * Follow the branch starting at the given instruction, and recursively follow
1937 * any other branches (jumps). Meanwhile, track the frame pointer state at
1938 * each instruction and validate all the rules described in
1939 * tools/objtool/Documentation/stack-validation.txt.
1941 static int validate_branch(struct objtool_file *file, struct symbol *func,
1942 struct instruction *first, struct insn_state state)
1944 struct alternative *alt;
1945 struct instruction *insn, *next_insn;
1946 struct section *sec;
1947 u8 visited;
1948 int ret;
1950 insn = first;
1951 sec = insn->sec;
1953 if (insn->alt_group && list_empty(&insn->alts)) {
1954 WARN_FUNC("don't know how to handle branch to middle of alternative instruction group",
1955 sec, insn->offset);
1956 return 1;
1959 while (1) {
1960 next_insn = next_insn_same_sec(file, insn);
1962 if (file->c_file && func && insn->func && func != insn->func->pfunc) {
1963 WARN("%s() falls through to next function %s()",
1964 func->name, insn->func->name);
1965 return 1;
1968 if (func && insn->ignore) {
1969 WARN_FUNC("BUG: why am I validating an ignored function?",
1970 sec, insn->offset);
1971 return 1;
1974 visited = 1 << state.uaccess;
1975 if (insn->visited) {
1976 if (!insn->hint && !insn_state_match(insn, &state))
1977 return 1;
1979 if (insn->visited & visited)
1980 return 0;
1983 if (insn->hint) {
1984 if (insn->restore) {
1985 struct instruction *save_insn, *i;
1987 i = insn;
1988 save_insn = NULL;
1989 func_for_each_insn_continue_reverse(file, func, i) {
1990 if (i->save) {
1991 save_insn = i;
1992 break;
1996 if (!save_insn) {
1997 WARN_FUNC("no corresponding CFI save for CFI restore",
1998 sec, insn->offset);
1999 return 1;
2002 if (!save_insn->visited) {
2004 * Oops, no state to copy yet.
2005 * Hopefully we can reach this
2006 * instruction from another branch
2007 * after the save insn has been
2008 * visited.
2010 if (insn == first)
2011 return 0;
2013 WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
2014 sec, insn->offset);
2015 return 1;
2018 insn->state = save_insn->state;
2021 state = insn->state;
2023 } else
2024 insn->state = state;
2026 insn->visited |= visited;
2028 if (!insn->ignore_alts) {
2029 bool skip_orig = false;
2031 list_for_each_entry(alt, &insn->alts, list) {
2032 if (alt->skip_orig)
2033 skip_orig = true;
2035 ret = validate_branch(file, func, alt->insn, state);
2036 if (ret) {
2037 if (backtrace)
2038 BT_FUNC("(alt)", insn);
2039 return ret;
2043 if (skip_orig)
2044 return 0;
2047 switch (insn->type) {
2049 case INSN_RETURN:
2050 if (state.uaccess && !func_uaccess_safe(func)) {
2051 WARN_FUNC("return with UACCESS enabled", sec, insn->offset);
2052 return 1;
2055 if (!state.uaccess && func_uaccess_safe(func)) {
2056 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function", sec, insn->offset);
2057 return 1;
2060 if (state.df) {
2061 WARN_FUNC("return with DF set", sec, insn->offset);
2062 return 1;
2065 if (func && has_modified_stack_frame(&state)) {
2066 WARN_FUNC("return with modified stack frame",
2067 sec, insn->offset);
2068 return 1;
2071 if (state.bp_scratch) {
2072 WARN("%s uses BP as a scratch register",
2073 func->name);
2074 return 1;
2077 return 0;
2079 case INSN_CALL:
2080 case INSN_CALL_DYNAMIC:
2081 ret = validate_call(insn, &state);
2082 if (ret)
2083 return ret;
2085 if (!no_fp && func && !is_fentry_call(insn) &&
2086 !has_valid_stack_frame(&state)) {
2087 WARN_FUNC("call without frame pointer save/setup",
2088 sec, insn->offset);
2089 return 1;
2092 if (dead_end_function(file, insn->call_dest))
2093 return 0;
2095 break;
2097 case INSN_JUMP_CONDITIONAL:
2098 case INSN_JUMP_UNCONDITIONAL:
2099 if (func && is_sibling_call(insn)) {
2100 ret = validate_sibling_call(insn, &state);
2101 if (ret)
2102 return ret;
2104 } else if (insn->jump_dest) {
2105 ret = validate_branch(file, func,
2106 insn->jump_dest, state);
2107 if (ret) {
2108 if (backtrace)
2109 BT_FUNC("(branch)", insn);
2110 return ret;
2114 if (insn->type == INSN_JUMP_UNCONDITIONAL)
2115 return 0;
2117 break;
2119 case INSN_JUMP_DYNAMIC:
2120 case INSN_JUMP_DYNAMIC_CONDITIONAL:
2121 if (func && is_sibling_call(insn)) {
2122 ret = validate_sibling_call(insn, &state);
2123 if (ret)
2124 return ret;
2127 if (insn->type == INSN_JUMP_DYNAMIC)
2128 return 0;
2130 break;
2132 case INSN_CONTEXT_SWITCH:
2133 if (func && (!next_insn || !next_insn->hint)) {
2134 WARN_FUNC("unsupported instruction in callable function",
2135 sec, insn->offset);
2136 return 1;
2138 return 0;
2140 case INSN_STACK:
2141 if (update_insn_state(insn, &state))
2142 return 1;
2144 if (insn->stack_op.dest.type == OP_DEST_PUSHF) {
2145 if (!state.uaccess_stack) {
2146 state.uaccess_stack = 1;
2147 } else if (state.uaccess_stack >> 31) {
2148 WARN_FUNC("PUSHF stack exhausted", sec, insn->offset);
2149 return 1;
2151 state.uaccess_stack <<= 1;
2152 state.uaccess_stack |= state.uaccess;
2155 if (insn->stack_op.src.type == OP_SRC_POPF) {
2156 if (state.uaccess_stack) {
2157 state.uaccess = state.uaccess_stack & 1;
2158 state.uaccess_stack >>= 1;
2159 if (state.uaccess_stack == 1)
2160 state.uaccess_stack = 0;
2164 break;
2166 case INSN_STAC:
2167 if (state.uaccess) {
2168 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
2169 return 1;
2172 state.uaccess = true;
2173 break;
2175 case INSN_CLAC:
2176 if (!state.uaccess && func) {
2177 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
2178 return 1;
2181 if (func_uaccess_safe(func) && !state.uaccess_stack) {
2182 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
2183 return 1;
2186 state.uaccess = false;
2187 break;
2189 case INSN_STD:
2190 if (state.df)
2191 WARN_FUNC("recursive STD", sec, insn->offset);
2193 state.df = true;
2194 break;
2196 case INSN_CLD:
2197 if (!state.df && func)
2198 WARN_FUNC("redundant CLD", sec, insn->offset);
2200 state.df = false;
2201 break;
2203 default:
2204 break;
2207 if (insn->dead_end)
2208 return 0;
2210 if (!next_insn) {
2211 if (state.cfa.base == CFI_UNDEFINED)
2212 return 0;
2213 WARN("%s: unexpected end of section", sec->name);
2214 return 1;
2217 insn = next_insn;
2220 return 0;
2223 static int validate_unwind_hints(struct objtool_file *file)
2225 struct instruction *insn;
2226 int ret, warnings = 0;
2227 struct insn_state state;
2229 if (!file->hints)
2230 return 0;
2232 clear_insn_state(&state);
2234 for_each_insn(file, insn) {
2235 if (insn->hint && !insn->visited) {
2236 ret = validate_branch(file, insn->func, insn, state);
2237 if (ret && backtrace)
2238 BT_FUNC("<=== (hint)", insn);
2239 warnings += ret;
2243 return warnings;
2246 static int validate_retpoline(struct objtool_file *file)
2248 struct instruction *insn;
2249 int warnings = 0;
2251 for_each_insn(file, insn) {
2252 if (insn->type != INSN_JUMP_DYNAMIC &&
2253 insn->type != INSN_CALL_DYNAMIC)
2254 continue;
2256 if (insn->retpoline_safe)
2257 continue;
2260 * .init.text code is ran before userspace and thus doesn't
2261 * strictly need retpolines, except for modules which are
2262 * loaded late, they very much do need retpoline in their
2263 * .init.text
2265 if (!strcmp(insn->sec->name, ".init.text") && !module)
2266 continue;
2268 WARN_FUNC("indirect %s found in RETPOLINE build",
2269 insn->sec, insn->offset,
2270 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
2272 warnings++;
2275 return warnings;
2278 static bool is_kasan_insn(struct instruction *insn)
2280 return (insn->type == INSN_CALL &&
2281 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
2284 static bool is_ubsan_insn(struct instruction *insn)
2286 return (insn->type == INSN_CALL &&
2287 !strcmp(insn->call_dest->name,
2288 "__ubsan_handle_builtin_unreachable"));
2291 static bool ignore_unreachable_insn(struct instruction *insn)
2293 int i;
2295 if (insn->ignore || insn->type == INSN_NOP)
2296 return true;
2299 * Ignore any unused exceptions. This can happen when a whitelisted
2300 * function has an exception table entry.
2302 * Also ignore alternative replacement instructions. This can happen
2303 * when a whitelisted function uses one of the ALTERNATIVE macros.
2305 if (!strcmp(insn->sec->name, ".fixup") ||
2306 !strcmp(insn->sec->name, ".altinstr_replacement") ||
2307 !strcmp(insn->sec->name, ".altinstr_aux"))
2308 return true;
2310 if (!insn->func)
2311 return false;
2314 * CONFIG_UBSAN_TRAP inserts a UD2 when it sees
2315 * __builtin_unreachable(). The BUG() macro has an unreachable() after
2316 * the UD2, which causes GCC's undefined trap logic to emit another UD2
2317 * (or occasionally a JMP to UD2).
2319 if (list_prev_entry(insn, list)->dead_end &&
2320 (insn->type == INSN_BUG ||
2321 (insn->type == INSN_JUMP_UNCONDITIONAL &&
2322 insn->jump_dest && insn->jump_dest->type == INSN_BUG)))
2323 return true;
2326 * Check if this (or a subsequent) instruction is related to
2327 * CONFIG_UBSAN or CONFIG_KASAN.
2329 * End the search at 5 instructions to avoid going into the weeds.
2331 for (i = 0; i < 5; i++) {
2333 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
2334 return true;
2336 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
2337 if (insn->jump_dest &&
2338 insn->jump_dest->func == insn->func) {
2339 insn = insn->jump_dest;
2340 continue;
2343 break;
2346 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
2347 break;
2349 insn = list_next_entry(insn, list);
2352 return false;
2355 static int validate_functions(struct objtool_file *file)
2357 struct section *sec;
2358 struct symbol *func;
2359 struct instruction *insn;
2360 struct insn_state state;
2361 int ret, warnings = 0;
2363 clear_insn_state(&state);
2365 state.cfa = initial_func_cfi.cfa;
2366 memcpy(&state.regs, &initial_func_cfi.regs,
2367 CFI_NUM_REGS * sizeof(struct cfi_reg));
2368 state.stack_size = initial_func_cfi.cfa.offset;
2370 for_each_sec(file, sec) {
2371 list_for_each_entry(func, &sec->symbol_list, list) {
2372 if (func->type != STT_FUNC)
2373 continue;
2375 if (!func->len) {
2376 WARN("%s() is missing an ELF size annotation",
2377 func->name);
2378 warnings++;
2381 if (func->pfunc != func || func->alias != func)
2382 continue;
2384 insn = find_insn(file, sec, func->offset);
2385 if (!insn || insn->ignore || insn->visited)
2386 continue;
2388 state.uaccess = func->uaccess_safe;
2390 ret = validate_branch(file, func, insn, state);
2391 if (ret && backtrace)
2392 BT_FUNC("<=== (func)", insn);
2393 warnings += ret;
2397 return warnings;
2400 static int validate_reachable_instructions(struct objtool_file *file)
2402 struct instruction *insn;
2404 if (file->ignore_unreachables)
2405 return 0;
2407 for_each_insn(file, insn) {
2408 if (insn->visited || ignore_unreachable_insn(insn))
2409 continue;
2411 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
2412 return 1;
2415 return 0;
2418 static void cleanup(struct objtool_file *file)
2420 struct instruction *insn, *tmpinsn;
2421 struct alternative *alt, *tmpalt;
2423 list_for_each_entry_safe(insn, tmpinsn, &file->insn_list, list) {
2424 list_for_each_entry_safe(alt, tmpalt, &insn->alts, list) {
2425 list_del(&alt->list);
2426 free(alt);
2428 list_del(&insn->list);
2429 hash_del(&insn->hash);
2430 free(insn);
2432 elf_close(file->elf);
2435 static struct objtool_file file;
2437 int check(const char *_objname, bool orc)
2439 int ret, warnings = 0;
2441 objname = _objname;
2443 file.elf = elf_read(objname, orc ? O_RDWR : O_RDONLY);
2444 if (!file.elf)
2445 return 1;
2447 INIT_LIST_HEAD(&file.insn_list);
2448 hash_init(file.insn_hash);
2449 file.c_file = find_section_by_name(file.elf, ".comment");
2450 file.ignore_unreachables = no_unreachable;
2451 file.hints = false;
2453 arch_initial_func_cfi_state(&initial_func_cfi);
2455 ret = decode_sections(&file);
2456 if (ret < 0)
2457 goto out;
2458 warnings += ret;
2460 if (list_empty(&file.insn_list))
2461 goto out;
2463 if (retpoline) {
2464 ret = validate_retpoline(&file);
2465 if (ret < 0)
2466 return ret;
2467 warnings += ret;
2470 ret = validate_functions(&file);
2471 if (ret < 0)
2472 goto out;
2473 warnings += ret;
2475 ret = validate_unwind_hints(&file);
2476 if (ret < 0)
2477 goto out;
2478 warnings += ret;
2480 if (!warnings) {
2481 ret = validate_reachable_instructions(&file);
2482 if (ret < 0)
2483 goto out;
2484 warnings += ret;
2487 if (orc) {
2488 ret = create_orc(&file);
2489 if (ret < 0)
2490 goto out;
2492 ret = create_orc_sections(&file);
2493 if (ret < 0)
2494 goto out;
2496 ret = elf_write(file.elf);
2497 if (ret < 0)
2498 goto out;
2501 out:
2502 cleanup(&file);
2504 /* ignore warnings for now until we get all the code cleaned up */
2505 if (ret || warnings)
2506 return 0;
2507 return 0;