2 * Copyright (C) 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/>.
26 #include <linux/hashtable.h>
30 struct cfi_reg regs
[CFI_NUM_REGS
];
35 int drap_reg
, drap_offset
;
36 struct cfi_reg vals
[CFI_NUM_REGS
];
40 struct list_head list
;
41 struct hlist_node hash
;
46 unsigned long immediate
;
47 bool alt_group
, visited
, dead_end
, ignore
, hint
, save
, restore
, ignore_alts
;
48 struct symbol
*call_dest
;
49 struct instruction
*jump_dest
;
50 struct list_head alts
;
52 struct stack_op stack_op
;
53 struct insn_state state
;
59 struct list_head insn_list
;
60 DECLARE_HASHTABLE(insn_hash
, 16);
61 struct section
*rodata
, *whitelist
;
62 bool ignore_unreachables
, c_file
, hints
;
65 int check(const char *objname
, bool no_fp
, bool no_unreachable
, bool orc
);
67 struct instruction
*find_insn(struct objtool_file
*file
,
68 struct section
*sec
, unsigned long offset
);
70 #define for_each_insn(file, insn) \
71 list_for_each_entry(insn, &file->insn_list, list)
73 #define sec_for_each_insn(file, sec, insn) \
74 for (insn = find_insn(file, sec, 0); \
75 insn && &insn->list != &file->insn_list && \
77 insn = list_next_entry(insn, list))