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
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
|
"Helper to quickly build instruction's semantic side effects"
import inspect
import ast
import re
import miasm2.expression.expression as m2_expr
from miasm2.ir.ir import IRBlock
class MiasmTransformer(ast.NodeTransformer):
"""AST visitor translating DSL to Miasm expression
memX[Y] -> ExprMem(Y, X)
iX(Y) -> ExprIntX(Y)
X if Y else Z -> ExprCond(Y, X, Z)
'X'(Y) -> ExprOp('X', Y)
('X' % Y)(Z) -> ExprOp('X' % Y, Z)
{a, b} -> ExprCompose(((a, 0, a.size), (b, a.size, a.size + b.size)))
"""
# Parsers
parse_integer = re.compile("^i([0-9]+)$")
parse_mem = re.compile("^mem([0-9]+)$")
# Visitors
def visit_Call(self, node):
"""iX(Y) -> ExprIntX(Y),
'X'(Y) -> ExprOp('X', Y), ('X' % Y)(Z) -> ExprOp('X' % Y, Z)"""
# Recursive visit
node = self.generic_visit(node)
if isinstance(node.func, ast.Name):
# iX(Y) -> ExprIntX(Y)
fc_name = node.func.id
# Match the function name
new_name = fc_name
integer = self.parse_integer.search(fc_name)
# Do replacement
if integer is not None:
new_name = "ExprInt%s" % integer.groups()[0]
# Replace in the node
node.func.id = new_name
elif (isinstance(node.func, ast.Str) or
(isinstance(node.func, ast.BinOp) and
isinstance(node.func.op, ast.Mod) and
isinstance(node.func.left, ast.Str))):
# 'op'(args...) -> ExprOp('op', args...)
# ('op' % (fmt))(args...) -> ExprOp('op' % (fmt), args...)
op_name = node.func
# Do replacement
node.func = ast.Name(id="ExprOp", ctx=ast.Load())
node.args[0:0] = [op_name]
return node
def visit_Subscript(self, node):
"""memX[Y] -> ExprMem(Y, X)"""
# Recursive visit
node = self.generic_visit(node)
# Detect the syntax
if not isinstance(node.value, ast.Name):
return node
name = node.value.id
mem = self.parse_mem.search(name)
if mem is None:
return node
# Do replacement
addr = self.visit(node.slice.value)
call = ast.Call(func=ast.Name(id='ExprMem', ctx=ast.Load()),
args=[addr, ast.Num(n=int(mem.groups()[0]))],
keywords=[], starargs=None, kwargs=None)
return call
def visit_IfExp(self, node):
"""X if Y else Z -> ExprCond(Y, X, Z)"""
# Recursive visit
node = self.generic_visit(node)
# Build the new ExprCond
call = ast.Call(func=ast.Name(id='ExprCond', ctx=ast.Load()),
args=[self.visit(node.test),
self.visit(node.body),
self.visit(node.orelse)],
keywords=[], starargs=None, kwargs=None)
return call
def visit_Set(self, node):
"{a, b} -> ExprCompose(a, b)"
if len(node.elts) == 0:
return node
# Recursive visit
node = self.generic_visit(node)
return ast.Call(func=ast.Name(id='ExprCompose',
ctx=ast.Load()),
args=node.elts,
keywords=[],
starargs=None,
kwargs=None)
class SemBuilder(object):
"""Helper for building instruction's semantic side effects method
This class provides a decorator @parse to use on them.
The context in which the function will be parsed must be supplied on
instanciation
"""
def __init__(self, ctx):
"""Create a SemBuilder
@ctx: context dictionary used during parsing
"""
# Init
self.transformer = MiasmTransformer()
self._ctx = dict(m2_expr.__dict__)
self._ctx["IRBlock"] = IRBlock
self._functions = {}
# Update context
self._ctx.update(ctx)
@property
def functions(self):
"""Return a dictionary name -> func of parsed functions"""
return self._functions.copy()
@staticmethod
def _create_labels(lbl_else=False):
"""Return the AST standing for label creations
@lbl_else (optional): if set, create a label 'lbl_else'"""
lbl_end = "lbl_end = ExprId(ir.get_next_label(instr), ir.IRDst.size)"
out = ast.parse(lbl_end).body
out += ast.parse("lbl_if = ExprId(ir.gen_label(), ir.IRDst.size)").body
if lbl_else:
out += ast.parse("lbl_else = ExprId(ir.gen_label(), ir.IRDst.size)").body
return out
def _parse_body(self, body, argument_names):
"""Recursive function transforming a @body to a block expression
Return:
- AST to append to body (real python statements)
- a list of blocks, ie list of affblock, ie list of ExprAff (AST)"""
# Init
## Real instructions
real_body = []
## Final blocks
blocks = [[[]]]
for statement in body:
if isinstance(statement, ast.Assign):
src = self.transformer.visit(statement.value)
dst = self.transformer.visit(statement.targets[0])
if (isinstance(dst, ast.Name) and
dst.id not in argument_names and
dst.id not in self._ctx and
dst.id not in self._local_ctx):
# Real variable declaration
statement.value = src
real_body.append(statement)
self._local_ctx[dst.id] = src
continue
dst.ctx = ast.Load()
res = ast.Call(func=ast.Name(id='ExprAff',
ctx=ast.Load()),
args=[dst, src],
keywords=[],
starargs=None,
kwargs=None)
blocks[-1][-1].append(res)
elif (isinstance(statement, ast.Expr) and
isinstance(statement.value, ast.Str)):
# String (docstring, comment, ...) -> keep it
real_body.append(statement)
elif isinstance(statement, ast.If):
# Create jumps : ir.IRDst = lbl_if if cond else lbl_end
# if .. else .. are also handled
cond = statement.test
real_body += self._create_labels(lbl_else=True)
lbl_end = ast.Name(id='lbl_end', ctx=ast.Load())
lbl_if = ast.Name(id='lbl_if', ctx=ast.Load())
lbl_else = ast.Name(id='lbl_else', ctx=ast.Load()) \
if statement.orelse else lbl_end
dst = ast.Call(func=ast.Name(id='ExprCond',
ctx=ast.Load()),
args=[cond,
lbl_if,
lbl_else],
keywords=[],
starargs=None,
kwargs=None)
if (isinstance(cond, ast.UnaryOp) and
isinstance(cond.op, ast.Not)):
## if not cond -> switch exprCond
dst.args[1:] = dst.args[1:][::-1]
dst.args[0] = cond.operand
IRDst = ast.Attribute(value=ast.Name(id='ir',
ctx=ast.Load()),
attr='IRDst', ctx=ast.Load())
blocks[-1][-1].append(ast.Call(func=ast.Name(id='ExprAff',
ctx=ast.Load()),
args=[IRDst, dst],
keywords=[],
starargs=None,
kwargs=None))
# Create the new blocks
elements = [(statement.body, 'lbl_if')]
if statement.orelse:
elements.append((statement.orelse, 'lbl_else'))
for content, lbl_name in elements:
sub_blocks, sub_body = self._parse_body(content,
argument_names)
if len(sub_blocks) > 1:
raise RuntimeError("Imbricated if unimplemented")
## Close the last block
jmp_end = ast.Call(func=ast.Name(id='ExprAff',
ctx=ast.Load()),
args=[IRDst, lbl_end],
keywords=[],
starargs=None,
kwargs=None)
sub_blocks[-1][-1].append(jmp_end)
sub_blocks[-1][-1] = ast.List(elts=sub_blocks[-1][-1],
ctx=ast.Load())
sub_blocks[-1] = ast.List(elts=sub_blocks[-1],
ctx=ast.Load())
## Replace the block with a call to 'IRBlock'
lbl_if_name = ast.Attribute(value=ast.Name(id=lbl_name,
ctx=ast.Load()),
attr='name', ctx=ast.Load())
sub_blocks[-1] = ast.Call(func=ast.Name(id='IRBlock',
ctx=ast.Load()),
args=[lbl_if_name,
sub_blocks[-1]],
keywords=[],
starargs=None,
kwargs=None)
blocks += sub_blocks
real_body += sub_body
# Prepare a new block for following statement
blocks.append([[]])
else:
# TODO: real var, +=, /=, -=, <<=, >>=, if/else, ...
raise RuntimeError("Unimplemented %s" % statement)
return blocks, real_body
def parse(self, func):
"""Function decorator, returning a correct method from a pseudo-Python
one"""
# Get the function AST
parsed = ast.parse(inspect.getsource(func))
fc_ast = parsed.body[0]
argument_names = [name.id for name in fc_ast.args.args]
# Init local cache
self._local_ctx = {}
# Translate (blocks[0][0] is the current instr)
blocks, body = self._parse_body(fc_ast.body, argument_names)
# Build the new function
fc_ast.args.args[0:0] = [ast.Name(id='ir', ctx=ast.Param()),
ast.Name(id='instr', ctx=ast.Param())]
cur_instr = blocks[0][0]
if len(blocks[-1][0]) == 0:
## Last block can be empty
blocks.pop()
other_blocks = blocks[1:]
body.append(ast.Return(value=ast.Tuple(elts=[ast.List(elts=cur_instr,
ctx=ast.Load()),
ast.List(elts=other_blocks,
ctx=ast.Load())],
ctx=ast.Load())))
ret = ast.Module([ast.FunctionDef(name=fc_ast.name,
args=fc_ast.args,
body=body,
decorator_list=[])])
# To display the generated function, use codegen.to_source
# codegen: https://github.com/andreif/codegen
# Compile according to the context
fixed = ast.fix_missing_locations(ret)
codeobj = compile(fixed, '<string>', 'exec')
ctx = self._ctx.copy()
eval(codeobj, ctx)
# Get the function back
self._functions[fc_ast.name] = ctx[fc_ast.name]
return ctx[fc_ast.name]
|