1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18#ifndef _CHECK_H
19#define _CHECK_H
20
21#include <stdbool.h>
22#include "elf.h"
23#include "cfi.h"
24#include "arch.h"
25#include "orc.h"
26#include <linux/hashtable.h>
27
28struct insn_state {
29 struct cfi_reg cfa;
30 struct cfi_reg regs[CFI_NUM_REGS];
31 int stack_size;
32 unsigned char type;
33 bool bp_scratch;
34 bool drap;
35 int drap_reg, drap_offset;
36 struct cfi_reg vals[CFI_NUM_REGS];
37};
38
39struct instruction {
40 struct list_head list;
41 struct hlist_node hash;
42 struct section *sec;
43 unsigned long offset;
44 unsigned int len;
45 unsigned char type;
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;
51 struct symbol *func;
52 struct stack_op stack_op;
53 struct insn_state state;
54 struct orc_entry orc;
55};
56
57struct objtool_file {
58 struct elf *elf;
59 struct list_head insn_list;
60 DECLARE_HASHTABLE(insn_hash, 16);
61 struct section *rodata, *whitelist;
62 bool ignore_unreachables, c_file, hints;
63};
64
65int check(const char *objname, bool no_fp, bool no_unreachable, bool orc);
66
67struct instruction *find_insn(struct objtool_file *file,
68 struct section *sec, unsigned long offset);
69
70#define for_each_insn(file, insn) \
71 list_for_each_entry(insn, &file->insn_list, list)
72
73#define sec_for_each_insn(file, sec, insn) \
74 for (insn = find_insn(file, sec, 0); \
75 insn && &insn->list != &file->insn_list && \
76 insn->sec == sec; \
77 insn = list_next_entry(insn, list))
78
79
80#endif
81