1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
11 #include <objtool/builtin.h>
12 #include <objtool/cfi.h>
13 #include <objtool/arch.h>
14 #include <objtool/check.h>
15 #include <objtool/special.h>
16 #include <objtool/warn.h>
17 #include <objtool/endianness.h>
19 #include <linux/objtool.h>
20 #include <linux/hashtable.h>
21 #include <linux/kernel.h>
22 #include <linux/static_call_types.h>
25 struct list_head list;
26 struct instruction *insn;
30 static unsigned long nr_cfi, nr_cfi_reused, nr_cfi_cache;
32 static struct cfi_init_state initial_func_cfi;
33 static struct cfi_state init_cfi;
34 static struct cfi_state func_cfi;
36 struct instruction *find_insn(struct objtool_file *file,
37 struct section *sec, unsigned long offset)
39 struct instruction *insn;
41 hash_for_each_possible(file->insn_hash, insn, hash, sec_offset_hash(sec, offset)) {
42 if (insn->sec == sec && insn->offset == offset)
49 static struct instruction *next_insn_same_sec(struct objtool_file *file,
50 struct instruction *insn)
52 struct instruction *next = list_next_entry(insn, list);
54 if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
60 static struct instruction *next_insn_same_func(struct objtool_file *file,
61 struct instruction *insn)
63 struct instruction *next = list_next_entry(insn, list);
64 struct symbol *func = insn->func;
69 if (&next->list != &file->insn_list && next->func == func)
72 /* Check if we're already in the subfunction: */
73 if (func == func->cfunc)
76 /* Move to the subfunction: */
77 return find_insn(file, func->cfunc->sec, func->cfunc->offset);
80 static struct instruction *prev_insn_same_sym(struct objtool_file *file,
81 struct instruction *insn)
83 struct instruction *prev = list_prev_entry(insn, list);
85 if (&prev->list != &file->insn_list && prev->func == insn->func)
91 #define func_for_each_insn(file, func, insn) \
92 for (insn = find_insn(file, func->sec, func->offset); \
94 insn = next_insn_same_func(file, insn))
96 #define sym_for_each_insn(file, sym, insn) \
97 for (insn = find_insn(file, sym->sec, sym->offset); \
98 insn && &insn->list != &file->insn_list && \
99 insn->sec == sym->sec && \
100 insn->offset < sym->offset + sym->len; \
101 insn = list_next_entry(insn, list))
103 #define sym_for_each_insn_continue_reverse(file, sym, insn) \
104 for (insn = list_prev_entry(insn, list); \
105 &insn->list != &file->insn_list && \
106 insn->sec == sym->sec && insn->offset >= sym->offset; \
107 insn = list_prev_entry(insn, list))
109 #define sec_for_each_insn_from(file, insn) \
110 for (; insn; insn = next_insn_same_sec(file, insn))
112 #define sec_for_each_insn_continue(file, insn) \
113 for (insn = next_insn_same_sec(file, insn); insn; \
114 insn = next_insn_same_sec(file, insn))
116 static bool is_jump_table_jump(struct instruction *insn)
118 struct alt_group *alt_group = insn->alt_group;
120 if (insn->jump_table)
123 /* Retpoline alternative for a jump table? */
124 return alt_group && alt_group->orig_group &&
125 alt_group->orig_group->first_insn->jump_table;
128 static bool is_sibling_call(struct instruction *insn)
131 * Assume only ELF functions can make sibling calls. This ensures
132 * sibling call detection consistency between vmlinux.o and individual
138 /* An indirect jump is either a sibling call or a jump to a table. */
139 if (insn->type == INSN_JUMP_DYNAMIC)
140 return !is_jump_table_jump(insn);
142 /* add_jump_destinations() sets insn->call_dest for sibling calls. */
143 return (is_static_jump(insn) && insn->call_dest);
147 * This checks to see if the given function is a "noreturn" function.
149 * For global functions which are outside the scope of this object file, we
150 * have to keep a manual list of them.
152 * For local functions, we have to detect them manually by simply looking for
153 * the lack of a return instruction.
155 static bool __dead_end_function(struct objtool_file *file, struct symbol *func,
159 struct instruction *insn;
163 * Unfortunately these have to be hard coded because the noreturn
164 * attribute isn't provided in ELF data.
166 static const char * const global_noreturns[] = {
171 "__module_put_and_exit",
177 "machine_real_restart",
178 "rewind_stack_do_exit",
179 "kunit_try_catch_throw",
181 "cpu_bringup_and_idle",
187 if (func->bind == STB_WEAK)
190 if (func->bind == STB_GLOBAL)
191 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
192 if (!strcmp(func->name, global_noreturns[i]))
198 insn = find_insn(file, func->sec, func->offset);
202 func_for_each_insn(file, func, insn) {
205 if (insn->type == INSN_RETURN)
213 * A function can have a sibling call instead of a return. In that
214 * case, the function's dead-end status depends on whether the target
215 * of the sibling call returns.
217 func_for_each_insn(file, func, insn) {
218 if (is_sibling_call(insn)) {
219 struct instruction *dest = insn->jump_dest;
222 /* sibling call to another file */
225 /* local sibling call */
226 if (recursion == 5) {
228 * Infinite recursion: two functions have
229 * sibling calls to each other. This is a very
230 * rare case. It means they aren't dead ends.
235 return __dead_end_function(file, dest->func, recursion+1);
242 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
244 return __dead_end_function(file, func, 0);
247 static void init_cfi_state(struct cfi_state *cfi)
251 for (i = 0; i < CFI_NUM_REGS; i++) {
252 cfi->regs[i].base = CFI_UNDEFINED;
253 cfi->vals[i].base = CFI_UNDEFINED;
255 cfi->cfa.base = CFI_UNDEFINED;
256 cfi->drap_reg = CFI_UNDEFINED;
257 cfi->drap_offset = -1;
260 static void init_insn_state(struct insn_state *state, struct section *sec)
262 memset(state, 0, sizeof(*state));
263 init_cfi_state(&state->cfi);
266 * We need the full vmlinux for noinstr validation, otherwise we can
267 * not correctly determine insn->call_dest->sec (external symbols do
268 * not have a section).
270 if (vmlinux && noinstr && sec)
271 state->noinstr = sec->noinstr;
274 static struct cfi_state *cfi_alloc(void)
276 struct cfi_state *cfi = calloc(sizeof(struct cfi_state), 1);
278 WARN("calloc failed");
286 static struct hlist_head *cfi_hash;
288 static inline bool cficmp(struct cfi_state *cfi1, struct cfi_state *cfi2)
290 return memcmp((void *)cfi1 + sizeof(cfi1->hash),
291 (void *)cfi2 + sizeof(cfi2->hash),
292 sizeof(struct cfi_state) - sizeof(struct hlist_node));
295 static inline u32 cfi_key(struct cfi_state *cfi)
297 return jhash((void *)cfi + sizeof(cfi->hash),
298 sizeof(*cfi) - sizeof(cfi->hash), 0);
301 static struct cfi_state *cfi_hash_find_or_add(struct cfi_state *cfi)
303 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
304 struct cfi_state *obj;
306 hlist_for_each_entry(obj, head, hash) {
307 if (!cficmp(cfi, obj)) {
315 hlist_add_head(&obj->hash, head);
320 static void cfi_hash_add(struct cfi_state *cfi)
322 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
324 hlist_add_head(&cfi->hash, head);
327 static void *cfi_hash_alloc(unsigned long size)
329 cfi_bits = max(10, ilog2(size));
330 cfi_hash = mmap(NULL, sizeof(struct hlist_head) << cfi_bits,
331 PROT_READ|PROT_WRITE,
332 MAP_PRIVATE|MAP_ANON, -1, 0);
333 if (cfi_hash == (void *)-1L) {
334 WARN("mmap fail cfi_hash");
337 printf("cfi_bits: %d\n", cfi_bits);
343 static unsigned long nr_insns;
344 static unsigned long nr_insns_visited;
347 * Call the arch-specific instruction decoder for all the instructions and add
348 * them to the global instruction list.
350 static int decode_instructions(struct objtool_file *file)
354 unsigned long offset;
355 struct instruction *insn;
358 for_each_sec(file, sec) {
360 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
363 if (strcmp(sec->name, ".altinstr_replacement") &&
364 strcmp(sec->name, ".altinstr_aux") &&
365 strncmp(sec->name, ".discard.", 9))
368 if (!strcmp(sec->name, ".noinstr.text") ||
369 !strcmp(sec->name, ".entry.text"))
372 for (offset = 0; offset < sec->sh.sh_size; offset += insn->len) {
373 insn = malloc(sizeof(*insn));
375 WARN("malloc failed");
378 memset(insn, 0, sizeof(*insn));
379 INIT_LIST_HEAD(&insn->alts);
380 INIT_LIST_HEAD(&insn->stack_ops);
383 insn->offset = offset;
385 ret = arch_decode_instruction(file, sec, offset,
386 sec->sh.sh_size - offset,
387 &insn->len, &insn->type,
393 hash_add(file->insn_hash, &insn->hash, sec_offset_hash(sec, insn->offset));
394 list_add_tail(&insn->list, &file->insn_list);
398 list_for_each_entry(func, &sec->symbol_list, list) {
399 if (func->type != STT_FUNC || func->alias != func)
402 if (!find_insn(file, sec, func->offset)) {
403 WARN("%s(): can't find starting instruction",
408 sym_for_each_insn(file, func, insn)
414 printf("nr_insns: %lu\n", nr_insns);
424 * Read the pv_ops[] .data table to find the static initialized values.
426 static int add_pv_ops(struct objtool_file *file, const char *symname)
428 struct symbol *sym, *func;
429 unsigned long off, end;
433 sym = find_symbol_by_name(file->elf, symname);
438 end = off + sym->len;
440 rel = find_reloc_by_dest_range(file->elf, sym->sec, off, end - off);
445 if (func->type == STT_SECTION)
446 func = find_symbol_by_offset(rel->sym->sec, rel->addend);
448 idx = (rel->offset - sym->offset) / sizeof(unsigned long);
450 objtool_pv_add(file, idx, func);
452 off = rel->offset + 1;
461 * Allocate and initialize file->pv_ops[].
463 static int init_pv_ops(struct objtool_file *file)
465 static const char *pv_ops_tables[] = {
481 sym = find_symbol_by_name(file->elf, "pv_ops");
485 nr = sym->len / sizeof(unsigned long);
486 file->pv_ops = calloc(sizeof(struct pv_state), nr);
490 for (idx = 0; idx < nr; idx++)
491 INIT_LIST_HEAD(&file->pv_ops[idx].targets);
493 for (idx = 0; (pv_ops = pv_ops_tables[idx]); idx++)
494 add_pv_ops(file, pv_ops);
499 static struct instruction *find_last_insn(struct objtool_file *file,
502 struct instruction *insn = NULL;
504 unsigned int end = (sec->sh.sh_size > 10) ? sec->sh.sh_size - 10 : 0;
506 for (offset = sec->sh.sh_size - 1; offset >= end && !insn; offset--)
507 insn = find_insn(file, sec, offset);
513 * Mark "ud2" instructions and manually annotated dead ends.
515 static int add_dead_ends(struct objtool_file *file)
519 struct instruction *insn;
522 * By default, "ud2" is a dead end unless otherwise annotated, because
523 * GCC 7 inserts it for certain divide-by-zero cases.
525 for_each_insn(file, insn)
526 if (insn->type == INSN_BUG)
527 insn->dead_end = true;
530 * Check for manually annotated dead ends.
532 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
536 list_for_each_entry(reloc, &sec->reloc_list, list) {
537 if (reloc->sym->type != STT_SECTION) {
538 WARN("unexpected relocation symbol type in %s", sec->name);
541 insn = find_insn(file, reloc->sym->sec, reloc->addend);
543 insn = list_prev_entry(insn, list);
544 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
545 insn = find_last_insn(file, reloc->sym->sec);
547 WARN("can't find unreachable insn at %s+0x%x",
548 reloc->sym->sec->name, reloc->addend);
552 WARN("can't find unreachable insn at %s+0x%x",
553 reloc->sym->sec->name, reloc->addend);
557 insn->dead_end = true;
562 * These manually annotated reachable checks are needed for GCC 4.4,
563 * where the Linux unreachable() macro isn't supported. In that case
564 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
567 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
571 list_for_each_entry(reloc, &sec->reloc_list, list) {
572 if (reloc->sym->type != STT_SECTION) {
573 WARN("unexpected relocation symbol type in %s", sec->name);
576 insn = find_insn(file, reloc->sym->sec, reloc->addend);
578 insn = list_prev_entry(insn, list);
579 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
580 insn = find_last_insn(file, reloc->sym->sec);
582 WARN("can't find reachable insn at %s+0x%x",
583 reloc->sym->sec->name, reloc->addend);
587 WARN("can't find reachable insn at %s+0x%x",
588 reloc->sym->sec->name, reloc->addend);
592 insn->dead_end = false;
598 static int create_static_call_sections(struct objtool_file *file)
601 struct static_call_site *site;
602 struct instruction *insn;
603 struct symbol *key_sym;
604 char *key_name, *tmp;
607 sec = find_section_by_name(file->elf, ".static_call_sites");
609 INIT_LIST_HEAD(&file->static_call_list);
610 WARN("file already has .static_call_sites section, skipping");
614 if (list_empty(&file->static_call_list))
618 list_for_each_entry(insn, &file->static_call_list, call_node)
621 sec = elf_create_section(file->elf, ".static_call_sites", SHF_WRITE,
622 sizeof(struct static_call_site), idx);
627 list_for_each_entry(insn, &file->static_call_list, call_node) {
629 site = (struct static_call_site *)sec->data->d_buf + idx;
630 memset(site, 0, sizeof(struct static_call_site));
632 /* populate reloc for 'addr' */
633 if (elf_add_reloc_to_insn(file->elf, sec,
634 idx * sizeof(struct static_call_site),
636 insn->sec, insn->offset))
639 /* find key symbol */
640 key_name = strdup(insn->call_dest->name);
645 if (strncmp(key_name, STATIC_CALL_TRAMP_PREFIX_STR,
646 STATIC_CALL_TRAMP_PREFIX_LEN)) {
647 WARN("static_call: trampoline name malformed: %s", key_name);
650 tmp = key_name + STATIC_CALL_TRAMP_PREFIX_LEN - STATIC_CALL_KEY_PREFIX_LEN;
651 memcpy(tmp, STATIC_CALL_KEY_PREFIX_STR, STATIC_CALL_KEY_PREFIX_LEN);
653 key_sym = find_symbol_by_name(file->elf, tmp);
656 WARN("static_call: can't find static_call_key symbol: %s", tmp);
661 * For modules(), the key might not be exported, which
662 * means the module can make static calls but isn't
663 * allowed to change them.
665 * In that case we temporarily set the key to be the
666 * trampoline address. This is fixed up in
667 * static_call_add_module().
669 key_sym = insn->call_dest;
673 /* populate reloc for 'key' */
674 if (elf_add_reloc(file->elf, sec,
675 idx * sizeof(struct static_call_site) + 4,
676 R_X86_64_PC32, key_sym,
677 is_sibling_call(insn) * STATIC_CALL_SITE_TAIL))
686 static int create_mcount_loc_sections(struct objtool_file *file)
690 struct instruction *insn;
693 sec = find_section_by_name(file->elf, "__mcount_loc");
695 INIT_LIST_HEAD(&file->mcount_loc_list);
696 WARN("file already has __mcount_loc section, skipping");
700 if (list_empty(&file->mcount_loc_list))
704 list_for_each_entry(insn, &file->mcount_loc_list, mcount_loc_node)
707 sec = elf_create_section(file->elf, "__mcount_loc", 0, sizeof(unsigned long), idx);
712 list_for_each_entry(insn, &file->mcount_loc_list, mcount_loc_node) {
714 loc = (unsigned long *)sec->data->d_buf + idx;
715 memset(loc, 0, sizeof(unsigned long));
717 if (elf_add_reloc_to_insn(file->elf, sec,
718 idx * sizeof(unsigned long),
720 insn->sec, insn->offset))
730 * Warnings shouldn't be reported for ignored functions.
732 static void add_ignores(struct objtool_file *file)
734 struct instruction *insn;
739 sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
743 list_for_each_entry(reloc, &sec->reloc_list, list) {
744 switch (reloc->sym->type) {
750 func = find_func_by_offset(reloc->sym->sec, reloc->addend);
756 WARN("unexpected relocation symbol type in %s: %d", sec->name, reloc->sym->type);
760 func_for_each_insn(file, func, insn)
766 * This is a whitelist of functions that is allowed to be called with AC set.
767 * The list is meant to be minimal and only contains compiler instrumentation
768 * ABI and a few functions used to implement *_{to,from}_user() functions.
770 * These functions must not directly change AC, but may PUSHF/POPF.
772 static const char *uaccess_safe_builtin[] = {
776 /* KASAN out-of-line */
777 "__asan_loadN_noabort",
778 "__asan_load1_noabort",
779 "__asan_load2_noabort",
780 "__asan_load4_noabort",
781 "__asan_load8_noabort",
782 "__asan_load16_noabort",
783 "__asan_storeN_noabort",
784 "__asan_store1_noabort",
785 "__asan_store2_noabort",
786 "__asan_store4_noabort",
787 "__asan_store8_noabort",
788 "__asan_store16_noabort",
789 "__kasan_check_read",
790 "__kasan_check_write",
792 "__asan_report_load_n_noabort",
793 "__asan_report_load1_noabort",
794 "__asan_report_load2_noabort",
795 "__asan_report_load4_noabort",
796 "__asan_report_load8_noabort",
797 "__asan_report_load16_noabort",
798 "__asan_report_store_n_noabort",
799 "__asan_report_store1_noabort",
800 "__asan_report_store2_noabort",
801 "__asan_report_store4_noabort",
802 "__asan_report_store8_noabort",
803 "__asan_report_store16_noabort",
805 "__kcsan_check_access",
806 "kcsan_found_watchpoint",
807 "kcsan_setup_watchpoint",
808 "kcsan_check_scoped_accesses",
809 "kcsan_disable_current",
810 "kcsan_enable_current_nowarn",
815 "__tsan_write_range",
826 "__tsan_read_write1",
827 "__tsan_read_write2",
828 "__tsan_read_write4",
829 "__tsan_read_write8",
830 "__tsan_read_write16",
831 "__tsan_atomic8_load",
832 "__tsan_atomic16_load",
833 "__tsan_atomic32_load",
834 "__tsan_atomic64_load",
835 "__tsan_atomic8_store",
836 "__tsan_atomic16_store",
837 "__tsan_atomic32_store",
838 "__tsan_atomic64_store",
839 "__tsan_atomic8_exchange",
840 "__tsan_atomic16_exchange",
841 "__tsan_atomic32_exchange",
842 "__tsan_atomic64_exchange",
843 "__tsan_atomic8_fetch_add",
844 "__tsan_atomic16_fetch_add",
845 "__tsan_atomic32_fetch_add",
846 "__tsan_atomic64_fetch_add",
847 "__tsan_atomic8_fetch_sub",
848 "__tsan_atomic16_fetch_sub",
849 "__tsan_atomic32_fetch_sub",
850 "__tsan_atomic64_fetch_sub",
851 "__tsan_atomic8_fetch_and",
852 "__tsan_atomic16_fetch_and",
853 "__tsan_atomic32_fetch_and",
854 "__tsan_atomic64_fetch_and",
855 "__tsan_atomic8_fetch_or",
856 "__tsan_atomic16_fetch_or",
857 "__tsan_atomic32_fetch_or",
858 "__tsan_atomic64_fetch_or",
859 "__tsan_atomic8_fetch_xor",
860 "__tsan_atomic16_fetch_xor",
861 "__tsan_atomic32_fetch_xor",
862 "__tsan_atomic64_fetch_xor",
863 "__tsan_atomic8_fetch_nand",
864 "__tsan_atomic16_fetch_nand",
865 "__tsan_atomic32_fetch_nand",
866 "__tsan_atomic64_fetch_nand",
867 "__tsan_atomic8_compare_exchange_strong",
868 "__tsan_atomic16_compare_exchange_strong",
869 "__tsan_atomic32_compare_exchange_strong",
870 "__tsan_atomic64_compare_exchange_strong",
871 "__tsan_atomic8_compare_exchange_weak",
872 "__tsan_atomic16_compare_exchange_weak",
873 "__tsan_atomic32_compare_exchange_weak",
874 "__tsan_atomic64_compare_exchange_weak",
875 "__tsan_atomic8_compare_exchange_val",
876 "__tsan_atomic16_compare_exchange_val",
877 "__tsan_atomic32_compare_exchange_val",
878 "__tsan_atomic64_compare_exchange_val",
879 "__tsan_atomic_thread_fence",
880 "__tsan_atomic_signal_fence",
884 "__sanitizer_cov_trace_pc",
885 "__sanitizer_cov_trace_const_cmp1",
886 "__sanitizer_cov_trace_const_cmp2",
887 "__sanitizer_cov_trace_const_cmp4",
888 "__sanitizer_cov_trace_const_cmp8",
889 "__sanitizer_cov_trace_cmp1",
890 "__sanitizer_cov_trace_cmp2",
891 "__sanitizer_cov_trace_cmp4",
892 "__sanitizer_cov_trace_cmp8",
893 "__sanitizer_cov_trace_switch",
895 "ubsan_type_mismatch_common",
896 "__ubsan_handle_type_mismatch",
897 "__ubsan_handle_type_mismatch_v1",
898 "__ubsan_handle_shift_out_of_bounds",
900 "csum_partial_copy_generic",
902 "copy_mc_fragile_handle_tail",
903 "copy_mc_enhanced_fast_string",
904 "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
908 static void add_uaccess_safe(struct objtool_file *file)
916 for (name = uaccess_safe_builtin; *name; name++) {
917 func = find_symbol_by_name(file->elf, *name);
921 func->uaccess_safe = true;
926 * FIXME: For now, just ignore any alternatives which add retpolines. This is
927 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
928 * But it at least allows objtool to understand the control flow *around* the
931 static int add_ignore_alternatives(struct objtool_file *file)
935 struct instruction *insn;
937 sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
941 list_for_each_entry(reloc, &sec->reloc_list, list) {
942 if (reloc->sym->type != STT_SECTION) {
943 WARN("unexpected relocation symbol type in %s", sec->name);
947 insn = find_insn(file, reloc->sym->sec, reloc->addend);
949 WARN("bad .discard.ignore_alts entry");
953 insn->ignore_alts = true;
959 __weak bool arch_is_retpoline(struct symbol *sym)
964 #define NEGATIVE_RELOC ((void *)-1L)
966 static struct reloc *insn_reloc(struct objtool_file *file, struct instruction *insn)
968 if (insn->reloc == NEGATIVE_RELOC)
975 insn->reloc = find_reloc_by_dest_range(file->elf, insn->sec,
976 insn->offset, insn->len);
978 insn->reloc = NEGATIVE_RELOC;
986 static void remove_insn_ops(struct instruction *insn)
988 struct stack_op *op, *tmp;
990 list_for_each_entry_safe(op, tmp, &insn->stack_ops, list) {
996 static void add_call_dest(struct objtool_file *file, struct instruction *insn,
997 struct symbol *dest, bool sibling)
999 struct reloc *reloc = insn_reloc(file, insn);
1001 insn->call_dest = dest;
1005 if (insn->call_dest->static_call_tramp) {
1006 list_add_tail(&insn->call_node,
1007 &file->static_call_list);
1011 * Many compilers cannot disable KCOV with a function attribute
1012 * so they need a little help, NOP out any KCOV calls from noinstr
1015 if (insn->sec->noinstr && insn->call_dest->kcov) {
1017 reloc->type = R_NONE;
1018 elf_write_reloc(file->elf, reloc);
1021 elf_write_insn(file->elf, insn->sec,
1022 insn->offset, insn->len,
1023 sibling ? arch_ret_insn(insn->len)
1024 : arch_nop_insn(insn->len));
1026 insn->type = sibling ? INSN_RETURN : INSN_NOP;
1029 if (mcount && insn->call_dest->fentry) {
1031 WARN_FUNC("Tail call to __fentry__ !?!?", insn->sec, insn->offset);
1034 reloc->type = R_NONE;
1035 elf_write_reloc(file->elf, reloc);
1038 elf_write_insn(file->elf, insn->sec,
1039 insn->offset, insn->len,
1040 arch_nop_insn(insn->len));
1042 insn->type = INSN_NOP;
1044 list_add_tail(&insn->mcount_loc_node,
1045 &file->mcount_loc_list);
1049 * Whatever stack impact regular CALLs have, should be undone
1050 * by the RETURN of the called function.
1052 * Annotated intra-function calls retain the stack_ops but
1053 * are converted to JUMP, see read_intra_function_calls().
1055 remove_insn_ops(insn);
1059 * Find the destination instructions for all jumps.
1061 static int add_jump_destinations(struct objtool_file *file)
1063 struct instruction *insn;
1064 struct reloc *reloc;
1065 struct section *dest_sec;
1066 unsigned long dest_off;
1068 for_each_insn(file, insn) {
1069 if (!is_static_jump(insn))
1072 reloc = insn_reloc(file, insn);
1074 dest_sec = insn->sec;
1075 dest_off = arch_jump_destination(insn);
1076 } else if (reloc->sym->type == STT_SECTION) {
1077 dest_sec = reloc->sym->sec;
1078 dest_off = arch_dest_reloc_offset(reloc->addend);
1079 } else if (reloc->sym->retpoline_thunk) {
1081 * Retpoline jumps are really dynamic jumps in
1082 * disguise, so convert them accordingly.
1084 if (insn->type == INSN_JUMP_UNCONDITIONAL)
1085 insn->type = INSN_JUMP_DYNAMIC;
1087 insn->type = INSN_JUMP_DYNAMIC_CONDITIONAL;
1089 list_add_tail(&insn->call_node,
1090 &file->retpoline_call_list);
1092 insn->retpoline_safe = true;
1094 } else if (insn->func) {
1095 /* internal or external sibling call (with reloc) */
1096 add_call_dest(file, insn, reloc->sym, true);
1098 } else if (reloc->sym->sec->idx) {
1099 dest_sec = reloc->sym->sec;
1100 dest_off = reloc->sym->sym.st_value +
1101 arch_dest_reloc_offset(reloc->addend);
1103 /* non-func asm code jumping to another file */
1107 insn->jump_dest = find_insn(file, dest_sec, dest_off);
1108 if (!insn->jump_dest) {
1111 * This is a special case where an alt instruction
1112 * jumps past the end of the section. These are
1113 * handled later in handle_group_alt().
1115 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
1118 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
1119 insn->sec, insn->offset, dest_sec->name,
1125 * Cross-function jump.
1127 if (insn->func && insn->jump_dest->func &&
1128 insn->func != insn->jump_dest->func) {
1131 * For GCC 8+, create parent/child links for any cold
1132 * subfunctions. This is _mostly_ redundant with a
1133 * similar initialization in read_symbols().
1135 * If a function has aliases, we want the *first* such
1136 * function in the symbol table to be the subfunction's
1137 * parent. In that case we overwrite the
1138 * initialization done in read_symbols().
1140 * However this code can't completely replace the
1141 * read_symbols() code because this doesn't detect the
1142 * case where the parent function's only reference to a
1143 * subfunction is through a jump table.
1145 if (!strstr(insn->func->name, ".cold") &&
1146 strstr(insn->jump_dest->func->name, ".cold")) {
1147 insn->func->cfunc = insn->jump_dest->func;
1148 insn->jump_dest->func->pfunc = insn->func;
1150 } else if (insn->jump_dest->func->pfunc != insn->func->pfunc &&
1151 insn->jump_dest->offset == insn->jump_dest->func->offset) {
1152 /* internal sibling call (without reloc) */
1153 add_call_dest(file, insn, insn->jump_dest->func, true);
1161 static struct symbol *find_call_destination(struct section *sec, unsigned long offset)
1163 struct symbol *call_dest;
1165 call_dest = find_func_by_offset(sec, offset);
1167 call_dest = find_symbol_by_offset(sec, offset);
1173 * Find the destination instructions for all calls.
1175 static int add_call_destinations(struct objtool_file *file)
1177 struct instruction *insn;
1178 unsigned long dest_off;
1179 struct symbol *dest;
1180 struct reloc *reloc;
1182 for_each_insn(file, insn) {
1183 if (insn->type != INSN_CALL)
1186 reloc = insn_reloc(file, insn);
1188 dest_off = arch_jump_destination(insn);
1189 dest = find_call_destination(insn->sec, dest_off);
1191 add_call_dest(file, insn, dest, false);
1196 if (!insn->call_dest) {
1197 WARN_FUNC("unannotated intra-function call", insn->sec, insn->offset);
1201 if (insn->func && insn->call_dest->type != STT_FUNC) {
1202 WARN_FUNC("unsupported call to non-function",
1203 insn->sec, insn->offset);
1207 } else if (reloc->sym->type == STT_SECTION) {
1208 dest_off = arch_dest_reloc_offset(reloc->addend);
1209 dest = find_call_destination(reloc->sym->sec, dest_off);
1211 WARN_FUNC("can't find call dest symbol at %s+0x%lx",
1212 insn->sec, insn->offset,
1213 reloc->sym->sec->name,
1218 add_call_dest(file, insn, dest, false);
1220 } else if (reloc->sym->retpoline_thunk) {
1222 * Retpoline calls are really dynamic calls in
1223 * disguise, so convert them accordingly.
1225 insn->type = INSN_CALL_DYNAMIC;
1226 insn->retpoline_safe = true;
1228 list_add_tail(&insn->call_node,
1229 &file->retpoline_call_list);
1231 remove_insn_ops(insn);
1235 add_call_dest(file, insn, reloc->sym, false);
1242 * The .alternatives section requires some extra special care over and above
1243 * other special sections because alternatives are patched in place.
1245 static int handle_group_alt(struct objtool_file *file,
1246 struct special_alt *special_alt,
1247 struct instruction *orig_insn,
1248 struct instruction **new_insn)
1250 struct instruction *last_orig_insn, *last_new_insn = NULL, *insn, *nop = NULL;
1251 struct alt_group *orig_alt_group, *new_alt_group;
1252 unsigned long dest_off;
1255 orig_alt_group = malloc(sizeof(*orig_alt_group));
1256 if (!orig_alt_group) {
1257 WARN("malloc failed");
1260 orig_alt_group->cfi = calloc(special_alt->orig_len,
1261 sizeof(struct cfi_state *));
1262 if (!orig_alt_group->cfi) {
1263 WARN("calloc failed");
1267 last_orig_insn = NULL;
1269 sec_for_each_insn_from(file, insn) {
1270 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
1273 insn->alt_group = orig_alt_group;
1274 last_orig_insn = insn;
1276 orig_alt_group->orig_group = NULL;
1277 orig_alt_group->first_insn = orig_insn;
1278 orig_alt_group->last_insn = last_orig_insn;
1281 new_alt_group = malloc(sizeof(*new_alt_group));
1282 if (!new_alt_group) {
1283 WARN("malloc failed");
1287 if (special_alt->new_len < special_alt->orig_len) {
1289 * Insert a fake nop at the end to make the replacement
1290 * alt_group the same size as the original. This is needed to
1291 * allow propagate_alt_cfi() to do its magic. When the last
1292 * instruction affects the stack, the instruction after it (the
1293 * nop) will propagate the new state to the shared CFI array.
1295 nop = malloc(sizeof(*nop));
1297 WARN("malloc failed");
1300 memset(nop, 0, sizeof(*nop));
1301 INIT_LIST_HEAD(&nop->alts);
1302 INIT_LIST_HEAD(&nop->stack_ops);
1304 nop->sec = special_alt->new_sec;
1305 nop->offset = special_alt->new_off + special_alt->new_len;
1306 nop->len = special_alt->orig_len - special_alt->new_len;
1307 nop->type = INSN_NOP;
1308 nop->func = orig_insn->func;
1309 nop->alt_group = new_alt_group;
1310 nop->ignore = orig_insn->ignore_alts;
1313 if (!special_alt->new_len) {
1319 sec_for_each_insn_from(file, insn) {
1320 struct reloc *alt_reloc;
1322 if (insn->offset >= special_alt->new_off + special_alt->new_len)
1325 last_new_insn = insn;
1327 insn->ignore = orig_insn->ignore_alts;
1328 insn->func = orig_insn->func;
1329 insn->alt_group = new_alt_group;
1332 * Since alternative replacement code is copy/pasted by the
1333 * kernel after applying relocations, generally such code can't
1334 * have relative-address relocation references to outside the
1335 * .altinstr_replacement section, unless the arch's
1336 * alternatives code can adjust the relative offsets
1339 alt_reloc = insn_reloc(file, insn);
1341 !arch_support_alt_relocation(special_alt, insn, alt_reloc)) {
1343 WARN_FUNC("unsupported relocation in alternatives section",
1344 insn->sec, insn->offset);
1348 if (!is_static_jump(insn))
1351 if (!insn->immediate)
1354 dest_off = arch_jump_destination(insn);
1355 if (dest_off == special_alt->new_off + special_alt->new_len)
1356 insn->jump_dest = next_insn_same_sec(file, last_orig_insn);
1358 if (!insn->jump_dest) {
1359 WARN_FUNC("can't find alternative jump destination",
1360 insn->sec, insn->offset);
1365 if (!last_new_insn) {
1366 WARN_FUNC("can't find last new alternative instruction",
1367 special_alt->new_sec, special_alt->new_off);
1372 list_add(&nop->list, &last_new_insn->list);
1374 new_alt_group->orig_group = orig_alt_group;
1375 new_alt_group->first_insn = *new_insn;
1376 new_alt_group->last_insn = nop ? : last_new_insn;
1377 new_alt_group->cfi = orig_alt_group->cfi;
1382 * A jump table entry can either convert a nop to a jump or a jump to a nop.
1383 * If the original instruction is a jump, make the alt entry an effective nop
1384 * by just skipping the original instruction.
1386 static int handle_jump_alt(struct objtool_file *file,
1387 struct special_alt *special_alt,
1388 struct instruction *orig_insn,
1389 struct instruction **new_insn)
1391 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL &&
1392 orig_insn->type != INSN_NOP) {
1394 WARN_FUNC("unsupported instruction at jump label",
1395 orig_insn->sec, orig_insn->offset);
1399 if (special_alt->key_addend & 2) {
1400 struct reloc *reloc = insn_reloc(file, orig_insn);
1403 reloc->type = R_NONE;
1404 elf_write_reloc(file->elf, reloc);
1406 elf_write_insn(file->elf, orig_insn->sec,
1407 orig_insn->offset, orig_insn->len,
1408 arch_nop_insn(orig_insn->len));
1409 orig_insn->type = INSN_NOP;
1412 if (orig_insn->type == INSN_NOP) {
1413 if (orig_insn->len == 2)
1414 file->jl_nop_short++;
1416 file->jl_nop_long++;
1421 if (orig_insn->len == 2)
1426 *new_insn = list_next_entry(orig_insn, list);
1431 * Read all the special sections which have alternate instructions which can be
1432 * patched in or redirected to at runtime. Each instruction having alternate
1433 * instruction(s) has them added to its insn->alts list, which will be
1434 * traversed in validate_branch().
1436 static int add_special_section_alts(struct objtool_file *file)
1438 struct list_head special_alts;
1439 struct instruction *orig_insn, *new_insn;
1440 struct special_alt *special_alt, *tmp;
1441 struct alternative *alt;
1444 ret = special_get_alts(file->elf, &special_alts);
1448 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
1450 orig_insn = find_insn(file, special_alt->orig_sec,
1451 special_alt->orig_off);
1453 WARN_FUNC("special: can't find orig instruction",
1454 special_alt->orig_sec, special_alt->orig_off);
1460 if (!special_alt->group || special_alt->new_len) {
1461 new_insn = find_insn(file, special_alt->new_sec,
1462 special_alt->new_off);
1464 WARN_FUNC("special: can't find new instruction",
1465 special_alt->new_sec,
1466 special_alt->new_off);
1472 if (special_alt->group) {
1473 if (!special_alt->orig_len) {
1474 WARN_FUNC("empty alternative entry",
1475 orig_insn->sec, orig_insn->offset);
1479 ret = handle_group_alt(file, special_alt, orig_insn,
1483 } else if (special_alt->jump_or_nop) {
1484 ret = handle_jump_alt(file, special_alt, orig_insn,
1490 alt = malloc(sizeof(*alt));
1492 WARN("malloc failed");
1497 alt->insn = new_insn;
1498 alt->skip_orig = special_alt->skip_orig;
1499 orig_insn->ignore_alts |= special_alt->skip_alt;
1500 list_add_tail(&alt->list, &orig_insn->alts);
1502 list_del(&special_alt->list);
1507 printf("jl\\\tNOP\tJMP\n");
1508 printf("short:\t%ld\t%ld\n", file->jl_nop_short, file->jl_short);
1509 printf("long:\t%ld\t%ld\n", file->jl_nop_long, file->jl_long);
1516 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
1517 struct reloc *table)
1519 struct reloc *reloc = table;
1520 struct instruction *dest_insn;
1521 struct alternative *alt;
1522 struct symbol *pfunc = insn->func->pfunc;
1523 unsigned int prev_offset = 0;
1526 * Each @reloc is a switch table relocation which points to the target
1529 list_for_each_entry_from(reloc, &table->sec->reloc_list, list) {
1531 /* Check for the end of the table: */
1532 if (reloc != table && reloc->jump_table_start)
1535 /* Make sure the table entries are consecutive: */
1536 if (prev_offset && reloc->offset != prev_offset + 8)
1539 /* Detect function pointers from contiguous objects: */
1540 if (reloc->sym->sec == pfunc->sec &&
1541 reloc->addend == pfunc->offset)
1544 dest_insn = find_insn(file, reloc->sym->sec, reloc->addend);
1548 /* Make sure the destination is in the same function: */
1549 if (!dest_insn->func || dest_insn->func->pfunc != pfunc)
1552 alt = malloc(sizeof(*alt));
1554 WARN("malloc failed");
1558 alt->insn = dest_insn;
1559 list_add_tail(&alt->list, &insn->alts);
1560 prev_offset = reloc->offset;
1564 WARN_FUNC("can't find switch jump table",
1565 insn->sec, insn->offset);
1573 * find_jump_table() - Given a dynamic jump, find the switch jump table
1574 * associated with it.
1576 static struct reloc *find_jump_table(struct objtool_file *file,
1577 struct symbol *func,
1578 struct instruction *insn)
1580 struct reloc *table_reloc;
1581 struct instruction *dest_insn, *orig_insn = insn;
1584 * Backward search using the @first_jump_src links, these help avoid
1585 * much of the 'in between' code. Which avoids us getting confused by
1589 insn && insn->func && insn->func->pfunc == func;
1590 insn = insn->first_jump_src ?: prev_insn_same_sym(file, insn)) {
1592 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1595 /* allow small jumps within the range */
1596 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1598 (insn->jump_dest->offset <= insn->offset ||
1599 insn->jump_dest->offset > orig_insn->offset))
1602 table_reloc = arch_find_switch_table(file, insn);
1605 dest_insn = find_insn(file, table_reloc->sym->sec, table_reloc->addend);
1606 if (!dest_insn || !dest_insn->func || dest_insn->func->pfunc != func)
1616 * First pass: Mark the head of each jump table so that in the next pass,
1617 * we know when a given jump table ends and the next one starts.
1619 static void mark_func_jump_tables(struct objtool_file *file,
1620 struct symbol *func)
1622 struct instruction *insn, *last = NULL;
1623 struct reloc *reloc;
1625 func_for_each_insn(file, func, insn) {
1630 * Store back-pointers for unconditional forward jumps such
1631 * that find_jump_table() can back-track using those and
1632 * avoid some potentially confusing code.
1634 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1635 insn->offset > last->offset &&
1636 insn->jump_dest->offset > insn->offset &&
1637 !insn->jump_dest->first_jump_src) {
1639 insn->jump_dest->first_jump_src = insn;
1640 last = insn->jump_dest;
1643 if (insn->type != INSN_JUMP_DYNAMIC)
1646 reloc = find_jump_table(file, func, insn);
1648 reloc->jump_table_start = true;
1649 insn->jump_table = reloc;
1654 static int add_func_jump_tables(struct objtool_file *file,
1655 struct symbol *func)
1657 struct instruction *insn;
1660 func_for_each_insn(file, func, insn) {
1661 if (!insn->jump_table)
1664 ret = add_jump_table(file, insn, insn->jump_table);
1673 * For some switch statements, gcc generates a jump table in the .rodata
1674 * section which contains a list of addresses within the function to jump to.
1675 * This finds these jump tables and adds them to the insn->alts lists.
1677 static int add_jump_table_alts(struct objtool_file *file)
1679 struct section *sec;
1680 struct symbol *func;
1686 for_each_sec(file, sec) {
1687 list_for_each_entry(func, &sec->symbol_list, list) {
1688 if (func->type != STT_FUNC)
1691 mark_func_jump_tables(file, func);
1692 ret = add_func_jump_tables(file, func);
1701 static void set_func_state(struct cfi_state *state)
1703 state->cfa = initial_func_cfi.cfa;
1704 memcpy(&state->regs, &initial_func_cfi.regs,
1705 CFI_NUM_REGS * sizeof(struct cfi_reg));
1706 state->stack_size = initial_func_cfi.cfa.offset;
1709 static int read_unwind_hints(struct objtool_file *file)
1711 struct cfi_state cfi = init_cfi;
1712 struct section *sec, *relocsec;
1713 struct unwind_hint *hint;
1714 struct instruction *insn;
1715 struct reloc *reloc;
1718 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
1722 relocsec = sec->reloc;
1724 WARN("missing .rela.discard.unwind_hints section");
1728 if (sec->sh.sh_size % sizeof(struct unwind_hint)) {
1729 WARN("struct unwind_hint size mismatch");
1735 for (i = 0; i < sec->sh.sh_size / sizeof(struct unwind_hint); i++) {
1736 hint = (struct unwind_hint *)sec->data->d_buf + i;
1738 reloc = find_reloc_by_dest(file->elf, sec, i * sizeof(*hint));
1740 WARN("can't find reloc for unwind_hints[%d]", i);
1744 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1746 WARN("can't find insn for unwind_hints[%d]", i);
1752 if (hint->type == UNWIND_HINT_TYPE_FUNC) {
1753 insn->cfi = &func_cfi;
1760 if (arch_decode_hint_reg(hint->sp_reg, &cfi.cfa.base)) {
1761 WARN_FUNC("unsupported unwind_hint sp base reg %d",
1762 insn->sec, insn->offset, hint->sp_reg);
1766 cfi.cfa.offset = bswap_if_needed(hint->sp_offset);
1767 cfi.type = hint->type;
1768 cfi.end = hint->end;
1770 insn->cfi = cfi_hash_find_or_add(&cfi);
1776 static int read_retpoline_hints(struct objtool_file *file)
1778 struct section *sec;
1779 struct instruction *insn;
1780 struct reloc *reloc;
1782 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
1786 list_for_each_entry(reloc, &sec->reloc_list, list) {
1787 if (reloc->sym->type != STT_SECTION) {
1788 WARN("unexpected relocation symbol type in %s", sec->name);
1792 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1794 WARN("bad .discard.retpoline_safe entry");
1798 if (insn->type != INSN_JUMP_DYNAMIC &&
1799 insn->type != INSN_CALL_DYNAMIC) {
1800 WARN_FUNC("retpoline_safe hint not an indirect jump/call",
1801 insn->sec, insn->offset);
1805 insn->retpoline_safe = true;
1811 static int read_instr_hints(struct objtool_file *file)
1813 struct section *sec;
1814 struct instruction *insn;
1815 struct reloc *reloc;
1817 sec = find_section_by_name(file->elf, ".rela.discard.instr_end");
1821 list_for_each_entry(reloc, &sec->reloc_list, list) {
1822 if (reloc->sym->type != STT_SECTION) {
1823 WARN("unexpected relocation symbol type in %s", sec->name);
1827 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1829 WARN("bad .discard.instr_end entry");
1836 sec = find_section_by_name(file->elf, ".rela.discard.instr_begin");
1840 list_for_each_entry(reloc, &sec->reloc_list, list) {
1841 if (reloc->sym->type != STT_SECTION) {
1842 WARN("unexpected relocation symbol type in %s", sec->name);
1846 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1848 WARN("bad .discard.instr_begin entry");
1858 static int read_intra_function_calls(struct objtool_file *file)
1860 struct instruction *insn;
1861 struct section *sec;
1862 struct reloc *reloc;
1864 sec = find_section_by_name(file->elf, ".rela.discard.intra_function_calls");
1868 list_for_each_entry(reloc, &sec->reloc_list, list) {
1869 unsigned long dest_off;
1871 if (reloc->sym->type != STT_SECTION) {
1872 WARN("unexpected relocation symbol type in %s",
1877 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1879 WARN("bad .discard.intra_function_call entry");
1883 if (insn->type != INSN_CALL) {
1884 WARN_FUNC("intra_function_call not a direct call",
1885 insn->sec, insn->offset);
1890 * Treat intra-function CALLs as JMPs, but with a stack_op.
1891 * See add_call_destinations(), which strips stack_ops from
1894 insn->type = INSN_JUMP_UNCONDITIONAL;
1896 dest_off = insn->offset + insn->len + insn->immediate;
1897 insn->jump_dest = find_insn(file, insn->sec, dest_off);
1898 if (!insn->jump_dest) {
1899 WARN_FUNC("can't find call dest at %s+0x%lx",
1900 insn->sec, insn->offset,
1901 insn->sec->name, dest_off);
1909 static int classify_symbols(struct objtool_file *file)
1911 struct section *sec;
1912 struct symbol *func;
1914 for_each_sec(file, sec) {
1915 list_for_each_entry(func, &sec->symbol_list, list) {
1916 if (func->bind != STB_GLOBAL)
1919 if (!strncmp(func->name, STATIC_CALL_TRAMP_PREFIX_STR,
1920 strlen(STATIC_CALL_TRAMP_PREFIX_STR)))
1921 func->static_call_tramp = true;
1923 if (arch_is_retpoline(func))
1924 func->retpoline_thunk = true;
1926 if (!strcmp(func->name, "__fentry__"))
1927 func->fentry = true;
1929 if (!strncmp(func->name, "__sanitizer_cov_", 16))
1937 static void mark_rodata(struct objtool_file *file)
1939 struct section *sec;
1943 * Search for the following rodata sections, each of which can
1944 * potentially contain jump tables:
1946 * - .rodata: can contain GCC switch tables
1947 * - .rodata.<func>: same, if -fdata-sections is being used
1948 * - .rodata..c_jump_table: contains C annotated jump tables
1950 * .rodata.str1.* sections are ignored; they don't contain jump tables.
1952 for_each_sec(file, sec) {
1953 if (!strncmp(sec->name, ".rodata", 7) &&
1954 !strstr(sec->name, ".str1.")) {
1960 file->rodata = found;
1963 __weak int arch_rewrite_retpolines(struct objtool_file *file)
1968 static int decode_sections(struct objtool_file *file)
1974 ret = init_pv_ops(file);
1978 ret = decode_instructions(file);
1982 ret = add_dead_ends(file);
1987 add_uaccess_safe(file);
1989 ret = add_ignore_alternatives(file);
1994 * Must be before add_{jump_call}_destination.
1996 ret = classify_symbols(file);
2001 * Must be before add_special_section_alts() as that depends on
2002 * jump_dest being set.
2004 ret = add_jump_destinations(file);
2008 ret = add_special_section_alts(file);
2013 * Must be before add_call_destination(); it changes INSN_CALL to
2016 ret = read_intra_function_calls(file);
2020 ret = add_call_destinations(file);
2024 ret = add_jump_table_alts(file);
2028 ret = read_unwind_hints(file);
2032 ret = read_retpoline_hints(file);
2036 ret = read_instr_hints(file);
2041 * Must be after add_special_section_alts(), since this will emit
2042 * alternatives. Must be after add_{jump,call}_destination(), since
2043 * those create the call insn lists.
2045 ret = arch_rewrite_retpolines(file);
2052 static bool is_fentry_call(struct instruction *insn)
2054 if (insn->type == INSN_CALL &&
2056 insn->call_dest->fentry)
2062 static bool has_modified_stack_frame(struct instruction *insn, struct insn_state *state)
2064 struct cfi_state *cfi = &state->cfi;
2067 if (cfi->cfa.base != initial_func_cfi.cfa.base || cfi->drap)
2070 if (cfi->cfa.offset != initial_func_cfi.cfa.offset)
2073 if (cfi->stack_size != initial_func_cfi.cfa.offset)
2076 for (i = 0; i < CFI_NUM_REGS; i++) {
2077 if (cfi->regs[i].base != initial_func_cfi.regs[i].base ||
2078 cfi->regs[i].offset != initial_func_cfi.regs[i].offset)
2085 static bool check_reg_frame_pos(const struct cfi_reg *reg,
2086 int expected_offset)
2088 return reg->base == CFI_CFA &&
2089 reg->offset == expected_offset;
2092 static bool has_valid_stack_frame(struct insn_state *state)
2094 struct cfi_state *cfi = &state->cfi;
2096 if (cfi->cfa.base == CFI_BP &&
2097 check_reg_frame_pos(&cfi->regs[CFI_BP], -cfi->cfa.offset) &&
2098 check_reg_frame_pos(&cfi->regs[CFI_RA], -cfi->cfa.offset + 8))
2101 if (cfi->drap && cfi->regs[CFI_BP].base == CFI_BP)
2107 static int update_cfi_state_regs(struct instruction *insn,
2108 struct cfi_state *cfi,
2109 struct stack_op *op)
2111 struct cfi_reg *cfa = &cfi->cfa;
2113 if (cfa->base != CFI_SP && cfa->base != CFI_SP_INDIRECT)
2117 if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
2121 if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
2124 /* add immediate to sp */
2125 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
2126 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
2127 cfa->offset -= op->src.offset;
2132 static void save_reg(struct cfi_state *cfi, unsigned char reg, int base, int offset)
2134 if (arch_callee_saved_reg(reg) &&
2135 cfi->regs[reg].base == CFI_UNDEFINED) {
2136 cfi->regs[reg].base = base;
2137 cfi->regs[reg].offset = offset;
2141 static void restore_reg(struct cfi_state *cfi, unsigned char reg)
2143 cfi->regs[reg].base = initial_func_cfi.regs[reg].base;
2144 cfi->regs[reg].offset = initial_func_cfi.regs[reg].offset;
2148 * A note about DRAP stack alignment:
2150 * GCC has the concept of a DRAP register, which is used to help keep track of
2151 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
2152 * register. The typical DRAP pattern is:
2154 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
2155 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
2156 * 41 ff 72 f8 pushq -0x8(%r10)
2158 * 48 89 e5 mov %rsp,%rbp
2165 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2168 * There are some variations in the epilogues, like:
2176 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2181 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
2182 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
2183 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
2184 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
2186 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2189 * Sometimes r13 is used as the DRAP register, in which case it's saved and
2190 * restored beforehand:
2193 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
2194 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
2196 * 49 8d 65 f0 lea -0x10(%r13),%rsp
2200 static int update_cfi_state(struct instruction *insn,
2201 struct instruction *next_insn,
2202 struct cfi_state *cfi, struct stack_op *op)
2204 struct cfi_reg *cfa = &cfi->cfa;
2205 struct cfi_reg *regs = cfi->regs;
2207 /* stack operations don't make sense with an undefined CFA */
2208 if (cfa->base == CFI_UNDEFINED) {
2210 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
2216 if (cfi->type == UNWIND_HINT_TYPE_REGS ||
2217 cfi->type == UNWIND_HINT_TYPE_REGS_PARTIAL)
2218 return update_cfi_state_regs(insn, cfi, op);
2220 switch (op->dest.type) {
2223 switch (op->src.type) {
2226 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
2227 cfa->base == CFI_SP &&
2228 check_reg_frame_pos(®s[CFI_BP], -cfa->offset)) {
2230 /* mov %rsp, %rbp */
2231 cfa->base = op->dest.reg;
2232 cfi->bp_scratch = false;
2235 else if (op->src.reg == CFI_SP &&
2236 op->dest.reg == CFI_BP && cfi->drap) {
2238 /* drap: mov %rsp, %rbp */
2239 regs[CFI_BP].base = CFI_BP;
2240 regs[CFI_BP].offset = -cfi->stack_size;
2241 cfi->bp_scratch = false;
2244 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2249 * This is needed for the rare case where GCC
2256 cfi->vals[op->dest.reg].base = CFI_CFA;
2257 cfi->vals[op->dest.reg].offset = -cfi->stack_size;
2260 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
2261 (cfa->base == CFI_BP || cfa->base == cfi->drap_reg)) {
2266 * Restore the original stack pointer (Clang).
2268 cfi->stack_size = -cfi->regs[CFI_BP].offset;
2271 else if (op->dest.reg == cfa->base) {
2273 /* mov %reg, %rsp */
2274 if (cfa->base == CFI_SP &&
2275 cfi->vals[op->src.reg].base == CFI_CFA) {
2278 * This is needed for the rare case
2279 * where GCC does something dumb like:
2281 * lea 0x8(%rsp), %rcx
2285 cfa->offset = -cfi->vals[op->src.reg].offset;
2286 cfi->stack_size = cfa->offset;
2288 } else if (cfa->base == CFI_SP &&
2289 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2290 cfi->vals[op->src.reg].offset == cfa->offset) {
2295 * 1: mov %rsp, (%[tos])
2296 * 2: mov %[tos], %rsp
2302 * 1 - places a pointer to the previous
2303 * stack at the Top-of-Stack of the
2306 * 2 - switches to the new stack.
2308 * 3 - pops the Top-of-Stack to restore
2309 * the original stack.
2311 * Note: we set base to SP_INDIRECT
2312 * here and preserve offset. Therefore
2313 * when the unwinder reaches ToS it
2314 * will dereference SP and then add the
2315 * offset to find the next frame, IOW:
2318 cfa->base = CFI_SP_INDIRECT;
2321 cfa->base = CFI_UNDEFINED;
2326 else if (op->dest.reg == CFI_SP &&
2327 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2328 cfi->vals[op->src.reg].offset == cfa->offset) {
2331 * The same stack swizzle case 2) as above. But
2332 * because we can't change cfa->base, case 3)
2333 * will become a regular POP. Pretend we're a
2334 * PUSH so things don't go unbalanced.
2336 cfi->stack_size += 8;
2343 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
2346 cfi->stack_size -= op->src.offset;
2347 if (cfa->base == CFI_SP)
2348 cfa->offset -= op->src.offset;
2352 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
2354 /* lea disp(%rbp), %rsp */
2355 cfi->stack_size = -(op->src.offset + regs[CFI_BP].offset);
2359 if (!cfi->drap && op->src.reg == CFI_SP &&
2360 op->dest.reg == CFI_BP && cfa->base == CFI_SP &&
2361 check_reg_frame_pos(®s[CFI_BP], -cfa->offset + op->src.offset)) {
2363 /* lea disp(%rsp), %rbp */
2365 cfa->offset -= op->src.offset;
2366 cfi->bp_scratch = false;
2370 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2372 /* drap: lea disp(%rsp), %drap */
2373 cfi->drap_reg = op->dest.reg;
2376 * lea disp(%rsp), %reg
2378 * This is needed for the rare case where GCC
2379 * does something dumb like:
2381 * lea 0x8(%rsp), %rcx
2385 cfi->vals[op->dest.reg].base = CFI_CFA;
2386 cfi->vals[op->dest.reg].offset = \
2387 -cfi->stack_size + op->src.offset;
2392 if (cfi->drap && op->dest.reg == CFI_SP &&
2393 op->src.reg == cfi->drap_reg) {
2395 /* drap: lea disp(%drap), %rsp */
2397 cfa->offset = cfi->stack_size = -op->src.offset;
2398 cfi->drap_reg = CFI_UNDEFINED;
2403 if (op->dest.reg == cfi->cfa.base && !(next_insn && next_insn->hint)) {
2404 WARN_FUNC("unsupported stack register modification",
2405 insn->sec, insn->offset);
2412 if (op->dest.reg != CFI_SP ||
2413 (cfi->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
2414 (cfi->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
2415 WARN_FUNC("unsupported stack pointer realignment",
2416 insn->sec, insn->offset);
2420 if (cfi->drap_reg != CFI_UNDEFINED) {
2421 /* drap: and imm, %rsp */
2422 cfa->base = cfi->drap_reg;
2423 cfa->offset = cfi->stack_size = 0;
2428 * Older versions of GCC (4.8ish) realign the stack
2429 * without DRAP, with a frame pointer.
2436 if (op->dest.reg == CFI_SP && cfa->base == CFI_SP_INDIRECT) {
2438 /* pop %rsp; # restore from a stack swizzle */
2443 if (!cfi->drap && op->dest.reg == cfa->base) {
2449 if (cfi->drap && cfa->base == CFI_BP_INDIRECT &&
2450 op->dest.reg == cfi->drap_reg &&
2451 cfi->drap_offset == -cfi->stack_size) {
2453 /* drap: pop %drap */
2454 cfa->base = cfi->drap_reg;
2456 cfi->drap_offset = -1;
2458 } else if (cfi->stack_size == -regs[op->dest.reg].offset) {
2461 restore_reg(cfi, op->dest.reg);
2464 cfi->stack_size -= 8;
2465 if (cfa->base == CFI_SP)
2470 case OP_SRC_REG_INDIRECT:
2471 if (!cfi->drap && op->dest.reg == cfa->base &&
2472 op->dest.reg == CFI_BP) {
2474 /* mov disp(%rsp), %rbp */
2476 cfa->offset = cfi->stack_size;
2479 if (cfi->drap && op->src.reg == CFI_BP &&
2480 op->src.offset == cfi->drap_offset) {
2482 /* drap: mov disp(%rbp), %drap */
2483 cfa->base = cfi->drap_reg;
2485 cfi->drap_offset = -1;
2488 if (cfi->drap && op->src.reg == CFI_BP &&
2489 op->src.offset == regs[op->dest.reg].offset) {
2491 /* drap: mov disp(%rbp), %reg */
2492 restore_reg(cfi, op->dest.reg);
2494 } else if (op->src.reg == cfa->base &&
2495 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
2497 /* mov disp(%rbp), %reg */
2498 /* mov disp(%rsp), %reg */
2499 restore_reg(cfi, op->dest.reg);
2501 } else if (op->src.reg == CFI_SP &&
2502 op->src.offset == regs[op->dest.reg].offset + cfi->stack_size) {
2504 /* mov disp(%rsp), %reg */
2505 restore_reg(cfi, op->dest.reg);
2511 WARN_FUNC("unknown stack-related instruction",
2512 insn->sec, insn->offset);
2520 cfi->stack_size += 8;
2521 if (cfa->base == CFI_SP)
2524 if (op->src.type != OP_SRC_REG)
2528 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2530 /* drap: push %drap */
2531 cfa->base = CFI_BP_INDIRECT;
2532 cfa->offset = -cfi->stack_size;
2534 /* save drap so we know when to restore it */
2535 cfi->drap_offset = -cfi->stack_size;
2537 } else if (op->src.reg == CFI_BP && cfa->base == cfi->drap_reg) {
2539 /* drap: push %rbp */
2540 cfi->stack_size = 0;
2544 /* drap: push %reg */
2545 save_reg(cfi, op->src.reg, CFI_BP, -cfi->stack_size);
2551 save_reg(cfi, op->src.reg, CFI_CFA, -cfi->stack_size);
2554 /* detect when asm code uses rbp as a scratch register */
2555 if (!no_fp && insn->func && op->src.reg == CFI_BP &&
2556 cfa->base != CFI_BP)
2557 cfi->bp_scratch = true;
2560 case OP_DEST_REG_INDIRECT:
2563 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2565 /* drap: mov %drap, disp(%rbp) */
2566 cfa->base = CFI_BP_INDIRECT;
2567 cfa->offset = op->dest.offset;
2569 /* save drap offset so we know when to restore it */
2570 cfi->drap_offset = op->dest.offset;
2573 /* drap: mov reg, disp(%rbp) */
2574 save_reg(cfi, op->src.reg, CFI_BP, op->dest.offset);
2577 } else if (op->dest.reg == cfa->base) {
2579 /* mov reg, disp(%rbp) */
2580 /* mov reg, disp(%rsp) */
2581 save_reg(cfi, op->src.reg, CFI_CFA,
2582 op->dest.offset - cfi->cfa.offset);
2584 } else if (op->dest.reg == CFI_SP) {
2586 /* mov reg, disp(%rsp) */
2587 save_reg(cfi, op->src.reg, CFI_CFA,
2588 op->dest.offset - cfi->stack_size);
2590 } else if (op->src.reg == CFI_SP && op->dest.offset == 0) {
2592 /* mov %rsp, (%reg); # setup a stack swizzle. */
2593 cfi->vals[op->dest.reg].base = CFI_SP_INDIRECT;
2594 cfi->vals[op->dest.reg].offset = cfa->offset;
2600 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
2601 WARN_FUNC("unknown stack-related memory operation",
2602 insn->sec, insn->offset);
2607 cfi->stack_size -= 8;
2608 if (cfa->base == CFI_SP)
2614 WARN_FUNC("unknown stack-related instruction",
2615 insn->sec, insn->offset);
2623 * The stack layouts of alternatives instructions can sometimes diverge when
2624 * they have stack modifications. That's fine as long as the potential stack
2625 * layouts don't conflict at any given potential instruction boundary.
2627 * Flatten the CFIs of the different alternative code streams (both original
2628 * and replacement) into a single shared CFI array which can be used to detect
2629 * conflicts and nicely feed a linear array of ORC entries to the unwinder.
2631 static int propagate_alt_cfi(struct objtool_file *file, struct instruction *insn)
2633 struct cfi_state **alt_cfi;
2636 if (!insn->alt_group)
2640 WARN("CFI missing");
2644 alt_cfi = insn->alt_group->cfi;
2645 group_off = insn->offset - insn->alt_group->first_insn->offset;
2647 if (!alt_cfi[group_off]) {
2648 alt_cfi[group_off] = insn->cfi;
2650 if (cficmp(alt_cfi[group_off], insn->cfi)) {
2651 WARN_FUNC("stack layout conflict in alternatives",
2652 insn->sec, insn->offset);
2660 static int handle_insn_ops(struct instruction *insn,
2661 struct instruction *next_insn,
2662 struct insn_state *state)
2664 struct stack_op *op;
2666 list_for_each_entry(op, &insn->stack_ops, list) {
2668 if (update_cfi_state(insn, next_insn, &state->cfi, op))
2671 if (!insn->alt_group)
2674 if (op->dest.type == OP_DEST_PUSHF) {
2675 if (!state->uaccess_stack) {
2676 state->uaccess_stack = 1;
2677 } else if (state->uaccess_stack >> 31) {
2678 WARN_FUNC("PUSHF stack exhausted",
2679 insn->sec, insn->offset);
2682 state->uaccess_stack <<= 1;
2683 state->uaccess_stack |= state->uaccess;
2686 if (op->src.type == OP_SRC_POPF) {
2687 if (state->uaccess_stack) {
2688 state->uaccess = state->uaccess_stack & 1;
2689 state->uaccess_stack >>= 1;
2690 if (state->uaccess_stack == 1)
2691 state->uaccess_stack = 0;
2699 static bool insn_cfi_match(struct instruction *insn, struct cfi_state *cfi2)
2701 struct cfi_state *cfi1 = insn->cfi;
2705 WARN("CFI missing");
2709 if (memcmp(&cfi1->cfa, &cfi2->cfa, sizeof(cfi1->cfa))) {
2711 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
2712 insn->sec, insn->offset,
2713 cfi1->cfa.base, cfi1->cfa.offset,
2714 cfi2->cfa.base, cfi2->cfa.offset);
2716 } else if (memcmp(&cfi1->regs, &cfi2->regs, sizeof(cfi1->regs))) {
2717 for (i = 0; i < CFI_NUM_REGS; i++) {
2718 if (!memcmp(&cfi1->regs[i], &cfi2->regs[i],
2719 sizeof(struct cfi_reg)))
2722 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
2723 insn->sec, insn->offset,
2724 i, cfi1->regs[i].base, cfi1->regs[i].offset,
2725 i, cfi2->regs[i].base, cfi2->regs[i].offset);
2729 } else if (cfi1->type != cfi2->type) {
2731 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
2732 insn->sec, insn->offset, cfi1->type, cfi2->type);
2734 } else if (cfi1->drap != cfi2->drap ||
2735 (cfi1->drap && cfi1->drap_reg != cfi2->drap_reg) ||
2736 (cfi1->drap && cfi1->drap_offset != cfi2->drap_offset)) {
2738 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
2739 insn->sec, insn->offset,
2740 cfi1->drap, cfi1->drap_reg, cfi1->drap_offset,
2741 cfi2->drap, cfi2->drap_reg, cfi2->drap_offset);
2749 static inline bool func_uaccess_safe(struct symbol *func)
2752 return func->uaccess_safe;
2757 static inline const char *call_dest_name(struct instruction *insn)
2759 static char pvname[16];
2763 if (insn->call_dest)
2764 return insn->call_dest->name;
2766 rel = insn_reloc(NULL, insn);
2767 if (rel && !strcmp(rel->sym->name, "pv_ops")) {
2768 idx = (rel->addend / sizeof(void *));
2769 snprintf(pvname, sizeof(pvname), "pv_ops[%d]", idx);
2776 static bool pv_call_dest(struct objtool_file *file, struct instruction *insn)
2778 struct symbol *target;
2782 rel = insn_reloc(file, insn);
2783 if (!rel || strcmp(rel->sym->name, "pv_ops"))
2786 idx = (arch_dest_reloc_offset(rel->addend) / sizeof(void *));
2788 if (file->pv_ops[idx].clean)
2791 file->pv_ops[idx].clean = true;
2793 list_for_each_entry(target, &file->pv_ops[idx].targets, pv_target) {
2794 if (!target->sec->noinstr) {
2795 WARN("pv_ops[%d]: %s", idx, target->name);
2796 file->pv_ops[idx].clean = false;
2800 return file->pv_ops[idx].clean;
2803 static inline bool noinstr_call_dest(struct objtool_file *file,
2804 struct instruction *insn,
2805 struct symbol *func)
2808 * We can't deal with indirect function calls at present;
2809 * assume they're instrumented.
2813 return pv_call_dest(file, insn);
2819 * If the symbol is from a noinstr section; we good.
2821 if (func->sec->noinstr)
2825 * The __ubsan_handle_*() calls are like WARN(), they only happen when
2826 * something 'BAD' happened. At the risk of taking the machine down,
2827 * let them proceed to get the message out.
2829 if (!strncmp(func->name, "__ubsan_handle_", 15))
2835 static int validate_call(struct objtool_file *file,
2836 struct instruction *insn,
2837 struct insn_state *state)
2839 if (state->noinstr && state->instr <= 0 &&
2840 !noinstr_call_dest(file, insn, insn->call_dest)) {
2841 WARN_FUNC("call to %s() leaves .noinstr.text section",
2842 insn->sec, insn->offset, call_dest_name(insn));
2846 if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
2847 WARN_FUNC("call to %s() with UACCESS enabled",
2848 insn->sec, insn->offset, call_dest_name(insn));
2853 WARN_FUNC("call to %s() with DF set",
2854 insn->sec, insn->offset, call_dest_name(insn));
2861 static int validate_sibling_call(struct objtool_file *file,
2862 struct instruction *insn,
2863 struct insn_state *state)
2865 if (has_modified_stack_frame(insn, state)) {
2866 WARN_FUNC("sibling call from callable instruction with modified stack frame",
2867 insn->sec, insn->offset);
2871 return validate_call(file, insn, state);
2874 static int validate_return(struct symbol *func, struct instruction *insn, struct insn_state *state)
2876 if (state->noinstr && state->instr > 0) {
2877 WARN_FUNC("return with instrumentation enabled",
2878 insn->sec, insn->offset);
2882 if (state->uaccess && !func_uaccess_safe(func)) {
2883 WARN_FUNC("return with UACCESS enabled",
2884 insn->sec, insn->offset);
2888 if (!state->uaccess && func_uaccess_safe(func)) {
2889 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function",
2890 insn->sec, insn->offset);
2895 WARN_FUNC("return with DF set",
2896 insn->sec, insn->offset);
2900 if (func && has_modified_stack_frame(insn, state)) {
2901 WARN_FUNC("return with modified stack frame",
2902 insn->sec, insn->offset);
2906 if (state->cfi.bp_scratch) {
2907 WARN_FUNC("BP used as a scratch register",
2908 insn->sec, insn->offset);
2915 static struct instruction *next_insn_to_validate(struct objtool_file *file,
2916 struct instruction *insn)
2918 struct alt_group *alt_group = insn->alt_group;
2921 * Simulate the fact that alternatives are patched in-place. When the
2922 * end of a replacement alt_group is reached, redirect objtool flow to
2923 * the end of the original alt_group.
2925 if (alt_group && insn == alt_group->last_insn && alt_group->orig_group)
2926 return next_insn_same_sec(file, alt_group->orig_group->last_insn);
2928 return next_insn_same_sec(file, insn);
2932 * Follow the branch starting at the given instruction, and recursively follow
2933 * any other branches (jumps). Meanwhile, track the frame pointer state at
2934 * each instruction and validate all the rules described in
2935 * tools/objtool/Documentation/stack-validation.txt.
2937 static int validate_branch(struct objtool_file *file, struct symbol *func,
2938 struct instruction *insn, struct insn_state state)
2940 struct alternative *alt;
2941 struct instruction *next_insn, *prev_insn = NULL;
2942 struct section *sec;
2949 next_insn = next_insn_to_validate(file, insn);
2951 if (file->c_file && func && insn->func && func != insn->func->pfunc) {
2952 WARN("%s() falls through to next function %s()",
2953 func->name, insn->func->name);
2957 if (func && insn->ignore) {
2958 WARN_FUNC("BUG: why am I validating an ignored function?",
2963 visited = 1 << state.uaccess;
2964 if (insn->visited) {
2965 if (!insn->hint && !insn_cfi_match(insn, &state.cfi))
2968 if (insn->visited & visited)
2975 state.instr += insn->instr;
2978 state.cfi = *insn->cfi;
2980 /* XXX track if we actually changed state.cfi */
2982 if (prev_insn && !cficmp(prev_insn->cfi, &state.cfi)) {
2983 insn->cfi = prev_insn->cfi;
2986 insn->cfi = cfi_hash_find_or_add(&state.cfi);
2990 insn->visited |= visited;
2992 if (propagate_alt_cfi(file, insn))
2995 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
2996 bool skip_orig = false;
2998 list_for_each_entry(alt, &insn->alts, list) {
3002 ret = validate_branch(file, func, alt->insn, state);
3005 BT_FUNC("(alt)", insn);
3014 if (handle_insn_ops(insn, next_insn, &state))
3017 switch (insn->type) {
3020 return validate_return(func, insn, &state);
3023 case INSN_CALL_DYNAMIC:
3024 ret = validate_call(file, insn, &state);
3028 if (!no_fp && func && !is_fentry_call(insn) &&
3029 !has_valid_stack_frame(&state)) {
3030 WARN_FUNC("call without frame pointer save/setup",
3035 if (dead_end_function(file, insn->call_dest))
3040 case INSN_JUMP_CONDITIONAL:
3041 case INSN_JUMP_UNCONDITIONAL:
3042 if (is_sibling_call(insn)) {
3043 ret = validate_sibling_call(file, insn, &state);
3047 } else if (insn->jump_dest) {
3048 ret = validate_branch(file, func,
3049 insn->jump_dest, state);
3052 BT_FUNC("(branch)", insn);
3057 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3062 case INSN_JUMP_DYNAMIC:
3063 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3064 if (is_sibling_call(insn)) {
3065 ret = validate_sibling_call(file, insn, &state);
3070 if (insn->type == INSN_JUMP_DYNAMIC)
3075 case INSN_CONTEXT_SWITCH:
3076 if (func && (!next_insn || !next_insn->hint)) {
3077 WARN_FUNC("unsupported instruction in callable function",
3084 if (state.uaccess) {
3085 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
3089 state.uaccess = true;
3093 if (!state.uaccess && func) {
3094 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
3098 if (func_uaccess_safe(func) && !state.uaccess_stack) {
3099 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
3103 state.uaccess = false;
3108 WARN_FUNC("recursive STD", sec, insn->offset);
3116 if (!state.df && func) {
3117 WARN_FUNC("redundant CLD", sec, insn->offset);
3132 if (state.cfi.cfa.base == CFI_UNDEFINED)
3134 WARN("%s: unexpected end of section", sec->name);
3145 static int validate_unwind_hints(struct objtool_file *file, struct section *sec)
3147 struct instruction *insn;
3148 struct insn_state state;
3149 int ret, warnings = 0;
3154 init_insn_state(&state, sec);
3157 insn = find_insn(file, sec, 0);
3161 insn = list_first_entry(&file->insn_list, typeof(*insn), list);
3164 while (&insn->list != &file->insn_list && (!sec || insn->sec == sec)) {
3165 if (insn->hint && !insn->visited) {
3166 ret = validate_branch(file, insn->func, insn, state);
3167 if (ret && backtrace)
3168 BT_FUNC("<=== (hint)", insn);
3172 insn = list_next_entry(insn, list);
3178 static int validate_retpoline(struct objtool_file *file)
3180 struct instruction *insn;
3183 for_each_insn(file, insn) {
3184 if (insn->type != INSN_JUMP_DYNAMIC &&
3185 insn->type != INSN_CALL_DYNAMIC)
3188 if (insn->retpoline_safe)
3192 * .init.text code is ran before userspace and thus doesn't
3193 * strictly need retpolines, except for modules which are
3194 * loaded late, they very much do need retpoline in their
3197 if (!strcmp(insn->sec->name, ".init.text") && !module)
3200 WARN_FUNC("indirect %s found in RETPOLINE build",
3201 insn->sec, insn->offset,
3202 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
3210 static bool is_kasan_insn(struct instruction *insn)
3212 return (insn->type == INSN_CALL &&
3213 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
3216 static bool is_ubsan_insn(struct instruction *insn)
3218 return (insn->type == INSN_CALL &&
3219 !strcmp(insn->call_dest->name,
3220 "__ubsan_handle_builtin_unreachable"));
3223 static bool ignore_unreachable_insn(struct objtool_file *file, struct instruction *insn)
3226 struct instruction *prev_insn;
3228 if (insn->ignore || insn->type == INSN_NOP)
3232 * Ignore any unused exceptions. This can happen when a whitelisted
3233 * function has an exception table entry.
3235 * Also ignore alternative replacement instructions. This can happen
3236 * when a whitelisted function uses one of the ALTERNATIVE macros.
3238 if (!strcmp(insn->sec->name, ".fixup") ||
3239 !strcmp(insn->sec->name, ".altinstr_replacement") ||
3240 !strcmp(insn->sec->name, ".altinstr_aux"))
3247 * CONFIG_UBSAN_TRAP inserts a UD2 when it sees
3248 * __builtin_unreachable(). The BUG() macro has an unreachable() after
3249 * the UD2, which causes GCC's undefined trap logic to emit another UD2
3250 * (or occasionally a JMP to UD2).
3252 * It may also insert a UD2 after calling a __noreturn function.
3254 prev_insn = list_prev_entry(insn, list);
3255 if ((prev_insn->dead_end || dead_end_function(file, prev_insn->call_dest)) &&
3256 (insn->type == INSN_BUG ||
3257 (insn->type == INSN_JUMP_UNCONDITIONAL &&
3258 insn->jump_dest && insn->jump_dest->type == INSN_BUG)))
3262 * Check if this (or a subsequent) instruction is related to
3263 * CONFIG_UBSAN or CONFIG_KASAN.
3265 * End the search at 5 instructions to avoid going into the weeds.
3267 for (i = 0; i < 5; i++) {
3269 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
3272 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
3273 if (insn->jump_dest &&
3274 insn->jump_dest->func == insn->func) {
3275 insn = insn->jump_dest;
3282 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
3285 insn = list_next_entry(insn, list);
3291 static int validate_symbol(struct objtool_file *file, struct section *sec,
3292 struct symbol *sym, struct insn_state *state)
3294 struct instruction *insn;
3298 WARN("%s() is missing an ELF size annotation", sym->name);
3302 if (sym->pfunc != sym || sym->alias != sym)
3305 insn = find_insn(file, sec, sym->offset);
3306 if (!insn || insn->ignore || insn->visited)
3309 state->uaccess = sym->uaccess_safe;
3311 ret = validate_branch(file, insn->func, insn, *state);
3312 if (ret && backtrace)
3313 BT_FUNC("<=== (sym)", insn);
3317 static int validate_section(struct objtool_file *file, struct section *sec)
3319 struct insn_state state;
3320 struct symbol *func;
3323 list_for_each_entry(func, &sec->symbol_list, list) {
3324 if (func->type != STT_FUNC)
3327 init_insn_state(&state, sec);
3328 set_func_state(&state.cfi);
3330 warnings += validate_symbol(file, sec, func, &state);
3336 static int validate_vmlinux_functions(struct objtool_file *file)
3338 struct section *sec;
3341 sec = find_section_by_name(file->elf, ".noinstr.text");
3343 warnings += validate_section(file, sec);
3344 warnings += validate_unwind_hints(file, sec);
3347 sec = find_section_by_name(file->elf, ".entry.text");
3349 warnings += validate_section(file, sec);
3350 warnings += validate_unwind_hints(file, sec);
3356 static int validate_functions(struct objtool_file *file)
3358 struct section *sec;
3361 for_each_sec(file, sec) {
3362 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
3365 warnings += validate_section(file, sec);
3371 static int validate_reachable_instructions(struct objtool_file *file)
3373 struct instruction *insn;
3375 if (file->ignore_unreachables)
3378 for_each_insn(file, insn) {
3379 if (insn->visited || ignore_unreachable_insn(file, insn))
3382 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
3389 int check(struct objtool_file *file)
3391 int ret, warnings = 0;
3393 arch_initial_func_cfi_state(&initial_func_cfi);
3394 init_cfi_state(&init_cfi);
3395 init_cfi_state(&func_cfi);
3396 set_func_state(&func_cfi);
3398 if (!cfi_hash_alloc(1UL << (file->elf->symbol_bits - 3)))
3401 cfi_hash_add(&init_cfi);
3402 cfi_hash_add(&func_cfi);
3404 ret = decode_sections(file);
3410 if (list_empty(&file->insn_list))
3413 if (vmlinux && !validate_dup) {
3414 ret = validate_vmlinux_functions(file);
3423 ret = validate_retpoline(file);
3429 ret = validate_functions(file);
3434 ret = validate_unwind_hints(file, NULL);
3440 ret = validate_reachable_instructions(file);
3446 ret = create_static_call_sections(file);
3452 ret = create_mcount_loc_sections(file);
3459 printf("nr_insns_visited: %ld\n", nr_insns_visited);
3460 printf("nr_cfi: %ld\n", nr_cfi);
3461 printf("nr_cfi_reused: %ld\n", nr_cfi_reused);
3462 printf("nr_cfi_cache: %ld\n", nr_cfi_cache);
3467 * For now, don't fail the kernel build on fatal warnings. These
3468 * errors are still fairly common due to the growing matrix of
3469 * supported toolchains and their recent pace of change.