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. Keep 'em sorted.
167 static const char * const global_noreturns[] = {
169 "__module_put_and_kthread_exit",
172 "__ubsan_handle_builtin_unreachable",
173 "cpu_bringup_and_idle",
178 "ex_handler_msr_mce",
180 "kthread_complete_and_exit",
182 "kunit_try_catch_throw",
184 "machine_real_restart",
187 "rewind_stack_and_make_dead",
198 if (func->bind == STB_WEAK)
201 if (func->bind == STB_GLOBAL)
202 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
203 if (!strcmp(func->name, global_noreturns[i]))
209 insn = find_insn(file, func->sec, func->offset);
213 func_for_each_insn(file, func, insn) {
216 if (insn->type == INSN_RETURN)
224 * A function can have a sibling call instead of a return. In that
225 * case, the function's dead-end status depends on whether the target
226 * of the sibling call returns.
228 func_for_each_insn(file, func, insn) {
229 if (is_sibling_call(insn)) {
230 struct instruction *dest = insn->jump_dest;
233 /* sibling call to another file */
236 /* local sibling call */
237 if (recursion == 5) {
239 * Infinite recursion: two functions have
240 * sibling calls to each other. This is a very
241 * rare case. It means they aren't dead ends.
246 return __dead_end_function(file, dest->func, recursion+1);
253 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
255 return __dead_end_function(file, func, 0);
258 static void init_cfi_state(struct cfi_state *cfi)
262 for (i = 0; i < CFI_NUM_REGS; i++) {
263 cfi->regs[i].base = CFI_UNDEFINED;
264 cfi->vals[i].base = CFI_UNDEFINED;
266 cfi->cfa.base = CFI_UNDEFINED;
267 cfi->drap_reg = CFI_UNDEFINED;
268 cfi->drap_offset = -1;
271 static void init_insn_state(struct objtool_file *file, struct insn_state *state,
274 memset(state, 0, sizeof(*state));
275 init_cfi_state(&state->cfi);
278 * We need the full vmlinux for noinstr validation, otherwise we can
279 * not correctly determine insn->call_dest->sec (external symbols do
280 * not have a section).
282 if (opts.link && opts.noinstr && sec)
283 state->noinstr = sec->noinstr;
286 static struct cfi_state *cfi_alloc(void)
288 struct cfi_state *cfi = calloc(sizeof(struct cfi_state), 1);
290 WARN("calloc failed");
298 static struct hlist_head *cfi_hash;
300 static inline bool cficmp(struct cfi_state *cfi1, struct cfi_state *cfi2)
302 return memcmp((void *)cfi1 + sizeof(cfi1->hash),
303 (void *)cfi2 + sizeof(cfi2->hash),
304 sizeof(struct cfi_state) - sizeof(struct hlist_node));
307 static inline u32 cfi_key(struct cfi_state *cfi)
309 return jhash((void *)cfi + sizeof(cfi->hash),
310 sizeof(*cfi) - sizeof(cfi->hash), 0);
313 static struct cfi_state *cfi_hash_find_or_add(struct cfi_state *cfi)
315 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
316 struct cfi_state *obj;
318 hlist_for_each_entry(obj, head, hash) {
319 if (!cficmp(cfi, obj)) {
327 hlist_add_head(&obj->hash, head);
332 static void cfi_hash_add(struct cfi_state *cfi)
334 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
336 hlist_add_head(&cfi->hash, head);
339 static void *cfi_hash_alloc(unsigned long size)
341 cfi_bits = max(10, ilog2(size));
342 cfi_hash = mmap(NULL, sizeof(struct hlist_head) << cfi_bits,
343 PROT_READ|PROT_WRITE,
344 MAP_PRIVATE|MAP_ANON, -1, 0);
345 if (cfi_hash == (void *)-1L) {
346 WARN("mmap fail cfi_hash");
348 } else if (opts.stats) {
349 printf("cfi_bits: %d\n", cfi_bits);
355 static unsigned long nr_insns;
356 static unsigned long nr_insns_visited;
359 * Call the arch-specific instruction decoder for all the instructions and add
360 * them to the global instruction list.
362 static int decode_instructions(struct objtool_file *file)
366 unsigned long offset;
367 struct instruction *insn;
370 for_each_sec(file, sec) {
372 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
375 if (strcmp(sec->name, ".altinstr_replacement") &&
376 strcmp(sec->name, ".altinstr_aux") &&
377 strncmp(sec->name, ".discard.", 9))
380 if (!strcmp(sec->name, ".noinstr.text") ||
381 !strcmp(sec->name, ".entry.text") ||
382 !strncmp(sec->name, ".text.__x86.", 12))
385 for (offset = 0; offset < sec->sh.sh_size; offset += insn->len) {
386 insn = malloc(sizeof(*insn));
388 WARN("malloc failed");
391 memset(insn, 0, sizeof(*insn));
392 INIT_LIST_HEAD(&insn->alts);
393 INIT_LIST_HEAD(&insn->stack_ops);
394 INIT_LIST_HEAD(&insn->call_node);
397 insn->offset = offset;
399 ret = arch_decode_instruction(file, sec, offset,
400 sec->sh.sh_size - offset,
401 &insn->len, &insn->type,
408 * By default, "ud2" is a dead end unless otherwise
409 * annotated, because GCC 7 inserts it for certain
410 * divide-by-zero cases.
412 if (insn->type == INSN_BUG)
413 insn->dead_end = true;
415 hash_add(file->insn_hash, &insn->hash, sec_offset_hash(sec, insn->offset));
416 list_add_tail(&insn->list, &file->insn_list);
420 list_for_each_entry(func, &sec->symbol_list, list) {
421 if (func->type != STT_FUNC || func->alias != func)
424 if (!find_insn(file, sec, func->offset)) {
425 WARN("%s(): can't find starting instruction",
430 sym_for_each_insn(file, func, insn) {
432 if (insn->type == INSN_ENDBR && list_empty(&insn->call_node)) {
433 if (insn->offset == insn->func->offset) {
434 list_add_tail(&insn->call_node, &file->endbr_list);
437 file->nr_endbr_int++;
445 printf("nr_insns: %lu\n", nr_insns);
455 * Read the pv_ops[] .data table to find the static initialized values.
457 static int add_pv_ops(struct objtool_file *file, const char *symname)
459 struct symbol *sym, *func;
460 unsigned long off, end;
464 sym = find_symbol_by_name(file->elf, symname);
469 end = off + sym->len;
471 rel = find_reloc_by_dest_range(file->elf, sym->sec, off, end - off);
476 if (func->type == STT_SECTION)
477 func = find_symbol_by_offset(rel->sym->sec, rel->addend);
479 idx = (rel->offset - sym->offset) / sizeof(unsigned long);
481 objtool_pv_add(file, idx, func);
483 off = rel->offset + 1;
492 * Allocate and initialize file->pv_ops[].
494 static int init_pv_ops(struct objtool_file *file)
496 static const char *pv_ops_tables[] = {
512 sym = find_symbol_by_name(file->elf, "pv_ops");
516 nr = sym->len / sizeof(unsigned long);
517 file->pv_ops = calloc(sizeof(struct pv_state), nr);
521 for (idx = 0; idx < nr; idx++)
522 INIT_LIST_HEAD(&file->pv_ops[idx].targets);
524 for (idx = 0; (pv_ops = pv_ops_tables[idx]); idx++)
525 add_pv_ops(file, pv_ops);
530 static struct instruction *find_last_insn(struct objtool_file *file,
533 struct instruction *insn = NULL;
535 unsigned int end = (sec->sh.sh_size > 10) ? sec->sh.sh_size - 10 : 0;
537 for (offset = sec->sh.sh_size - 1; offset >= end && !insn; offset--)
538 insn = find_insn(file, sec, offset);
544 * Mark "ud2" instructions and manually annotated dead ends.
546 static int add_dead_ends(struct objtool_file *file)
550 struct instruction *insn;
553 * Check for manually annotated dead ends.
555 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
559 list_for_each_entry(reloc, &sec->reloc_list, list) {
560 if (reloc->sym->type != STT_SECTION) {
561 WARN("unexpected relocation symbol type in %s", sec->name);
564 insn = find_insn(file, reloc->sym->sec, reloc->addend);
566 insn = list_prev_entry(insn, list);
567 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
568 insn = find_last_insn(file, reloc->sym->sec);
570 WARN("can't find unreachable insn at %s+0x%" PRIx64,
571 reloc->sym->sec->name, reloc->addend);
575 WARN("can't find unreachable insn at %s+0x%" PRIx64,
576 reloc->sym->sec->name, reloc->addend);
580 insn->dead_end = true;
585 * These manually annotated reachable checks are needed for GCC 4.4,
586 * where the Linux unreachable() macro isn't supported. In that case
587 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
590 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
594 list_for_each_entry(reloc, &sec->reloc_list, list) {
595 if (reloc->sym->type != STT_SECTION) {
596 WARN("unexpected relocation symbol type in %s", sec->name);
599 insn = find_insn(file, reloc->sym->sec, reloc->addend);
601 insn = list_prev_entry(insn, list);
602 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
603 insn = find_last_insn(file, reloc->sym->sec);
605 WARN("can't find reachable insn at %s+0x%" PRIx64,
606 reloc->sym->sec->name, reloc->addend);
610 WARN("can't find reachable insn at %s+0x%" PRIx64,
611 reloc->sym->sec->name, reloc->addend);
615 insn->dead_end = false;
621 static int create_static_call_sections(struct objtool_file *file)
624 struct static_call_site *site;
625 struct instruction *insn;
626 struct symbol *key_sym;
627 char *key_name, *tmp;
630 sec = find_section_by_name(file->elf, ".static_call_sites");
632 INIT_LIST_HEAD(&file->static_call_list);
633 WARN("file already has .static_call_sites section, skipping");
637 if (list_empty(&file->static_call_list))
641 list_for_each_entry(insn, &file->static_call_list, call_node)
644 sec = elf_create_section(file->elf, ".static_call_sites", SHF_WRITE,
645 sizeof(struct static_call_site), idx);
650 list_for_each_entry(insn, &file->static_call_list, call_node) {
652 site = (struct static_call_site *)sec->data->d_buf + idx;
653 memset(site, 0, sizeof(struct static_call_site));
655 /* populate reloc for 'addr' */
656 if (elf_add_reloc_to_insn(file->elf, sec,
657 idx * sizeof(struct static_call_site),
659 insn->sec, insn->offset))
662 /* find key symbol */
663 key_name = strdup(insn->call_dest->name);
668 if (strncmp(key_name, STATIC_CALL_TRAMP_PREFIX_STR,
669 STATIC_CALL_TRAMP_PREFIX_LEN)) {
670 WARN("static_call: trampoline name malformed: %s", key_name);
673 tmp = key_name + STATIC_CALL_TRAMP_PREFIX_LEN - STATIC_CALL_KEY_PREFIX_LEN;
674 memcpy(tmp, STATIC_CALL_KEY_PREFIX_STR, STATIC_CALL_KEY_PREFIX_LEN);
676 key_sym = find_symbol_by_name(file->elf, tmp);
679 WARN("static_call: can't find static_call_key symbol: %s", tmp);
684 * For modules(), the key might not be exported, which
685 * means the module can make static calls but isn't
686 * allowed to change them.
688 * In that case we temporarily set the key to be the
689 * trampoline address. This is fixed up in
690 * static_call_add_module().
692 key_sym = insn->call_dest;
696 /* populate reloc for 'key' */
697 if (elf_add_reloc(file->elf, sec,
698 idx * sizeof(struct static_call_site) + 4,
699 R_X86_64_PC32, key_sym,
700 is_sibling_call(insn) * STATIC_CALL_SITE_TAIL))
709 static int create_retpoline_sites_sections(struct objtool_file *file)
711 struct instruction *insn;
715 sec = find_section_by_name(file->elf, ".retpoline_sites");
717 WARN("file already has .retpoline_sites, skipping");
722 list_for_each_entry(insn, &file->retpoline_call_list, call_node)
728 sec = elf_create_section(file->elf, ".retpoline_sites", 0,
731 WARN("elf_create_section: .retpoline_sites");
736 list_for_each_entry(insn, &file->retpoline_call_list, call_node) {
738 int *site = (int *)sec->data->d_buf + idx;
741 if (elf_add_reloc_to_insn(file->elf, sec,
744 insn->sec, insn->offset)) {
745 WARN("elf_add_reloc_to_insn: .retpoline_sites");
755 static int create_return_sites_sections(struct objtool_file *file)
757 struct instruction *insn;
761 sec = find_section_by_name(file->elf, ".return_sites");
763 WARN("file already has .return_sites, skipping");
768 list_for_each_entry(insn, &file->return_thunk_list, call_node)
774 sec = elf_create_section(file->elf, ".return_sites", 0,
777 WARN("elf_create_section: .return_sites");
782 list_for_each_entry(insn, &file->return_thunk_list, call_node) {
784 int *site = (int *)sec->data->d_buf + idx;
787 if (elf_add_reloc_to_insn(file->elf, sec,
790 insn->sec, insn->offset)) {
791 WARN("elf_add_reloc_to_insn: .return_sites");
801 static int create_ibt_endbr_seal_sections(struct objtool_file *file)
803 struct instruction *insn;
807 sec = find_section_by_name(file->elf, ".ibt_endbr_seal");
809 WARN("file already has .ibt_endbr_seal, skipping");
814 list_for_each_entry(insn, &file->endbr_list, call_node)
818 printf("ibt: ENDBR at function start: %d\n", file->nr_endbr);
819 printf("ibt: ENDBR inside functions: %d\n", file->nr_endbr_int);
820 printf("ibt: superfluous ENDBR: %d\n", idx);
826 sec = elf_create_section(file->elf, ".ibt_endbr_seal", 0,
829 WARN("elf_create_section: .ibt_endbr_seal");
834 list_for_each_entry(insn, &file->endbr_list, call_node) {
836 int *site = (int *)sec->data->d_buf + idx;
839 if (elf_add_reloc_to_insn(file->elf, sec,
842 insn->sec, insn->offset)) {
843 WARN("elf_add_reloc_to_insn: .ibt_endbr_seal");
853 static int create_mcount_loc_sections(struct objtool_file *file)
857 struct instruction *insn;
860 sec = find_section_by_name(file->elf, "__mcount_loc");
862 INIT_LIST_HEAD(&file->mcount_loc_list);
863 WARN("file already has __mcount_loc section, skipping");
867 if (list_empty(&file->mcount_loc_list))
871 list_for_each_entry(insn, &file->mcount_loc_list, call_node)
874 sec = elf_create_section(file->elf, "__mcount_loc", 0, sizeof(unsigned long), idx);
879 list_for_each_entry(insn, &file->mcount_loc_list, call_node) {
881 loc = (unsigned long *)sec->data->d_buf + idx;
882 memset(loc, 0, sizeof(unsigned long));
884 if (elf_add_reloc_to_insn(file->elf, sec,
885 idx * sizeof(unsigned long),
887 insn->sec, insn->offset))
897 * Warnings shouldn't be reported for ignored functions.
899 static void add_ignores(struct objtool_file *file)
901 struct instruction *insn;
906 sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
910 list_for_each_entry(reloc, &sec->reloc_list, list) {
911 switch (reloc->sym->type) {
917 func = find_func_by_offset(reloc->sym->sec, reloc->addend);
923 WARN("unexpected relocation symbol type in %s: %d", sec->name, reloc->sym->type);
927 func_for_each_insn(file, func, insn)
933 * This is a whitelist of functions that is allowed to be called with AC set.
934 * The list is meant to be minimal and only contains compiler instrumentation
935 * ABI and a few functions used to implement *_{to,from}_user() functions.
937 * These functions must not directly change AC, but may PUSHF/POPF.
939 static const char *uaccess_safe_builtin[] = {
943 /* KASAN out-of-line */
944 "__asan_loadN_noabort",
945 "__asan_load1_noabort",
946 "__asan_load2_noabort",
947 "__asan_load4_noabort",
948 "__asan_load8_noabort",
949 "__asan_load16_noabort",
950 "__asan_storeN_noabort",
951 "__asan_store1_noabort",
952 "__asan_store2_noabort",
953 "__asan_store4_noabort",
954 "__asan_store8_noabort",
955 "__asan_store16_noabort",
956 "__kasan_check_read",
957 "__kasan_check_write",
959 "__asan_report_load_n_noabort",
960 "__asan_report_load1_noabort",
961 "__asan_report_load2_noabort",
962 "__asan_report_load4_noabort",
963 "__asan_report_load8_noabort",
964 "__asan_report_load16_noabort",
965 "__asan_report_store_n_noabort",
966 "__asan_report_store1_noabort",
967 "__asan_report_store2_noabort",
968 "__asan_report_store4_noabort",
969 "__asan_report_store8_noabort",
970 "__asan_report_store16_noabort",
972 "__kcsan_check_access",
977 "kcsan_found_watchpoint",
978 "kcsan_setup_watchpoint",
979 "kcsan_check_scoped_accesses",
980 "kcsan_disable_current",
981 "kcsan_enable_current_nowarn",
986 "__tsan_write_range",
997 "__tsan_read_write1",
998 "__tsan_read_write2",
999 "__tsan_read_write4",
1000 "__tsan_read_write8",
1001 "__tsan_read_write16",
1002 "__tsan_atomic8_load",
1003 "__tsan_atomic16_load",
1004 "__tsan_atomic32_load",
1005 "__tsan_atomic64_load",
1006 "__tsan_atomic8_store",
1007 "__tsan_atomic16_store",
1008 "__tsan_atomic32_store",
1009 "__tsan_atomic64_store",
1010 "__tsan_atomic8_exchange",
1011 "__tsan_atomic16_exchange",
1012 "__tsan_atomic32_exchange",
1013 "__tsan_atomic64_exchange",
1014 "__tsan_atomic8_fetch_add",
1015 "__tsan_atomic16_fetch_add",
1016 "__tsan_atomic32_fetch_add",
1017 "__tsan_atomic64_fetch_add",
1018 "__tsan_atomic8_fetch_sub",
1019 "__tsan_atomic16_fetch_sub",
1020 "__tsan_atomic32_fetch_sub",
1021 "__tsan_atomic64_fetch_sub",
1022 "__tsan_atomic8_fetch_and",
1023 "__tsan_atomic16_fetch_and",
1024 "__tsan_atomic32_fetch_and",
1025 "__tsan_atomic64_fetch_and",
1026 "__tsan_atomic8_fetch_or",
1027 "__tsan_atomic16_fetch_or",
1028 "__tsan_atomic32_fetch_or",
1029 "__tsan_atomic64_fetch_or",
1030 "__tsan_atomic8_fetch_xor",
1031 "__tsan_atomic16_fetch_xor",
1032 "__tsan_atomic32_fetch_xor",
1033 "__tsan_atomic64_fetch_xor",
1034 "__tsan_atomic8_fetch_nand",
1035 "__tsan_atomic16_fetch_nand",
1036 "__tsan_atomic32_fetch_nand",
1037 "__tsan_atomic64_fetch_nand",
1038 "__tsan_atomic8_compare_exchange_strong",
1039 "__tsan_atomic16_compare_exchange_strong",
1040 "__tsan_atomic32_compare_exchange_strong",
1041 "__tsan_atomic64_compare_exchange_strong",
1042 "__tsan_atomic8_compare_exchange_weak",
1043 "__tsan_atomic16_compare_exchange_weak",
1044 "__tsan_atomic32_compare_exchange_weak",
1045 "__tsan_atomic64_compare_exchange_weak",
1046 "__tsan_atomic8_compare_exchange_val",
1047 "__tsan_atomic16_compare_exchange_val",
1048 "__tsan_atomic32_compare_exchange_val",
1049 "__tsan_atomic64_compare_exchange_val",
1050 "__tsan_atomic_thread_fence",
1051 "__tsan_atomic_signal_fence",
1055 "__sanitizer_cov_trace_pc",
1056 "__sanitizer_cov_trace_const_cmp1",
1057 "__sanitizer_cov_trace_const_cmp2",
1058 "__sanitizer_cov_trace_const_cmp4",
1059 "__sanitizer_cov_trace_const_cmp8",
1060 "__sanitizer_cov_trace_cmp1",
1061 "__sanitizer_cov_trace_cmp2",
1062 "__sanitizer_cov_trace_cmp4",
1063 "__sanitizer_cov_trace_cmp8",
1064 "__sanitizer_cov_trace_switch",
1066 "ubsan_type_mismatch_common",
1067 "__ubsan_handle_type_mismatch",
1068 "__ubsan_handle_type_mismatch_v1",
1069 "__ubsan_handle_shift_out_of_bounds",
1071 "csum_partial_copy_generic",
1073 "copy_mc_fragile_handle_tail",
1074 "copy_mc_enhanced_fast_string",
1075 "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
1077 "clear_user_rep_good",
1078 "clear_user_original",
1082 static void add_uaccess_safe(struct objtool_file *file)
1084 struct symbol *func;
1090 for (name = uaccess_safe_builtin; *name; name++) {
1091 func = find_symbol_by_name(file->elf, *name);
1095 func->uaccess_safe = true;
1100 * FIXME: For now, just ignore any alternatives which add retpolines. This is
1101 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
1102 * But it at least allows objtool to understand the control flow *around* the
1105 static int add_ignore_alternatives(struct objtool_file *file)
1107 struct section *sec;
1108 struct reloc *reloc;
1109 struct instruction *insn;
1111 sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
1115 list_for_each_entry(reloc, &sec->reloc_list, list) {
1116 if (reloc->sym->type != STT_SECTION) {
1117 WARN("unexpected relocation symbol type in %s", sec->name);
1121 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1123 WARN("bad .discard.ignore_alts entry");
1127 insn->ignore_alts = true;
1133 __weak bool arch_is_retpoline(struct symbol *sym)
1138 __weak bool arch_is_rethunk(struct symbol *sym)
1143 #define NEGATIVE_RELOC ((void *)-1L)
1145 static struct reloc *insn_reloc(struct objtool_file *file, struct instruction *insn)
1147 if (insn->reloc == NEGATIVE_RELOC)
1154 insn->reloc = find_reloc_by_dest_range(file->elf, insn->sec,
1155 insn->offset, insn->len);
1157 insn->reloc = NEGATIVE_RELOC;
1165 static void remove_insn_ops(struct instruction *insn)
1167 struct stack_op *op, *tmp;
1169 list_for_each_entry_safe(op, tmp, &insn->stack_ops, list) {
1170 list_del(&op->list);
1175 static void annotate_call_site(struct objtool_file *file,
1176 struct instruction *insn, bool sibling)
1178 struct reloc *reloc = insn_reloc(file, insn);
1179 struct symbol *sym = insn->call_dest;
1185 * Alternative replacement code is just template code which is
1186 * sometimes copied to the original instruction. For now, don't
1187 * annotate it. (In the future we might consider annotating the
1188 * original instruction if/when it ever makes sense to do so.)
1190 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
1193 if (sym->static_call_tramp) {
1194 list_add_tail(&insn->call_node, &file->static_call_list);
1198 if (sym->retpoline_thunk) {
1199 list_add_tail(&insn->call_node, &file->retpoline_call_list);
1204 * Many compilers cannot disable KCOV or sanitizer calls with a function
1205 * attribute so they need a little help, NOP out any such calls from
1208 if (opts.hack_noinstr && insn->sec->noinstr && sym->profiling_func) {
1210 reloc->type = R_NONE;
1211 elf_write_reloc(file->elf, reloc);
1214 elf_write_insn(file->elf, insn->sec,
1215 insn->offset, insn->len,
1216 sibling ? arch_ret_insn(insn->len)
1217 : arch_nop_insn(insn->len));
1219 insn->type = sibling ? INSN_RETURN : INSN_NOP;
1223 * We've replaced the tail-call JMP insn by two new
1224 * insn: RET; INT3, except we only have a single struct
1225 * insn here. Mark it retpoline_safe to avoid the SLS
1226 * warning, instead of adding another insn.
1228 insn->retpoline_safe = true;
1234 if (opts.mcount && sym->fentry) {
1236 WARN_FUNC("Tail call to __fentry__ !?!?", insn->sec, insn->offset);
1239 reloc->type = R_NONE;
1240 elf_write_reloc(file->elf, reloc);
1243 elf_write_insn(file->elf, insn->sec,
1244 insn->offset, insn->len,
1245 arch_nop_insn(insn->len));
1247 insn->type = INSN_NOP;
1249 list_add_tail(&insn->call_node, &file->mcount_loc_list);
1253 if (!sibling && dead_end_function(file, sym))
1254 insn->dead_end = true;
1257 static void add_call_dest(struct objtool_file *file, struct instruction *insn,
1258 struct symbol *dest, bool sibling)
1260 insn->call_dest = dest;
1265 * Whatever stack impact regular CALLs have, should be undone
1266 * by the RETURN of the called function.
1268 * Annotated intra-function calls retain the stack_ops but
1269 * are converted to JUMP, see read_intra_function_calls().
1271 remove_insn_ops(insn);
1273 annotate_call_site(file, insn, sibling);
1276 static void add_retpoline_call(struct objtool_file *file, struct instruction *insn)
1279 * Retpoline calls/jumps are really dynamic calls/jumps in disguise,
1280 * so convert them accordingly.
1282 switch (insn->type) {
1284 insn->type = INSN_CALL_DYNAMIC;
1286 case INSN_JUMP_UNCONDITIONAL:
1287 insn->type = INSN_JUMP_DYNAMIC;
1289 case INSN_JUMP_CONDITIONAL:
1290 insn->type = INSN_JUMP_DYNAMIC_CONDITIONAL;
1296 insn->retpoline_safe = true;
1299 * Whatever stack impact regular CALLs have, should be undone
1300 * by the RETURN of the called function.
1302 * Annotated intra-function calls retain the stack_ops but
1303 * are converted to JUMP, see read_intra_function_calls().
1305 remove_insn_ops(insn);
1307 annotate_call_site(file, insn, false);
1310 static void add_return_call(struct objtool_file *file, struct instruction *insn, bool add)
1313 * Return thunk tail calls are really just returns in disguise,
1314 * so convert them accordingly.
1316 insn->type = INSN_RETURN;
1317 insn->retpoline_safe = true;
1320 list_add_tail(&insn->call_node, &file->return_thunk_list);
1323 static bool same_function(struct instruction *insn1, struct instruction *insn2)
1325 return insn1->func->pfunc == insn2->func->pfunc;
1328 static bool is_first_func_insn(struct objtool_file *file, struct instruction *insn)
1330 if (insn->offset == insn->func->offset)
1334 struct instruction *prev = prev_insn_same_sym(file, insn);
1336 if (prev && prev->type == INSN_ENDBR &&
1337 insn->offset == insn->func->offset + prev->len)
1345 * Find the destination instructions for all jumps.
1347 static int add_jump_destinations(struct objtool_file *file)
1349 struct instruction *insn, *jump_dest;
1350 struct reloc *reloc;
1351 struct section *dest_sec;
1352 unsigned long dest_off;
1354 for_each_insn(file, insn) {
1355 if (insn->jump_dest) {
1357 * handle_group_alt() may have previously set
1358 * 'jump_dest' for some alternatives.
1362 if (!is_static_jump(insn))
1365 reloc = insn_reloc(file, insn);
1367 dest_sec = insn->sec;
1368 dest_off = arch_jump_destination(insn);
1369 } else if (reloc->sym->type == STT_SECTION) {
1370 dest_sec = reloc->sym->sec;
1371 dest_off = arch_dest_reloc_offset(reloc->addend);
1372 } else if (reloc->sym->retpoline_thunk) {
1373 add_retpoline_call(file, insn);
1375 } else if (reloc->sym->return_thunk) {
1376 add_return_call(file, insn, true);
1378 } else if (insn->func) {
1380 * External sibling call or internal sibling call with
1383 add_call_dest(file, insn, reloc->sym, true);
1385 } else if (reloc->sym->sec->idx) {
1386 dest_sec = reloc->sym->sec;
1387 dest_off = reloc->sym->sym.st_value +
1388 arch_dest_reloc_offset(reloc->addend);
1390 /* non-func asm code jumping to another file */
1394 jump_dest = find_insn(file, dest_sec, dest_off);
1396 struct symbol *sym = find_symbol_by_offset(dest_sec, dest_off);
1399 * This is a special case for zen_untrain_ret().
1400 * It jumps to __x86_return_thunk(), but objtool
1401 * can't find the thunk's starting RET
1402 * instruction, because the RET is also in the
1403 * middle of another instruction. Objtool only
1404 * knows about the outer instruction.
1406 if (sym && sym->return_thunk) {
1407 add_return_call(file, insn, false);
1411 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
1412 insn->sec, insn->offset, dest_sec->name,
1418 * Cross-function jump.
1420 if (insn->func && jump_dest->func &&
1421 insn->func != jump_dest->func) {
1424 * For GCC 8+, create parent/child links for any cold
1425 * subfunctions. This is _mostly_ redundant with a
1426 * similar initialization in read_symbols().
1428 * If a function has aliases, we want the *first* such
1429 * function in the symbol table to be the subfunction's
1430 * parent. In that case we overwrite the
1431 * initialization done in read_symbols().
1433 * However this code can't completely replace the
1434 * read_symbols() code because this doesn't detect the
1435 * case where the parent function's only reference to a
1436 * subfunction is through a jump table.
1438 if (!strstr(insn->func->name, ".cold") &&
1439 strstr(jump_dest->func->name, ".cold")) {
1440 insn->func->cfunc = jump_dest->func;
1441 jump_dest->func->pfunc = insn->func;
1443 } else if (!same_function(insn, jump_dest) &&
1444 is_first_func_insn(file, jump_dest)) {
1446 * Internal sibling call without reloc or with
1447 * STT_SECTION reloc.
1449 add_call_dest(file, insn, jump_dest->func, true);
1454 insn->jump_dest = jump_dest;
1460 static struct symbol *find_call_destination(struct section *sec, unsigned long offset)
1462 struct symbol *call_dest;
1464 call_dest = find_func_by_offset(sec, offset);
1466 call_dest = find_symbol_by_offset(sec, offset);
1472 * Find the destination instructions for all calls.
1474 static int add_call_destinations(struct objtool_file *file)
1476 struct instruction *insn;
1477 unsigned long dest_off;
1478 struct symbol *dest;
1479 struct reloc *reloc;
1481 for_each_insn(file, insn) {
1482 if (insn->type != INSN_CALL)
1485 reloc = insn_reloc(file, insn);
1487 dest_off = arch_jump_destination(insn);
1488 dest = find_call_destination(insn->sec, dest_off);
1490 add_call_dest(file, insn, dest, false);
1495 if (!insn->call_dest) {
1496 WARN_FUNC("unannotated intra-function call", insn->sec, insn->offset);
1500 if (insn->func && insn->call_dest->type != STT_FUNC) {
1501 WARN_FUNC("unsupported call to non-function",
1502 insn->sec, insn->offset);
1506 } else if (reloc->sym->type == STT_SECTION) {
1507 dest_off = arch_dest_reloc_offset(reloc->addend);
1508 dest = find_call_destination(reloc->sym->sec, dest_off);
1510 WARN_FUNC("can't find call dest symbol at %s+0x%lx",
1511 insn->sec, insn->offset,
1512 reloc->sym->sec->name,
1517 add_call_dest(file, insn, dest, false);
1519 } else if (reloc->sym->retpoline_thunk) {
1520 add_retpoline_call(file, insn);
1523 add_call_dest(file, insn, reloc->sym, false);
1530 * The .alternatives section requires some extra special care over and above
1531 * other special sections because alternatives are patched in place.
1533 static int handle_group_alt(struct objtool_file *file,
1534 struct special_alt *special_alt,
1535 struct instruction *orig_insn,
1536 struct instruction **new_insn)
1538 struct instruction *last_orig_insn, *last_new_insn = NULL, *insn, *nop = NULL;
1539 struct alt_group *orig_alt_group, *new_alt_group;
1540 unsigned long dest_off;
1543 orig_alt_group = malloc(sizeof(*orig_alt_group));
1544 if (!orig_alt_group) {
1545 WARN("malloc failed");
1548 orig_alt_group->cfi = calloc(special_alt->orig_len,
1549 sizeof(struct cfi_state *));
1550 if (!orig_alt_group->cfi) {
1551 WARN("calloc failed");
1555 last_orig_insn = NULL;
1557 sec_for_each_insn_from(file, insn) {
1558 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
1561 insn->alt_group = orig_alt_group;
1562 last_orig_insn = insn;
1564 orig_alt_group->orig_group = NULL;
1565 orig_alt_group->first_insn = orig_insn;
1566 orig_alt_group->last_insn = last_orig_insn;
1569 new_alt_group = malloc(sizeof(*new_alt_group));
1570 if (!new_alt_group) {
1571 WARN("malloc failed");
1575 if (special_alt->new_len < special_alt->orig_len) {
1577 * Insert a fake nop at the end to make the replacement
1578 * alt_group the same size as the original. This is needed to
1579 * allow propagate_alt_cfi() to do its magic. When the last
1580 * instruction affects the stack, the instruction after it (the
1581 * nop) will propagate the new state to the shared CFI array.
1583 nop = malloc(sizeof(*nop));
1585 WARN("malloc failed");
1588 memset(nop, 0, sizeof(*nop));
1589 INIT_LIST_HEAD(&nop->alts);
1590 INIT_LIST_HEAD(&nop->stack_ops);
1592 nop->sec = special_alt->new_sec;
1593 nop->offset = special_alt->new_off + special_alt->new_len;
1594 nop->len = special_alt->orig_len - special_alt->new_len;
1595 nop->type = INSN_NOP;
1596 nop->func = orig_insn->func;
1597 nop->alt_group = new_alt_group;
1598 nop->ignore = orig_insn->ignore_alts;
1601 if (!special_alt->new_len) {
1607 sec_for_each_insn_from(file, insn) {
1608 struct reloc *alt_reloc;
1610 if (insn->offset >= special_alt->new_off + special_alt->new_len)
1613 last_new_insn = insn;
1615 insn->ignore = orig_insn->ignore_alts;
1616 insn->func = orig_insn->func;
1617 insn->alt_group = new_alt_group;
1620 * Since alternative replacement code is copy/pasted by the
1621 * kernel after applying relocations, generally such code can't
1622 * have relative-address relocation references to outside the
1623 * .altinstr_replacement section, unless the arch's
1624 * alternatives code can adjust the relative offsets
1627 alt_reloc = insn_reloc(file, insn);
1629 !arch_support_alt_relocation(special_alt, insn, alt_reloc)) {
1631 WARN_FUNC("unsupported relocation in alternatives section",
1632 insn->sec, insn->offset);
1636 if (!is_static_jump(insn))
1639 if (!insn->immediate)
1642 dest_off = arch_jump_destination(insn);
1643 if (dest_off == special_alt->new_off + special_alt->new_len) {
1644 insn->jump_dest = next_insn_same_sec(file, last_orig_insn);
1645 if (!insn->jump_dest) {
1646 WARN_FUNC("can't find alternative jump destination",
1647 insn->sec, insn->offset);
1653 if (!last_new_insn) {
1654 WARN_FUNC("can't find last new alternative instruction",
1655 special_alt->new_sec, special_alt->new_off);
1660 list_add(&nop->list, &last_new_insn->list);
1662 new_alt_group->orig_group = orig_alt_group;
1663 new_alt_group->first_insn = *new_insn;
1664 new_alt_group->last_insn = nop ? : last_new_insn;
1665 new_alt_group->cfi = orig_alt_group->cfi;
1670 * A jump table entry can either convert a nop to a jump or a jump to a nop.
1671 * If the original instruction is a jump, make the alt entry an effective nop
1672 * by just skipping the original instruction.
1674 static int handle_jump_alt(struct objtool_file *file,
1675 struct special_alt *special_alt,
1676 struct instruction *orig_insn,
1677 struct instruction **new_insn)
1679 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL &&
1680 orig_insn->type != INSN_NOP) {
1682 WARN_FUNC("unsupported instruction at jump label",
1683 orig_insn->sec, orig_insn->offset);
1687 if (opts.hack_jump_label && special_alt->key_addend & 2) {
1688 struct reloc *reloc = insn_reloc(file, orig_insn);
1691 reloc->type = R_NONE;
1692 elf_write_reloc(file->elf, reloc);
1694 elf_write_insn(file->elf, orig_insn->sec,
1695 orig_insn->offset, orig_insn->len,
1696 arch_nop_insn(orig_insn->len));
1697 orig_insn->type = INSN_NOP;
1700 if (orig_insn->type == INSN_NOP) {
1701 if (orig_insn->len == 2)
1702 file->jl_nop_short++;
1704 file->jl_nop_long++;
1709 if (orig_insn->len == 2)
1714 *new_insn = list_next_entry(orig_insn, list);
1719 * Read all the special sections which have alternate instructions which can be
1720 * patched in or redirected to at runtime. Each instruction having alternate
1721 * instruction(s) has them added to its insn->alts list, which will be
1722 * traversed in validate_branch().
1724 static int add_special_section_alts(struct objtool_file *file)
1726 struct list_head special_alts;
1727 struct instruction *orig_insn, *new_insn;
1728 struct special_alt *special_alt, *tmp;
1729 struct alternative *alt;
1732 ret = special_get_alts(file->elf, &special_alts);
1736 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
1738 orig_insn = find_insn(file, special_alt->orig_sec,
1739 special_alt->orig_off);
1741 WARN_FUNC("special: can't find orig instruction",
1742 special_alt->orig_sec, special_alt->orig_off);
1748 if (!special_alt->group || special_alt->new_len) {
1749 new_insn = find_insn(file, special_alt->new_sec,
1750 special_alt->new_off);
1752 WARN_FUNC("special: can't find new instruction",
1753 special_alt->new_sec,
1754 special_alt->new_off);
1760 if (special_alt->group) {
1761 if (!special_alt->orig_len) {
1762 WARN_FUNC("empty alternative entry",
1763 orig_insn->sec, orig_insn->offset);
1767 ret = handle_group_alt(file, special_alt, orig_insn,
1771 } else if (special_alt->jump_or_nop) {
1772 ret = handle_jump_alt(file, special_alt, orig_insn,
1778 alt = malloc(sizeof(*alt));
1780 WARN("malloc failed");
1785 alt->insn = new_insn;
1786 alt->skip_orig = special_alt->skip_orig;
1787 orig_insn->ignore_alts |= special_alt->skip_alt;
1788 list_add_tail(&alt->list, &orig_insn->alts);
1790 list_del(&special_alt->list);
1795 printf("jl\\\tNOP\tJMP\n");
1796 printf("short:\t%ld\t%ld\n", file->jl_nop_short, file->jl_short);
1797 printf("long:\t%ld\t%ld\n", file->jl_nop_long, file->jl_long);
1804 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
1805 struct reloc *table)
1807 struct reloc *reloc = table;
1808 struct instruction *dest_insn;
1809 struct alternative *alt;
1810 struct symbol *pfunc = insn->func->pfunc;
1811 unsigned int prev_offset = 0;
1814 * Each @reloc is a switch table relocation which points to the target
1817 list_for_each_entry_from(reloc, &table->sec->reloc_list, list) {
1819 /* Check for the end of the table: */
1820 if (reloc != table && reloc->jump_table_start)
1823 /* Make sure the table entries are consecutive: */
1824 if (prev_offset && reloc->offset != prev_offset + 8)
1827 /* Detect function pointers from contiguous objects: */
1828 if (reloc->sym->sec == pfunc->sec &&
1829 reloc->addend == pfunc->offset)
1832 dest_insn = find_insn(file, reloc->sym->sec, reloc->addend);
1836 /* Make sure the destination is in the same function: */
1837 if (!dest_insn->func || dest_insn->func->pfunc != pfunc)
1840 alt = malloc(sizeof(*alt));
1842 WARN("malloc failed");
1846 alt->insn = dest_insn;
1847 list_add_tail(&alt->list, &insn->alts);
1848 prev_offset = reloc->offset;
1852 WARN_FUNC("can't find switch jump table",
1853 insn->sec, insn->offset);
1861 * find_jump_table() - Given a dynamic jump, find the switch jump table
1862 * associated with it.
1864 static struct reloc *find_jump_table(struct objtool_file *file,
1865 struct symbol *func,
1866 struct instruction *insn)
1868 struct reloc *table_reloc;
1869 struct instruction *dest_insn, *orig_insn = insn;
1872 * Backward search using the @first_jump_src links, these help avoid
1873 * much of the 'in between' code. Which avoids us getting confused by
1877 insn && insn->func && insn->func->pfunc == func;
1878 insn = insn->first_jump_src ?: prev_insn_same_sym(file, insn)) {
1880 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1883 /* allow small jumps within the range */
1884 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1886 (insn->jump_dest->offset <= insn->offset ||
1887 insn->jump_dest->offset > orig_insn->offset))
1890 table_reloc = arch_find_switch_table(file, insn);
1893 dest_insn = find_insn(file, table_reloc->sym->sec, table_reloc->addend);
1894 if (!dest_insn || !dest_insn->func || dest_insn->func->pfunc != func)
1904 * First pass: Mark the head of each jump table so that in the next pass,
1905 * we know when a given jump table ends and the next one starts.
1907 static void mark_func_jump_tables(struct objtool_file *file,
1908 struct symbol *func)
1910 struct instruction *insn, *last = NULL;
1911 struct reloc *reloc;
1913 func_for_each_insn(file, func, insn) {
1918 * Store back-pointers for unconditional forward jumps such
1919 * that find_jump_table() can back-track using those and
1920 * avoid some potentially confusing code.
1922 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1923 insn->offset > last->offset &&
1924 insn->jump_dest->offset > insn->offset &&
1925 !insn->jump_dest->first_jump_src) {
1927 insn->jump_dest->first_jump_src = insn;
1928 last = insn->jump_dest;
1931 if (insn->type != INSN_JUMP_DYNAMIC)
1934 reloc = find_jump_table(file, func, insn);
1936 reloc->jump_table_start = true;
1937 insn->jump_table = reloc;
1942 static int add_func_jump_tables(struct objtool_file *file,
1943 struct symbol *func)
1945 struct instruction *insn;
1948 func_for_each_insn(file, func, insn) {
1949 if (!insn->jump_table)
1952 ret = add_jump_table(file, insn, insn->jump_table);
1961 * For some switch statements, gcc generates a jump table in the .rodata
1962 * section which contains a list of addresses within the function to jump to.
1963 * This finds these jump tables and adds them to the insn->alts lists.
1965 static int add_jump_table_alts(struct objtool_file *file)
1967 struct section *sec;
1968 struct symbol *func;
1974 for_each_sec(file, sec) {
1975 list_for_each_entry(func, &sec->symbol_list, list) {
1976 if (func->type != STT_FUNC)
1979 mark_func_jump_tables(file, func);
1980 ret = add_func_jump_tables(file, func);
1989 static void set_func_state(struct cfi_state *state)
1991 state->cfa = initial_func_cfi.cfa;
1992 memcpy(&state->regs, &initial_func_cfi.regs,
1993 CFI_NUM_REGS * sizeof(struct cfi_reg));
1994 state->stack_size = initial_func_cfi.cfa.offset;
1997 static int read_unwind_hints(struct objtool_file *file)
1999 struct cfi_state cfi = init_cfi;
2000 struct section *sec, *relocsec;
2001 struct unwind_hint *hint;
2002 struct instruction *insn;
2003 struct reloc *reloc;
2006 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
2010 relocsec = sec->reloc;
2012 WARN("missing .rela.discard.unwind_hints section");
2016 if (sec->sh.sh_size % sizeof(struct unwind_hint)) {
2017 WARN("struct unwind_hint size mismatch");
2023 for (i = 0; i < sec->sh.sh_size / sizeof(struct unwind_hint); i++) {
2024 hint = (struct unwind_hint *)sec->data->d_buf + i;
2026 reloc = find_reloc_by_dest(file->elf, sec, i * sizeof(*hint));
2028 WARN("can't find reloc for unwind_hints[%d]", i);
2032 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2034 WARN("can't find insn for unwind_hints[%d]", i);
2040 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
2046 if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
2047 insn->restore = true;
2051 if (hint->type == UNWIND_HINT_TYPE_REGS_PARTIAL) {
2052 struct symbol *sym = find_symbol_by_offset(insn->sec, insn->offset);
2054 if (sym && sym->bind == STB_GLOBAL) {
2055 if (opts.ibt && insn->type != INSN_ENDBR && !insn->noendbr) {
2056 WARN_FUNC("UNWIND_HINT_IRET_REGS without ENDBR",
2057 insn->sec, insn->offset);
2064 if (hint->type == UNWIND_HINT_TYPE_ENTRY) {
2065 hint->type = UNWIND_HINT_TYPE_CALL;
2069 if (hint->type == UNWIND_HINT_TYPE_FUNC) {
2070 insn->cfi = &func_cfi;
2077 if (arch_decode_hint_reg(hint->sp_reg, &cfi.cfa.base)) {
2078 WARN_FUNC("unsupported unwind_hint sp base reg %d",
2079 insn->sec, insn->offset, hint->sp_reg);
2083 cfi.cfa.offset = bswap_if_needed(hint->sp_offset);
2084 cfi.type = hint->type;
2085 cfi.end = hint->end;
2087 insn->cfi = cfi_hash_find_or_add(&cfi);
2093 static int read_noendbr_hints(struct objtool_file *file)
2095 struct section *sec;
2096 struct instruction *insn;
2097 struct reloc *reloc;
2099 sec = find_section_by_name(file->elf, ".rela.discard.noendbr");
2103 list_for_each_entry(reloc, &sec->reloc_list, list) {
2104 insn = find_insn(file, reloc->sym->sec, reloc->sym->offset + reloc->addend);
2106 WARN("bad .discard.noendbr entry");
2110 if (insn->type == INSN_ENDBR)
2111 WARN_FUNC("ANNOTATE_NOENDBR on ENDBR", insn->sec, insn->offset);
2119 static int read_retpoline_hints(struct objtool_file *file)
2121 struct section *sec;
2122 struct instruction *insn;
2123 struct reloc *reloc;
2125 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
2129 list_for_each_entry(reloc, &sec->reloc_list, list) {
2130 if (reloc->sym->type != STT_SECTION) {
2131 WARN("unexpected relocation symbol type in %s", sec->name);
2135 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2137 WARN("bad .discard.retpoline_safe entry");
2141 if (insn->type != INSN_JUMP_DYNAMIC &&
2142 insn->type != INSN_CALL_DYNAMIC &&
2143 insn->type != INSN_RETURN &&
2144 insn->type != INSN_NOP) {
2145 WARN_FUNC("retpoline_safe hint not an indirect jump/call/ret/nop",
2146 insn->sec, insn->offset);
2150 insn->retpoline_safe = true;
2156 static int read_instr_hints(struct objtool_file *file)
2158 struct section *sec;
2159 struct instruction *insn;
2160 struct reloc *reloc;
2162 sec = find_section_by_name(file->elf, ".rela.discard.instr_end");
2166 list_for_each_entry(reloc, &sec->reloc_list, list) {
2167 if (reloc->sym->type != STT_SECTION) {
2168 WARN("unexpected relocation symbol type in %s", sec->name);
2172 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2174 WARN("bad .discard.instr_end entry");
2181 sec = find_section_by_name(file->elf, ".rela.discard.instr_begin");
2185 list_for_each_entry(reloc, &sec->reloc_list, list) {
2186 if (reloc->sym->type != STT_SECTION) {
2187 WARN("unexpected relocation symbol type in %s", sec->name);
2191 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2193 WARN("bad .discard.instr_begin entry");
2203 static int read_intra_function_calls(struct objtool_file *file)
2205 struct instruction *insn;
2206 struct section *sec;
2207 struct reloc *reloc;
2209 sec = find_section_by_name(file->elf, ".rela.discard.intra_function_calls");
2213 list_for_each_entry(reloc, &sec->reloc_list, list) {
2214 unsigned long dest_off;
2216 if (reloc->sym->type != STT_SECTION) {
2217 WARN("unexpected relocation symbol type in %s",
2222 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2224 WARN("bad .discard.intra_function_call entry");
2228 if (insn->type != INSN_CALL) {
2229 WARN_FUNC("intra_function_call not a direct call",
2230 insn->sec, insn->offset);
2235 * Treat intra-function CALLs as JMPs, but with a stack_op.
2236 * See add_call_destinations(), which strips stack_ops from
2239 insn->type = INSN_JUMP_UNCONDITIONAL;
2241 dest_off = insn->offset + insn->len + insn->immediate;
2242 insn->jump_dest = find_insn(file, insn->sec, dest_off);
2243 if (!insn->jump_dest) {
2244 WARN_FUNC("can't find call dest at %s+0x%lx",
2245 insn->sec, insn->offset,
2246 insn->sec->name, dest_off);
2255 * Return true if name matches an instrumentation function, where calls to that
2256 * function from noinstr code can safely be removed, but compilers won't do so.
2258 static bool is_profiling_func(const char *name)
2261 * Many compilers cannot disable KCOV with a function attribute.
2263 if (!strncmp(name, "__sanitizer_cov_", 16))
2267 * Some compilers currently do not remove __tsan_func_entry/exit nor
2268 * __tsan_atomic_signal_fence (used for barrier instrumentation) with
2269 * the __no_sanitize_thread attribute, remove them. Once the kernel's
2270 * minimum Clang version is 14.0, this can be removed.
2272 if (!strncmp(name, "__tsan_func_", 12) ||
2273 !strcmp(name, "__tsan_atomic_signal_fence"))
2279 static int classify_symbols(struct objtool_file *file)
2281 struct section *sec;
2282 struct symbol *func;
2284 for_each_sec(file, sec) {
2285 list_for_each_entry(func, &sec->symbol_list, list) {
2286 if (func->bind != STB_GLOBAL)
2289 if (!strncmp(func->name, STATIC_CALL_TRAMP_PREFIX_STR,
2290 strlen(STATIC_CALL_TRAMP_PREFIX_STR)))
2291 func->static_call_tramp = true;
2293 if (arch_is_retpoline(func))
2294 func->retpoline_thunk = true;
2296 if (arch_is_rethunk(func))
2297 func->return_thunk = true;
2299 if (!strcmp(func->name, "__fentry__"))
2300 func->fentry = true;
2302 if (is_profiling_func(func->name))
2303 func->profiling_func = true;
2310 static void mark_rodata(struct objtool_file *file)
2312 struct section *sec;
2316 * Search for the following rodata sections, each of which can
2317 * potentially contain jump tables:
2319 * - .rodata: can contain GCC switch tables
2320 * - .rodata.<func>: same, if -fdata-sections is being used
2321 * - .rodata..c_jump_table: contains C annotated jump tables
2323 * .rodata.str1.* sections are ignored; they don't contain jump tables.
2325 for_each_sec(file, sec) {
2326 if (!strncmp(sec->name, ".rodata", 7) &&
2327 !strstr(sec->name, ".str1.")) {
2333 file->rodata = found;
2336 static int decode_sections(struct objtool_file *file)
2342 ret = init_pv_ops(file);
2346 ret = decode_instructions(file);
2351 add_uaccess_safe(file);
2353 ret = add_ignore_alternatives(file);
2358 * Must be before read_unwind_hints() since that needs insn->noendbr.
2360 ret = read_noendbr_hints(file);
2365 * Must be before add_{jump_call}_destination.
2367 ret = classify_symbols(file);
2372 * Must be before add_jump_destinations(), which depends on 'func'
2373 * being set for alternatives, to enable proper sibling call detection.
2375 ret = add_special_section_alts(file);
2379 ret = add_jump_destinations(file);
2384 * Must be before add_call_destination(); it changes INSN_CALL to
2387 ret = read_intra_function_calls(file);
2391 ret = add_call_destinations(file);
2396 * Must be after add_call_destinations() such that it can override
2397 * dead_end_function() marks.
2399 ret = add_dead_ends(file);
2403 ret = add_jump_table_alts(file);
2407 ret = read_unwind_hints(file);
2411 ret = read_retpoline_hints(file);
2415 ret = read_instr_hints(file);
2422 static bool is_fentry_call(struct instruction *insn)
2424 if (insn->type == INSN_CALL &&
2426 insn->call_dest->fentry)
2432 static bool has_modified_stack_frame(struct instruction *insn, struct insn_state *state)
2434 struct cfi_state *cfi = &state->cfi;
2437 if (cfi->cfa.base != initial_func_cfi.cfa.base || cfi->drap)
2440 if (cfi->cfa.offset != initial_func_cfi.cfa.offset)
2443 if (cfi->stack_size != initial_func_cfi.cfa.offset)
2446 for (i = 0; i < CFI_NUM_REGS; i++) {
2447 if (cfi->regs[i].base != initial_func_cfi.regs[i].base ||
2448 cfi->regs[i].offset != initial_func_cfi.regs[i].offset)
2455 static bool check_reg_frame_pos(const struct cfi_reg *reg,
2456 int expected_offset)
2458 return reg->base == CFI_CFA &&
2459 reg->offset == expected_offset;
2462 static bool has_valid_stack_frame(struct insn_state *state)
2464 struct cfi_state *cfi = &state->cfi;
2466 if (cfi->cfa.base == CFI_BP &&
2467 check_reg_frame_pos(&cfi->regs[CFI_BP], -cfi->cfa.offset) &&
2468 check_reg_frame_pos(&cfi->regs[CFI_RA], -cfi->cfa.offset + 8))
2471 if (cfi->drap && cfi->regs[CFI_BP].base == CFI_BP)
2477 static int update_cfi_state_regs(struct instruction *insn,
2478 struct cfi_state *cfi,
2479 struct stack_op *op)
2481 struct cfi_reg *cfa = &cfi->cfa;
2483 if (cfa->base != CFI_SP && cfa->base != CFI_SP_INDIRECT)
2487 if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
2491 if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
2494 /* add immediate to sp */
2495 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
2496 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
2497 cfa->offset -= op->src.offset;
2502 static void save_reg(struct cfi_state *cfi, unsigned char reg, int base, int offset)
2504 if (arch_callee_saved_reg(reg) &&
2505 cfi->regs[reg].base == CFI_UNDEFINED) {
2506 cfi->regs[reg].base = base;
2507 cfi->regs[reg].offset = offset;
2511 static void restore_reg(struct cfi_state *cfi, unsigned char reg)
2513 cfi->regs[reg].base = initial_func_cfi.regs[reg].base;
2514 cfi->regs[reg].offset = initial_func_cfi.regs[reg].offset;
2518 * A note about DRAP stack alignment:
2520 * GCC has the concept of a DRAP register, which is used to help keep track of
2521 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
2522 * register. The typical DRAP pattern is:
2524 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
2525 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
2526 * 41 ff 72 f8 pushq -0x8(%r10)
2528 * 48 89 e5 mov %rsp,%rbp
2535 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2538 * There are some variations in the epilogues, like:
2546 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2551 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
2552 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
2553 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
2554 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
2556 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2559 * Sometimes r13 is used as the DRAP register, in which case it's saved and
2560 * restored beforehand:
2563 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
2564 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
2566 * 49 8d 65 f0 lea -0x10(%r13),%rsp
2570 static int update_cfi_state(struct instruction *insn,
2571 struct instruction *next_insn,
2572 struct cfi_state *cfi, struct stack_op *op)
2574 struct cfi_reg *cfa = &cfi->cfa;
2575 struct cfi_reg *regs = cfi->regs;
2577 /* stack operations don't make sense with an undefined CFA */
2578 if (cfa->base == CFI_UNDEFINED) {
2580 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
2586 if (cfi->type == UNWIND_HINT_TYPE_REGS ||
2587 cfi->type == UNWIND_HINT_TYPE_REGS_PARTIAL)
2588 return update_cfi_state_regs(insn, cfi, op);
2590 switch (op->dest.type) {
2593 switch (op->src.type) {
2596 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
2597 cfa->base == CFI_SP &&
2598 check_reg_frame_pos(®s[CFI_BP], -cfa->offset)) {
2600 /* mov %rsp, %rbp */
2601 cfa->base = op->dest.reg;
2602 cfi->bp_scratch = false;
2605 else if (op->src.reg == CFI_SP &&
2606 op->dest.reg == CFI_BP && cfi->drap) {
2608 /* drap: mov %rsp, %rbp */
2609 regs[CFI_BP].base = CFI_BP;
2610 regs[CFI_BP].offset = -cfi->stack_size;
2611 cfi->bp_scratch = false;
2614 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2619 * This is needed for the rare case where GCC
2626 cfi->vals[op->dest.reg].base = CFI_CFA;
2627 cfi->vals[op->dest.reg].offset = -cfi->stack_size;
2630 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
2631 (cfa->base == CFI_BP || cfa->base == cfi->drap_reg)) {
2636 * Restore the original stack pointer (Clang).
2638 cfi->stack_size = -cfi->regs[CFI_BP].offset;
2641 else if (op->dest.reg == cfa->base) {
2643 /* mov %reg, %rsp */
2644 if (cfa->base == CFI_SP &&
2645 cfi->vals[op->src.reg].base == CFI_CFA) {
2648 * This is needed for the rare case
2649 * where GCC does something dumb like:
2651 * lea 0x8(%rsp), %rcx
2655 cfa->offset = -cfi->vals[op->src.reg].offset;
2656 cfi->stack_size = cfa->offset;
2658 } else if (cfa->base == CFI_SP &&
2659 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2660 cfi->vals[op->src.reg].offset == cfa->offset) {
2665 * 1: mov %rsp, (%[tos])
2666 * 2: mov %[tos], %rsp
2672 * 1 - places a pointer to the previous
2673 * stack at the Top-of-Stack of the
2676 * 2 - switches to the new stack.
2678 * 3 - pops the Top-of-Stack to restore
2679 * the original stack.
2681 * Note: we set base to SP_INDIRECT
2682 * here and preserve offset. Therefore
2683 * when the unwinder reaches ToS it
2684 * will dereference SP and then add the
2685 * offset to find the next frame, IOW:
2688 cfa->base = CFI_SP_INDIRECT;
2691 cfa->base = CFI_UNDEFINED;
2696 else if (op->dest.reg == CFI_SP &&
2697 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2698 cfi->vals[op->src.reg].offset == cfa->offset) {
2701 * The same stack swizzle case 2) as above. But
2702 * because we can't change cfa->base, case 3)
2703 * will become a regular POP. Pretend we're a
2704 * PUSH so things don't go unbalanced.
2706 cfi->stack_size += 8;
2713 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
2716 cfi->stack_size -= op->src.offset;
2717 if (cfa->base == CFI_SP)
2718 cfa->offset -= op->src.offset;
2722 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
2724 /* lea disp(%rbp), %rsp */
2725 cfi->stack_size = -(op->src.offset + regs[CFI_BP].offset);
2729 if (!cfi->drap && op->src.reg == CFI_SP &&
2730 op->dest.reg == CFI_BP && cfa->base == CFI_SP &&
2731 check_reg_frame_pos(®s[CFI_BP], -cfa->offset + op->src.offset)) {
2733 /* lea disp(%rsp), %rbp */
2735 cfa->offset -= op->src.offset;
2736 cfi->bp_scratch = false;
2740 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2742 /* drap: lea disp(%rsp), %drap */
2743 cfi->drap_reg = op->dest.reg;
2746 * lea disp(%rsp), %reg
2748 * This is needed for the rare case where GCC
2749 * does something dumb like:
2751 * lea 0x8(%rsp), %rcx
2755 cfi->vals[op->dest.reg].base = CFI_CFA;
2756 cfi->vals[op->dest.reg].offset = \
2757 -cfi->stack_size + op->src.offset;
2762 if (cfi->drap && op->dest.reg == CFI_SP &&
2763 op->src.reg == cfi->drap_reg) {
2765 /* drap: lea disp(%drap), %rsp */
2767 cfa->offset = cfi->stack_size = -op->src.offset;
2768 cfi->drap_reg = CFI_UNDEFINED;
2773 if (op->dest.reg == cfi->cfa.base && !(next_insn && next_insn->hint)) {
2774 WARN_FUNC("unsupported stack register modification",
2775 insn->sec, insn->offset);
2782 if (op->dest.reg != CFI_SP ||
2783 (cfi->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
2784 (cfi->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
2785 WARN_FUNC("unsupported stack pointer realignment",
2786 insn->sec, insn->offset);
2790 if (cfi->drap_reg != CFI_UNDEFINED) {
2791 /* drap: and imm, %rsp */
2792 cfa->base = cfi->drap_reg;
2793 cfa->offset = cfi->stack_size = 0;
2798 * Older versions of GCC (4.8ish) realign the stack
2799 * without DRAP, with a frame pointer.
2806 if (op->dest.reg == CFI_SP && cfa->base == CFI_SP_INDIRECT) {
2808 /* pop %rsp; # restore from a stack swizzle */
2813 if (!cfi->drap && op->dest.reg == cfa->base) {
2819 if (cfi->drap && cfa->base == CFI_BP_INDIRECT &&
2820 op->dest.reg == cfi->drap_reg &&
2821 cfi->drap_offset == -cfi->stack_size) {
2823 /* drap: pop %drap */
2824 cfa->base = cfi->drap_reg;
2826 cfi->drap_offset = -1;
2828 } else if (cfi->stack_size == -regs[op->dest.reg].offset) {
2831 restore_reg(cfi, op->dest.reg);
2834 cfi->stack_size -= 8;
2835 if (cfa->base == CFI_SP)
2840 case OP_SRC_REG_INDIRECT:
2841 if (!cfi->drap && op->dest.reg == cfa->base &&
2842 op->dest.reg == CFI_BP) {
2844 /* mov disp(%rsp), %rbp */
2846 cfa->offset = cfi->stack_size;
2849 if (cfi->drap && op->src.reg == CFI_BP &&
2850 op->src.offset == cfi->drap_offset) {
2852 /* drap: mov disp(%rbp), %drap */
2853 cfa->base = cfi->drap_reg;
2855 cfi->drap_offset = -1;
2858 if (cfi->drap && op->src.reg == CFI_BP &&
2859 op->src.offset == regs[op->dest.reg].offset) {
2861 /* drap: mov disp(%rbp), %reg */
2862 restore_reg(cfi, op->dest.reg);
2864 } else if (op->src.reg == cfa->base &&
2865 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
2867 /* mov disp(%rbp), %reg */
2868 /* mov disp(%rsp), %reg */
2869 restore_reg(cfi, op->dest.reg);
2871 } else if (op->src.reg == CFI_SP &&
2872 op->src.offset == regs[op->dest.reg].offset + cfi->stack_size) {
2874 /* mov disp(%rsp), %reg */
2875 restore_reg(cfi, op->dest.reg);
2881 WARN_FUNC("unknown stack-related instruction",
2882 insn->sec, insn->offset);
2890 cfi->stack_size += 8;
2891 if (cfa->base == CFI_SP)
2894 if (op->src.type != OP_SRC_REG)
2898 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2900 /* drap: push %drap */
2901 cfa->base = CFI_BP_INDIRECT;
2902 cfa->offset = -cfi->stack_size;
2904 /* save drap so we know when to restore it */
2905 cfi->drap_offset = -cfi->stack_size;
2907 } else if (op->src.reg == CFI_BP && cfa->base == cfi->drap_reg) {
2909 /* drap: push %rbp */
2910 cfi->stack_size = 0;
2914 /* drap: push %reg */
2915 save_reg(cfi, op->src.reg, CFI_BP, -cfi->stack_size);
2921 save_reg(cfi, op->src.reg, CFI_CFA, -cfi->stack_size);
2924 /* detect when asm code uses rbp as a scratch register */
2925 if (opts.stackval && insn->func && op->src.reg == CFI_BP &&
2926 cfa->base != CFI_BP)
2927 cfi->bp_scratch = true;
2930 case OP_DEST_REG_INDIRECT:
2933 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2935 /* drap: mov %drap, disp(%rbp) */
2936 cfa->base = CFI_BP_INDIRECT;
2937 cfa->offset = op->dest.offset;
2939 /* save drap offset so we know when to restore it */
2940 cfi->drap_offset = op->dest.offset;
2943 /* drap: mov reg, disp(%rbp) */
2944 save_reg(cfi, op->src.reg, CFI_BP, op->dest.offset);
2947 } else if (op->dest.reg == cfa->base) {
2949 /* mov reg, disp(%rbp) */
2950 /* mov reg, disp(%rsp) */
2951 save_reg(cfi, op->src.reg, CFI_CFA,
2952 op->dest.offset - cfi->cfa.offset);
2954 } else if (op->dest.reg == CFI_SP) {
2956 /* mov reg, disp(%rsp) */
2957 save_reg(cfi, op->src.reg, CFI_CFA,
2958 op->dest.offset - cfi->stack_size);
2960 } else if (op->src.reg == CFI_SP && op->dest.offset == 0) {
2962 /* mov %rsp, (%reg); # setup a stack swizzle. */
2963 cfi->vals[op->dest.reg].base = CFI_SP_INDIRECT;
2964 cfi->vals[op->dest.reg].offset = cfa->offset;
2970 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
2971 WARN_FUNC("unknown stack-related memory operation",
2972 insn->sec, insn->offset);
2977 cfi->stack_size -= 8;
2978 if (cfa->base == CFI_SP)
2984 WARN_FUNC("unknown stack-related instruction",
2985 insn->sec, insn->offset);
2993 * The stack layouts of alternatives instructions can sometimes diverge when
2994 * they have stack modifications. That's fine as long as the potential stack
2995 * layouts don't conflict at any given potential instruction boundary.
2997 * Flatten the CFIs of the different alternative code streams (both original
2998 * and replacement) into a single shared CFI array which can be used to detect
2999 * conflicts and nicely feed a linear array of ORC entries to the unwinder.
3001 static int propagate_alt_cfi(struct objtool_file *file, struct instruction *insn)
3003 struct cfi_state **alt_cfi;
3006 if (!insn->alt_group)
3010 WARN("CFI missing");
3014 alt_cfi = insn->alt_group->cfi;
3015 group_off = insn->offset - insn->alt_group->first_insn->offset;
3017 if (!alt_cfi[group_off]) {
3018 alt_cfi[group_off] = insn->cfi;
3020 if (cficmp(alt_cfi[group_off], insn->cfi)) {
3021 WARN_FUNC("stack layout conflict in alternatives",
3022 insn->sec, insn->offset);
3030 static int handle_insn_ops(struct instruction *insn,
3031 struct instruction *next_insn,
3032 struct insn_state *state)
3034 struct stack_op *op;
3036 list_for_each_entry(op, &insn->stack_ops, list) {
3038 if (update_cfi_state(insn, next_insn, &state->cfi, op))
3041 if (!insn->alt_group)
3044 if (op->dest.type == OP_DEST_PUSHF) {
3045 if (!state->uaccess_stack) {
3046 state->uaccess_stack = 1;
3047 } else if (state->uaccess_stack >> 31) {
3048 WARN_FUNC("PUSHF stack exhausted",
3049 insn->sec, insn->offset);
3052 state->uaccess_stack <<= 1;
3053 state->uaccess_stack |= state->uaccess;
3056 if (op->src.type == OP_SRC_POPF) {
3057 if (state->uaccess_stack) {
3058 state->uaccess = state->uaccess_stack & 1;
3059 state->uaccess_stack >>= 1;
3060 if (state->uaccess_stack == 1)
3061 state->uaccess_stack = 0;
3069 static bool insn_cfi_match(struct instruction *insn, struct cfi_state *cfi2)
3071 struct cfi_state *cfi1 = insn->cfi;
3075 WARN("CFI missing");
3079 if (memcmp(&cfi1->cfa, &cfi2->cfa, sizeof(cfi1->cfa))) {
3081 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
3082 insn->sec, insn->offset,
3083 cfi1->cfa.base, cfi1->cfa.offset,
3084 cfi2->cfa.base, cfi2->cfa.offset);
3086 } else if (memcmp(&cfi1->regs, &cfi2->regs, sizeof(cfi1->regs))) {
3087 for (i = 0; i < CFI_NUM_REGS; i++) {
3088 if (!memcmp(&cfi1->regs[i], &cfi2->regs[i],
3089 sizeof(struct cfi_reg)))
3092 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
3093 insn->sec, insn->offset,
3094 i, cfi1->regs[i].base, cfi1->regs[i].offset,
3095 i, cfi2->regs[i].base, cfi2->regs[i].offset);
3099 } else if (cfi1->type != cfi2->type) {
3101 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
3102 insn->sec, insn->offset, cfi1->type, cfi2->type);
3104 } else if (cfi1->drap != cfi2->drap ||
3105 (cfi1->drap && cfi1->drap_reg != cfi2->drap_reg) ||
3106 (cfi1->drap && cfi1->drap_offset != cfi2->drap_offset)) {
3108 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
3109 insn->sec, insn->offset,
3110 cfi1->drap, cfi1->drap_reg, cfi1->drap_offset,
3111 cfi2->drap, cfi2->drap_reg, cfi2->drap_offset);
3119 static inline bool func_uaccess_safe(struct symbol *func)
3122 return func->uaccess_safe;
3127 static inline const char *call_dest_name(struct instruction *insn)
3129 static char pvname[19];
3133 if (insn->call_dest)
3134 return insn->call_dest->name;
3136 rel = insn_reloc(NULL, insn);
3137 if (rel && !strcmp(rel->sym->name, "pv_ops")) {
3138 idx = (rel->addend / sizeof(void *));
3139 snprintf(pvname, sizeof(pvname), "pv_ops[%d]", idx);
3146 static bool pv_call_dest(struct objtool_file *file, struct instruction *insn)
3148 struct symbol *target;
3152 rel = insn_reloc(file, insn);
3153 if (!rel || strcmp(rel->sym->name, "pv_ops"))
3156 idx = (arch_dest_reloc_offset(rel->addend) / sizeof(void *));
3158 if (file->pv_ops[idx].clean)
3161 file->pv_ops[idx].clean = true;
3163 list_for_each_entry(target, &file->pv_ops[idx].targets, pv_target) {
3164 if (!target->sec->noinstr) {
3165 WARN("pv_ops[%d]: %s", idx, target->name);
3166 file->pv_ops[idx].clean = false;
3170 return file->pv_ops[idx].clean;
3173 static inline bool noinstr_call_dest(struct objtool_file *file,
3174 struct instruction *insn,
3175 struct symbol *func)
3178 * We can't deal with indirect function calls at present;
3179 * assume they're instrumented.
3183 return pv_call_dest(file, insn);
3189 * If the symbol is from a noinstr section; we good.
3191 if (func->sec->noinstr)
3195 * The __ubsan_handle_*() calls are like WARN(), they only happen when
3196 * something 'BAD' happened. At the risk of taking the machine down,
3197 * let them proceed to get the message out.
3199 if (!strncmp(func->name, "__ubsan_handle_", 15))
3205 static int validate_call(struct objtool_file *file,
3206 struct instruction *insn,
3207 struct insn_state *state)
3209 if (state->noinstr && state->instr <= 0 &&
3210 !noinstr_call_dest(file, insn, insn->call_dest)) {
3211 WARN_FUNC("call to %s() leaves .noinstr.text section",
3212 insn->sec, insn->offset, call_dest_name(insn));
3216 if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
3217 WARN_FUNC("call to %s() with UACCESS enabled",
3218 insn->sec, insn->offset, call_dest_name(insn));
3223 WARN_FUNC("call to %s() with DF set",
3224 insn->sec, insn->offset, call_dest_name(insn));
3231 static int validate_sibling_call(struct objtool_file *file,
3232 struct instruction *insn,
3233 struct insn_state *state)
3235 if (has_modified_stack_frame(insn, state)) {
3236 WARN_FUNC("sibling call from callable instruction with modified stack frame",
3237 insn->sec, insn->offset);
3241 return validate_call(file, insn, state);
3244 static int validate_return(struct symbol *func, struct instruction *insn, struct insn_state *state)
3246 if (state->noinstr && state->instr > 0) {
3247 WARN_FUNC("return with instrumentation enabled",
3248 insn->sec, insn->offset);
3252 if (state->uaccess && !func_uaccess_safe(func)) {
3253 WARN_FUNC("return with UACCESS enabled",
3254 insn->sec, insn->offset);
3258 if (!state->uaccess && func_uaccess_safe(func)) {
3259 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function",
3260 insn->sec, insn->offset);
3265 WARN_FUNC("return with DF set",
3266 insn->sec, insn->offset);
3270 if (func && has_modified_stack_frame(insn, state)) {
3271 WARN_FUNC("return with modified stack frame",
3272 insn->sec, insn->offset);
3276 if (state->cfi.bp_scratch) {
3277 WARN_FUNC("BP used as a scratch register",
3278 insn->sec, insn->offset);
3285 static struct instruction *next_insn_to_validate(struct objtool_file *file,
3286 struct instruction *insn)
3288 struct alt_group *alt_group = insn->alt_group;
3291 * Simulate the fact that alternatives are patched in-place. When the
3292 * end of a replacement alt_group is reached, redirect objtool flow to
3293 * the end of the original alt_group.
3295 if (alt_group && insn == alt_group->last_insn && alt_group->orig_group)
3296 return next_insn_same_sec(file, alt_group->orig_group->last_insn);
3298 return next_insn_same_sec(file, insn);
3302 * Follow the branch starting at the given instruction, and recursively follow
3303 * any other branches (jumps). Meanwhile, track the frame pointer state at
3304 * each instruction and validate all the rules described in
3305 * tools/objtool/Documentation/objtool.txt.
3307 static int validate_branch(struct objtool_file *file, struct symbol *func,
3308 struct instruction *insn, struct insn_state state)
3310 struct alternative *alt;
3311 struct instruction *next_insn, *prev_insn = NULL;
3312 struct section *sec;
3319 next_insn = next_insn_to_validate(file, insn);
3321 if (func && insn->func && func != insn->func->pfunc) {
3322 /* Ignore KCFI type preambles, which always fall through */
3323 if (!strncmp(func->name, "__cfi_", 6))
3326 WARN("%s() falls through to next function %s()",
3327 func->name, insn->func->name);
3331 if (func && insn->ignore) {
3332 WARN_FUNC("BUG: why am I validating an ignored function?",
3337 visited = VISITED_BRANCH << state.uaccess;
3338 if (insn->visited & VISITED_BRANCH_MASK) {
3339 if (!insn->hint && !insn_cfi_match(insn, &state.cfi))
3342 if (insn->visited & visited)
3349 state.instr += insn->instr;
3352 if (insn->restore) {
3353 struct instruction *save_insn, *i;
3358 sym_for_each_insn_continue_reverse(file, func, i) {
3366 WARN_FUNC("no corresponding CFI save for CFI restore",
3371 if (!save_insn->visited) {
3372 WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
3377 insn->cfi = save_insn->cfi;
3381 state.cfi = *insn->cfi;
3383 /* XXX track if we actually changed state.cfi */
3385 if (prev_insn && !cficmp(prev_insn->cfi, &state.cfi)) {
3386 insn->cfi = prev_insn->cfi;
3389 insn->cfi = cfi_hash_find_or_add(&state.cfi);
3393 insn->visited |= visited;
3395 if (propagate_alt_cfi(file, insn))
3398 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3399 bool skip_orig = false;
3401 list_for_each_entry(alt, &insn->alts, list) {
3405 ret = validate_branch(file, func, alt->insn, state);
3408 BT_FUNC("(alt)", insn);
3417 if (handle_insn_ops(insn, next_insn, &state))
3420 switch (insn->type) {
3423 return validate_return(func, insn, &state);
3426 case INSN_CALL_DYNAMIC:
3427 ret = validate_call(file, insn, &state);
3431 if (opts.stackval && func && !is_fentry_call(insn) &&
3432 !has_valid_stack_frame(&state)) {
3433 WARN_FUNC("call without frame pointer save/setup",
3443 case INSN_JUMP_CONDITIONAL:
3444 case INSN_JUMP_UNCONDITIONAL:
3445 if (is_sibling_call(insn)) {
3446 ret = validate_sibling_call(file, insn, &state);
3450 } else if (insn->jump_dest) {
3451 ret = validate_branch(file, func,
3452 insn->jump_dest, state);
3455 BT_FUNC("(branch)", insn);
3460 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3465 case INSN_JUMP_DYNAMIC:
3466 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3467 if (is_sibling_call(insn)) {
3468 ret = validate_sibling_call(file, insn, &state);
3473 if (insn->type == INSN_JUMP_DYNAMIC)
3478 case INSN_CONTEXT_SWITCH:
3479 if (func && (!next_insn || !next_insn->hint)) {
3480 WARN_FUNC("unsupported instruction in callable function",
3487 if (state.uaccess) {
3488 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
3492 state.uaccess = true;
3496 if (!state.uaccess && func) {
3497 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
3501 if (func_uaccess_safe(func) && !state.uaccess_stack) {
3502 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
3506 state.uaccess = false;
3511 WARN_FUNC("recursive STD", sec, insn->offset);
3519 if (!state.df && func) {
3520 WARN_FUNC("redundant CLD", sec, insn->offset);
3535 if (state.cfi.cfa.base == CFI_UNDEFINED)
3537 WARN("%s: unexpected end of section", sec->name);
3548 static int validate_unwind_hints(struct objtool_file *file, struct section *sec)
3550 struct instruction *insn;
3551 struct insn_state state;
3552 int ret, warnings = 0;
3557 init_insn_state(file, &state, sec);
3560 insn = find_insn(file, sec, 0);
3564 insn = list_first_entry(&file->insn_list, typeof(*insn), list);
3567 while (&insn->list != &file->insn_list && (!sec || insn->sec == sec)) {
3568 if (insn->hint && !insn->visited && !insn->ignore) {
3569 ret = validate_branch(file, insn->func, insn, state);
3570 if (ret && opts.backtrace)
3571 BT_FUNC("<=== (hint)", insn);
3575 insn = list_next_entry(insn, list);
3582 * Validate rethunk entry constraint: must untrain RET before the first RET.
3584 * Follow every branch (intra-function) and ensure ANNOTATE_UNRET_END comes
3585 * before an actual RET instruction.
3587 static int validate_entry(struct objtool_file *file, struct instruction *insn)
3589 struct instruction *next, *dest;
3590 int ret, warnings = 0;
3593 next = next_insn_to_validate(file, insn);
3595 if (insn->visited & VISITED_ENTRY)
3598 insn->visited |= VISITED_ENTRY;
3600 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3601 struct alternative *alt;
3602 bool skip_orig = false;
3604 list_for_each_entry(alt, &insn->alts, list) {
3608 ret = validate_entry(file, alt->insn);
3611 BT_FUNC("(alt)", insn);
3620 switch (insn->type) {
3622 case INSN_CALL_DYNAMIC:
3623 case INSN_JUMP_DYNAMIC:
3624 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3625 WARN_FUNC("early indirect call", insn->sec, insn->offset);
3628 case INSN_JUMP_UNCONDITIONAL:
3629 case INSN_JUMP_CONDITIONAL:
3630 if (!is_sibling_call(insn)) {
3631 if (!insn->jump_dest) {
3632 WARN_FUNC("unresolved jump target after linking?!?",
3633 insn->sec, insn->offset);
3636 ret = validate_entry(file, insn->jump_dest);
3638 if (opts.backtrace) {
3639 BT_FUNC("(branch%s)", insn,
3640 insn->type == INSN_JUMP_CONDITIONAL ? "-cond" : "");
3645 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3653 dest = find_insn(file, insn->call_dest->sec,
3654 insn->call_dest->offset);
3656 WARN("Unresolved function after linking!?: %s",
3657 insn->call_dest->name);
3661 ret = validate_entry(file, dest);
3664 BT_FUNC("(call)", insn);
3668 * If a call returns without error, it must have seen UNTRAIN_RET.
3669 * Therefore any non-error return is a success.
3674 WARN_FUNC("RET before UNTRAIN", insn->sec, insn->offset);
3678 if (insn->retpoline_safe)
3687 WARN_FUNC("teh end!", insn->sec, insn->offset);
3697 * Validate that all branches starting at 'insn->entry' encounter UNRET_END
3700 static int validate_unret(struct objtool_file *file)
3702 struct instruction *insn;
3703 int ret, warnings = 0;
3705 for_each_insn(file, insn) {
3709 ret = validate_entry(file, insn);
3711 WARN_FUNC("Failed UNRET validation", insn->sec, insn->offset);
3720 static int validate_retpoline(struct objtool_file *file)
3722 struct instruction *insn;
3725 for_each_insn(file, insn) {
3726 if (insn->type != INSN_JUMP_DYNAMIC &&
3727 insn->type != INSN_CALL_DYNAMIC &&
3728 insn->type != INSN_RETURN)
3731 if (insn->retpoline_safe)
3735 * .init.text code is ran before userspace and thus doesn't
3736 * strictly need retpolines, except for modules which are
3737 * loaded late, they very much do need retpoline in their
3740 if (!strcmp(insn->sec->name, ".init.text") && !opts.module)
3743 if (insn->type == INSN_RETURN) {
3745 WARN_FUNC("'naked' return found in RETHUNK build",
3746 insn->sec, insn->offset);
3750 WARN_FUNC("indirect %s found in RETPOLINE build",
3751 insn->sec, insn->offset,
3752 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
3761 static bool is_kasan_insn(struct instruction *insn)
3763 return (insn->type == INSN_CALL &&
3764 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
3767 static bool is_ubsan_insn(struct instruction *insn)
3769 return (insn->type == INSN_CALL &&
3770 !strcmp(insn->call_dest->name,
3771 "__ubsan_handle_builtin_unreachable"));
3774 static bool ignore_unreachable_insn(struct objtool_file *file, struct instruction *insn)
3777 struct instruction *prev_insn;
3779 if (insn->ignore || insn->type == INSN_NOP || insn->type == INSN_TRAP)
3783 * Ignore alternative replacement instructions. This can happen
3784 * when a whitelisted function uses one of the ALTERNATIVE macros.
3786 if (!strcmp(insn->sec->name, ".altinstr_replacement") ||
3787 !strcmp(insn->sec->name, ".altinstr_aux"))
3791 * Whole archive runs might encounter dead code from weak symbols.
3792 * This is where the linker will have dropped the weak symbol in
3793 * favour of a regular symbol, but leaves the code in place.
3795 * In this case we'll find a piece of code (whole function) that is not
3796 * covered by a !section symbol. Ignore them.
3798 if (opts.link && !insn->func) {
3799 int size = find_symbol_hole_containing(insn->sec, insn->offset);
3800 unsigned long end = insn->offset + size;
3802 if (!size) /* not a hole */
3805 if (size < 0) /* hole until the end */
3808 sec_for_each_insn_continue(file, insn) {
3810 * If we reach a visited instruction at or before the
3811 * end of the hole, ignore the unreachable.
3816 if (insn->offset >= end)
3820 * If this hole jumps to a .cold function, mark it ignore too.
3822 if (insn->jump_dest && insn->jump_dest->func &&
3823 strstr(insn->jump_dest->func->name, ".cold")) {
3824 struct instruction *dest = insn->jump_dest;
3825 func_for_each_insn(file, dest->func, dest)
3826 dest->ignore = true;
3836 if (insn->func->static_call_tramp)
3840 * CONFIG_UBSAN_TRAP inserts a UD2 when it sees
3841 * __builtin_unreachable(). The BUG() macro has an unreachable() after
3842 * the UD2, which causes GCC's undefined trap logic to emit another UD2
3843 * (or occasionally a JMP to UD2).
3845 * It may also insert a UD2 after calling a __noreturn function.
3847 prev_insn = list_prev_entry(insn, list);
3848 if ((prev_insn->dead_end || dead_end_function(file, prev_insn->call_dest)) &&
3849 (insn->type == INSN_BUG ||
3850 (insn->type == INSN_JUMP_UNCONDITIONAL &&
3851 insn->jump_dest && insn->jump_dest->type == INSN_BUG)))
3855 * Check if this (or a subsequent) instruction is related to
3856 * CONFIG_UBSAN or CONFIG_KASAN.
3858 * End the search at 5 instructions to avoid going into the weeds.
3860 for (i = 0; i < 5; i++) {
3862 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
3865 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
3866 if (insn->jump_dest &&
3867 insn->jump_dest->func == insn->func) {
3868 insn = insn->jump_dest;
3875 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
3878 insn = list_next_entry(insn, list);
3884 static int validate_symbol(struct objtool_file *file, struct section *sec,
3885 struct symbol *sym, struct insn_state *state)
3887 struct instruction *insn;
3891 WARN("%s() is missing an ELF size annotation", sym->name);
3895 if (sym->pfunc != sym || sym->alias != sym)
3898 insn = find_insn(file, sec, sym->offset);
3899 if (!insn || insn->ignore || insn->visited)
3902 state->uaccess = sym->uaccess_safe;
3904 ret = validate_branch(file, insn->func, insn, *state);
3905 if (ret && opts.backtrace)
3906 BT_FUNC("<=== (sym)", insn);
3910 static int validate_section(struct objtool_file *file, struct section *sec)
3912 struct insn_state state;
3913 struct symbol *func;
3916 list_for_each_entry(func, &sec->symbol_list, list) {
3917 if (func->type != STT_FUNC)
3920 init_insn_state(file, &state, sec);
3921 set_func_state(&state.cfi);
3923 warnings += validate_symbol(file, sec, func, &state);
3929 static int validate_noinstr_sections(struct objtool_file *file)
3931 struct section *sec;
3934 sec = find_section_by_name(file->elf, ".noinstr.text");
3936 warnings += validate_section(file, sec);
3937 warnings += validate_unwind_hints(file, sec);
3940 sec = find_section_by_name(file->elf, ".entry.text");
3942 warnings += validate_section(file, sec);
3943 warnings += validate_unwind_hints(file, sec);
3949 static int validate_functions(struct objtool_file *file)
3951 struct section *sec;
3954 for_each_sec(file, sec) {
3955 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
3958 warnings += validate_section(file, sec);
3964 static void mark_endbr_used(struct instruction *insn)
3966 if (!list_empty(&insn->call_node))
3967 list_del_init(&insn->call_node);
3970 static int validate_ibt_insn(struct objtool_file *file, struct instruction *insn)
3972 struct instruction *dest;
3973 struct reloc *reloc;
3978 * Looking for function pointer load relocations. Ignore
3979 * direct/indirect branches:
3981 switch (insn->type) {
3983 case INSN_CALL_DYNAMIC:
3984 case INSN_JUMP_CONDITIONAL:
3985 case INSN_JUMP_UNCONDITIONAL:
3986 case INSN_JUMP_DYNAMIC:
3987 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3995 for (reloc = insn_reloc(file, insn);
3997 reloc = find_reloc_by_dest_range(file->elf, insn->sec,
3999 (insn->offset + insn->len) - (reloc->offset + 1))) {
4002 * static_call_update() references the trampoline, which
4003 * doesn't have (or need) ENDBR. Skip warning in that case.
4005 if (reloc->sym->static_call_tramp)
4008 off = reloc->sym->offset;
4009 if (reloc->type == R_X86_64_PC32 || reloc->type == R_X86_64_PLT32)
4010 off += arch_dest_reloc_offset(reloc->addend);
4012 off += reloc->addend;
4014 dest = find_insn(file, reloc->sym->sec, off);
4018 if (dest->type == INSN_ENDBR) {
4019 mark_endbr_used(dest);
4023 if (dest->func && dest->func == insn->func) {
4025 * Anything from->to self is either _THIS_IP_ or
4028 * There is no sane way to annotate _THIS_IP_ since the
4029 * compiler treats the relocation as a constant and is
4030 * happy to fold in offsets, skewing any annotation we
4031 * do, leading to vast amounts of false-positives.
4033 * There's also compiler generated _THIS_IP_ through
4034 * KCOV and such which we have no hope of annotating.
4036 * As such, blanket accept self-references without
4045 WARN_FUNC("relocation to !ENDBR: %s",
4046 insn->sec, insn->offset,
4047 offstr(dest->sec, dest->offset));
4055 static int validate_ibt_data_reloc(struct objtool_file *file,
4056 struct reloc *reloc)
4058 struct instruction *dest;
4060 dest = find_insn(file, reloc->sym->sec,
4061 reloc->sym->offset + reloc->addend);
4065 if (dest->type == INSN_ENDBR) {
4066 mark_endbr_used(dest);
4073 WARN_FUNC("data relocation to !ENDBR: %s",
4074 reloc->sec->base, reloc->offset,
4075 offstr(dest->sec, dest->offset));
4081 * Validate IBT rules and remove used ENDBR instructions from the seal list.
4082 * Unused ENDBR instructions will be annotated for sealing (i.e., replaced with
4083 * NOPs) later, in create_ibt_endbr_seal_sections().
4085 static int validate_ibt(struct objtool_file *file)
4087 struct section *sec;
4088 struct reloc *reloc;
4089 struct instruction *insn;
4092 for_each_insn(file, insn)
4093 warnings += validate_ibt_insn(file, insn);
4095 for_each_sec(file, sec) {
4097 /* Already done by validate_ibt_insn() */
4098 if (sec->sh.sh_flags & SHF_EXECINSTR)
4105 * These sections can reference text addresses, but not with
4106 * the intent to indirect branch to them.
4108 if ((!strncmp(sec->name, ".discard", 8) &&
4109 strcmp(sec->name, ".discard.ibt_endbr_noseal")) ||
4110 !strncmp(sec->name, ".debug", 6) ||
4111 !strcmp(sec->name, ".altinstructions") ||
4112 !strcmp(sec->name, ".ibt_endbr_seal") ||
4113 !strcmp(sec->name, ".orc_unwind_ip") ||
4114 !strcmp(sec->name, ".parainstructions") ||
4115 !strcmp(sec->name, ".retpoline_sites") ||
4116 !strcmp(sec->name, ".smp_locks") ||
4117 !strcmp(sec->name, ".static_call_sites") ||
4118 !strcmp(sec->name, "_error_injection_whitelist") ||
4119 !strcmp(sec->name, "_kprobe_blacklist") ||
4120 !strcmp(sec->name, "__bug_table") ||
4121 !strcmp(sec->name, "__ex_table") ||
4122 !strcmp(sec->name, "__jump_table") ||
4123 !strcmp(sec->name, "__mcount_loc") ||
4124 !strcmp(sec->name, ".kcfi_traps") ||
4125 strstr(sec->name, "__patchable_function_entries"))
4128 list_for_each_entry(reloc, &sec->reloc->reloc_list, list)
4129 warnings += validate_ibt_data_reloc(file, reloc);
4135 static int validate_sls(struct objtool_file *file)
4137 struct instruction *insn, *next_insn;
4140 for_each_insn(file, insn) {
4141 next_insn = next_insn_same_sec(file, insn);
4143 if (insn->retpoline_safe)
4146 switch (insn->type) {
4148 if (!next_insn || next_insn->type != INSN_TRAP) {
4149 WARN_FUNC("missing int3 after ret",
4150 insn->sec, insn->offset);
4155 case INSN_JUMP_DYNAMIC:
4156 if (!next_insn || next_insn->type != INSN_TRAP) {
4157 WARN_FUNC("missing int3 after indirect jump",
4158 insn->sec, insn->offset);
4170 static int validate_reachable_instructions(struct objtool_file *file)
4172 struct instruction *insn;
4174 if (file->ignore_unreachables)
4177 for_each_insn(file, insn) {
4178 if (insn->visited || ignore_unreachable_insn(file, insn))
4181 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
4188 int check(struct objtool_file *file)
4190 int ret, warnings = 0;
4192 arch_initial_func_cfi_state(&initial_func_cfi);
4193 init_cfi_state(&init_cfi);
4194 init_cfi_state(&func_cfi);
4195 set_func_state(&func_cfi);
4197 if (!cfi_hash_alloc(1UL << (file->elf->symbol_bits - 3)))
4200 cfi_hash_add(&init_cfi);
4201 cfi_hash_add(&func_cfi);
4203 ret = decode_sections(file);
4209 if (list_empty(&file->insn_list))
4212 if (opts.retpoline) {
4213 ret = validate_retpoline(file);
4219 if (opts.stackval || opts.orc || opts.uaccess) {
4220 ret = validate_functions(file);
4225 ret = validate_unwind_hints(file, NULL);
4231 ret = validate_reachable_instructions(file);
4237 } else if (opts.noinstr) {
4238 ret = validate_noinstr_sections(file);
4246 * Must be after validate_branch() and friends, it plays
4247 * further games with insn->visited.
4249 ret = validate_unret(file);
4256 ret = validate_ibt(file);
4263 ret = validate_sls(file);
4269 if (opts.static_call) {
4270 ret = create_static_call_sections(file);
4276 if (opts.retpoline) {
4277 ret = create_retpoline_sites_sections(file);
4284 ret = create_return_sites_sections(file);
4291 ret = create_mcount_loc_sections(file);
4298 ret = create_ibt_endbr_seal_sections(file);
4304 if (opts.orc && !list_empty(&file->insn_list)) {
4305 ret = orc_create(file);
4313 printf("nr_insns_visited: %ld\n", nr_insns_visited);
4314 printf("nr_cfi: %ld\n", nr_cfi);
4315 printf("nr_cfi_reused: %ld\n", nr_cfi_reused);
4316 printf("nr_cfi_cache: %ld\n", nr_cfi_cache);
4321 * For now, don't fail the kernel build on fatal warnings. These
4322 * errors are still fairly common due to the growing matrix of
4323 * supported toolchains and their recent pace of change.