File: cache-bisect.py

package info (click to toggle)
lyx 2.5.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 138,444 kB
  • sloc: cpp: 244,268; ansic: 106,398; xml: 72,791; python: 39,384; sh: 7,666; makefile: 6,584; pascal: 2,143; perl: 2,101; objc: 1,084; tcl: 163; sed: 16
file content (321 lines) | stat: -rwxr-xr-x 8,377 bytes parent folder | download | duplicates (8)
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
#!/usr/bin/python
# -*- coding: utf-8 -*-

import os
from subprocess import call, check_call
from random import randrange
import getpass


outfilename = "/tmp/cache-bisect." + getpass.getuser() + ".log"
outfile = open(outfilename, 'w')
print 'BBBISECT_BEGIN'
#print >> outfile, 'BBBISECT_BEGIN'
#print >> outfile, 'BBBISECT_BEGIN'
#print >> outfile, 'BBBISECT_BEGIN'
#print >> outfile, 'BBBISECT_BEGIN'
#print >> outfile, 'BBBISECT_BEGIN'
#print 'BBBISECT_BEGIN'

source_dir = '/mnt/big/xp/src/lyx-1.6.x-bisect'  # must NOT end in a slash
cache_dir = source_dir + '.cache/'  # must end in a slash
source_dir = '/mnt/big/xp/src/lyx-1.6.x-bisect2'  # must NOT end in a slash

#make_cmd = 'autoconf && ./configure && cd src && echo __________ `pwd` && sleep 9 && make'
make_cmd = 'rm -rf autom4te.cache && autoconf && ./configure && cd src && make'

reverse_search = True
reverse_search = False
must_make = True  # If we fail to make the file, we could this a "bad" rather than "canot test"
must_make = False

# ToDo:
# replace .tmp with .partial_copy and .not_yet_made


def set_revision(new_v, tmp_d):
    #check_call(['svn', 'up', '-r' + new_v, '--force'], cwd=tmp_d)
    os.system ('cd "'+tmp_d+'" && yes tf | svn up -r'+new_v+'--force')

def cmp_version(x, y):
    return cmp(int(x), int(y))


def get_cached_versions():
    vers = [f for f in os.listdir(cache_dir) if not f.count('.')]
    vers.sort(cmp_version)
    return vers


def version_in_range(v, lo, hi):
    if cmp_version(v, lo) < 0:
        return False
    elif cmp_version(v, hi) > 0:
        return False
    return True

def killall_p (s):
    # Unlike killall, this searchs within command parameters, as well as the
    # command name

        #os.system("kPID=`ps a | grep '"+s+"' | grep -v grep | sed 's/^ *//g'|  sed 's/ .*$//'`
    os.system("(kPID=`ps a | grep '"+s+
    "' | grep -v grep | sed 's/^ *//g'|  sed 's/ .*$//'`\n\
        echo kPID $kPID "+s+"\n\
        echo kill $kPID\n\
        kill $kPID\n\
        sleep 0.1\n\
        echo kill -9 $kPID\n\
        kill -9 $kPID) 2> /dev/null")

def clean_up ():
    killall_p("autolyx")
    killall_p("lyx")
    killall_p("keytest.py")
    killall_p("xclip")

def filter_versions(vers, lo, hi):
    return [v for v in vers if cmp]


def ver2dir(v):
    return cache_dir + v


def make_ver(new_v, old_v=None, alt_v=None):
    print 'MAKING', new_v, old_v, alt_v
    new_d = ver2dir(new_v)
    if old_v is None:
        old_d = source_dir
    else:
        old_d = ver2dir(old_v)
    fail_d = new_d + '.fail'
    tmp_d = new_d + '.tmp'
    if os.path.exists(cache_dir + fail_d):
        return 1
    if os.path.exists(new_d):
        return 0
    if not os.path.exists(tmp_d):
        if not os.path.exists(old_d):
            old_d = old_d + '.tmp'
        call(['rm', '-rf', tmp_d + '.cp'])
        call(['cp', '-rvu', old_d, tmp_d + '.cp'])
        check_call(['mv', tmp_d + '.cp', tmp_d])
        set_revision(new_v, tmp_d)
    call('pwd && sleep 5 && echo ' + make_cmd, cwd=tmp_d, shell=True)
    result = call(make_cmd, cwd=tmp_d, shell=True)
    if result == 0:
        print 'Make successful'
        check_call(['mv', tmp_d, new_d])
    return result


def change_after(cmd, v):
    result = run_cmd(cmd, v)
    ca = result_after(result)
    print >> outfile, 'BISECT_change_after', v, ca
    print 'BISECT_change_after', v, ca
    return ca


def change_before(cmd, v):
    result = run_cmd(cmd, v)
    cb = result_before(result)
    print >> outfile, 'BISECT_change_before', v, cb
    print 'BISECT_change_before', v, cb
    return cb


def result_after(i):
    if reverse_search:
        return result_bad(i)
    else:
        return result_good(i)


def result_before(i):
    if reverse_search:
        return result_good(i)
    else:
        return result_bad(i)


