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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
|
"""
Expression reducer:
Apply reduction rules to an Expression ast
"""
import logging
from miasm.expression.expression import ExprInt, ExprId, ExprLoc, ExprOp, \
ExprSlice, ExprCompose, ExprMem, ExprCond
log_reduce = logging.getLogger("expr_reduce")
console_handler = logging.StreamHandler()
console_handler.setFormatter(logging.Formatter("[%(levelname)-8s]: %(message)s"))
log_reduce.addHandler(console_handler)
log_reduce.setLevel(logging.WARNING)
class ExprNode(object):
"""Clone of Expression object with additional information"""
def __init__(self, expr):
self.expr = expr
class ExprNodeInt(ExprNode):
def __init__(self, expr):
assert expr.is_int()
super(ExprNodeInt, self).__init__(expr)
self.arg = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = str(self.expr)
return out
class ExprNodeId(ExprNode):
def __init__(self, expr):
assert expr.is_id()
super(ExprNodeId, self).__init__(expr)
self.arg = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = str(self.expr)
return out
class ExprNodeLoc(ExprNode):
def __init__(self, expr):
assert expr.is_loc()
super(ExprNodeLoc, self).__init__(expr)
self.arg = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = str(self.expr)
return out
class ExprNodeMem(ExprNode):
def __init__(self, expr):
assert expr.is_mem()
super(ExprNodeMem, self).__init__(expr)
self.ptr = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = "@%d[%r]" % (self.expr.size, self.ptr)
return out
class ExprNodeOp(ExprNode):
def __init__(self, expr):
assert expr.is_op()
super(ExprNodeOp, self).__init__(expr)
self.args = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
if len(self.args) == 1:
out = "(%s(%r))" % (self.expr.op, self.args[0])
else:
out = "(%s)" % self.expr.op.join(repr(arg) for arg in self.args)
return out
class ExprNodeSlice(ExprNode):
def __init__(self, expr):
assert expr.is_slice()
super(ExprNodeSlice, self).__init__(expr)
self.arg = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = "%r[%d:%d]" % (self.arg, self.expr.start, self.expr.stop)
return out
class ExprNodeCompose(ExprNode):
def __init__(self, expr):
assert expr.is_compose()
super(ExprNodeCompose, self).__init__(expr)
self.args = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = "{%s}" % ', '.join(repr(arg) for arg in self.args)
return out
class ExprNodeCond(ExprNode):
def __init__(self, expr):
assert expr.is_cond()
super(ExprNodeCond, self).__init__(expr)
self.cond = None
self.src1 = None
self.src2 = None
def __repr__(self):
if self.info is not None:
out = repr(self.info)
else:
out = "(%r?%r:%r)" % (self.cond, self.src1, self.src2)
return out
class ExprReducer(object):
"""Apply reduction rules to an expr
reduction_rules: list of ordered reduction rules
List of function representing reduction rules
Function API:
reduction_xxx(self, node, lvl=0)
with:
* node: the ExprNode to qualify
* lvl: [optional] the recursion level
Returns:
* None if the reduction rule is not applied
* the resulting information to store in the ExprNode.info
allow_none_result: allow missing reduction rules
"""
reduction_rules = []
allow_none_result = False
def expr2node(self, expr):
"""Build ExprNode mirror of @expr
@expr: Expression to analyze
"""
if isinstance(expr, ExprId):
node = ExprNodeId(expr)
elif isinstance(expr, ExprLoc):
node = ExprNodeLoc(expr)
elif isinstance(expr, ExprInt):
node = ExprNodeInt(expr)
elif isinstance(expr, ExprMem):
son = self.expr2node(expr.ptr)
node = ExprNodeMem(expr)
node.ptr = son
elif isinstance(expr, ExprSlice):
son = self.expr2node(expr.arg)
node = ExprNodeSlice(expr)
node.arg = son
elif isinstance(expr, ExprOp):
sons = [self.expr2node(arg) for arg in expr.args]
node = ExprNodeOp(expr)
node.args = sons
elif isinstance(expr, ExprCompose):
sons = [self.expr2node(arg) for arg in expr.args]
node = ExprNodeCompose(expr)
node.args = sons
elif isinstance(expr, ExprCond):
node = ExprNodeCond(expr)
node.cond = self.expr2node(expr.cond)
node.src1 = self.expr2node(expr.src1)
node.src2 = self.expr2node(expr.src2)
else:
raise TypeError("Unknown Expr Type %r", type(expr))
return node
def reduce(self, expr, **kwargs):
"""Returns an ExprNode tree mirroring @expr tree. The ExprNode is
computed by applying reduction rules to the expression @expr
@expr: an Expression
"""
node = self.expr2node(expr)
return self.categorize(node, lvl=0, **kwargs)
def categorize(self, node, lvl=0, **kwargs):
"""Recursively apply rules to @node
@node: ExprNode to analyze
@lvl: actual recursion level
"""
expr = node.expr
log_reduce.debug("\t" * lvl + "Reduce...: %s", node.expr)
if isinstance(expr, ExprId):
node = ExprNodeId(expr)
elif isinstance(expr, ExprInt):
node = ExprNodeInt(expr)
elif isinstance(expr, ExprLoc):
node = ExprNodeLoc(expr)
elif isinstance(expr, ExprMem):
ptr = self.categorize(node.ptr, lvl=lvl + 1, **kwargs)
node = ExprNodeMem(ExprMem(ptr.expr, expr.size))
node.ptr = ptr
elif isinstance(expr, ExprSlice):
arg = self.categorize(node.arg, lvl=lvl + 1, **kwargs)
node = ExprNodeSlice(ExprSlice(arg.expr, expr.start, expr.stop))
node.arg = arg
elif isinstance(expr, ExprOp):
new_args = []
for arg in node.args:
new_a = self.categorize(arg, lvl=lvl + 1, **kwargs)
assert new_a.expr.size == arg.expr.size
new_args.append(new_a)
node = ExprNodeOp(ExprOp(expr.op, *[x.expr for x in new_args]))
node.args = new_args
expr = node.expr
elif isinstance(expr, ExprCompose):
new_args = []
new_expr_args = []
for arg in node.args:
arg = self.categorize(arg, lvl=lvl + 1, **kwargs)
new_args.append(arg)
new_expr_args.append(arg.expr)
new_expr = ExprCompose(*new_expr_args)
node = ExprNodeCompose(new_expr)
node.args = new_args
elif isinstance(expr, ExprCond):
cond = self.categorize(node.cond, lvl=lvl + 1, **kwargs)
src1 = self.categorize(node.src1, lvl=lvl + 1, **kwargs)
src2 = self.categorize(node.src2, lvl=lvl + 1, **kwargs)
node = ExprNodeCond(ExprCond(cond.expr, src1.expr, src2.expr))
node.cond, node.src1, node.src2 = cond, src1, src2
else:
raise TypeError("Unknown Expr Type %r", type(expr))
node.info = self.apply_rules(node, lvl=lvl, **kwargs)
log_reduce.debug("\t" * lvl + "Reduce result: %s %r",
node.expr, node.info)
return node
def apply_rules(self, node, lvl=0, **kwargs):
"""Find and apply reduction rules to @node
@node: ExprNode to analyse
@lvl: actuel recursion level
"""
for rule in self.reduction_rules:
ret = rule(self, node, lvl=lvl, **kwargs)
if ret is not None:
log_reduce.debug("\t" * lvl + "Rule found: %r", rule)
return ret
if not self.allow_none_result:
raise RuntimeError('Missing reduction rule for %r' % node.expr)
|