1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
12 #include <objtool/builtin.h>
13 #include <objtool/cfi.h>
14 #include <objtool/arch.h>
15 #include <objtool/check.h>
16 #include <objtool/special.h>
17 #include <objtool/warn.h>
18 #include <objtool/endianness.h>
20 #include <linux/objtool.h>
21 #include <linux/hashtable.h>
22 #include <linux/kernel.h>
23 #include <linux/static_call_types.h>
26 struct list_head list;
27 struct instruction *insn;
31 static unsigned long nr_cfi, nr_cfi_reused, nr_cfi_cache;
33 static struct cfi_init_state initial_func_cfi;
34 static struct cfi_state init_cfi;
35 static struct cfi_state func_cfi;
37 struct instruction *find_insn(struct objtool_file *file,
38 struct section *sec, unsigned long offset)
40 struct instruction *insn;
42 hash_for_each_possible(file->insn_hash, insn, hash, sec_offset_hash(sec, offset)) {
43 if (insn->sec == sec && insn->offset == offset)
50 static struct instruction *next_insn_same_sec(struct objtool_file *file,
51 struct instruction *insn)
53 struct instruction *next = list_next_entry(insn, list);
55 if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
61 static struct instruction *next_insn_same_func(struct objtool_file *file,
62 struct instruction *insn)
64 struct instruction *next = list_next_entry(insn, list);
65 struct symbol *func = insn->func;
70 if (&next->list != &file->insn_list && next->func == func)
73 /* Check if we're already in the subfunction: */
74 if (func == func->cfunc)
77 /* Move to the subfunction: */
78 return find_insn(file, func->cfunc->sec, func->cfunc->offset);
81 static struct instruction *prev_insn_same_sym(struct objtool_file *file,
82 struct instruction *insn)
84 struct instruction *prev = list_prev_entry(insn, list);
86 if (&prev->list != &file->insn_list && prev->func == insn->func)
92 #define func_for_each_insn(file, func, insn) \
93 for (insn = find_insn(file, func->sec, func->offset); \
95 insn = next_insn_same_func(file, insn))
97 #define sym_for_each_insn(file, sym, insn) \
98 for (insn = find_insn(file, sym->sec, sym->offset); \
99 insn && &insn->list != &file->insn_list && \
100 insn->sec == sym->sec && \
101 insn->offset < sym->offset + sym->len; \
102 insn = list_next_entry(insn, list))
104 #define sym_for_each_insn_continue_reverse(file, sym, insn) \
105 for (insn = list_prev_entry(insn, list); \
106 &insn->list != &file->insn_list && \
107 insn->sec == sym->sec && insn->offset >= sym->offset; \
108 insn = list_prev_entry(insn, list))
110 #define sec_for_each_insn_from(file, insn) \
111 for (; insn; insn = next_insn_same_sec(file, insn))
113 #define sec_for_each_insn_continue(file, insn) \
114 for (insn = next_insn_same_sec(file, insn); insn; \
115 insn = next_insn_same_sec(file, insn))
117 static bool is_jump_table_jump(struct instruction *insn)
119 struct alt_group *alt_group = insn->alt_group;
121 if (insn->jump_table)
124 /* Retpoline alternative for a jump table? */
125 return alt_group && alt_group->orig_group &&
126 alt_group->orig_group->first_insn->jump_table;
129 static bool is_sibling_call(struct instruction *insn)
132 * Assume only ELF functions can make sibling calls. This ensures
133 * sibling call detection consistency between vmlinux.o and individual
139 /* An indirect jump is either a sibling call or a jump to a table. */
140 if (insn->type == INSN_JUMP_DYNAMIC)
141 return !is_jump_table_jump(insn);
143 /* add_jump_destinations() sets insn->call_dest for sibling calls. */
144 return (is_static_jump(insn) && insn->call_dest);
148 * This checks to see if the given function is a "noreturn" function.
150 * For global functions which are outside the scope of this object file, we
151 * have to keep a manual list of them.
153 * For local functions, we have to detect them manually by simply looking for
154 * the lack of a return instruction.
156 static bool __dead_end_function(struct objtool_file *file, struct symbol *func,
160 struct instruction *insn;
164 * Unfortunately these have to be hard coded because the noreturn
165 * attribute isn't provided in ELF data.
167 static const char * const global_noreturns[] = {
172 "__module_put_and_exit",
178 "machine_real_restart",
179 "rewind_stack_do_exit",
180 "kunit_try_catch_throw",
182 "cpu_bringup_and_idle",
188 if (func->bind == STB_WEAK)
191 if (func->bind == STB_GLOBAL)
192 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
193 if (!strcmp(func->name, global_noreturns[i]))
199 insn = find_insn(file, func->sec, func->offset);
203 func_for_each_insn(file, func, insn) {
206 if (insn->type == INSN_RETURN)
214 * A function can have a sibling call instead of a return. In that
215 * case, the function's dead-end status depends on whether the target
216 * of the sibling call returns.
218 func_for_each_insn(file, func, insn) {
219 if (is_sibling_call(insn)) {
220 struct instruction *dest = insn->jump_dest;
223 /* sibling call to another file */
226 /* local sibling call */
227 if (recursion == 5) {
229 * Infinite recursion: two functions have
230 * sibling calls to each other. This is a very
231 * rare case. It means they aren't dead ends.
236 return __dead_end_function(file, dest->func, recursion+1);
243 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
245 return __dead_end_function(file, func, 0);
248 static void init_cfi_state(struct cfi_state *cfi)
252 for (i = 0; i < CFI_NUM_REGS; i++) {
253 cfi->regs[i].base = CFI_UNDEFINED;
254 cfi->vals[i].base = CFI_UNDEFINED;
256 cfi->cfa.base = CFI_UNDEFINED;
257 cfi->drap_reg = CFI_UNDEFINED;
258 cfi->drap_offset = -1;
261 static void init_insn_state(struct insn_state *state, struct section *sec)
263 memset(state, 0, sizeof(*state));
264 init_cfi_state(&state->cfi);
267 * We need the full vmlinux for noinstr validation, otherwise we can
268 * not correctly determine insn->call_dest->sec (external symbols do
269 * not have a section).
271 if (vmlinux && noinstr && sec)
272 state->noinstr = sec->noinstr;
275 static struct cfi_state *cfi_alloc(void)
277 struct cfi_state *cfi = calloc(sizeof(struct cfi_state), 1);
279 WARN("calloc failed");
287 static struct hlist_head *cfi_hash;
289 static inline bool cficmp(struct cfi_state *cfi1, struct cfi_state *cfi2)
291 return memcmp((void *)cfi1 + sizeof(cfi1->hash),
292 (void *)cfi2 + sizeof(cfi2->hash),
293 sizeof(struct cfi_state) - sizeof(struct hlist_node));
296 static inline u32 cfi_key(struct cfi_state *cfi)
298 return jhash((void *)cfi + sizeof(cfi->hash),
299 sizeof(*cfi) - sizeof(cfi->hash), 0);
302 static struct cfi_state *cfi_hash_find_or_add(struct cfi_state *cfi)
304 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
305 struct cfi_state *obj;
307 hlist_for_each_entry(obj, head, hash) {
308 if (!cficmp(cfi, obj)) {
316 hlist_add_head(&obj->hash, head);
321 static void cfi_hash_add(struct cfi_state *cfi)
323 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
325 hlist_add_head(&cfi->hash, head);
328 static void *cfi_hash_alloc(unsigned long size)
330 cfi_bits = max(10, ilog2(size));
331 cfi_hash = mmap(NULL, sizeof(struct hlist_head) << cfi_bits,
332 PROT_READ|PROT_WRITE,
333 MAP_PRIVATE|MAP_ANON, -1, 0);
334 if (cfi_hash == (void *)-1L) {
335 WARN("mmap fail cfi_hash");
338 printf("cfi_bits: %d\n", cfi_bits);
344 static unsigned long nr_insns;
345 static unsigned long nr_insns_visited;
348 * Call the arch-specific instruction decoder for all the instructions and add
349 * them to the global instruction list.
351 static int decode_instructions(struct objtool_file *file)
355 unsigned long offset;
356 struct instruction *insn;
359 for_each_sec(file, sec) {
361 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
364 if (strcmp(sec->name, ".altinstr_replacement") &&
365 strcmp(sec->name, ".altinstr_aux") &&
366 strncmp(sec->name, ".discard.", 9))
369 if (!strcmp(sec->name, ".noinstr.text") ||
370 !strcmp(sec->name, ".entry.text") ||
371 !strncmp(sec->name, ".text.__x86.", 12))
374 for (offset = 0; offset < sec->sh.sh_size; offset += insn->len) {
375 insn = malloc(sizeof(*insn));
377 WARN("malloc failed");
380 memset(insn, 0, sizeof(*insn));
381 INIT_LIST_HEAD(&insn->alts);
382 INIT_LIST_HEAD(&insn->stack_ops);
385 insn->offset = offset;
387 ret = arch_decode_instruction(file->elf, sec, offset,
388 sec->sh.sh_size - offset,
389 &insn->len, &insn->type,
395 hash_add(file->insn_hash, &insn->hash, sec_offset_hash(sec, insn->offset));
396 list_add_tail(&insn->list, &file->insn_list);
400 list_for_each_entry(func, &sec->symbol_list, list) {
401 if (func->type != STT_FUNC || func->alias != func)
404 if (!find_insn(file, sec, func->offset)) {
405 WARN("%s(): can't find starting instruction",
410 sym_for_each_insn(file, func, insn)
416 printf("nr_insns: %lu\n", nr_insns);
425 static struct instruction *find_last_insn(struct objtool_file *file,
428 struct instruction *insn = NULL;
430 unsigned int end = (sec->sh.sh_size > 10) ? sec->sh.sh_size - 10 : 0;
432 for (offset = sec->sh.sh_size - 1; offset >= end && !insn; offset--)
433 insn = find_insn(file, sec, offset);
439 * Mark "ud2" instructions and manually annotated dead ends.
441 static int add_dead_ends(struct objtool_file *file)
445 struct instruction *insn;
448 * By default, "ud2" is a dead end unless otherwise annotated, because
449 * GCC 7 inserts it for certain divide-by-zero cases.
451 for_each_insn(file, insn)
452 if (insn->type == INSN_BUG)
453 insn->dead_end = true;
456 * Check for manually annotated dead ends.
458 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
462 list_for_each_entry(reloc, &sec->reloc_list, list) {
463 if (reloc->sym->type != STT_SECTION) {
464 WARN("unexpected relocation symbol type in %s", sec->name);
467 insn = find_insn(file, reloc->sym->sec, reloc->addend);
469 insn = list_prev_entry(insn, list);
470 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
471 insn = find_last_insn(file, reloc->sym->sec);
473 WARN("can't find unreachable insn at %s+0x%" PRIx64,
474 reloc->sym->sec->name, reloc->addend);
478 WARN("can't find unreachable insn at %s+0x%" PRIx64,
479 reloc->sym->sec->name, reloc->addend);
483 insn->dead_end = true;
488 * These manually annotated reachable checks are needed for GCC 4.4,
489 * where the Linux unreachable() macro isn't supported. In that case
490 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
493 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
497 list_for_each_entry(reloc, &sec->reloc_list, list) {
498 if (reloc->sym->type != STT_SECTION) {
499 WARN("unexpected relocation symbol type in %s", sec->name);
502 insn = find_insn(file, reloc->sym->sec, reloc->addend);
504 insn = list_prev_entry(insn, list);
505 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
506 insn = find_last_insn(file, reloc->sym->sec);
508 WARN("can't find reachable insn at %s+0x%" PRIx64,
509 reloc->sym->sec->name, reloc->addend);
513 WARN("can't find reachable insn at %s+0x%" PRIx64,
514 reloc->sym->sec->name, reloc->addend);
518 insn->dead_end = false;
524 static int create_static_call_sections(struct objtool_file *file)
527 struct static_call_site *site;
528 struct instruction *insn;
529 struct symbol *key_sym;
530 char *key_name, *tmp;
533 sec = find_section_by_name(file->elf, ".static_call_sites");
535 INIT_LIST_HEAD(&file->static_call_list);
536 WARN("file already has .static_call_sites section, skipping");
540 if (list_empty(&file->static_call_list))
544 list_for_each_entry(insn, &file->static_call_list, call_node)
547 sec = elf_create_section(file->elf, ".static_call_sites", SHF_WRITE,
548 sizeof(struct static_call_site), idx);
553 list_for_each_entry(insn, &file->static_call_list, call_node) {
555 site = (struct static_call_site *)sec->data->d_buf + idx;
556 memset(site, 0, sizeof(struct static_call_site));
558 /* populate reloc for 'addr' */
559 if (elf_add_reloc_to_insn(file->elf, sec,
560 idx * sizeof(struct static_call_site),
562 insn->sec, insn->offset))
565 /* find key symbol */
566 key_name = strdup(insn->call_dest->name);
571 if (strncmp(key_name, STATIC_CALL_TRAMP_PREFIX_STR,
572 STATIC_CALL_TRAMP_PREFIX_LEN)) {
573 WARN("static_call: trampoline name malformed: %s", key_name);
576 tmp = key_name + STATIC_CALL_TRAMP_PREFIX_LEN - STATIC_CALL_KEY_PREFIX_LEN;
577 memcpy(tmp, STATIC_CALL_KEY_PREFIX_STR, STATIC_CALL_KEY_PREFIX_LEN);
579 key_sym = find_symbol_by_name(file->elf, tmp);
582 WARN("static_call: can't find static_call_key symbol: %s", tmp);
587 * For modules(), the key might not be exported, which
588 * means the module can make static calls but isn't
589 * allowed to change them.
591 * In that case we temporarily set the key to be the
592 * trampoline address. This is fixed up in
593 * static_call_add_module().
595 key_sym = insn->call_dest;
599 /* populate reloc for 'key' */
600 if (elf_add_reloc(file->elf, sec,
601 idx * sizeof(struct static_call_site) + 4,
602 R_X86_64_PC32, key_sym,
603 is_sibling_call(insn) * STATIC_CALL_SITE_TAIL))
612 static int create_retpoline_sites_sections(struct objtool_file *file)
614 struct instruction *insn;
618 sec = find_section_by_name(file->elf, ".retpoline_sites");
620 WARN("file already has .retpoline_sites, skipping");
625 list_for_each_entry(insn, &file->retpoline_call_list, call_node)
631 sec = elf_create_section(file->elf, ".retpoline_sites", 0,
634 WARN("elf_create_section: .retpoline_sites");
639 list_for_each_entry(insn, &file->retpoline_call_list, call_node) {
641 int *site = (int *)sec->data->d_buf + idx;
644 if (elf_add_reloc_to_insn(file->elf, sec,
647 insn->sec, insn->offset)) {
648 WARN("elf_add_reloc_to_insn: .retpoline_sites");
658 static int create_return_sites_sections(struct objtool_file *file)
660 struct instruction *insn;
664 sec = find_section_by_name(file->elf, ".return_sites");
666 WARN("file already has .return_sites, skipping");
671 list_for_each_entry(insn, &file->return_thunk_list, call_node)
677 sec = elf_create_section(file->elf, ".return_sites", 0,
680 WARN("elf_create_section: .return_sites");
685 list_for_each_entry(insn, &file->return_thunk_list, call_node) {
687 int *site = (int *)sec->data->d_buf + idx;
690 if (elf_add_reloc_to_insn(file->elf, sec,
693 insn->sec, insn->offset)) {
694 WARN("elf_add_reloc_to_insn: .return_sites");
704 static int create_mcount_loc_sections(struct objtool_file *file)
708 struct instruction *insn;
711 sec = find_section_by_name(file->elf, "__mcount_loc");
713 INIT_LIST_HEAD(&file->mcount_loc_list);
714 WARN("file already has __mcount_loc section, skipping");
718 if (list_empty(&file->mcount_loc_list))
722 list_for_each_entry(insn, &file->mcount_loc_list, call_node)
725 sec = elf_create_section(file->elf, "__mcount_loc", 0, sizeof(unsigned long), idx);
730 list_for_each_entry(insn, &file->mcount_loc_list, call_node) {
732 loc = (unsigned long *)sec->data->d_buf + idx;
733 memset(loc, 0, sizeof(unsigned long));
735 if (elf_add_reloc_to_insn(file->elf, sec,
736 idx * sizeof(unsigned long),
738 insn->sec, insn->offset))
748 * Warnings shouldn't be reported for ignored functions.
750 static void add_ignores(struct objtool_file *file)
752 struct instruction *insn;
757 sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
761 list_for_each_entry(reloc, &sec->reloc_list, list) {
762 switch (reloc->sym->type) {
768 func = find_func_by_offset(reloc->sym->sec, reloc->addend);
774 WARN("unexpected relocation symbol type in %s: %d", sec->name, reloc->sym->type);
778 func_for_each_insn(file, func, insn)
784 * This is a whitelist of functions that is allowed to be called with AC set.
785 * The list is meant to be minimal and only contains compiler instrumentation
786 * ABI and a few functions used to implement *_{to,from}_user() functions.
788 * These functions must not directly change AC, but may PUSHF/POPF.
790 static const char *uaccess_safe_builtin[] = {
794 /* KASAN out-of-line */
795 "__asan_loadN_noabort",
796 "__asan_load1_noabort",
797 "__asan_load2_noabort",
798 "__asan_load4_noabort",
799 "__asan_load8_noabort",
800 "__asan_load16_noabort",
801 "__asan_storeN_noabort",
802 "__asan_store1_noabort",
803 "__asan_store2_noabort",
804 "__asan_store4_noabort",
805 "__asan_store8_noabort",
806 "__asan_store16_noabort",
807 "__kasan_check_read",
808 "__kasan_check_write",
810 "__asan_report_load_n_noabort",
811 "__asan_report_load1_noabort",
812 "__asan_report_load2_noabort",
813 "__asan_report_load4_noabort",
814 "__asan_report_load8_noabort",
815 "__asan_report_load16_noabort",
816 "__asan_report_store_n_noabort",
817 "__asan_report_store1_noabort",
818 "__asan_report_store2_noabort",
819 "__asan_report_store4_noabort",
820 "__asan_report_store8_noabort",
821 "__asan_report_store16_noabort",
823 "__kcsan_check_access",
824 "kcsan_found_watchpoint",
825 "kcsan_setup_watchpoint",
826 "kcsan_check_scoped_accesses",
827 "kcsan_disable_current",
828 "kcsan_enable_current_nowarn",
833 "__tsan_write_range",
844 "__tsan_read_write1",
845 "__tsan_read_write2",
846 "__tsan_read_write4",
847 "__tsan_read_write8",
848 "__tsan_read_write16",
849 "__tsan_volatile_read1",
850 "__tsan_volatile_read2",
851 "__tsan_volatile_read4",
852 "__tsan_volatile_read8",
853 "__tsan_volatile_read16",
854 "__tsan_volatile_write1",
855 "__tsan_volatile_write2",
856 "__tsan_volatile_write4",
857 "__tsan_volatile_write8",
858 "__tsan_volatile_write16",
859 "__tsan_atomic8_load",
860 "__tsan_atomic16_load",
861 "__tsan_atomic32_load",
862 "__tsan_atomic64_load",
863 "__tsan_atomic8_store",
864 "__tsan_atomic16_store",
865 "__tsan_atomic32_store",
866 "__tsan_atomic64_store",
867 "__tsan_atomic8_exchange",
868 "__tsan_atomic16_exchange",
869 "__tsan_atomic32_exchange",
870 "__tsan_atomic64_exchange",
871 "__tsan_atomic8_fetch_add",
872 "__tsan_atomic16_fetch_add",
873 "__tsan_atomic32_fetch_add",
874 "__tsan_atomic64_fetch_add",
875 "__tsan_atomic8_fetch_sub",
876 "__tsan_atomic16_fetch_sub",
877 "__tsan_atomic32_fetch_sub",
878 "__tsan_atomic64_fetch_sub",
879 "__tsan_atomic8_fetch_and",
880 "__tsan_atomic16_fetch_and",
881 "__tsan_atomic32_fetch_and",
882 "__tsan_atomic64_fetch_and",
883 "__tsan_atomic8_fetch_or",
884 "__tsan_atomic16_fetch_or",
885 "__tsan_atomic32_fetch_or",
886 "__tsan_atomic64_fetch_or",
887 "__tsan_atomic8_fetch_xor",
888 "__tsan_atomic16_fetch_xor",
889 "__tsan_atomic32_fetch_xor",
890 "__tsan_atomic64_fetch_xor",
891 "__tsan_atomic8_fetch_nand",
892 "__tsan_atomic16_fetch_nand",
893 "__tsan_atomic32_fetch_nand",
894 "__tsan_atomic64_fetch_nand",
895 "__tsan_atomic8_compare_exchange_strong",
896 "__tsan_atomic16_compare_exchange_strong",
897 "__tsan_atomic32_compare_exchange_strong",
898 "__tsan_atomic64_compare_exchange_strong",
899 "__tsan_atomic8_compare_exchange_weak",
900 "__tsan_atomic16_compare_exchange_weak",
901 "__tsan_atomic32_compare_exchange_weak",
902 "__tsan_atomic64_compare_exchange_weak",
903 "__tsan_atomic8_compare_exchange_val",
904 "__tsan_atomic16_compare_exchange_val",
905 "__tsan_atomic32_compare_exchange_val",
906 "__tsan_atomic64_compare_exchange_val",
907 "__tsan_atomic_thread_fence",
908 "__tsan_atomic_signal_fence",
912 "__sanitizer_cov_trace_pc",
913 "__sanitizer_cov_trace_const_cmp1",
914 "__sanitizer_cov_trace_const_cmp2",
915 "__sanitizer_cov_trace_const_cmp4",
916 "__sanitizer_cov_trace_const_cmp8",
917 "__sanitizer_cov_trace_cmp1",
918 "__sanitizer_cov_trace_cmp2",
919 "__sanitizer_cov_trace_cmp4",
920 "__sanitizer_cov_trace_cmp8",
921 "__sanitizer_cov_trace_switch",
923 "ubsan_type_mismatch_common",
924 "__ubsan_handle_type_mismatch",
925 "__ubsan_handle_type_mismatch_v1",
926 "__ubsan_handle_shift_out_of_bounds",
928 "csum_partial_copy_generic",
930 "copy_mc_fragile_handle_tail",
931 "copy_mc_enhanced_fast_string",
932 "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
936 static void add_uaccess_safe(struct objtool_file *file)
944 for (name = uaccess_safe_builtin; *name; name++) {
945 func = find_symbol_by_name(file->elf, *name);
949 func->uaccess_safe = true;
954 * FIXME: For now, just ignore any alternatives which add retpolines. This is
955 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
956 * But it at least allows objtool to understand the control flow *around* the
959 static int add_ignore_alternatives(struct objtool_file *file)
963 struct instruction *insn;
965 sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
969 list_for_each_entry(reloc, &sec->reloc_list, list) {
970 if (reloc->sym->type != STT_SECTION) {
971 WARN("unexpected relocation symbol type in %s", sec->name);
975 insn = find_insn(file, reloc->sym->sec, reloc->addend);
977 WARN("bad .discard.ignore_alts entry");
981 insn->ignore_alts = true;
987 __weak bool arch_is_retpoline(struct symbol *sym)
992 __weak bool arch_is_rethunk(struct symbol *sym)
997 #define NEGATIVE_RELOC ((void *)-1L)
999 static struct reloc *insn_reloc(struct objtool_file *file, struct instruction *insn)
1001 if (insn->reloc == NEGATIVE_RELOC)
1005 insn->reloc = find_reloc_by_dest_range(file->elf, insn->sec,
1006 insn->offset, insn->len);
1008 insn->reloc = NEGATIVE_RELOC;
1016 static void remove_insn_ops(struct instruction *insn)
1018 struct stack_op *op, *tmp;
1020 list_for_each_entry_safe(op, tmp, &insn->stack_ops, list) {
1021 list_del(&op->list);
1026 static void annotate_call_site(struct objtool_file *file,
1027 struct instruction *insn, bool sibling)
1029 struct reloc *reloc = insn_reloc(file, insn);
1030 struct symbol *sym = insn->call_dest;
1036 * Alternative replacement code is just template code which is
1037 * sometimes copied to the original instruction. For now, don't
1038 * annotate it. (In the future we might consider annotating the
1039 * original instruction if/when it ever makes sense to do so.)
1041 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
1044 if (sym->static_call_tramp) {
1045 list_add_tail(&insn->call_node, &file->static_call_list);
1049 if (sym->retpoline_thunk) {
1050 list_add_tail(&insn->call_node, &file->retpoline_call_list);
1055 * Many compilers cannot disable KCOV with a function attribute
1056 * so they need a little help, NOP out any KCOV calls from noinstr
1059 if (insn->sec->noinstr && sym->kcov) {
1061 reloc->type = R_NONE;
1062 elf_write_reloc(file->elf, reloc);
1065 elf_write_insn(file->elf, insn->sec,
1066 insn->offset, insn->len,
1067 sibling ? arch_ret_insn(insn->len)
1068 : arch_nop_insn(insn->len));
1070 insn->type = sibling ? INSN_RETURN : INSN_NOP;
1074 * We've replaced the tail-call JMP insn by two new
1075 * insn: RET; INT3, except we only have a single struct
1076 * insn here. Mark it retpoline_safe to avoid the SLS
1077 * warning, instead of adding another insn.
1079 insn->retpoline_safe = true;
1085 if (mcount && sym->fentry) {
1087 WARN_FUNC("Tail call to __fentry__ !?!?", insn->sec, insn->offset);
1090 reloc->type = R_NONE;
1091 elf_write_reloc(file->elf, reloc);
1094 elf_write_insn(file->elf, insn->sec,
1095 insn->offset, insn->len,
1096 arch_nop_insn(insn->len));
1098 insn->type = INSN_NOP;
1100 list_add_tail(&insn->call_node, &file->mcount_loc_list);
1105 static void add_call_dest(struct objtool_file *file, struct instruction *insn,
1106 struct symbol *dest, bool sibling)
1108 insn->call_dest = dest;
1113 * Whatever stack impact regular CALLs have, should be undone
1114 * by the RETURN of the called function.
1116 * Annotated intra-function calls retain the stack_ops but
1117 * are converted to JUMP, see read_intra_function_calls().
1119 remove_insn_ops(insn);
1121 annotate_call_site(file, insn, sibling);
1124 static void add_retpoline_call(struct objtool_file *file, struct instruction *insn)
1127 * Retpoline calls/jumps are really dynamic calls/jumps in disguise,
1128 * so convert them accordingly.
1130 switch (insn->type) {
1132 insn->type = INSN_CALL_DYNAMIC;
1134 case INSN_JUMP_UNCONDITIONAL:
1135 insn->type = INSN_JUMP_DYNAMIC;
1137 case INSN_JUMP_CONDITIONAL:
1138 insn->type = INSN_JUMP_DYNAMIC_CONDITIONAL;
1144 insn->retpoline_safe = true;
1147 * Whatever stack impact regular CALLs have, should be undone
1148 * by the RETURN of the called function.
1150 * Annotated intra-function calls retain the stack_ops but
1151 * are converted to JUMP, see read_intra_function_calls().
1153 remove_insn_ops(insn);
1155 annotate_call_site(file, insn, false);
1158 static void add_return_call(struct objtool_file *file, struct instruction *insn, bool add)
1161 * Return thunk tail calls are really just returns in disguise,
1162 * so convert them accordingly.
1164 insn->type = INSN_RETURN;
1165 insn->retpoline_safe = true;
1167 /* Skip the non-text sections, specially .discard ones */
1168 if (add && insn->sec->text)
1169 list_add_tail(&insn->call_node, &file->return_thunk_list);
1173 * Find the destination instructions for all jumps.
1175 static int add_jump_destinations(struct objtool_file *file)
1177 struct instruction *insn;
1178 struct reloc *reloc;
1179 struct section *dest_sec;
1180 unsigned long dest_off;
1182 for_each_insn(file, insn) {
1183 if (!is_static_jump(insn))
1186 reloc = insn_reloc(file, insn);
1188 dest_sec = insn->sec;
1189 dest_off = arch_jump_destination(insn);
1190 } else if (reloc->sym->type == STT_SECTION) {
1191 dest_sec = reloc->sym->sec;
1192 dest_off = arch_dest_reloc_offset(reloc->addend);
1193 } else if (reloc->sym->retpoline_thunk) {
1194 add_retpoline_call(file, insn);
1196 } else if (reloc->sym->return_thunk) {
1197 add_return_call(file, insn, true);
1199 } else if (insn->func) {
1200 /* internal or external sibling call (with reloc) */
1201 add_call_dest(file, insn, reloc->sym, true);
1203 } else if (reloc->sym->sec->idx) {
1204 dest_sec = reloc->sym->sec;
1205 dest_off = reloc->sym->sym.st_value +
1206 arch_dest_reloc_offset(reloc->addend);
1208 /* non-func asm code jumping to another file */
1212 insn->jump_dest = find_insn(file, dest_sec, dest_off);
1213 if (!insn->jump_dest) {
1214 struct symbol *sym = find_symbol_by_offset(dest_sec, dest_off);
1217 * This is a special case where an alt instruction
1218 * jumps past the end of the section. These are
1219 * handled later in handle_group_alt().
1221 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
1225 * This is a special case for zen_untrain_ret().
1226 * It jumps to __x86_return_thunk(), but objtool
1227 * can't find the thunk's starting RET
1228 * instruction, because the RET is also in the
1229 * middle of another instruction. Objtool only
1230 * knows about the outer instruction.
1232 if (sym && sym->return_thunk) {
1233 add_return_call(file, insn, false);
1237 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
1238 insn->sec, insn->offset, dest_sec->name,
1244 * Cross-function jump.
1246 if (insn->func && insn->jump_dest->func &&
1247 insn->func != insn->jump_dest->func) {
1250 * For GCC 8+, create parent/child links for any cold
1251 * subfunctions. This is _mostly_ redundant with a
1252 * similar initialization in read_symbols().
1254 * If a function has aliases, we want the *first* such
1255 * function in the symbol table to be the subfunction's
1256 * parent. In that case we overwrite the
1257 * initialization done in read_symbols().
1259 * However this code can't completely replace the
1260 * read_symbols() code because this doesn't detect the
1261 * case where the parent function's only reference to a
1262 * subfunction is through a jump table.
1264 if (!strstr(insn->func->name, ".cold") &&
1265 strstr(insn->jump_dest->func->name, ".cold")) {
1266 insn->func->cfunc = insn->jump_dest->func;
1267 insn->jump_dest->func->pfunc = insn->func;
1269 } else if (insn->jump_dest->func->pfunc != insn->func->pfunc &&
1270 insn->jump_dest->offset == insn->jump_dest->func->offset) {
1271 /* internal sibling call (without reloc) */
1272 add_call_dest(file, insn, insn->jump_dest->func, true);
1280 static struct symbol *find_call_destination(struct section *sec, unsigned long offset)
1282 struct symbol *call_dest;
1284 call_dest = find_func_by_offset(sec, offset);
1286 call_dest = find_symbol_by_offset(sec, offset);
1292 * Find the destination instructions for all calls.
1294 static int add_call_destinations(struct objtool_file *file)
1296 struct instruction *insn;
1297 unsigned long dest_off;
1298 struct symbol *dest;
1299 struct reloc *reloc;
1301 for_each_insn(file, insn) {
1302 if (insn->type != INSN_CALL)
1305 reloc = insn_reloc(file, insn);
1307 dest_off = arch_jump_destination(insn);
1308 dest = find_call_destination(insn->sec, dest_off);
1310 add_call_dest(file, insn, dest, false);
1315 if (!insn->call_dest) {
1316 WARN_FUNC("unannotated intra-function call", insn->sec, insn->offset);
1320 if (insn->func && insn->call_dest->type != STT_FUNC) {
1321 WARN_FUNC("unsupported call to non-function",
1322 insn->sec, insn->offset);
1326 } else if (reloc->sym->type == STT_SECTION) {
1327 dest_off = arch_dest_reloc_offset(reloc->addend);
1328 dest = find_call_destination(reloc->sym->sec, dest_off);
1330 WARN_FUNC("can't find call dest symbol at %s+0x%lx",
1331 insn->sec, insn->offset,
1332 reloc->sym->sec->name,
1337 add_call_dest(file, insn, dest, false);
1339 } else if (reloc->sym->retpoline_thunk) {
1340 add_retpoline_call(file, insn);
1343 add_call_dest(file, insn, reloc->sym, false);
1350 * The .alternatives section requires some extra special care over and above
1351 * other special sections because alternatives are patched in place.
1353 static int handle_group_alt(struct objtool_file *file,
1354 struct special_alt *special_alt,
1355 struct instruction *orig_insn,
1356 struct instruction **new_insn)
1358 struct instruction *last_orig_insn, *last_new_insn = NULL, *insn, *nop = NULL;
1359 struct alt_group *orig_alt_group, *new_alt_group;
1360 unsigned long dest_off;
1363 orig_alt_group = malloc(sizeof(*orig_alt_group));
1364 if (!orig_alt_group) {
1365 WARN("malloc failed");
1368 orig_alt_group->cfi = calloc(special_alt->orig_len,
1369 sizeof(struct cfi_state *));
1370 if (!orig_alt_group->cfi) {
1371 WARN("calloc failed");
1375 last_orig_insn = NULL;
1377 sec_for_each_insn_from(file, insn) {
1378 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
1381 insn->alt_group = orig_alt_group;
1382 last_orig_insn = insn;
1384 orig_alt_group->orig_group = NULL;
1385 orig_alt_group->first_insn = orig_insn;
1386 orig_alt_group->last_insn = last_orig_insn;
1389 new_alt_group = malloc(sizeof(*new_alt_group));
1390 if (!new_alt_group) {
1391 WARN("malloc failed");
1395 if (special_alt->new_len < special_alt->orig_len) {
1397 * Insert a fake nop at the end to make the replacement
1398 * alt_group the same size as the original. This is needed to
1399 * allow propagate_alt_cfi() to do its magic. When the last
1400 * instruction affects the stack, the instruction after it (the
1401 * nop) will propagate the new state to the shared CFI array.
1403 nop = malloc(sizeof(*nop));
1405 WARN("malloc failed");
1408 memset(nop, 0, sizeof(*nop));
1409 INIT_LIST_HEAD(&nop->alts);
1410 INIT_LIST_HEAD(&nop->stack_ops);
1412 nop->sec = special_alt->new_sec;
1413 nop->offset = special_alt->new_off + special_alt->new_len;
1414 nop->len = special_alt->orig_len - special_alt->new_len;
1415 nop->type = INSN_NOP;
1416 nop->func = orig_insn->func;
1417 nop->alt_group = new_alt_group;
1418 nop->ignore = orig_insn->ignore_alts;
1421 if (!special_alt->new_len) {
1427 sec_for_each_insn_from(file, insn) {
1428 struct reloc *alt_reloc;
1430 if (insn->offset >= special_alt->new_off + special_alt->new_len)
1433 last_new_insn = insn;
1435 insn->ignore = orig_insn->ignore_alts;
1436 insn->func = orig_insn->func;
1437 insn->alt_group = new_alt_group;
1440 * Since alternative replacement code is copy/pasted by the
1441 * kernel after applying relocations, generally such code can't
1442 * have relative-address relocation references to outside the
1443 * .altinstr_replacement section, unless the arch's
1444 * alternatives code can adjust the relative offsets
1447 alt_reloc = insn_reloc(file, insn);
1449 !arch_support_alt_relocation(special_alt, insn, alt_reloc)) {
1451 WARN_FUNC("unsupported relocation in alternatives section",
1452 insn->sec, insn->offset);
1456 if (!is_static_jump(insn))
1459 if (!insn->immediate)
1462 dest_off = arch_jump_destination(insn);
1463 if (dest_off == special_alt->new_off + special_alt->new_len)
1464 insn->jump_dest = next_insn_same_sec(file, last_orig_insn);
1466 if (!insn->jump_dest) {
1467 WARN_FUNC("can't find alternative jump destination",
1468 insn->sec, insn->offset);
1473 if (!last_new_insn) {
1474 WARN_FUNC("can't find last new alternative instruction",
1475 special_alt->new_sec, special_alt->new_off);
1480 list_add(&nop->list, &last_new_insn->list);
1482 new_alt_group->orig_group = orig_alt_group;
1483 new_alt_group->first_insn = *new_insn;
1484 new_alt_group->last_insn = nop ? : last_new_insn;
1485 new_alt_group->cfi = orig_alt_group->cfi;
1490 * A jump table entry can either convert a nop to a jump or a jump to a nop.
1491 * If the original instruction is a jump, make the alt entry an effective nop
1492 * by just skipping the original instruction.
1494 static int handle_jump_alt(struct objtool_file *file,
1495 struct special_alt *special_alt,
1496 struct instruction *orig_insn,
1497 struct instruction **new_insn)
1499 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL &&
1500 orig_insn->type != INSN_NOP) {
1502 WARN_FUNC("unsupported instruction at jump label",
1503 orig_insn->sec, orig_insn->offset);
1507 if (special_alt->key_addend & 2) {
1508 struct reloc *reloc = insn_reloc(file, orig_insn);
1511 reloc->type = R_NONE;
1512 elf_write_reloc(file->elf, reloc);
1514 elf_write_insn(file->elf, orig_insn->sec,
1515 orig_insn->offset, orig_insn->len,
1516 arch_nop_insn(orig_insn->len));
1517 orig_insn->type = INSN_NOP;
1520 if (orig_insn->type == INSN_NOP) {
1521 if (orig_insn->len == 2)
1522 file->jl_nop_short++;
1524 file->jl_nop_long++;
1529 if (orig_insn->len == 2)
1534 *new_insn = list_next_entry(orig_insn, list);
1539 * Read all the special sections which have alternate instructions which can be
1540 * patched in or redirected to at runtime. Each instruction having alternate
1541 * instruction(s) has them added to its insn->alts list, which will be
1542 * traversed in validate_branch().
1544 static int add_special_section_alts(struct objtool_file *file)
1546 struct list_head special_alts;
1547 struct instruction *orig_insn, *new_insn;
1548 struct special_alt *special_alt, *tmp;
1549 struct alternative *alt;
1552 ret = special_get_alts(file->elf, &special_alts);
1556 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
1558 orig_insn = find_insn(file, special_alt->orig_sec,
1559 special_alt->orig_off);
1561 WARN_FUNC("special: can't find orig instruction",
1562 special_alt->orig_sec, special_alt->orig_off);
1568 if (!special_alt->group || special_alt->new_len) {
1569 new_insn = find_insn(file, special_alt->new_sec,
1570 special_alt->new_off);
1572 WARN_FUNC("special: can't find new instruction",
1573 special_alt->new_sec,
1574 special_alt->new_off);
1580 if (special_alt->group) {
1581 if (!special_alt->orig_len) {
1582 WARN_FUNC("empty alternative entry",
1583 orig_insn->sec, orig_insn->offset);
1587 ret = handle_group_alt(file, special_alt, orig_insn,
1591 } else if (special_alt->jump_or_nop) {
1592 ret = handle_jump_alt(file, special_alt, orig_insn,
1598 alt = malloc(sizeof(*alt));
1600 WARN("malloc failed");
1605 alt->insn = new_insn;
1606 alt->skip_orig = special_alt->skip_orig;
1607 orig_insn->ignore_alts |= special_alt->skip_alt;
1608 list_add_tail(&alt->list, &orig_insn->alts);
1610 list_del(&special_alt->list);
1615 printf("jl\\\tNOP\tJMP\n");
1616 printf("short:\t%ld\t%ld\n", file->jl_nop_short, file->jl_short);
1617 printf("long:\t%ld\t%ld\n", file->jl_nop_long, file->jl_long);
1624 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
1625 struct reloc *table)
1627 struct reloc *reloc = table;
1628 struct instruction *dest_insn;
1629 struct alternative *alt;
1630 struct symbol *pfunc = insn->func->pfunc;
1631 unsigned int prev_offset = 0;
1634 * Each @reloc is a switch table relocation which points to the target
1637 list_for_each_entry_from(reloc, &table->sec->reloc_list, list) {
1639 /* Check for the end of the table: */
1640 if (reloc != table && reloc->jump_table_start)
1643 /* Make sure the table entries are consecutive: */
1644 if (prev_offset && reloc->offset != prev_offset + 8)
1647 /* Detect function pointers from contiguous objects: */
1648 if (reloc->sym->sec == pfunc->sec &&
1649 reloc->addend == pfunc->offset)
1652 dest_insn = find_insn(file, reloc->sym->sec, reloc->addend);
1656 /* Make sure the destination is in the same function: */
1657 if (!dest_insn->func || dest_insn->func->pfunc != pfunc)
1660 alt = malloc(sizeof(*alt));
1662 WARN("malloc failed");
1666 alt->insn = dest_insn;
1667 list_add_tail(&alt->list, &insn->alts);
1668 prev_offset = reloc->offset;
1672 WARN_FUNC("can't find switch jump table",
1673 insn->sec, insn->offset);
1681 * find_jump_table() - Given a dynamic jump, find the switch jump table
1682 * associated with it.
1684 static struct reloc *find_jump_table(struct objtool_file *file,
1685 struct symbol *func,
1686 struct instruction *insn)
1688 struct reloc *table_reloc;
1689 struct instruction *dest_insn, *orig_insn = insn;
1692 * Backward search using the @first_jump_src links, these help avoid
1693 * much of the 'in between' code. Which avoids us getting confused by
1697 insn && insn->func && insn->func->pfunc == func;
1698 insn = insn->first_jump_src ?: prev_insn_same_sym(file, insn)) {
1700 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1703 /* allow small jumps within the range */
1704 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1706 (insn->jump_dest->offset <= insn->offset ||
1707 insn->jump_dest->offset > orig_insn->offset))
1710 table_reloc = arch_find_switch_table(file, insn);
1713 dest_insn = find_insn(file, table_reloc->sym->sec, table_reloc->addend);
1714 if (!dest_insn || !dest_insn->func || dest_insn->func->pfunc != func)
1724 * First pass: Mark the head of each jump table so that in the next pass,
1725 * we know when a given jump table ends and the next one starts.
1727 static void mark_func_jump_tables(struct objtool_file *file,
1728 struct symbol *func)
1730 struct instruction *insn, *last = NULL;
1731 struct reloc *reloc;
1733 func_for_each_insn(file, func, insn) {
1738 * Store back-pointers for unconditional forward jumps such
1739 * that find_jump_table() can back-track using those and
1740 * avoid some potentially confusing code.
1742 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1743 insn->offset > last->offset &&
1744 insn->jump_dest->offset > insn->offset &&
1745 !insn->jump_dest->first_jump_src) {
1747 insn->jump_dest->first_jump_src = insn;
1748 last = insn->jump_dest;
1751 if (insn->type != INSN_JUMP_DYNAMIC)
1754 reloc = find_jump_table(file, func, insn);
1756 reloc->jump_table_start = true;
1757 insn->jump_table = reloc;
1762 static int add_func_jump_tables(struct objtool_file *file,
1763 struct symbol *func)
1765 struct instruction *insn;
1768 func_for_each_insn(file, func, insn) {
1769 if (!insn->jump_table)
1772 ret = add_jump_table(file, insn, insn->jump_table);
1781 * For some switch statements, gcc generates a jump table in the .rodata
1782 * section which contains a list of addresses within the function to jump to.
1783 * This finds these jump tables and adds them to the insn->alts lists.
1785 static int add_jump_table_alts(struct objtool_file *file)
1787 struct section *sec;
1788 struct symbol *func;
1794 for_each_sec(file, sec) {
1795 list_for_each_entry(func, &sec->symbol_list, list) {
1796 if (func->type != STT_FUNC)
1799 mark_func_jump_tables(file, func);
1800 ret = add_func_jump_tables(file, func);
1809 static void set_func_state(struct cfi_state *state)
1811 state->cfa = initial_func_cfi.cfa;
1812 memcpy(&state->regs, &initial_func_cfi.regs,
1813 CFI_NUM_REGS * sizeof(struct cfi_reg));
1814 state->stack_size = initial_func_cfi.cfa.offset;
1817 static int read_unwind_hints(struct objtool_file *file)
1819 struct cfi_state cfi = init_cfi;
1820 struct section *sec, *relocsec;
1821 struct unwind_hint *hint;
1822 struct instruction *insn;
1823 struct reloc *reloc;
1826 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
1830 relocsec = sec->reloc;
1832 WARN("missing .rela.discard.unwind_hints section");
1836 if (sec->sh.sh_size % sizeof(struct unwind_hint)) {
1837 WARN("struct unwind_hint size mismatch");
1843 for (i = 0; i < sec->sh.sh_size / sizeof(struct unwind_hint); i++) {
1844 hint = (struct unwind_hint *)sec->data->d_buf + i;
1846 reloc = find_reloc_by_dest(file->elf, sec, i * sizeof(*hint));
1848 WARN("can't find reloc for unwind_hints[%d]", i);
1852 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1854 WARN("can't find insn for unwind_hints[%d]", i);
1860 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
1866 if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
1867 insn->restore = true;
1871 if (hint->type == UNWIND_HINT_TYPE_REGS_PARTIAL) {
1872 struct symbol *sym = find_symbol_by_offset(insn->sec, insn->offset);
1874 if (sym && sym->bind == STB_GLOBAL) {
1879 if (hint->type == UNWIND_HINT_TYPE_ENTRY) {
1880 hint->type = UNWIND_HINT_TYPE_CALL;
1884 if (hint->type == UNWIND_HINT_TYPE_FUNC) {
1885 insn->cfi = &func_cfi;
1892 if (arch_decode_hint_reg(hint->sp_reg, &cfi.cfa.base)) {
1893 WARN_FUNC("unsupported unwind_hint sp base reg %d",
1894 insn->sec, insn->offset, hint->sp_reg);
1898 cfi.cfa.offset = bswap_if_needed(hint->sp_offset);
1899 cfi.type = hint->type;
1900 cfi.end = hint->end;
1902 insn->cfi = cfi_hash_find_or_add(&cfi);
1908 static int read_retpoline_hints(struct objtool_file *file)
1910 struct section *sec;
1911 struct instruction *insn;
1912 struct reloc *reloc;
1914 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
1918 list_for_each_entry(reloc, &sec->reloc_list, list) {
1919 if (reloc->sym->type != STT_SECTION) {
1920 WARN("unexpected relocation symbol type in %s", sec->name);
1924 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1926 WARN("bad .discard.retpoline_safe entry");
1930 if (insn->type != INSN_JUMP_DYNAMIC &&
1931 insn->type != INSN_CALL_DYNAMIC &&
1932 insn->type != INSN_RETURN &&
1933 insn->type != INSN_NOP) {
1934 WARN_FUNC("retpoline_safe hint not an indirect jump/call/ret/nop",
1935 insn->sec, insn->offset);
1939 insn->retpoline_safe = true;
1945 static int read_instr_hints(struct objtool_file *file)
1947 struct section *sec;
1948 struct instruction *insn;
1949 struct reloc *reloc;
1951 sec = find_section_by_name(file->elf, ".rela.discard.instr_end");
1955 list_for_each_entry(reloc, &sec->reloc_list, list) {
1956 if (reloc->sym->type != STT_SECTION) {
1957 WARN("unexpected relocation symbol type in %s", sec->name);
1961 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1963 WARN("bad .discard.instr_end entry");
1970 sec = find_section_by_name(file->elf, ".rela.discard.instr_begin");
1974 list_for_each_entry(reloc, &sec->reloc_list, list) {
1975 if (reloc->sym->type != STT_SECTION) {
1976 WARN("unexpected relocation symbol type in %s", sec->name);
1980 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1982 WARN("bad .discard.instr_begin entry");
1992 static int read_intra_function_calls(struct objtool_file *file)
1994 struct instruction *insn;
1995 struct section *sec;
1996 struct reloc *reloc;
1998 sec = find_section_by_name(file->elf, ".rela.discard.intra_function_calls");
2002 list_for_each_entry(reloc, &sec->reloc_list, list) {
2003 unsigned long dest_off;
2005 if (reloc->sym->type != STT_SECTION) {
2006 WARN("unexpected relocation symbol type in %s",
2011 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2013 WARN("bad .discard.intra_function_call entry");
2017 if (insn->type != INSN_CALL) {
2018 WARN_FUNC("intra_function_call not a direct call",
2019 insn->sec, insn->offset);
2024 * Treat intra-function CALLs as JMPs, but with a stack_op.
2025 * See add_call_destinations(), which strips stack_ops from
2028 insn->type = INSN_JUMP_UNCONDITIONAL;
2030 dest_off = insn->offset + insn->len + insn->immediate;
2031 insn->jump_dest = find_insn(file, insn->sec, dest_off);
2032 if (!insn->jump_dest) {
2033 WARN_FUNC("can't find call dest at %s+0x%lx",
2034 insn->sec, insn->offset,
2035 insn->sec->name, dest_off);
2043 static int classify_symbols(struct objtool_file *file)
2045 struct section *sec;
2046 struct symbol *func;
2048 for_each_sec(file, sec) {
2049 list_for_each_entry(func, &sec->symbol_list, list) {
2050 if (func->bind != STB_GLOBAL)
2053 if (!strncmp(func->name, STATIC_CALL_TRAMP_PREFIX_STR,
2054 strlen(STATIC_CALL_TRAMP_PREFIX_STR)))
2055 func->static_call_tramp = true;
2057 if (arch_is_retpoline(func))
2058 func->retpoline_thunk = true;
2060 if (arch_is_rethunk(func))
2061 func->return_thunk = true;
2063 if (!strcmp(func->name, "__fentry__"))
2064 func->fentry = true;
2066 if (!strncmp(func->name, "__sanitizer_cov_", 16))
2074 static void mark_rodata(struct objtool_file *file)
2076 struct section *sec;
2080 * Search for the following rodata sections, each of which can
2081 * potentially contain jump tables:
2083 * - .rodata: can contain GCC switch tables
2084 * - .rodata.<func>: same, if -fdata-sections is being used
2085 * - .rodata..c_jump_table: contains C annotated jump tables
2087 * .rodata.str1.* sections are ignored; they don't contain jump tables.
2089 for_each_sec(file, sec) {
2090 if (!strncmp(sec->name, ".rodata", 7) &&
2091 !strstr(sec->name, ".str1.")) {
2097 file->rodata = found;
2100 static int decode_sections(struct objtool_file *file)
2106 ret = decode_instructions(file);
2110 ret = add_dead_ends(file);
2115 add_uaccess_safe(file);
2117 ret = add_ignore_alternatives(file);
2122 * Must be before add_{jump_call}_destination.
2124 ret = classify_symbols(file);
2129 * Must be before add_special_section_alts() as that depends on
2130 * jump_dest being set.
2132 ret = add_jump_destinations(file);
2136 ret = add_special_section_alts(file);
2141 * Must be before add_call_destination(); it changes INSN_CALL to
2144 ret = read_intra_function_calls(file);
2148 ret = add_call_destinations(file);
2152 ret = add_jump_table_alts(file);
2156 ret = read_unwind_hints(file);
2160 ret = read_retpoline_hints(file);
2164 ret = read_instr_hints(file);
2171 static bool is_fentry_call(struct instruction *insn)
2173 if (insn->type == INSN_CALL &&
2175 insn->call_dest->fentry)
2181 static bool has_modified_stack_frame(struct instruction *insn, struct insn_state *state)
2183 struct cfi_state *cfi = &state->cfi;
2186 if (cfi->cfa.base != initial_func_cfi.cfa.base || cfi->drap)
2189 if (cfi->cfa.offset != initial_func_cfi.cfa.offset)
2192 if (cfi->stack_size != initial_func_cfi.cfa.offset)
2195 for (i = 0; i < CFI_NUM_REGS; i++) {
2196 if (cfi->regs[i].base != initial_func_cfi.regs[i].base ||
2197 cfi->regs[i].offset != initial_func_cfi.regs[i].offset)
2204 static bool check_reg_frame_pos(const struct cfi_reg *reg,
2205 int expected_offset)
2207 return reg->base == CFI_CFA &&
2208 reg->offset == expected_offset;
2211 static bool has_valid_stack_frame(struct insn_state *state)
2213 struct cfi_state *cfi = &state->cfi;
2215 if (cfi->cfa.base == CFI_BP &&
2216 check_reg_frame_pos(&cfi->regs[CFI_BP], -cfi->cfa.offset) &&
2217 check_reg_frame_pos(&cfi->regs[CFI_RA], -cfi->cfa.offset + 8))
2220 if (cfi->drap && cfi->regs[CFI_BP].base == CFI_BP)
2226 static int update_cfi_state_regs(struct instruction *insn,
2227 struct cfi_state *cfi,
2228 struct stack_op *op)
2230 struct cfi_reg *cfa = &cfi->cfa;
2232 if (cfa->base != CFI_SP && cfa->base != CFI_SP_INDIRECT)
2236 if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
2240 if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
2243 /* add immediate to sp */
2244 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
2245 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
2246 cfa->offset -= op->src.offset;
2251 static void save_reg(struct cfi_state *cfi, unsigned char reg, int base, int offset)
2253 if (arch_callee_saved_reg(reg) &&
2254 cfi->regs[reg].base == CFI_UNDEFINED) {
2255 cfi->regs[reg].base = base;
2256 cfi->regs[reg].offset = offset;
2260 static void restore_reg(struct cfi_state *cfi, unsigned char reg)
2262 cfi->regs[reg].base = initial_func_cfi.regs[reg].base;
2263 cfi->regs[reg].offset = initial_func_cfi.regs[reg].offset;
2267 * A note about DRAP stack alignment:
2269 * GCC has the concept of a DRAP register, which is used to help keep track of
2270 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
2271 * register. The typical DRAP pattern is:
2273 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
2274 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
2275 * 41 ff 72 f8 pushq -0x8(%r10)
2277 * 48 89 e5 mov %rsp,%rbp
2284 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2287 * There are some variations in the epilogues, like:
2295 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2300 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
2301 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
2302 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
2303 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
2305 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2308 * Sometimes r13 is used as the DRAP register, in which case it's saved and
2309 * restored beforehand:
2312 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
2313 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
2315 * 49 8d 65 f0 lea -0x10(%r13),%rsp
2319 static int update_cfi_state(struct instruction *insn,
2320 struct instruction *next_insn,
2321 struct cfi_state *cfi, struct stack_op *op)
2323 struct cfi_reg *cfa = &cfi->cfa;
2324 struct cfi_reg *regs = cfi->regs;
2326 /* stack operations don't make sense with an undefined CFA */
2327 if (cfa->base == CFI_UNDEFINED) {
2329 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
2335 if (cfi->type == UNWIND_HINT_TYPE_REGS ||
2336 cfi->type == UNWIND_HINT_TYPE_REGS_PARTIAL)
2337 return update_cfi_state_regs(insn, cfi, op);
2339 switch (op->dest.type) {
2342 switch (op->src.type) {
2345 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
2346 cfa->base == CFI_SP &&
2347 check_reg_frame_pos(®s[CFI_BP], -cfa->offset)) {
2349 /* mov %rsp, %rbp */
2350 cfa->base = op->dest.reg;
2351 cfi->bp_scratch = false;
2354 else if (op->src.reg == CFI_SP &&
2355 op->dest.reg == CFI_BP && cfi->drap) {
2357 /* drap: mov %rsp, %rbp */
2358 regs[CFI_BP].base = CFI_BP;
2359 regs[CFI_BP].offset = -cfi->stack_size;
2360 cfi->bp_scratch = false;
2363 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2368 * This is needed for the rare case where GCC
2375 cfi->vals[op->dest.reg].base = CFI_CFA;
2376 cfi->vals[op->dest.reg].offset = -cfi->stack_size;
2379 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
2380 (cfa->base == CFI_BP || cfa->base == cfi->drap_reg)) {
2385 * Restore the original stack pointer (Clang).
2387 cfi->stack_size = -cfi->regs[CFI_BP].offset;
2390 else if (op->dest.reg == cfa->base) {
2392 /* mov %reg, %rsp */
2393 if (cfa->base == CFI_SP &&
2394 cfi->vals[op->src.reg].base == CFI_CFA) {
2397 * This is needed for the rare case
2398 * where GCC does something dumb like:
2400 * lea 0x8(%rsp), %rcx
2404 cfa->offset = -cfi->vals[op->src.reg].offset;
2405 cfi->stack_size = cfa->offset;
2407 } else if (cfa->base == CFI_SP &&
2408 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2409 cfi->vals[op->src.reg].offset == cfa->offset) {
2414 * 1: mov %rsp, (%[tos])
2415 * 2: mov %[tos], %rsp
2421 * 1 - places a pointer to the previous
2422 * stack at the Top-of-Stack of the
2425 * 2 - switches to the new stack.
2427 * 3 - pops the Top-of-Stack to restore
2428 * the original stack.
2430 * Note: we set base to SP_INDIRECT
2431 * here and preserve offset. Therefore
2432 * when the unwinder reaches ToS it
2433 * will dereference SP and then add the
2434 * offset to find the next frame, IOW:
2437 cfa->base = CFI_SP_INDIRECT;
2440 cfa->base = CFI_UNDEFINED;
2445 else if (op->dest.reg == CFI_SP &&
2446 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2447 cfi->vals[op->src.reg].offset == cfa->offset) {
2450 * The same stack swizzle case 2) as above. But
2451 * because we can't change cfa->base, case 3)
2452 * will become a regular POP. Pretend we're a
2453 * PUSH so things don't go unbalanced.
2455 cfi->stack_size += 8;
2462 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
2465 cfi->stack_size -= op->src.offset;
2466 if (cfa->base == CFI_SP)
2467 cfa->offset -= op->src.offset;
2471 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
2473 /* lea disp(%rbp), %rsp */
2474 cfi->stack_size = -(op->src.offset + regs[CFI_BP].offset);
2478 if (!cfi->drap && op->src.reg == CFI_SP &&
2479 op->dest.reg == CFI_BP && cfa->base == CFI_SP &&
2480 check_reg_frame_pos(®s[CFI_BP], -cfa->offset + op->src.offset)) {
2482 /* lea disp(%rsp), %rbp */
2484 cfa->offset -= op->src.offset;
2485 cfi->bp_scratch = false;
2489 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2491 /* drap: lea disp(%rsp), %drap */
2492 cfi->drap_reg = op->dest.reg;
2495 * lea disp(%rsp), %reg
2497 * This is needed for the rare case where GCC
2498 * does something dumb like:
2500 * lea 0x8(%rsp), %rcx
2504 cfi->vals[op->dest.reg].base = CFI_CFA;
2505 cfi->vals[op->dest.reg].offset = \
2506 -cfi->stack_size + op->src.offset;
2511 if (cfi->drap && op->dest.reg == CFI_SP &&
2512 op->src.reg == cfi->drap_reg) {
2514 /* drap: lea disp(%drap), %rsp */
2516 cfa->offset = cfi->stack_size = -op->src.offset;
2517 cfi->drap_reg = CFI_UNDEFINED;
2522 if (op->dest.reg == cfi->cfa.base && !(next_insn && next_insn->hint)) {
2523 WARN_FUNC("unsupported stack register modification",
2524 insn->sec, insn->offset);
2531 if (op->dest.reg != CFI_SP ||
2532 (cfi->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
2533 (cfi->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
2534 WARN_FUNC("unsupported stack pointer realignment",
2535 insn->sec, insn->offset);
2539 if (cfi->drap_reg != CFI_UNDEFINED) {
2540 /* drap: and imm, %rsp */
2541 cfa->base = cfi->drap_reg;
2542 cfa->offset = cfi->stack_size = 0;
2547 * Older versions of GCC (4.8ish) realign the stack
2548 * without DRAP, with a frame pointer.
2555 if (op->dest.reg == CFI_SP && cfa->base == CFI_SP_INDIRECT) {
2557 /* pop %rsp; # restore from a stack swizzle */
2562 if (!cfi->drap && op->dest.reg == cfa->base) {
2568 if (cfi->drap && cfa->base == CFI_BP_INDIRECT &&
2569 op->dest.reg == cfi->drap_reg &&
2570 cfi->drap_offset == -cfi->stack_size) {
2572 /* drap: pop %drap */
2573 cfa->base = cfi->drap_reg;
2575 cfi->drap_offset = -1;
2577 } else if (cfi->stack_size == -regs[op->dest.reg].offset) {
2580 restore_reg(cfi, op->dest.reg);
2583 cfi->stack_size -= 8;
2584 if (cfa->base == CFI_SP)
2589 case OP_SRC_REG_INDIRECT:
2590 if (!cfi->drap && op->dest.reg == cfa->base &&
2591 op->dest.reg == CFI_BP) {
2593 /* mov disp(%rsp), %rbp */
2595 cfa->offset = cfi->stack_size;
2598 if (cfi->drap && op->src.reg == CFI_BP &&
2599 op->src.offset == cfi->drap_offset) {
2601 /* drap: mov disp(%rbp), %drap */
2602 cfa->base = cfi->drap_reg;
2604 cfi->drap_offset = -1;
2607 if (cfi->drap && op->src.reg == CFI_BP &&
2608 op->src.offset == regs[op->dest.reg].offset) {
2610 /* drap: mov disp(%rbp), %reg */
2611 restore_reg(cfi, op->dest.reg);
2613 } else if (op->src.reg == cfa->base &&
2614 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
2616 /* mov disp(%rbp), %reg */
2617 /* mov disp(%rsp), %reg */
2618 restore_reg(cfi, op->dest.reg);
2620 } else if (op->src.reg == CFI_SP &&
2621 op->src.offset == regs[op->dest.reg].offset + cfi->stack_size) {
2623 /* mov disp(%rsp), %reg */
2624 restore_reg(cfi, op->dest.reg);
2630 WARN_FUNC("unknown stack-related instruction",
2631 insn->sec, insn->offset);
2639 cfi->stack_size += 8;
2640 if (cfa->base == CFI_SP)
2643 if (op->src.type != OP_SRC_REG)
2647 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2649 /* drap: push %drap */
2650 cfa->base = CFI_BP_INDIRECT;
2651 cfa->offset = -cfi->stack_size;
2653 /* save drap so we know when to restore it */
2654 cfi->drap_offset = -cfi->stack_size;
2656 } else if (op->src.reg == CFI_BP && cfa->base == cfi->drap_reg) {
2658 /* drap: push %rbp */
2659 cfi->stack_size = 0;
2663 /* drap: push %reg */
2664 save_reg(cfi, op->src.reg, CFI_BP, -cfi->stack_size);
2670 save_reg(cfi, op->src.reg, CFI_CFA, -cfi->stack_size);
2673 /* detect when asm code uses rbp as a scratch register */
2674 if (!no_fp && insn->func && op->src.reg == CFI_BP &&
2675 cfa->base != CFI_BP)
2676 cfi->bp_scratch = true;
2679 case OP_DEST_REG_INDIRECT:
2682 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2684 /* drap: mov %drap, disp(%rbp) */
2685 cfa->base = CFI_BP_INDIRECT;
2686 cfa->offset = op->dest.offset;
2688 /* save drap offset so we know when to restore it */
2689 cfi->drap_offset = op->dest.offset;
2692 /* drap: mov reg, disp(%rbp) */
2693 save_reg(cfi, op->src.reg, CFI_BP, op->dest.offset);
2696 } else if (op->dest.reg == cfa->base) {
2698 /* mov reg, disp(%rbp) */
2699 /* mov reg, disp(%rsp) */
2700 save_reg(cfi, op->src.reg, CFI_CFA,
2701 op->dest.offset - cfi->cfa.offset);
2703 } else if (op->dest.reg == CFI_SP) {
2705 /* mov reg, disp(%rsp) */
2706 save_reg(cfi, op->src.reg, CFI_CFA,
2707 op->dest.offset - cfi->stack_size);
2709 } else if (op->src.reg == CFI_SP && op->dest.offset == 0) {
2711 /* mov %rsp, (%reg); # setup a stack swizzle. */
2712 cfi->vals[op->dest.reg].base = CFI_SP_INDIRECT;
2713 cfi->vals[op->dest.reg].offset = cfa->offset;
2719 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
2720 WARN_FUNC("unknown stack-related memory operation",
2721 insn->sec, insn->offset);
2726 cfi->stack_size -= 8;
2727 if (cfa->base == CFI_SP)
2733 WARN_FUNC("unknown stack-related instruction",
2734 insn->sec, insn->offset);
2742 * The stack layouts of alternatives instructions can sometimes diverge when
2743 * they have stack modifications. That's fine as long as the potential stack
2744 * layouts don't conflict at any given potential instruction boundary.
2746 * Flatten the CFIs of the different alternative code streams (both original
2747 * and replacement) into a single shared CFI array which can be used to detect
2748 * conflicts and nicely feed a linear array of ORC entries to the unwinder.
2750 static int propagate_alt_cfi(struct objtool_file *file, struct instruction *insn)
2752 struct cfi_state **alt_cfi;
2755 if (!insn->alt_group)
2759 WARN("CFI missing");
2763 alt_cfi = insn->alt_group->cfi;
2764 group_off = insn->offset - insn->alt_group->first_insn->offset;
2766 if (!alt_cfi[group_off]) {
2767 alt_cfi[group_off] = insn->cfi;
2769 if (cficmp(alt_cfi[group_off], insn->cfi)) {
2770 WARN_FUNC("stack layout conflict in alternatives",
2771 insn->sec, insn->offset);
2779 static int handle_insn_ops(struct instruction *insn,
2780 struct instruction *next_insn,
2781 struct insn_state *state)
2783 struct stack_op *op;
2785 list_for_each_entry(op, &insn->stack_ops, list) {
2787 if (update_cfi_state(insn, next_insn, &state->cfi, op))
2790 if (!insn->alt_group)
2793 if (op->dest.type == OP_DEST_PUSHF) {
2794 if (!state->uaccess_stack) {
2795 state->uaccess_stack = 1;
2796 } else if (state->uaccess_stack >> 31) {
2797 WARN_FUNC("PUSHF stack exhausted",
2798 insn->sec, insn->offset);
2801 state->uaccess_stack <<= 1;
2802 state->uaccess_stack |= state->uaccess;
2805 if (op->src.type == OP_SRC_POPF) {
2806 if (state->uaccess_stack) {
2807 state->uaccess = state->uaccess_stack & 1;
2808 state->uaccess_stack >>= 1;
2809 if (state->uaccess_stack == 1)
2810 state->uaccess_stack = 0;
2818 static bool insn_cfi_match(struct instruction *insn, struct cfi_state *cfi2)
2820 struct cfi_state *cfi1 = insn->cfi;
2824 WARN("CFI missing");
2828 if (memcmp(&cfi1->cfa, &cfi2->cfa, sizeof(cfi1->cfa))) {
2830 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
2831 insn->sec, insn->offset,
2832 cfi1->cfa.base, cfi1->cfa.offset,
2833 cfi2->cfa.base, cfi2->cfa.offset);
2835 } else if (memcmp(&cfi1->regs, &cfi2->regs, sizeof(cfi1->regs))) {
2836 for (i = 0; i < CFI_NUM_REGS; i++) {
2837 if (!memcmp(&cfi1->regs[i], &cfi2->regs[i],
2838 sizeof(struct cfi_reg)))
2841 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
2842 insn->sec, insn->offset,
2843 i, cfi1->regs[i].base, cfi1->regs[i].offset,
2844 i, cfi2->regs[i].base, cfi2->regs[i].offset);
2848 } else if (cfi1->type != cfi2->type) {
2850 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
2851 insn->sec, insn->offset, cfi1->type, cfi2->type);
2853 } else if (cfi1->drap != cfi2->drap ||
2854 (cfi1->drap && cfi1->drap_reg != cfi2->drap_reg) ||
2855 (cfi1->drap && cfi1->drap_offset != cfi2->drap_offset)) {
2857 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
2858 insn->sec, insn->offset,
2859 cfi1->drap, cfi1->drap_reg, cfi1->drap_offset,
2860 cfi2->drap, cfi2->drap_reg, cfi2->drap_offset);
2868 static inline bool func_uaccess_safe(struct symbol *func)
2871 return func->uaccess_safe;
2876 static inline const char *call_dest_name(struct instruction *insn)
2878 if (insn->call_dest)
2879 return insn->call_dest->name;
2884 static inline bool noinstr_call_dest(struct symbol *func)
2887 * We can't deal with indirect function calls at present;
2888 * assume they're instrumented.
2894 * If the symbol is from a noinstr section; we good.
2896 if (func->sec->noinstr)
2900 * The __ubsan_handle_*() calls are like WARN(), they only happen when
2901 * something 'BAD' happened. At the risk of taking the machine down,
2902 * let them proceed to get the message out.
2904 if (!strncmp(func->name, "__ubsan_handle_", 15))
2910 static int validate_call(struct instruction *insn, struct insn_state *state)
2912 if (state->noinstr && state->instr <= 0 &&
2913 !noinstr_call_dest(insn->call_dest)) {
2914 WARN_FUNC("call to %s() leaves .noinstr.text section",
2915 insn->sec, insn->offset, call_dest_name(insn));
2919 if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
2920 WARN_FUNC("call to %s() with UACCESS enabled",
2921 insn->sec, insn->offset, call_dest_name(insn));
2926 WARN_FUNC("call to %s() with DF set",
2927 insn->sec, insn->offset, call_dest_name(insn));
2934 static int validate_sibling_call(struct instruction *insn, struct insn_state *state)
2936 if (has_modified_stack_frame(insn, state)) {
2937 WARN_FUNC("sibling call from callable instruction with modified stack frame",
2938 insn->sec, insn->offset);
2942 return validate_call(insn, state);
2945 static int validate_return(struct symbol *func, struct instruction *insn, struct insn_state *state)
2947 if (state->noinstr && state->instr > 0) {
2948 WARN_FUNC("return with instrumentation enabled",
2949 insn->sec, insn->offset);
2953 if (state->uaccess && !func_uaccess_safe(func)) {
2954 WARN_FUNC("return with UACCESS enabled",
2955 insn->sec, insn->offset);
2959 if (!state->uaccess && func_uaccess_safe(func)) {
2960 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function",
2961 insn->sec, insn->offset);
2966 WARN_FUNC("return with DF set",
2967 insn->sec, insn->offset);
2971 if (func && has_modified_stack_frame(insn, state)) {
2972 WARN_FUNC("return with modified stack frame",
2973 insn->sec, insn->offset);
2977 if (state->cfi.bp_scratch) {
2978 WARN_FUNC("BP used as a scratch register",
2979 insn->sec, insn->offset);
2986 static struct instruction *next_insn_to_validate(struct objtool_file *file,
2987 struct instruction *insn)
2989 struct alt_group *alt_group = insn->alt_group;
2992 * Simulate the fact that alternatives are patched in-place. When the
2993 * end of a replacement alt_group is reached, redirect objtool flow to
2994 * the end of the original alt_group.
2996 if (alt_group && insn == alt_group->last_insn && alt_group->orig_group)
2997 return next_insn_same_sec(file, alt_group->orig_group->last_insn);
2999 return next_insn_same_sec(file, insn);
3003 * Follow the branch starting at the given instruction, and recursively follow
3004 * any other branches (jumps). Meanwhile, track the frame pointer state at
3005 * each instruction and validate all the rules described in
3006 * tools/objtool/Documentation/stack-validation.txt.
3008 static int validate_branch(struct objtool_file *file, struct symbol *func,
3009 struct instruction *insn, struct insn_state state)
3011 struct alternative *alt;
3012 struct instruction *next_insn, *prev_insn = NULL;
3013 struct section *sec;
3020 next_insn = next_insn_to_validate(file, insn);
3022 if (file->c_file && func && insn->func && func != insn->func->pfunc) {
3023 WARN("%s() falls through to next function %s()",
3024 func->name, insn->func->name);
3028 if (func && insn->ignore) {
3029 WARN_FUNC("BUG: why am I validating an ignored function?",
3034 visited = VISITED_BRANCH << state.uaccess;
3035 if (insn->visited & VISITED_BRANCH_MASK) {
3036 if (!insn->hint && !insn_cfi_match(insn, &state.cfi))
3039 if (insn->visited & visited)
3046 state.instr += insn->instr;
3049 if (insn->restore) {
3050 struct instruction *save_insn, *i;
3055 sym_for_each_insn_continue_reverse(file, func, i) {
3063 WARN_FUNC("no corresponding CFI save for CFI restore",
3068 if (!save_insn->visited) {
3069 WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
3074 insn->cfi = save_insn->cfi;
3078 state.cfi = *insn->cfi;
3080 /* XXX track if we actually changed state.cfi */
3082 if (prev_insn && !cficmp(prev_insn->cfi, &state.cfi)) {
3083 insn->cfi = prev_insn->cfi;
3086 insn->cfi = cfi_hash_find_or_add(&state.cfi);
3090 insn->visited |= visited;
3092 if (propagate_alt_cfi(file, insn))
3095 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3096 bool skip_orig = false;
3098 list_for_each_entry(alt, &insn->alts, list) {
3102 ret = validate_branch(file, func, alt->insn, state);
3105 BT_FUNC("(alt)", insn);
3114 if (handle_insn_ops(insn, next_insn, &state))
3117 switch (insn->type) {
3120 if (sls && !insn->retpoline_safe &&
3121 next_insn && next_insn->type != INSN_TRAP) {
3122 WARN_FUNC("missing int3 after ret",
3123 insn->sec, insn->offset);
3125 return validate_return(func, insn, &state);
3128 case INSN_CALL_DYNAMIC:
3129 ret = validate_call(insn, &state);
3133 if (!no_fp && func && !is_fentry_call(insn) &&
3134 !has_valid_stack_frame(&state)) {
3135 WARN_FUNC("call without frame pointer save/setup",
3140 if (dead_end_function(file, insn->call_dest))
3145 case INSN_JUMP_CONDITIONAL:
3146 case INSN_JUMP_UNCONDITIONAL:
3147 if (is_sibling_call(insn)) {
3148 ret = validate_sibling_call(insn, &state);
3152 } else if (insn->jump_dest) {
3153 ret = validate_branch(file, func,
3154 insn->jump_dest, state);
3157 BT_FUNC("(branch)", insn);
3162 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3167 case INSN_JUMP_DYNAMIC:
3168 if (sls && !insn->retpoline_safe &&
3169 next_insn && next_insn->type != INSN_TRAP) {
3170 WARN_FUNC("missing int3 after indirect jump",
3171 insn->sec, insn->offset);
3175 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3176 if (is_sibling_call(insn)) {
3177 ret = validate_sibling_call(insn, &state);
3182 if (insn->type == INSN_JUMP_DYNAMIC)
3187 case INSN_CONTEXT_SWITCH:
3188 if (func && (!next_insn || !next_insn->hint)) {
3189 WARN_FUNC("unsupported instruction in callable function",
3196 if (state.uaccess) {
3197 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
3201 state.uaccess = true;
3205 if (!state.uaccess && func) {
3206 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
3210 if (func_uaccess_safe(func) && !state.uaccess_stack) {
3211 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
3215 state.uaccess = false;
3220 WARN_FUNC("recursive STD", sec, insn->offset);
3228 if (!state.df && func) {
3229 WARN_FUNC("redundant CLD", sec, insn->offset);
3244 if (state.cfi.cfa.base == CFI_UNDEFINED)
3246 WARN("%s: unexpected end of section", sec->name);
3257 static int validate_unwind_hints(struct objtool_file *file, struct section *sec)
3259 struct instruction *insn;
3260 struct insn_state state;
3261 int ret, warnings = 0;
3266 init_insn_state(&state, sec);
3269 insn = find_insn(file, sec, 0);
3273 insn = list_first_entry(&file->insn_list, typeof(*insn), list);
3276 while (&insn->list != &file->insn_list && (!sec || insn->sec == sec)) {
3277 if (insn->hint && !insn->visited) {
3278 ret = validate_branch(file, insn->func, insn, state);
3279 if (ret && backtrace)
3280 BT_FUNC("<=== (hint)", insn);
3284 insn = list_next_entry(insn, list);
3291 * Validate rethunk entry constraint: must untrain RET before the first RET.
3293 * Follow every branch (intra-function) and ensure ANNOTATE_UNRET_END comes
3294 * before an actual RET instruction.
3296 static int validate_entry(struct objtool_file *file, struct instruction *insn)
3298 struct instruction *next, *dest;
3299 int ret, warnings = 0;
3302 next = next_insn_to_validate(file, insn);
3304 if (insn->visited & VISITED_ENTRY)
3307 insn->visited |= VISITED_ENTRY;
3309 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3310 struct alternative *alt;
3311 bool skip_orig = false;
3313 list_for_each_entry(alt, &insn->alts, list) {
3317 ret = validate_entry(file, alt->insn);
3320 BT_FUNC("(alt)", insn);
3329 switch (insn->type) {
3331 case INSN_CALL_DYNAMIC:
3332 case INSN_JUMP_DYNAMIC:
3333 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3334 WARN_FUNC("early indirect call", insn->sec, insn->offset);
3337 case INSN_JUMP_UNCONDITIONAL:
3338 case INSN_JUMP_CONDITIONAL:
3339 if (!is_sibling_call(insn)) {
3340 if (!insn->jump_dest) {
3341 WARN_FUNC("unresolved jump target after linking?!?",
3342 insn->sec, insn->offset);
3345 ret = validate_entry(file, insn->jump_dest);
3348 BT_FUNC("(branch%s)", insn,
3349 insn->type == INSN_JUMP_CONDITIONAL ? "-cond" : "");
3354 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3362 dest = find_insn(file, insn->call_dest->sec,
3363 insn->call_dest->offset);
3365 WARN("Unresolved function after linking!?: %s",
3366 insn->call_dest->name);
3370 ret = validate_entry(file, dest);
3373 BT_FUNC("(call)", insn);
3377 * If a call returns without error, it must have seen UNTRAIN_RET.
3378 * Therefore any non-error return is a success.
3383 WARN_FUNC("RET before UNTRAIN", insn->sec, insn->offset);
3387 if (insn->retpoline_safe)
3396 WARN_FUNC("teh end!", insn->sec, insn->offset);
3406 * Validate that all branches starting at 'insn->entry' encounter UNRET_END
3409 static int validate_unret(struct objtool_file *file)
3411 struct instruction *insn;
3412 int ret, warnings = 0;
3414 for_each_insn(file, insn) {
3418 ret = validate_entry(file, insn);
3420 WARN_FUNC("Failed UNRET validation", insn->sec, insn->offset);
3429 static int validate_retpoline(struct objtool_file *file)
3431 struct instruction *insn;
3434 for_each_insn(file, insn) {
3435 if (insn->type != INSN_JUMP_DYNAMIC &&
3436 insn->type != INSN_CALL_DYNAMIC &&
3437 insn->type != INSN_RETURN)
3440 if (insn->retpoline_safe)
3444 * .init.text code is ran before userspace and thus doesn't
3445 * strictly need retpolines, except for modules which are
3446 * loaded late, they very much do need retpoline in their
3449 if (!strcmp(insn->sec->name, ".init.text") && !module)
3452 if (insn->type == INSN_RETURN) {
3454 WARN_FUNC("'naked' return found in RETHUNK build",
3455 insn->sec, insn->offset);
3459 WARN_FUNC("indirect %s found in RETPOLINE build",
3460 insn->sec, insn->offset,
3461 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
3470 static bool is_kasan_insn(struct instruction *insn)
3472 return (insn->type == INSN_CALL &&
3473 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
3476 static bool is_ubsan_insn(struct instruction *insn)
3478 return (insn->type == INSN_CALL &&
3479 !strcmp(insn->call_dest->name,
3480 "__ubsan_handle_builtin_unreachable"));
3483 static bool ignore_unreachable_insn(struct objtool_file *file, struct instruction *insn)
3486 struct instruction *prev_insn;
3488 if (insn->ignore || insn->type == INSN_NOP || insn->type == INSN_TRAP)
3492 * Ignore any unused exceptions. This can happen when a whitelisted
3493 * function has an exception table entry.
3495 * Also ignore alternative replacement instructions. This can happen
3496 * when a whitelisted function uses one of the ALTERNATIVE macros.
3498 if (!strcmp(insn->sec->name, ".fixup") ||
3499 !strcmp(insn->sec->name, ".altinstr_replacement") ||
3500 !strcmp(insn->sec->name, ".altinstr_aux"))
3507 * CONFIG_UBSAN_TRAP inserts a UD2 when it sees
3508 * __builtin_unreachable(). The BUG() macro has an unreachable() after
3509 * the UD2, which causes GCC's undefined trap logic to emit another UD2
3510 * (or occasionally a JMP to UD2).
3512 * It may also insert a UD2 after calling a __noreturn function.
3514 prev_insn = list_prev_entry(insn, list);
3515 if ((prev_insn->dead_end || dead_end_function(file, prev_insn->call_dest)) &&
3516 (insn->type == INSN_BUG ||
3517 (insn->type == INSN_JUMP_UNCONDITIONAL &&
3518 insn->jump_dest && insn->jump_dest->type == INSN_BUG)))
3522 * Check if this (or a subsequent) instruction is related to
3523 * CONFIG_UBSAN or CONFIG_KASAN.
3525 * End the search at 5 instructions to avoid going into the weeds.
3527 for (i = 0; i < 5; i++) {
3529 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
3532 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
3533 if (insn->jump_dest &&
3534 insn->jump_dest->func == insn->func) {
3535 insn = insn->jump_dest;
3542 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
3545 insn = list_next_entry(insn, list);
3551 static int validate_symbol(struct objtool_file *file, struct section *sec,
3552 struct symbol *sym, struct insn_state *state)
3554 struct instruction *insn;
3558 WARN("%s() is missing an ELF size annotation", sym->name);
3562 if (sym->pfunc != sym || sym->alias != sym)
3565 insn = find_insn(file, sec, sym->offset);
3566 if (!insn || insn->ignore || insn->visited)
3569 state->uaccess = sym->uaccess_safe;
3571 ret = validate_branch(file, insn->func, insn, *state);
3572 if (ret && backtrace)
3573 BT_FUNC("<=== (sym)", insn);
3577 static int validate_section(struct objtool_file *file, struct section *sec)
3579 struct insn_state state;
3580 struct symbol *func;
3583 list_for_each_entry(func, &sec->symbol_list, list) {
3584 if (func->type != STT_FUNC)
3587 init_insn_state(&state, sec);
3588 set_func_state(&state.cfi);
3590 warnings += validate_symbol(file, sec, func, &state);
3596 static int validate_vmlinux_functions(struct objtool_file *file)
3598 struct section *sec;
3601 sec = find_section_by_name(file->elf, ".noinstr.text");
3603 warnings += validate_section(file, sec);
3604 warnings += validate_unwind_hints(file, sec);
3607 sec = find_section_by_name(file->elf, ".entry.text");
3609 warnings += validate_section(file, sec);
3610 warnings += validate_unwind_hints(file, sec);
3616 static int validate_functions(struct objtool_file *file)
3618 struct section *sec;
3621 for_each_sec(file, sec) {
3622 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
3625 warnings += validate_section(file, sec);
3631 static int validate_reachable_instructions(struct objtool_file *file)
3633 struct instruction *insn;
3635 if (file->ignore_unreachables)
3638 for_each_insn(file, insn) {
3639 if (insn->visited || ignore_unreachable_insn(file, insn))
3642 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
3649 int check(struct objtool_file *file)
3651 int ret, warnings = 0;
3653 arch_initial_func_cfi_state(&initial_func_cfi);
3654 init_cfi_state(&init_cfi);
3655 init_cfi_state(&func_cfi);
3656 set_func_state(&func_cfi);
3658 if (!cfi_hash_alloc(1UL << (file->elf->symbol_bits - 3)))
3661 cfi_hash_add(&init_cfi);
3662 cfi_hash_add(&func_cfi);
3664 ret = decode_sections(file);
3670 if (list_empty(&file->insn_list))
3673 if (vmlinux && !validate_dup) {
3674 ret = validate_vmlinux_functions(file);
3683 ret = validate_retpoline(file);
3689 ret = validate_functions(file);
3694 ret = validate_unwind_hints(file, NULL);
3701 * Must be after validate_branch() and friends, it plays
3702 * further games with insn->visited.
3704 ret = validate_unret(file);
3711 ret = validate_reachable_instructions(file);
3717 ret = create_static_call_sections(file);
3723 ret = create_retpoline_sites_sections(file);
3730 ret = create_return_sites_sections(file);
3737 ret = create_mcount_loc_sections(file);
3744 printf("nr_insns_visited: %ld\n", nr_insns_visited);
3745 printf("nr_cfi: %ld\n", nr_cfi);
3746 printf("nr_cfi_reused: %ld\n", nr_cfi_reused);
3747 printf("nr_cfi_cache: %ld\n", nr_cfi_cache);
3752 * For now, don't fail the kernel build on fatal warnings. These
3753 * errors are still fairly common due to the growing matrix of
3754 * supported toolchains and their recent pace of change.