Mercurial > public > mercurial-scm > hg
view mercurial/upgrade.py @ 45892:06b64fabf91c
copies: cache the ancestor checking call when tracing copy
A good share of the time spent in this function is spent doing ancestors
checking. To avoid spending time in duplicated call, we cache the result of
calls.
In the slower case, this provide a quite significant performance boost. Below
are the result for a set of selected pairs (many of them pathological):
(And further down is another table that summarize the current state of filelog
based vs changeset base copy tracing)
The benchmark have been configured to be killed after 6 minutes of runtime,
which mean that any detect slower than 2 minutes will be marked as "killed".
This drop some useful information about how much slower these case are? but also
prevent 99% of the benchmark time to be spent on case that can be labelled "very
slow" anyway.
Repo Case Source-Rev Dest-Rev Old-Time New-Time Difference Factor
------------------------------------------------------------------------------------------------------------------------------------
mercurial x_revs_x_added_0_copies ad6b123de1c7 39cfcef4f463 : 0.000044 s, 0.000044 s, +0.000000 s, ? 1.0000
mercurial x_revs_x_added_x_copies 2b1c78674230 0c1d10351869 : 0.000138 s, 0.000138 s, +0.000000 s, ? 1.0000
mercurial x000_revs_x000_added_x_copies 81f8ff2a9bf2 dd3267698d84 : 0.005067 s, 0.005052 s, -0.000015 s, ? 0.9970
pypy x_revs_x_added_0_copies aed021ee8ae8 099ed31b181b : 0.000218 s, 0.000219 s, +0.000001 s, ? 1.0046
pypy x_revs_x000_added_0_copies 4aa4e1f8e19a 359343b9ac0e : 0.000053 s, 0.000055 s, +0.000002 s, ? 1.0377
pypy x_revs_x_added_x_copies ac52eb7bbbb0 72e022663155 : 0.000125 s, 0.000128 s, +0.000003 s, ? 1.0240
pypy x_revs_x00_added_x_copies c3b14617fbd7 ace7255d9a26 : 0.001098 s, 0.001089 s, -0.000009 s, ? 0.9918
pypy x_revs_x000_added_x000_copies df6f7a526b60 a83dc6a2d56f : 0.017546 s, 0.017407 s, -0.000139 s, ? 0.9921
pypy x000_revs_xx00_added_0_copies 89a76aede314 2f22446ff07e : 0.096723 s, 0.094175 s, -0.002548 s, ? 0.9737
pypy x000_revs_x000_added_x_copies 8a3b5bfd266e 2c68e87c3efe : 0.271796 s, 0.238009 s, -0.033787 s, ? 0.8757
pypy x000_revs_x000_added_x000_copies 89a76aede314 7b3dda341c84 : 0.128602 s, 0.125876 s, -0.002726 s, ? 0.9788
pypy x0000_revs_x_added_0_copies d1defd0dc478 c9cb1334cc78 : 7.086742 s, 3.581556 s, -3.505186 s, ? 0.5054
pypy x0000_revs_xx000_added_0_copies bf2c629d0071 4ffed77c095c : 0.016634 s, 0.016721 s, +0.000087 s, ? 1.0052
pypy x0000_revs_xx000_added_x000_copies 08ea3258278e d9fa043f30c0 : 0.254225 s, 0.242367 s, -0.011858 s, ? 0.9534
netbeans x_revs_x_added_0_copies fb0955ffcbcd a01e9239f9e7 : 0.000166 s, 0.000165 s, -0.000001 s, ? 0.9940
netbeans x_revs_x000_added_0_copies 6f360122949f 20eb231cc7d0 : 0.000118 s, 0.000114 s, -0.000004 s, ? 0.9661
netbeans x_revs_x_added_x_copies 1ada3faf6fb6 5a39d12eecf4 : 0.000296 s, 0.000296 s, +0.000000 s, ? 1.0000
netbeans x_revs_x00_added_x_copies 35be93ba1e2c 9eec5e90c05f : 0.001137 s, 0.001124 s, -0.000013 s, ? 0.9886
netbeans x000_revs_xx00_added_0_copies eac3045b4fdd 51d4ae7f1290 : 0.014133 s, 0.013060 s, -0.001073 s, ? 0.9241
netbeans x000_revs_x000_added_x_copies e2063d266acd 6081d72689dc : 0.016988 s, 0.017112 s, +0.000124 s, ? 1.0073
netbeans x000_revs_x000_added_x000_copies ff453e9fee32 411350406ec2 : 0.676361 s, 0.660350 s, -0.016011 s, ? 0.9763
netbeans x0000_revs_xx000_added_x000_copies 588c2d1ced70 1aad62e59ddd : 12.515149 s, 10.032499 s, -2.482650 s, ? 0.8016
mozilla-central x_revs_x_added_0_copies 3697f962bb7b 7015fcdd43a2 : 0.000186 s, 0.000189 s, +0.000003 s, ? 1.0161
mozilla-central x_revs_x000_added_0_copies dd390860c6c9 40d0c5bed75d : 0.000459 s, 0.000462 s, +0.000003 s, ? 1.0065
mozilla-central x_revs_x_added_x_copies 8d198483ae3b 14207ffc2b2f : 0.000273 s, 0.000270 s, -0.000003 s, ? 0.9890
mozilla-central x_revs_x00_added_x_copies 98cbc58cc6bc 446a150332c3 : 0.001503 s, 0.001474 s, -0.000029 s, ? 0.9807
mozilla-central x_revs_x000_added_x000_copies 3c684b4b8f68 0a5e72d1b479 : 0.004862 s, 0.004806 s, -0.000056 s, ? 0.9885
mozilla-central x_revs_x0000_added_x0000_copies effb563bb7e5 c07a39dc4e80 : 0.088291 s, 0.085150 s, -0.003141 s, ? 0.9644
mozilla-central x000_revs_xx00_added_0_copies 6100d773079a 04a55431795e : 0.007113 s, 0.007064 s, -0.000049 s, ? 0.9931
mozilla-central x000_revs_x000_added_x_copies 9f17a6fc04f9 2d37b966abed : 0.004687 s, 0.004741 s, +0.000054 s, ? 1.0115
mozilla-central x000_revs_x000_added_x000_copies 7c97034feb78 4407bd0c6330 : 0.198710 s, 0.190133 s, -0.008577 s, ? 0.9568
mozilla-central x0000_revs_xx000_added_0_copies 9eec5917337d 67118cc6dcad : 0.036068 s, 0.035651 s, -0.000417 s, ? 0.9884
mozilla-central x0000_revs_xx000_added_x000_copies f78c615a656c 96a38b690156 : 0.465362 s, 0.440694 s, -0.024668 s, ? 0.9470
mozilla-central x00000_revs_x0000_added_x0000_copies 6832ae71433c 4c222a1d9a00 : 24.519684 s, 18.454163 s, -6.065521 s, ? 0.7526
mozilla-central x00000_revs_x00000_added_x000_copies 76caed42cf7c 1daa622bbe42 : 42.711897 s, 31.562719 s, -11.149178 s, ? 0.7390
mozilla-try x_revs_x_added_0_copies aaf6dde0deb8 9790f499805a : 0.001201 s, 0.001189 s, -0.000012 s, ? 0.9900
mozilla-try x_revs_x000_added_0_copies d8d0222927b4 5bb8ce8c7450 : 0.001216 s, 0.001204 s, -0.000012 s, ? 0.9901
mozilla-try x_revs_x_added_x_copies 092fcca11bdb 936255a0384a : 0.000595 s, 0.000586 s, -0.000009 s, ? 0.9849
mozilla-try x_revs_x00_added_x_copies b53d2fadbdb5 017afae788ec : 0.001856 s, 0.001845 s, -0.000011 s, ? 0.9941
mozilla-try x_revs_x000_added_x000_copies 20408ad61ce5 6f0ee96e21ad : 0.064936 s, 0.063822 s, -0.001114 s, ? 0.9828
mozilla-try x_revs_x0000_added_x0000_copies effb563bb7e5 c07a39dc4e80 : 0.090601 s, 0.088038 s, -0.002563 s, ? 0.9717
mozilla-try x000_revs_xx00_added_0_copies 6100d773079a 04a55431795e : 0.007510 s, 0.007389 s, -0.000121 s, ? 0.9839
mozilla-try x000_revs_x000_added_x_copies 9f17a6fc04f9 2d37b966abed : 0.004911 s, 0.004868 s, -0.000043 s, ? 0.9912
mozilla-try x000_revs_x000_added_x000_copies 1346fd0130e4 4c65cbdabc1f : 0.233231 s, 0.222450 s, -0.010781 s, ? 0.9538
mozilla-try x0000_revs_x_added_0_copies 63519bfd42ee a36a2a865d92 : 0.419989 s, 0.370675 s, -0.049314 s, ? 0.8826
mozilla-try x0000_revs_x_added_x_copies 9fe69ff0762d bcabf2a78927 : 0.401521 s, 0.358020 s, -0.043501 s, ? 0.8917
mozilla-try x0000_revs_xx000_added_x_copies 156f6e2674f2 4d0f2c178e66 : 0.179555 s, 0.145235 s, -0.034320 s, ? 0.8089
mozilla-try x0000_revs_xx000_added_0_copies 9eec5917337d 67118cc6dcad : 0.038004 s, 0.037606 s, -0.000398 s, ? 0.9895
mozilla-try x0000_revs_xx000_added_x000_copies 89294cd501d9 7ccb2fc7ccb5 : 52.838482 s, 7.382439 s, -45.456043 s, ? 0.1397
mozilla-try x0000_revs_x0000_added_x0000_copies e928c65095ed e951f4ad123a : 8.705874 s, 7.273506 s, -1.432368 s, ? 0.8355
mozilla-try x00000_revs_x00000_added_0_copies dc8a3ca7010e d16fde900c9c : 1.126708 s, 1.074593 s, -0.052115 s, ? 0.9537
mozilla-try x00000_revs_x0000_added_x0000_copies 8d3fafa80d4b eb884023b810 : 83.854020 s, 27.746195 s, -56.107825 s, ? 0.3309
Below is a table comparing the runtime of the current "filelog centric"
algorithm, with the "changeset centric" one, we just modified.
The changeset centric algorithm is a significant win in many scenario, but they
are still various cases where it is quite slower. When many revision has to be
considered the cost of retrieving the copy information, creating new
dictionaries, merging dictionaries and checking if revision are ancestors of
each other can slow things down.
The rest of this series, will introduce a rust version of the copy tracing code
to deal with most of theses issues.
Repo Case Source-Rev Dest-Rev filelog sidedata Difference Factor
---------------------------------------------------------------------------------------------------------------------------------------
mercurial x_revs_x_added_0_copies ad6b123de1c7 39cfcef4f463 : 0.000914 s, 0.000044 s, - 0.000870 s, ? 0.048140
mercurial x_revs_x_added_x_copies 2b1c78674230 0c1d10351869 : 0.001812 s, 0.000138 s, - 0.001674 s, ? 0.076159
mercurial x000_revs_x000_added_x_copies 81f8ff2a9bf2 dd3267698d84 : 0.017954 s, 0.005052 s, - 0.012902 s, ? 0.281386
pypy x_revs_x_added_0_copies aed021ee8ae8 099ed31b181b : 0.001509 s, 0.000219 s, - 0.001290 s, ? 0.145129
pypy x_revs_x000_added_0_copies 4aa4e1f8e19a 359343b9ac0e : 0.206881 s, 0.000055 s, - 0.206826 s, ? 0.000266
pypy x_revs_x_added_x_copies ac52eb7bbbb0 72e022663155 : 0.016951 s, 0.000128 s, - 0.016823 s, ? 0.007551
pypy x_revs_x00_added_x_copies c3b14617fbd7 ace7255d9a26 : 0.019096 s, 0.001089 s, - 0.018007 s, ? 0.057028
pypy x_revs_x000_added_x000_copies df6f7a526b60 a83dc6a2d56f : 0.762506 s, 0.017407 s, - 0.745099 s, ? 0.022829
pypy x000_revs_xx00_added_0_copies 89a76aede314 2f22446ff07e : 1.179211 s, 0.094175 s, - 1.085036 s, ? 0.079863
pypy x000_revs_x000_added_x_copies 8a3b5bfd266e 2c68e87c3efe : 1.249058 s, 0.238009 s, - 1.011049 s, ? 0.190551
pypy x000_revs_x000_added_x000_copies 89a76aede314 7b3dda341c84 : 1.614107 s, 0.125876 s, - 1.488231 s, ? 0.077985
pypy x0000_revs_x_added_0_copies d1defd0dc478 c9cb1334cc78 : 0.001064 s, 3.581556 s, + 3.580492 s, ? 3366.124060
pypy x0000_revs_xx000_added_0_copies bf2c629d0071 4ffed77c095c : 1.061275 s, 0.016721 s, - 1.044554 s, ? 0.015756
pypy x0000_revs_xx000_added_x000_copies 08ea3258278e d9fa043f30c0 : 1.341119 s, 0.242367 s, - 1.098752 s, ? 0.180720
netbeans x_revs_x_added_0_copies fb0955ffcbcd a01e9239f9e7 : 0.027803 s, 0.000165 s, - 0.027638 s, ? 0.005935
netbeans x_revs_x000_added_0_copies 6f360122949f 20eb231cc7d0 : 0.130014 s, 0.000114 s, - 0.129900 s, ? 0.000877
netbeans x_revs_x_added_x_copies 1ada3faf6fb6 5a39d12eecf4 : 0.024990 s, 0.000296 s, - 0.024694 s, ? 0.011845
netbeans x_revs_x00_added_x_copies 35be93ba1e2c 9eec5e90c05f : 0.052201 s, 0.001124 s, - 0.051077 s, ? 0.021532
netbeans x000_revs_xx00_added_0_copies eac3045b4fdd 51d4ae7f1290 : 0.037642 s, 0.013060 s, - 0.024582 s, ? 0.346953
netbeans x000_revs_x000_added_x_copies e2063d266acd 6081d72689dc : 0.197086 s, 0.017112 s, - 0.179974 s, ? 0.086825
netbeans x000_revs_x000_added_x000_copies ff453e9fee32 411350406ec2 : 0.935148 s, 0.660350 s, - 0.274798 s, ? 0.706145
netbeans x0000_revs_xx000_added_x000_copies 588c2d1ced70 1aad62e59ddd : 3.920674 s, 10.032499 s, + 6.111825 s, ? 2.558871
mozilla-central x_revs_x_added_0_copies 3697f962bb7b 7015fcdd43a2 : 0.024232 s, 0.000189 s, - 0.024043 s, ? 0.007800
mozilla-central x_revs_x000_added_0_copies dd390860c6c9 40d0c5bed75d : 0.141483 s, 0.000462 s, - 0.141021 s, ? 0.003265
mozilla-central x_revs_x_added_x_copies 8d198483ae3b 14207ffc2b2f : 0.025775 s, 0.000270 s, - 0.025505 s, ? 0.010475
mozilla-central x_revs_x00_added_x_copies 98cbc58cc6bc 446a150332c3 : 0.084922 s, 0.001474 s, - 0.083448 s, ? 0.017357
mozilla-central x_revs_x000_added_x000_copies 3c684b4b8f68 0a5e72d1b479 : 0.194784 s, 0.004806 s, - 0.189978 s, ? 0.024673
mozilla-central x_revs_x0000_added_x0000_copies effb563bb7e5 c07a39dc4e80 : 2.161103 s, 0.085150 s, - 2.075953 s, ? 0.039401
mozilla-central x000_revs_xx00_added_0_copies 6100d773079a 04a55431795e : 0.089347 s, 0.007064 s, - 0.082283 s, ? 0.079063
mozilla-central x000_revs_x000_added_x_copies 9f17a6fc04f9 2d37b966abed : 0.732171 s, 0.004741 s, - 0.727430 s, ? 0.006475
mozilla-central x000_revs_x000_added_x000_copies 7c97034feb78 4407bd0c6330 : 1.157287 s, 0.190133 s, - 0.967154 s, ? 0.164292
mozilla-central x0000_revs_xx000_added_0_copies 9eec5917337d 67118cc6dcad : 6.726568 s, 0.035651 s, - 6.690917 s, ? 0.005300
mozilla-central x0000_revs_xx000_added_x000_copies f78c615a656c 96a38b690156 : 3.266229 s, 0.440694 s, - 2.825535 s, ? 0.134924
mozilla-central x00000_revs_x0000_added_x0000_copies 6832ae71433c 4c222a1d9a00 : 15.860534 s, 18.454163 s, + 2.593629 s, ? 1.163527
mozilla-central x00000_revs_x00000_added_x000_copies 76caed42cf7c 1daa622bbe42 : 20.450475 s, 31.562719 s, +11.112244 s, ? 1.543373
mozilla-try x_revs_x_added_0_copies aaf6dde0deb8 9790f499805a : 0.080442 s, 0.001189 s, - 0.079253 s, ? 0.014781
mozilla-try x_revs_x000_added_0_copies d8d0222927b4 5bb8ce8c7450 : 0.497672 s, 0.001204 s, - 0.496468 s, ? 0.002419
mozilla-try x_revs_x_added_x_copies 092fcca11bdb 936255a0384a : 0.021183 s, 0.000586 s, - 0.020597 s, ? 0.027664
mozilla-try x_revs_x00_added_x_copies b53d2fadbdb5 017afae788ec : 0.230991 s, 0.001845 s, - 0.229146 s, ? 0.007987
mozilla-try x_revs_x000_added_x000_copies 20408ad61ce5 6f0ee96e21ad : 1.118461 s, 0.063822 s, - 1.054639 s, ? 0.057062
mozilla-try x_revs_x0000_added_x0000_copies effb563bb7e5 c07a39dc4e80 : 2.206083 s, 0.088038 s, - 2.118045 s, ? 0.039907
mozilla-try x000_revs_xx00_added_0_copies 6100d773079a 04a55431795e : 0.089404 s, 0.007389 s, - 0.082015 s, ? 0.082647
mozilla-try x000_revs_x000_added_x_copies 9f17a6fc04f9 2d37b966abed : 0.733043 s, 0.004868 s, - 0.728175 s, ? 0.006641
mozilla-try x000_revs_x000_added_x000_copies 1346fd0130e4 4c65cbdabc1f : 1.163367 s, 0.222450 s, - 0.940917 s, ? 0.191212
mozilla-try x0000_revs_x_added_0_copies 63519bfd42ee a36a2a865d92 : 0.085456 s, 0.370675 s, + 0.285219 s, ? 4.337612
mozilla-try x0000_revs_x_added_x_copies 9fe69ff0762d bcabf2a78927 : 0.083601 s, 0.358020 s, + 0.274419 s, ? 4.282485
mozilla-try x0000_revs_xx000_added_x_copies 156f6e2674f2 4d0f2c178e66 : 7.366614 s, 0.145235 s, - 7.221379 s, ? 0.019715
mozilla-try x0000_revs_xx000_added_0_copies 9eec5917337d 67118cc6dcad : 6.664464 s, 0.037606 s, - 6.626858 s, ? 0.005643
mozilla-try x0000_revs_xx000_added_x000_copies 89294cd501d9 7ccb2fc7ccb5 : 7.467836 s, 7.382439 s, - 0.085397 s, ? 0.988565
mozilla-try x0000_revs_x0000_added_x0000_copies e928c65095ed e951f4ad123a : 9.801294 s, 7.273506 s, - 2.527788 s, ? 0.742097
mozilla-try x00000_revs_x_added_0_copies 6a320851d377 1ebb79acd503 : 0.091886 s, killed
mozilla-try x00000_revs_x00000_added_0_copies dc8a3ca7010e d16fde900c9c : 26.491140 s, 1.074593 s, -25.416547 s, ? 0.040564
mozilla-try x00000_revs_x_added_x_copies 5173c4b6f97c 95d83ee7242d : 0.092863 s, killed
mozilla-try x00000_revs_x000_added_x_copies 9126823d0e9c ca82787bb23c : 0.226823 s, killed
mozilla-try x00000_revs_x0000_added_x0000_copies 8d3fafa80d4b eb884023b810 : 18.914630 s, 27.746195 s, + 8.831565 s, ? 1.466917
mozilla-try x00000_revs_x00000_added_x0000_copies 1b661134e2ca 1ae03d022d6d : 21.198903 s, killed
mozilla-try x00000_revs_x00000_added_x000_copies 9b2a99adc05e 8e29777b48e6 : 24.952268 s, killed
Differential Revision: https://phab.mercurial-scm.org/D9296
author | Pierre-Yves David <pierre-yves.david@octobus.net> |
---|---|
date | Mon, 02 Nov 2020 11:03:56 +0100 |
parents | edf4fa06df94 |
children | fe7d7917ceb5 |
line wrap: on
line source
# upgrade.py - functions for in place upgrade of Mercurial repository # # Copyright (c) 2016-present, Gregory Szorc # # This software may be used and distributed according to the terms of the # GNU General Public License version 2 or any later version. from __future__ import absolute_import import stat from .i18n import _ from .pycompat import getattr from . import ( changelog, error, filelog, hg, localrepo, manifest, metadata, pycompat, requirements, revlog, scmutil, util, vfs as vfsmod, ) from .utils import compression # list of requirements that request a clone of all revlog if added/removed RECLONES_REQUIREMENTS = { b'generaldelta', requirements.SPARSEREVLOG_REQUIREMENT, } def requiredsourcerequirements(repo): """Obtain requirements required to be present to upgrade a repo. An upgrade will not be allowed if the repository doesn't have the requirements returned by this function. """ return { # Introduced in Mercurial 0.9.2. b'revlogv1', # Introduced in Mercurial 0.9.2. b'store', } def blocksourcerequirements(repo): """Obtain requirements that will prevent an upgrade from occurring. An upgrade cannot be performed if the source repository contains a requirements in the returned set. """ return { # The upgrade code does not yet support these experimental features. # This is an artificial limitation. requirements.TREEMANIFEST_REQUIREMENT, # This was a precursor to generaldelta and was never enabled by default. # It should (hopefully) not exist in the wild. b'parentdelta', # Upgrade should operate on the actual store, not the shared link. requirements.SHARED_REQUIREMENT, } def supportremovedrequirements(repo): """Obtain requirements that can be removed during an upgrade. If an upgrade were to create a repository that dropped a requirement, the dropped requirement must appear in the returned set for the upgrade to be allowed. """ supported = { requirements.SPARSEREVLOG_REQUIREMENT, requirements.SIDEDATA_REQUIREMENT, requirements.COPIESSDC_REQUIREMENT, requirements.NODEMAP_REQUIREMENT, } for name in compression.compengines: engine = compression.compengines[name] if engine.available() and engine.revlogheader(): supported.add(b'exp-compression-%s' % name) if engine.name() == b'zstd': supported.add(b'revlog-compression-zstd') return supported def supporteddestrequirements(repo): """Obtain requirements that upgrade supports in the destination. If the result of the upgrade would create requirements not in this set, the upgrade is disallowed. Extensions should monkeypatch this to add their custom requirements. """ supported = { b'dotencode', b'fncache', b'generaldelta', b'revlogv1', b'store', requirements.SPARSEREVLOG_REQUIREMENT, requirements.SIDEDATA_REQUIREMENT, requirements.COPIESSDC_REQUIREMENT, requirements.NODEMAP_REQUIREMENT, requirements.SHARESAFE_REQUIREMENT, } for name in compression.compengines: engine = compression.compengines[name] if engine.available() and engine.revlogheader(): supported.add(b'exp-compression-%s' % name) if engine.name() == b'zstd': supported.add(b'revlog-compression-zstd') return supported def allowednewrequirements(repo): """Obtain requirements that can be added to a repository during upgrade. This is used to disallow proposed requirements from being added when they weren't present before. We use a list of allowed requirement additions instead of a list of known bad additions because the whitelist approach is safer and will prevent future, unknown requirements from accidentally being added. """ supported = { b'dotencode', b'fncache', b'generaldelta', requirements.SPARSEREVLOG_REQUIREMENT, requirements.SIDEDATA_REQUIREMENT, requirements.COPIESSDC_REQUIREMENT, requirements.NODEMAP_REQUIREMENT, } for name in compression.compengines: engine = compression.compengines[name] if engine.available() and engine.revlogheader(): supported.add(b'exp-compression-%s' % name) if engine.name() == b'zstd': supported.add(b'revlog-compression-zstd') return supported def preservedrequirements(repo): return set() deficiency = b'deficiency' optimisation = b'optimization' class improvement(object): """Represents an improvement that can be made as part of an upgrade. The following attributes are defined on each instance: name Machine-readable string uniquely identifying this improvement. It will be mapped to an action later in the upgrade process. type Either ``deficiency`` or ``optimisation``. A deficiency is an obvious problem. An optimization is an action (sometimes optional) that can be taken to further improve the state of the repository. description Message intended for humans explaining the improvement in more detail, including the implications of it. For ``deficiency`` types, should be worded in the present tense. For ``optimisation`` types, should be worded in the future tense. upgrademessage Message intended for humans explaining what an upgrade addressing this issue will do. Should be worded in the future tense. """ def __init__(self, name, type, description, upgrademessage): self.name = name self.type = type self.description = description self.upgrademessage = upgrademessage def __eq__(self, other): if not isinstance(other, improvement): # This is what python tell use to do return NotImplemented return self.name == other.name def __ne__(self, other): return not (self == other) def __hash__(self): return hash(self.name) allformatvariant = [] def registerformatvariant(cls): allformatvariant.append(cls) return cls class formatvariant(improvement): """an improvement subclass dedicated to repository format""" type = deficiency ### The following attributes should be defined for each class: # machine-readable string uniquely identifying this improvement. it will be # mapped to an action later in the upgrade process. name = None # message intended for humans explaining the improvement in more detail, # including the implications of it ``deficiency`` types, should be worded # in the present tense. description = None # message intended for humans explaining what an upgrade addressing this # issue will do. should be worded in the future tense. upgrademessage = None # value of current Mercurial default for new repository default = None def __init__(self): raise NotImplementedError() @staticmethod def fromrepo(repo): """current value of the variant in the repository""" raise NotImplementedError() @staticmethod def fromconfig(repo): """current value of the variant in the configuration""" raise NotImplementedError() class requirementformatvariant(formatvariant): """formatvariant based on a 'requirement' name. Many format variant are controlled by a 'requirement'. We define a small subclass to factor the code. """ # the requirement that control this format variant _requirement = None @staticmethod def _newreporequirements(ui): return localrepo.newreporequirements( ui, localrepo.defaultcreateopts(ui) ) @classmethod def fromrepo(cls, repo): assert cls._requirement is not None return cls._requirement in repo.requirements @classmethod def fromconfig(cls, repo): assert cls._requirement is not None return cls._requirement in cls._newreporequirements(repo.ui) @registerformatvariant class fncache(requirementformatvariant): name = b'fncache' _requirement = b'fncache' default = True description = _( b'long and reserved filenames may not work correctly; ' b'repository performance is sub-optimal' ) upgrademessage = _( b'repository will be more resilient to storing ' b'certain paths and performance of certain ' b'operations should be improved' ) @registerformatvariant class dotencode(requirementformatvariant): name = b'dotencode' _requirement = b'dotencode' default = True description = _( b'storage of filenames beginning with a period or ' b'space may not work correctly' ) upgrademessage = _( b'repository will be better able to store files ' b'beginning with a space or period' ) @registerformatvariant class generaldelta(requirementformatvariant): name = b'generaldelta' _requirement = b'generaldelta' default = True description = _( b'deltas within internal storage are unable to ' b'choose optimal revisions; repository is larger and ' b'slower than it could be; interaction with other ' b'repositories may require extra network and CPU ' b'resources, making "hg push" and "hg pull" slower' ) upgrademessage = _( b'repository storage will be able to create ' b'optimal deltas; new repository data will be ' b'smaller and read times should decrease; ' b'interacting with other repositories using this ' b'storage model should require less network and ' b'CPU resources, making "hg push" and "hg pull" ' b'faster' ) @registerformatvariant class sparserevlog(requirementformatvariant): name = b'sparserevlog' _requirement = requirements.SPARSEREVLOG_REQUIREMENT default = True description = _( b'in order to limit disk reading and memory usage on older ' b'version, the span of a delta chain from its root to its ' b'end is limited, whatever the relevant data in this span. ' b'This can severly limit Mercurial ability to build good ' b'chain of delta resulting is much more storage space being ' b'taken and limit reusability of on disk delta during ' b'exchange.' ) upgrademessage = _( b'Revlog supports delta chain with more unused data ' b'between payload. These gaps will be skipped at read ' b'time. This allows for better delta chains, making a ' b'better compression and faster exchange with server.' ) @registerformatvariant class sidedata(requirementformatvariant): name = b'sidedata' _requirement = requirements.SIDEDATA_REQUIREMENT default = False description = _( b'Allows storage of extra data alongside a revision, ' b'unlocking various caching options.' ) upgrademessage = _(b'Allows storage of extra data alongside a revision.') @registerformatvariant class persistentnodemap(requirementformatvariant): name = b'persistent-nodemap' _requirement = requirements.NODEMAP_REQUIREMENT default = False description = _( b'persist the node -> rev mapping on disk to speedup lookup' ) upgrademessage = _(b'Speedup revision lookup by node id.') @registerformatvariant class copiessdc(requirementformatvariant): name = b'copies-sdc' _requirement = requirements.COPIESSDC_REQUIREMENT default = False description = _(b'Stores copies information alongside changesets.') upgrademessage = _( b'Allows to use more efficient algorithm to deal with ' b'copy tracing.' ) @registerformatvariant class removecldeltachain(formatvariant): name = b'plain-cl-delta' default = True description = _( b'changelog storage is using deltas instead of ' b'raw entries; changelog reading and any ' b'operation relying on changelog data are slower ' b'than they could be' ) upgrademessage = _( b'changelog storage will be reformated to ' b'store raw entries; changelog reading will be ' b'faster; changelog size may be reduced' ) @staticmethod def fromrepo(repo): # Mercurial 4.0 changed changelogs to not use delta chains. Search for # changelogs with deltas. cl = repo.changelog chainbase = cl.chainbase return all(rev == chainbase(rev) for rev in cl) @staticmethod def fromconfig(repo): return True @registerformatvariant class compressionengine(formatvariant): name = b'compression' default = b'zlib' description = _( b'Compresion algorithm used to compress data. ' b'Some engine are faster than other' ) upgrademessage = _( b'revlog content will be recompressed with the new algorithm.' ) @classmethod def fromrepo(cls, repo): # we allow multiple compression engine requirement to co-exist because # strickly speaking, revlog seems to support mixed compression style. # # The compression used for new entries will be "the last one" compression = b'zlib' for req in repo.requirements: prefix = req.startswith if prefix(b'revlog-compression-') or prefix(b'exp-compression-'): compression = req.split(b'-', 2)[2] return compression @classmethod def fromconfig(cls, repo): compengines = repo.ui.configlist(b'format', b'revlog-compression') # return the first valid value as the selection code would do for comp in compengines: if comp in util.compengines: return comp # no valide compression found lets display it all for clarity return b','.join(compengines) @registerformatvariant class compressionlevel(formatvariant): name = b'compression-level' default = b'default' description = _(b'compression level') upgrademessage = _(b'revlog content will be recompressed') @classmethod def fromrepo(cls, repo): comp = compressionengine.fromrepo(repo) level = None if comp == b'zlib': level = repo.ui.configint(b'storage', b'revlog.zlib.level') elif comp == b'zstd': level = repo.ui.configint(b'storage', b'revlog.zstd.level') if level is None: return b'default' return bytes(level) @classmethod def fromconfig(cls, repo): comp = compressionengine.fromconfig(repo) level = None if comp == b'zlib': level = repo.ui.configint(b'storage', b'revlog.zlib.level') elif comp == b'zstd': level = repo.ui.configint(b'storage', b'revlog.zstd.level') if level is None: return b'default' return bytes(level) def finddeficiencies(repo): """returns a list of deficiencies that the repo suffer from""" deficiencies = [] # We could detect lack of revlogv1 and store here, but they were added # in 0.9.2 and we don't support upgrading repos without these # requirements, so let's not bother. for fv in allformatvariant: if not fv.fromrepo(repo): deficiencies.append(fv) return deficiencies # search without '-' to support older form on newer client. # # We don't enforce backward compatibility for debug command so this # might eventually be dropped. However, having to use two different # forms in script when comparing result is anoying enough to add # backward compatibility for a while. legacy_opts_map = { b'redeltaparent': b're-delta-parent', b'redeltamultibase': b're-delta-multibase', b'redeltaall': b're-delta-all', b'redeltafulladd': b're-delta-fulladd', } def findoptimizations(repo): """Determine optimisation that could be used during upgrade""" # These are unconditionally added. There is logic later that figures out # which ones to apply. optimizations = [] optimizations.append( improvement( name=b're-delta-parent', type=optimisation, description=_( b'deltas within internal storage will be recalculated to ' b'choose an optimal base revision where this was not ' b'already done; the size of the repository may shrink and ' b'various operations may become faster; the first time ' b'this optimization is performed could slow down upgrade ' b'execution considerably; subsequent invocations should ' b'not run noticeably slower' ), upgrademessage=_( b'deltas within internal storage will choose a new ' b'base revision if needed' ), ) ) optimizations.append( improvement( name=b're-delta-multibase', type=optimisation, description=_( b'deltas within internal storage will be recalculated ' b'against multiple base revision and the smallest ' b'difference will be used; the size of the repository may ' b'shrink significantly when there are many merges; this ' b'optimization will slow down execution in proportion to ' b'the number of merges in the repository and the amount ' b'of files in the repository; this slow down should not ' b'be significant unless there are tens of thousands of ' b'files and thousands of merges' ), upgrademessage=_( b'deltas within internal storage will choose an ' b'optimal delta by computing deltas against multiple ' b'parents; may slow down execution time ' b'significantly' ), ) ) optimizations.append( improvement( name=b're-delta-all', type=optimisation, description=_( b'deltas within internal storage will always be ' b'recalculated without reusing prior deltas; this will ' b'likely make execution run several times slower; this ' b'optimization is typically not needed' ), upgrademessage=_( b'deltas within internal storage will be fully ' b'recomputed; this will likely drastically slow down ' b'execution time' ), ) ) optimizations.append( improvement( name=b're-delta-fulladd', type=optimisation, description=_( b'every revision will be re-added as if it was new ' b'content. It will go through the full storage ' b'mechanism giving extensions a chance to process it ' b'(eg. lfs). This is similar to "re-delta-all" but even ' b'slower since more logic is involved.' ), upgrademessage=_( b'each revision will be added as new content to the ' b'internal storage; this will likely drastically slow ' b'down execution time, but some extensions might need ' b'it' ), ) ) return optimizations def determineactions(repo, deficiencies, sourcereqs, destreqs): """Determine upgrade actions that will be performed. Given a list of improvements as returned by ``finddeficiencies`` and ``findoptimizations``, determine the list of upgrade actions that will be performed. The role of this function is to filter improvements if needed, apply recommended optimizations from the improvements list that make sense, etc. Returns a list of action names. """ newactions = [] for d in deficiencies: name = d._requirement # If the action is a requirement that doesn't show up in the # destination requirements, prune the action. if name is not None and name not in destreqs: continue newactions.append(d) # FUTURE consider adding some optimizations here for certain transitions. # e.g. adding generaldelta could schedule parent redeltas. return newactions def _revlogfrompath(repo, path): """Obtain a revlog from a repo path. An instance of the appropriate class is returned. """ if path == b'00changelog.i': return changelog.changelog(repo.svfs) elif path.endswith(b'00manifest.i'): mandir = path[: -len(b'00manifest.i')] return manifest.manifestrevlog(repo.svfs, tree=mandir) else: # reverse of "/".join(("data", path + ".i")) return filelog.filelog(repo.svfs, path[5:-2]) def _copyrevlog(tr, destrepo, oldrl, unencodedname): """copy all relevant files for `oldrl` into `destrepo` store Files are copied "as is" without any transformation. The copy is performed without extra checks. Callers are responsible for making sure the copied content is compatible with format of the destination repository. """ oldrl = getattr(oldrl, '_revlog', oldrl) newrl = _revlogfrompath(destrepo, unencodedname) newrl = getattr(newrl, '_revlog', newrl) oldvfs = oldrl.opener newvfs = newrl.opener oldindex = oldvfs.join(oldrl.indexfile) newindex = newvfs.join(newrl.indexfile) olddata = oldvfs.join(oldrl.datafile) newdata = newvfs.join(newrl.datafile) with newvfs(newrl.indexfile, b'w'): pass # create all the directories util.copyfile(oldindex, newindex) copydata = oldrl.opener.exists(oldrl.datafile) if copydata: util.copyfile(olddata, newdata) if not ( unencodedname.endswith(b'00changelog.i') or unencodedname.endswith(b'00manifest.i') ): destrepo.svfs.fncache.add(unencodedname) if copydata: destrepo.svfs.fncache.add(unencodedname[:-2] + b'.d') UPGRADE_CHANGELOG = object() UPGRADE_MANIFEST = object() UPGRADE_FILELOG = object() UPGRADE_ALL_REVLOGS = frozenset( [UPGRADE_CHANGELOG, UPGRADE_MANIFEST, UPGRADE_FILELOG] ) def getsidedatacompanion(srcrepo, dstrepo): sidedatacompanion = None removedreqs = srcrepo.requirements - dstrepo.requirements addedreqs = dstrepo.requirements - srcrepo.requirements if requirements.SIDEDATA_REQUIREMENT in removedreqs: def sidedatacompanion(rl, rev): rl = getattr(rl, '_revlog', rl) if rl.flags(rev) & revlog.REVIDX_SIDEDATA: return True, (), {}, 0, 0 return False, (), {}, 0, 0 elif requirements.COPIESSDC_REQUIREMENT in addedreqs: sidedatacompanion = metadata.getsidedataadder(srcrepo, dstrepo) elif requirements.COPIESSDC_REQUIREMENT in removedreqs: sidedatacompanion = metadata.getsidedataremover(srcrepo, dstrepo) return sidedatacompanion def matchrevlog(revlogfilter, entry): """check if a revlog is selected for cloning. In other words, are there any updates which need to be done on revlog or it can be blindly copied. The store entry is checked against the passed filter""" if entry.endswith(b'00changelog.i'): return UPGRADE_CHANGELOG in revlogfilter elif entry.endswith(b'00manifest.i'): return UPGRADE_MANIFEST in revlogfilter return UPGRADE_FILELOG in revlogfilter def _clonerevlogs( ui, srcrepo, dstrepo, tr, deltareuse, forcedeltabothparents, revlogs=UPGRADE_ALL_REVLOGS, ): """Copy revlogs between 2 repos.""" revcount = 0 srcsize = 0 srcrawsize = 0 dstsize = 0 fcount = 0 frevcount = 0 fsrcsize = 0 frawsize = 0 fdstsize = 0 mcount = 0 mrevcount = 0 msrcsize = 0 mrawsize = 0 mdstsize = 0 crevcount = 0 csrcsize = 0 crawsize = 0 cdstsize = 0 alldatafiles = list(srcrepo.store.walk()) # Perform a pass to collect metadata. This validates we can open all # source files and allows a unified progress bar to be displayed. for unencoded, encoded, size in alldatafiles: if unencoded.endswith(b'.d'): continue rl = _revlogfrompath(srcrepo, unencoded) info = rl.storageinfo( exclusivefiles=True, revisionscount=True, trackedsize=True, storedsize=True, ) revcount += info[b'revisionscount'] or 0 datasize = info[b'storedsize'] or 0 rawsize = info[b'trackedsize'] or 0 srcsize += datasize srcrawsize += rawsize # This is for the separate progress bars. if isinstance(rl, changelog.changelog): crevcount += len(rl) csrcsize += datasize crawsize += rawsize elif isinstance(rl, manifest.manifestrevlog): mcount += 1 mrevcount += len(rl) msrcsize += datasize mrawsize += rawsize elif isinstance(rl, filelog.filelog): fcount += 1 frevcount += len(rl) fsrcsize += datasize frawsize += rawsize else: error.ProgrammingError(b'unknown revlog type') if not revcount: return ui.status( _( b'migrating %d total revisions (%d in filelogs, %d in manifests, ' b'%d in changelog)\n' ) % (revcount, frevcount, mrevcount, crevcount) ) ui.status( _(b'migrating %s in store; %s tracked data\n') % ((util.bytecount(srcsize), util.bytecount(srcrawsize))) ) # Used to keep track of progress. progress = None def oncopiedrevision(rl, rev, node): progress.increment() sidedatacompanion = getsidedatacompanion(srcrepo, dstrepo) # Do the actual copying. # FUTURE this operation can be farmed off to worker processes. seen = set() for unencoded, encoded, size in alldatafiles: if unencoded.endswith(b'.d'): continue oldrl = _revlogfrompath(srcrepo, unencoded) if isinstance(oldrl, changelog.changelog) and b'c' not in seen: ui.status( _( b'finished migrating %d manifest revisions across %d ' b'manifests; change in size: %s\n' ) % (mrevcount, mcount, util.bytecount(mdstsize - msrcsize)) ) ui.status( _( b'migrating changelog containing %d revisions ' b'(%s in store; %s tracked data)\n' ) % ( crevcount, util.bytecount(csrcsize), util.bytecount(crawsize), ) ) seen.add(b'c') progress = srcrepo.ui.makeprogress( _(b'changelog revisions'), total=crevcount ) elif isinstance(oldrl, manifest.manifestrevlog) and b'm' not in seen: ui.status( _( b'finished migrating %d filelog revisions across %d ' b'filelogs; change in size: %s\n' ) % (frevcount, fcount, util.bytecount(fdstsize - fsrcsize)) ) ui.status( _( b'migrating %d manifests containing %d revisions ' b'(%s in store; %s tracked data)\n' ) % ( mcount, mrevcount, util.bytecount(msrcsize), util.bytecount(mrawsize), ) ) seen.add(b'm') if progress: progress.complete() progress = srcrepo.ui.makeprogress( _(b'manifest revisions'), total=mrevcount ) elif b'f' not in seen: ui.status( _( b'migrating %d filelogs containing %d revisions ' b'(%s in store; %s tracked data)\n' ) % ( fcount, frevcount, util.bytecount(fsrcsize), util.bytecount(frawsize), ) ) seen.add(b'f') if progress: progress.complete() progress = srcrepo.ui.makeprogress( _(b'file revisions'), total=frevcount ) if matchrevlog(revlogs, unencoded): ui.note( _(b'cloning %d revisions from %s\n') % (len(oldrl), unencoded) ) newrl = _revlogfrompath(dstrepo, unencoded) oldrl.clone( tr, newrl, addrevisioncb=oncopiedrevision, deltareuse=deltareuse, forcedeltabothparents=forcedeltabothparents, sidedatacompanion=sidedatacompanion, ) else: msg = _(b'blindly copying %s containing %i revisions\n') ui.note(msg % (unencoded, len(oldrl))) _copyrevlog(tr, dstrepo, oldrl, unencoded) newrl = _revlogfrompath(dstrepo, unencoded) info = newrl.storageinfo(storedsize=True) datasize = info[b'storedsize'] or 0 dstsize += datasize if isinstance(newrl, changelog.changelog): cdstsize += datasize elif isinstance(newrl, manifest.manifestrevlog): mdstsize += datasize else: fdstsize += datasize progress.complete() ui.status( _( b'finished migrating %d changelog revisions; change in size: ' b'%s\n' ) % (crevcount, util.bytecount(cdstsize - csrcsize)) ) ui.status( _( b'finished migrating %d total revisions; total change in store ' b'size: %s\n' ) % (revcount, util.bytecount(dstsize - srcsize)) ) def _filterstorefile(srcrepo, dstrepo, requirements, path, mode, st): """Determine whether to copy a store file during upgrade. This function is called when migrating store files from ``srcrepo`` to ``dstrepo`` as part of upgrading a repository. Args: srcrepo: repo we are copying from dstrepo: repo we are copying to requirements: set of requirements for ``dstrepo`` path: store file being examined mode: the ``ST_MODE`` file type of ``path`` st: ``stat`` data structure for ``path`` Function should return ``True`` if the file is to be copied. """ # Skip revlogs. if path.endswith((b'.i', b'.d', b'.n', b'.nd')): return False # Skip transaction related files. if path.startswith(b'undo'): return False # Only copy regular files. if mode != stat.S_IFREG: return False # Skip other skipped files. if path in (b'lock', b'fncache'): return False return True def _finishdatamigration(ui, srcrepo, dstrepo, requirements): """Hook point for extensions to perform additional actions during upgrade. This function is called after revlogs and store files have been copied but before the new store is swapped into the original location. """ def _upgraderepo( ui, srcrepo, dstrepo, requirements, actions, revlogs=UPGRADE_ALL_REVLOGS ): """Do the low-level work of upgrading a repository. The upgrade is effectively performed as a copy between a source repository and a temporary destination repository. The source repository is unmodified for as long as possible so the upgrade can abort at any time without causing loss of service for readers and without corrupting the source repository. """ assert srcrepo.currentwlock() assert dstrepo.currentwlock() ui.status( _( b'(it is safe to interrupt this process any time before ' b'data migration completes)\n' ) ) if b're-delta-all' in actions: deltareuse = revlog.revlog.DELTAREUSENEVER elif b're-delta-parent' in actions: deltareuse = revlog.revlog.DELTAREUSESAMEREVS elif b're-delta-multibase' in actions: deltareuse = revlog.revlog.DELTAREUSESAMEREVS elif b're-delta-fulladd' in actions: deltareuse = revlog.revlog.DELTAREUSEFULLADD else: deltareuse = revlog.revlog.DELTAREUSEALWAYS with dstrepo.transaction(b'upgrade') as tr: _clonerevlogs( ui, srcrepo, dstrepo, tr, deltareuse, b're-delta-multibase' in actions, revlogs=revlogs, ) # Now copy other files in the store directory. # The sorted() makes execution deterministic. for p, kind, st in sorted(srcrepo.store.vfs.readdir(b'', stat=True)): if not _filterstorefile(srcrepo, dstrepo, requirements, p, kind, st): continue srcrepo.ui.status(_(b'copying %s\n') % p) src = srcrepo.store.rawvfs.join(p) dst = dstrepo.store.rawvfs.join(p) util.copyfile(src, dst, copystat=True) _finishdatamigration(ui, srcrepo, dstrepo, requirements) ui.status(_(b'data fully migrated to temporary repository\n')) backuppath = pycompat.mkdtemp(prefix=b'upgradebackup.', dir=srcrepo.path) backupvfs = vfsmod.vfs(backuppath) # Make a backup of requires file first, as it is the first to be modified. util.copyfile(srcrepo.vfs.join(b'requires'), backupvfs.join(b'requires')) # We install an arbitrary requirement that clients must not support # as a mechanism to lock out new clients during the data swap. This is # better than allowing a client to continue while the repository is in # an inconsistent state. ui.status( _( b'marking source repository as being upgraded; clients will be ' b'unable to read from repository\n' ) ) scmutil.writereporequirements( srcrepo, srcrepo.requirements | {b'upgradeinprogress'} ) ui.status(_(b'starting in-place swap of repository data\n')) ui.status(_(b'replaced files will be backed up at %s\n') % backuppath) # Now swap in the new store directory. Doing it as a rename should make # the operation nearly instantaneous and atomic (at least in well-behaved # environments). ui.status(_(b'replacing store...\n')) tstart = util.timer() util.rename(srcrepo.spath, backupvfs.join(b'store')) util.rename(dstrepo.spath, srcrepo.spath) elapsed = util.timer() - tstart ui.status( _( b'store replacement complete; repository was inconsistent for ' b'%0.1fs\n' ) % elapsed ) # We first write the requirements file. Any new requirements will lock # out legacy clients. ui.status( _( b'finalizing requirements file and making repository readable ' b'again\n' ) ) scmutil.writereporequirements(srcrepo, requirements) # The lock file from the old store won't be removed because nothing has a # reference to its new location. So clean it up manually. Alternatively, we # could update srcrepo.svfs and other variables to point to the new # location. This is simpler. backupvfs.unlink(b'store/lock') return backuppath def upgraderepo( ui, repo, run=False, optimize=None, backup=True, manifest=None, changelog=None, ): """Upgrade a repository in place.""" if optimize is None: optimize = [] optimize = {legacy_opts_map.get(o, o) for o in optimize} repo = repo.unfiltered() revlogs = set(UPGRADE_ALL_REVLOGS) specentries = ((b'c', changelog), (b'm', manifest)) specified = [(y, x) for (y, x) in specentries if x is not None] if specified: # we have some limitation on revlogs to be recloned if any(x for y, x in specified): revlogs = set() for r, enabled in specified: if enabled: if r == b'c': revlogs.add(UPGRADE_CHANGELOG) elif r == b'm': revlogs.add(UPGRADE_MANIFEST) else: # none are enabled for r, __ in specified: if r == b'c': revlogs.discard(UPGRADE_CHANGELOG) elif r == b'm': revlogs.discard(UPGRADE_MANIFEST) # Ensure the repository can be upgraded. missingreqs = requiredsourcerequirements(repo) - repo.requirements if missingreqs: raise error.Abort( _(b'cannot upgrade repository; requirement missing: %s') % _(b', ').join(sorted(missingreqs)) ) blockedreqs = blocksourcerequirements(repo) & repo.requirements if blockedreqs: raise error.Abort( _( b'cannot upgrade repository; unsupported source ' b'requirement: %s' ) % _(b', ').join(sorted(blockedreqs)) ) # FUTURE there is potentially a need to control the wanted requirements via # command arguments or via an extension hook point. newreqs = localrepo.newreporequirements( repo.ui, localrepo.defaultcreateopts(repo.ui) ) newreqs.update(preservedrequirements(repo)) noremovereqs = ( repo.requirements - newreqs - supportremovedrequirements(repo) ) if noremovereqs: raise error.Abort( _( b'cannot upgrade repository; requirement would be ' b'removed: %s' ) % _(b', ').join(sorted(noremovereqs)) ) noaddreqs = newreqs - repo.requirements - allowednewrequirements(repo) if noaddreqs: raise error.Abort( _( b'cannot upgrade repository; do not support adding ' b'requirement: %s' ) % _(b', ').join(sorted(noaddreqs)) ) unsupportedreqs = newreqs - supporteddestrequirements(repo) if unsupportedreqs: raise error.Abort( _( b'cannot upgrade repository; do not support ' b'destination requirement: %s' ) % _(b', ').join(sorted(unsupportedreqs)) ) # Find and validate all improvements that can be made. alloptimizations = findoptimizations(repo) # Apply and Validate arguments. optimizations = [] for o in alloptimizations: if o.name in optimize: optimizations.append(o) optimize.discard(o.name) if optimize: # anything left is unknown raise error.Abort( _(b'unknown optimization action requested: %s') % b', '.join(sorted(optimize)), hint=_(b'run without arguments to see valid optimizations'), ) deficiencies = finddeficiencies(repo) actions = determineactions(repo, deficiencies, repo.requirements, newreqs) actions.extend( o for o in sorted(optimizations) # determineactions could have added optimisation if o not in actions ) removedreqs = repo.requirements - newreqs addedreqs = newreqs - repo.requirements if revlogs != UPGRADE_ALL_REVLOGS: incompatible = RECLONES_REQUIREMENTS & (removedreqs | addedreqs) if incompatible: msg = _( b'ignoring revlogs selection flags, format requirements ' b'change: %s\n' ) ui.warn(msg % b', '.join(sorted(incompatible))) revlogs = UPGRADE_ALL_REVLOGS def write_labeled(l, label): first = True for r in sorted(l): if not first: ui.write(b', ') ui.write(r, label=label) first = False def printrequirements(): ui.write(_(b'requirements\n')) ui.write(_(b' preserved: ')) write_labeled( newreqs & repo.requirements, "upgrade-repo.requirement.preserved" ) ui.write((b'\n')) removed = repo.requirements - newreqs if repo.requirements - newreqs: ui.write(_(b' removed: ')) write_labeled(removed, "upgrade-repo.requirement.removed") ui.write((b'\n')) added = newreqs - repo.requirements if added: ui.write(_(b' added: ')) write_labeled(added, "upgrade-repo.requirement.added") ui.write((b'\n')) ui.write(b'\n') def printoptimisations(): optimisations = [a for a in actions if a.type == optimisation] optimisations.sort(key=lambda a: a.name) if optimisations: ui.write(_(b'optimisations: ')) write_labeled( [a.name for a in optimisations], "upgrade-repo.optimisation.performed", ) ui.write(b'\n\n') def printupgradeactions(): for a in actions: ui.status(b'%s\n %s\n\n' % (a.name, a.upgrademessage)) if not run: fromconfig = [] onlydefault = [] for d in deficiencies: if d.fromconfig(repo): fromconfig.append(d) elif d.default: onlydefault.append(d) if fromconfig or onlydefault: if fromconfig: ui.status( _( b'repository lacks features recommended by ' b'current config options:\n\n' ) ) for i in fromconfig: ui.status(b'%s\n %s\n\n' % (i.name, i.description)) if onlydefault: ui.status( _( b'repository lacks features used by the default ' b'config options:\n\n' ) ) for i in onlydefault: ui.status(b'%s\n %s\n\n' % (i.name, i.description)) ui.status(b'\n') else: ui.status( _( b'(no feature deficiencies found in existing ' b'repository)\n' ) ) ui.status( _( b'performing an upgrade with "--run" will make the following ' b'changes:\n\n' ) ) printrequirements() printoptimisations() printupgradeactions() unusedoptimize = [i for i in alloptimizations if i not in actions] if unusedoptimize: ui.status( _( b'additional optimizations are available by specifying ' b'"--optimize <name>":\n\n' ) ) for i in unusedoptimize: ui.status(_(b'%s\n %s\n\n') % (i.name, i.description)) return # Else we're in the run=true case. ui.write(_(b'upgrade will perform the following actions:\n\n')) printrequirements() printoptimisations() printupgradeactions() upgradeactions = [a.name for a in actions] ui.status(_(b'beginning upgrade...\n')) with repo.wlock(), repo.lock(): ui.status(_(b'repository locked and read-only\n')) # Our strategy for upgrading the repository is to create a new, # temporary repository, write data to it, then do a swap of the # data. There are less heavyweight ways to do this, but it is easier # to create a new repo object than to instantiate all the components # (like the store) separately. tmppath = pycompat.mkdtemp(prefix=b'upgrade.', dir=repo.path) backuppath = None try: ui.status( _( b'creating temporary repository to stage migrated ' b'data: %s\n' ) % tmppath ) # clone ui without using ui.copy because repo.ui is protected repoui = repo.ui.__class__(repo.ui) dstrepo = hg.repository(repoui, path=tmppath, create=True) with dstrepo.wlock(), dstrepo.lock(): backuppath = _upgraderepo( ui, repo, dstrepo, newreqs, upgradeactions, revlogs=revlogs ) if not (backup or backuppath is None): ui.status( _(b'removing old repository content%s\n') % backuppath ) repo.vfs.rmtree(backuppath, forcibly=True) backuppath = None finally: ui.status(_(b'removing temporary repository %s\n') % tmppath) repo.vfs.rmtree(tmppath, forcibly=True) if backuppath and not ui.quiet: ui.warn( _(b'copy of old repository backed up at %s\n') % backuppath ) ui.warn( _( b'the old repository will not be deleted; remove ' b'it to free up disk space once the upgraded ' b'repository is verified\n' ) )