def findBlamedCset(options, repoDir, testRev):
print "%s | Bisecting on: %s" % (sps.dateStr(), repoDir)
hgPrefix = ['hg', '-R', repoDir]
# Resolve names such as "tip", "default", or "52707" to stable hg hash ids, e.g. "9f2641871ce8".
realStartRepo = sRepo = hgCmds.getRepoHashAndId(
repoDir, repoRev=options.startRepo)[0]
realEndRepo = eRepo = hgCmds.getRepoHashAndId(repoDir,
repoRev=options.endRepo)[0]
sps.vdump("Bisecting in the range " + sRepo + ":" + eRepo)
# Refresh source directory (overwrite all local changes) to default tip if required.
if options.resetRepoFirst:
subprocess.check_call(hgPrefix + ['update', '-C', 'default'])
# Throws exit code 255 if purge extension is not enabled in .hgrc:
subprocess.check_call(hgPrefix + ['purge', '--all'])
# Reset bisect ranges and set skip ranges.
sps.captureStdout(hgPrefix + ['bisect', '-r'])
if options.skipRevs:
sps.captureStdout(hgPrefix + ['bisect', '--skip', options.skipRevs])
labels = {}
# Specify `hg bisect` ranges.
if options.testInitialRevs:
currRev = eRepo # If testInitialRevs mode is set, compile and test the latest rev first.
else:
labels[sRepo] = ('good', 'assumed start rev is good')
labels[eRepo] = ('bad', 'assumed end rev is bad')
subprocess.check_call(hgPrefix + ['bisect', '-U', '-g', sRepo])
currRev = hgCmds.getCsetHashFromBisectMsg(
fileManipulation.firstLine(
sps.captureStdout(hgPrefix +
['bisect', '-U', '-b', eRepo])[0]))
iterNum = 1
if options.testInitialRevs:
iterNum -= 2
skipCount = 0
blamedRev = None
while currRev is not None:
startTime = time.time()
label = testRev(currRev)
labels[currRev] = label
if label[0] == 'skip':
skipCount += 1
# If we use "skip", we tell hg bisect to do a linear search to get around the skipping.
# If the range is large, doing a bisect to find the start and endpoints of compilation
# bustage would be faster. 20 total skips being roughly the time that the pair of
# bisections would take.
if skipCount > 20:
print 'Skipped 20 times, stopping autoBisect.'
break
print label[0] + " (" + label[1] + ") ",
if iterNum <= 0:
print 'Finished testing the initial boundary revisions...',
else:
print "Bisecting for the n-th round where n is", iterNum, "and 2^n is", \
str(2**iterNum), "...",
(blamedGoodOrBad, blamedRev, currRev, sRepo, eRepo) = \
bisectLabel(hgPrefix, options, label[0], currRev, sRepo, eRepo)
if options.testInitialRevs:
options.testInitialRevs = False
assert currRev is None
currRev = sRepo # If options.testInitialRevs is set, test earliest possible rev next.
iterNum += 1
endTime = time.time()
oneRunTime = endTime - startTime
print 'This iteration took %.3f seconds to run.' % oneRunTime
if blamedRev is not None:
checkBlameParents(repoDir, blamedRev, blamedGoodOrBad, labels, testRev,
realStartRepo, realEndRepo)
sps.vdump("Resetting bisect")
subprocess.check_call(hgPrefix + ['bisect', '-U', '-r'])
sps.vdump("Resetting working directory")
sps.captureStdout(hgPrefix + ['update', '-C', '-r', 'default'],
ignoreStderr=True)
hgCmds.destroyPyc(repoDir)
print sps.dateStr()
def findBlamedCset(options, repoDir, testRev):
print sps.dateStr()
hgPrefix = ['hg', '-R', repoDir]
# Resolve names such as "tip", "default", or "52707" to stable hg hash ids, e.g. "9f2641871ce8".
realStartRepo = sRepo = hgCmds.getRepoHashAndId(repoDir, repoRev=options.startRepo)[0]
realEndRepo = eRepo = hgCmds.getRepoHashAndId(repoDir, repoRev=options.endRepo)[0]
sps.vdump("Bisecting in the range " + sRepo + ":" + eRepo)
# Refresh source directory (overwrite all local changes) to default tip if required.
if options.resetRepoFirst:
subprocess.check_call(hgPrefix + ['update', '-C', 'default'])
# Throws exit code 255 if purge extension is not enabled in .hgrc:
subprocess.check_call(hgPrefix + ['purge', '--all'])
# Reset bisect ranges and set skip ranges.
sps.captureStdout(hgPrefix + ['bisect', '-r'])
if options.skipRevs:
sps.captureStdout(hgPrefix + ['bisect', '--skip', options.skipRevs])
labels = {}
# Specify `hg bisect` ranges.
if options.testInitialRevs:
currRev = eRepo # If testInitialRevs mode is set, compile and test the latest rev first.
else:
labels[sRepo] = ('good', 'assumed start rev is good')
labels[eRepo] = ('bad', 'assumed end rev is bad')
subprocess.check_call(hgPrefix + ['bisect', '-U', '-g', sRepo])
currRev = hgCmds.getCsetHashFromBisectMsg(fileManipulation.firstLine(
sps.captureStdout(hgPrefix + ['bisect', '-U', '-b', eRepo])[0]))
iterNum = 1
if options.testInitialRevs:
iterNum -= 2
skipCount = 0
blamedRev = None
while currRev is not None:
startTime = time.time()
label = testRev(currRev)
labels[currRev] = label
if label[0] == 'skip':
skipCount += 1
# If we use "skip", we tell hg bisect to do a linear search to get around the skipping.
# If the range is large, doing a bisect to find the start and endpoints of compilation
# bustage would be faster. 20 total skips being roughly the time that the pair of
# bisections would take.
if skipCount > 20:
print 'Skipped 20 times, stopping autoBisect.'
break
print label[0] + " (" + label[1] + ") ",
if iterNum <= 0:
print 'Finished testing the initial boundary revisions...',
else:
print "Bisecting for the n-th round where n is", iterNum, "and 2^n is", \
str(2**iterNum), "...",
(blamedGoodOrBad, blamedRev, currRev, sRepo, eRepo) = \
bisectLabel(hgPrefix, options, label[0], currRev, sRepo, eRepo)
if options.testInitialRevs:
options.testInitialRevs = False
assert currRev is None
currRev = sRepo # If options.testInitialRevs is set, test earliest possible rev next.
iterNum += 1
endTime = time.time()
oneRunTime = endTime - startTime
print 'This iteration took %.3f seconds to run.' % oneRunTime
if blamedRev is not None:
checkBlameParents(repoDir, blamedRev, blamedGoodOrBad, labels, testRev, realStartRepo,
realEndRepo)
sps.vdump("Resetting bisect")
subprocess.check_call(hgPrefix + ['bisect', '-U', '-r'])
sps.vdump("Resetting working directory")
sps.captureStdout(hgPrefix + ['update', '-C', '-r', 'default'], ignoreStderr=True)
hgCmds.destroyPyc(repoDir)
print sps.dateStr()