1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
12 #include <objtool/builtin.h>
13 #include <objtool/cfi.h>
14 #include <objtool/arch.h>
15 #include <objtool/check.h>
16 #include <objtool/special.h>
17 #include <objtool/warn.h>
18 #include <objtool/endianness.h>
20 #include <linux/objtool.h>
21 #include <linux/hashtable.h>
22 #include <linux/kernel.h>
23 #include <linux/static_call_types.h>
26 struct list_head list;
27 struct instruction *insn;
31 static unsigned long nr_cfi, nr_cfi_reused, nr_cfi_cache;
33 static struct cfi_init_state initial_func_cfi;
34 static struct cfi_state init_cfi;
35 static struct cfi_state func_cfi;
37 struct instruction *find_insn(struct objtool_file *file,
38 struct section *sec, unsigned long offset)
40 struct instruction *insn;
42 hash_for_each_possible(file->insn_hash, insn, hash, sec_offset_hash(sec, offset)) {
43 if (insn->sec == sec && insn->offset == offset)
50 static struct instruction *next_insn_same_sec(struct objtool_file *file,
51 struct instruction *insn)
53 struct instruction *next = list_next_entry(insn, list);
55 if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
61 static struct instruction *next_insn_same_func(struct objtool_file *file,
62 struct instruction *insn)
64 struct instruction *next = list_next_entry(insn, list);
65 struct symbol *func = insn->func;
70 if (&next->list != &file->insn_list && next->func == func)
73 /* Check if we're already in the subfunction: */
74 if (func == func->cfunc)
77 /* Move to the subfunction: */
78 return find_insn(file, func->cfunc->sec, func->cfunc->offset);
81 static struct instruction *prev_insn_same_sym(struct objtool_file *file,
82 struct instruction *insn)
84 struct instruction *prev = list_prev_entry(insn, list);
86 if (&prev->list != &file->insn_list && prev->func == insn->func)
92 #define func_for_each_insn(file, func, insn) \
93 for (insn = find_insn(file, func->sec, func->offset); \
95 insn = next_insn_same_func(file, insn))
97 #define sym_for_each_insn(file, sym, insn) \
98 for (insn = find_insn(file, sym->sec, sym->offset); \
99 insn && &insn->list != &file->insn_list && \
100 insn->sec == sym->sec && \
101 insn->offset < sym->offset + sym->len; \
102 insn = list_next_entry(insn, list))
104 #define sym_for_each_insn_continue_reverse(file, sym, insn) \
105 for (insn = list_prev_entry(insn, list); \
106 &insn->list != &file->insn_list && \
107 insn->sec == sym->sec && insn->offset >= sym->offset; \
108 insn = list_prev_entry(insn, list))
110 #define sec_for_each_insn_from(file, insn) \
111 for (; insn; insn = next_insn_same_sec(file, insn))
113 #define sec_for_each_insn_continue(file, insn) \
114 for (insn = next_insn_same_sec(file, insn); insn; \
115 insn = next_insn_same_sec(file, insn))
117 static bool is_jump_table_jump(struct instruction *insn)
119 struct alt_group *alt_group = insn->alt_group;
121 if (insn->jump_table)
124 /* Retpoline alternative for a jump table? */
125 return alt_group && alt_group->orig_group &&
126 alt_group->orig_group->first_insn->jump_table;
129 static bool is_sibling_call(struct instruction *insn)
132 * Assume only ELF functions can make sibling calls. This ensures
133 * sibling call detection consistency between vmlinux.o and individual
139 /* An indirect jump is either a sibling call or a jump to a table. */
140 if (insn->type == INSN_JUMP_DYNAMIC)
141 return !is_jump_table_jump(insn);
143 /* add_jump_destinations() sets insn->call_dest for sibling calls. */
144 return (is_static_jump(insn) && insn->call_dest);
148 * This checks to see if the given function is a "noreturn" function.
150 * For global functions which are outside the scope of this object file, we
151 * have to keep a manual list of them.
153 * For local functions, we have to detect them manually by simply looking for
154 * the lack of a return instruction.
156 static bool __dead_end_function(struct objtool_file *file, struct symbol *func,
160 struct instruction *insn;
164 * Unfortunately these have to be hard coded because the noreturn
165 * attribute isn't provided in ELF data.
167 static const char * const global_noreturns[] = {
174 "__module_put_and_kthread_exit",
175 "kthread_complete_and_exit",
180 "machine_real_restart",
181 "rewind_stack_and_make_dead",
182 "kunit_try_catch_throw",
184 "cpu_bringup_and_idle",
189 "__ubsan_handle_builtin_unreachable",
190 "ex_handler_msr_mce",
196 if (func->bind == STB_WEAK)
199 if (func->bind == STB_GLOBAL)
200 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
201 if (!strcmp(func->name, global_noreturns[i]))
207 insn = find_insn(file, func->sec, func->offset);
211 func_for_each_insn(file, func, insn) {
214 if (insn->type == INSN_RETURN)
222 * A function can have a sibling call instead of a return. In that
223 * case, the function's dead-end status depends on whether the target
224 * of the sibling call returns.
226 func_for_each_insn(file, func, insn) {
227 if (is_sibling_call(insn)) {
228 struct instruction *dest = insn->jump_dest;
231 /* sibling call to another file */
234 /* local sibling call */
235 if (recursion == 5) {
237 * Infinite recursion: two functions have
238 * sibling calls to each other. This is a very
239 * rare case. It means they aren't dead ends.
244 return __dead_end_function(file, dest->func, recursion+1);
251 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
253 return __dead_end_function(file, func, 0);
256 static void init_cfi_state(struct cfi_state *cfi)
260 for (i = 0; i < CFI_NUM_REGS; i++) {
261 cfi->regs[i].base = CFI_UNDEFINED;
262 cfi->vals[i].base = CFI_UNDEFINED;
264 cfi->cfa.base = CFI_UNDEFINED;
265 cfi->drap_reg = CFI_UNDEFINED;
266 cfi->drap_offset = -1;
269 static void init_insn_state(struct objtool_file *file, struct insn_state *state,
272 memset(state, 0, sizeof(*state));
273 init_cfi_state(&state->cfi);
276 * We need the full vmlinux for noinstr validation, otherwise we can
277 * not correctly determine insn->call_dest->sec (external symbols do
278 * not have a section).
280 if (opts.link && opts.noinstr && sec)
281 state->noinstr = sec->noinstr;
284 static struct cfi_state *cfi_alloc(void)
286 struct cfi_state *cfi = calloc(sizeof(struct cfi_state), 1);
288 WARN("calloc failed");
296 static struct hlist_head *cfi_hash;
298 static inline bool cficmp(struct cfi_state *cfi1, struct cfi_state *cfi2)
300 return memcmp((void *)cfi1 + sizeof(cfi1->hash),
301 (void *)cfi2 + sizeof(cfi2->hash),
302 sizeof(struct cfi_state) - sizeof(struct hlist_node));
305 static inline u32 cfi_key(struct cfi_state *cfi)
307 return jhash((void *)cfi + sizeof(cfi->hash),
308 sizeof(*cfi) - sizeof(cfi->hash), 0);
311 static struct cfi_state *cfi_hash_find_or_add(struct cfi_state *cfi)
313 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
314 struct cfi_state *obj;
316 hlist_for_each_entry(obj, head, hash) {
317 if (!cficmp(cfi, obj)) {
325 hlist_add_head(&obj->hash, head);
330 static void cfi_hash_add(struct cfi_state *cfi)
332 struct hlist_head *head = &cfi_hash[hash_min(cfi_key(cfi), cfi_bits)];
334 hlist_add_head(&cfi->hash, head);
337 static void *cfi_hash_alloc(unsigned long size)
339 cfi_bits = max(10, ilog2(size));
340 cfi_hash = mmap(NULL, sizeof(struct hlist_head) << cfi_bits,
341 PROT_READ|PROT_WRITE,
342 MAP_PRIVATE|MAP_ANON, -1, 0);
343 if (cfi_hash == (void *)-1L) {
344 WARN("mmap fail cfi_hash");
346 } else if (opts.stats) {
347 printf("cfi_bits: %d\n", cfi_bits);
353 static unsigned long nr_insns;
354 static unsigned long nr_insns_visited;
357 * Call the arch-specific instruction decoder for all the instructions and add
358 * them to the global instruction list.
360 static int decode_instructions(struct objtool_file *file)
364 unsigned long offset;
365 struct instruction *insn;
368 for_each_sec(file, sec) {
370 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
373 if (strcmp(sec->name, ".altinstr_replacement") &&
374 strcmp(sec->name, ".altinstr_aux") &&
375 strncmp(sec->name, ".discard.", 9))
378 if (!strcmp(sec->name, ".noinstr.text") ||
379 !strcmp(sec->name, ".entry.text") ||
380 !strncmp(sec->name, ".text.__x86.", 12))
383 for (offset = 0; offset < sec->sh.sh_size; offset += insn->len) {
384 insn = malloc(sizeof(*insn));
386 WARN("malloc failed");
389 memset(insn, 0, sizeof(*insn));
390 INIT_LIST_HEAD(&insn->alts);
391 INIT_LIST_HEAD(&insn->stack_ops);
392 INIT_LIST_HEAD(&insn->call_node);
395 insn->offset = offset;
397 ret = arch_decode_instruction(file, sec, offset,
398 sec->sh.sh_size - offset,
399 &insn->len, &insn->type,
406 * By default, "ud2" is a dead end unless otherwise
407 * annotated, because GCC 7 inserts it for certain
408 * divide-by-zero cases.
410 if (insn->type == INSN_BUG)
411 insn->dead_end = true;
413 hash_add(file->insn_hash, &insn->hash, sec_offset_hash(sec, insn->offset));
414 list_add_tail(&insn->list, &file->insn_list);
418 list_for_each_entry(func, &sec->symbol_list, list) {
419 if (func->type != STT_FUNC || func->alias != func)
422 if (!find_insn(file, sec, func->offset)) {
423 WARN("%s(): can't find starting instruction",
428 sym_for_each_insn(file, func, insn) {
430 if (insn->type == INSN_ENDBR && list_empty(&insn->call_node)) {
431 if (insn->offset == insn->func->offset) {
432 list_add_tail(&insn->call_node, &file->endbr_list);
435 file->nr_endbr_int++;
443 printf("nr_insns: %lu\n", nr_insns);
453 * Read the pv_ops[] .data table to find the static initialized values.
455 static int add_pv_ops(struct objtool_file *file, const char *symname)
457 struct symbol *sym, *func;
458 unsigned long off, end;
462 sym = find_symbol_by_name(file->elf, symname);
467 end = off + sym->len;
469 rel = find_reloc_by_dest_range(file->elf, sym->sec, off, end - off);
474 if (func->type == STT_SECTION)
475 func = find_symbol_by_offset(rel->sym->sec, rel->addend);
477 idx = (rel->offset - sym->offset) / sizeof(unsigned long);
479 objtool_pv_add(file, idx, func);
481 off = rel->offset + 1;
490 * Allocate and initialize file->pv_ops[].
492 static int init_pv_ops(struct objtool_file *file)
494 static const char *pv_ops_tables[] = {
510 sym = find_symbol_by_name(file->elf, "pv_ops");
514 nr = sym->len / sizeof(unsigned long);
515 file->pv_ops = calloc(sizeof(struct pv_state), nr);
519 for (idx = 0; idx < nr; idx++)
520 INIT_LIST_HEAD(&file->pv_ops[idx].targets);
522 for (idx = 0; (pv_ops = pv_ops_tables[idx]); idx++)
523 add_pv_ops(file, pv_ops);
528 static struct instruction *find_last_insn(struct objtool_file *file,
531 struct instruction *insn = NULL;
533 unsigned int end = (sec->sh.sh_size > 10) ? sec->sh.sh_size - 10 : 0;
535 for (offset = sec->sh.sh_size - 1; offset >= end && !insn; offset--)
536 insn = find_insn(file, sec, offset);
542 * Mark "ud2" instructions and manually annotated dead ends.
544 static int add_dead_ends(struct objtool_file *file)
548 struct instruction *insn;
551 * Check for manually annotated dead ends.
553 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
557 list_for_each_entry(reloc, &sec->reloc_list, list) {
558 if (reloc->sym->type != STT_SECTION) {
559 WARN("unexpected relocation symbol type in %s", sec->name);
562 insn = find_insn(file, reloc->sym->sec, reloc->addend);
564 insn = list_prev_entry(insn, list);
565 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
566 insn = find_last_insn(file, reloc->sym->sec);
568 WARN("can't find unreachable insn at %s+0x%" PRIx64,
569 reloc->sym->sec->name, reloc->addend);
573 WARN("can't find unreachable insn at %s+0x%" PRIx64,
574 reloc->sym->sec->name, reloc->addend);
578 insn->dead_end = true;
583 * These manually annotated reachable checks are needed for GCC 4.4,
584 * where the Linux unreachable() macro isn't supported. In that case
585 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
588 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
592 list_for_each_entry(reloc, &sec->reloc_list, list) {
593 if (reloc->sym->type != STT_SECTION) {
594 WARN("unexpected relocation symbol type in %s", sec->name);
597 insn = find_insn(file, reloc->sym->sec, reloc->addend);
599 insn = list_prev_entry(insn, list);
600 else if (reloc->addend == reloc->sym->sec->sh.sh_size) {
601 insn = find_last_insn(file, reloc->sym->sec);
603 WARN("can't find reachable insn at %s+0x%" PRIx64,
604 reloc->sym->sec->name, reloc->addend);
608 WARN("can't find reachable insn at %s+0x%" PRIx64,
609 reloc->sym->sec->name, reloc->addend);
613 insn->dead_end = false;
619 static int create_static_call_sections(struct objtool_file *file)
622 struct static_call_site *site;
623 struct instruction *insn;
624 struct symbol *key_sym;
625 char *key_name, *tmp;
628 sec = find_section_by_name(file->elf, ".static_call_sites");
630 INIT_LIST_HEAD(&file->static_call_list);
631 WARN("file already has .static_call_sites section, skipping");
635 if (list_empty(&file->static_call_list))
639 list_for_each_entry(insn, &file->static_call_list, call_node)
642 sec = elf_create_section(file->elf, ".static_call_sites", SHF_WRITE,
643 sizeof(struct static_call_site), idx);
648 list_for_each_entry(insn, &file->static_call_list, call_node) {
650 site = (struct static_call_site *)sec->data->d_buf + idx;
651 memset(site, 0, sizeof(struct static_call_site));
653 /* populate reloc for 'addr' */
654 if (elf_add_reloc_to_insn(file->elf, sec,
655 idx * sizeof(struct static_call_site),
657 insn->sec, insn->offset))
660 /* find key symbol */
661 key_name = strdup(insn->call_dest->name);
666 if (strncmp(key_name, STATIC_CALL_TRAMP_PREFIX_STR,
667 STATIC_CALL_TRAMP_PREFIX_LEN)) {
668 WARN("static_call: trampoline name malformed: %s", key_name);
671 tmp = key_name + STATIC_CALL_TRAMP_PREFIX_LEN - STATIC_CALL_KEY_PREFIX_LEN;
672 memcpy(tmp, STATIC_CALL_KEY_PREFIX_STR, STATIC_CALL_KEY_PREFIX_LEN);
674 key_sym = find_symbol_by_name(file->elf, tmp);
677 WARN("static_call: can't find static_call_key symbol: %s", tmp);
682 * For modules(), the key might not be exported, which
683 * means the module can make static calls but isn't
684 * allowed to change them.
686 * In that case we temporarily set the key to be the
687 * trampoline address. This is fixed up in
688 * static_call_add_module().
690 key_sym = insn->call_dest;
694 /* populate reloc for 'key' */
695 if (elf_add_reloc(file->elf, sec,
696 idx * sizeof(struct static_call_site) + 4,
697 R_X86_64_PC32, key_sym,
698 is_sibling_call(insn) * STATIC_CALL_SITE_TAIL))
707 static int create_retpoline_sites_sections(struct objtool_file *file)
709 struct instruction *insn;
713 sec = find_section_by_name(file->elf, ".retpoline_sites");
715 WARN("file already has .retpoline_sites, skipping");
720 list_for_each_entry(insn, &file->retpoline_call_list, call_node)
726 sec = elf_create_section(file->elf, ".retpoline_sites", 0,
729 WARN("elf_create_section: .retpoline_sites");
734 list_for_each_entry(insn, &file->retpoline_call_list, call_node) {
736 int *site = (int *)sec->data->d_buf + idx;
739 if (elf_add_reloc_to_insn(file->elf, sec,
742 insn->sec, insn->offset)) {
743 WARN("elf_add_reloc_to_insn: .retpoline_sites");
753 static int create_return_sites_sections(struct objtool_file *file)
755 struct instruction *insn;
759 sec = find_section_by_name(file->elf, ".return_sites");
761 WARN("file already has .return_sites, skipping");
766 list_for_each_entry(insn, &file->return_thunk_list, call_node)
772 sec = elf_create_section(file->elf, ".return_sites", 0,
775 WARN("elf_create_section: .return_sites");
780 list_for_each_entry(insn, &file->return_thunk_list, call_node) {
782 int *site = (int *)sec->data->d_buf + idx;
785 if (elf_add_reloc_to_insn(file->elf, sec,
788 insn->sec, insn->offset)) {
789 WARN("elf_add_reloc_to_insn: .return_sites");
799 static int create_ibt_endbr_seal_sections(struct objtool_file *file)
801 struct instruction *insn;
805 sec = find_section_by_name(file->elf, ".ibt_endbr_seal");
807 WARN("file already has .ibt_endbr_seal, skipping");
812 list_for_each_entry(insn, &file->endbr_list, call_node)
816 printf("ibt: ENDBR at function start: %d\n", file->nr_endbr);
817 printf("ibt: ENDBR inside functions: %d\n", file->nr_endbr_int);
818 printf("ibt: superfluous ENDBR: %d\n", idx);
824 sec = elf_create_section(file->elf, ".ibt_endbr_seal", 0,
827 WARN("elf_create_section: .ibt_endbr_seal");
832 list_for_each_entry(insn, &file->endbr_list, call_node) {
834 int *site = (int *)sec->data->d_buf + idx;
837 if (elf_add_reloc_to_insn(file->elf, sec,
840 insn->sec, insn->offset)) {
841 WARN("elf_add_reloc_to_insn: .ibt_endbr_seal");
851 static int create_mcount_loc_sections(struct objtool_file *file)
855 struct instruction *insn;
858 sec = find_section_by_name(file->elf, "__mcount_loc");
860 INIT_LIST_HEAD(&file->mcount_loc_list);
861 WARN("file already has __mcount_loc section, skipping");
865 if (list_empty(&file->mcount_loc_list))
869 list_for_each_entry(insn, &file->mcount_loc_list, call_node)
872 sec = elf_create_section(file->elf, "__mcount_loc", 0, sizeof(unsigned long), idx);
877 list_for_each_entry(insn, &file->mcount_loc_list, call_node) {
879 loc = (unsigned long *)sec->data->d_buf + idx;
880 memset(loc, 0, sizeof(unsigned long));
882 if (elf_add_reloc_to_insn(file->elf, sec,
883 idx * sizeof(unsigned long),
885 insn->sec, insn->offset))
895 * Warnings shouldn't be reported for ignored functions.
897 static void add_ignores(struct objtool_file *file)
899 struct instruction *insn;
904 sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
908 list_for_each_entry(reloc, &sec->reloc_list, list) {
909 switch (reloc->sym->type) {
915 func = find_func_by_offset(reloc->sym->sec, reloc->addend);
921 WARN("unexpected relocation symbol type in %s: %d", sec->name, reloc->sym->type);
925 func_for_each_insn(file, func, insn)
931 * This is a whitelist of functions that is allowed to be called with AC set.
932 * The list is meant to be minimal and only contains compiler instrumentation
933 * ABI and a few functions used to implement *_{to,from}_user() functions.
935 * These functions must not directly change AC, but may PUSHF/POPF.
937 static const char *uaccess_safe_builtin[] = {
941 /* KASAN out-of-line */
942 "__asan_loadN_noabort",
943 "__asan_load1_noabort",
944 "__asan_load2_noabort",
945 "__asan_load4_noabort",
946 "__asan_load8_noabort",
947 "__asan_load16_noabort",
948 "__asan_storeN_noabort",
949 "__asan_store1_noabort",
950 "__asan_store2_noabort",
951 "__asan_store4_noabort",
952 "__asan_store8_noabort",
953 "__asan_store16_noabort",
954 "__kasan_check_read",
955 "__kasan_check_write",
957 "__asan_report_load_n_noabort",
958 "__asan_report_load1_noabort",
959 "__asan_report_load2_noabort",
960 "__asan_report_load4_noabort",
961 "__asan_report_load8_noabort",
962 "__asan_report_load16_noabort",
963 "__asan_report_store_n_noabort",
964 "__asan_report_store1_noabort",
965 "__asan_report_store2_noabort",
966 "__asan_report_store4_noabort",
967 "__asan_report_store8_noabort",
968 "__asan_report_store16_noabort",
970 "__kcsan_check_access",
975 "kcsan_found_watchpoint",
976 "kcsan_setup_watchpoint",
977 "kcsan_check_scoped_accesses",
978 "kcsan_disable_current",
979 "kcsan_enable_current_nowarn",
984 "__tsan_write_range",
995 "__tsan_read_write1",
996 "__tsan_read_write2",
997 "__tsan_read_write4",
998 "__tsan_read_write8",
999 "__tsan_read_write16",
1000 "__tsan_atomic8_load",
1001 "__tsan_atomic16_load",
1002 "__tsan_atomic32_load",
1003 "__tsan_atomic64_load",
1004 "__tsan_atomic8_store",
1005 "__tsan_atomic16_store",
1006 "__tsan_atomic32_store",
1007 "__tsan_atomic64_store",
1008 "__tsan_atomic8_exchange",
1009 "__tsan_atomic16_exchange",
1010 "__tsan_atomic32_exchange",
1011 "__tsan_atomic64_exchange",
1012 "__tsan_atomic8_fetch_add",
1013 "__tsan_atomic16_fetch_add",
1014 "__tsan_atomic32_fetch_add",
1015 "__tsan_atomic64_fetch_add",
1016 "__tsan_atomic8_fetch_sub",
1017 "__tsan_atomic16_fetch_sub",
1018 "__tsan_atomic32_fetch_sub",
1019 "__tsan_atomic64_fetch_sub",
1020 "__tsan_atomic8_fetch_and",
1021 "__tsan_atomic16_fetch_and",
1022 "__tsan_atomic32_fetch_and",
1023 "__tsan_atomic64_fetch_and",
1024 "__tsan_atomic8_fetch_or",
1025 "__tsan_atomic16_fetch_or",
1026 "__tsan_atomic32_fetch_or",
1027 "__tsan_atomic64_fetch_or",
1028 "__tsan_atomic8_fetch_xor",
1029 "__tsan_atomic16_fetch_xor",
1030 "__tsan_atomic32_fetch_xor",
1031 "__tsan_atomic64_fetch_xor",
1032 "__tsan_atomic8_fetch_nand",
1033 "__tsan_atomic16_fetch_nand",
1034 "__tsan_atomic32_fetch_nand",
1035 "__tsan_atomic64_fetch_nand",
1036 "__tsan_atomic8_compare_exchange_strong",
1037 "__tsan_atomic16_compare_exchange_strong",
1038 "__tsan_atomic32_compare_exchange_strong",
1039 "__tsan_atomic64_compare_exchange_strong",
1040 "__tsan_atomic8_compare_exchange_weak",
1041 "__tsan_atomic16_compare_exchange_weak",
1042 "__tsan_atomic32_compare_exchange_weak",
1043 "__tsan_atomic64_compare_exchange_weak",
1044 "__tsan_atomic8_compare_exchange_val",
1045 "__tsan_atomic16_compare_exchange_val",
1046 "__tsan_atomic32_compare_exchange_val",
1047 "__tsan_atomic64_compare_exchange_val",
1048 "__tsan_atomic_thread_fence",
1049 "__tsan_atomic_signal_fence",
1053 "__sanitizer_cov_trace_pc",
1054 "__sanitizer_cov_trace_const_cmp1",
1055 "__sanitizer_cov_trace_const_cmp2",
1056 "__sanitizer_cov_trace_const_cmp4",
1057 "__sanitizer_cov_trace_const_cmp8",
1058 "__sanitizer_cov_trace_cmp1",
1059 "__sanitizer_cov_trace_cmp2",
1060 "__sanitizer_cov_trace_cmp4",
1061 "__sanitizer_cov_trace_cmp8",
1062 "__sanitizer_cov_trace_switch",
1064 "ubsan_type_mismatch_common",
1065 "__ubsan_handle_type_mismatch",
1066 "__ubsan_handle_type_mismatch_v1",
1067 "__ubsan_handle_shift_out_of_bounds",
1069 "csum_partial_copy_generic",
1071 "copy_mc_fragile_handle_tail",
1072 "copy_mc_enhanced_fast_string",
1073 "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
1077 static void add_uaccess_safe(struct objtool_file *file)
1079 struct symbol *func;
1085 for (name = uaccess_safe_builtin; *name; name++) {
1086 func = find_symbol_by_name(file->elf, *name);
1090 func->uaccess_safe = true;
1095 * FIXME: For now, just ignore any alternatives which add retpolines. This is
1096 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
1097 * But it at least allows objtool to understand the control flow *around* the
1100 static int add_ignore_alternatives(struct objtool_file *file)
1102 struct section *sec;
1103 struct reloc *reloc;
1104 struct instruction *insn;
1106 sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
1110 list_for_each_entry(reloc, &sec->reloc_list, list) {
1111 if (reloc->sym->type != STT_SECTION) {
1112 WARN("unexpected relocation symbol type in %s", sec->name);
1116 insn = find_insn(file, reloc->sym->sec, reloc->addend);
1118 WARN("bad .discard.ignore_alts entry");
1122 insn->ignore_alts = true;
1128 __weak bool arch_is_retpoline(struct symbol *sym)
1133 __weak bool arch_is_rethunk(struct symbol *sym)
1138 #define NEGATIVE_RELOC ((void *)-1L)
1140 static struct reloc *insn_reloc(struct objtool_file *file, struct instruction *insn)
1142 if (insn->reloc == NEGATIVE_RELOC)
1149 insn->reloc = find_reloc_by_dest_range(file->elf, insn->sec,
1150 insn->offset, insn->len);
1152 insn->reloc = NEGATIVE_RELOC;
1160 static void remove_insn_ops(struct instruction *insn)
1162 struct stack_op *op, *tmp;
1164 list_for_each_entry_safe(op, tmp, &insn->stack_ops, list) {
1165 list_del(&op->list);
1170 static void annotate_call_site(struct objtool_file *file,
1171 struct instruction *insn, bool sibling)
1173 struct reloc *reloc = insn_reloc(file, insn);
1174 struct symbol *sym = insn->call_dest;
1180 * Alternative replacement code is just template code which is
1181 * sometimes copied to the original instruction. For now, don't
1182 * annotate it. (In the future we might consider annotating the
1183 * original instruction if/when it ever makes sense to do so.)
1185 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
1188 if (sym->static_call_tramp) {
1189 list_add_tail(&insn->call_node, &file->static_call_list);
1193 if (sym->retpoline_thunk) {
1194 list_add_tail(&insn->call_node, &file->retpoline_call_list);
1199 * Many compilers cannot disable KCOV or sanitizer calls with a function
1200 * attribute so they need a little help, NOP out any such calls from
1203 if (opts.hack_noinstr && insn->sec->noinstr && sym->profiling_func) {
1205 reloc->type = R_NONE;
1206 elf_write_reloc(file->elf, reloc);
1209 elf_write_insn(file->elf, insn->sec,
1210 insn->offset, insn->len,
1211 sibling ? arch_ret_insn(insn->len)
1212 : arch_nop_insn(insn->len));
1214 insn->type = sibling ? INSN_RETURN : INSN_NOP;
1218 * We've replaced the tail-call JMP insn by two new
1219 * insn: RET; INT3, except we only have a single struct
1220 * insn here. Mark it retpoline_safe to avoid the SLS
1221 * warning, instead of adding another insn.
1223 insn->retpoline_safe = true;
1229 if (opts.mcount && sym->fentry) {
1231 WARN_FUNC("Tail call to __fentry__ !?!?", insn->sec, insn->offset);
1234 reloc->type = R_NONE;
1235 elf_write_reloc(file->elf, reloc);
1238 elf_write_insn(file->elf, insn->sec,
1239 insn->offset, insn->len,
1240 arch_nop_insn(insn->len));
1242 insn->type = INSN_NOP;
1244 list_add_tail(&insn->call_node, &file->mcount_loc_list);
1248 if (!sibling && dead_end_function(file, sym))
1249 insn->dead_end = true;
1252 static void add_call_dest(struct objtool_file *file, struct instruction *insn,
1253 struct symbol *dest, bool sibling)
1255 insn->call_dest = dest;
1260 * Whatever stack impact regular CALLs have, should be undone
1261 * by the RETURN of the called function.
1263 * Annotated intra-function calls retain the stack_ops but
1264 * are converted to JUMP, see read_intra_function_calls().
1266 remove_insn_ops(insn);
1268 annotate_call_site(file, insn, sibling);
1271 static void add_retpoline_call(struct objtool_file *file, struct instruction *insn)
1274 * Retpoline calls/jumps are really dynamic calls/jumps in disguise,
1275 * so convert them accordingly.
1277 switch (insn->type) {
1279 insn->type = INSN_CALL_DYNAMIC;
1281 case INSN_JUMP_UNCONDITIONAL:
1282 insn->type = INSN_JUMP_DYNAMIC;
1284 case INSN_JUMP_CONDITIONAL:
1285 insn->type = INSN_JUMP_DYNAMIC_CONDITIONAL;
1291 insn->retpoline_safe = true;
1294 * Whatever stack impact regular CALLs have, should be undone
1295 * by the RETURN of the called function.
1297 * Annotated intra-function calls retain the stack_ops but
1298 * are converted to JUMP, see read_intra_function_calls().
1300 remove_insn_ops(insn);
1302 annotate_call_site(file, insn, false);
1305 static void add_return_call(struct objtool_file *file, struct instruction *insn, bool add)
1308 * Return thunk tail calls are really just returns in disguise,
1309 * so convert them accordingly.
1311 insn->type = INSN_RETURN;
1312 insn->retpoline_safe = true;
1315 list_add_tail(&insn->call_node, &file->return_thunk_list);
1318 static bool same_function(struct instruction *insn1, struct instruction *insn2)
1320 return insn1->func->pfunc == insn2->func->pfunc;
1323 static bool is_first_func_insn(struct objtool_file *file, struct instruction *insn)
1325 if (insn->offset == insn->func->offset)
1329 struct instruction *prev = prev_insn_same_sym(file, insn);
1331 if (prev && prev->type == INSN_ENDBR &&
1332 insn->offset == insn->func->offset + prev->len)
1340 * Find the destination instructions for all jumps.
1342 static int add_jump_destinations(struct objtool_file *file)
1344 struct instruction *insn, *jump_dest;
1345 struct reloc *reloc;
1346 struct section *dest_sec;
1347 unsigned long dest_off;
1349 for_each_insn(file, insn) {
1350 if (insn->jump_dest) {
1352 * handle_group_alt() may have previously set
1353 * 'jump_dest' for some alternatives.
1357 if (!is_static_jump(insn))
1360 reloc = insn_reloc(file, insn);
1362 dest_sec = insn->sec;
1363 dest_off = arch_jump_destination(insn);
1364 } else if (reloc->sym->type == STT_SECTION) {
1365 dest_sec = reloc->sym->sec;
1366 dest_off = arch_dest_reloc_offset(reloc->addend);
1367 } else if (reloc->sym->retpoline_thunk) {
1368 add_retpoline_call(file, insn);
1370 } else if (reloc->sym->return_thunk) {
1371 add_return_call(file, insn, true);
1373 } else if (insn->func) {
1375 * External sibling call or internal sibling call with
1378 add_call_dest(file, insn, reloc->sym, true);
1380 } else if (reloc->sym->sec->idx) {
1381 dest_sec = reloc->sym->sec;
1382 dest_off = reloc->sym->sym.st_value +
1383 arch_dest_reloc_offset(reloc->addend);
1385 /* non-func asm code jumping to another file */
1389 jump_dest = find_insn(file, dest_sec, dest_off);
1391 struct symbol *sym = find_symbol_by_offset(dest_sec, dest_off);
1394 * This is a special case for zen_untrain_ret().
1395 * It jumps to __x86_return_thunk(), but objtool
1396 * can't find the thunk's starting RET
1397 * instruction, because the RET is also in the
1398 * middle of another instruction. Objtool only
1399 * knows about the outer instruction.
1401 if (sym && sym->return_thunk) {
1402 add_return_call(file, insn, false);
1406 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
1407 insn->sec, insn->offset, dest_sec->name,
1413 * Cross-function jump.
1415 if (insn->func && jump_dest->func &&
1416 insn->func != jump_dest->func) {
1419 * For GCC 8+, create parent/child links for any cold
1420 * subfunctions. This is _mostly_ redundant with a
1421 * similar initialization in read_symbols().
1423 * If a function has aliases, we want the *first* such
1424 * function in the symbol table to be the subfunction's
1425 * parent. In that case we overwrite the
1426 * initialization done in read_symbols().
1428 * However this code can't completely replace the
1429 * read_symbols() code because this doesn't detect the
1430 * case where the parent function's only reference to a
1431 * subfunction is through a jump table.
1433 if (!strstr(insn->func->name, ".cold") &&
1434 strstr(jump_dest->func->name, ".cold")) {
1435 insn->func->cfunc = jump_dest->func;
1436 jump_dest->func->pfunc = insn->func;
1438 } else if (!same_function(insn, jump_dest) &&
1439 is_first_func_insn(file, jump_dest)) {
1441 * Internal sibling call without reloc or with
1442 * STT_SECTION reloc.
1444 add_call_dest(file, insn, jump_dest->func, true);
1449 insn->jump_dest = jump_dest;
1455 static struct symbol *find_call_destination(struct section *sec, unsigned long offset)
1457 struct symbol *call_dest;
1459 call_dest = find_func_by_offset(sec, offset);
1461 call_dest = find_symbol_by_offset(sec, offset);
1467 * Find the destination instructions for all calls.
1469 static int add_call_destinations(struct objtool_file *file)
1471 struct instruction *insn;
1472 unsigned long dest_off;
1473 struct symbol *dest;
1474 struct reloc *reloc;
1476 for_each_insn(file, insn) {
1477 if (insn->type != INSN_CALL)
1480 reloc = insn_reloc(file, insn);
1482 dest_off = arch_jump_destination(insn);
1483 dest = find_call_destination(insn->sec, dest_off);
1485 add_call_dest(file, insn, dest, false);
1490 if (!insn->call_dest) {
1491 WARN_FUNC("unannotated intra-function call", insn->sec, insn->offset);
1495 if (insn->func && insn->call_dest->type != STT_FUNC) {
1496 WARN_FUNC("unsupported call to non-function",
1497 insn->sec, insn->offset);
1501 } else if (reloc->sym->type == STT_SECTION) {
1502 dest_off = arch_dest_reloc_offset(reloc->addend);
1503 dest = find_call_destination(reloc->sym->sec, dest_off);
1505 WARN_FUNC("can't find call dest symbol at %s+0x%lx",
1506 insn->sec, insn->offset,
1507 reloc->sym->sec->name,
1512 add_call_dest(file, insn, dest, false);
1514 } else if (reloc->sym->retpoline_thunk) {
1515 add_retpoline_call(file, insn);
1518 add_call_dest(file, insn, reloc->sym, false);
1525 * The .alternatives section requires some extra special care over and above
1526 * other special sections because alternatives are patched in place.
1528 static int handle_group_alt(struct objtool_file *file,
1529 struct special_alt *special_alt,
1530 struct instruction *orig_insn,
1531 struct instruction **new_insn)
1533 struct instruction *last_orig_insn, *last_new_insn = NULL, *insn, *nop = NULL;
1534 struct alt_group *orig_alt_group, *new_alt_group;
1535 unsigned long dest_off;
1538 orig_alt_group = malloc(sizeof(*orig_alt_group));
1539 if (!orig_alt_group) {
1540 WARN("malloc failed");
1543 orig_alt_group->cfi = calloc(special_alt->orig_len,
1544 sizeof(struct cfi_state *));
1545 if (!orig_alt_group->cfi) {
1546 WARN("calloc failed");
1550 last_orig_insn = NULL;
1552 sec_for_each_insn_from(file, insn) {
1553 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
1556 insn->alt_group = orig_alt_group;
1557 last_orig_insn = insn;
1559 orig_alt_group->orig_group = NULL;
1560 orig_alt_group->first_insn = orig_insn;
1561 orig_alt_group->last_insn = last_orig_insn;
1564 new_alt_group = malloc(sizeof(*new_alt_group));
1565 if (!new_alt_group) {
1566 WARN("malloc failed");
1570 if (special_alt->new_len < special_alt->orig_len) {
1572 * Insert a fake nop at the end to make the replacement
1573 * alt_group the same size as the original. This is needed to
1574 * allow propagate_alt_cfi() to do its magic. When the last
1575 * instruction affects the stack, the instruction after it (the
1576 * nop) will propagate the new state to the shared CFI array.
1578 nop = malloc(sizeof(*nop));
1580 WARN("malloc failed");
1583 memset(nop, 0, sizeof(*nop));
1584 INIT_LIST_HEAD(&nop->alts);
1585 INIT_LIST_HEAD(&nop->stack_ops);
1587 nop->sec = special_alt->new_sec;
1588 nop->offset = special_alt->new_off + special_alt->new_len;
1589 nop->len = special_alt->orig_len - special_alt->new_len;
1590 nop->type = INSN_NOP;
1591 nop->func = orig_insn->func;
1592 nop->alt_group = new_alt_group;
1593 nop->ignore = orig_insn->ignore_alts;
1596 if (!special_alt->new_len) {
1602 sec_for_each_insn_from(file, insn) {
1603 struct reloc *alt_reloc;
1605 if (insn->offset >= special_alt->new_off + special_alt->new_len)
1608 last_new_insn = insn;
1610 insn->ignore = orig_insn->ignore_alts;
1611 insn->func = orig_insn->func;
1612 insn->alt_group = new_alt_group;
1615 * Since alternative replacement code is copy/pasted by the
1616 * kernel after applying relocations, generally such code can't
1617 * have relative-address relocation references to outside the
1618 * .altinstr_replacement section, unless the arch's
1619 * alternatives code can adjust the relative offsets
1622 alt_reloc = insn_reloc(file, insn);
1624 !arch_support_alt_relocation(special_alt, insn, alt_reloc)) {
1626 WARN_FUNC("unsupported relocation in alternatives section",
1627 insn->sec, insn->offset);
1631 if (!is_static_jump(insn))
1634 if (!insn->immediate)
1637 dest_off = arch_jump_destination(insn);
1638 if (dest_off == special_alt->new_off + special_alt->new_len) {
1639 insn->jump_dest = next_insn_same_sec(file, last_orig_insn);
1640 if (!insn->jump_dest) {
1641 WARN_FUNC("can't find alternative jump destination",
1642 insn->sec, insn->offset);
1648 if (!last_new_insn) {
1649 WARN_FUNC("can't find last new alternative instruction",
1650 special_alt->new_sec, special_alt->new_off);
1655 list_add(&nop->list, &last_new_insn->list);
1657 new_alt_group->orig_group = orig_alt_group;
1658 new_alt_group->first_insn = *new_insn;
1659 new_alt_group->last_insn = nop ? : last_new_insn;
1660 new_alt_group->cfi = orig_alt_group->cfi;
1665 * A jump table entry can either convert a nop to a jump or a jump to a nop.
1666 * If the original instruction is a jump, make the alt entry an effective nop
1667 * by just skipping the original instruction.
1669 static int handle_jump_alt(struct objtool_file *file,
1670 struct special_alt *special_alt,
1671 struct instruction *orig_insn,
1672 struct instruction **new_insn)
1674 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL &&
1675 orig_insn->type != INSN_NOP) {
1677 WARN_FUNC("unsupported instruction at jump label",
1678 orig_insn->sec, orig_insn->offset);
1682 if (opts.hack_jump_label && special_alt->key_addend & 2) {
1683 struct reloc *reloc = insn_reloc(file, orig_insn);
1686 reloc->type = R_NONE;
1687 elf_write_reloc(file->elf, reloc);
1689 elf_write_insn(file->elf, orig_insn->sec,
1690 orig_insn->offset, orig_insn->len,
1691 arch_nop_insn(orig_insn->len));
1692 orig_insn->type = INSN_NOP;
1695 if (orig_insn->type == INSN_NOP) {
1696 if (orig_insn->len == 2)
1697 file->jl_nop_short++;
1699 file->jl_nop_long++;
1704 if (orig_insn->len == 2)
1709 *new_insn = list_next_entry(orig_insn, list);
1714 * Read all the special sections which have alternate instructions which can be
1715 * patched in or redirected to at runtime. Each instruction having alternate
1716 * instruction(s) has them added to its insn->alts list, which will be
1717 * traversed in validate_branch().
1719 static int add_special_section_alts(struct objtool_file *file)
1721 struct list_head special_alts;
1722 struct instruction *orig_insn, *new_insn;
1723 struct special_alt *special_alt, *tmp;
1724 struct alternative *alt;
1727 ret = special_get_alts(file->elf, &special_alts);
1731 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
1733 orig_insn = find_insn(file, special_alt->orig_sec,
1734 special_alt->orig_off);
1736 WARN_FUNC("special: can't find orig instruction",
1737 special_alt->orig_sec, special_alt->orig_off);
1743 if (!special_alt->group || special_alt->new_len) {
1744 new_insn = find_insn(file, special_alt->new_sec,
1745 special_alt->new_off);
1747 WARN_FUNC("special: can't find new instruction",
1748 special_alt->new_sec,
1749 special_alt->new_off);
1755 if (special_alt->group) {
1756 if (!special_alt->orig_len) {
1757 WARN_FUNC("empty alternative entry",
1758 orig_insn->sec, orig_insn->offset);
1762 ret = handle_group_alt(file, special_alt, orig_insn,
1766 } else if (special_alt->jump_or_nop) {
1767 ret = handle_jump_alt(file, special_alt, orig_insn,
1773 alt = malloc(sizeof(*alt));
1775 WARN("malloc failed");
1780 alt->insn = new_insn;
1781 alt->skip_orig = special_alt->skip_orig;
1782 orig_insn->ignore_alts |= special_alt->skip_alt;
1783 list_add_tail(&alt->list, &orig_insn->alts);
1785 list_del(&special_alt->list);
1790 printf("jl\\\tNOP\tJMP\n");
1791 printf("short:\t%ld\t%ld\n", file->jl_nop_short, file->jl_short);
1792 printf("long:\t%ld\t%ld\n", file->jl_nop_long, file->jl_long);
1799 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
1800 struct reloc *table)
1802 struct reloc *reloc = table;
1803 struct instruction *dest_insn;
1804 struct alternative *alt;
1805 struct symbol *pfunc = insn->func->pfunc;
1806 unsigned int prev_offset = 0;
1809 * Each @reloc is a switch table relocation which points to the target
1812 list_for_each_entry_from(reloc, &table->sec->reloc_list, list) {
1814 /* Check for the end of the table: */
1815 if (reloc != table && reloc->jump_table_start)
1818 /* Make sure the table entries are consecutive: */
1819 if (prev_offset && reloc->offset != prev_offset + 8)
1822 /* Detect function pointers from contiguous objects: */
1823 if (reloc->sym->sec == pfunc->sec &&
1824 reloc->addend == pfunc->offset)
1827 dest_insn = find_insn(file, reloc->sym->sec, reloc->addend);
1831 /* Make sure the destination is in the same function: */
1832 if (!dest_insn->func || dest_insn->func->pfunc != pfunc)
1835 alt = malloc(sizeof(*alt));
1837 WARN("malloc failed");
1841 alt->insn = dest_insn;
1842 list_add_tail(&alt->list, &insn->alts);
1843 prev_offset = reloc->offset;
1847 WARN_FUNC("can't find switch jump table",
1848 insn->sec, insn->offset);
1856 * find_jump_table() - Given a dynamic jump, find the switch jump table
1857 * associated with it.
1859 static struct reloc *find_jump_table(struct objtool_file *file,
1860 struct symbol *func,
1861 struct instruction *insn)
1863 struct reloc *table_reloc;
1864 struct instruction *dest_insn, *orig_insn = insn;
1867 * Backward search using the @first_jump_src links, these help avoid
1868 * much of the 'in between' code. Which avoids us getting confused by
1872 insn && insn->func && insn->func->pfunc == func;
1873 insn = insn->first_jump_src ?: prev_insn_same_sym(file, insn)) {
1875 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1878 /* allow small jumps within the range */
1879 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1881 (insn->jump_dest->offset <= insn->offset ||
1882 insn->jump_dest->offset > orig_insn->offset))
1885 table_reloc = arch_find_switch_table(file, insn);
1888 dest_insn = find_insn(file, table_reloc->sym->sec, table_reloc->addend);
1889 if (!dest_insn || !dest_insn->func || dest_insn->func->pfunc != func)
1899 * First pass: Mark the head of each jump table so that in the next pass,
1900 * we know when a given jump table ends and the next one starts.
1902 static void mark_func_jump_tables(struct objtool_file *file,
1903 struct symbol *func)
1905 struct instruction *insn, *last = NULL;
1906 struct reloc *reloc;
1908 func_for_each_insn(file, func, insn) {
1913 * Store back-pointers for unconditional forward jumps such
1914 * that find_jump_table() can back-track using those and
1915 * avoid some potentially confusing code.
1917 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1918 insn->offset > last->offset &&
1919 insn->jump_dest->offset > insn->offset &&
1920 !insn->jump_dest->first_jump_src) {
1922 insn->jump_dest->first_jump_src = insn;
1923 last = insn->jump_dest;
1926 if (insn->type != INSN_JUMP_DYNAMIC)
1929 reloc = find_jump_table(file, func, insn);
1931 reloc->jump_table_start = true;
1932 insn->jump_table = reloc;
1937 static int add_func_jump_tables(struct objtool_file *file,
1938 struct symbol *func)
1940 struct instruction *insn;
1943 func_for_each_insn(file, func, insn) {
1944 if (!insn->jump_table)
1947 ret = add_jump_table(file, insn, insn->jump_table);
1956 * For some switch statements, gcc generates a jump table in the .rodata
1957 * section which contains a list of addresses within the function to jump to.
1958 * This finds these jump tables and adds them to the insn->alts lists.
1960 static int add_jump_table_alts(struct objtool_file *file)
1962 struct section *sec;
1963 struct symbol *func;
1969 for_each_sec(file, sec) {
1970 list_for_each_entry(func, &sec->symbol_list, list) {
1971 if (func->type != STT_FUNC)
1974 mark_func_jump_tables(file, func);
1975 ret = add_func_jump_tables(file, func);
1984 static void set_func_state(struct cfi_state *state)
1986 state->cfa = initial_func_cfi.cfa;
1987 memcpy(&state->regs, &initial_func_cfi.regs,
1988 CFI_NUM_REGS * sizeof(struct cfi_reg));
1989 state->stack_size = initial_func_cfi.cfa.offset;
1992 static int read_unwind_hints(struct objtool_file *file)
1994 struct cfi_state cfi = init_cfi;
1995 struct section *sec, *relocsec;
1996 struct unwind_hint *hint;
1997 struct instruction *insn;
1998 struct reloc *reloc;
2001 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
2005 relocsec = sec->reloc;
2007 WARN("missing .rela.discard.unwind_hints section");
2011 if (sec->sh.sh_size % sizeof(struct unwind_hint)) {
2012 WARN("struct unwind_hint size mismatch");
2018 for (i = 0; i < sec->sh.sh_size / sizeof(struct unwind_hint); i++) {
2019 hint = (struct unwind_hint *)sec->data->d_buf + i;
2021 reloc = find_reloc_by_dest(file->elf, sec, i * sizeof(*hint));
2023 WARN("can't find reloc for unwind_hints[%d]", i);
2027 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2029 WARN("can't find insn for unwind_hints[%d]", i);
2035 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
2041 if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
2042 insn->restore = true;
2046 if (hint->type == UNWIND_HINT_TYPE_REGS_PARTIAL) {
2047 struct symbol *sym = find_symbol_by_offset(insn->sec, insn->offset);
2049 if (sym && sym->bind == STB_GLOBAL) {
2050 if (opts.ibt && insn->type != INSN_ENDBR && !insn->noendbr) {
2051 WARN_FUNC("UNWIND_HINT_IRET_REGS without ENDBR",
2052 insn->sec, insn->offset);
2059 if (hint->type == UNWIND_HINT_TYPE_ENTRY) {
2060 hint->type = UNWIND_HINT_TYPE_CALL;
2064 if (hint->type == UNWIND_HINT_TYPE_FUNC) {
2065 insn->cfi = &func_cfi;
2072 if (arch_decode_hint_reg(hint->sp_reg, &cfi.cfa.base)) {
2073 WARN_FUNC("unsupported unwind_hint sp base reg %d",
2074 insn->sec, insn->offset, hint->sp_reg);
2078 cfi.cfa.offset = bswap_if_needed(hint->sp_offset);
2079 cfi.type = hint->type;
2080 cfi.end = hint->end;
2082 insn->cfi = cfi_hash_find_or_add(&cfi);
2088 static int read_noendbr_hints(struct objtool_file *file)
2090 struct section *sec;
2091 struct instruction *insn;
2092 struct reloc *reloc;
2094 sec = find_section_by_name(file->elf, ".rela.discard.noendbr");
2098 list_for_each_entry(reloc, &sec->reloc_list, list) {
2099 insn = find_insn(file, reloc->sym->sec, reloc->sym->offset + reloc->addend);
2101 WARN("bad .discard.noendbr entry");
2105 if (insn->type == INSN_ENDBR)
2106 WARN_FUNC("ANNOTATE_NOENDBR on ENDBR", insn->sec, insn->offset);
2114 static int read_retpoline_hints(struct objtool_file *file)
2116 struct section *sec;
2117 struct instruction *insn;
2118 struct reloc *reloc;
2120 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
2124 list_for_each_entry(reloc, &sec->reloc_list, list) {
2125 if (reloc->sym->type != STT_SECTION) {
2126 WARN("unexpected relocation symbol type in %s", sec->name);
2130 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2132 WARN("bad .discard.retpoline_safe entry");
2136 if (insn->type != INSN_JUMP_DYNAMIC &&
2137 insn->type != INSN_CALL_DYNAMIC &&
2138 insn->type != INSN_RETURN &&
2139 insn->type != INSN_NOP) {
2140 WARN_FUNC("retpoline_safe hint not an indirect jump/call/ret/nop",
2141 insn->sec, insn->offset);
2145 insn->retpoline_safe = true;
2151 static int read_instr_hints(struct objtool_file *file)
2153 struct section *sec;
2154 struct instruction *insn;
2155 struct reloc *reloc;
2157 sec = find_section_by_name(file->elf, ".rela.discard.instr_end");
2161 list_for_each_entry(reloc, &sec->reloc_list, list) {
2162 if (reloc->sym->type != STT_SECTION) {
2163 WARN("unexpected relocation symbol type in %s", sec->name);
2167 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2169 WARN("bad .discard.instr_end entry");
2176 sec = find_section_by_name(file->elf, ".rela.discard.instr_begin");
2180 list_for_each_entry(reloc, &sec->reloc_list, list) {
2181 if (reloc->sym->type != STT_SECTION) {
2182 WARN("unexpected relocation symbol type in %s", sec->name);
2186 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2188 WARN("bad .discard.instr_begin entry");
2198 static int read_intra_function_calls(struct objtool_file *file)
2200 struct instruction *insn;
2201 struct section *sec;
2202 struct reloc *reloc;
2204 sec = find_section_by_name(file->elf, ".rela.discard.intra_function_calls");
2208 list_for_each_entry(reloc, &sec->reloc_list, list) {
2209 unsigned long dest_off;
2211 if (reloc->sym->type != STT_SECTION) {
2212 WARN("unexpected relocation symbol type in %s",
2217 insn = find_insn(file, reloc->sym->sec, reloc->addend);
2219 WARN("bad .discard.intra_function_call entry");
2223 if (insn->type != INSN_CALL) {
2224 WARN_FUNC("intra_function_call not a direct call",
2225 insn->sec, insn->offset);
2230 * Treat intra-function CALLs as JMPs, but with a stack_op.
2231 * See add_call_destinations(), which strips stack_ops from
2234 insn->type = INSN_JUMP_UNCONDITIONAL;
2236 dest_off = insn->offset + insn->len + insn->immediate;
2237 insn->jump_dest = find_insn(file, insn->sec, dest_off);
2238 if (!insn->jump_dest) {
2239 WARN_FUNC("can't find call dest at %s+0x%lx",
2240 insn->sec, insn->offset,
2241 insn->sec->name, dest_off);
2250 * Return true if name matches an instrumentation function, where calls to that
2251 * function from noinstr code can safely be removed, but compilers won't do so.
2253 static bool is_profiling_func(const char *name)
2256 * Many compilers cannot disable KCOV with a function attribute.
2258 if (!strncmp(name, "__sanitizer_cov_", 16))
2262 * Some compilers currently do not remove __tsan_func_entry/exit nor
2263 * __tsan_atomic_signal_fence (used for barrier instrumentation) with
2264 * the __no_sanitize_thread attribute, remove them. Once the kernel's
2265 * minimum Clang version is 14.0, this can be removed.
2267 if (!strncmp(name, "__tsan_func_", 12) ||
2268 !strcmp(name, "__tsan_atomic_signal_fence"))
2274 static int classify_symbols(struct objtool_file *file)
2276 struct section *sec;
2277 struct symbol *func;
2279 for_each_sec(file, sec) {
2280 list_for_each_entry(func, &sec->symbol_list, list) {
2281 if (func->bind != STB_GLOBAL)
2284 if (!strncmp(func->name, STATIC_CALL_TRAMP_PREFIX_STR,
2285 strlen(STATIC_CALL_TRAMP_PREFIX_STR)))
2286 func->static_call_tramp = true;
2288 if (arch_is_retpoline(func))
2289 func->retpoline_thunk = true;
2291 if (arch_is_rethunk(func))
2292 func->return_thunk = true;
2294 if (!strcmp(func->name, "__fentry__"))
2295 func->fentry = true;
2297 if (is_profiling_func(func->name))
2298 func->profiling_func = true;
2305 static void mark_rodata(struct objtool_file *file)
2307 struct section *sec;
2311 * Search for the following rodata sections, each of which can
2312 * potentially contain jump tables:
2314 * - .rodata: can contain GCC switch tables
2315 * - .rodata.<func>: same, if -fdata-sections is being used
2316 * - .rodata..c_jump_table: contains C annotated jump tables
2318 * .rodata.str1.* sections are ignored; they don't contain jump tables.
2320 for_each_sec(file, sec) {
2321 if (!strncmp(sec->name, ".rodata", 7) &&
2322 !strstr(sec->name, ".str1.")) {
2328 file->rodata = found;
2331 static int decode_sections(struct objtool_file *file)
2337 ret = init_pv_ops(file);
2341 ret = decode_instructions(file);
2346 add_uaccess_safe(file);
2348 ret = add_ignore_alternatives(file);
2353 * Must be before read_unwind_hints() since that needs insn->noendbr.
2355 ret = read_noendbr_hints(file);
2360 * Must be before add_{jump_call}_destination.
2362 ret = classify_symbols(file);
2367 * Must be before add_jump_destinations(), which depends on 'func'
2368 * being set for alternatives, to enable proper sibling call detection.
2370 ret = add_special_section_alts(file);
2374 ret = add_jump_destinations(file);
2379 * Must be before add_call_destination(); it changes INSN_CALL to
2382 ret = read_intra_function_calls(file);
2386 ret = add_call_destinations(file);
2391 * Must be after add_call_destinations() such that it can override
2392 * dead_end_function() marks.
2394 ret = add_dead_ends(file);
2398 ret = add_jump_table_alts(file);
2402 ret = read_unwind_hints(file);
2406 ret = read_retpoline_hints(file);
2410 ret = read_instr_hints(file);
2417 static bool is_fentry_call(struct instruction *insn)
2419 if (insn->type == INSN_CALL &&
2421 insn->call_dest->fentry)
2427 static bool has_modified_stack_frame(struct instruction *insn, struct insn_state *state)
2429 struct cfi_state *cfi = &state->cfi;
2432 if (cfi->cfa.base != initial_func_cfi.cfa.base || cfi->drap)
2435 if (cfi->cfa.offset != initial_func_cfi.cfa.offset)
2438 if (cfi->stack_size != initial_func_cfi.cfa.offset)
2441 for (i = 0; i < CFI_NUM_REGS; i++) {
2442 if (cfi->regs[i].base != initial_func_cfi.regs[i].base ||
2443 cfi->regs[i].offset != initial_func_cfi.regs[i].offset)
2450 static bool check_reg_frame_pos(const struct cfi_reg *reg,
2451 int expected_offset)
2453 return reg->base == CFI_CFA &&
2454 reg->offset == expected_offset;
2457 static bool has_valid_stack_frame(struct insn_state *state)
2459 struct cfi_state *cfi = &state->cfi;
2461 if (cfi->cfa.base == CFI_BP &&
2462 check_reg_frame_pos(&cfi->regs[CFI_BP], -cfi->cfa.offset) &&
2463 check_reg_frame_pos(&cfi->regs[CFI_RA], -cfi->cfa.offset + 8))
2466 if (cfi->drap && cfi->regs[CFI_BP].base == CFI_BP)
2472 static int update_cfi_state_regs(struct instruction *insn,
2473 struct cfi_state *cfi,
2474 struct stack_op *op)
2476 struct cfi_reg *cfa = &cfi->cfa;
2478 if (cfa->base != CFI_SP && cfa->base != CFI_SP_INDIRECT)
2482 if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
2486 if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
2489 /* add immediate to sp */
2490 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
2491 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
2492 cfa->offset -= op->src.offset;
2497 static void save_reg(struct cfi_state *cfi, unsigned char reg, int base, int offset)
2499 if (arch_callee_saved_reg(reg) &&
2500 cfi->regs[reg].base == CFI_UNDEFINED) {
2501 cfi->regs[reg].base = base;
2502 cfi->regs[reg].offset = offset;
2506 static void restore_reg(struct cfi_state *cfi, unsigned char reg)
2508 cfi->regs[reg].base = initial_func_cfi.regs[reg].base;
2509 cfi->regs[reg].offset = initial_func_cfi.regs[reg].offset;
2513 * A note about DRAP stack alignment:
2515 * GCC has the concept of a DRAP register, which is used to help keep track of
2516 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
2517 * register. The typical DRAP pattern is:
2519 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
2520 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
2521 * 41 ff 72 f8 pushq -0x8(%r10)
2523 * 48 89 e5 mov %rsp,%rbp
2530 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2533 * There are some variations in the epilogues, like:
2541 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2546 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
2547 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
2548 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
2549 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
2551 * 49 8d 62 f8 lea -0x8(%r10),%rsp
2554 * Sometimes r13 is used as the DRAP register, in which case it's saved and
2555 * restored beforehand:
2558 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
2559 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
2561 * 49 8d 65 f0 lea -0x10(%r13),%rsp
2565 static int update_cfi_state(struct instruction *insn,
2566 struct instruction *next_insn,
2567 struct cfi_state *cfi, struct stack_op *op)
2569 struct cfi_reg *cfa = &cfi->cfa;
2570 struct cfi_reg *regs = cfi->regs;
2572 /* stack operations don't make sense with an undefined CFA */
2573 if (cfa->base == CFI_UNDEFINED) {
2575 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
2581 if (cfi->type == UNWIND_HINT_TYPE_REGS ||
2582 cfi->type == UNWIND_HINT_TYPE_REGS_PARTIAL)
2583 return update_cfi_state_regs(insn, cfi, op);
2585 switch (op->dest.type) {
2588 switch (op->src.type) {
2591 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
2592 cfa->base == CFI_SP &&
2593 check_reg_frame_pos(®s[CFI_BP], -cfa->offset)) {
2595 /* mov %rsp, %rbp */
2596 cfa->base = op->dest.reg;
2597 cfi->bp_scratch = false;
2600 else if (op->src.reg == CFI_SP &&
2601 op->dest.reg == CFI_BP && cfi->drap) {
2603 /* drap: mov %rsp, %rbp */
2604 regs[CFI_BP].base = CFI_BP;
2605 regs[CFI_BP].offset = -cfi->stack_size;
2606 cfi->bp_scratch = false;
2609 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2614 * This is needed for the rare case where GCC
2621 cfi->vals[op->dest.reg].base = CFI_CFA;
2622 cfi->vals[op->dest.reg].offset = -cfi->stack_size;
2625 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
2626 (cfa->base == CFI_BP || cfa->base == cfi->drap_reg)) {
2631 * Restore the original stack pointer (Clang).
2633 cfi->stack_size = -cfi->regs[CFI_BP].offset;
2636 else if (op->dest.reg == cfa->base) {
2638 /* mov %reg, %rsp */
2639 if (cfa->base == CFI_SP &&
2640 cfi->vals[op->src.reg].base == CFI_CFA) {
2643 * This is needed for the rare case
2644 * where GCC does something dumb like:
2646 * lea 0x8(%rsp), %rcx
2650 cfa->offset = -cfi->vals[op->src.reg].offset;
2651 cfi->stack_size = cfa->offset;
2653 } else if (cfa->base == CFI_SP &&
2654 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2655 cfi->vals[op->src.reg].offset == cfa->offset) {
2660 * 1: mov %rsp, (%[tos])
2661 * 2: mov %[tos], %rsp
2667 * 1 - places a pointer to the previous
2668 * stack at the Top-of-Stack of the
2671 * 2 - switches to the new stack.
2673 * 3 - pops the Top-of-Stack to restore
2674 * the original stack.
2676 * Note: we set base to SP_INDIRECT
2677 * here and preserve offset. Therefore
2678 * when the unwinder reaches ToS it
2679 * will dereference SP and then add the
2680 * offset to find the next frame, IOW:
2683 cfa->base = CFI_SP_INDIRECT;
2686 cfa->base = CFI_UNDEFINED;
2691 else if (op->dest.reg == CFI_SP &&
2692 cfi->vals[op->src.reg].base == CFI_SP_INDIRECT &&
2693 cfi->vals[op->src.reg].offset == cfa->offset) {
2696 * The same stack swizzle case 2) as above. But
2697 * because we can't change cfa->base, case 3)
2698 * will become a regular POP. Pretend we're a
2699 * PUSH so things don't go unbalanced.
2701 cfi->stack_size += 8;
2708 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
2711 cfi->stack_size -= op->src.offset;
2712 if (cfa->base == CFI_SP)
2713 cfa->offset -= op->src.offset;
2717 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
2719 /* lea disp(%rbp), %rsp */
2720 cfi->stack_size = -(op->src.offset + regs[CFI_BP].offset);
2724 if (!cfi->drap && op->src.reg == CFI_SP &&
2725 op->dest.reg == CFI_BP && cfa->base == CFI_SP &&
2726 check_reg_frame_pos(®s[CFI_BP], -cfa->offset + op->src.offset)) {
2728 /* lea disp(%rsp), %rbp */
2730 cfa->offset -= op->src.offset;
2731 cfi->bp_scratch = false;
2735 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
2737 /* drap: lea disp(%rsp), %drap */
2738 cfi->drap_reg = op->dest.reg;
2741 * lea disp(%rsp), %reg
2743 * This is needed for the rare case where GCC
2744 * does something dumb like:
2746 * lea 0x8(%rsp), %rcx
2750 cfi->vals[op->dest.reg].base = CFI_CFA;
2751 cfi->vals[op->dest.reg].offset = \
2752 -cfi->stack_size + op->src.offset;
2757 if (cfi->drap && op->dest.reg == CFI_SP &&
2758 op->src.reg == cfi->drap_reg) {
2760 /* drap: lea disp(%drap), %rsp */
2762 cfa->offset = cfi->stack_size = -op->src.offset;
2763 cfi->drap_reg = CFI_UNDEFINED;
2768 if (op->dest.reg == cfi->cfa.base && !(next_insn && next_insn->hint)) {
2769 WARN_FUNC("unsupported stack register modification",
2770 insn->sec, insn->offset);
2777 if (op->dest.reg != CFI_SP ||
2778 (cfi->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
2779 (cfi->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
2780 WARN_FUNC("unsupported stack pointer realignment",
2781 insn->sec, insn->offset);
2785 if (cfi->drap_reg != CFI_UNDEFINED) {
2786 /* drap: and imm, %rsp */
2787 cfa->base = cfi->drap_reg;
2788 cfa->offset = cfi->stack_size = 0;
2793 * Older versions of GCC (4.8ish) realign the stack
2794 * without DRAP, with a frame pointer.
2801 if (op->dest.reg == CFI_SP && cfa->base == CFI_SP_INDIRECT) {
2803 /* pop %rsp; # restore from a stack swizzle */
2808 if (!cfi->drap && op->dest.reg == cfa->base) {
2814 if (cfi->drap && cfa->base == CFI_BP_INDIRECT &&
2815 op->dest.reg == cfi->drap_reg &&
2816 cfi->drap_offset == -cfi->stack_size) {
2818 /* drap: pop %drap */
2819 cfa->base = cfi->drap_reg;
2821 cfi->drap_offset = -1;
2823 } else if (cfi->stack_size == -regs[op->dest.reg].offset) {
2826 restore_reg(cfi, op->dest.reg);
2829 cfi->stack_size -= 8;
2830 if (cfa->base == CFI_SP)
2835 case OP_SRC_REG_INDIRECT:
2836 if (!cfi->drap && op->dest.reg == cfa->base &&
2837 op->dest.reg == CFI_BP) {
2839 /* mov disp(%rsp), %rbp */
2841 cfa->offset = cfi->stack_size;
2844 if (cfi->drap && op->src.reg == CFI_BP &&
2845 op->src.offset == cfi->drap_offset) {
2847 /* drap: mov disp(%rbp), %drap */
2848 cfa->base = cfi->drap_reg;
2850 cfi->drap_offset = -1;
2853 if (cfi->drap && op->src.reg == CFI_BP &&
2854 op->src.offset == regs[op->dest.reg].offset) {
2856 /* drap: mov disp(%rbp), %reg */
2857 restore_reg(cfi, op->dest.reg);
2859 } else if (op->src.reg == cfa->base &&
2860 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
2862 /* mov disp(%rbp), %reg */
2863 /* mov disp(%rsp), %reg */
2864 restore_reg(cfi, op->dest.reg);
2866 } else if (op->src.reg == CFI_SP &&
2867 op->src.offset == regs[op->dest.reg].offset + cfi->stack_size) {
2869 /* mov disp(%rsp), %reg */
2870 restore_reg(cfi, op->dest.reg);
2876 WARN_FUNC("unknown stack-related instruction",
2877 insn->sec, insn->offset);
2885 cfi->stack_size += 8;
2886 if (cfa->base == CFI_SP)
2889 if (op->src.type != OP_SRC_REG)
2893 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2895 /* drap: push %drap */
2896 cfa->base = CFI_BP_INDIRECT;
2897 cfa->offset = -cfi->stack_size;
2899 /* save drap so we know when to restore it */
2900 cfi->drap_offset = -cfi->stack_size;
2902 } else if (op->src.reg == CFI_BP && cfa->base == cfi->drap_reg) {
2904 /* drap: push %rbp */
2905 cfi->stack_size = 0;
2909 /* drap: push %reg */
2910 save_reg(cfi, op->src.reg, CFI_BP, -cfi->stack_size);
2916 save_reg(cfi, op->src.reg, CFI_CFA, -cfi->stack_size);
2919 /* detect when asm code uses rbp as a scratch register */
2920 if (opts.stackval && insn->func && op->src.reg == CFI_BP &&
2921 cfa->base != CFI_BP)
2922 cfi->bp_scratch = true;
2925 case OP_DEST_REG_INDIRECT:
2928 if (op->src.reg == cfa->base && op->src.reg == cfi->drap_reg) {
2930 /* drap: mov %drap, disp(%rbp) */
2931 cfa->base = CFI_BP_INDIRECT;
2932 cfa->offset = op->dest.offset;
2934 /* save drap offset so we know when to restore it */
2935 cfi->drap_offset = op->dest.offset;
2938 /* drap: mov reg, disp(%rbp) */
2939 save_reg(cfi, op->src.reg, CFI_BP, op->dest.offset);
2942 } else if (op->dest.reg == cfa->base) {
2944 /* mov reg, disp(%rbp) */
2945 /* mov reg, disp(%rsp) */
2946 save_reg(cfi, op->src.reg, CFI_CFA,
2947 op->dest.offset - cfi->cfa.offset);
2949 } else if (op->dest.reg == CFI_SP) {
2951 /* mov reg, disp(%rsp) */
2952 save_reg(cfi, op->src.reg, CFI_CFA,
2953 op->dest.offset - cfi->stack_size);
2955 } else if (op->src.reg == CFI_SP && op->dest.offset == 0) {
2957 /* mov %rsp, (%reg); # setup a stack swizzle. */
2958 cfi->vals[op->dest.reg].base = CFI_SP_INDIRECT;
2959 cfi->vals[op->dest.reg].offset = cfa->offset;
2965 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
2966 WARN_FUNC("unknown stack-related memory operation",
2967 insn->sec, insn->offset);
2972 cfi->stack_size -= 8;
2973 if (cfa->base == CFI_SP)
2979 WARN_FUNC("unknown stack-related instruction",
2980 insn->sec, insn->offset);
2988 * The stack layouts of alternatives instructions can sometimes diverge when
2989 * they have stack modifications. That's fine as long as the potential stack
2990 * layouts don't conflict at any given potential instruction boundary.
2992 * Flatten the CFIs of the different alternative code streams (both original
2993 * and replacement) into a single shared CFI array which can be used to detect
2994 * conflicts and nicely feed a linear array of ORC entries to the unwinder.
2996 static int propagate_alt_cfi(struct objtool_file *file, struct instruction *insn)
2998 struct cfi_state **alt_cfi;
3001 if (!insn->alt_group)
3005 WARN("CFI missing");
3009 alt_cfi = insn->alt_group->cfi;
3010 group_off = insn->offset - insn->alt_group->first_insn->offset;
3012 if (!alt_cfi[group_off]) {
3013 alt_cfi[group_off] = insn->cfi;
3015 if (cficmp(alt_cfi[group_off], insn->cfi)) {
3016 WARN_FUNC("stack layout conflict in alternatives",
3017 insn->sec, insn->offset);
3025 static int handle_insn_ops(struct instruction *insn,
3026 struct instruction *next_insn,
3027 struct insn_state *state)
3029 struct stack_op *op;
3031 list_for_each_entry(op, &insn->stack_ops, list) {
3033 if (update_cfi_state(insn, next_insn, &state->cfi, op))
3036 if (!insn->alt_group)
3039 if (op->dest.type == OP_DEST_PUSHF) {
3040 if (!state->uaccess_stack) {
3041 state->uaccess_stack = 1;
3042 } else if (state->uaccess_stack >> 31) {
3043 WARN_FUNC("PUSHF stack exhausted",
3044 insn->sec, insn->offset);
3047 state->uaccess_stack <<= 1;
3048 state->uaccess_stack |= state->uaccess;
3051 if (op->src.type == OP_SRC_POPF) {
3052 if (state->uaccess_stack) {
3053 state->uaccess = state->uaccess_stack & 1;
3054 state->uaccess_stack >>= 1;
3055 if (state->uaccess_stack == 1)
3056 state->uaccess_stack = 0;
3064 static bool insn_cfi_match(struct instruction *insn, struct cfi_state *cfi2)
3066 struct cfi_state *cfi1 = insn->cfi;
3070 WARN("CFI missing");
3074 if (memcmp(&cfi1->cfa, &cfi2->cfa, sizeof(cfi1->cfa))) {
3076 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
3077 insn->sec, insn->offset,
3078 cfi1->cfa.base, cfi1->cfa.offset,
3079 cfi2->cfa.base, cfi2->cfa.offset);
3081 } else if (memcmp(&cfi1->regs, &cfi2->regs, sizeof(cfi1->regs))) {
3082 for (i = 0; i < CFI_NUM_REGS; i++) {
3083 if (!memcmp(&cfi1->regs[i], &cfi2->regs[i],
3084 sizeof(struct cfi_reg)))
3087 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
3088 insn->sec, insn->offset,
3089 i, cfi1->regs[i].base, cfi1->regs[i].offset,
3090 i, cfi2->regs[i].base, cfi2->regs[i].offset);
3094 } else if (cfi1->type != cfi2->type) {
3096 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
3097 insn->sec, insn->offset, cfi1->type, cfi2->type);
3099 } else if (cfi1->drap != cfi2->drap ||
3100 (cfi1->drap && cfi1->drap_reg != cfi2->drap_reg) ||
3101 (cfi1->drap && cfi1->drap_offset != cfi2->drap_offset)) {
3103 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
3104 insn->sec, insn->offset,
3105 cfi1->drap, cfi1->drap_reg, cfi1->drap_offset,
3106 cfi2->drap, cfi2->drap_reg, cfi2->drap_offset);
3114 static inline bool func_uaccess_safe(struct symbol *func)
3117 return func->uaccess_safe;
3122 static inline const char *call_dest_name(struct instruction *insn)
3124 static char pvname[19];
3128 if (insn->call_dest)
3129 return insn->call_dest->name;
3131 rel = insn_reloc(NULL, insn);
3132 if (rel && !strcmp(rel->sym->name, "pv_ops")) {
3133 idx = (rel->addend / sizeof(void *));
3134 snprintf(pvname, sizeof(pvname), "pv_ops[%d]", idx);
3141 static bool pv_call_dest(struct objtool_file *file, struct instruction *insn)
3143 struct symbol *target;
3147 rel = insn_reloc(file, insn);
3148 if (!rel || strcmp(rel->sym->name, "pv_ops"))
3151 idx = (arch_dest_reloc_offset(rel->addend) / sizeof(void *));
3153 if (file->pv_ops[idx].clean)
3156 file->pv_ops[idx].clean = true;
3158 list_for_each_entry(target, &file->pv_ops[idx].targets, pv_target) {
3159 if (!target->sec->noinstr) {
3160 WARN("pv_ops[%d]: %s", idx, target->name);
3161 file->pv_ops[idx].clean = false;
3165 return file->pv_ops[idx].clean;
3168 static inline bool noinstr_call_dest(struct objtool_file *file,
3169 struct instruction *insn,
3170 struct symbol *func)
3173 * We can't deal with indirect function calls at present;
3174 * assume they're instrumented.
3178 return pv_call_dest(file, insn);
3184 * If the symbol is from a noinstr section; we good.
3186 if (func->sec->noinstr)
3190 * The __ubsan_handle_*() calls are like WARN(), they only happen when
3191 * something 'BAD' happened. At the risk of taking the machine down,
3192 * let them proceed to get the message out.
3194 if (!strncmp(func->name, "__ubsan_handle_", 15))
3200 static int validate_call(struct objtool_file *file,
3201 struct instruction *insn,
3202 struct insn_state *state)
3204 if (state->noinstr && state->instr <= 0 &&
3205 !noinstr_call_dest(file, insn, insn->call_dest)) {
3206 WARN_FUNC("call to %s() leaves .noinstr.text section",
3207 insn->sec, insn->offset, call_dest_name(insn));
3211 if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
3212 WARN_FUNC("call to %s() with UACCESS enabled",
3213 insn->sec, insn->offset, call_dest_name(insn));
3218 WARN_FUNC("call to %s() with DF set",
3219 insn->sec, insn->offset, call_dest_name(insn));
3226 static int validate_sibling_call(struct objtool_file *file,
3227 struct instruction *insn,
3228 struct insn_state *state)
3230 if (has_modified_stack_frame(insn, state)) {
3231 WARN_FUNC("sibling call from callable instruction with modified stack frame",
3232 insn->sec, insn->offset);
3236 return validate_call(file, insn, state);
3239 static int validate_return(struct symbol *func, struct instruction *insn, struct insn_state *state)
3241 if (state->noinstr && state->instr > 0) {
3242 WARN_FUNC("return with instrumentation enabled",
3243 insn->sec, insn->offset);
3247 if (state->uaccess && !func_uaccess_safe(func)) {
3248 WARN_FUNC("return with UACCESS enabled",
3249 insn->sec, insn->offset);
3253 if (!state->uaccess && func_uaccess_safe(func)) {
3254 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function",
3255 insn->sec, insn->offset);
3260 WARN_FUNC("return with DF set",
3261 insn->sec, insn->offset);
3265 if (func && has_modified_stack_frame(insn, state)) {
3266 WARN_FUNC("return with modified stack frame",
3267 insn->sec, insn->offset);
3271 if (state->cfi.bp_scratch) {
3272 WARN_FUNC("BP used as a scratch register",
3273 insn->sec, insn->offset);
3280 static struct instruction *next_insn_to_validate(struct objtool_file *file,
3281 struct instruction *insn)
3283 struct alt_group *alt_group = insn->alt_group;
3286 * Simulate the fact that alternatives are patched in-place. When the
3287 * end of a replacement alt_group is reached, redirect objtool flow to
3288 * the end of the original alt_group.
3290 if (alt_group && insn == alt_group->last_insn && alt_group->orig_group)
3291 return next_insn_same_sec(file, alt_group->orig_group->last_insn);
3293 return next_insn_same_sec(file, insn);
3297 * Follow the branch starting at the given instruction, and recursively follow
3298 * any other branches (jumps). Meanwhile, track the frame pointer state at
3299 * each instruction and validate all the rules described in
3300 * tools/objtool/Documentation/objtool.txt.
3302 static int validate_branch(struct objtool_file *file, struct symbol *func,
3303 struct instruction *insn, struct insn_state state)
3305 struct alternative *alt;
3306 struct instruction *next_insn, *prev_insn = NULL;
3307 struct section *sec;
3314 next_insn = next_insn_to_validate(file, insn);
3316 if (func && insn->func && func != insn->func->pfunc) {
3317 WARN("%s() falls through to next function %s()",
3318 func->name, insn->func->name);
3322 if (func && insn->ignore) {
3323 WARN_FUNC("BUG: why am I validating an ignored function?",
3328 visited = VISITED_BRANCH << state.uaccess;
3329 if (insn->visited & VISITED_BRANCH_MASK) {
3330 if (!insn->hint && !insn_cfi_match(insn, &state.cfi))
3333 if (insn->visited & visited)
3340 state.instr += insn->instr;
3343 if (insn->restore) {
3344 struct instruction *save_insn, *i;
3349 sym_for_each_insn_continue_reverse(file, func, i) {
3357 WARN_FUNC("no corresponding CFI save for CFI restore",
3362 if (!save_insn->visited) {
3363 WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
3368 insn->cfi = save_insn->cfi;
3372 state.cfi = *insn->cfi;
3374 /* XXX track if we actually changed state.cfi */
3376 if (prev_insn && !cficmp(prev_insn->cfi, &state.cfi)) {
3377 insn->cfi = prev_insn->cfi;
3380 insn->cfi = cfi_hash_find_or_add(&state.cfi);
3384 insn->visited |= visited;
3386 if (propagate_alt_cfi(file, insn))
3389 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3390 bool skip_orig = false;
3392 list_for_each_entry(alt, &insn->alts, list) {
3396 ret = validate_branch(file, func, alt->insn, state);
3399 BT_FUNC("(alt)", insn);
3408 if (handle_insn_ops(insn, next_insn, &state))
3411 switch (insn->type) {
3414 return validate_return(func, insn, &state);
3417 case INSN_CALL_DYNAMIC:
3418 ret = validate_call(file, insn, &state);
3422 if (opts.stackval && func && !is_fentry_call(insn) &&
3423 !has_valid_stack_frame(&state)) {
3424 WARN_FUNC("call without frame pointer save/setup",
3434 case INSN_JUMP_CONDITIONAL:
3435 case INSN_JUMP_UNCONDITIONAL:
3436 if (is_sibling_call(insn)) {
3437 ret = validate_sibling_call(file, insn, &state);
3441 } else if (insn->jump_dest) {
3442 ret = validate_branch(file, func,
3443 insn->jump_dest, state);
3446 BT_FUNC("(branch)", insn);
3451 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3456 case INSN_JUMP_DYNAMIC:
3457 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3458 if (is_sibling_call(insn)) {
3459 ret = validate_sibling_call(file, insn, &state);
3464 if (insn->type == INSN_JUMP_DYNAMIC)
3469 case INSN_CONTEXT_SWITCH:
3470 if (func && (!next_insn || !next_insn->hint)) {
3471 WARN_FUNC("unsupported instruction in callable function",
3478 if (state.uaccess) {
3479 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
3483 state.uaccess = true;
3487 if (!state.uaccess && func) {
3488 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
3492 if (func_uaccess_safe(func) && !state.uaccess_stack) {
3493 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
3497 state.uaccess = false;
3502 WARN_FUNC("recursive STD", sec, insn->offset);
3510 if (!state.df && func) {
3511 WARN_FUNC("redundant CLD", sec, insn->offset);
3526 if (state.cfi.cfa.base == CFI_UNDEFINED)
3528 WARN("%s: unexpected end of section", sec->name);
3539 static int validate_unwind_hints(struct objtool_file *file, struct section *sec)
3541 struct instruction *insn;
3542 struct insn_state state;
3543 int ret, warnings = 0;
3548 init_insn_state(file, &state, sec);
3551 insn = find_insn(file, sec, 0);
3555 insn = list_first_entry(&file->insn_list, typeof(*insn), list);
3558 while (&insn->list != &file->insn_list && (!sec || insn->sec == sec)) {
3559 if (insn->hint && !insn->visited && !insn->ignore) {
3560 ret = validate_branch(file, insn->func, insn, state);
3561 if (ret && opts.backtrace)
3562 BT_FUNC("<=== (hint)", insn);
3566 insn = list_next_entry(insn, list);
3573 * Validate rethunk entry constraint: must untrain RET before the first RET.
3575 * Follow every branch (intra-function) and ensure ANNOTATE_UNRET_END comes
3576 * before an actual RET instruction.
3578 static int validate_entry(struct objtool_file *file, struct instruction *insn)
3580 struct instruction *next, *dest;
3581 int ret, warnings = 0;
3584 next = next_insn_to_validate(file, insn);
3586 if (insn->visited & VISITED_ENTRY)
3589 insn->visited |= VISITED_ENTRY;
3591 if (!insn->ignore_alts && !list_empty(&insn->alts)) {
3592 struct alternative *alt;
3593 bool skip_orig = false;
3595 list_for_each_entry(alt, &insn->alts, list) {
3599 ret = validate_entry(file, alt->insn);
3602 BT_FUNC("(alt)", insn);
3611 switch (insn->type) {
3613 case INSN_CALL_DYNAMIC:
3614 case INSN_JUMP_DYNAMIC:
3615 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3616 WARN_FUNC("early indirect call", insn->sec, insn->offset);
3619 case INSN_JUMP_UNCONDITIONAL:
3620 case INSN_JUMP_CONDITIONAL:
3621 if (!is_sibling_call(insn)) {
3622 if (!insn->jump_dest) {
3623 WARN_FUNC("unresolved jump target after linking?!?",
3624 insn->sec, insn->offset);
3627 ret = validate_entry(file, insn->jump_dest);
3629 if (opts.backtrace) {
3630 BT_FUNC("(branch%s)", insn,
3631 insn->type == INSN_JUMP_CONDITIONAL ? "-cond" : "");
3636 if (insn->type == INSN_JUMP_UNCONDITIONAL)
3644 dest = find_insn(file, insn->call_dest->sec,
3645 insn->call_dest->offset);
3647 WARN("Unresolved function after linking!?: %s",
3648 insn->call_dest->name);
3652 ret = validate_entry(file, dest);
3655 BT_FUNC("(call)", insn);
3659 * If a call returns without error, it must have seen UNTRAIN_RET.
3660 * Therefore any non-error return is a success.
3665 WARN_FUNC("RET before UNTRAIN", insn->sec, insn->offset);
3669 if (insn->retpoline_safe)
3678 WARN_FUNC("teh end!", insn->sec, insn->offset);
3688 * Validate that all branches starting at 'insn->entry' encounter UNRET_END
3691 static int validate_unret(struct objtool_file *file)
3693 struct instruction *insn;
3694 int ret, warnings = 0;
3696 for_each_insn(file, insn) {
3700 ret = validate_entry(file, insn);
3702 WARN_FUNC("Failed UNRET validation", insn->sec, insn->offset);
3711 static int validate_retpoline(struct objtool_file *file)
3713 struct instruction *insn;
3716 for_each_insn(file, insn) {
3717 if (insn->type != INSN_JUMP_DYNAMIC &&
3718 insn->type != INSN_CALL_DYNAMIC &&
3719 insn->type != INSN_RETURN)
3722 if (insn->retpoline_safe)
3726 * .init.text code is ran before userspace and thus doesn't
3727 * strictly need retpolines, except for modules which are
3728 * loaded late, they very much do need retpoline in their
3731 if (!strcmp(insn->sec->name, ".init.text") && !opts.module)
3734 if (insn->type == INSN_RETURN) {
3736 WARN_FUNC("'naked' return found in RETHUNK build",
3737 insn->sec, insn->offset);
3741 WARN_FUNC("indirect %s found in RETPOLINE build",
3742 insn->sec, insn->offset,
3743 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
3752 static bool is_kasan_insn(struct instruction *insn)
3754 return (insn->type == INSN_CALL &&
3755 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
3758 static bool is_ubsan_insn(struct instruction *insn)
3760 return (insn->type == INSN_CALL &&
3761 !strcmp(insn->call_dest->name,
3762 "__ubsan_handle_builtin_unreachable"));
3765 static bool ignore_unreachable_insn(struct objtool_file *file, struct instruction *insn)
3768 struct instruction *prev_insn;
3770 if (insn->ignore || insn->type == INSN_NOP || insn->type == INSN_TRAP)
3774 * Ignore alternative replacement instructions. This can happen
3775 * when a whitelisted function uses one of the ALTERNATIVE macros.
3777 if (!strcmp(insn->sec->name, ".altinstr_replacement") ||
3778 !strcmp(insn->sec->name, ".altinstr_aux"))
3782 * Whole archive runs might encounter dead code from weak symbols.
3783 * This is where the linker will have dropped the weak symbol in
3784 * favour of a regular symbol, but leaves the code in place.
3786 * In this case we'll find a piece of code (whole function) that is not
3787 * covered by a !section symbol. Ignore them.
3789 if (opts.link && !insn->func) {
3790 int size = find_symbol_hole_containing(insn->sec, insn->offset);
3791 unsigned long end = insn->offset + size;
3793 if (!size) /* not a hole */
3796 if (size < 0) /* hole until the end */
3799 sec_for_each_insn_continue(file, insn) {
3801 * If we reach a visited instruction at or before the
3802 * end of the hole, ignore the unreachable.
3807 if (insn->offset >= end)
3811 * If this hole jumps to a .cold function, mark it ignore too.
3813 if (insn->jump_dest && insn->jump_dest->func &&
3814 strstr(insn->jump_dest->func->name, ".cold")) {
3815 struct instruction *dest = insn->jump_dest;
3816 func_for_each_insn(file, dest->func, dest)
3817 dest->ignore = true;
3827 if (insn->func->static_call_tramp)
3831 * CONFIG_UBSAN_TRAP inserts a UD2 when it sees
3832 * __builtin_unreachable(). The BUG() macro has an unreachable() after
3833 * the UD2, which causes GCC's undefined trap logic to emit another UD2
3834 * (or occasionally a JMP to UD2).
3836 * It may also insert a UD2 after calling a __noreturn function.
3838 prev_insn = list_prev_entry(insn, list);
3839 if ((prev_insn->dead_end || dead_end_function(file, prev_insn->call_dest)) &&
3840 (insn->type == INSN_BUG ||
3841 (insn->type == INSN_JUMP_UNCONDITIONAL &&
3842 insn->jump_dest && insn->jump_dest->type == INSN_BUG)))
3846 * Check if this (or a subsequent) instruction is related to
3847 * CONFIG_UBSAN or CONFIG_KASAN.
3849 * End the search at 5 instructions to avoid going into the weeds.
3851 for (i = 0; i < 5; i++) {
3853 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
3856 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
3857 if (insn->jump_dest &&
3858 insn->jump_dest->func == insn->func) {
3859 insn = insn->jump_dest;
3866 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
3869 insn = list_next_entry(insn, list);
3875 static int validate_symbol(struct objtool_file *file, struct section *sec,
3876 struct symbol *sym, struct insn_state *state)
3878 struct instruction *insn;
3882 WARN("%s() is missing an ELF size annotation", sym->name);
3886 if (sym->pfunc != sym || sym->alias != sym)
3889 insn = find_insn(file, sec, sym->offset);
3890 if (!insn || insn->ignore || insn->visited)
3893 state->uaccess = sym->uaccess_safe;
3895 ret = validate_branch(file, insn->func, insn, *state);
3896 if (ret && opts.backtrace)
3897 BT_FUNC("<=== (sym)", insn);
3901 static int validate_section(struct objtool_file *file, struct section *sec)
3903 struct insn_state state;
3904 struct symbol *func;
3907 list_for_each_entry(func, &sec->symbol_list, list) {
3908 if (func->type != STT_FUNC)
3911 init_insn_state(file, &state, sec);
3912 set_func_state(&state.cfi);
3914 warnings += validate_symbol(file, sec, func, &state);
3920 static int validate_noinstr_sections(struct objtool_file *file)
3922 struct section *sec;
3925 sec = find_section_by_name(file->elf, ".noinstr.text");
3927 warnings += validate_section(file, sec);
3928 warnings += validate_unwind_hints(file, sec);
3931 sec = find_section_by_name(file->elf, ".entry.text");
3933 warnings += validate_section(file, sec);
3934 warnings += validate_unwind_hints(file, sec);
3940 static int validate_functions(struct objtool_file *file)
3942 struct section *sec;
3945 for_each_sec(file, sec) {
3946 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
3949 warnings += validate_section(file, sec);
3955 static void mark_endbr_used(struct instruction *insn)
3957 if (!list_empty(&insn->call_node))
3958 list_del_init(&insn->call_node);
3961 static int validate_ibt_insn(struct objtool_file *file, struct instruction *insn)
3963 struct instruction *dest;
3964 struct reloc *reloc;
3969 * Looking for function pointer load relocations. Ignore
3970 * direct/indirect branches:
3972 switch (insn->type) {
3974 case INSN_CALL_DYNAMIC:
3975 case INSN_JUMP_CONDITIONAL:
3976 case INSN_JUMP_UNCONDITIONAL:
3977 case INSN_JUMP_DYNAMIC:
3978 case INSN_JUMP_DYNAMIC_CONDITIONAL:
3986 for (reloc = insn_reloc(file, insn);
3988 reloc = find_reloc_by_dest_range(file->elf, insn->sec,
3990 (insn->offset + insn->len) - (reloc->offset + 1))) {
3993 * static_call_update() references the trampoline, which
3994 * doesn't have (or need) ENDBR. Skip warning in that case.
3996 if (reloc->sym->static_call_tramp)
3999 off = reloc->sym->offset;
4000 if (reloc->type == R_X86_64_PC32 || reloc->type == R_X86_64_PLT32)
4001 off += arch_dest_reloc_offset(reloc->addend);
4003 off += reloc->addend;
4005 dest = find_insn(file, reloc->sym->sec, off);
4009 if (dest->type == INSN_ENDBR) {
4010 mark_endbr_used(dest);
4014 if (dest->func && dest->func == insn->func) {
4016 * Anything from->to self is either _THIS_IP_ or
4019 * There is no sane way to annotate _THIS_IP_ since the
4020 * compiler treats the relocation as a constant and is
4021 * happy to fold in offsets, skewing any annotation we
4022 * do, leading to vast amounts of false-positives.
4024 * There's also compiler generated _THIS_IP_ through
4025 * KCOV and such which we have no hope of annotating.
4027 * As such, blanket accept self-references without
4036 WARN_FUNC("relocation to !ENDBR: %s",
4037 insn->sec, insn->offset,
4038 offstr(dest->sec, dest->offset));
4046 static int validate_ibt_data_reloc(struct objtool_file *file,
4047 struct reloc *reloc)
4049 struct instruction *dest;
4051 dest = find_insn(file, reloc->sym->sec,
4052 reloc->sym->offset + reloc->addend);
4056 if (dest->type == INSN_ENDBR) {
4057 mark_endbr_used(dest);
4064 WARN_FUNC("data relocation to !ENDBR: %s",
4065 reloc->sec->base, reloc->offset,
4066 offstr(dest->sec, dest->offset));
4072 * Validate IBT rules and remove used ENDBR instructions from the seal list.
4073 * Unused ENDBR instructions will be annotated for sealing (i.e., replaced with
4074 * NOPs) later, in create_ibt_endbr_seal_sections().
4076 static int validate_ibt(struct objtool_file *file)
4078 struct section *sec;
4079 struct reloc *reloc;
4080 struct instruction *insn;
4083 for_each_insn(file, insn)
4084 warnings += validate_ibt_insn(file, insn);
4086 for_each_sec(file, sec) {
4088 /* Already done by validate_ibt_insn() */
4089 if (sec->sh.sh_flags & SHF_EXECINSTR)
4096 * These sections can reference text addresses, but not with
4097 * the intent to indirect branch to them.
4099 if ((!strncmp(sec->name, ".discard", 8) &&
4100 strcmp(sec->name, ".discard.ibt_endbr_noseal")) ||
4101 !strncmp(sec->name, ".debug", 6) ||
4102 !strcmp(sec->name, ".altinstructions") ||
4103 !strcmp(sec->name, ".ibt_endbr_seal") ||
4104 !strcmp(sec->name, ".orc_unwind_ip") ||
4105 !strcmp(sec->name, ".parainstructions") ||
4106 !strcmp(sec->name, ".retpoline_sites") ||
4107 !strcmp(sec->name, ".smp_locks") ||
4108 !strcmp(sec->name, ".static_call_sites") ||
4109 !strcmp(sec->name, "_error_injection_whitelist") ||
4110 !strcmp(sec->name, "_kprobe_blacklist") ||
4111 !strcmp(sec->name, "__bug_table") ||
4112 !strcmp(sec->name, "__ex_table") ||
4113 !strcmp(sec->name, "__jump_table") ||
4114 !strcmp(sec->name, "__mcount_loc"))
4117 list_for_each_entry(reloc, &sec->reloc->reloc_list, list)
4118 warnings += validate_ibt_data_reloc(file, reloc);
4124 static int validate_sls(struct objtool_file *file)
4126 struct instruction *insn, *next_insn;
4129 for_each_insn(file, insn) {
4130 next_insn = next_insn_same_sec(file, insn);
4132 if (insn->retpoline_safe)
4135 switch (insn->type) {
4137 if (!next_insn || next_insn->type != INSN_TRAP) {
4138 WARN_FUNC("missing int3 after ret",
4139 insn->sec, insn->offset);
4144 case INSN_JUMP_DYNAMIC:
4145 if (!next_insn || next_insn->type != INSN_TRAP) {
4146 WARN_FUNC("missing int3 after indirect jump",
4147 insn->sec, insn->offset);
4159 static int validate_reachable_instructions(struct objtool_file *file)
4161 struct instruction *insn;
4163 if (file->ignore_unreachables)
4166 for_each_insn(file, insn) {
4167 if (insn->visited || ignore_unreachable_insn(file, insn))
4170 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
4177 int check(struct objtool_file *file)
4179 int ret, warnings = 0;
4181 arch_initial_func_cfi_state(&initial_func_cfi);
4182 init_cfi_state(&init_cfi);
4183 init_cfi_state(&func_cfi);
4184 set_func_state(&func_cfi);
4186 if (!cfi_hash_alloc(1UL << (file->elf->symbol_bits - 3)))
4189 cfi_hash_add(&init_cfi);
4190 cfi_hash_add(&func_cfi);
4192 ret = decode_sections(file);
4198 if (list_empty(&file->insn_list))
4201 if (opts.retpoline) {
4202 ret = validate_retpoline(file);
4208 if (opts.stackval || opts.orc || opts.uaccess) {
4209 ret = validate_functions(file);
4214 ret = validate_unwind_hints(file, NULL);
4220 ret = validate_reachable_instructions(file);
4226 } else if (opts.noinstr) {
4227 ret = validate_noinstr_sections(file);
4235 * Must be after validate_branch() and friends, it plays
4236 * further games with insn->visited.
4238 ret = validate_unret(file);
4245 ret = validate_ibt(file);
4252 ret = validate_sls(file);
4258 if (opts.static_call) {
4259 ret = create_static_call_sections(file);
4265 if (opts.retpoline) {
4266 ret = create_retpoline_sites_sections(file);
4273 ret = create_return_sites_sections(file);
4280 ret = create_mcount_loc_sections(file);
4287 ret = create_ibt_endbr_seal_sections(file);
4293 if (opts.orc && !list_empty(&file->insn_list)) {
4294 ret = orc_create(file);
4302 printf("nr_insns_visited: %ld\n", nr_insns_visited);
4303 printf("nr_cfi: %ld\n", nr_cfi);
4304 printf("nr_cfi_reused: %ld\n", nr_cfi_reused);
4305 printf("nr_cfi_cache: %ld\n", nr_cfi_cache);
4310 * For now, don't fail the kernel build on fatal warnings. These
4311 * errors are still fairly common due to the growing matrix of
4312 * supported toolchains and their recent pace of change.