comparison mercurial/commands.py @ 49468:816236523765

bisect: avoid adding irrelevant revisions to bisect state When adding new revisions to the bisect state, it only makes sense to add information about revisions that are under consideration (i.e., those that are topologically between the known good and bad revisions). However, if the user passes in a revset (e.g., '!merge()' to exclude merge commits), hg will resolve the revset first and add all matching revisions to the bisect state (which in this case would likely be the majority of revisions in the repo). To avoid this, revisions should only be added to the bisect state if they are between the good and bad revisions (and therefore relevant to the bisection). -- Here are the results of some performance tests using the `mozilla-central` repo (since it is one of the largest freely-available hg repositories in the wild). These tests compare the performance of a locally-built `hg` before and after application of this series. Note that `--noupdate` is passed to avoid including update time (which should not vary across cases). Setup (run between each test): $ hg bisect --reset $ hg bisect --noupdate --bad 56c3ad4bde5c70714b784ccf15d099e0df0f5bde $ hg bisect --noupdate --good 57426696adaf08298af3027fa77486fee0633b13 Test using a revset that returns a very large number of revisions: $ time hg bisect --noupdate --skip '!merge()' > /dev/null Before: real 0m9.398s user 0m9.233s sys 0m0.120s After: real 0m1.513s user 0m1.425s sys 0m0.052s Test using a revset that is expensive to compute: $ time hg bisect --noupdate --skip 'desc("Bug")' > /dev/null Before: real 0m49.853s user 0m49.580s sys 0m0.243s After: real 0m4.120s user 0m4.036s sys 0m0.048s
author Arun Kulshreshtha <akulshreshtha@janestreet.com>
date Tue, 23 Aug 2022 17:31:27 -0400
parents a0b57cabc245
children f2b1bc19ce90
comparison
equal deleted inserted replaced
49467:3ef153aa1eed 49468:816236523765
1033 return 1033 return
1034 1034
1035 state = hbisect.load_state(repo) 1035 state = hbisect.load_state(repo)
1036 1036
1037 if rev: 1037 if rev:
1038 nodes = [repo.changelog.node(i) for i in logcmdutil.revrange(repo, rev)] 1038 revs = logcmdutil.revrange(repo, rev)
1039 goodnodes = state[b'good']
1040 badnodes = state[b'bad']
1041 if goodnodes and badnodes:
1042 candidates = repo.revs(b'(%ln)::(%ln)', goodnodes, badnodes)
1043 candidates += repo.revs(b'(%ln)::(%ln)', badnodes, goodnodes)
1044 revs = candidates & revs
1045 nodes = [repo.changelog.node(i) for i in revs]
1039 else: 1046 else:
1040 nodes = [repo.lookup(b'.')] 1047 nodes = [repo.lookup(b'.')]
1041 1048
1042 # update state 1049 # update state
1043 if good or bad or skip: 1050 if good or bad or skip: