2 * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see <http://www.gnu.org/licenses/>.
28 #include <linux/hashtable.h>
29 #include <linux/kernel.h>
32 struct list_head list;
33 struct instruction *insn;
37 struct cfi_state initial_func_cfi;
39 struct instruction *find_insn(struct objtool_file *file,
40 struct section *sec, unsigned long offset)
42 struct instruction *insn;
44 hash_for_each_possible(file->insn_hash, insn, hash, offset)
45 if (insn->sec == sec && insn->offset == offset)
51 static struct instruction *next_insn_same_sec(struct objtool_file *file,
52 struct instruction *insn)
54 struct instruction *next = list_next_entry(insn, list);
56 if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
62 static struct instruction *next_insn_same_func(struct objtool_file *file,
63 struct instruction *insn)
65 struct instruction *next = list_next_entry(insn, list);
66 struct symbol *func = insn->func;
71 if (&next->list != &file->insn_list && next->func == func)
74 /* Check if we're already in the subfunction: */
75 if (func == func->cfunc)
78 /* Move to the subfunction: */
79 return find_insn(file, func->cfunc->sec, func->cfunc->offset);
82 #define func_for_each_insn_all(file, func, insn) \
83 for (insn = find_insn(file, func->sec, func->offset); \
85 insn = next_insn_same_func(file, insn))
87 #define func_for_each_insn(file, func, insn) \
88 for (insn = find_insn(file, func->sec, func->offset); \
89 insn && &insn->list != &file->insn_list && \
90 insn->sec == func->sec && \
91 insn->offset < func->offset + func->len; \
92 insn = list_next_entry(insn, list))
94 #define func_for_each_insn_continue_reverse(file, func, insn) \
95 for (insn = list_prev_entry(insn, list); \
96 &insn->list != &file->insn_list && \
97 insn->sec == func->sec && insn->offset >= func->offset; \
98 insn = list_prev_entry(insn, list))
100 #define sec_for_each_insn_from(file, insn) \
101 for (; insn; insn = next_insn_same_sec(file, insn))
103 #define sec_for_each_insn_continue(file, insn) \
104 for (insn = next_insn_same_sec(file, insn); insn; \
105 insn = next_insn_same_sec(file, insn))
108 * Check if the function has been manually whitelisted with the
109 * STACK_FRAME_NON_STANDARD macro, or if it should be automatically whitelisted
110 * due to its use of a context switching instruction.
112 static bool ignore_func(struct objtool_file *file, struct symbol *func)
116 /* check for STACK_FRAME_NON_STANDARD */
117 if (file->whitelist && file->whitelist->rela)
118 list_for_each_entry(rela, &file->whitelist->rela->rela_list, list) {
119 if (rela->sym->type == STT_SECTION &&
120 rela->sym->sec == func->sec &&
121 rela->addend == func->offset)
123 if (rela->sym->type == STT_FUNC && rela->sym == func)
131 * This checks to see if the given function is a "noreturn" function.
133 * For global functions which are outside the scope of this object file, we
134 * have to keep a manual list of them.
136 * For local functions, we have to detect them manually by simply looking for
137 * the lack of a return instruction.
144 static int __dead_end_function(struct objtool_file *file, struct symbol *func,
148 struct instruction *insn;
152 * Unfortunately these have to be hard coded because the noreturn
153 * attribute isn't provided in ELF data.
155 static const char * const global_noreturns[] = {
160 "__module_put_and_exit",
162 "kvm_spurious_fault",
168 if (func->bind == STB_WEAK)
171 if (func->bind == STB_GLOBAL)
172 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
173 if (!strcmp(func->name, global_noreturns[i]))
179 insn = find_insn(file, func->sec, func->offset);
183 func_for_each_insn_all(file, func, insn) {
186 if (insn->type == INSN_RETURN)
194 * A function can have a sibling call instead of a return. In that
195 * case, the function's dead-end status depends on whether the target
196 * of the sibling call returns.
198 func_for_each_insn_all(file, func, insn) {
199 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
200 struct instruction *dest = insn->jump_dest;
203 /* sibling call to another file */
206 if (dest->func && dest->func->pfunc != insn->func->pfunc) {
208 /* local sibling call */
209 if (recursion == 5) {
210 WARN_FUNC("infinite recursion (objtool bug!)",
211 dest->sec, dest->offset);
215 return __dead_end_function(file, dest->func,
220 if (insn->type == INSN_JUMP_DYNAMIC && list_empty(&insn->alts))
228 static int dead_end_function(struct objtool_file *file, struct symbol *func)
230 return __dead_end_function(file, func, 0);
233 static void clear_insn_state(struct insn_state *state)
237 memset(state, 0, sizeof(*state));
238 state->cfa.base = CFI_UNDEFINED;
239 for (i = 0; i < CFI_NUM_REGS; i++) {
240 state->regs[i].base = CFI_UNDEFINED;
241 state->vals[i].base = CFI_UNDEFINED;
243 state->drap_reg = CFI_UNDEFINED;
244 state->drap_offset = -1;
248 * Call the arch-specific instruction decoder for all the instructions and add
249 * them to the global instruction list.
251 static int decode_instructions(struct objtool_file *file)
255 unsigned long offset;
256 struct instruction *insn;
259 for_each_sec(file, sec) {
261 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
264 if (strcmp(sec->name, ".altinstr_replacement") &&
265 strcmp(sec->name, ".altinstr_aux") &&
266 strncmp(sec->name, ".discard.", 9))
269 for (offset = 0; offset < sec->len; offset += insn->len) {
270 insn = malloc(sizeof(*insn));
272 WARN("malloc failed");
275 memset(insn, 0, sizeof(*insn));
276 INIT_LIST_HEAD(&insn->alts);
277 clear_insn_state(&insn->state);
280 insn->offset = offset;
282 ret = arch_decode_instruction(file->elf, sec, offset,
284 &insn->len, &insn->type,
290 if (!insn->type || insn->type > INSN_LAST) {
291 WARN_FUNC("invalid instruction type %d",
292 insn->sec, insn->offset, insn->type);
297 hash_add(file->insn_hash, &insn->hash, insn->offset);
298 list_add_tail(&insn->list, &file->insn_list);
301 list_for_each_entry(func, &sec->symbol_list, list) {
302 if (func->type != STT_FUNC)
305 if (!find_insn(file, sec, func->offset)) {
306 WARN("%s(): can't find starting instruction",
311 func_for_each_insn(file, func, insn)
325 * Mark "ud2" instructions and manually annotated dead ends.
327 static int add_dead_ends(struct objtool_file *file)
331 struct instruction *insn;
335 * By default, "ud2" is a dead end unless otherwise annotated, because
336 * GCC 7 inserts it for certain divide-by-zero cases.
338 for_each_insn(file, insn)
339 if (insn->type == INSN_BUG)
340 insn->dead_end = true;
343 * Check for manually annotated dead ends.
345 sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
349 list_for_each_entry(rela, &sec->rela_list, list) {
350 if (rela->sym->type != STT_SECTION) {
351 WARN("unexpected relocation symbol type in %s", sec->name);
354 insn = find_insn(file, rela->sym->sec, rela->addend);
356 insn = list_prev_entry(insn, list);
357 else if (rela->addend == rela->sym->sec->len) {
359 list_for_each_entry_reverse(insn, &file->insn_list, list) {
360 if (insn->sec == rela->sym->sec) {
367 WARN("can't find unreachable insn at %s+0x%x",
368 rela->sym->sec->name, rela->addend);
372 WARN("can't find unreachable insn at %s+0x%x",
373 rela->sym->sec->name, rela->addend);
377 insn->dead_end = true;
382 * These manually annotated reachable checks are needed for GCC 4.4,
383 * where the Linux unreachable() macro isn't supported. In that case
384 * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
387 sec = find_section_by_name(file->elf, ".rela.discard.reachable");
391 list_for_each_entry(rela, &sec->rela_list, list) {
392 if (rela->sym->type != STT_SECTION) {
393 WARN("unexpected relocation symbol type in %s", sec->name);
396 insn = find_insn(file, rela->sym->sec, rela->addend);
398 insn = list_prev_entry(insn, list);
399 else if (rela->addend == rela->sym->sec->len) {
401 list_for_each_entry_reverse(insn, &file->insn_list, list) {
402 if (insn->sec == rela->sym->sec) {
409 WARN("can't find reachable insn at %s+0x%x",
410 rela->sym->sec->name, rela->addend);
414 WARN("can't find reachable insn at %s+0x%x",
415 rela->sym->sec->name, rela->addend);
419 insn->dead_end = false;
426 * Warnings shouldn't be reported for ignored functions.
428 static void add_ignores(struct objtool_file *file)
430 struct instruction *insn;
434 for_each_sec(file, sec) {
435 list_for_each_entry(func, &sec->symbol_list, list) {
436 if (func->type != STT_FUNC)
439 if (!ignore_func(file, func))
442 func_for_each_insn_all(file, func, insn)
449 * FIXME: For now, just ignore any alternatives which add retpolines. This is
450 * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
451 * But it at least allows objtool to understand the control flow *around* the
454 static int add_nospec_ignores(struct objtool_file *file)
458 struct instruction *insn;
460 sec = find_section_by_name(file->elf, ".rela.discard.nospec");
464 list_for_each_entry(rela, &sec->rela_list, list) {
465 if (rela->sym->type != STT_SECTION) {
466 WARN("unexpected relocation symbol type in %s", sec->name);
470 insn = find_insn(file, rela->sym->sec, rela->addend);
472 WARN("bad .discard.nospec entry");
476 insn->ignore_alts = true;
483 * Find the destination instructions for all jumps.
485 static int add_jump_destinations(struct objtool_file *file)
487 struct instruction *insn;
489 struct section *dest_sec;
490 unsigned long dest_off;
492 for_each_insn(file, insn) {
493 if (insn->type != INSN_JUMP_CONDITIONAL &&
494 insn->type != INSN_JUMP_UNCONDITIONAL)
500 rela = find_rela_by_dest_range(insn->sec, insn->offset,
503 dest_sec = insn->sec;
504 dest_off = insn->offset + insn->len + insn->immediate;
505 } else if (rela->sym->type == STT_SECTION) {
506 dest_sec = rela->sym->sec;
507 dest_off = rela->addend + 4;
508 } else if (rela->sym->sec->idx) {
509 dest_sec = rela->sym->sec;
510 dest_off = rela->sym->sym.st_value + rela->addend + 4;
511 } else if (strstr(rela->sym->name, "_indirect_thunk_")) {
513 * Retpoline jumps are really dynamic jumps in
514 * disguise, so convert them accordingly.
516 insn->type = INSN_JUMP_DYNAMIC;
517 insn->retpoline_safe = true;
525 insn->jump_dest = find_insn(file, dest_sec, dest_off);
526 if (!insn->jump_dest) {
529 * This is a special case where an alt instruction
530 * jumps past the end of the section. These are
531 * handled later in handle_group_alt().
533 if (!strcmp(insn->sec->name, ".altinstr_replacement"))
536 WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
537 insn->sec, insn->offset, dest_sec->name,
547 * Find the destination instructions for all calls.
549 static int add_call_destinations(struct objtool_file *file)
551 struct instruction *insn;
552 unsigned long dest_off;
555 for_each_insn(file, insn) {
556 if (insn->type != INSN_CALL)
559 rela = find_rela_by_dest_range(insn->sec, insn->offset,
562 dest_off = insn->offset + insn->len + insn->immediate;
563 insn->call_dest = find_symbol_by_offset(insn->sec,
566 if (!insn->call_dest && !insn->ignore) {
567 WARN_FUNC("unsupported intra-function call",
568 insn->sec, insn->offset);
570 WARN("If this is a retpoline, please patch it in with alternatives and annotate it with ANNOTATE_NOSPEC_ALTERNATIVE.");
574 } else if (rela->sym->type == STT_SECTION) {
575 insn->call_dest = find_symbol_by_offset(rela->sym->sec,
577 if (!insn->call_dest ||
578 insn->call_dest->type != STT_FUNC) {
579 WARN_FUNC("can't find call dest symbol at %s+0x%x",
580 insn->sec, insn->offset,
581 rela->sym->sec->name,
586 insn->call_dest = rela->sym;
593 * The .alternatives section requires some extra special care, over and above
594 * what other special sections require:
596 * 1. Because alternatives are patched in-place, we need to insert a fake jump
597 * instruction at the end so that validate_branch() skips all the original
598 * replaced instructions when validating the new instruction path.
600 * 2. An added wrinkle is that the new instruction length might be zero. In
601 * that case the old instructions are replaced with noops. We simulate that
602 * by creating a fake jump as the only new instruction.
604 * 3. In some cases, the alternative section includes an instruction which
605 * conditionally jumps to the _end_ of the entry. We have to modify these
606 * jumps' destinations to point back to .text rather than the end of the
607 * entry in .altinstr_replacement.
609 * 4. It has been requested that we don't validate the !POPCNT feature path
610 * which is a "very very small percentage of machines".
612 static int handle_group_alt(struct objtool_file *file,
613 struct special_alt *special_alt,
614 struct instruction *orig_insn,
615 struct instruction **new_insn)
617 struct instruction *last_orig_insn, *last_new_insn, *insn, *fake_jump = NULL;
618 unsigned long dest_off;
620 last_orig_insn = NULL;
622 sec_for_each_insn_from(file, insn) {
623 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
626 if (special_alt->skip_orig)
627 insn->type = INSN_NOP;
629 insn->alt_group = true;
630 last_orig_insn = insn;
633 if (next_insn_same_sec(file, last_orig_insn)) {
634 fake_jump = malloc(sizeof(*fake_jump));
636 WARN("malloc failed");
639 memset(fake_jump, 0, sizeof(*fake_jump));
640 INIT_LIST_HEAD(&fake_jump->alts);
641 clear_insn_state(&fake_jump->state);
643 fake_jump->sec = special_alt->new_sec;
644 fake_jump->offset = -1;
645 fake_jump->type = INSN_JUMP_UNCONDITIONAL;
646 fake_jump->jump_dest = list_next_entry(last_orig_insn, list);
647 fake_jump->ignore = true;
650 if (!special_alt->new_len) {
652 WARN("%s: empty alternative at end of section",
653 special_alt->orig_sec->name);
657 *new_insn = fake_jump;
661 last_new_insn = NULL;
663 sec_for_each_insn_from(file, insn) {
664 if (insn->offset >= special_alt->new_off + special_alt->new_len)
667 last_new_insn = insn;
669 insn->ignore = orig_insn->ignore_alts;
671 if (insn->type != INSN_JUMP_CONDITIONAL &&
672 insn->type != INSN_JUMP_UNCONDITIONAL)
675 if (!insn->immediate)
678 dest_off = insn->offset + insn->len + insn->immediate;
679 if (dest_off == special_alt->new_off + special_alt->new_len) {
681 WARN("%s: alternative jump to end of section",
682 special_alt->orig_sec->name);
685 insn->jump_dest = fake_jump;
688 if (!insn->jump_dest) {
689 WARN_FUNC("can't find alternative jump destination",
690 insn->sec, insn->offset);
695 if (!last_new_insn) {
696 WARN_FUNC("can't find last new alternative instruction",
697 special_alt->new_sec, special_alt->new_off);
702 list_add(&fake_jump->list, &last_new_insn->list);
708 * A jump table entry can either convert a nop to a jump or a jump to a nop.
709 * If the original instruction is a jump, make the alt entry an effective nop
710 * by just skipping the original instruction.
712 static int handle_jump_alt(struct objtool_file *file,
713 struct special_alt *special_alt,
714 struct instruction *orig_insn,
715 struct instruction **new_insn)
717 if (orig_insn->type == INSN_NOP)
720 if (orig_insn->type != INSN_JUMP_UNCONDITIONAL) {
721 WARN_FUNC("unsupported instruction at jump label",
722 orig_insn->sec, orig_insn->offset);
726 *new_insn = list_next_entry(orig_insn, list);
731 * Read all the special sections which have alternate instructions which can be
732 * patched in or redirected to at runtime. Each instruction having alternate
733 * instruction(s) has them added to its insn->alts list, which will be
734 * traversed in validate_branch().
736 static int add_special_section_alts(struct objtool_file *file)
738 struct list_head special_alts;
739 struct instruction *orig_insn, *new_insn;
740 struct special_alt *special_alt, *tmp;
741 struct alternative *alt;
744 ret = special_get_alts(file->elf, &special_alts);
748 list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
750 orig_insn = find_insn(file, special_alt->orig_sec,
751 special_alt->orig_off);
753 WARN_FUNC("special: can't find orig instruction",
754 special_alt->orig_sec, special_alt->orig_off);
760 if (!special_alt->group || special_alt->new_len) {
761 new_insn = find_insn(file, special_alt->new_sec,
762 special_alt->new_off);
764 WARN_FUNC("special: can't find new instruction",
765 special_alt->new_sec,
766 special_alt->new_off);
772 if (special_alt->group) {
773 ret = handle_group_alt(file, special_alt, orig_insn,
777 } else if (special_alt->jump_or_nop) {
778 ret = handle_jump_alt(file, special_alt, orig_insn,
784 alt = malloc(sizeof(*alt));
786 WARN("malloc failed");
791 alt->insn = new_insn;
792 list_add_tail(&alt->list, &orig_insn->alts);
794 list_del(&special_alt->list);
802 static int add_switch_table(struct objtool_file *file, struct instruction *insn,
803 struct rela *table, struct rela *next_table)
805 struct rela *rela = table;
806 struct instruction *alt_insn;
807 struct alternative *alt;
808 struct symbol *pfunc = insn->func->pfunc;
809 unsigned int prev_offset = 0;
811 list_for_each_entry_from(rela, &file->rodata->rela->rela_list, list) {
812 if (rela == next_table)
815 /* Make sure the switch table entries are consecutive: */
816 if (prev_offset && rela->offset != prev_offset + 8)
819 /* Detect function pointers from contiguous objects: */
820 if (rela->sym->sec == pfunc->sec &&
821 rela->addend == pfunc->offset)
824 alt_insn = find_insn(file, rela->sym->sec, rela->addend);
828 /* Make sure the jmp dest is in the function or subfunction: */
829 if (alt_insn->func->pfunc != pfunc)
832 alt = malloc(sizeof(*alt));
834 WARN("malloc failed");
838 alt->insn = alt_insn;
839 list_add_tail(&alt->list, &insn->alts);
840 prev_offset = rela->offset;
844 WARN_FUNC("can't find switch jump table",
845 insn->sec, insn->offset);
853 * find_switch_table() - Given a dynamic jump, find the switch jump table in
854 * .rodata associated with it.
856 * There are 3 basic patterns:
858 * 1. jmpq *[rodata addr](,%reg,8)
860 * This is the most common case by far. It jumps to an address in a simple
861 * jump table which is stored in .rodata.
863 * 2. jmpq *[rodata addr](%rip)
865 * This is caused by a rare GCC quirk, currently only seen in three driver
866 * functions in the kernel, only with certain obscure non-distro configs.
868 * As part of an optimization, GCC makes a copy of an existing switch jump
869 * table, modifies it, and then hard-codes the jump (albeit with an indirect
870 * jump) to use a single entry in the table. The rest of the jump table and
871 * some of its jump targets remain as dead code.
873 * In such a case we can just crudely ignore all unreachable instruction
874 * warnings for the entire object file. Ideally we would just ignore them
875 * for the function, but that would require redesigning the code quite a
876 * bit. And honestly that's just not worth doing: unreachable instruction
877 * warnings are of questionable value anyway, and this is such a rare issue.
879 * 3. mov [rodata addr],%reg1
880 * ... some instructions ...
881 * jmpq *(%reg1,%reg2,8)
883 * This is a fairly uncommon pattern which is new for GCC 6. As of this
884 * writing, there are 11 occurrences of it in the allmodconfig kernel.
886 * As of GCC 7 there are quite a few more of these and the 'in between' code
887 * is significant. Esp. with KASAN enabled some of the code between the mov
888 * and jmpq uses .rodata itself, which can confuse things.
890 * TODO: Once we have DWARF CFI and smarter instruction decoding logic,
891 * ensure the same register is used in the mov and jump instructions.
893 * NOTE: RETPOLINE made it harder still to decode dynamic jumps.
895 static struct rela *find_switch_table(struct objtool_file *file,
897 struct instruction *insn)
899 struct rela *text_rela, *rodata_rela;
900 struct instruction *orig_insn = insn;
901 unsigned long table_offset;
904 * Backward search using the @first_jump_src links, these help avoid
905 * much of the 'in between' code. Which avoids us getting confused by
909 &insn->list != &file->insn_list &&
910 insn->sec == func->sec &&
911 insn->offset >= func->offset;
913 insn = insn->first_jump_src ?: list_prev_entry(insn, list)) {
915 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
918 /* allow small jumps within the range */
919 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
921 (insn->jump_dest->offset <= insn->offset ||
922 insn->jump_dest->offset > orig_insn->offset))
925 /* look for a relocation which references .rodata */
926 text_rela = find_rela_by_dest_range(insn->sec, insn->offset,
928 if (!text_rela || text_rela->sym != file->rodata->sym)
931 table_offset = text_rela->addend;
932 if (text_rela->type == R_X86_64_PC32)
936 * Make sure the .rodata address isn't associated with a
937 * symbol. gcc jump tables are anonymous data.
939 if (find_symbol_containing(file->rodata, table_offset))
942 rodata_rela = find_rela_by_dest(file->rodata, table_offset);
945 * Use of RIP-relative switch jumps is quite rare, and
946 * indicates a rare GCC quirk/bug which can leave dead
949 if (text_rela->type == R_X86_64_PC32)
950 file->ignore_unreachables = true;
960 static int add_func_switch_tables(struct objtool_file *file,
963 struct instruction *insn, *last = NULL, *prev_jump = NULL;
964 struct rela *rela, *prev_rela = NULL;
967 func_for_each_insn_all(file, func, insn) {
972 * Store back-pointers for unconditional forward jumps such
973 * that find_switch_table() can back-track using those and
974 * avoid some potentially confusing code.
976 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
977 insn->offset > last->offset &&
978 insn->jump_dest->offset > insn->offset &&
979 !insn->jump_dest->first_jump_src) {
981 insn->jump_dest->first_jump_src = insn;
982 last = insn->jump_dest;
985 if (insn->type != INSN_JUMP_DYNAMIC)
988 rela = find_switch_table(file, func, insn);
993 * We found a switch table, but we don't know yet how big it
994 * is. Don't add it until we reach the end of the function or
995 * the beginning of another switch table in the same function.
998 ret = add_switch_table(file, prev_jump, prev_rela, rela);
1008 ret = add_switch_table(file, prev_jump, prev_rela, NULL);
1017 * For some switch statements, gcc generates a jump table in the .rodata
1018 * section which contains a list of addresses within the function to jump to.
1019 * This finds these jump tables and adds them to the insn->alts lists.
1021 static int add_switch_table_alts(struct objtool_file *file)
1023 struct section *sec;
1024 struct symbol *func;
1027 if (!file->rodata || !file->rodata->rela)
1030 for_each_sec(file, sec) {
1031 list_for_each_entry(func, &sec->symbol_list, list) {
1032 if (func->type != STT_FUNC)
1035 ret = add_func_switch_tables(file, func);
1044 static int read_unwind_hints(struct objtool_file *file)
1046 struct section *sec, *relasec;
1048 struct unwind_hint *hint;
1049 struct instruction *insn;
1050 struct cfi_reg *cfa;
1053 sec = find_section_by_name(file->elf, ".discard.unwind_hints");
1057 relasec = sec->rela;
1059 WARN("missing .rela.discard.unwind_hints section");
1063 if (sec->len % sizeof(struct unwind_hint)) {
1064 WARN("struct unwind_hint size mismatch");
1070 for (i = 0; i < sec->len / sizeof(struct unwind_hint); i++) {
1071 hint = (struct unwind_hint *)sec->data->d_buf + i;
1073 rela = find_rela_by_dest(sec, i * sizeof(*hint));
1075 WARN("can't find rela for unwind_hints[%d]", i);
1079 insn = find_insn(file, rela->sym->sec, rela->addend);
1081 WARN("can't find insn for unwind_hints[%d]", i);
1085 cfa = &insn->state.cfa;
1087 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
1091 } else if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
1092 insn->restore = true;
1099 switch (hint->sp_reg) {
1100 case ORC_REG_UNDEFINED:
1101 cfa->base = CFI_UNDEFINED;
1109 case ORC_REG_SP_INDIRECT:
1110 cfa->base = CFI_SP_INDIRECT;
1113 cfa->base = CFI_R10;
1116 cfa->base = CFI_R13;
1125 WARN_FUNC("unsupported unwind_hint sp base reg %d",
1126 insn->sec, insn->offset, hint->sp_reg);
1130 cfa->offset = hint->sp_offset;
1131 insn->state.type = hint->type;
1137 static int read_retpoline_hints(struct objtool_file *file)
1139 struct section *sec;
1140 struct instruction *insn;
1143 sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
1147 list_for_each_entry(rela, &sec->rela_list, list) {
1148 if (rela->sym->type != STT_SECTION) {
1149 WARN("unexpected relocation symbol type in %s", sec->name);
1153 insn = find_insn(file, rela->sym->sec, rela->addend);
1155 WARN("bad .discard.retpoline_safe entry");
1159 if (insn->type != INSN_JUMP_DYNAMIC &&
1160 insn->type != INSN_CALL_DYNAMIC) {
1161 WARN_FUNC("retpoline_safe hint not an indirect jump/call",
1162 insn->sec, insn->offset);
1166 insn->retpoline_safe = true;
1172 static int decode_sections(struct objtool_file *file)
1176 ret = decode_instructions(file);
1180 ret = add_dead_ends(file);
1186 ret = add_nospec_ignores(file);
1190 ret = add_jump_destinations(file);
1194 ret = add_special_section_alts(file);
1198 ret = add_call_destinations(file);
1202 ret = add_switch_table_alts(file);
1206 ret = read_unwind_hints(file);
1210 ret = read_retpoline_hints(file);
1217 static bool is_fentry_call(struct instruction *insn)
1219 if (insn->type == INSN_CALL &&
1220 insn->call_dest->type == STT_NOTYPE &&
1221 !strcmp(insn->call_dest->name, "__fentry__"))
1227 static bool has_modified_stack_frame(struct insn_state *state)
1231 if (state->cfa.base != initial_func_cfi.cfa.base ||
1232 state->cfa.offset != initial_func_cfi.cfa.offset ||
1233 state->stack_size != initial_func_cfi.cfa.offset ||
1237 for (i = 0; i < CFI_NUM_REGS; i++)
1238 if (state->regs[i].base != initial_func_cfi.regs[i].base ||
1239 state->regs[i].offset != initial_func_cfi.regs[i].offset)
1245 static bool has_valid_stack_frame(struct insn_state *state)
1247 if (state->cfa.base == CFI_BP && state->regs[CFI_BP].base == CFI_CFA &&
1248 state->regs[CFI_BP].offset == -16)
1251 if (state->drap && state->regs[CFI_BP].base == CFI_BP)
1257 static int update_insn_state_regs(struct instruction *insn, struct insn_state *state)
1259 struct cfi_reg *cfa = &state->cfa;
1260 struct stack_op *op = &insn->stack_op;
1262 if (cfa->base != CFI_SP)
1266 if (op->dest.type == OP_DEST_PUSH)
1270 if (op->src.type == OP_SRC_POP)
1273 /* add immediate to sp */
1274 if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
1275 op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
1276 cfa->offset -= op->src.offset;
1281 static void save_reg(struct insn_state *state, unsigned char reg, int base,
1284 if (arch_callee_saved_reg(reg) &&
1285 state->regs[reg].base == CFI_UNDEFINED) {
1286 state->regs[reg].base = base;
1287 state->regs[reg].offset = offset;
1291 static void restore_reg(struct insn_state *state, unsigned char reg)
1293 state->regs[reg].base = CFI_UNDEFINED;
1294 state->regs[reg].offset = 0;
1298 * A note about DRAP stack alignment:
1300 * GCC has the concept of a DRAP register, which is used to help keep track of
1301 * the stack pointer when aligning the stack. r10 or r13 is used as the DRAP
1302 * register. The typical DRAP pattern is:
1304 * 4c 8d 54 24 08 lea 0x8(%rsp),%r10
1305 * 48 83 e4 c0 and $0xffffffffffffffc0,%rsp
1306 * 41 ff 72 f8 pushq -0x8(%r10)
1308 * 48 89 e5 mov %rsp,%rbp
1315 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1318 * There are some variations in the epilogues, like:
1326 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1331 * 4c 8b 55 e8 mov -0x18(%rbp),%r10
1332 * 48 8b 5d e0 mov -0x20(%rbp),%rbx
1333 * 4c 8b 65 f0 mov -0x10(%rbp),%r12
1334 * 4c 8b 6d f8 mov -0x8(%rbp),%r13
1336 * 49 8d 62 f8 lea -0x8(%r10),%rsp
1339 * Sometimes r13 is used as the DRAP register, in which case it's saved and
1340 * restored beforehand:
1343 * 4c 8d 6c 24 10 lea 0x10(%rsp),%r13
1344 * 48 83 e4 f0 and $0xfffffffffffffff0,%rsp
1346 * 49 8d 65 f0 lea -0x10(%r13),%rsp
1350 static int update_insn_state(struct instruction *insn, struct insn_state *state)
1352 struct stack_op *op = &insn->stack_op;
1353 struct cfi_reg *cfa = &state->cfa;
1354 struct cfi_reg *regs = state->regs;
1356 /* stack operations don't make sense with an undefined CFA */
1357 if (cfa->base == CFI_UNDEFINED) {
1359 WARN_FUNC("undefined stack state", insn->sec, insn->offset);
1365 if (state->type == ORC_TYPE_REGS || state->type == ORC_TYPE_REGS_IRET)
1366 return update_insn_state_regs(insn, state);
1368 switch (op->dest.type) {
1371 switch (op->src.type) {
1374 if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
1375 cfa->base == CFI_SP &&
1376 regs[CFI_BP].base == CFI_CFA &&
1377 regs[CFI_BP].offset == -cfa->offset) {
1379 /* mov %rsp, %rbp */
1380 cfa->base = op->dest.reg;
1381 state->bp_scratch = false;
1384 else if (op->src.reg == CFI_SP &&
1385 op->dest.reg == CFI_BP && state->drap) {
1387 /* drap: mov %rsp, %rbp */
1388 regs[CFI_BP].base = CFI_BP;
1389 regs[CFI_BP].offset = -state->stack_size;
1390 state->bp_scratch = false;
1393 else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1398 * This is needed for the rare case where GCC
1405 state->vals[op->dest.reg].base = CFI_CFA;
1406 state->vals[op->dest.reg].offset = -state->stack_size;
1409 else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
1410 cfa->base == CFI_BP) {
1415 * Restore the original stack pointer (Clang).
1417 state->stack_size = -state->regs[CFI_BP].offset;
1420 else if (op->dest.reg == cfa->base) {
1422 /* mov %reg, %rsp */
1423 if (cfa->base == CFI_SP &&
1424 state->vals[op->src.reg].base == CFI_CFA) {
1427 * This is needed for the rare case
1428 * where GCC does something dumb like:
1430 * lea 0x8(%rsp), %rcx
1434 cfa->offset = -state->vals[op->src.reg].offset;
1435 state->stack_size = cfa->offset;
1438 cfa->base = CFI_UNDEFINED;
1446 if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
1449 state->stack_size -= op->src.offset;
1450 if (cfa->base == CFI_SP)
1451 cfa->offset -= op->src.offset;
1455 if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
1457 /* lea disp(%rbp), %rsp */
1458 state->stack_size = -(op->src.offset + regs[CFI_BP].offset);
1462 if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1464 /* drap: lea disp(%rsp), %drap */
1465 state->drap_reg = op->dest.reg;
1468 * lea disp(%rsp), %reg
1470 * This is needed for the rare case where GCC
1471 * does something dumb like:
1473 * lea 0x8(%rsp), %rcx
1477 state->vals[op->dest.reg].base = CFI_CFA;
1478 state->vals[op->dest.reg].offset = \
1479 -state->stack_size + op->src.offset;
1484 if (state->drap && op->dest.reg == CFI_SP &&
1485 op->src.reg == state->drap_reg) {
1487 /* drap: lea disp(%drap), %rsp */
1489 cfa->offset = state->stack_size = -op->src.offset;
1490 state->drap_reg = CFI_UNDEFINED;
1491 state->drap = false;
1495 if (op->dest.reg == state->cfa.base) {
1496 WARN_FUNC("unsupported stack register modification",
1497 insn->sec, insn->offset);
1504 if (op->dest.reg != CFI_SP ||
1505 (state->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
1506 (state->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
1507 WARN_FUNC("unsupported stack pointer realignment",
1508 insn->sec, insn->offset);
1512 if (state->drap_reg != CFI_UNDEFINED) {
1513 /* drap: and imm, %rsp */
1514 cfa->base = state->drap_reg;
1515 cfa->offset = state->stack_size = 0;
1520 * Older versions of GCC (4.8ish) realign the stack
1521 * without DRAP, with a frame pointer.
1527 if (!state->drap && op->dest.type == OP_DEST_REG &&
1528 op->dest.reg == cfa->base) {
1534 if (state->drap && cfa->base == CFI_BP_INDIRECT &&
1535 op->dest.type == OP_DEST_REG &&
1536 op->dest.reg == state->drap_reg &&
1537 state->drap_offset == -state->stack_size) {
1539 /* drap: pop %drap */
1540 cfa->base = state->drap_reg;
1542 state->drap_offset = -1;
1544 } else if (regs[op->dest.reg].offset == -state->stack_size) {
1547 restore_reg(state, op->dest.reg);
1550 state->stack_size -= 8;
1551 if (cfa->base == CFI_SP)
1556 case OP_SRC_REG_INDIRECT:
1557 if (state->drap && op->src.reg == CFI_BP &&
1558 op->src.offset == state->drap_offset) {
1560 /* drap: mov disp(%rbp), %drap */
1561 cfa->base = state->drap_reg;
1563 state->drap_offset = -1;
1566 if (state->drap && op->src.reg == CFI_BP &&
1567 op->src.offset == regs[op->dest.reg].offset) {
1569 /* drap: mov disp(%rbp), %reg */
1570 restore_reg(state, op->dest.reg);
1572 } else if (op->src.reg == cfa->base &&
1573 op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
1575 /* mov disp(%rbp), %reg */
1576 /* mov disp(%rsp), %reg */
1577 restore_reg(state, op->dest.reg);
1583 WARN_FUNC("unknown stack-related instruction",
1584 insn->sec, insn->offset);
1591 state->stack_size += 8;
1592 if (cfa->base == CFI_SP)
1595 if (op->src.type != OP_SRC_REG)
1599 if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1601 /* drap: push %drap */
1602 cfa->base = CFI_BP_INDIRECT;
1603 cfa->offset = -state->stack_size;
1605 /* save drap so we know when to restore it */
1606 state->drap_offset = -state->stack_size;
1608 } else if (op->src.reg == CFI_BP && cfa->base == state->drap_reg) {
1610 /* drap: push %rbp */
1611 state->stack_size = 0;
1613 } else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1615 /* drap: push %reg */
1616 save_reg(state, op->src.reg, CFI_BP, -state->stack_size);
1622 save_reg(state, op->src.reg, CFI_CFA, -state->stack_size);
1625 /* detect when asm code uses rbp as a scratch register */
1626 if (!no_fp && insn->func && op->src.reg == CFI_BP &&
1627 cfa->base != CFI_BP)
1628 state->bp_scratch = true;
1631 case OP_DEST_REG_INDIRECT:
1634 if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1636 /* drap: mov %drap, disp(%rbp) */
1637 cfa->base = CFI_BP_INDIRECT;
1638 cfa->offset = op->dest.offset;
1640 /* save drap offset so we know when to restore it */
1641 state->drap_offset = op->dest.offset;
1644 else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1646 /* drap: mov reg, disp(%rbp) */
1647 save_reg(state, op->src.reg, CFI_BP, op->dest.offset);
1650 } else if (op->dest.reg == cfa->base) {
1652 /* mov reg, disp(%rbp) */
1653 /* mov reg, disp(%rsp) */
1654 save_reg(state, op->src.reg, CFI_CFA,
1655 op->dest.offset - state->cfa.offset);
1661 if ((!state->drap && cfa->base != CFI_BP) ||
1662 (state->drap && cfa->base != state->drap_reg)) {
1663 WARN_FUNC("leave instruction with modified stack frame",
1664 insn->sec, insn->offset);
1668 /* leave (mov %rbp, %rsp; pop %rbp) */
1670 state->stack_size = -state->regs[CFI_BP].offset - 8;
1671 restore_reg(state, CFI_BP);
1681 if (op->src.type != OP_SRC_POP) {
1682 WARN_FUNC("unknown stack-related memory operation",
1683 insn->sec, insn->offset);
1688 state->stack_size -= 8;
1689 if (cfa->base == CFI_SP)
1695 WARN_FUNC("unknown stack-related instruction",
1696 insn->sec, insn->offset);
1703 static bool insn_state_match(struct instruction *insn, struct insn_state *state)
1705 struct insn_state *state1 = &insn->state, *state2 = state;
1708 if (memcmp(&state1->cfa, &state2->cfa, sizeof(state1->cfa))) {
1709 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
1710 insn->sec, insn->offset,
1711 state1->cfa.base, state1->cfa.offset,
1712 state2->cfa.base, state2->cfa.offset);
1714 } else if (memcmp(&state1->regs, &state2->regs, sizeof(state1->regs))) {
1715 for (i = 0; i < CFI_NUM_REGS; i++) {
1716 if (!memcmp(&state1->regs[i], &state2->regs[i],
1717 sizeof(struct cfi_reg)))
1720 WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
1721 insn->sec, insn->offset,
1722 i, state1->regs[i].base, state1->regs[i].offset,
1723 i, state2->regs[i].base, state2->regs[i].offset);
1727 } else if (state1->type != state2->type) {
1728 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
1729 insn->sec, insn->offset, state1->type, state2->type);
1731 } else if (state1->drap != state2->drap ||
1732 (state1->drap && state1->drap_reg != state2->drap_reg) ||
1733 (state1->drap && state1->drap_offset != state2->drap_offset)) {
1734 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
1735 insn->sec, insn->offset,
1736 state1->drap, state1->drap_reg, state1->drap_offset,
1737 state2->drap, state2->drap_reg, state2->drap_offset);
1746 * Follow the branch starting at the given instruction, and recursively follow
1747 * any other branches (jumps). Meanwhile, track the frame pointer state at
1748 * each instruction and validate all the rules described in
1749 * tools/objtool/Documentation/stack-validation.txt.
1751 static int validate_branch(struct objtool_file *file, struct instruction *first,
1752 struct insn_state state)
1754 struct alternative *alt;
1755 struct instruction *insn, *next_insn;
1756 struct section *sec;
1757 struct symbol *func = NULL;
1763 if (insn->alt_group && list_empty(&insn->alts)) {
1764 WARN_FUNC("don't know how to handle branch to middle of alternative instruction group",
1770 next_insn = next_insn_same_sec(file, insn);
1772 if (file->c_file && func && insn->func && func != insn->func->pfunc) {
1773 WARN("%s() falls through to next function %s()",
1774 func->name, insn->func->name);
1778 func = insn->func ? insn->func->pfunc : NULL;
1780 if (func && insn->ignore) {
1781 WARN_FUNC("BUG: why am I validating an ignored function?",
1786 if (insn->visited) {
1787 if (!insn->hint && !insn_state_match(insn, &state))
1794 if (insn->restore) {
1795 struct instruction *save_insn, *i;
1799 func_for_each_insn_continue_reverse(file, insn->func, i) {
1807 WARN_FUNC("no corresponding CFI save for CFI restore",
1812 if (!save_insn->visited) {
1814 * Oops, no state to copy yet.
1815 * Hopefully we can reach this
1816 * instruction from another branch
1817 * after the save insn has been
1823 WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
1828 insn->state = save_insn->state;
1831 state = insn->state;
1834 insn->state = state;
1836 insn->visited = true;
1838 if (!insn->ignore_alts) {
1839 list_for_each_entry(alt, &insn->alts, list) {
1840 ret = validate_branch(file, alt->insn, state);
1846 switch (insn->type) {
1849 if (func && has_modified_stack_frame(&state)) {
1850 WARN_FUNC("return with modified stack frame",
1855 if (state.bp_scratch) {
1856 WARN("%s uses BP as a scratch register",
1864 if (is_fentry_call(insn))
1867 ret = dead_end_function(file, insn->call_dest);
1874 case INSN_CALL_DYNAMIC:
1875 if (!no_fp && func && !has_valid_stack_frame(&state)) {
1876 WARN_FUNC("call without frame pointer save/setup",
1882 case INSN_JUMP_CONDITIONAL:
1883 case INSN_JUMP_UNCONDITIONAL:
1884 if (insn->jump_dest &&
1885 (!func || !insn->jump_dest->func ||
1886 insn->jump_dest->func->pfunc == func)) {
1887 ret = validate_branch(file, insn->jump_dest,
1892 } else if (func && has_modified_stack_frame(&state)) {
1893 WARN_FUNC("sibling call from callable instruction with modified stack frame",
1898 if (insn->type == INSN_JUMP_UNCONDITIONAL)
1903 case INSN_JUMP_DYNAMIC:
1904 if (func && list_empty(&insn->alts) &&
1905 has_modified_stack_frame(&state)) {
1906 WARN_FUNC("sibling call from callable instruction with modified stack frame",
1913 case INSN_CONTEXT_SWITCH:
1914 if (func && (!next_insn || !next_insn->hint)) {
1915 WARN_FUNC("unsupported instruction in callable function",
1922 if (update_insn_state(insn, &state))
1935 if (state.cfa.base == CFI_UNDEFINED)
1937 WARN("%s: unexpected end of section", sec->name);
1947 static int validate_unwind_hints(struct objtool_file *file)
1949 struct instruction *insn;
1950 int ret, warnings = 0;
1951 struct insn_state state;
1956 clear_insn_state(&state);
1958 for_each_insn(file, insn) {
1959 if (insn->hint && !insn->visited) {
1960 ret = validate_branch(file, insn, state);
1968 static int validate_retpoline(struct objtool_file *file)
1970 struct instruction *insn;
1973 for_each_insn(file, insn) {
1974 if (insn->type != INSN_JUMP_DYNAMIC &&
1975 insn->type != INSN_CALL_DYNAMIC)
1978 if (insn->retpoline_safe)
1982 * .init.text code is ran before userspace and thus doesn't
1983 * strictly need retpolines, except for modules which are
1984 * loaded late, they very much do need retpoline in their
1987 if (!strcmp(insn->sec->name, ".init.text") && !module)
1990 WARN_FUNC("indirect %s found in RETPOLINE build",
1991 insn->sec, insn->offset,
1992 insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
2000 static bool is_kasan_insn(struct instruction *insn)
2002 return (insn->type == INSN_CALL &&
2003 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
2006 static bool is_ubsan_insn(struct instruction *insn)
2008 return (insn->type == INSN_CALL &&
2009 !strcmp(insn->call_dest->name,
2010 "__ubsan_handle_builtin_unreachable"));
2013 static bool ignore_unreachable_insn(struct instruction *insn)
2017 if (insn->ignore || insn->type == INSN_NOP)
2021 * Ignore any unused exceptions. This can happen when a whitelisted
2022 * function has an exception table entry.
2024 * Also ignore alternative replacement instructions. This can happen
2025 * when a whitelisted function uses one of the ALTERNATIVE macros.
2027 if (!strcmp(insn->sec->name, ".fixup") ||
2028 !strcmp(insn->sec->name, ".altinstr_replacement") ||
2029 !strcmp(insn->sec->name, ".altinstr_aux"))
2033 * Check if this (or a subsequent) instruction is related to
2034 * CONFIG_UBSAN or CONFIG_KASAN.
2036 * End the search at 5 instructions to avoid going into the weeds.
2040 for (i = 0; i < 5; i++) {
2042 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
2045 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
2046 if (insn->jump_dest &&
2047 insn->jump_dest->func == insn->func) {
2048 insn = insn->jump_dest;
2055 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
2058 insn = list_next_entry(insn, list);
2064 static int validate_functions(struct objtool_file *file)
2066 struct section *sec;
2067 struct symbol *func;
2068 struct instruction *insn;
2069 struct insn_state state;
2070 int ret, warnings = 0;
2072 clear_insn_state(&state);
2074 state.cfa = initial_func_cfi.cfa;
2075 memcpy(&state.regs, &initial_func_cfi.regs,
2076 CFI_NUM_REGS * sizeof(struct cfi_reg));
2077 state.stack_size = initial_func_cfi.cfa.offset;
2079 for_each_sec(file, sec) {
2080 list_for_each_entry(func, &sec->symbol_list, list) {
2081 if (func->type != STT_FUNC || func->pfunc != func)
2084 insn = find_insn(file, sec, func->offset);
2085 if (!insn || insn->ignore)
2088 ret = validate_branch(file, insn, state);
2096 static int validate_reachable_instructions(struct objtool_file *file)
2098 struct instruction *insn;
2100 if (file->ignore_unreachables)
2103 for_each_insn(file, insn) {
2104 if (insn->visited || ignore_unreachable_insn(insn))
2107 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
2114 static void cleanup(struct objtool_file *file)
2116 struct instruction *insn, *tmpinsn;
2117 struct alternative *alt, *tmpalt;
2119 list_for_each_entry_safe(insn, tmpinsn, &file->insn_list, list) {
2120 list_for_each_entry_safe(alt, tmpalt, &insn->alts, list) {
2121 list_del(&alt->list);
2124 list_del(&insn->list);
2125 hash_del(&insn->hash);
2128 elf_close(file->elf);
2131 int check(const char *_objname, bool orc)
2133 struct objtool_file file;
2134 int ret, warnings = 0;
2138 file.elf = elf_open(objname, orc ? O_RDWR : O_RDONLY);
2142 INIT_LIST_HEAD(&file.insn_list);
2143 hash_init(file.insn_hash);
2144 file.whitelist = find_section_by_name(file.elf, ".discard.func_stack_frame_non_standard");
2145 file.rodata = find_section_by_name(file.elf, ".rodata");
2146 file.c_file = find_section_by_name(file.elf, ".comment");
2147 file.ignore_unreachables = no_unreachable;
2150 arch_initial_func_cfi_state(&initial_func_cfi);
2152 ret = decode_sections(&file);
2157 if (list_empty(&file.insn_list))
2161 ret = validate_retpoline(&file);
2167 ret = validate_functions(&file);
2172 ret = validate_unwind_hints(&file);
2178 ret = validate_reachable_instructions(&file);
2185 ret = create_orc(&file);
2189 ret = create_orc_sections(&file);
2193 ret = elf_write(file.elf);
2201 /* ignore warnings for now until we get all the code cleaned up */
2202 if (ret || warnings)