forked from emscripten-core/emscripten
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbisect_pair.py
More file actions
94 lines (79 loc) · 3.17 KB
/
bisect_pair.py
File metadata and controls
94 lines (79 loc) · 3.17 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
# Copyright 2017 The Emscripten Authors. All rights reserved.
# Emscripten is available under two separate licenses, the MIT license and the
# University of Illinois/NCSA Open Source License. Both these licenses can be
# found in the LICENSE file.
'''
Given two similar files, for example one with an additional optimization pass,
and with different results, will bisect between them to find the smallest
diff that makes the outputs different.
'''
from __future__ import print_function
import os, sys, shutil
from subprocess import Popen, PIPE, STDOUT
__rootpath__ = os.path.abspath(os.path.dirname(os.path.dirname(__file__)))
def path_from_root(*pathelems):
return os.path.join(__rootpath__, *pathelems)
exec(open(path_from_root('tools', 'shared.py'), 'r').read())
file1 = open(sys.argv[1]).read()
file2 = open(sys.argv[2]).read()
leftf = open('left', 'w')
leftf.write(file1)
leftf.close()
rightf = open('right', 'w')
rightf.write(file2)
rightf.close()
def run_code(name):
ret = run_js(name, stderr=PIPE, full_output=True, assert_returncode=None, engine=SPIDERMONKEY_ENGINE)
# fix stack traces
ret = [line for line in ret.split('\n') if not line.startswith(' at ') and not name in line]
return '\n'.join(ret)
print('running files')
left_result = run_code('left')
right_result = run_code('right') # right as in left-right, not as in correct
assert left_result != right_result
# Calculate diff chunks
print('diffing')
diff = run_process(['diff', '-U', '5', 'left', 'right'], stdout=PIPE).stdout.split('\n')
pre_diff = diff[:2]
diff = diff[2:]
chunks = []
curr = []
for i in range(len(diff)):
if diff[i].startswith('@'):
if len(curr):
chunks.append(curr)
curr = [diff[i]]
else:
curr.append(diff[i])
if len(curr):
chunks.append(curr)
# Bisect both sides of the span, until we have a single chunk
high = len(chunks)
print('beginning bisection, %d chunks' % high)
for mid in range(high):
print(' current: %d' % mid, end=' ')
# Take chunks from the middle and on. This is important because the eliminator removes variables, so starting from the beginning will add errors
curr_diff = '\n'.join(['\n'.join(parts) for parts in chunks[mid:]]) + '\n'
difff = open('diff.diff', 'w')
difff.write(curr_diff)
difff.close()
shutil.copy('left', 'middle')
Popen(['patch', 'middle', 'diff.diff'], stdout=PIPE).communicate()
shutil.copyfile('middle', 'middle' + str(mid))
result = run_code('middle')
print(result == left_result, result == right_result)#, 'XXX', left_result, 'YYY', result, 'ZZZ', right_result
if mid == 0:
assert result == right_result, '<<< ' + result + ' ??? ' + right_result + ' >>>'
print('sanity check passed (a)')
if mid == high-1:
assert result == left_result, '<<< ' + result + ' ??? ' + left_result + ' >>>'
print('sanity check passed (b)')
if result != right_result:
print('found where it changes: %d' % mid)
found = mid
break
critical = run_process(['diff', '-U', '5', 'middle' + str(mid-1), 'middle' + str(mid)], stdout=PIPE).stdout
c = open('critical.diff', 'w')
c.write(critical)
c.close()
print('middle%d is like left, middle%d is like right, critical.diff is the difference that matters' % (mid-1, mid), 'diff:', critical)