Uh oh!
There was an error while loading. Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpython.py
More file actions
Latest commit
159 lines (117 loc) · 3.89 KB
/
Copy pathpython.py
File metadata and controls
159 lines (117 loc) · 3.89 KB
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
importast
fromengineimportMutator, Engine
importastunparse
classPythonMutator(ast.NodeTransformer, Mutator):
def__init__(self, engine: Engine) ->None:
super().__init__(engine)
defconvert_to_div(self, node):
returnast.Div()
defconvert_to_mult(self, node):
returnast.Mult()
defconvert_to_add(self, node):
returnast.Add()
defconvert_to_sub(self, node):
returnast.Sub()
defconvert_to_and(self, node):
returnast.And()
defconvert_to_or(self, node):
returnast.Or()
defconvert_to_binop_a(self, node: ast.BinOp):
returnnode.left
defconvert_to_binop_b(self, node: ast.BinOp):
returnnode.right
defconvert_to_boolop_a(self, node: ast.BoolOp):
returnnode.values[0]
defconvert_to_boolop_b(self, node: ast.BoolOp):
returnnode.values[1]
defconvert_to_true(self, node):
returnast.NameConstant(value=True)
defconvert_to_false(self, node):
returnast.NameConstant(value=False)
defconvert_to_not(self, node):
returnast.UnaryOp(op=ast.Not(), operand=node)
defconvert_to_gt(self, node):
returnast.Gt()
defconvert_to_lt(self, node):
returnast.Lt()
defconvert_to_gte(self, node):
returnast.GtE()
defconvert_to_lte(self, node):
returnast.LtE()
defconvert_to_eq(self, node):
returnast.Eq()
defconvert_to_neq(self, node):
returnast.NotEq()
defconvert_to_increment(self, node: ast.Constant):
returnast.Constant(value=node.value+1)
defconvert_to_decrement(self, node: ast.Constant):
returnast.Constant(value=node.value-1)
defvisit_BinOp(self, node: ast.BinOp):
mutated=self.mutate_binop_expr(node)
ifmutated==node:
returnself.generic_visit(node)
else:
returnmutated
defvisit_BoolOp(self, node: ast.BoolOp):
mutated=self.mutate_boolop_expr(node)
ifmutated==node:
returnself.generic_visit(node)
else:
returnmutated
defvisit_Constant(self, node: ast.Constant):
iftype(node.value) ==int:
returnself.mutate_number_literal(node)
else: # TODO: mutate bool? i think we shouldn't
returnself.generic_visit(node)
defvisit_Sub(self, node):
returnself.mutate_aor_op(node, "-")
defvisit_Add(self, node):
returnself.mutate_aor_op(node, "+")
defvisit_Mult(self, node):
returnself.mutate_aor_op(node, "*")
defvisit_Div(self, node):
returnself.mutate_aor_op(node, "/")
defvisit_And(self, node):
returnself.mutate_lcr(node, "and")
defvisit_Or(self, node):
returnself.mutate_lcr(node, "or")
defvisit_Gt(self, node):
returnself.mutate_ror(node, ">")
defvisit_Lt(self, node):
returnself.mutate_ror(node, "<")
defvisit_GtE(self, node):
returnself.mutate_ror(node, ">=")
defvisit_LtE(self, node):
returnself.mutate_ror(node, "<=")
defvisit_Eq(self, node):
returnself.mutate_ror(node, "==")
defvisit_NotEq(self, node):
returnself.mutate_ror(node, "!=")
if__name__=="__main__":
importos
CODE="""
def func(a, b):
bleh = 1337
if a > b > b and True and True or False:
return a - b
elif a < b:
return b - a
else: # a == b
return 0
"""
tree=ast.parse(CODE)
print(ast.dump(tree))
engine=Engine(
seed=int(os.urandom(4).hex(), 16)
)
mutated_set=set()
foriinrange(100):
mutator=PythonMutator(engine)
tree=ast.parse(CODE)
mutated=mutator.visit(tree)
ifengine.mutations==0:
continue
mutated_set.add(astunparse.unparse(mutated))
engine=engine.new()
forminmutated_set:
print(m)