1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/* Every class defined here represents a single bit value of a variable.
Every variable will be represented as a vector of these classes which later
will be used for bit-level symbolic execution. */
#ifndef SYM_EXEC_EXPRESSION_H
#define SYM_EXEC_EXPRESSION_H
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "backend.h"
#include "tree.h"
#include "hwint.h"
#include "gimple-pretty-print.h"
#include "is-a.h"
#include "vec.h"
#include "hash-map.h"
#include "hash-set.h"
#include "stddef.h"
enum value_type {
SYMBOLIC_BIT,
BIT,
BIT_XOR_EXPRESSION,
BIT_AND_EXPRESSION,
BIT_OR_EXPRESSION,
BIT_COMPLEMENT_EXPRESSION,
SHIFT_RIGHT_EXPRESSION,
SHIFT_LEFT_EXPRESSION,
ADD_EXPRESSION,
SUB_EXPRESSION,
BIT_CONDITION
};
/* Base class for single bit value. */
class value_bit {
protected:
/* This will help us to understand where is moved the bit
from its initial position. */
const size_t index;
public:
value_bit () : index (0)
{};
value_bit (size_t i) : index (i)
{};
value_bit (const value_bit &val) : index (val.index)
{};
size_t get_index () const;
/* This will support deep copy of objects' values. */
virtual value_bit *copy () const = 0;
virtual value_type get_type () const = 0;
virtual void print () = 0;
virtual ~value_bit () = default;
};
/* Represents value of a single bit of symbolic marked variables. */
class symbolic_bit : public value_bit {
tree origin = nullptr;
public:
symbolic_bit (size_t i, tree orig) : value_bit (i), origin (orig)
{};
symbolic_bit (const symbolic_bit &sym_bit) : symbolic_bit (sym_bit.index,
sym_bit.origin)
{};
value_bit *copy () const;
void print ();
value_type get_type () const;
tree get_origin ();
};
/* Represents value of a single bit. */
class bit : public value_bit {
private:
/* This is the value of a bit. It must be either 1 or 0. */
unsigned char val = 0;
public:
bit (unsigned char i) : val (i)
{};
bit (const bit &b) : bit (b.val)
{};
unsigned char get_val () const;
void set_val (unsigned char new_val);
value_bit *copy () const;
value_type get_type () const;
void print ();
};
/* Bit-level base expression class. In general expressions consist of
two operands. Here we named them left and right. */
class bit_expression : public value_bit {
protected:
value_bit *left = nullptr;
value_bit *right = nullptr;
char op_sign[2];
void copy (const bit_expression *expr);
public:
value_bit *get_left ();
value_bit *get_right ();
~bit_expression ();
void set_left (value_bit *expr);
void set_right (value_bit *expr);
value_bit *copy () const = 0;
value_type get_type () const = 0;
void print ();
};
/* Bit-level XOR expression. XOR operation on two variables (when one of
them is symbolic) can be represented by XOR operations on
each of their bits. */
class bit_xor_expression : public bit_expression {
public:
bit_xor_expression (value_bit *left, value_bit *right);
bit_xor_expression (const bit_xor_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* Bit-level AND expression. AND operation on two variables (when one of
them is symbolic) can be represented by AND operations on
each of their bits. */
class bit_and_expression : public bit_expression {
public:
bit_and_expression (value_bit *left, value_bit *right);
bit_and_expression (const bit_and_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* Bit-level OR expression. OR operation on two variables (when one of
them is symbolic) can be represented by OR operations on
each of their bits. */
class bit_or_expression : public bit_expression {
public:
bit_or_expression (value_bit *left, value_bit *right);
bit_or_expression (const bit_or_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* SHIFT_RIGHT expression. Result must be stored bit by bit. */
class shift_right_expression : public bit_expression {
public:
shift_right_expression (value_bit *left, value_bit *right);
shift_right_expression (const shift_right_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* SHIFT_LEFT expression. Result must be stored bit by bit. */
class shift_left_expression : public bit_expression {
public:
shift_left_expression (value_bit *left, value_bit *right);
shift_left_expression (const shift_left_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* ADD expression. Result must be stored bit by bit. */
class add_expression : public bit_expression {
public:
add_expression (value_bit *left, value_bit *right);
add_expression (const add_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* SUB expression. Result must be stored bit by bit. */
class sub_expression : public bit_expression {
public:
sub_expression (value_bit *left, value_bit *right);
sub_expression (const sub_expression &expr);
value_bit *copy () const;
value_type get_type () const;
};
/* Bit-level negation expression. */
class bit_complement_expression : public bit_expression {
public:
bit_complement_expression (value_bit *right);
bit_complement_expression (const bit_complement_expression &expr);
value_bit *copy () const;
value_type get_type () const;
void print ();
};
#endif /* SYM_EXEC_EXPRESSION_H. */
|