def result_good(i):
    return i == 0


def result_bad(i):
    return not result_ugly(i) and not result_good(i)


def result_ugly(i):
    return i == 125  # Like git, we treat 125 as "We cannot test this version"


def run_cmd(cmd, v):
    #result = call('pwd ; echo SS ' + cmd, shell=True, cwd=ver2dir(v))
    print "CMD", cmd
    print "V2D", ver2dir(v)
    os
    #result = subprocess.call(cmd, shell=True, cwd=ver2dir(v))
    result = call(cmd, cwd=ver2dir(v))
    clean_up()
    print cmd, result
    return result


def do_bisect(cmd, vers, build):
    lo = 0
    hi = len(vers) - 1
    m = (lo + hi) / 2

    print lo, hi, m
    print vers[lo], vers[hi], vers[m]
    print vers

    print >> outfile, 'VERS', final_vers

    while len(vers) > 2:
        print 'i', lo, hi, m, cmd
        print 'v', vers[lo], vers[hi], vers[m], cmd
        print vers

        print '#ugly = Nonese'

        if build or must_make:
            ugly = False
            result = make_ver(vers[m], vers[lo], vers[hi])
            print 'AMKE RESULT', result
            if not must_make:
                if result > 0 and not must_make:
                    ugly = True  # Not good, or bad, just ugly.
                else:
                    result = run_cmd(cmd, vers[m])
        if not ugly:
            if result > 127:
                os._exit(1)
            ugly = result_ugly(result)
        if ugly:
            print vers[m] + ' is UGLY'
            del vers[m]
            hi = len(vers) - 1
            m = randrange(0, len(vers))
        else:
            if result_after(result):
                print vers[m] + ' is AFTER'
                del vers[lo:m]
            else:
                print vers[m] + ' is BEFORE'
                del vers[m + 1:hi + 1]
            hi = len(vers) - 1
            m = (lo + hi) / 2

        print 'VERS REMAINING:', vers

    return vers


def check_bisect(cmd, vers):
    lo = 0
    hi = len(vers) - 1
    l = vers[lo]
    h = vers[hi]
    if make_ver(l):
        return False
    if make_ver(h):
        return False
    if change_before(cmd, l):
        print 'Cannot bisect, change before ' + l\
             + ' or regression test invalid'
        return False
    if change_after(cmd, h):
        print 'Cannot bisect, change after ' + h\
             + ' or regression test invalid'
        return False
    return True


def do_check_bisect(cmd, vers, build):
    print vers
    if check_bisect(cmd, vers):
        return do_bisect(cmd, vers, build)
    else:
        return


def open_and_readlines(fname):
    f = open(fname, 'r')
    lines = f.readlines()
    for i in range(0, len(lines)):
        lines[i] = lines[i].rstrip('\n')
    return lines


def get_versions_between(l, h):
    vers = [f for f in open_and_readlines('all_versions')
            if version_in_range(f, l, h)]
    vers.sort(cmp_version)
    return vers


def get_cached_versions_between(l, h):
    vers = [f for f in get_cached_versions() if version_in_range(f, l, h)]
    vers.sort(cmp_version)
    print 'BTWN', l, h, vers
    return vers


def two_level_bisect(cmd, LO, HI):
    if make_ver(LO):
        return False
    if make_ver(HI):
        return False
    vers = get_cached_versions_between(LO, HI)
    print 'CACHED_VERSIONS', vers
    vers = do_check_bisect(cmd, vers, False)
    print 'Closest Cached Versions', vers
    if vers is None:
        return
    if len(vers) != 2:
        return
    vers = get_versions_between(vers[0], vers[1])
    print 'BETWEEN VERSIONS', vers
    vers = do_check_bisect(cmd, vers, True)


def multisect(cmd, vers):
    i = 1
    while i < len(vers):
        print >> outfile, 'MULTISECT', vers[i]
        print 'MULTISECT', vers[i]
        if not ( make_ver(vers[i], vers[i-1])==0 and change_after(cmd, vers[i]) ) :
            i = i + 1
        else:
            return two_level_bisect(cmd, vers[i], vers[0])


print 'BISECT_BEGIN'
print >> outfile, 'BISECT_BEGIN'
outfile.flush()
#final_vers = multisect('$TEST_COMMAND', ['30614', '27418', '23000'])
cmd = os.sys.argv
del cmd[0]

VERS = os.environ.get('MULTISECT_VERS')
if VERS is None:
    VERS = ['30614', '27418', '23000']
else:
    VERS = VERS.split()

final_vers = multisect(cmd, VERS)
#final_vers = two_level_bisect('true', "21107","23000")
#final_vers = do_bisect('true', get_versions_between("21107","23000"),True)
outfile.flush()
print
print >> outfile, 'BISECT_FINAL', final_vers
print 'BISECT_FINAL', final_vers
os.system('echo BISECT_BEGIN >> /tmp/adsfadsf.log')
os.system('echo BISECT_FINAL >> /tmp/adsfadsf.log')

clean_up()
os._exit(0)