1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * Copyright (C) 2017 Josh Poimboeuf <jpoimboe@redhat.com>
14 #include <linux/hashtable.h>
18 struct cfi_reg regs[CFI_NUM_REGS];
22 bool drap, end, uaccess, df;
23 unsigned int uaccess_stack;
24 int drap_reg, drap_offset;
25 struct cfi_reg vals[CFI_NUM_REGS];
29 struct list_head list;
30 struct hlist_node hash;
35 unsigned long immediate;
36 bool alt_group, visited, dead_end, ignore, hint, save, restore, ignore_alts;
38 struct symbol *call_dest;
39 struct instruction *jump_dest;
40 struct instruction *first_jump_src;
41 struct list_head alts;
43 struct stack_op stack_op;
44 struct insn_state state;
50 struct list_head insn_list;
51 DECLARE_HASHTABLE(insn_hash, 16);
52 bool ignore_unreachables, c_file, hints, rodata;
55 int check(const char *objname, bool orc);
57 struct instruction *find_insn(struct objtool_file *file,
58 struct section *sec, unsigned long offset);
60 #define for_each_insn(file, insn) \
61 list_for_each_entry(insn, &file->insn_list, list)
63 #define sec_for_each_insn(file, sec, insn) \
64 for (insn = find_insn(file, sec, 0); \
65 insn && &insn->list != &file->insn_list && \
67 insn = list_next_entry(insn, list))